A. Asperti, A linguistic approach to dead-lock, 1991.

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

A. Guglielmi, Concurrency and plan generation in a logic programming language with a sequential operator, International Conference on Logic Programming, pp.240-254, 1994.

A. Lecomte and C. Retoré, Pomset logic as an alternative categorial grammar, Formal Grammar, pp.181-196, 1995.

A. Lecomte and C. Retoré, Words as modules and modules as partial proof nets in a lexicalised grammar, Third Roma Workshop: Proofs and Linguistics Categories ? Applications of Logic to the analysis and implementation of Natural Language, pp.187-198, 1996.

A. Lecomte and C. Retoré, Words as Modules, Mathematical and Computational Analysis of Natural Language ? selected papers from ICML'96 of Studies in Functional and Structural Linguistics, pp.129-144, 1998.
DOI : 10.1075/sfsl.45.14lec
URL : https://hal.archives-ouvertes.fr/inria-00098440

L. Lovàsz and M. D. Plummer, Matching Theory, Mathematics Studies Annals of Discrete Mathematics, vol.121, issue.29, 1986.
DOI : 10.1090/chel/367

R. H. Möhring, Computationally Tractable Classes of Ordered Sets, Algorithms and Order, pp.105-194, 1989.
DOI : 10.1007/978-94-009-2639-4_4

C. Retoré, Réseaux et Séquents Ordonnés, Thèse de Doctorat, spécialité Mathématiques, 1993.

C. Retoré, On the relation between coherence semantics and multiplicative proof nets, 1994.

C. Retoré, Pomset logic: A non-commutative extension of classical linear logic, Typed Lambda Calculus and Applications, TLCA'97, pp.300-318, 1997.
DOI : 10.1007/3-540-62688-3_43

C. Retoré, A semantic characterisation of the correctness of a proof net, Mathematical Structures in Computer Science, vol.7, issue.5, pp.445-452, 1997.
DOI : 10.1017/S096012959700234X

C. Retoré, Handsome proof-nets: perfect matchings and cographs, Theoretical Computer Science, vol.294, issue.3, 1999.
DOI : 10.1016/S0304-3975(01)00175-X

C. Retoré, Handsome proof-nets: R&B-graphs, perfect matchings and series-parallel graphs, 1999.

R. , U. De-recherche, I. Lorraine, V. Technopôle-de-nancy-brabois, I. Unité-de-recherche et al., Campus scientifique, 615 rue du Jardin Botanique Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, p.78153, 2004.