Basic Simple Type Theory

Basic Simple Type Theory

by J. Roger Hindley
ISBN-10:
0521465184
ISBN-13:
9780521465182
Pub. Date:
07/31/1997
Publisher:
Cambridge University Press
ISBN-10:
0521465184
ISBN-13:
9780521465182
Pub. Date:
07/31/1997
Publisher:
Cambridge University Press
Basic Simple Type Theory

Basic Simple Type Theory

by J. Roger Hindley

Hardcover

$126.0
Current price is , Original price is $126.0. You
$126.00 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Overview

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.

Product Details

ISBN-13: 9780521465182
Publisher: Cambridge University Press
Publication date: 07/31/1997
Series: Cambridge Tracts in Theoretical Computer Science , #42
Pages: 200
Product dimensions: 6.18(w) x 9.29(h) x 0.59(d)

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.

What People are Saying About This

From the Publisher

"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

From the B&N Reads Blog

Customer Reviews