A. W. Appel, Compiling with continuations, 1992.
DOI : 10.1017/CBO9780511609619

Z. M. Ariola and S. Blom, Skew confluence and the lambda calculus with letrec, Annals of Pure and Applied Logic, vol.117, issue.1-3, pp.95-178, 2002.
DOI : 10.1016/S0168-0072(01)00104-X

G. Boudol, The recursive record semantics of objects revisited, Journal of functional Programming, vol.14, issue.3, pp.263-315, 2004.
DOI : 10.1017/S0956796803004775
URL : https://hal.archives-ouvertes.fr/inria-00072423

G. Boudol and P. Zimmer, Recursion in the call-by-value lambda-calculus Fixed Points in Computer Science, BRICS Notes Series, issue.2, pp.61-66, 2002.

L. Cardelli, A semantics of multiple inheritance, Semantics of Data Types, pp.51-67, 1984.
DOI : 10.1007/3-540-13346-1_2

G. Cousineau, P. L. 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? In: Programming Language Design and Implementation, pp.50-63, 1999.

D. Dreyer, A type system for well-founded recursion, Principles of Programming Languages, pp.293-305, 2004.

D. Dreyer, A type system for recursive modules, International Conference on Functional Programming, pp.289-302, 2007.

L. Erkök and J. Launchbury, Recursive monadic bindings, International Conference on Functional Programming, pp.174-185, 2000.

J. Gosling, B. Joy, G. Steele, and G. Bracha, The Java Language Specification, Third Edition, 2005.

T. Hirschowitz, Mixin modules, modules, and extended recursion in a call-by-value setting, 2003.

T. Hirschowitz, Rigid Mixin Modules, Functional and Logic Programming, pp.214-228, 2004.
DOI : 10.1007/978-3-540-24754-8_16
URL : https://hal.archives-ouvertes.fr/hal-00310124

T. Hirschowitz and X. Leroy, Mixin modules in a call-by-value setting, ACM Transactions on Programming Languages and Systems, vol.27, issue.5, pp.857-881, 2005.
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, pp.160-171, 2003.
DOI : 10.1145/888251.888267
URL : https://hal.archives-ouvertes.fr/hal-00310121

T. Hirschowitz, X. Leroy, and J. B. Wells, Call-by-Value Mixin Modules, Programming Languages and Systems, 13th European Symposium on Programming, pp.64-78, 2004.
DOI : 10.1007/978-3-540-24725-8_6
URL : https://hal.archives-ouvertes.fr/hal-00310119

R. Kelsey, W. D. Clinger, and J. Rees, The revised 5 report on the algorithmic language Scheme, SIGPLAN Notices, vol.33, issue.9, pp.26-76, 1998.

D. Kranz, R. Kelsey, J. Rees, P. Hudak, J. Philbin et al., Orbit, Symposium on Compiler Construction, pp.219-233, 1986.
DOI : 10.1145/989393.989414

F. Lang, D. Dougherty, P. Lescanne, and K. Rose, Addressed term rewriting systems, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01152576

X. Leroy, D. Doligez, J. Garrigue, D. Rémy, and J. Vouillon, The Objective Caml system release 3.10, documentation and user's manual. Available on the Web, 2007.

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

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

E. Moggi and A. Sabry, An abstract monadic semantics for value recursion, RAIRO - Theoretical Informatics and Applications, vol.38, issue.4, pp.375-400, 2004.
DOI : 10.1051/ita:2004018

J. Nordlander, M. Carlsson, and A. Gill, Unrestricted pure call-by-value recursion, Proceedings of the 2008 ACM SIGPLAN workshop on ML, ML '08, 2008.
DOI : 10.1145/1411304.1411309
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.567.6923

P. Jones and S. , Haskell 98 Language and Libraries, the revised report, 2003.

G. D. Plotkin, Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975.
DOI : 10.1016/0304-3975(75)90017-1

C. V. Russo, Recursive structures for Standard ML, International Conference on Functional Programming, pp.50-61, 2001.

P. Sewell, G. Stoyle, M. Hicks, G. Bierman, and K. Wansbrough, Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction, Journal of Functional Programming, vol.41, issue.04, pp.437-502, 2008.
DOI : 10.1017/S0956796807006442

O. Shivers, Control-flow analysis in Scheme In: Programming Language Design and Implementation, pp.164-174, 1988.

D. Syme, Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge, Proceedings of the ACM-SIGPLAN Workshop on ML (ML 2005), pp.3-25, 2006.
DOI : 10.1016/j.entcs.2005.11.038

O. Waddell, D. Sarkar, and R. K. Dybvig, Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct, Higher-Order and Symbolic Computation, pp.299-326, 2005.
DOI : 10.1007/s10990-005-4878-3

A. K. Wright and M. Felleisen, A Syntactic Approach to Type Soundness, Information and Computation, vol.115, issue.1, pp.38-94, 1992.
DOI : 10.1006/inco.1994.1093