[. Blute, R. Cockett, R. Seely, and T. Trimble, Natural deduction and coherence for weakly distributive categories, Journal of Pure and Applied Algebra, vol.113, issue.3, pp.229-296, 1996.
DOI : 10.1016/0022-4049(95)00159-X

F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

[. Bechet, P. De-groote, and C. Retoré, A complete axiomatisation for the inclusion of series-parallel partial orders, RTA 1997, pp.230-240, 1997.
DOI : 10.1007/3-540-62950-5_74

K. Brünnler, Deep Inference and Symmetry for Classical Proofs, 2003.

K. Brünnler and A. Tiu, A Local System for Classical Logic, LNAI, vol.2250, pp.347-361, 2001.
DOI : 10.1007/3-540-45653-8_24

P. Di and G. , Structures for multiplicative cyclic linear logic: Deepness vs cyclicity, LNCS, vol.3210, pp.130-144, 2004.

H. Devarajan, D. Hughes, G. Plotkin, and V. R. Pratt, Full completeness of the multiplicative linear logic of Chu spaces, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 1999.
DOI : 10.1109/LICS.1999.782619

K. Do?en and Z. Petri´cpetri´c, Proof-Theoretical Coherence, 2004.

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

A. Fleury and C. Retoré, The mix rule, Mathematical Structures in Computer Science, vol.28, issue.02, pp.273-285, 1994.
DOI : 10.1016/0304-3975(93)90181-R

A. Guglielmi and L. Straßburger, Non-commutativity and MELL in the Calculus of Structures, Computer Science Logic LNCS, vol.2142, pp.54-68, 2001.
DOI : 10.1007/3-540-44802-0_5

A. Guglielmi, A system of interaction and structure, ACM Transactions on Computational Logic, vol.8, issue.1, 2007.
DOI : 10.1145/1182613.1182614

URL : https://hal.archives-ouvertes.fr/inria-00441214

J. D. Dominic and . Hughes, Proofs Without Syntax, Annals of Mathematics, vol.164, issue.3, pp.1065-1076, 2006.

F. Lamarche, Exploring the gap between linear and classical logic, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00113785

[. Lane, Categories for the Working Mathematician. Number 5 in Graduate Texts in Mathematics, 1971.

R. H. Möhring, Computationally tractable classes of ordered sets [Ret93] Christian Retoré Réseaux et Séquents Ordonnés [Ret96] Christian Retoré. Perfect matchings and series-parallel graphs: multiplicatives proof nets as R&B-graphs Handsome proof-nets: perfect matchings and cographs, Thèse de Doctorat, spécialité mathématiquesRet03] Christian RetoréStr02] Lutz Straßburger. A local system for linear logic, pp.105-194473, 1989.

L. Straßburger, Linear Logic and Noncommutativity in the Calculus of Structures, 2003.

L. Straßburger, MELL in the calculus of structures, Theoretical Computer Science, vol.309, issue.1-3, pp.1-3213, 2003.
DOI : 10.1016/S0304-3975(03)00240-8

L. Straßburger, On the axiomatisation of Boolean categories with and without medial, 2005.