Abstract

We introduce a new abstraction mechanism, type parametric combinators, which supports abstraction over type constructors defined by datatype declarations found in functional languages such as Miranda, Haskell, and ML. This mechanism allows the definition and use of high level abstractions not possible in traditional languages and could be used to define user programmable derived instance declarations for type classes in Haskel. We illustrate its use in an actual programming language by giving examples in the ML dialect CRML.

Citations

315	How to make ad-hoc polymorphism less ad-hoc - Wadler, Blott - 1989
274	Functional programming with bananas, lenses, envelopes and barbed wire - Meijer, Fokkinga, et al. - 1991
107	A fold for all seasons - Sheard, Fegaras - 1993
77	Report on the Programming Language Haskell - HUDAK, PEYTON-JONES, et al. - 1992
62	A Categorical Programming Language - Hagino - 1987
45	Strong categorical datatypes I - Cockett, Spencer
18	A note on categorical datatypes - Wraith - 1989
3	Calculate Categorically! Formal Aspects - Fokkinga - 1992
3	Generating Programs by Reflection. Oregon Graduate Institute - Hook, Kieburtz, et al.
3	A Semantics of Compile-time Reflection. Oregon Graduate Institute - Hook, Sheard - 1993
3	Control structures from types - Paterson - 1994
2	Category Theory, Types, and Programming Languages - Dybkjaer - 1991
1	Fokkinga Law and Order in Algorithmics - M - 1992