## Qualified Types: Theory and PracticeThis 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.

### Contents

III | 1 |

IV | 2 |

V | 3 |

VI | 4 |

VIII | 6 |

X | 8 |

XII | 9 |

XIII | 10 |

LIX | 63 |

LX | 64 |

LXI | 65 |

LXII | 67 |

LXIII | 68 |

LXIV | 69 |

LXV | 70 |

LXVI | 71 |

XV | 11 |

XVI | 13 |

XVII | 16 |

XVIII | 17 |

XXI | 18 |

XXIII | 19 |

XXIV | 21 |

XXV | 22 |

XXVII | 23 |

XXX | 25 |

XXXIII | 26 |

XXXIV | 27 |

XXXV | 29 |

XXXVII | 31 |

XXXVIII | 32 |

XXXIX | 33 |

XL | 35 |

XLI | 36 |

XLII | 37 |

XLIII | 39 |

XLIV | 40 |

XLV | 43 |

XLVI | 44 |

XLVII | 46 |

XLVIII | 48 |

XLIX | 49 |

LI | 50 |

LII | 51 |

LIII | 53 |

LIV | 57 |

LV | 58 |

LVI | 60 |

LVII | 62 |

### Common terms and phrases

A-calculus abstract machine appears free application Bool Chapter coherence constrained type scheme construction context reduction conversion corresponding datatype defined derivation described in Section dictionary constructor dictionary for Eq dictionary values doToList doToOne Eq Int eqDList eqDTree equivalent evaluation evidence parameters evidence values evidence variables example extended Functor Gen(A given Gofer Haskell hence induction instance declarations instance Eq integer labels language member functions monomorphic obtain OML term optimisation overloaded function parametric polymorphism partial evaluation particular polymorphic predicate assignment predicate entailment predicate sets primEqlnt principal type scheme properties Proposition qualified types recursive result rules in Figure semantics set of type substitution subtyping superclass syntax-directed system system of type Theorem translation type assignment type classes type expressions type inference algorithm Type Polymorphism type signature type system type variables typing rules Wadler and Blott well-typed x:xs y:ys

### References to this book

Proceedings of the 2001 ACM SIGPLAN--SIGSOFT Workshop on Program Analysis ... No preview available - 2001 |

Applied Semantics: International Summer School, APPSEM 2000, Caminha ... Gilles Barthe No preview available - 2002 |