E.S. Bainbridge
Peter J. Freyd
Andre Scedrov
Philip J. Scott
1990
Functorial polymorphism
Theoretical Computer Science
70
35–64
10.1016/0304-3975(90)90151-7
Michael Barr
1979
^*-Autonomous Categories
Lecture Notes in Mathematics
752
Springer-Verlag
Berlin, Heidelberg
10.1007/BFb0064582
R. F. Blute
P. J. Scott
1996
Linear Läuchli semantics
Ann. Pure Appl. Logic
77
2
101–142
10.1016/0168-0072(95)00017-8
Richard Blute
1991
Proof nets and coherence theorems
P.L. Curien
S. Abramsky
A.M. Pitts
A. Poigné
D.E. Rydeheard
Category Theory and Computer Science. CTCS 1991
Lecture Notes in Computer Science
530
Springer
Berlin, Heidelberg
121–137
10.1007/BFb0013461
Richard Blute
1993
Linear Logic, coherence and dinaturality
Theoretical Computer Science
115
1
3–41
10.1016/0304-3975(93)90053-V
Richard Blute
Robin Cockett
R.A.G. Seely
T.H. Trimble
1996
Natural deduction and coherence for weakly distributive categories
Journal of Pure and Applied Algebra
113
229
296
10.1016/0022-4049(95)00159-X
Daniel de Carvalho
Lorenzo Tortora de Falco
2012
The relational model is injective for multiplicative exponential linear logic (without weakenings)
Annals of Pure and Applied Logic
163
9
1210–1236
10.1016/j.apal.2012.01.004
Lorenzo Tortora de Falco
2000
Réseaux, cohérence et expériences obsessionnelles
Université Paris 7
Fernando Ferreira
Gilda Ferreira
2009
Commuting conversions vs. the standard conversions of the "good" connectives
Studia Logica
92
1
63–84
10.1007/s11225-009-9186-1
Fernando Ferreira
Gilda Ferreira
2013
Atomic polymorphism
Journal of Symbolic Logic
78
1
260–274
10.1007/s10992-005-9001-z
M.P. Fiore
A. Jung
E. Moggi
P. O'Hearn
J. Riecke
G. Rosolini
I. Stark
1996
Domains and denotational semantics: history, accomplishments and open problems
Bulletin EATCS
59
227–256
Jürgen Fuchs
Christoph Schweigert
Carl Stigner
2012
Modular invariant Frobenius algebras from ribbon Hopf algebra automorphisms
Journal of Algebra
363
29–72
10.1016/j.jalgebra.2012.04.008
Jean-Yves Girard
1987
Linear logic
Theoretical Computer Science
50
1
1–102
10.1016/0304-3975(87)90045-4
Jean-Yves Girard
1988
Quantifiers in Linear Logic
Atti del congresso "Temi e Prospettive della Logica e della Filosofia della Scienza", Cesena, 7-10 Gennaio 1987
CLUEB
Bologna
Jean-Yves Girard
1991
Quantifiers in Linear Logic II
Atti del congresso "Nuovi Problemi della Logica e della Filosofia della Scienza", Viareggio, 8-13 Gennatio 1990
CLUEB
Bologna
Jean-Yves Girard
Andre Scedrov
Philip J. Scott
1992
Normal forms and cut-free proofs as natural transformations
Y. Moschovakis
Logic from Computer Science
21
Springer-Verlag
217–241
10.1007/978-1-4612-2822-6_8
Rye Hasegawa
2009
Categorical data types in parametric polymorphism
Mathematical Structures in Computer Science
4
1
71–109
10.1016/S0049-237X(08)70843-7
Willem Heijltjes
Robin Houston
2014
No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete
CSL-LICS 2014
10.1145/2603088.2603126
Willem Heijltjes
Luz Straßburger
2016
Proof nets and semi-star-autonomous categories
Mathematical Structures in Computer Science
26
5
789–828
10.1016/0001-8708(91)90003-P
Robin Houston
Dominic Hughes
Andrea Schalk
2017
Modeling Linear Logic without Units (Preliminary Results)
https://arxiv.org/pdf/math/0504037.pdf
Dominic J.D. Hughes
Unification nets: canonical proof net quantifiers
https://arxiv.org/abs/1802.03224
Dominic J.D. Hughes
2012
Simple free star-autonomous categories and full coherence
Journal of Pure and Applied Algebra
216
11
2386–2410
10.1016/j.jpaa.2012.03.020
Thomas Kerler
Volodymyr V. Lyubashenko
2001
Coends and construction of Hopf algebras
Non-Semisimple Topological Quantum Field Theoreis for 3-Manifols with Corners
5
Lecture Notes in Mathematics
1765
Springer
Berlin, Heidelberg
10.1007/3-540-44625-7_6
François Lamarche
Luz Straßburger
2004
On proof nets for multiplicative linear logic with units
CSL 2004
Lecture Notes in Computer Science
3210
145–159
10.1007/978-3-540-30124-0_14
François Lamarche
Luz Straßburger
2006
From Proof Nets to the Free ^*-Autonomous Category
Logical Methods in Computer Science
2
4
10.2168/LMCS-2(4:3)2006
Joachim de Lataillade
2009
Dinatural terms in System F
Proceedings of the Twenty-Fourth Annual IEEE Symposium on Logic in Computer Science (LICS 2009)
IEEE Computer Society Press
Los Angeles, California, USA
267–276
10.1109/LICS.2009.30
Fosco Loregian
2015
This is the (co)end, my only (co)friend
https://arxiv.org/abs/1501.02503
Saunders MacLane
1978
Categories for the working mathematicians
Graduate Texts in Mathematics
5
Springer-Verlag
New York
10.1007/978-1-4757-4721-8
Richard McKinley
2013
Proof nets for Herbrand's theorem
ACM Transactions on Computational Logic
14
1
10.1145/2422085.2422090
Paul-André Melliès
2012
Game semantics in string diagrams
LICS '12
New Orleans, Louisiana
481–490
10.1109/LICS.2012.58
Paul-André Melliès
Noam Zeilberger
2016
A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
LICS '16
New York
555–564
10.1145/2933575.2934525
Paolo Pistone
2018
Proof nets and the instantiation overflow property
https://arxiv.org/abs/1803.09297
Gordon Plotkin
Martin Abadi
1993
A logic for parametric polymorphism
TLCA '93, International Conference on Typed Lambda Calculi and Applications
Lecture Notes in Computer Science
664
Springer Berlin Heidelberg
361–375
10.1007/BFb0037118
R.A.G. Seely
1990
Polymorphic linear logic and topos models
Comptes Rendus Mathématiques de l'Académie des Sciences Canada
12
1
Luz Straßburger
2009
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
P.L. Curien
TLCA 2009
Lecture Notes in Computer Science
5608
309–324
10.1007/BF01622878
Luca Tranchini
Paolo Pistone
Mattia Petrolo
2017
The naturality of natural deduction
Studia Logica
10.1007/s11225-017-9772-6
Todd Trimble
1994
Linear logic, bimodules, and full coherence for autonomous categories
Rutgers University
Tarmo Uustalu
Varmo Vene
2011
The Recursion Scheme from the Cofree Recursive Comonad
Electronic Notes in Theoretical Computer Science
229
5
135–157
10.1016/j.entcs.2011.02.020