Date of this Version
The correspondence between natural deduction proofs and λ-terms is presented and discussed. A variant of the reducibility method is presented, and a general theorem for establishing properties of typed (first-order) λ-terms is proved. As a corollary, we obtain a simple proof of the Church-Rosser property, and of the strong normalization property, for the typed λ-calculus associated with the system of (intuitionistic) first-order natural deduction, including all the connectors →, ×, +, ∀,∃ and ⊥ (falsity) (with or without η-like rules).
Gallier, Jean H., " On the Correspondence Between Proofs and lambda-Terms" (1993). Technical Reports (CIS). Paper 418.
Date Posted: 10 August 2007