A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance-Reference-Cited by-同舟云学术

A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance

Published:2009 Issue: Volume: Page:5-19
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Abel Andreas,Coquand Thierry,Pagano Miguel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02273-9_3

Reference30 articles.

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

2. 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)

3. Lecture Notes in Computer Science;A. Abel,2008

4. Lecture Notes in Computer Science;A. Abel,2008

5. Abel, A., Coquand, T., Pagano, M.: A modular type-checking algorithm for type theory with singleton types and proof irrelevance (full version) (2009), http://www.tcs.ifi.lmu.de/~abel/singleton.pdf

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

1. Martin-Löf à la Coq;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09

2. Reduction Free Normalisation for a proof irrelevant type of propositions;Logical Methods in Computer Science;2023-07-13

3. A Cubical Language for Bishop Sets;Logical Methods in Computer Science;2022-03-29

4. Logical Relations as Types: Proof-Relevant Parametricity for Program Modules;Journal of the ACM;2021-12-31

5. Implementing a modal dependent type theory;Proceedings of the ACM on Programming Languages;2019-07-26