Abstract
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calculus modulo. We show in this paper that this simple extension is surprisingly expressive and, in particular, that all functional Pure Type Systems, such as the system F, or the Calculus of Constructions, can be embedded in it. And, moreover, that this embedding is conservative under termination hypothesis. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Cousineau, D., & Dowek, G. (2007). Embedding pure type systems in the lambda-Pi-calculus modulo. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4583 LNCS, pp. 102–117). Springer Verlag. https://doi.org/10.1007/978-3-540-73228-0_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
