Information and Computation - Semantics of Data Types
A framework for defining logics
Journal of the ACM (JACM)
Handbook of logic in computer science (vol. 2)
Handbook of logic in computer science
Journal of Automated Reasoning
HOL-λσ: an intentional first-order expression of higher-order logic
Mathematical Structures in Computer Science
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Strong normalization of the dual classical sequent calculus
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the Convergence of Reduction-based and Model-based Methods in Proof Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Types for Proofs and Programs
Experimenting with deduction modulo
CADE'11 Proceedings of the 23rd international conference on Automated deduction
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
A theory independent curry-de bruijn-howard correspondence
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Rewriting Computation and Proof
Unbounded proof-length speed-up in deduction modulo
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
25 years of formal proof cultures: some problems, some philosophy, bright future
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
Foundational proof certificates in first-order logic
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
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.