Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
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.Read more
- 200 exercises, all with solutions
- Suitable as the main course text, or as a supplementary text, or for self study
- Covers some material not adequately dealt with elsewhere, giving a broad view of interrelated topics
Reviews & endorsements
"The book is rather snappily written. It's informal, breezy - sometimes positively jaunty - and always directed to the reader. It can't be emphasized enough that the great thing about this book is its many well-chosen, completely solved exercises. This alone makes it a valuable text, especially for self-study."
Robert J. Irwin, Hamilton College for SIGACT News
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: May 2000
- format: Hardback
- isbn: 9780521771733
- length: 412 pages
- dimensions: 236 x 158 x 26 mm
- weight: 0.77kg
- contains: 23 tables 193 exercises
- availability: Available
Table of Contents
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
Commonly used symbols
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact firstname.lastname@example.org.
Sorry, this resource is locked