Preview this item
Preview this item
Checking...

# Lectures on the Curry-Howard isomorphism

Publisher: Amsterdam ; Boston [MA] : Elsevier, 2006. Studies in logic and the foundations of mathematics, v. 149 eBook : Document : English : 1st edView all editions and formats 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. P 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 reasoningP 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.  Read more... (not yet rated) 0 with reviews - Be the first.

## Find a copy in the library

Finding libraries that hold this item...

## Details

Genre/Form: Electronic books Document, Internet resource Internet Resource, Computer File 9780444520777 0444520775 731730855 1 online resource (Online-Datei.). Preface -- -- Acknowledgements -- -- 1. Typefree lambda-calculus -- -- 2. Intuitionistic logic -- -- 3. Simply typed lambdacalculus -- -- 4. The Curry-Howard isomorphism -- -- 5. Proofs as combinators -- -- 6. Classical logic and control operators -- -- 7. Sequent calculus -- -- 8. First-order logic -- -- 9. First-order arithmetic -- -- 10. G̲del's system T -- -- 11. Second-order logic and polymorphism -- -- 12. Second-order arithmetic -- -- 13. Dependent types -- -- 14. Pure type systems and the lambda-cube -- -- A Mathematical Background -- -- B Solutions and hints to selected exercises -- -- Bibliography -- -- IndexP. Studies in logic and the foundations of mathematics, v. 149 Morten Heine Sørensen, Paweł Urzyczyn.

### Abstract:

The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as in type theory. The isomorphism has many  Read more...

## Reviews

User-contributed reviews

Be the first.

## Similar Items

### Related Subjects:(5)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

### Primary Entity

<http://www.worldcat.org/oclc/731730855> # Lectures on the Curry-Howard isomorphism
a schema:CreativeWork, schema:Book, schema:MediaObject ;
library:oclcnum "731730855" ;
library:placeOfPublication <http://id.loc.gov/vocabulary/countries/ne> ;
library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/26546410#Place/boston_ma> ; # Boston MA
library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/26546410#Place/amsterdam> ; # Amsterdam
schema:about <http://id.worldcat.org/fast/885411> ; # Curry-Howard isomorphism
schema:about <http://id.worldcat.org/fast/991011> ; # Lambda calculus
schema:about <http://id.worldcat.org/fast/1078942> ; # Proof theory
schema:bookEdition "1st ed." ;
schema:bookFormat schema:EBook ;
schema:datePublished "2006" ;
schema:description "Preface -- -- Acknowledgements -- -- 1. Typefree lambda-calculus -- -- 2. Intuitionistic logic -- -- 3. Simply typed lambdacalculus -- -- 4. The Curry-Howard isomorphism -- -- 5. Proofs as combinators -- -- 6. Classical logic and control operators -- -- 7. Sequent calculus -- -- 8. First-order logic -- -- 9. First-order arithmetic -- -- 10. G̲del's system T -- -- 11. Second-order logic and polymorphism -- -- 12. Second-order arithmetic -- -- 13. Dependent types -- -- 14. Pure type systems and the lambda-cube -- -- A Mathematical Background -- -- B Solutions and hints to selected exercises -- -- Bibliography -- -- IndexP." ;
schema:description "Elaborate study of classical logics and control operators. Account of dialogue games for classical and intuitionistic logic. Theoretical foundations of computer-assisted reasoning." ;
schema:description "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.-" ;
schema:description "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. P 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 reasoningP 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.-" ;
schema:exampleOfWork <http://worldcat.org/entity/work/id/26546410> ;
schema:genre "Electronic books" ;
schema:inLanguage "en" ;
schema:isPartOf <http://experiment.worldcat.org/entity/work/data/26546410#Series/studies_in_logic_and_the_foundations_of_mathematics> ; # Studies in logic and the foundations of mathematics ;
schema:name "Lectures on the Curry-Howard isomorphism" ;
schema:productID "731730855" ;
schema:publication <http://www.worldcat.org/title/-/oclc/731730855#PublicationEvent/amsterdam_boston_ma_elsevier_2006> ;
schema:publisher <http://experiment.worldcat.org/entity/work/data/26546410#Agent/elsevier> ; # Elsevier
schema:url <http://www.ub.unibas.ch/index.php?id=1439> ;
schema:url <http://www.sciencedirect.com/science/publication?issn=0049237X&volume=149> ;
schema:workExample <http://worldcat.org/isbn/9780444520777> ;
wdrs:describedby <http://www.worldcat.org/title/-/oclc/731730855> ;
.

### Related Entities

<http://experiment.worldcat.org/entity/work/data/26546410#Series/studies_in_logic_and_the_foundations_of_mathematics> # Studies in logic and the foundations of mathematics ;
a bgn:PublicationSeries ;
schema:hasPart <http://www.worldcat.org/oclc/731730855> ; # Lectures on the Curry-Howard isomorphism
schema:name "Studies in logic and the foundations of mathematics ;" ;
.

<http://experiment.worldcat.org/entity/work/data/26546410#Topic/programmeren_computers> # Programmeren--(computers)
a schema:Intangible ;
schema:name "Programmeren--(computers)" ;
.

<http://id.worldcat.org/fast/1078942> # Proof theory
a schema:Intangible ;
schema:name "Proof theory" ;
.

<http://id.worldcat.org/fast/885411> # Curry-Howard isomorphism
a schema:Intangible ;
schema:name "Curry-Howard isomorphism" ;
.

<http://id.worldcat.org/fast/991011> # Lambda calculus
a schema:Intangible ;
schema:name "Lambda calculus" ;
.

<http://worldcat.org/isbn/9780444520777>
a schema:ProductModel ;
schema:isbn "0444520775" ;
schema:isbn "9780444520777" ;
.

<http://www.ub.unibas.ch/index.php?id=1439>
rdfs:comment "Uni Basel: Zugriffsinformationen" ;
.

Content-negotiable representations