Elsevier (2006)

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)
Reprint years 2007
Buy this book $109.63 used (36% off)   $135.00 new (21% off)   $170.00 from Amazon    Amazon page
Call number QA9.54.S67 2007
ISBN(s) 9780444520777   0444520775   0444545964
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 63,360
External links

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)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Proof-Theoretic Semantics.Peter Schroeder-Heister - forthcoming - Stanford Encyclopedia of Philosophy.
A Computational Interpretation of Conceptivism.Thomas Macaulay Ferguson - 2014 - Journal of Applied Non-Classical Logics 24 (4):333-367.
Reductio Ad Absurdum From a Dialogical Perspective.Catarina Dutilh Novaes - 2016 - Philosophical Studies 173 (10):2605-2628.
Miscomputation.Nir Fresco & Giuseppe Primiero - 2013 - Philosophy and Technology 26 (3):253-272.

View all 19 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
45 ( #237,471 of 2,448,926 )

Recent downloads (6 months)
1 ( #443,144 of 2,448,926 )

How can I increase my downloads?

Downloads

My notes