Skip to content
Register Sign in Wishlist

Basic Simple Type Theory

$47.99 (P)

Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: January 2008
  • availability: Available
  • format: Paperback
  • isbn: 9780521054225

$ 47.99 (P)

Add to cart Add to wishlist

Other available formats:
Hardback, eBook

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

Product filter button
About the Authors
  • Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. By concentrating on the principles that make the theory work in practice, the author covers all the key ideas without getting involved in the complications of more advanced systems. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm that lies at the heart of every such system. Also featured are two other interesting algorithms that until now have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making it the first book at this level that can be used as an introduction to type theory for computer scientists.

    • The approach is via type-assignment, which makes it applicable to polymorphic systems and languages
    • Contains a full treatment of the type-checking algorithm by one of the pioneer developers of that algorithm
    • Contains very clear accounts of two other interesting algorithms which are otherwise buried in the technical literature
    Read more

    Reviews & endorsements

    "This is an excellent introduction to type theory. It doesn't bog the reader down in any of the messy details of the proofs and yet it provides many of the most interesting results in the field....Overall, it is a great book for someone who wants to get his feet wet in type theory, but doesn't want to get in over his head." Sigact News

    "...the book makes useful and stimulating reading and it will be an essential tool for computer scientists working in type theory and related areas." Mathematical Reviews

    The proofs in this book are given in great detail, and still the author succeeds in writing the book in a clear but not too technical style. It is easy and pleasurable to read this book." Journal of Symbolic Logic

    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: January 2008
    • format: Paperback
    • isbn: 9780521054225
    • length: 200 pages
    • dimensions: 228 x 151 x 11 mm
    • weight: 0.31kg
    • contains: 10 b/w illus. 1 table
    • availability: Available
  • Table of Contents

    1. The type-free λ-calculus
    2. Assigning types to terms
    3. The principal-type algorithm
    4. Type assignment with equality
    5. A version using typed terms
    6. The correspondence with implication
    7. The converse principal-type algorithm
    8. Counting a type's inhabitants
    9. Technical details
    Answers to starred exercises
    Table of principal types

  • Author

    J. Roger Hindley, University of Wales, Swansea

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.