Qualified Types: Theory and Practice
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
A H E abstract machine appears free application Bool Chapter coherence constrained type scheme construction context reduction conversion corresponding datatype defined defNeq derivation described in Section dictionary constructor dictionary for Eq dictionary values doToDne doToList Eq Int eqLList eqLTree equivalent evidence parameters evidence variables example extended Functor Gen(A given Gofer Haskell hence induction instance declarations instance Eq integer language member functions monomorphic obtain OML term optimisation overloaded function P|A H E partial evaluation particular PH-e PIA H E PISA polymorphic predicate assignment predicate entailment predicate sets primEq principal type scheme Proposition qualified types recursive result rules in Figure semantics set of type substitution subtyping superclass syntax-directed system Theorem translation TV(A TV(P type assignment type classes type expressions type inference algorithm type signature type system type variables types tē typing rules Wadler and Blott well-typed X-calculus y:ys