| Derivation and Computation Contributor(s): Simmons, H. (Author) |
|
 |
ISBN: 0521771730 ISBN-13: 9780521771733 Publisher: Cambridge University Press OUR PRICE: $152.00 Product Type: Hardcover Published: May 2000 Annotation: 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 Godel'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. |
| Additional Information |
| BISAC Categories: - Mathematics | Logic - Computers - Mathematics | Combinatorics |
| Dewey: 511.3 |
| LCCN: 99044953 |
| Series: Cambridge Tracts in Theoretical Computer Science (Hardcover) |
| Physical Information: 1.06" H x 6.24" W x 9.25" (1.4 lbs) 412 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |