Samson Abramsky (1993):
Computational interpretations of linear logic.
Theoretical Computer Science 111(1),
pp. 3–57,
doi:10.1016/0304-3975(93)90181-R.
Matteo Acclavio, Ross Horne & Lutz Straßburger (2020):
Logic Beyond Formulas: A Proof System on Graphs.
In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,
LICS '20.
Association for Computing Machinery,
New York, NY, USA,
pp. 38–52,
doi:10.1145/3373718.3394763.
Jean-Marc Andreoli (1992):
Logic Programming with Focusing Proofs in Linear Logic.
Journal of Logic and Computation 2(3),
pp. 297–347,
doi:10.1093/logcom/2.3.297.
Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich & Steve Zdancewic (2005):
Mechanized Metatheory for the Masses: The PoplMark Challenge.
In: Proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics,
TPHOLs'05.
Springer-Verlag,
Berlin, Heidelberg,
pp. 50–65,
doi:10.1007/11541868_4.
Corrado Böhm & Alessandro Berarducci (1985):
Automatic synthesis of typed Λ-programs on term algebras.
Theoretical Computer Science 39,
pp. 135–154,
doi:10.1016/0304-3975(85)90135-5.
Third Conference on Foundations of Software Technology and Theoretical Computer Science.
Adam Chlipala (2008):
Parametric Higher-Order Abstract Syntax for Mechanized Semantics.
In: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming,
ICFP '08.
Association for Computing Machinery,
New York, NY, USA,
pp. 143–156,
doi:10.1145/1411204.1411226.
N.G de Bruijn (1972):
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem.
Indagationes Mathematicae (Proceedings) 75(5),
pp. 381–392,
doi:10.1016/1385-7258(72)90034-0.
R. Dicosmo (1995):
Second Order Isomorphic Types: A Proof Theoretic Study on Second Order λ-Calculus with Surjective Pairing and Terminal Object.
Information and Computation 119(2),
pp. 176–201,
doi:10.1006/inco.1995.1085.
Maribel Fernández, Hélène Kirchner & Bruno Pinaud (2018):
Labelled Port Graph – A Formal Structure for Models and Computations.
Electronic Notes in Theoretical Computer Science 338,
pp. 3–21,
doi:10.1016/j.entcs.2018.10.002.
The 12th Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2017).
Dan R. Ghica, Koko Muroya & Todd Waugh Ambridge (2019):
A robust graph-based approach to observational equivalence,
doi:10.48550/ARXIV.1907.01257.
Jean-Yves Girard (1987):
Linear logic.
Theoretical Computer Science 50(1),
pp. 1–101,
doi:10.1016/0304-3975(87)90045-4.
Clemens Grabmayer (2018):
Modeling Terms by Graphs with Structure Constraints (Two Illustrations).
In: Maribel Fernández & Ian Mackie: Proceedings Tenth International Workshop on Computing with Terms and Graphs, TERMGRAPH@FSCD 2018, Oxford, UK, 7th July 2018,
EPTCS 288,
pp. 1–13,
doi:10.4204/EPTCS.288.1.
Timothy G. Griffin (1989):
A Formulae-as-Type Notion of Control.
In: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '90.
Association for Computing Machinery,
New York, NY, USA,
pp. 47–58,
doi:10.1145/96709.96714.
Giulio Guerrieri & Giulio Manzonetto (2018):
The Bang Calculus and the Two Girard's Translations.
In: Thomas Ehrhard, Maribel Fernández, Valeria de Paiva & Lorenzo Tortora de Falco: Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications, Linearity-TLLA@FLoC 2018, Oxford, UK, 7-8 July 2018,
EPTCS 292,
pp. 15–30,
doi:10.4204/EPTCS.292.2.
Yves Lafont (1989):
Interaction Nets.
In: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '90.
Association for Computing Machinery,
New York, NY, USA,
pp. 95–108,
doi:10.1145/96709.96718.
Yves Lafont (1995):
From proof nets to interaction nets,
pp. 225–248,
London Mathematical Society Lecture Note Series.
Cambridge University Press,
doi:10.1017/CBO9780511629150.012.
Ian Mackie (2000):
Interaction nets for linear logic.
Theoretical Computer Science 247(1),
pp. 83–140,
doi:10.1016/S0304-3975(00)00198-5.
Ian Mackie (2011):
An Interaction Net Implementation of Closed Reduction.
In: Sven-Bodo Scholz & Olaf Chitil: Implementation and Application of Functional Languages.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 43–59,
doi:10.1007/978-3-642-24452-0_3.
Ian Craig Mackie (1994):
The Geometry of Implementation.
PhD thesis.
Imperial College of Science, Technology and Medicine,
doi:10.25560/46072.
Bruno C.d.S. Oliveira & William R. Cook (2012):
Functional Programming with Structured Graphs.
In: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming,
ICFP '12.
Association for Computing Machinery,
New York, NY, USA,
pp. 77–88,
doi:10.1145/2364527.2364541.
Vincent van Oostrom, Kees Jan van de Looij & Marijn Zwitserlood (2004):
Lambdascope Another optimal implementation of the lambda-calculus.
Benjamin C. Pierce (2002):
Types and Programming Languages,
1st edition.
The MIT Press.
Detlef Plump (2011):
The Design of GP 2.
In: Santiago Escobar: Proceedings 10th International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2011, Novi Sad, Serbia, 29 May 2011,
EPTCS 82,
pp. 1–16,
doi:10.4204/EPTCS.82.1.
Arend Rensink (2004):
The GROOVE Simulator: A Tool for State Space Generation.
In: John L. Pfaltz, Manfred Nagl & Boris Böhlen: Applications of Graph Transformations with Industrial Relevance.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 479–485,
doi:10.1007/978-3-540-25959-6_40.
Christian Retoré (2003):
Handsome proof-nets: perfect matchings and cographs.
Theoretical Computer Science 294(3),
pp. 473–488,
doi:10.1016/S0304-3975(01)00175-X.
Linear Logic.
Ralf Schweimeier & Alan Jeffrey (1999):
A Categorical and Graphical Treatment of Closure Conversion.
Electronic Notes in Theoretical Computer Science 20,
pp. 481–511,
doi:10.1016/S1571-0661(04)80090-2.
MFPS XV, Mathematical Foundations of Progamming Semantics, Fifteenth Conference.
Kazunori Ueda (2009):
LMNtal as a hierarchical logic programming language.
Theoretical Computer Science 410(46),
pp. 4784–4800,
doi:10.1016/j.tcs.2009.07.043.
Abstract Interpretation and Logic Programming: In honor of professor Giorgio Levi.
Geoffrey Washburn & Stephanie Weirich (2003):
Boxes Go Bananas: Encoding Higher-Order Abstract Syntax with Parametric Polymorphism.
In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming,
ICFP '03.
Association for Computing Machinery,
New York, NY, USA,
pp. 249–262,
doi:10.1145/944705.944728.
Alimujiang Yasen & Kazunori Ueda (2021):
Revisiting Graph Types in HyperLMNtal: A Modeling Language for Hypergraph Rewriting.
IEEE Access 9,
pp. 133449–133460,
doi:10.1109/ACCESS.2021.3112903.