D. Ancona, S. Fagorzi, E. Moggi, and E. Zucca, Mixin Modules and Computational Effects, In Int'l Col. on Automata, Lang. and Progr, 2003.
DOI : 10.1007/3-540-45061-0_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.4555

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

V. Bono, A. Patel, and V. Shmatikov, A Core Calculus of Classes and Mixins, Europ. Conf. on Object-Oriented Progr, 1999.
DOI : 10.1007/3-540-48743-3_3

G. Bracha, The Programming Language Jigsaw: Mixins, Modularity and Multiple Inheritance, 1992.

L. Cardelli, Program fragments, linking, and modularization, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, 1997.
DOI : 10.1145/263699.263735

W. R. Cook, A Denotational Semantics of Inheritance, 1989.

K. Crary, R. Harper, and S. Puri, What is a recursive module, 1999.

D. Dreyer, A type system for well-founded recursion, 31st symp. Principles of Progr. Lang, 2004.

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

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

R. B. Findler and M. Flatt, Modular object-oriented programming with units and mixins, Int. Conf. on Functional Progr, 1998.
DOI : 10.1145/291251.289432
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.1416

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

M. Flatt, S. Krishnamurthi, and M. Felleisen, Classes and mixins, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '98, 1998.
DOI : 10.1145/268946.268961

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, 1994.
DOI : 10.1145/174675.176927

R. Harper and B. Pierce, A record calculus based on symmetric concatenation, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, 1991.
DOI : 10.1145/99583.99603

T. Hirschowitz, Modules mixins, modules et récursionrécursionétendue en appel par valeur, 2003.

T. Hirschowitz and X. Leroy, Mixin modules in a call-by-value setting, ACM Transactions on Programming Languages and Systems, vol.27, issue.5, 2002.
DOI : 10.1145/1086642.1086644
URL : https://hal.archives-ouvertes.fr/hal-00310119

T. Hirschowitz, X. Leroy, and J. B. Wells, Compilation of extended recursion in call-by-value functional languages, Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming , PPDP '03, 2003.
DOI : 10.1145/888251.888267
URL : https://hal.archives-ouvertes.fr/hal-00310121

T. Hirschowitz, X. Leroy, and J. B. Wells, A reduction semantics for call-by-value mixin modules, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00071903

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

E. Machkasova and F. A. Turbak, A Calculus for Link-Time Compilation, Europ. Symp. on Progr, 2000.
DOI : 10.1007/3-540-46425-5_17

D. A. Moon, Object-oriented programming with Flavors, OOPSLA, 1986.
DOI : 10.1145/960112.28698

M. Odersky, V. Cremet, C. Röckl, and M. Zenger, A Nominal Theory of Objects with Dependent Types, p.3
DOI : 10.1007/978-3-540-45070-2_10

F. Pottier, A versatile constraint-based type inference system, Nordic Journal of Computing, vol.7, issue.4, 2000.

C. V. Russo, Recursive structures for Standard ML, Int. Conf. on Functional Progr, 2001.

J. B. Wells and R. Vestergaard, Equational Reasoning for Linking with First-Class Primitive Modules
DOI : 10.1007/3-540-46425-5_27