## Derivation and Computation: Taking the Curry-Howard Correspondence SeriouslyThe two notions of proofs and calculations are intimately related. Proofs can involve calculations, and the algorithm underlying a calculation should be proved correct. This volume explores this key relationship and introduces 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 that codifies number-theoretic function hierarchies. Each of the book's 52 sections ends with a set of exercises, some 200 in total. An appendix contains complete solutions of these exercises. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

DERIVATION SYSTEMS | 3 |

COMPUTATION MECHANISMS | 27 |

THE TYPED COMBINATOR CALCULUS | 48 |

THE TYPED ACALCULUS | 67 |

SUBSTITUTION ALGORITHMS | 82 |

APPLIED ACALCULI | 100 |

MULTIRECURSIVE ARITHMETIC | 137 |

ORDINALS AND ORDINAL NOTATIONS | 170 |

THE TYPED COMBINATOR CALCULUS | 249 |

THE TYPED ACALCULUS | 264 |

E SUBSTITUTION ALGORITHMS | 279 |

F APPLIED ACALCULI | 290 |

G MULTIRECURSIVE ARITHMETIC | 318 |

H ORDINALS AND ORDINAL NOTATIONS | 341 |

HIGHER ORDER RECURSION | 355 |

POSTVIEW | 371 |

HIGHER ORDER RECURSION | 189 |

A DERIVATION SYSTEMS | 215 |

B COMPUTATION MECHANISMS | 234 |

COMMONLY USED SYMBOLS | 377 |

### Other editions - View all

Derivation and Computation: Taking the Curry-Howard Correspondence Seriously H. Simmons No preview available - 2000 |

Derivation and Computation: Taking the Curry-Howard Correspondence Seriously H. Simmons No preview available - 2000 |

### Common terms and phrases

1-placed 1-step reduction A-calculus A-terms abbreviate algorithm proceeds alphabetic variants arbitrary arboreal code arithmetic ASig calculate chapter combinator terms component computation mechanism Consider constants construction context F Curry-Howard correspondence declared in F DEFINITION derivation system example Exercise F h t F is legal finite formulas function F fundamental sequence given H-derivation hence hierarchy holds housing axiom indicated induction hypothesis induction step iterator judgement leaf leap Lemma limit ordinal multi-index mutation natural numbers nominated derivations obtain ordinal arithmetic ordinal notations pair parsing tree possible primitive recursive problem proceeds by recursion produce proof proof theory properties propositional calculus propositional logic redex removal reduction axioms reduction relation renaming identifier replacement required result return a derivation root rules shown snake Solution spec clause standard substitution algorithm Suppose supremum Theorem transition relation tree type erasure untyped verify write