Denis Bechet, Philippe de Groote & Christian Retoré (1997):
A complete axiomatisation of the inclusion of series-parallel partial orders.
In: H. Comon: Rewriting Techniques and Applications, RTA`97,
LNCS 1232.
Springer Verlag,
pp. 230–240,
doi:10.1007/3-540-62950-5_74.
Thomas Ehrhard (1993):
Hypercoherences: a strongly stable model of linear logic.
Mathematical Structures in Computer Science 3(4),
pp. 365–385,
doi:10.1017/S0960129500000281.
Gehrard Gentzen (1934):
Untersuchungen über das logische Schließen I.
Mathematische Zeitschrift 39,
pp. 176–210,
doi:10.1007/BF01201353.
Traduction Française de R. Feys et J. Ladrière: Recherches sur la déduction logique, Presses Universitaires de France, Paris, 1955.
Jean-Yves Girard (1986):
The System F of Variable Types: Fifteen Years Later.
Theoretical Computer Science 45,
pp. 159–192,
doi:10.1016/0304-3975(86)90044-7.
Jean-Yves Girard (1987):
Linear Logic.
Theoretical Computer Science 50(1),
pp. 1–102,
doi:10.1016/0304-3975(87)90045-4.
Jean-Yves Girard (1991):
A new constructive logic: classical logic.
Mathematical Structures in Computer Science 1(3),
pp. 255–296,
doi:10.1017/S0960129500001328.
Jean-Yves Girard (2011):
The blind spot – lectures on logic.
European Mathematical Society,
doi:10.4171/088.
Alessio Guglielmi (1999):
A Calculus of Order and Interaction.
Technical Report WV-99-04.
Dresden University of Technology.
Alessio Guglielmi (2007):
A System of Interaction and Structure.
ACM Transactions on Computational Logic 8(1),
pp. 1–64,
doi:10.1145/1182613.1182614.
Alessio Guglielmi (2017):
Decoupling normalization mechanisms with an eye toward concurrency.
Talk at ENS LYON seminar: programs and proofs..
Slides: http://cs.bath.ac.uk/ag/t/DNMWAETC.pdf.
Alessio Guglielmi & Lutz Straßburger (2001):
Non-commutativity and MELL in the Calculus of Structures.
In: L. Fribourg: CSL 2001,
Lecture Notes in Computer Science 2142.
Springer-Verlag,
pp. 54–68,
doi:10.1007/3-540-44802-0_5.
Alessio Guglielmi & Lutz Straßburger (2011):
A System of Interaction and Structure IV: The Exponentials and Decomposition.
ACM transaction of computational logic 12(4),
pp. 23,
doi:10.1145/1970398.1970399.
Yubao Guo & Michel Surmacs (2018):
Miscellaneous Digraph Classes.
In: J. Bang-Jensen & G. Gutin: Classes of Directed Graphs, chapter 11.
Springer,
pp. 517–574,
doi:10.1007/978-3-319-71840-8_11.
Ralph Loader (1994):
Linear Logic, Totality and Full Completeness.
In: LICS: IEEE symposium on Logic In Computer Science,
pp. 292–298,
doi:10.1109/LICS.1994.316060.
Lê Thành D~ung Nguyên (2019):
Proof nets through the lens of graph theory: a compilation of remarks.
Available at https://arxiv.org/abs/1912.10606.
Tito Nguyen & Lutz Straßburger (2021):
A complexity gap between pomset logic and system BV.
Talk at the informal workshop on Proof-Net of the GDR-I Linear Logic.
Myriam Quatrini (1995):
Sémantique cohérente des exponentielles: de la logique linéaire à la logique classique.
Thèse de Doctorat, spécialité Mathématiques.
Université Aix-Marseille 2.
Christian Retoré (1994):
On the relation between coherence semantics and multiplicative proof nets.
Rapport de Recherche RR-2430.
INRIA.
Available at https://hal.inria.fr/inria-00074245.
Christian Retoré (1994):
A self-dual modality for "before" in the category of coherence spaces and in the category of hypercoherences..
Rapport de Recherche RR-2432.
INRIA.
Available at https://hal.inria.fr/inria-00074243.
Christian Retoré (1994):
Une modalité autoduale pour le connecteur ``précède''.
In: Pierre Ageron: Catégories, Algèbres, Esquisses et Néo-Esquisses,
Publications du Département de Mathématiques, Université de Caen,
pp. 11–16.
Christian Retoré (1996):
Perfect matchings and series-parallel graphs: multiplicative proof nets as R&B-graphs.
In: J.-Y. Girard, M. Okada & A. Scedrov: Linear`96,
Electronic Notes in Theoretical Science 3.
Elsevier,
pp. 167–182,
doi:10.1016/S1571-0661(05)80416-5.
Http://www.elsevier.nl/.
Christian Retoré (1997):
Pomset logic: a non-commutative extension of classical linear logic.
In: Philippe de Groote & James Roger Hindley: Typed Lambda Calculus and Applications, TLCA'97,
LNCS 1210,
pp. 300–318,
doi:10.1007/3-540-62688-3_43.
Christian Retoré (1997):
A semantic characterisation of the correctness of a proof net.
Mathematical Structures in Computer Science 7(5),
pp. 445–452,
doi:10.1017/S096012959700234X.
Christian Retoré (1999):
Pomset logic as a calculus of directed cographs.
In: V. M. Abrusci & C. Casadio: Dynamic Perspectives in Logic and Linguistics: Proof Theoretical Dimensions of Communication Processes,Proceedings of the 4th Roma Workshop.
Bulzoni,
Roma,
pp. 221–247.
INRIA Research Report RR-3714 https://hal.inria.fr/inria-00072953.
Christian Retoré (2021):
Pomset logic: The other approach to non commutativity in logic.
In: Claudia Casadio & Philip J. Scott: Joachim Lambek: on the interplay of mathematics, logic and linguistics,
Outstanding contributions to logic.
Springer Verlag,
pp. 299–246,
doi:10.1007/978-3-030-66545-6.
eptcs@eptcs.org