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 firstname.lastname@example.org 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 has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.
These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.
If you are having problems accessing these resources please email email@example.com
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×