.. Reduction-rules-for-net-structures, 17 2.5.1 The communication reduction rule 17 2.5.2 The non-deterministic reduction rules The structural reduction rules, Rétoré neutrality reduction rules

.. Generalized-reduction, 19 2.7.1 Cocontraction and contraction trees, p.20

R. Amadio and P. Curien, Domains and lambda-calculi, volume 46 of Cambridge Tracts in Theoretical Computer Science, 1998.

S. Abramsky and P. Melliès, Concurrent games and full completeness, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 1999.
DOI : 10.1109/LICS.1999.782638

[. Berry and G. Boudol, The chemical abstract machine, Proceedings of the 17h ACM Symposium on Principles of Programming Languages (POPL), pp.81-94, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00075426

A. Bucciarelli and T. Ehrhard, On phase semantics and denotational semantics: the exponentials, Annals of Pure and Applied Logic, vol.109, issue.3, pp.205-241, 2001.
DOI : 10.1016/S0168-0072(00)00056-7
URL : https://hal.archives-ouvertes.fr/hal-00527042

M. Berger, K. Honda, and N. Yoshida, Strong normalisability in the pi-calculus. Information and Computation, 2003.

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

G. Bellin and J. Van-de-wiele, Subnets of proofnets in MLL, Advances in Linear Logic, pp.249-270, 1995.

M. Coppo, M. Dezani-ciancaglini, and B. Venneri, Principal type schemes and lambda-calculus semantics, To H. B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, 1980.

P. Curien and C. Faggian, An approach to innocent strategies as graphs, Preuves, Programmes et Systèmes, 2006.
DOI : 10.1016/j.ic.2011.12.006
URL : https://hal.archives-ouvertes.fr/hal-00155293

V. Danos and L. Regnier, Reversible, irreversible and optimal lambda-machines, Theoretical Computer Science, vol.227, issue.12, pp.273-291, 1999.
DOI : 10.1016/s0304-3975(99)00049-3
URL : http://doi.org/10.1016/s0304-3975(99)00049-3

T. Ehrhard, Hypercoherences: a strongly stable model of linear logic, Mathematical Structures in Computer Science, vol.1, issue.04, pp.365-385, 1993.
DOI : 10.1016/0304-3975(77)90044-5
URL : https://hal.archives-ouvertes.fr/hal-00527026

T. Ehrhard, On Köthe sequence spaces and linear logic, Mathematical Structures in Computer Science, vol.12, pp.579-623, 2002.

T. Ehrhard, Finiteness spaces, Mathematical Structures in Computer Science, vol.15, issue.4, pp.615-646, 2005.
DOI : 10.1017/S0960129504004645
URL : https://hal.archives-ouvertes.fr/hal-00150276

T. Ehrhard and O. Laurent, Embedding the finitary pi-calculus in differential interaction nets, Proceedings of the Higher Order Rewriting workshop, 2006.

T. Ehrhard and L. Regnier, Differential interaction nets, Proceedings of WoL- LIC'04, pp.35-74, 2004.
DOI : 10.1016/j.tcs.2006.08.003
URL : https://hal.archives-ouvertes.fr/hal-00150274

U. Engberg and G. Winskel, Completeness results for linear logic on Petri nets, Annals of Pure and Applied Logic, vol.86, issue.2, pp.101-135, 1997.
DOI : 10.1016/S0168-0072(96)00024-3

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, Normal functors, power series and ??-calculus, Annals of Pure and Applied Logic, vol.37, issue.2, pp.129-177, 1988.
DOI : 10.1016/0168-0072(88)90025-5

J. Girard, Proof-nets: The parallel syntax for proof-theory, Logic and Algebra, pp.97-124, 1996.

J. Girard, Coherent Banach spaces: a continuous denotational semantics, Theoretical Computer Science, vol.227, issue.1-2, pp.275-297, 1999.
DOI : 10.1016/S0304-3975(99)00056-0

J. Girard, On the meaning of logical rules II: multiplicative/additive case, Foundation of Secure Computation, 2000.

J. Girard, Between Logic and Quantic: a Tract, Linear Logic in Computer Science, pp.346-381, 2004.
DOI : 10.1017/CBO9780511550850.011

R. Hasegawa, Two applications of analytic functors, Theoretical Computer Science, vol.272, issue.1-2, pp.113-175, 2002.
DOI : 10.1016/S0304-3975(00)00349-2

K. Honda and O. Laurent, Processes and polarized proof-nets, Preuves, Programmes et Systèmes, 2006.

P. Hyvernat, Predicate Transformers and Linear Logic: Yet Another Denotational Model, Proceedings of the 18th Annual Conference of the European Association for Computer Science Logic, pp.115-129, 2004.
DOI : 10.1007/978-3-540-30124-0_12
URL : https://hal.archives-ouvertes.fr/hal-00387490

O. Jensen and R. Milner, Bigraphs and mobile processes (revised), 2004.

Y. Lafont, From proof nets to interaction nets, Advances in Linear Logic Proceedings of the Workshop on Linear Logic, pp.225-247, 1993.
DOI : 10.1017/CBO9780511629150.012

C. Laneve, J. Parrow, and B. Victor, Solo Diagrams, Proceedings of the 4th conference on Theoretical Aspects of Computer Science, TACS'01, number 2215 in Lecture Notes in Computer Science, 2001.
DOI : 10.1007/3-540-45500-0_6

D. Mazza, Multiport Interaction Nets and Concurrency, Proceedings of CONCUR 2005, number 3653 in Lecture Notes in Computer Science, pp.21-35, 2005.
DOI : 10.1007/11539452_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.576.2413

[. Milner, The polyadic pi-calculus: a tutorial, Logic and Algebra of Specification, pp.203-246, 1993.

G. Plotkin, A Powerdomain Construction, SIAM Journal on Computing, vol.5, issue.3, pp.452-487, 1976.
DOI : 10.1137/0205035

D. Sangiorgi and D. Walker, The pi-calculus: a Theory of Mobile Processes, 2001.

D. Van-glabbeek and . Hughes, Proof nets for unit-free multiplicative additive linear logic, ACM transactions on computational logic, pp.784-842, 2005.