Derivation and Computation: Taking the Curry-Howard Correspondence Seriously / Edition 1

Derivation and Computation: Taking the Curry-Howard Correspondence Seriously / Edition 1

by H. Simmons
ISBN-10:
0521771730
ISBN-13:
9780521771733
Pub. Date:
05/18/2000
Publisher:
Cambridge University Press
ISBN-10:
0521771730
ISBN-13:
9780521771733
Pub. Date:
05/18/2000
Publisher:
Cambridge University Press
Derivation and Computation: Taking the Curry-Howard Correspondence Seriously / Edition 1

Derivation and Computation: Taking the Curry-Howard Correspondence Seriously / Edition 1

by H. Simmons

Hardcover

$160.0
Current price is , Original price is $160.0. You
$160.00 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE

    Your local store may have stock of this item.

  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.


Overview

The 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.

Product Details

ISBN-13: 9780521771733
Publisher: Cambridge University Press
Publication date: 05/18/2000
Series: Cambridge Tracts in Theoretical Computer Science , #51
Edition description: New Edition
Pages: 412
Product dimensions: 6.22(w) x 9.29(h) x 1.02(d)

Table of Contents

Introduction; Preview; Part I. Development and Exercises: 1. Derivation systems; 2. Computation mechanisms; 3. The typed combinator calculus; 4. The typed l-calculus; 5. Substitution algorithms; 6. Applied l-calculi; 7. Multi-recursive arithmetic; 8. Ordinals and ordinal notation; 9. Higher order recursion; Part II. Solutions: A. Derivation systems; B. Computation mechanisms; C. The typed combinator calculus; D. The typed l-calculus; E. Substitution algorithms; F. Applied l-calculi; G. Multi-recursive arithmetic; H. Ordinals and ordinal notation; I. Higher order recursion; Postview; Bibliography; Commonly used symbols; Index.
From the B&N Reads Blog

Customer Reviews