A. Rossberg, D. L. Botlan, G. Tack, T. Brunklaus, and G. Smolka, Alice Through the Looking Glass, of Trends in Functional Programming, pp.97-96, 2006.

J. H. Reppy, Concurrent Programming in ML, 1999.
DOI : 10.1017/CBO9780511574962

F. Nielson, ML with Concurrency: Design, Analysis, Implementation, and Application, Monographs in Computer Science, 1997.
DOI : 10.1007/978-1-4612-2274-3

C. Fournet and G. Gonthier, The reflexive chemical abstract machine and the joincalculus, Proc. POPL'96, pp.372-385, 1996.

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, pp.22-29, 1999.
DOI : 10.1109/ASAMA.1999.805390

A. Rossberg, Generativity and dynamic opacity for abstract types, Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming , PPDP '03, pp.241-252, 2003.
DOI : 10.1145/888251.888274
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.6271

G. Tack, L. Kornstaedt, and G. Smolka, Generic Pickling and Minimization, Electronic Notes in Theoretical Computer Science, vol.148, issue.2, pp.79-103, 2006.
DOI : 10.1016/j.entcs.2005.11.041
URL : http://doi.org/10.1016/j.entcs.2005.11.041

G. Smolka, The Oz Programming Model, Computer Science Today LNCS, vol.1000, pp.324-343, 1995.
DOI : 10.1007/BFb0015252

S. Haridi, P. Van-roy, P. Brand, M. Mehl, R. Scheidhauer et al., Efficient logic variables for distributed computing, ACM Transactions on Programming Languages and Systems, vol.21, issue.3, pp.569-626, 1999.
DOI : 10.1145/319301.319347
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.2730

J. Niehren, Uniform confluence in concurrent computation, Journal of Functional Programming, vol.10, issue.5, pp.453-499, 2000.
DOI : 10.1017/S0956796800003762
URL : https://hal.archives-ouvertes.fr/inria-00536801

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

R. H. Halstead and J. , MULTILISP: a language for concurrent symbolic computation, ACM Transactions on Programming Languages and Systems, vol.7, issue.4, pp.501-538, 1985.
DOI : 10.1145/4472.4478

E. Shapiro, The family of concurrent logic programming languages, ACM Computing Surveys, vol.21, issue.3, pp.413-510, 1989.
DOI : 10.1145/72551.72555

V. A. Saraswat, M. Rinard, and P. Panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.333-352, 1991.
DOI : 10.1145/99583.99627

M. Müller, Set-based failure diagnosis for concurrent constraint programming, 1998.

B. C. Pierce and D. N. Turner, Pict: A programming language based on the picalculus, Proof, Language and Interaction: Essays in Honour of Robin Milner, pp.455-494, 2000.

C. Fournet, C. Laneve, L. Maranget, and D. Rémy, Implicit typingàtypingà la ML for the join-calculus, Proc. CONCUR'97, pp.196-212, 1997.

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

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

L. Moreau, The semantics of scheme with future, International Conference on Functional Programming, pp.146-156, 1996.

R. S. Arvind and K. K. Nikhil, I-structures: data structures for parallel computing, ACM Transactions on Programming Languages and Systems, vol.11, issue.4, pp.598-632, 1989.
DOI : 10.1145/69558.69562

B. Liskov and L. Shrira, Promises: linguistic support for efficient asynchronous procedure calls in distributed systems, ACM SIGPLAN Notices, vol.23, issue.7, pp.260-267, 1988.
DOI : 10.1145/960116.54016

Z. M. Ariola and J. W. Klop, Lambda Calculus with Explicit Recursion, Information and Computation, vol.139, issue.2, pp.154-233, 1997.
DOI : 10.1006/inco.1997.2651
URL : http://doi.org/10.1006/inco.1997.2651

Z. M. Ariola and M. Felleisen, The call-by-need lambda calculus, Journal of Functional Programming, vol.7, issue.3, pp.265-301, 1997.
DOI : 10.1017/S0956796897002724

J. Maraist, M. Odersky, and P. Wadler, The call-by-need lambda calculus, Journal of Functional Programming, vol.8, issue.3, pp.275-317, 1998.
DOI : 10.1017/S0956796898003037

A. K. Wright, Simple imperative polymorphism, Lisp and Symbolic Computation, pp.343-355, 1995.
DOI : 10.1007/BF01018828

A. Rossberg, The missing link -dynamic components for ML, 11th International Conference on Functional Programming, 2006.

D. N. Turner, P. Wadler, and C. Mossin, Once upon a type, Proceedings of the seventh international conference on Functional programming languages and computer architecture , FPCA '95, pp.1-11, 1995.
DOI : 10.1145/224164.224168

J. Niehren, J. Schwinghammer, and G. Smolka, A concurrent lambda calculus with futures, Frontiers of Combining Systems, pp.248-263, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00090434

R. Milner, The polyadic ??-calculus, Proc. Marktoberdorf Summer School, pp.203-246, 1993.
DOI : 10.1007/BFb0084778

P. J. Landin, The Mechanical Evaluation of Expressions, The Computer Journal, vol.6, issue.4, pp.308-320, 1964.
DOI : 10.1093/comjnl/6.4.308

M. Abadi and L. Lamport, Conjoining specifications, ACM Transactions on Programming Languages and Systems, vol.17, issue.3, pp.507-534, 1995.
DOI : 10.1145/203095.201069
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.4928

N. Kobayashi, B. C. Pierce, and D. N. Turner, Linearity and the pi-calculus, ACM Transactions on Programming Languages and Systems, vol.21, issue.5, pp.914-947, 1999.
DOI : 10.1145/330249.330251

A. Jeffrey and J. Rathke, A fully abstract may testing semantics for concurrent objects, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.101-112, 2002.
DOI : 10.1109/LICS.2002.1029820

G. Boudol, The ??-calculus in direct style, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.228-241, 1997.
DOI : 10.1145/263699.263726

D. Caromel and L. Henrio, A Theory of Distributed Objects, 2005.

E. Barendsen and S. Smetsers, Uniqueness type inference, Proceedings PLILP'95, pp.189-206, 1995.
DOI : 10.1007/BFb0026821

P. Wadler, Linear types can change the world, Programming Concepts and Methods, pp.546-566, 1990.