S. Abramsky, Sequentiality vs. concurrency in games and logic, Mathematical Structures in Computer Science, vol.13, issue.4, pp.531-565, 2003.
DOI : 10.1017/S0960129503003980

L. Caires and F. Pfenning, Session Types as Intuitionistic Linear Propositions, In CONCUR LNCS, vol.6269, pp.222-236, 2010.
DOI : 10.1007/978-3-642-15375-4_16
URL : http://www.cs.cmu.edu/%7Efp/papers/concur10.pdf

R. Cockett and L. Santocanale, On the word problem for ??-categories, and the properties of two-way communication, Computer Science Logic (CSL) 18th Annual Conference of the EACSL, pp.194-208, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00374654

, Inria

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

D. Galmiche and J. Marion, Semantic Proof Search Methods for ALL ? a first approach ?. Short paper in Theorem Proving with Analytic Tableaux, 4th International Workshop (TABLEAUX'95) Available from the first author's webpage, 1995.

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, pp.97-124, 1996.

S. Guerrini and A. Masini, Parsing MELL proof nets, Theoretical Computer Science, vol.254, issue.1-2, pp.317-335, 2001.
DOI : 10.1016/S0304-3975(99)00299-6

W. Heijltjes, Classical proof forestry Annals of Pure and Applied Logic, pp.1346-1366, 2010.

W. Heijltjes, Proof Nets for Additive Linear Logic with Units, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.207-216, 2011.
DOI : 10.1109/LICS.2011.9

W. Heijltjes and D. Hughes, Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.80-91, 2015.
DOI : 10.1109/LICS.2015.18

J. Herbrand, Investigations in proof theory: The properties of true propositions From Frege to Gödel: A source book in mathematical logic, pp.1879-1931, 1967.

K. Honda, V. Vasconcelos, and M. Kubo, Language primitives and type discipline for structured communication-based programming, European Symposium on Programming, pp.122-138, 1998.
DOI : 10.1007/BFb0053567

D. Hughes, Proofs without syntax, Annals of Mathematics, vol.164, issue.3, pp.1065-1076, 2006.
DOI : 10.4007/annals.2006.164.1065

D. Hughes and W. Heijltjes, Conflict nets, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, 2016.
DOI : 10.1109/LICS.2012.58

D. Hughes and R. Van-glabbeek, Proof nets for unit-free multiplicative-additive linear logic, ACM Transactions on Computational Logic, vol.6, issue.4, pp.784-842, 2005.
DOI : 10.1145/1094622.1094629

J. D. Dominic and . Hughes, Unification nets: canonical proof net quantifiers, 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2018.

A. Joyal, Free Lattices, Communication and Money Games, Proc. 10th Int. Cong. of Logic, 1995.
DOI : 10.1007/978-94-017-0487-8_3

J. Lambek, Deductive systems and categories I, II, III. Theory of Computing Systems (I), Lecture Notes in Mathematics, pp.1968-1972

R. Maieli, Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic, 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning, pp.363-377, 2007.
DOI : 10.1007/978-3-540-75560-9_27

A. Dale and . Miller, A compact representation of proofs [22] Samuel Mimram. The structure of first-order causality, Studia Logica Mathematical Structures in Computer Science, vol.46, issue.211, pp.347-37065, 1987.

L. Straßburger, A characterisation of medial as rewriting rule, Term Rewriting and Applications, RTA'07, pp.344-358, 2007.

P. Wadler, Propositions as sessions, Journal of Functional Programming, vol.16, issue.2-3, pp.384-418, 2014.
DOI : 10.1016/0304-3975(87)90045-4