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

R. , D. Nicola, and M. Hennessy, Testing equivalences for processes, Theoret. Comput . Sci, vol.34, pp.83-133, 1984.

M. Felleisen, On the expressive power of programming languages, Science of Computer Programming, vol.17, issue.1-3, pp.35-75, 1991.
DOI : 10.1016/0167-6423(91)90036-W

A. D. Gordon, Bisimilarity as a theory of functional programming, Theoretical Computer Science, vol.228, issue.1-2, pp.5-47, 1999.
DOI : 10.1016/S0304-3975(98)00353-3

A. Kutzner and M. Schmidt-schauß, A nondeterministic call-by-need lambda calculus, Proc. ICFP, pp.324-335, 1998.

J. Matthews and R. B. Findler, Operational semantics for multi-language programs, 34th ACM POPL, pp.3-10, 2007.
DOI : 10.1145/1498926.1498930

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.4961

G. Mccusker, Full abstraction by translation, Advances in Theory and Formal Methods of Computing, 1996.

R. Milner, Fully abstract models of typed ??-calculi, Theoretical Computer Science, vol.4, issue.1, pp.1-22, 1977.
DOI : 10.1016/0304-3975(77)90053-6

J. C. Mitchell, On abstraction and the expressive power of programming languages, Science of Computer Programming, vol.21, issue.2, pp.141-163, 1993.
DOI : 10.1016/0167-6423(93)90004-9

J. Niehren, D. Sabel, M. Schmidt-schauß, and J. Schwinghammer, Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures, Electronic Notes in Theoretical Computer Science, vol.173, pp.313-337, 2007.
DOI : 10.1016/j.entcs.2007.02.041

URL : https://hal.archives-ouvertes.fr/inria-00128861

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

S. , P. Jones, A. Gordon, and S. Finne, Concurrent Haskell, 23rd ACM POPL, pp.295-308, 1996.

A. D. Pitts, Parametric polymorphism and operational equivalence, Mathematical Structures in Computer Science, vol.10, issue.3, pp.321-359, 2000.
DOI : 10.1017/S0960129500003066

J. G. Riecke, Fully abstract translations between functional languages, 18th ACM POPL, pp.245-254, 1991.
DOI : 10.1017/s0960129500000293

E. Ritter and A. M. Pitts, A fully abstract translation between a lambda-calculus with reference types and Standard ML, Proc. 2nd TLCA, pp.397-413, 1995.

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, 2008.
DOI : 10.1017/S0956796897002967

S. B. Sanjabi and C. L. Ong, Fully abstract semantics of additive aspects by translation, Proceedings of the 6th international conference on Aspect-oriented software development , AOSD '07, pp.135-148, 2007.
DOI : 10.1145/1218563.1218579

M. Schmidt-schauß and D. Sabel, On generic context lemmas for lambda calculi with sharing. Frank report 27, Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, 2007.

E. Shapiro, Separating concurrent languages with categories of language embeddings, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.198-208, 1991.
DOI : 10.1145/103418.103423

H. Søndergaard and P. Sestoft, Non-determinism in Functional Languages, The Computer Journal, vol.35, issue.5, pp.514-523, 1992.
DOI : 10.1093/comjnl/35.5.514