# 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 (categorize this paper) Buy the book \$140.68 new (22% off)   \$151.20 direct from Amazon (17% off)   \$155.41 used (14% off)    Amazon page Call number QA9.54.S67 2007 ISBN(s) 9780444520777   0444520775 Options Edit this record Mark as duplicate Export citation Request removal from index

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 36,003

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)

## References found in this work BETA

No references found.

## Citations of this work BETA

Miscomputation.Nir Fresco & Giuseppe Primiero - 2013 - Philosophy and Technology 26 (3):253-272.
A Computational Interpretation of Conceptivism.Thomas Macaulay Ferguson - 2014 - Journal of Applied Non-Classical Logics 24 (4):333-367.
A Curious Dialogical Logic and its Composition Problem.Sara L. Uckelman, Jesse Alama & Aleks Knoks - 2014 - Journal of Philosophical Logic 43 (6):1065-1100.
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars.Makoto Kanazawa - 2010 - Journal of Logic, Language and Information 19 (2):137-161.