Derivation and computation: taking the Curry-Howard correspondence seriously

New York: Cambridge University Press (2000)
  Copy   BIBTEX

Abstract

Mathematics is about proofs, that is the derivation of correct statements; and calculations, that is the production of results according to well-defined sets of rules. The two notions are intimately related. Proofs can involve calculations, and the algorithm underlying a calculation should be proved correct. The aim of the author is to explore this relationship. The book itself forms an introduction to simple type theory. Starting from the familiar propositional calculus the author develops the central idea of an applied lambda-calculus. This is illustrated by an account of Gödel's T, a system which codifies number-theoretic function hierarchies. Each of the book's 52 sections ends with a set of exercises, some 200 in total. These are designed to help the reader get to grips with the subject, and develop a further understanding. An appendix contains complete solutions of these exercises.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,122

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
45 (#329,731)

6 months
3 (#760,965)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the syntax of logic and set theory.Lucius T. Schoenbaum - 2010 - Review of Symbolic Logic 3 (4):568-599.

Add more citations

References found in this work

No references found.

Add more references