F. Bonchi, F. Gadducci, A. Kissinger, P. Sobociński & F. Zanasi (2016):
Rewriting Modulo Symmetric Monoidal Structure.
LICS '16,
doi:10.1145/2933575.2935316.
F. Bonchi, P. Sobocinski & F. Zanasi (2015):
Full Abstraction for Signal Flow Graphs.
In: POPL 2015,
doi:10.1145/2676726.2676993.
Ross Duncan & Simon Perdrix (2009):
Graph States and the Necessity of Euler Decomposition.
In: Mathematical Theory and Computational Practice,
doi:10.1007/978-3-642-03073-4_18.
J. Engelfriet & G. Rozenberg (1997):
Node Replacement Graph Grammars.
In: Grzegorz Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations,
doi:10.1142/9789812384720_0001.
A. Kissinger, A. Merry & M. Soloviev (2012):
Pattern graph rewrite systems.
In: 8th International Workshop on Developments in Computational Models,
doi:10.4204/EPTCS.143.5.
A. Kissinger & V. Zamdzhiev (2015):
Equational Reasoning with Context-Free Families of String Diagrams.
In: Graph Transformation - 8th International Conference, ICGT 2015,
doi:10.1007/978-3-319-21145-9_9.
Aleks Kissinger (2012):
Pictures of Processes: Automated Graph Rewriting for Monoidal Categories and Applications to Quantum Computing.
PhD thesis. Oxford University. http://arxiv.org/abs/1203.0202.
Aleks Kissinger & Vladimir Zamdzhiev (2015):
!-graphs with trivial overlap are context-free.
In: Proceedings Graphs as Models, GaM 2015, London, UK, 11-12 April 2015.,
doi:10.4204/EPTCS.181.2.
Aleks Kissinger & Vladimir Zamdzhiev (2015):
Quantomatic: A Proof Assistant for Diagrammatic Reasoning.
In: CADE 2015,
doi:10.1007/978-3-319-21401-6_22.
Bert Lindenhovius, Michael Mislove & Vladimir Zamdzhiev (2018):
Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams.
In: LICS 2018,
doi:10.1145/3209108.3209196.
A. Merry (2014):
Reasoning with !-Graphs.
DPhil Thesis, University of Oxford, http://arxiv.org/abs/1403.7828.
J. Meseguer & U. Montanari (1988):
Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory.
In: LICS 1988,
doi:10.1109/LICS.1988.5114.
Terrence W. Pratt (1971):
Pair grammars, graph languages and string-to-graph translations.
Journal of Computer and System Sciences 5(6),
pp. 560 – 595,
doi:10.1016/S0022-0000(71)80016-8.
Mathys Rennela & Sam Staton (2018):
Classical Control and Quantum Circuits in Enriched Category Theory.
Electr. Notes Theor. Comput. Sci. 336,
pp. 257–279,
doi:10.1016/j.entcs.2018.03.027.
Francisco Rios & Peter Selinger (2017):
A categorical model for a quantum circuit description language.
In: QPL 2017.,
doi:10.4204/EPTCS.266.11.
Andy Schürr (1995):
Specification of graph translators with triple graph grammars.
In: Graph-Theoretic Concepts in Computer Science,
doi:10.1007/3-540-59071-4_45.
eptcs@eptcs.org