Skip to content
Register Sign in Wishlist

Type Theory and Formal Proof
An Introduction

CAD$102.95 (P)

  • Date Published: December 2014
  • availability: Available
  • format: Hardback
  • isbn: 9781107036505

CAD$ 102.95 (P)

Add to cart Add to wishlist

Other available formats:

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 providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • 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
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • 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

    Greek alphabet
    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
    8. Definitions
    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.

  • Resources for

    Type Theory and Formal Proof

    Rob Nederpelt, Herman Geuvers

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *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

  • Authors

    Rob Nederpelt, Technische Universiteit Eindhoven, The Netherlands
    Rob Nederpelt was Lecturer in Logic for Computer Science until his retirement. Currently he is a guest researcher in the Faculty of Mathematics and Computer Science at Eindhoven University of Technology, The Netherlands.

    Herman Geuvers, Radboud Universiteit Nijmegen
    Herman Geuvers is Professor in Theoretical Informatics at the Radboud University Nijmegen, and Professor in Proving with Computer Assistance at Eindhoven University of Technology, both in The Netherlands.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.