Abstract

Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For example, type classes are used to support equality and numeric types, and for monadic programming. A commonly requested extension to support ‘multiple parameters ’ allows a more general interpretation of classes as relations on types, and has many potentially useful applications. Unfortunately, many of these examples do not work well in practice, leading to ambiguities and inaccuracies in inferred types and delaying the detection of type errors. This paper illustrates the kind of problems that can occur with multiple parameter type classes, and explains how they can be resolved by allowing programmers to specify explicit dependencies between the parameters. A particular novelty of this paper is the application of ideas from the theory of relational databases to the design of type systems.

Citations

384	Theory of Relational Databases - Maier - 1983
315	How to make ad-hoc polymorphism less ad-hoc - Wadler, Blott - 1989
171	A system of constructor classes: overloading and implicit higher-order polymorphism - Jones - 1993
125	Qualified types: theory and practice - Jones - 1992
84	Type classes: an exploration of the design space - Jones, Jones, et al. - 1997
81	Dependency structures of data base relationships, Information Processing 74 - Armstrong - 1974
46	Simplifying and improving qualified types - Jones - 1995
15	An approach to overloading with polymorphism - Blott - 1991
15	Parametric type classes (Extended abstract - Chen, Hudak, et al. - 1992
12	Bulk types with class - Jones - 1996
2	Edison User’s Guide - Okasaki - 1999