S. Abramsky, Computational interpretations of linear logic, Theoretical Computer Science, vol.111, issue.1-2, pp.3-57, 1993.
DOI : 10.1016/0304-3975(93)90181-R

S. Abramsky, Proofs as processes, Theoretical Computer Science, vol.135, issue.1, pp.5-9, 1994.
DOI : 10.1016/0304-3975(94)00103-0

E. Beffara, A Concurrent Model for Linear Logic, 21st International Conference on Mathematical Foundations of Programming Semantics (MFPS), pp.147-168, 2006.
DOI : 10.1016/j.entcs.2005.11.055
URL : https://hal.archives-ouvertes.fr/hal-00151820

G. Bellin and P. J. Scott, On the ??-calculus and linear logic, Theoretical Computer Science, vol.135, issue.1, pp.11-65, 1994.
DOI : 10.1016/0304-3975(94)00104-9

M. Berger, K. Honda, and N. Yoshida, Genericity and the ?-calculus, 6th International Conference on Foundations of Software Science and Computational Structures (FoSSaCS), pp.103-119, 2003.

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

V. Danos, J. Joinet, and H. Schellinx, Lkq and lkt: Sequent calculi for second order logic based upon linear decomposition of classical implication, Advances in Linear Logic, pp.211-224, 1995.

V. Danos, J. Joinet, and H. Schellinx, Abstract, The Journal of Symbolic Logic, vol.II, issue.03, pp.755-807, 1996.
DOI : 10.1007/BF00885763
URL : https://hal.archives-ouvertes.fr/inria-00528352

V. Danos and L. Regnier, How abstract machines implement head linear reduction, 2003.

P. Gardner and L. Wischik, Explicit Fusions, 25th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp.373-382, 2000.
DOI : 10.1007/3-540-44612-5_33

K. Honda, N. Yoshida, and M. Berger, Control in the ?-calculus, 4th ACM-SIGPLAN Continuation Workshop, 2004.

J. Martin, E. Hyland, and C. Ong, Pi-calculus, dialogue games and pcf, 7th ACM Conference on Functional Programming Languages and Computer Architecture, pp.96-107, 1995.

R. Milner, Functions as processes, 17th International Colloquium on Automata, Languages and Programming (ICALP), pp.167-180, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00075405

M. Parigot, ????-Calculus: An algorithmic interpretation of classical natural deduction, 3rd International Conference on Logic Programming and Automated Reasoning (LPAR), pp.190-201, 1992.
DOI : 10.1007/BFb0013061

L. Regnier, Une ??quivalence sur les lambda- termes, Theoretical Computer Science, vol.126, issue.2, pp.281-292, 1994.
DOI : 10.1016/0304-3975(94)90012-4