Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Derivation and Computation

Derivation and Computation

Simmons, H.

Hardcover

Series: Cambridge Tracts in Theoretical Computer Science, Book 51

FictionGeneral ComputersGeneral Mathematics

ISBN10: 0521771730
ISBN13: 9780521771733
Publisher: Cambridge University Press
Published: May 18 2000
Pages: 412
Weight: 1.40
Height: 1.06 Width: 6.24 Depth: 9.25
Language: English
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.

Also in

Fiction

View All