Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo-Reference-Cited by-同舟云学术

Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo

Published:2007 Issue: Volume: Page:102-117
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cousineau Denis,Dowek Gilles

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-73228-0_9

Reference15 articles.

1. Barendregt, H.: Lambda calculi with types. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, pp. 117–309. Oxford University Press, Oxford (1992)

2. Berardi, S.: Towards a mathematical analysis of the Coquand-Huet Calculus of Constructions and the other systems in Barendregt’s cube (manuscript 1988)

3. Blanqui, F.: Definitions by rewriting in the Calculus of Constructions. Mathematical Structures in Computer Science 15(1), 37–92 (2005)

4. Coquand, T., Huet, G.: The Calculus of Constructions. Information and Computation 76, 95–120 (1988)

5. Cousineau, D.: Un plongement conservatif des Pure Type Systems dans le lambda Pi modulo, Master Parisien de Recherche en Informatique (2006)

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

1. Kuroda's Translation for the λΠ-Calculus Modulo Theory and Dedukti;Electronic Proceedings in Theoretical Computer Science;2024-07-08

2. Proofs for Free in the λΠ-Calculus Modulo Theory;Electronic Proceedings in Theoretical Computer Science;2024-07-08

3. From Rewrite Rules to Axioms in the $$\lambda \varPi $$-Calculus Modulo Theory;Lecture Notes in Computer Science;2024

4. Confluence of Terminating Rewriting Computations;The French School of Programming;2023-10-11

5. Finitary Type Theories With and Without Contexts;Journal of Automated Reasoning;2023-10-07