Abstract

We describe extensions of the Hindley-Milner type system to support higher-order polymorphism and first-class structures with polymorphic components. The combination of these features results in a ‘core language ’ that rivals the expressiveness of the Standard ML module system in some respects and exceeds it in others. 1

Citations

1497	The Definition of Standard ML - Milner, Tofte, et al. - 1990
874	A theory of type polymorphism in programming - Milner - 1978
727	On understanding types, data abstraction, and polymorphism - Cardelli, Wegner - 1985
515	The Implementation of Functional Programming Languages - Jones - 1987
352	ML for the Working Programmer - Paulson - 1996
339	Towards a theory of type structure - Reynolds
332	Types, abstraction and parametric polymorphism - Reynolds - 1983
315	How to make ad-hoc polymorphism less ad-hoc - Wadler, Blott - 1989
292	Theorems for free - Wadler - 1989
267	G.D.: Abstract types have existential types - Mitchell, Plotkin - 1988
251	A type-theoretic approach to higher-order modules - Harper, Lillibridge - 1994
235	Constructive mathematics and computer programming - Martin-Lof - 1982
221	Principal type schemes for functional programs - Damas, Milner - 1982
213	Monad transformers and modular interpreters - Liang, Hudak, et al. - 1995
208	Manifest types, modules, and separate compilation - Leroy - 1994
195	Une extension de l’interprétation de Gödel à l’analyse et son application à l’élimination des coupures dans l’analyse et la théorie des types - Girard - 1970
171	A system of constructor classes: overloading and implicit higher-order polymorphism - Jones - 1993
159	Lambda lifting: Transforming programs to recursive equations - Johnsson - 1985
135	A type-based compiler for Standard ML - Shao, Appel - 1995
130	Higher-order modules and the phase distinction - Harper, Mitchell, et al. - 1990
130	The principal type-scheme of an object in combinatory logic - Hindley - 1969
125	Qualified types: theory and practice - Jones - 1992
118	Using dependent types to express modular structure - MacQueen - 1986
70	The essence of ML - Mitchell, Harper - 1988
64	Composing monads - Jones, Duponcheel - 1993
61	editors, Report on the programming language Haskell, a non-strict purely-functional programming language, Version 1.2. Sigplan Notices 27(5 - Hudak, Jones, et al. - 1992
60	Smartest recompilation - Shao, Appel - 1993
56	A compilation method for ML-style polymorphic record calculi - Ohori - 1992
55	An extension of standard ML modules with subtyping and inheritance - Mitchell, Meldal, et al. - 1991
53	A syntactic theory of type generativity and sharing - Leroy - 1996
52	Abstract types and the dot notation - Cardelli, Leroy - 1990
51	A semantics for higher-order functors - MacQueen, Tofte - 1994
42	Signatures for a network protocol stack: A systems application of standard ML - Biagioni, Harper, et al. - 1994
32	On abstraction and the expressive power of programming languages - Mitchell - 1993
30	Principal signatures for higher-order program modules - Tofte - 1992
28	Introduction to Generalised Type Systems - Barendregt - 1991
28	An extension of ML with first-class abstract types - Läufer, Odersky - 1992
23	A category-theoretic account of program modules - Moggi - 1989
13	Extending record typing to type parametric modules with sharing - Aponte - 1993
10	First-class polymorphism for ML - Kahrs - 1993
6	The system F of variable types - 15 years later - Girard - 1986
5	Gofer goes bananas - Meijer, Jones - 1994