Get Free Shipping on orders over $79
Qualified Types : Theory and Practice - No Information Available

Qualified Types

Theory and Practice

By: No Information Available

Paperback | 19 December 2003

At a Glance

Paperback


RRP $75.95

$71.75

or 4 interest-free payments of $17.94 with

 or 

Ships in 5 to 7 business days

This book describes the use of qualified types to provide a general framework for the combination of polymorphism and overloading. For example, qualified types can be viewed as a generalization of type classes in the functional language Haskell and the theorem prover Isabelle. These in turn are extensions of equality types in Standard ML. Other applications of qualified types include extensible records and subtyping. Using a general formulation of qualified types, the author extends the Damas/Milner type inference algorithm to support qualified types, which in turn specifies the set of all possible types for any term. In addition, he describes a new technique for establishing suitable coherence conditions that guarantee the same semantics for all possible translations of a given term. Practical issues that arise in concrete implementations are also discussed, concentrating in particular on the implementation of overloading in Haskell and Gofer, a small functional programming system developed by the author.
Industry Reviews
"This is a well-written book, describing the use of qualified types in functional programming languages. The author gives a good brief introduction to the use of types in programming languages, leading quite naturally to the issues of polymorphism and overloading. He then proposes the use of so-called 'qualified types' as a way of introducing a general mechanism for overloading." Herman Geuvers, Mathematical Reviews "...I encourage you to read this exemplar of computer science research and the appropriate presentation thereof. The writing is excellent, the typesetting is perfect, and the extremely fine point that Jones has made will encourage scholarly contemplation about the nature of type systems." David B. Benson, Computing Reviews

More in Mathematical Theory of Computation

AI Engineering : Building Applications with Foundation Models - Chip Huyen
Discrete Mathematics for Computing : Grassroots - Peter Grossman
Crypto Engine Design : Cyber Shorts - Wen-Long Chin
Crypto Engine Design : Cyber Shorts - Wen-Long Chin
AI Value Creators : Beyond the Generative AI User Mindset - Dario Gil