Lectures on the Curry-Howard Isomorphism

Lectures on the Curry-Howard Isomorphism
Author :
Publisher : Elsevier
Total Pages : 457
Release :
ISBN-10 : 9780080478920
ISBN-13 : 0080478921
Rating : 4/5 (921 Downloads)

Book Synopsis Lectures on the Curry-Howard Isomorphism by : Morten Heine Sørensen

Download or read book Lectures on the Curry-Howard Isomorphism written by Morten Heine Sørensen and published by Elsevier. This book was released on 2006-07-04 with total page 457 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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 transformsproofs 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


Lectures on the Curry-Howard Isomorphism Related Books

Lectures on the Curry-Howard Isomorphism
Language: en
Pages: 457
Authors: Morten Heine Sørensen
Categories: Mathematics
Type: BOOK - Published: 2006-07-04 - Publisher: Elsevier

GET EBOOK

The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found
The Curry-Howard Isomorphism
Language: en
Pages: 372
Authors: Philippe De Groote
Categories: Mathematics
Type: BOOK - Published: 1995 - Publisher:

GET EBOOK

Derivation and Computation
Language: en
Pages: 414
Authors: H. Simmons
Categories: Computers
Type: BOOK - Published: 2000-05-18 - Publisher: Cambridge University Press

GET EBOOK

An introduction to simple type theory, containing 200 exercises with complete solutions.
Proofs and Types
Language: en
Pages: 192
Authors: Jean-Yves Girard
Categories: Computers
Type: BOOK - Published: 1989-03-23 - Publisher: Cambridge University Press

GET EBOOK

This text is an outgrowth of notes prepared by J. Y. Girard for a course at the University of Paris VII. It deals with the mathematical background of the applic
A Short Introduction to Intuitionistic Logic
Language: en
Pages: 130
Authors: Grigori Mints
Categories: Computers
Type: BOOK - Published: 2000-10-31 - Publisher: Springer Science & Business Media

GET EBOOK

Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs to make the material more