Andrea Asperti (1995):
Linear Logic, Comonads and Optimal Reduction.
Fundamenta Informaticae 22(1–2),
pp. 3–22,
doi:10.3233/FI-1995-22121.
Patrick Baillot & Damiano Mazza (2010):
Linear Logic by Levels and Bounded Time Complexity.
Theoretical Computer Science 411(2),
pp. 470–503,
doi:10.1016/j.tcs.2009.09.015.
Pierre Boudes, Damiano Mazza & Lorenzo Tortora de Falco (2015):
An abstract approach to stratification in linear logic.
Information and Computation 241,
pp. 32–61,
doi:10.1016/j.ic.2014.10.006.
Flavien Breuvart & Michele Pagani (2015):
Modelling Coeffects in the Relational Semantics of Linear Logic.
In: Stephan Kreutzer: 24th EACSL Annual Conference on Computer Science Logic (CSL),
LIPIcs 41.
Schloss Dagstuhl,
pp. 567–581,
doi:10.4230/LIPIcs.CSL.2015.567.
Kaustuv Chaudhuri (2014):
Undecidability of Multiplicative Subexponential Logic.
In: Sandra Alves & Iliano Cervesato: Proceedings Third International Workshop on Linearity,
Electronic Proceedings in Theoretical Computer Science 176,
pp. 1–8,
doi:10.4204/EPTCS.176.1.
Vincent Danos & Jean-Baptiste Joinet (2003):
Linear logic and elementary time.
Information and Computation 183(1),
pp. 123–137,
doi:10.1016/S0890-5401(03)00010-5.
Vincent Danos, Jean-Baptiste Joinet & Harold Schellinx (1993):
The structure of exponentials: uncovering the dynamics of linear logic proofs.
In: G. Gottlob, A. Leitsch & D. Mundici: Computational Logic and Proof Theory,
Lecture Notes in Computer Science 713.
Springer,
pp. 159–171,
doi:10.1007/BFb0022564.
Jean-Yves Girard (1987):
Linear logic.
Theoretical Computer Science 50,
pp. 1–102,
doi:10.1016/0304-3975(87)90045-4.
Jean-Yves Girard (1998):
Light Linear Logic.
Information and Computation 143(2),
pp. 175–204,
doi:10.1006/inco.1998.2700.
Jean-Yves Girard (2001):
Locus Solum: From the rules of logic to the logic of rules.
Mathematical Structures in Computer Science 11(3),
pp. 301–506,
doi:10.1017/S096012950100336X.
Jean-Yves Girard, Andre Scedrov & Philip J. Scott (1992):
Bounded Linear Logic: a modular approach to polynomial time computability.
Theoretical Computer Science 97,
pp. 1–66,
doi:10.1016/0304-3975(92)90386-T.
Yves Lafont (2004):
Soft Linear Logic and Polynomial Time.
Theoretical Computer Science 318(1–2),
pp. 163–180,
doi:10.1016/j.tcs.2003.10.018.
Vivek Nigam & Dale Miller (2009):
Algorithmic specifications in linear logic with subexponentials.
In: António Porto & Francisco Javier López-Fraguas: Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP),
pp. 129–140,
doi:10.1145/1599410.1599427.
Michele Pagani & Lorenzo Tortora de Falco (2010):
Strong normalization property for second order linear logic.
Theoretical Computer Science 411(2),
pp. 410–444,
doi:10.1016/j.tcs.2009.07.053.
eptcs@eptcs.org