The Leading eBooks Store Online
for your Apple or Android device, Nook, Kobo, PC, Mac, Sony Reader...
Lectures on the Curry-Howard Isomorphism
- iPad
- PC
- e-readers with Adobe Digital Editions installed
- Mac
This book is available for the following devices:
- iPad
- Windows
- Mac
- Sony Reader
- Cool-er Reader
- Nook
- Kobo Reader
- iRiver Story
You can also read this book online in eb20 format without having to download anything.
Printing
Copy/Paste
Read Aloud
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
- Academic > Mathematics > General > Logic, Symbolic and mathematical
- Academic > Mathematics > General > Combinatory logic
- Academic > Mathematics > General > Proof theory
- Academic > Mathematics > Instruments and machines
- Academic > Mathematics > Analytic mechanics
- Academic > Logic > Combinatory logic
- Academic > Logic > Proof theory
- Academic > Computer Science
- Mathematics > Logic
- Computers > Information Technology