Matteo Acclavio, Ross Horne & Lutz Straßburger (2020):
Logic beyond formulas: a proof system on graphs.
In: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS'20.
ACM,
pp. 38–52,
doi:10.1145/3373718.3394763.
Kai Brünnler & Alwen Fernanto Tiu (2001):
A Local System for Classical Logic.
In: Logic for Programming, Artificial Intelligence, and Reasoning , 8th International Conference, LPAR 2001,
Lecture Notes in Computer Science 2250.
Springer,
pp. 347–361,
doi:10.1007/3-540-45653-8_24.
Daniel de Carvalho (2018):
Taylor expansion in linear logic is invertible.
Log. Methods Comput. Sci. 14(4),
doi:10.23638/LMCS-14(4:21)2018.
Thomas Ehrhard (2005):
Finiteness spaces.
Mathematical Structures in Computer Science 15(4),
pp. 615–646,
doi:10.1017/S0960129504004645.
Thomas Ehrhard (2018):
An introduction to differential linear logic: proof-nets, models and antiderivatives.
Mathematical Structures in Computer Science 28(7),
pp. 995–1060,
doi:10.1017/S0960129516000372.
Thomas Ehrhard & Olivier Laurent (2010):
Interpreting a finitary pi-calculus in differential interaction nets.
Inf. Comput. 208(6),
pp. 606–633,
doi:10.1016/j.ic.2009.06.005.
Thomas Ehrhard & Laurent Regnier (2003):
The differential lambda-calculus.
Theor. Comput. Sci. 309(1-3),
pp. 1–41,
doi:10.1016/S0304-3975(03)00392-X.
Thomas Ehrhard & Laurent Regnier (2006):
Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms.
In: Second Conference on Computability in Europe, CiE 2006,
Lecture Notes in Computer Science 3988.
Springer,
pp. 186–197,
doi:10.1007/11780342_20.
Thomas Ehrhard & Laurent Regnier (2006):
Differential interaction nets.
Theor. Comput. Sci. 364(2),
pp. 166–195,
doi:10.1016/j.tcs.2006.08.003.
Thomas Ehrhard & Laurent Regnier (2008):
Uniformity and the Taylor expansion of ordinary lambda-terms.
Theor. Comput. Sci. 403(2-3),
pp. 347–372,
doi:10.1016/j.tcs.2008.06.001.
Stéphane Gimenez (2009):
Programming, Computation and their Analysis using Nets from Linear Logic.
Theses.
Université Paris Diderot.
Available at https://tel.archives-ouvertes.fr/tel-00629013.
Stéphane Gimenez (2011):
Realizability Proof for Normalization of Full Differential Linear Logic.
In: Typed Lambda Calculi and Applications - 10th International Conference, TLCA 2011,
Lecture Notes in Computer Science 6690.
Springer,
pp. 107–122,
doi:10.1007/978-3-642-21691-6_11.
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.
Giulio Guerrieri, Luc Pellissier & Lorenzo Tortora de Falco (2016):
Computing Connected Proof(-Structure)s From Their Taylor Expansion.
In: 1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016,
LIPIcs 52.
Schloss Dagstuhl,
pp. 20:1–20:18,
doi:10.4230/LIPIcs.FSCD.2016.20.
Giulio Guerrieri, Luc Pellissier & Lorenzo Tortora de Falco (2019):
Proof-Net as Graph, Taylor Expansion as Pullback.
In: Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019,
Lecture Notes in Computer Science 11541.
Springer,
pp. 282–300,
doi:10.1007/978-3-662-59533-6_18.
Giulio Guerrieri, Luc Pellissier & Lorenzo Tortora de Falco (2020):
Glueability of Resource Proof-Structures: Inverting the Taylor Expansion.
In: 28th EACSL Annual Conference on Computer Science Logic, CSL 2020,
LIPIcs 152.
Schloss Dagstuhl,
pp. 24:1–24:18,
doi:10.4230/LIPIcs.CSL.2020.24.
Alessio Guglielmi (2007):
A System of Interaction and Structure.
ACM Trans. Comput. Log. 8(1),
pp. 1–64,
doi:10.1145/1182613.1182614.
Alessio Guglielmi, Tom Gundersen & Michel Parigot (2010):
A Proof Calculus Which Reduces Syntactic Bureaucracy.
In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010,
LIPIcs 6.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 135–150,
doi:10.4230/LIPIcs.RTA.2010.135.
Alessio Guglielmi & Lutz Straßburger (2001):
Non-commutativity and MELL in the Calculus of Structures.
In: Laurent Fribourg: Computer Science Logic, 15th International Workshop, CSL 2001,
Lecture Notes in Computer Science 2142.
Springer,
pp. 54–68,
doi:10.1007/3-540-44802-0_5.
Alessio Guglielmi & Lutz Straßburger (2002):
A Non-commutative Extension of MELL.
In: Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002,
Lecture Notes in Computer Science 2514.
Springer,
pp. 231–246,
doi:10.1007/3-540-36078-6_16.
Ross Horne, Alwen Tiu, Bogdan Aman & Gabriel Ciobanu (2019):
De Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic.
ACM Transactions on Computational Logic (TOCL) 20(4),
pp. 22:1–22:44,
doi:10.1145/3325821.
Yves Lafont (1990):
Interaction Nets.
In: Seventeenth Annual ACM Symposium on Principles of Programming Languages, POPL 1990.
ACM Press,
pp. 95–108,
doi:10.1145/96709.96718.
Damiano Mazza (2018):
The true concurrency of differential interaction nets.
Math. Struct. Comput. Sci. 28(7),
pp. 1097–1125,
doi:10.1017/S0960129516000402.
Damiano Mazza & Michele Pagani (2007):
The Separation Theorem for Differential Interaction Nets.
In: Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007,
Lecture Notes in Computer Science 4790.
Springer,
pp. 393–407,
doi:10.1007/978-3-540-75560-9_29.
Robin Milner (1999):
Communicating and Mobile Systems: the Pi Calculus.
Cambridge University Press,
New York, NY, USA.
Michele Pagani (2009):
The Cut-Elimination Theorem for Differential Nets with Promotion.
In: Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009,
Lecture Notes in Computer Science 5608.
Springer,
pp. 219–233,
doi:10.1007/978-3-642-02273-9_17.
Michele Pagani & Christine Tasson (2009):
The Inverse Taylor Expansion Problem in Linear Logic.
In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA.
IEEE Computer Society,
pp. 222–231,
doi:10.1109/LICS.2009.35.
Michele Pagani & Paolo Tranquilli (2017):
The conservation theorem for differential nets.
Mathematical Structures in Computer Science 27(6),
pp. 939–992,
doi:10.1017/S0960129515000456.
Lutz Straßburger (2003):
Linear Logic and Noncommutativity in the Calculus of Structures.
Technische Universität Dresden.
Lutz Stra\IeCß burger (2003):
MELL in the calculus of structures.
Theoretical Computer Science 309(1),
pp. 213 – 285,
doi:10.1016/S0304-3975(03)00240-8.
Paolo Tranquilli (2009):
Confluence of Pure Differential Nets with Promotion.
In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSLS,
Lecture Notes in Computer Science 5771.
Springer,
pp. 500–514,
doi:10.1007/978-3-642-04027-6_36.
Paolo Tranquilli (2011):
Intuitionistic differential nets and lambda-calculus.
Theor. Comput. Sci. 412(20),
pp. 1979–1997,
doi:10.1016/j.tcs.2010.12.022.
eptcs@eptcs.org