![]() |
CiteULike | ![]() |
eporreca's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics) |
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThe 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,<br>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.<br><br>The isomorphism has many aspects, even at the syntactic level:<br>formulas correspond to types, proofs correspond to terms, provability corresponds to inhabitation, proof normalization corresponds to term reduction, etc.<br><br>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<br>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).<br><br>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.<P><br><br>Key features<BR><br>- The Curry-Howard Isomorphism treated as common theme<BR><br>- Reader-friendly introduction to two complementary subjects: Lambda-calculus and constructive logics<BR><br>- Thorough study of the connection between calculi and logics<BR><br>- Elaborate study of classical logics and control operators<BR><br>- Account of dialogue games for classical and intuitionistic logic<BR><br>- Theoretical foundations of computer-assisted reasoning<P><br><br>· The Curry-Howard Isomorphism treated as the common theme.<br>· Reader-friendly introduction to two complementary subjects: lambda-calculus and constructive logics <br>· Thorough study of the connection between calculi and logics.<br>· Elaborate study of classical logics and control operators.<br>· Account of dialogue games for classical and intuitionistic logic.<br>· Theoretical foundations of computer-assisted reasoning
BibTeX record
RIS record