Abstract

In a language with non-parametric or ad-hoc polymorphism, it is possible to determine the identity of a type variable at run time. With this facility, we can write a function to convert a term from one abstract type to another, if the two hidden types are identical. However, the naive implementation of this function requires that the term be destructed and rebuilt. In this paper, we show how to eliminate this overhead using higher-order type abstraction. We demonstrate this solution in two frameworks for ad-hoc polymorphism: intensional type analysis and type classes.

Citations

1541	The Java Language Specification - Gosling, Joy, et al. - 1996
253	Interpretation fonctionelle et elimination des coupures de l’arithmetique d’ordre superieur. These d’Etat - Girard - 1972
252	Compiling polymorphism using intensional type analysis - Harper, Morrisett - 1995
171	A system of constructor classes: overloading and implicit higher-order polymorphism - Jones - 1993
132	Intensional polymorphism in type-erasure semantics - Crary, Weirich, et al. - 1998
78	Dynamic typing in a statically-typed language - Abadi, Cardelli, et al. - 1989
53	Dynamics in ML - Leroy, Mauny - 1991
36	Extensional polymorphism - Dubois, Fran, et al. - 1995
35	Dynamic typing - Henglein - 1992