Basic Simple Type Theory
Part of Cambridge Tracts in Theoretical Computer Science
- Author: J. Roger Hindley, University of Wales, Swansea
- Date Published: July 1997
- availability: Available
- format: Hardback
- isbn: 9780521465182
Hardback
Other available formats:
Paperback, eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice. 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 which lies at the heart of every such system. Also featured are two other interesting algorithms that have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making the book at a level which can be used as an introduction to type theory for computer scientists.
Read more- 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
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: July 1997
- format: Hardback
- isbn: 9780521465182
- length: 200 pages
- dimensions: 236 x 157 x 15 mm
- weight: 0.45kg
- contains: 10 b/w illus. 1 table
- availability: Available
Table of Contents
Introduction
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
Bibliography
Table of principal types
Index.
Related Books
related journals
also by this author
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
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 ×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.
×