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, Electronic Notes in Theoretical Computer Science, vol.155, pp.147-168, 2006.
DOI : 10.1016/j.entcs.2005.11.055
URL : https://hal.archives-ouvertes.fr/hal-00151820

E. Beffara and F. Maurel, Concurrent nets: A study of prefixing in process calculi, Theoretical Computer Science, vol.356, issue.3, pp.356-373, 2006.
DOI : 10.1016/j.tcs.2006.02.009
URL : https://hal.archives-ouvertes.fr/hal-00009192

L. Caires and F. Pfenning, Session Types as Intuitionistic Linear Propositions, LNCS, vol.6269, pp.222-236, 2010.
DOI : 10.1007/978-3-642-15375-4_16

V. Danos and L. Regnier, The structure of multiplicatives, Archive for Mathematical Logic, vol.28, issue.3, pp.181-203, 1989.
DOI : 10.1007/BF01622878

P. Jacobé-de-naurois and V. Mogbil, Correctness of linear logic proof structures is <mml:math altimg="si1.gif" display="inline" 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>N</mml:mi><mml:mi>L</mml:mi></mml:math>-complete, Theoretical Computer Science, vol.412, issue.20, pp.1941-1957, 2011.
DOI : 10.1016/j.tcs.2010.12.020

T. Ehrhard and O. Laurent, Interpreting a finitary ?-calculus in differential interaction nets, LNCS, vol.4703, pp.333-348, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00483780

T. Ehrhard and L. Regnier, Differential interaction nets, Theoretical Computer Science, vol.364, issue.2, pp.166-195, 2006.
DOI : 10.1016/j.tcs.2006.08.003
URL : https://hal.archives-ouvertes.fr/hal-00150274

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, Proof-nets : the parallel syntax for proof theory. Logic and Algebra, 1996.

M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-161, 1985.
DOI : 10.1145/2455.2460

K. Honda and O. Laurent, An exact correspondence between a typed pi-calculus and polarised proof-nets, Theoretical Computer Science, vol.411, issue.22-24, pp.22-242223, 2010.
DOI : 10.1016/j.tcs.2010.01.028
URL : https://hal.archives-ouvertes.fr/hal-00483227

C. Laneve and B. Victor, Solos in concert, pp.513-523, 1999.

H. Mairson and K. Terui, On the Computational Complexity of Cut-Elimination in Linear Logic, ICTCS, pp.23-36, 2003.
DOI : 10.1007/978-3-540-45208-9_4

K. Mazurak and S. Zdancewic, Lolliproc: to concurrency from classical linear logic via curry-howard and control, ICFP, pp.39-50, 2010.

R. Milner, Communication and concurrency, 1989.

N. Yoshida, M. Berger, and K. Honda, Strong normalisation in the ?-calculus, LICS, pp.311-322, 2001.