Sold Out
Book Categories |
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 Index
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionLectures on the Curry-Howard Isomorphism
X
This Item is in Your InventoryLectures on the Curry-Howard Isomorphism
X
You must be logged in to review the productsX
X
X
Add Lectures on the Curry-Howard Isomorphism, 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 lambd, Lectures on the Curry-Howard Isomorphism to the inventory that you are selling on WonderClubX
X
Add Lectures on the Curry-Howard Isomorphism, 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 lambd, Lectures on the Curry-Howard Isomorphism to your collection on WonderClub |