Abstract

We argue that the novel combination of type classes and existential types in a single language yields significant expressive power. We explore this combination in the context of higher-order functional languages with static typing, parametric polymorphism, algebraic data types, and Hindley-Milner type inference. Adding existential types to an existing functional language that already features type classes requires only a minor syntactic extension. We first demonstrate how to provide existential quantification over type classes by extending the syntax of algebraic data type definitions and give examples of possible uses. We then develop a type system and a type inference algorithm for the resulting language. Finally, we present a formal semantics by translation to an implicitly-typed second-order l-calculus and show that the type system is semantically sound. Our extension has been implemented in the Chalmers Haskell B. system, and all examples from this paper have been developed using ...

Citations

727	On understanding types, data abstraction, and polymorphism - Cardelli, Wegner - 1985
251	A type-theoretic approach to higher-order modules - Harper, Lillibridge - 1994
221	Principal type schemes for functional programs - Damas, Milner - 1982
216	Report on the programming language Haskell, a non-strict, purely functional language - Hudak, Jones, et al. - 1992
171	A system of constructor classes: overloading and implicit higher-order polymorphism - Jones - 1993
111	Type Classes in Haskell - Hall, Hammond - 1994
82	A theory of qualified types - Jones - 1998
52	Abstract types and the dot notation - Cardelli, Leroy - 1990
44	Implementing Haskell overloading - Augustsson - 1993
37	Parametric Type Classes - Chen, Hudak, et al. - 1992
15	An approach to overloading with polymorphism - Blott - 1991
10	Signatures: A C++ Extension for Type Abstraction and Subtype Polymorphism”, Software—Practice and Experience - Baumgartner, Russo - 1994
1	user manual. Distributed with the HBC compiler - Augustsson