Other available formats:
Looking for an examination copy?
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.
Type theory is a fast-evolving field at the crossroads of logic, computer science and mathematics. This gentle step-by-step introduction is ideal for graduate students and researchers who need to understand the ins and outs of the mathematical machinery, the role of logical rules therein, the essential contribution of definitions and the decisive nature of well-structured proofs. The authors begin with untyped lambda calculus and proceed to several fundamental type systems, including the well-known and powerful Calculus of Constructions. The book also covers the essence of proof checking and proof development, and the use of dependent type theory to formalise mathematics. The only prerequisite is a basic knowledge of undergraduate mathematics. Carefully chosen examples illustrate the theory throughout. Each chapter ends with a summary of the content, some historical context, suggestions for further reading and a selection of exercises to help readers familiarise themselves with the material.Read more
- Gives insight into a variety of type systems and their relative power
- Provides background for the use of proof assistants such as Coq
- Students can test their understanding through 125 end-of-chapter exercises
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: December 2014
- format: Hardback
- isbn: 9781107036505
- length: 466 pages
- dimensions: 254 x 173 x 28 mm
- weight: 0.98kg
- contains: 35 b/w illus. 125 exercises
- availability: Available
Table of Contents
1. Untyped lambda calculus
2. Simply typed lambda calculus
3. Second order typed lambda calculus
4. Types dependent on types
5. Types dependent on terms
6. The Calculus of Constructions
7. The encoding of logical notions in λC
9. Extension of λC with definitions
10. Rules and properties of λD
11. Flag-style natural deduction in λD
12. Mathematics in λD: a first attempt
13. Sets and subsets
14. Numbers and arithmetic in λD
15. An elaborated example
16. Further perspectives
Appendix A. Logic in λD
Appendix B. Arithmetical axioms, definitions and lemmas
Appendix C. Two complete example proofs in λD
Appendix D. Derivation rules for λD
Index of names
Index of technical notions
Index of defined constants
Index of subjects.
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
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister 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 ×