H. Baker and C. Hewitt, The incremental garbage collection of processes, ACM SIGPLAN Notices, vol.12, issue.8, pp.55-59, 1977.
DOI : 10.1145/872734.806932

A. Carayol, D. Hirschkoff, and D. Sangiorgi, On the representation of McCarthy's <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi mathvariant="italic">amb</mml:mi></mml:math> in the <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-calculus, Theoretical Computer Science, vol.330, issue.3, pp.439-473, 2005.
DOI : 10.1016/j.tcs.2004.10.005

E. Chailloux, P. Manoury, and B. Pagano, Developing Applications With Objective Caml, 2000.

S. Conchon and F. L. Fessant, Jocaml: mobile agents for Objective-Caml, Proceedings. First and Third International Symposium on Agent Systems Applications, and Mobile Agents, 1999.
DOI : 10.1109/ASAMA.1999.805390

W. Ferreira, M. Hennessy, and A. Jeffrey, A theory of weak bisimulation for Core CML, Journal of Functional Programming, vol.8, issue.5, pp.447-491, 1998.
DOI : 10.1017/S0956796898003165

C. Flanagan and M. Felleisen, The semantics of future and an application, Journal of Functional Programming, vol.9, issue.1, pp.1-31, 1999.
DOI : 10.1017/S0956796899003329

A. Jeffrey and J. Rathke, A theory of bisimulation for a fragment of Concurrent ML with local names, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.1-48, 2004.
DOI : 10.1109/LICS.2000.855780

A. Kutzner and M. Schmidt-schauß, A nondeterministic call-by-need lambda calculus, International Conference on Functional Programming, pp.324-335, 1998.

R. Milner, Communicating and Mobile Systems: the ?-Calculus, 1999.

A. K. Moran, Call-by-name, Call-by-need, and McCarthy's Amb, 1998.

J. Niehren, J. Schwinghammer, and G. Smolka, A concurrent lambda calculus with futures, Theoretical Computer Science, vol.364, issue.3, pp.338-356, 2006.
DOI : 10.1016/j.tcs.2006.08.016
URL : https://hal.archives-ouvertes.fr/inria-00090434

A. M. Pitts, Operational Semantics and Program Equivalence, Applied Semantics, pp.378-412, 2002.
DOI : 10.1007/3-540-45699-6_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.166

G. D. Plotkin, A Powerdomain Construction, SIAM Journal on Computing, vol.5, issue.3, pp.452-487, 1976.
DOI : 10.1137/0205035

A. Rossberg, The missing link: dynamic components for ML, Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, pp.99-110, 2006.

A. Rossberg, D. L. Botlan, G. Tack, T. Brunklaus, and G. Smolka, Alice Through the Looking Glass, Trends in Functional Programming Intellect Books, vol.5, pp.79-96, 2006.

D. Sabel and M. Schmidt-schauß, A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations, Mathematical Structures in Computer Science, vol.1672, issue.03, 2007.
DOI : 10.1017/S0956796897002967

D. Sangiorgi, The lazy lambda calculus in a concurrency scenario, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.120-153, 1994.
DOI : 10.1109/LICS.1992.185524

D. Sangiorgi and D. Walker, The ?-calculus: a Theory of Mobile Processes, 2001.

G. Smolka, The Oz programming model, Computer Science Today, pp.324-343, 1995.