B. Accattoli, Jumping around the box: graphical and operational studies on ? -calculus and Linear Logic, 2011.

B. Accattoli, A linear analysis of call-by-value ? -calculus. Available at the address https, 2012.

B. Accattoli and &. Guerrini, Jumping Boxes, pp.55-70978, 2009.
DOI : 10.1142/9789812815149_0001

B. Accattoli and &. Kesner, The Structural ??-Calculus, pp.381-395978, 2010.
DOI : 10.1007/978-3-642-15205-4_30
URL : https://hal.archives-ouvertes.fr/hal-00528228

B. Accattoli and &. Paolini, Call-by-Value Solvability, Revisited, pp.4-16978, 2012.
DOI : 10.1007/978-3-642-29822-6_4
URL : https://hal.archives-ouvertes.fr/hal-00780358

V. Danos, La Logique Linéaire appliquéappliqué`appliquéà l'´ etude de divers processus de normalisation (principalement du ? -calcul), 1990.

V. Danos and &. Laurent-regnier, Proof-nets and the Hilbert space, pp.307-328, 1995.
DOI : 10.1017/CBO9780511629150.016

V. Danos and &. Laurent-regnier, Reversible, irreversible and optimal ??-machines, Theoretical Computer Science, vol.227, issue.1-2, pp.79-97, 1999.
DOI : 10.1016/S0304-3975(99)00049-3
URL : http://doi.org/10.1016/s0304-3975(99)00049-3

M. Fernández and &. Mackie, Call-by-Value lambda-Graph Rewriting Without Rewriting, pp.75-89, 2002.

M. Fernández and &. Siafakas, Labelled Lambda-calculi with Explicit Copy and Erase, Electronic Proceedings in Theoretical Computer Science, vol.22, pp.49-64, 2009.
DOI : 10.4204/EPTCS.22.5

C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen, The Essence of Compiling with Continuations, pp.237-247, 1993.

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

H. Herbelin and &. Zimmermann, An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in " Natural Deduction " Form, pp.142-156978, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00389903

D. Kesner and &. Stéphane-lengrand, Resource operators for ??-calculus, Information and Computation, vol.205, issue.4, pp.419-473, 2007.
DOI : 10.1016/j.ic.2006.08.008
URL : https://hal.archives-ouvertes.fr/hal-00148539

O. Laurent, Polarized Proof-Nets: Proof-Nets for LC, pp.213-227, 1999.
DOI : 10.1007/3-540-48959-2_16
URL : https://hal.archives-ouvertes.fr/hal-00009136

O. Laurent, Etude de la polarisation en logique, Thèse de doctorat, 2002.
URL : https://hal.archives-ouvertes.fr/tel-00007884

O. Laurent, Polarized proof-nets and ????-calculus, Theoretical Computer Science, vol.290, issue.1, pp.161-188, 2003.
DOI : 10.1016/S0304-3975(01)00297-3
URL : https://hal.archives-ouvertes.fr/hal-00009114

I. Mackie, Encoding Strategies in the Lambda Calculus with Interaction Nets, pp.19-36, 2005.
DOI : 10.1007/11964681_2
URL : https://hal.archives-ouvertes.fr/inria-00133323

J. Maraist, M. Odersky, D. N. Turner, and P. Wadler, Call-by-name, call-by-value, call-by-need and the linear lambda calculus, Theoretical Computer Science, vol.228, issue.1-2, pp.175-210, 1999.
DOI : 10.1016/S0304-3975(98)00358-2

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

A. Pravato, S. R. , D. Rocca, and &. Roversi, The call-by-value ??-calculus: a semantic investigation, Mathematical Structures in Computer Science, vol.9, issue.5, pp.617-650, 1999.
DOI : 10.1017/S0960129598002722

L. Regnier, Lambda-calcul et réseaux, 1992.

A. Sabry and &. Felleisen, Reasoning about Programs in Continuation-Passing Style, Lisp and Symbolic Computation, vol.634, pp.289-360, 1993.

P. Tranquilli, Nets Between Determinism and Nondeterminism, 2009.

P. Tranquilli, Intuitionistic differential nets and lambda-calculus, Theoretical Computer Science, vol.412, issue.20, pp.1979-1997, 2011.
DOI : 10.1016/j.tcs.2010.12.022

L. Vaux, ? -calcul différentiel et logique classique: interactions calculatoires, 2007.