Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory-Reference-Cited by-同舟云学术

Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory

Published: Issue: Volume: Page:29-56
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Abel Andreas,Coquand Thierry,Dybjer Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70594-9_4.pdf

Reference29 articles.

1. Electr. Notes in Theor. Comp. Sci;A. Abel,2007

2. Abel, A., Coquand, T.: Untyped algorithmic equality for Martin-Löf’s logical framework with surjective pairs. Fundam. Inform. 77(4), 345–395 (2005); TLCA 2005 special issue

3. Altenkirch, T., Chapman, J.: Big step normalisation. Draft, available on the authors’ homepages (2008)

4. Abel, A., Coquand, T., Dybjer, P.: Normalization by evaluation for Martin-Löf Type Theory with typed equality judgements. In: Proc. of the 22nd IEEE Symp. on Logic in Computer Science (LICS 2007), pp. 3–12. IEEE Computer Soc. Press, Los Alamitos (2007)

5. Abel, A., Coquand, T., Dybjer, P.: A semantic βη-equality algorithm for Martin-Löf Type Theory (extended version). Technical report, Ludwig-Maximilians-University Munich (2008), http://www.tcs.ifi.lmu.de/~abel/semEqTR.pdf

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Focusing on Refinement Typing;ACM Transactions on Programming Languages and Systems;2023-12-20

2. Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types;Proceedings of the ACM on Programming Languages;2019-01-02

3. Let Arguments Go First;Programming Languages and Systems;2018

4. Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types;Electronic Proceedings in Theoretical Computer Science;2014-06-05

5. Complete and easy bidirectional typechecking for higher-rank polymorphism;ACM SIGPLAN Notices;2013-11-12