D. Ancona and E. Zucca, A theory of mixin modules: basic and derived operators, Mathematical Structures in Computer Science, vol.8, issue.4, pp.401-446, 1998.
DOI : 10.1017/S0960129598002576

D. Ancona and E. Zucca, A primitive calculus for module systems. Pages 62?79 of PPDP'99 -international conference on principles and practice of declarative programming, Lecture Notes in Computer Science, vol.1702, 1999.
DOI : 10.1007/10704567_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.2055

G. Bracha, The programming language Jigsaw: Mixins, modularity and multiple inheritance, 1992.

L. Cardelli, Basic polymorphic typechecking, Science of Computer Programming, vol.8, issue.2, pp.147-172, 1987.
DOI : 10.1016/0167-6423(87)90019-0
URL : http://doi.org/10.1016/0167-6423(87)90019-0

L. Cardelli, Structural subtyping and the notion of power type. Pages 70?79 of: 15th symposium Principles of Programming Languages, 1988.

L. Cardelli, Typeful programming. Pages 431?507 of Formal description of programming concepts, 1989.

L. Cardelli, The Quest implementation. Software and documentation available on ftp, Quest, 1990.

L. Cardelli, Program fragments, linking, and modularization. Pages 266?277 of: 24th symposium Principles of Programming Languages, 1998.
DOI : 10.1145/263699.263735
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.8472

J. Courant, An applicative module calculus. Pages 622?636 of: TAPSOFT '97: Theory and practice of software development, Lecture Notes in Computer Science, vol.1214, 1997.
DOI : 10.1007/bfb0030630
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.2878

J. Courant, A module calculus for Pure Type Systems. Pages 112 ? 128 of: Typed lambda calculi and applications 97, Lecture Notes in Computer Science, vol.1210, 1997.
DOI : 10.1007/3-540-62688-3_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.1185

K. Crary, R. Harper, . Puri, and . Sidd, What is a recursive module? Pages 50?63 of: Programming Language Design and Implementation, 1999.

P. Crégut and D. B. Macqueen, An implementation of higher-order functors, Pages 13?21 of: Proc. 1994 workshop on ML and its applications, 1994.

P. Curtis and J. Rauen, A module system for Scheme. Pages 13?19 of: Lisp and Functional Programming 1990, 1990.
DOI : 10.1145/91556.91573
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.2479

D. Duggan and C. Sourelis, Mixin modules, Pages 262?273 of: International Conference on Functional Programming 96, 1996.
DOI : 10.1145/232629.232654

M. Elsman, Program modules, separate compilation, and intermodule optimisation, 1999.

K. Fisher and J. H. Reppy, The design of a class mechanism for Moby. Pages 37?49 of: Programming Language Design and Implementation, 1999.

M. Flatt and M. Felleisen, Units: cool modules for HOT languages. Pages 236?248 of: Programming Language Design and Implementation, 1998.

N. Glew and G. Morrisett, Type-safe linking and modular assembly language. Pages 250?261 of: 26th symposium Principles of Programming Languages, 1999.
DOI : 10.1145/292540.292563
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.9240

J. V. Guttag and J. J. Horning, Larch: languages and tools for formal specification, 1993.
DOI : 10.1007/978-1-4612-2704-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.5123

R. Harper and M. Lillibridge, A type-theoretic approach to higher-order modules with sharing. Pages 123?137 of: 21st symposium Principles of Programming Languages, 1994.
DOI : 10.1145/174675.176927
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.3595

R. Harper and C. Stone, A type-theoretic interpretation of Standard ML Robin Milner Festschrifft A preliminary version is available as technical report CMU-CS-97-147, 1998.

R. Harper, J. C. Mitchell, and E. Moggi, Higher-order modules and the phase distinction. Pages 341?354 of: 17th symposium Principles of Programming Languages, 1990.
DOI : 10.1145/96709.96744
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.3795

X. Leroy, Unboxed objects and polymorphic typing. Pages 177?188 of: 19th symposium Principles of Programming Languages, 1992.
DOI : 10.1145/143165.143205
URL : https://hal.archives-ouvertes.fr/hal-01499973

X. Leroy, Manifest types, modules, and separate compilation. Pages 109?122 of: 21st symposium Principles of Programming Languages, 1994.
DOI : 10.1145/174675.176926
URL : https://hal.archives-ouvertes.fr/hal-01499976

X. Leroy, Applicative functors and fully transparent higher-order modules. Pages 142?153 of: 22nd symposium Principles of Programming Languages, 1995.
DOI : 10.1145/199448.199476
URL : https://hal.archives-ouvertes.fr/hal-01499966

X. Leroy, Abstract, Journal of Functional Programming, vol.6, issue.05, pp.667-698, 1996.
DOI : 10.1017/S0956796800001933
URL : https://hal.archives-ouvertes.fr/hal-01499980

X. Leroy, . Vouillon, . Jérôme, and D. Doligez, The Objective Caml system. Software and documentation available on the Web, 1996.

M. Lillibridge, Translucent sums: a foundation for higher-order module systems, 1997.

D. B. Macqueen, Modules for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming , LFP '84, 1986.
DOI : 10.1145/800055.802036

D. B. Macqueen, The implementation of Standard ML modules. Pages 212? 223 of: Lisp and Functional Programming 1988, 1988.

D. B. Macqueen and M. Tofte, A semantics for higher-order functors. Pages 409?423 of, Programming languages and systems ? ESOP '94, 1994.

M. Mauny and D. De-rauglaudre, A complete and realistic implementation of quotations in ML, Pages 70?78 of: Proc. 1994 workshop on ML and its applications, 1994.

R. Milner, . Tofte, . Mads, R. Harper, and D. Macqueen, The definition of Standard ML (revised), 1997.

G. Nelson, Systems programming in Modula-3, 1991.

D. Nowak, . Talpin, . Jean-pierre, . Gautier, . Thierry et al., An MLlike module system for the synchronous language Signal, Pages 1244?1253 of: European conference on parallel processing (Euro-Par'97, 1997.

D. L. Parnas, On the criteria to be used in decomposing systems into modules, Communications of the ACM, vol.15, issue.12, pp.1053-1058, 1972.
DOI : 10.1145/361598.361623

S. L. Peyton-jones, The implementation of functional programming languages, 1987.

S. L. Peyton-jones and J. Launchbury, Unboxed values as first-class citizens in a non-strict functional language. Pages 636?666 of: Functional programming languages and computer architecture 1991, Lecture Notes in Computer Science, vol.523, 1991.

D. Rémy, Extending ML type system with a sorted equational theory, 1992.

C. V. Russo, Types for Modules, Electronic Notes in Theoretical Computer Science, vol.60, 1998.
DOI : 10.1016/S1571-0661(05)82621-0
URL : http://doi.org/10.1016/s1571-0661(05)82621-0

D. T. Sannella and L. A. Wallen, A calculus for the construction of modular prolog programs, The Journal of Logic Programming, vol.12, issue.1-2, pp.147-177, 1992.
DOI : 10.1016/0743-1066(92)90042-2

D. Sannella and A. Tarlecki, Extended ML: Past, present and future, 1991.
DOI : 10.1007/3-540-54496-8_16

D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper et al., TIL: a type-directed optimizing compiler for ML. Pages 181?192 of: Programming Language Design and Implementation, 1996.

J. Vouillon, Using modules as classes. Informal proceedings of the FOOL, p.workshop, 1998.

M. Wirsing, Algebraic specifications. Pages 675?788 of: van Leeuwen Handbook of theoretical computer science, 1990.

A. K. Wright, Simple imperative polymorphism. Lisp and symbolic computation, pp.343-356, 1995.
DOI : 10.1007/bf01018828
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5096