G. Eam and S. V. Am-figure, A unique computing device in four disguises which in turn entail (easy check) that the SAM can proceed from r (to q) if and only if the EAM can proceed from ?r? SE

]. R. References, P. Amadio, and . Curien, Domains and lambda-calculi, 1998.

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930
URL : http://doi.org/10.1006/inco.2000.2930

H. Barendregt, The lambda calculus; its syntax and semantics, 1984.

G. Berry and P. Curien, Sequential algorithms on concrete data structures, Theoretical Computer Science, vol.20, issue.3, pp.265-321, 1982.
DOI : 10.1016/S0304-3975(82)80002-9

G. Berry, P. Curien, and J. Lévy, Full abstraction for sequential languages: state of the art, in 'Algebraic methods in semantics, pp.35-87, 1985.

P. Boudes, Desequentialization of games and experiments on proof-nets, 2005.

N. De-bruijn, Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, Indag. Math, vol.34, pp.381-392, 1972.

R. Cartwright, P. Curien, and M. Felleisen, Fully Abstract Semantics for Observably Sequential Languages, Information and Computation, vol.111, issue.2, pp.297-401, 1994.
DOI : 10.1006/inco.1994.1047

P. Curien, Abstract B??hm trees, Mathematical Structures in Computer Science, vol.8, issue.6, pp.559-591, 1998.
DOI : 10.1017/S0960129598002631

T. Coquand, A semantics of evidence for classical arithmetic, The Journal of Symbolic Logic, vol.54, issue.01, pp.325-337, 1995.
DOI : 10.1007/BFb0079691

P. Curien and H. Herbelin, Computing with Abstract Böhm Trees, Proceedings of the 3rd Fuji International Symposium on Functional and Logic Programming, pp.20-39, 1998.

P. Curien and H. Herbelin, The duality of computation, Proc. ICFP 2000 (International Conference on Functional Programming), 2000.
URL : https://hal.archives-ouvertes.fr/inria-00156377

P. Curien, Sur l'?-expansion infinie, Comptes-Rendus de l, Académie des Sciences, vol.334, pp.77-82, 2002.
DOI : 10.1016/s1631-073x(02)02095-2

P. Curien, Playful, streamlike computation, invited paper, in Domain theory, logic and computation, Proceedings of the International Symposium on Domain Theory Series Semantic structures in computation, pp.1-24, 2001.

P. Curien, Introduction to linear logic and ludics, part II
URL : https://hal.archives-ouvertes.fr/hal-00003939

R. David and W. Py, ?µ-calculus and Böhm's theorem, Journal of Symbolic Logic, vol.66, issue.1, 2001.

W. Felscher, Dialogues, strategies, and intuitionistic provability, Annals of Pure and Applied Logic, vol.28, issue.3, pp.217-254, 1985.
DOI : 10.1016/0168-0072(85)90016-8
URL : http://doi.org/10.1016/0168-0072(85)90016-8

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

J. Girard, Geometry of Interaction 1: Interpretation of System F, Proc. Logic Colloquium '88, pp.221-260, 1989.
DOI : 10.1016/S0049-237X(08)70271-4

J. Girard, Locus solum: from the rules of logic to the logic of rules, Mathematical Structures in Computer Science, vol.11, issue.3, pp.301-506, 2001.

H. Herbelin, Games and weak-head reduction for classical PCF, Proceedings of TLCA 97, pp.214-230
DOI : 10.1007/3-540-62688-3_38
URL : https://hal.archives-ouvertes.fr/inria-00381542

K. Honda and N. Yoshida, Game-theoretic analysis of call-by-value computation, Proc. ICALP 97, 1997.

M. Hyland and L. Ong, On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917

. Th and . Joly, Codages, séparabilité et représentation de fonctions en ?-calcul simplement typé et dans d'autres systèmes de types, Thèse de doctorat, 2000.

J. Krivine, A call-by-name lambda-calculus machine, Higher-Order and Symbolic Computation

H. Nickau, Hereditarily sequential functionals, Proc. Symp, pp.253-264, 1994.
DOI : 10.1007/3-540-58140-5_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2978

M. Parigot, ?µ-calculus, an algorithmic interpretation of classical natural deduction, Proc. LPAR 92, 1992.

G. 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

G. Plotkin, LCF considered as a programming language, Theoretical Computer Science, vol.5, issue.3, pp.223-257, 1977.
DOI : 10.1016/0304-3975(77)90044-5

A. Saurin, Separation and the ?µ-calculus, Proceedings of Logic in Computer Sciencer, 2005.