References

[Cardelli-basic-typechecking]

Luca Cardelli.
Basic polymorphic typechecking.
Science of Computer Programming, 8(2):147--172, 1987.

[Cardelli-Quest]

Luca Cardelli.
Typeful programming.
In E. J. Neuhold and M. Paul, editors, Formal description of programming concepts, pages 431--507. Springer-Verlag, 1989.

[Cardelli-Quest-impl]

Luca Cardelli.
The Quest implementation.
Software and documentation available on (url), 1990.

[Cardelli-linking]

Luca Cardelli.
Program fragments, linking, and modularization.
Unpublished draft, 1993.

[Cregut-MacQueen-hofunctors]

Pierre Crégut and David B. MacQueen.
An implementation of higher-order functors.
In Proc. 1994 Workshop on ML and its applications, pages 13--21. Research report 2265, INRIA, 1994.

[Curtis-Rauen-90]

P. Curtis and J. Rauen.
A module system for Scheme.
In Lisp and Functional Programming 1990, pages 13--19. ACM Press, 1990.

[Duggan-mixin-modules]

Dominic Duggan and Constantinos Sourelis.
Mixin modules.
In International Conference on Functional Programming 96, pages 262--273. ACM Press, 1996.

[Guttag-Horning-Larch]

John V. Guttag and James J. Horning.
Larch: languages and tools for formal specification.
Springer-Verlag, 1993.

[Harper-Lillibridge-94]

Robert Harper and Mark Lillibridge.
A type-theoretic approach to higher-order modules with sharing.
In 21st symposium Principles of Programming Languages, pages 123--137. ACM Press, 1994.

[Harper-Mitchell-Moggi]

Robert Harper, John C. Mitchell, and Eugenio Moggi.
Higher-order modules and the phase distinction.
In 17th symposium Principles of Programming Languages, pages 341--354. ACM Press, 1990.

[Leroy-unboxed]

Xavier Leroy.
Unboxed objects and polymorphic typing.
In 19th symposium Principles of Programming Languages, pages 177--188. ACM Press, 1992.

[Leroy-manifest-types]

Xavier Leroy.
Manifest types, modules, and separate compilation.
In 21st symposium Principles of Programming Languages, pages 109--122. ACM Press, 1994.

[Leroy-appl-functors]

Xavier Leroy.
Applicative functors and fully transparent higher-order modules.
In 22nd symposium Principles of Programming Languages, pages 142--153. ACM Press, 1995.

[Caml-Special-Light]

Xavier Leroy.
The Caml Special Light system.
Software and documentation available on the Web, (url), 1995.

[Leroy-generativity]

Xavier Leroy.
A syntactic theory of type generativity and sharing.
Journal of Functional Programming, 1996.
To appear. An extended abstract appeared in Proc. 1994 Workshop on ML and its applications, research report 2265, INRIA, pages 1--12.

[MacQueen-modules]

David B. MacQueen.
Modules for Standard ML.
In Robert Harper, David B. MacQueen, and Robin Milner, editors, Standard ML. University of Edinburgh, technical report ECS LFCS 86-2, 1986.

[MacQueen-implementation-modules]

David B. MacQueen.
The implementation of Standard ML modules.
In Lisp and Functional Programming 1988, pages 212--223. ACM Press, 1988.

[MacQueen-Tofte-94]

David B. MacQueen and Mads Tofte.
A semantics for higher-order functors.
In D. Sannella, editor, Programming languages and systems -- ESOP '94, volume 788 of Lecture Notes in Computer Science, pages 409--423. Springer-Verlag, 1994.

[Mauny-deRauglaudre-94]

Michel Mauny and Daniel de Rauglaudre.
A complete and realistic implementation of quotations in ML.
In Proc. 1994 Workshop on ML and its applications, pages 70--78. Research report 2265, INRIA, 1994.

[SML]

Robin Milner, Mads Tofte, and Robert Harper.
The definition of Standard ML.
The MIT Press, 1990.

[Parnas]

David L. Parnas.
On the criteria to be used in decomposing systems into modules.
Communications of the ACM, 15(12):1053--1058, 1972.

[Peyton-Jones]

Simon L. Peyton-Jones.
The implementation of functional programming languages.
Prentice-Hall, 1987.

[Peyton-Jones-boxed]

Simon L. Peyton-Jones and John Launchbury.
Unboxed values as first-class citizens in a non-strict functional language.
In Functional Programming Languages and Computer Architecture 1991, volume 523 of Lecture Notes in Computer Science, pages 636--666, 1991.

[Remy-eq]

Didier Rémy.
Extending ML type system with a sorted equational theory.
Research report 1766, INRIA, 1992.

[Sannella-Wallen]

D. T. Sannella and L. A. Wallen.
A calculus for the construction of modular Prolog programs.
Journal of Logic Programming, 12:147--177, 1992.

[Sannella-Tarlecki-EML]

Donald Sannella and Andrzej Tarlecki.
Extended ML: past, present and future.
Technical report ECS-LFCS-91-138, Laboratory for Foundations of Computer Science, University of Edinburgh, 1991.

[Weis-Leroy-Caml]

Pierre Weis and Xavier Leroy.
Le langage Caml.
InterÉditions, 1993.

[Wirsing-handbook]

Martin Wirsing.
Algebraic specifications.
In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 675--788. The MIT Press/Elsevier, 1990.