Skip to content
Register Sign in Wishlist
Derivation and Computation

Derivation and Computation
Taking the Curry-Howard Correspondence Seriously


Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: May 2000
  • availability: Available
  • format: Hardback
  • isbn: 9780521771733

£ 92.00

Add to cart Add to wishlist

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • Mathematics is about proofs, that is the derivation of correct statements; and calculations, that is the production of results according to well-defined sets of rules. The two notions are intimately related. Proofs can involve calculations, and the algorithm underlying a calculation should be proved correct. The aim of the author is to explore this relationship. The book itself forms an introduction to 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 which codifies number-theoretic function hierarchies. Each of the book's 52 sections ends with a set of exercises, some 200 in total. These are designed to help the reader get to grips with the subject, and develop a further understanding. An appendix contains complete solutions of these exercises.

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

    Reviews & endorsements

    'A well-written introduction to proof theory and its connections with computability.' Leon Harkleroad, Zentralblatt für Mathematik

    '… recommended for the student or researcher who's been exposed to bits and pieces of the Curry-Howard correspondence, but wants a sharper idea of the big picture and is willing to work through the exercises to see how the details fit together. Simmons has succeeded in pulling together the main fruits of the correspondence for simple types in a single text. … 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.' ACM SIGACT News

    See more reviews

    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: 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

  • Resources for

    Derivation and Computation

    H. Simmons

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers 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 lecturers 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. Lecturers 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

  • Author

    H. Simmons, University of Manchester

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.