Lectures on the Curry-Howard Isomorphism
Elsevier (2007)
| Abstract | The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed lambda-calculus, first-order logic corresponds to dependent types, second-order logic corresponds to polymorphic types, sequent calculus is related to explicit substitution, etc. The isomorphism has many aspects, even at the syntactic level: formulas correspond to types, proofs correspond to terms, provability corresponds to inhabitation, proof normalization corresponds to term reduction, etc. But there is more to the isomorphism than this. For instance, it is an old idea---due to Brouwer, Kolmogorov, and Heyting---that a constructive proof of an implication is a procedure that transforms proofs of the antecedent into proofs of the succedent; the Curry-Howard isomorphism gives syntactic representations of such procedures. The Curry-Howard isomorphism also provides theoretical foundations for many modern proof-assistant systems (e.g. Coq). This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic. Key features - The Curry-Howard Isomorphism treated as common theme - Reader-friendly introduction to two complementary subjects: Lambda-calculus and constructive logics - Thorough study of the connection between calculi and logics - Elaborate study of classical logics and control operators - Account of dialogue games for classical and intuitionistic logic - Theoretical foundations of computer-assisted reasoning · The Curry-Howard Isomorphism treated as the common theme. · Reader-friendly introduction to two complementary subjects: lambda-calculus and constructive logics · Thorough study of the connection between calculi and logics. · Elaborate study of classical logics and control operators. · Account of dialogue games for classical and intuitionistic logic. · Theoretical foundations of computer-assisted reasoning | |||||||||
| Keywords | Curry-Howard isomorphism Lambda calculus Proof theory | |||||||||
| Categories | ||||||||||
| Buy the book | $120.75 new (27% off) $124.75 direct from Amazon (25% off) $146.44 used (12% off) Amazon page | |||||||||
| Call number | QA9.54.S67 2007 | |||||||||
| ISBN(s) | 9780444520777 0444520775 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesKen-etsu Fujita (1998). On Proof Terms and Embeddings of Classical Substructural Logics. Studia Logica 61 (2):199-221.
H. B. Curry & R. Feys (1995). Basic Theory of Functionality. Analogies with Propositional Algebra. In Philippe De Groote (ed.), The Curry-Howard Isomorphism. Academia.
Frank A. Bäuerle, David Albrecht, John N. Crossley & John S. Jeavons (1998). Curry-Howard Terms for Linear Logic. Studia Logica 61 (2):223-235.
G. E. Mint͡s (2000). A Short Introduction to Intuitionistic Logic. Kluwer Academic / Plenum Publishers.
Simona Ronchi della Rocca & Luca Roversi (1997). Lambda Calculus and Intuitionistic Linear Logic. Studia Logica 59 (3):417-448.
Sachio Hirokawa, Yuichi Komori & Misao Nagayama (2000). A Lambda Proof of the P-W Theorem. Journal of Symbolic Logic 65 (4):1841-1849.
Simona Ronchi Della Rocca & Luca Roversi (1997). Lambda Calculus and Intuitionistic Linear Logic. Studia Logica 59 (3):417-448.
Harold Simmons (2000). Derivation and Computation: Taking the Curry-Howard Correspondence Seriously. Cambridge University Press.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads19 ( #64,404 of 549,117 )Recent downloads (6 months)2 ( #37,390 of 549,117 )How can I increase my downloads? |
My notes
Discussion
