Abstract
Brouwer, Heyting, and Kolmogorov have proposed to define constructive proofs as algorithms, for instance, a proof of A ⇒B as an algorithm taking proofs of A as input and returning proofs of B as output. Curry, De Bruijn, and Howard have developed this idea further. First, they have proposed to express these algorithms in the lambda-calculus, writing for instance λf A ⇒A ⇒B λx A (f x x) for the proof of the proposition (A ⇒A ⇒B) ⇒A ⇒B taking a proof f of A ⇒A ⇒B and a proof x of A as input and returning the proof of B obtained by applying f to x twice. Then, they have remarked that, as proofs of A ⇒B map proofs of A to proofs of B, their type \(\mbox{\em proof}(A \Rightarrow B)\) is \(\mbox{\em proof}(A) \rightarrow \mbox{\em proof}(B)\). Thus the function proof mapping propositions to the type of their proofs is a morphism transforming the operation ⇒ into the operation →. In the same way, this morphism transforms cut-reduction in proofs into beta-reduction in lambda-terms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Assaf, A.: Translating HOL in the lambda-Pi-calculus modulo, Master thesis (in preparation, 2012)
Boespflug, M.: Conception d’un noyau de vérification de preuves pour le lambda-Pi-calcul modulo, Doctoral thesis, École polytechnique (2011)
Boespflug, M., Carbonneaux, Q., Hermant, O.: The lambda-Pi calculus modulo as a universal proof language. In: Second International Workshop on Proof Exchange for Theorem Proving (2012)
Boespflug, M., Burel, G.: CoqInE: Translating the Calculus of inductive constructions into the lambda-Pi-calculus modulo. In: Second International Workshop on Proof Exchange for Theorem Proving (2012)
Cousineau, D., Dowek, G.: Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol. 4583, pp. 102–117. Springer, Heidelberg (2007)
Dowek, G., Hardin, T., Kirchner, C.: Theorem proving modulo. Journal of Automated Reasoning 31, 33–72 (2003)
Dowek, G., Werner, B.: Proof normalization modulo. The Journal of Symbolic Logic 68(4), 1289–1316 (2003)
Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. The Journal of the ACM 40(1) (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dowek, G. (2012). A Theory Independent Curry-De Bruijn-Howard Correspondence. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31585-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-31585-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31584-8
Online ISBN: 978-3-642-31585-5
eBook Packages: Computer ScienceComputer Science (R0)