Basic Simple Type Theory: 42 (Cambridge Tracts in Theoretical Computer Science, Series Number 42)

Hindley, J. Roger

ISBN 10: 0521054222 / ISBN 13: 9780521054225

Published by Cambridge University Press, 2008

About this Item

Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind.

Seller Inventory # rev1925832562

Bibliographic Details

• Title: Basic Simple Type Theory: 42 (Cambridge Tracts in Theoretical Computer Science, Series Number 42)
• Publisher: Cambridge University Press
• Publication Date: 2008
• Language: English
• ISBN 10: 0521054222
• ISBN 13: 9780521054225
• Binding: paperback
• Condition: Like New
• Weight: 360 grams

About this title

Synopsis

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.

From the Back Cover

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.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.The mathematical presentation is rigorous but clear, making it the first book at this level which can be used as an introduction to type theory for computer scientists.