Martín Abadi, Luca Cardelli, Pierre-Louis Curien & Jean-Jacques Lévy (1991):
Explicit Substitutions.
J. Funct. Program. 1(4),
pp. 375–416,
doi:10.1017/S0956796800000186.
Beniamino Accattoli (2015):
Proof nets and the call-by-value λ-calculus.
Theor. Comput. Sci. 606,
pp. 2–24,
doi:10.1016/j.tcs.2015.08.006.
Beniamino Accattoli (2018):
Proof Nets and the Linear Substitution Calculus.
In: Bernd Fischer & Tarmo Uustalu: Theoretical Aspects of Computing - ICTAC 2018 - 15th International Colloquium, Stellenbosch, South Africa, October 16-19, 2018, Proceedings,
Lecture Notes in Computer Science 11187.
Springer,
pp. 37–61,
doi:10.1007/978-3-030-02508-3_3.
Beniamino Accattoli, Eduardo Bonelli, Delia Kesner & Carlos Lombardi (2014):
A nonstandard standardization theorem.
In: Suresh Jagannathan & Peter Sewell: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA, January 20-21, 2014.
ACM,
pp. 659–670,
doi:10.1145/2535838.2535886.
Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski & Fabio Zanasi (2019):
Graphical Affine Algebra.
In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019.
IEEE,
pp. 1–12,
doi:10.1109/LICS.2019.8785877.
Filippo Bonchi, Pawel Sobocinski & Fabio Zanasi (2015):
Full Abstraction for Signal Flow Graphs.
In: Sriram K. Rajamani & David Walker: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, January 15-17, 2015.
ACM,
pp. 515–526,
doi:10.1145/2676726.2676993.
Cliff Click & Michael Paleczny (1995):
A Simple Graph-Based Intermediate Representation.
In: Michael D. Ernst: Proceedings ACM SIGPLAN Workshop on Intermediate Representations (IR'95), San Francisco, CA, USA, January 22, 1995.
ACM,
pp. 35–49,
doi:10.1145/202529.202534.
Bob Coecke & Aleks Kissinger (2017):
Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning.
Cambridge University Press,
doi:10.1017/9781316219317.
Olivier Danvy, Kevin Millikin, Johan Munk & Ian Zerny (2012):
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation.
Theor. Comput. Sci. 435,
pp. 21–42,
doi:10.1016/j.tcs.2012.02.023.
Dan R. Ghica, Achim Jung & Aliaume Lopez (2017):
Diagrammatic Semantics for Digital Circuits.
In: Valentin Goranko & Mads Dam: 26th EACSL Annual Conference on Computer Science Logic, CSL 2017, August 20-24, 2017, Stockholm, Sweden,
LIPIcs 82.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 24:1–24:16,
doi:10.4230/LIPIcs.CSL.2017.24.
Dan R. Ghica, Koko Muroya & Todd Waugh Ambridge (2019):
Local Reasoning for Robust Observational Equivalence.
CoRR abs/1907.01257.
Available at http://arxiv.org/abs/1907.01257.
Dan R. Ghica & Nikos Tzevelekos (2012):
A System-Level Game Semantics.
In: Ulrich Berger & Michael W. Mislove: Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, MFPS 2012, Bath, UK, June 6-9, 2012,
Electronic Notes in Theoretical Computer Science 286.
Elsevier,
pp. 191–211,
doi:10.1016/j.entcs.2012.08.013.
Stefano Guerrini, Simone Martini & Andrea Masini (2001):
Proof nets, garbage, and computations.
Theor. Comput. Sci. 253(2),
pp. 185–237,
doi:10.1016/S0304-3975(00)00094-3.
Masahito Hasegawa (1997):
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi.
In: Philippe de Groote: Typed Lambda Calculi and Applications, Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings,
Lecture Notes in Computer Science 1210.
Springer,
pp. 196–213,
doi:10.1007/3-540-62688-3_37.
Naohiko Hoshino, Koko Muroya & Ichiro Hasuo (2014):
Memoryful geometry of interaction: from coalgebraic components to algebraic effects.
In: Thomas A. Henzinger & Dale Miller: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014.
ACM,
pp. 52:1–52:10,
doi:10.1145/2603088.2603124.
Simon L. Peyton Jones & Jon Salkild (1989):
The Spineless Tagless G-Machine.
In: Joseph E. Stoy: Proceedings of the fourth international conference on Functional programming languages and computer architecture, FPCA 1989, London, UK, September 11-13, 1989.
ACM,
pp. 184–201,
doi:10.1145/99370.99385.
Yves Lafont (1990):
Interaction Nets.
In: Frances E. Allen: Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, USA, January 1990.
ACM Press,
pp. 95–108,
doi:10.1145/96709.96718.
Xavier Leroy (1990):
The ZINC experiment : an economical implementation of the ML language.
Technical Report RT-0117.
INRIA.
Available at https://hal.inria.fr/inria-00070049.
Robin Milner (2008):
Bigraphs and Their Algebra.
Electron. Notes Theor. Comput. Sci. 209,
pp. 5–19,
doi:10.1016/j.entcs.2008.04.002.
Koko Muroya & Dan R. Ghica (2019):
The Dynamic Geometry of Interaction Machine: A Token-Guided Graph Rewriter.
Log. Methods Comput. Sci. 15(4).
Available at https://lmcs.episciences.org/5882.
Koko Muroya, Naohiko Hoshino & Ichiro Hasuo (2016):
Memoryful geometry of interaction II: recursion and adequacy.
In: Rastislav Bodík & Rupak Majumdar: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20 - 22, 2016.
ACM,
pp. 748–760,
doi:10.1145/2837614.2837672.
Andrew M. Pitts (1996):
Reasoning about Local Variables with Operationally-Based Logical Relations.
In: Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, July 27-30, 1996.
IEEE Computer Society,
pp. 152–163,
doi:10.1109/LICS.1996.561314.
Andrew M. Pitts (2000):
Operational Semantics and Program Equivalence.
In: Gilles Barthe, Peter Dybjer, Luís Pinto & João Saraiva: Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures,
Lecture Notes in Computer Science 2395.
Springer,
pp. 378–412,
doi:10.1007/3-540-45699-6_8.
Andrew M. Pitts (2013):
Nominal Sets: Names and Symmetry in Computer Science.
Cambridge Tracts in Theoretical Computer Science.
Cambridge University Press,
doi:10.1017/CBO9781139084673.
Gordon D. Plotkin (2004):
A structural approach to operational semantics.
J. Log. Algebraic Methods Program. 60-61,
pp. 17–139,
doi:10.1016/j.jlap.2004.05.001.
Ralf Schweimeier & Alan Jeffrey (1999):
A Categorical and Graphical Treatment of Closure Conversion.
In: Stephen D. Brookes, Achim Jung, Michael W. Mislove & Andre Scedrov: Fifteenth Conference on Mathematical Foundations of Progamming Semantics, MFPS 1999, Tulane University, New Orleans, LA, USA, April 28 - May 1, 1999,
Electronic Notes in Theoretical Computer Science 20.
Elsevier,
pp. 481–511,
doi:10.1016/S1571-0661(04)80090-2.
Neil Sculthorpe, Paolo Torrini & Peter D. Mosses (2015):
A Modular Structural Operational Semantics for Delimited Continuations.
In: Olivier Danvy & Ugo de'Liguoro: Proceedings of the Workshop on Continuations, WoC 2016, London, UK, April 12th 2015,
EPTCS 212,
pp. 63–80,
doi:10.4204/EPTCS.212.5.
P. Selinger (2011):
A Survey of Graphical Languages for Monoidal Categories,
pp. 289–355.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/978-3-642-12821-9_4.
Andrew K. Wright & Matthias Felleisen (1994):
A Syntactic Approach to Type Soundness.
Inf. Comput. 115(1),
pp. 38–94,
doi:10.1006/inco.1994.1093.