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.
Publisher: Cambridge University Press
Number of pages: 200
Weight: 310 g
Dimensions: 228 x 151 x 11 mm
"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