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

L. Steffen-van-bakel, &. Cardelli, and . Vigliotti, Classical cut-elimination in the ?- calculus, 2014.

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

E. Beffara and &. , 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

E. Beffara and &. , Proofs as Executions, Proceedings of IFIP TCS, pp.280-294, 2012.
DOI : 10.1007/978-3-642-33475-7_20
URL : https://hal.archives-ouvertes.fr/hal-00586459

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

P. Bruscoli, A Purely Logical Account of Sequentiality in Proof Search, International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science 2401, pp.302-316, 2002.
DOI : 10.1007/3-540-45619-8_21

L. Caires and &. Pfenning, Session Types as Intuitionistic Linear Propositions, Proceedings of the 21st International Conference on Concurrency Theory, pp.222-23610, 2010.
DOI : 10.1007/978-3-642-15375-4_16

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

V. Danos and &. Laurent-regnier, The structure of multiplicatives, Archive for Mathematical Logic, vol.28, issue.3, pp.181-20310, 1989.
DOI : 10.1007/BF01622878

T. Ehrhard and &. Laurent, Interpreting a finitary pi-calculus in differential interaction nets, Information and Computation, vol.208, issue.6, pp.606-633, 2010.
DOI : 10.1016/j.ic.2009.06.005
URL : https://hal.archives-ouvertes.fr/hal-00483780

T. Ehrhard and &. Laurent-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-10110, 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, pp.97-124, 1996.

M. Hennessy and &. 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 &. Laurent, An exact correspondence between a typed ?calculus and polarised proof-nets, Theoretical Computer Science, vol.411, pp.22-24, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00483227

C. Laneve and &. Victor, Solos in concert, Mathematical Structures in Computer Science, vol.13, issue.5, pp.657-68310, 2003.
DOI : 10.1017/S0960129503004055

F. Maurel, Nondeterministic Light Logics and NP-Time, Typed Lambda Calculi and Applications, Lecture Notes in Computer Science 2701, pp.241-25510, 2003.
DOI : 10.1007/3-540-44904-3_17

D. Miller, The ??-calculus as a theory in linear logic: Preliminary results, Extensions of Logic Programming, Third International Workshop (WELP'92), pp.242-26410, 1992.
DOI : 10.1007/3-540-56454-3_13

D. Miller and &. Tiu, A proof theory for generic judgments, ACM Transactions on Computational Logic, vol.6, issue.4, pp.749-783, 2005.
DOI : 10.1145/1094622.1094628

R. Milner, Communication and concurrency, 1989.

V. Mogbil, Non-deterministic boolean proof nets Foundational and Practical Aspects of Resource Analysis, Marko van Eekelen & Olha Shkaravska, pp.131-145, 2010.

K. Terui, Proof nets and Boolean circuits, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.182-191, 2004.
DOI : 10.1109/LICS.2004.1319612

A. Tiu and &. Miller, A Proof Search Specification of the ??-Calculus, Electronic Notes in Theoretical Computer Science, vol.138, issue.1, pp.79-101, 2005.
DOI : 10.1016/j.entcs.2005.05.006

G. Winskel, Event structures, Lecture Notes in Computer Science, vol.255, pp.325-39210, 1987.
DOI : 10.1007/3-540-17906-2_31
URL : https://hal.archives-ouvertes.fr/hal-00148921

N. Yoshida, M. Berger, and &. Honda, Strong normalisation in the ?calculus, 16th Annual IEEE Symposium on Logic in Computer Science, pp.311-322, 2001.