D. Ancona, Modular formal frameworks for module systems, 1998.

D. Ancona and E. Zucca, A Primitive Calculus for Module Systems, Princ. and Practice of Decl. Prog., volume 1702 of LNCS, pp.62-79, 1999.
DOI : 10.1007/10704567_4

D. Ancona and E. Zucca, A calculus of module systems, Journal of Functional Programming, vol.12, issue.02, 2001.
DOI : 10.1017/S0956796801004257

Z. Ariola and S. Blom, Skew confluence and the lambda calculus with letrec. Annals of pure and applied logic, 2001.

V. Bono, M. Bugliesi, M. Dezani-ciancaglini, and L. Liquori, Subtyping for extensible , incomplete objects, Fundamenta Informaticae, vol.38, issue.4, pp.325-364, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01153734

G. Boudol, The recursive record semantics of objects revisited, Preliminary version presented at ESOP'01, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072423

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

G. Bracha and W. Cook, Mixin-based inheritance, OOPSLA90 SIGPLAN Notices, pp.303-311, 1990.
DOI : 10.1145/97946.97982
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.4510

L. Cardelli, Program fragments, linking, and modularization, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.266-277, 1997.
DOI : 10.1145/263699.263735
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.8472

G. Cousineau, P. Curien, and M. Mauny, The categorical abstract machine, Science of Computer Programming, vol.8, issue.2, pp.173-202, 1987.
DOI : 10.1016/0167-6423(87)90020-7

K. Crary, R. Harper, and S. Puri, What is a recursive module, Prog. Lang. Design and Impl, pp.50-63, 1999.
DOI : 10.1145/301631.301641
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.8964

D. Dreyer, K. Crary, and R. Harper, Toward a practical type theory for recursive modules, 2001.

D. Duggan and C. Sourelis, Mixin modules, Int. Conf. on Functional Progr. 96, pp.262-273, 1996.
DOI : 10.1145/232629.232654

D. Duggan and C. Sourelis, Recursive modules and mixin-based inheritance, 2001.

M. Flatt and M. Felleisen, Units: cool modules for HOT languages, Prog. Lang. Design and Impl, pp.236-248, 1998.

R. Harper and M. Lillibridge, A type-theoretic approach to higher-order modules with sharing, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '94, pp.123-137, 1994.
DOI : 10.1145/174675.176927

T. Hirschowitz and X. Leroy, Mixin modules in a call-by-value setting (long version ) Available at http, 2001.

X. Leroy, Manifest types, modules, and separate compilation, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '94, pp.109-122, 1994.
DOI : 10.1145/174675.176926
URL : https://hal.archives-ouvertes.fr/hal-01499976

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

C. Russo, Recursive structures for Standard ML, Int. Conf. on Functional Progr. 01, pp.50-61, 2001.

J. Wells and R. Vestergaard, Equational Reasoning for Linking with First-Class Primitive Modules, Programming Languages and Systems, 9th European Symp. Programming, pp.412-428, 2000.
DOI : 10.1007/3-540-46425-5_27