Samson Abramsky & Bob Coecke (2004):
A categorical semantics of quantum protocols.
In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings.
IEEE Computer Society,
pp. 415–425,
doi:10.1109/LICS.2004.1319636.
Iovka B. Boneva, Arend Rensink, Marcos E. Kurbán & Jörg Bauer (2007):
Graph Abstraction and Abstract Graph Transformation.
Available at http://doc.utwente.nl/64257/.
Technical Report, Universiteit Twente.
Bob Coecke & Ross Duncan (2008):
Interacting quantum observables.
In: Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús Halldórson, Anna Ingólfsdottir & Igor Wałukiewicz: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II–Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations,
Lecture Notes in Computer Science 5126.
Springer Verlag,
pp. 298–310,
doi:10.1007/978-3-540-70583-3_25.
Bob Coecke & Aleks Kissinger (2010):
The compositional structure of multipartite quantum entanglement.
In: Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide & Paul G. Spirakis: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II,
Lecture Notes in Computer Science 6199.
Springer Verlag,
pp. 297–308,
doi:10.1007/978-3-642-14162-1_25.
Bob Coecke, Simon Perdrix & Éric Oliver Paquette (2008):
Bases in Diagrammatic Quantum Protocols.
Electronic Notes in Theoretical Computer Science 218,
pp. 131–152,
doi:10.1016/j.entcs.2008.10.009.
Lucas Dixon & Ross Duncan (2009):
Graphical reasoning in compact closed categories for quantum computation.
Annals of Mathematics and Artificial Intelligence 56,
pp. 23–42,
doi:10.1007/s10472-009-9141-x.
Lucas Dixon, Ross Duncan & Aleks Kissinger (2010):
Open Graphs and Computational Reasoning.
In: S. Barry Cooper, Prakash Panangaden & Elham Kashefi: Proceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics,
Electronic Proceedings in Theoretical Computer Science 26,
pp. 169–180,
doi:10.4204/EPTCS.26.16.
Lucas Dixon & Aleks Kissinger (2010):
Open Graphs and Monoidal Theories.
Computing Research Repository abs/1011.4114.
Available at http://arxiv.org/abs/1011.4114.
Hartmut Ehrig, Michael Pfender & Hans Jürgen Schneider (1973):
Graph-Grammars: An Algebraic Approach.
In: 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15-17, 1973.
IEEE Computer Society,
pp. 167–180,
doi:10.1109/SWAT.1973.11.
J.-Y. Girard (1987):
Linear Logic.
Theoretical Computer Science 50(1),
pp. 1–101,
doi:10.1016/0304-3975(87)90045-4.
André Joyal & Ross Street (1991):
The geometry of tensor calculus. I.
Advances in Mathematics 88(1),
pp. 55–112,
doi:10.1016/0001-8708(91)90003-P.
Aleks Kissinger (2012):
Pictures of Processes: Automated Graph Rewriting for Monoidal Categories and Applications to Quantum Computing.
University of Oxford.
Aleks Kissinger (2012):
Synthesising Graphical Theories.
Computing Research Repository abs/1202.6079.
Available at http://arxiv.org/abs/1202.6079.
Donald E. Knuth & Peter B. Bendix (1970):
Simple word problems in universal algebras.
In: John Leech: Computational problems in abstract algebra. Proceedings of a Conference held at Oxford under the auspices of the Science Research Council, Atlas Computer Laboratory, 29th August to 2nd September 1967.
Pergamon Press,
pp. 263–297.
Y. Lafont (1995):
Equational reasoning with 2-dimensional diagrams.
In: Hubert Comon & Jean-Pierre Jouannaud: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course,
Lecture Notes in Computer Science 909.
Springer Verlag,
pp. 170–195,
doi:10.1007/3-540-59340-3_13.
Roger Penrose (1971):
Applications of negative dimensional tensors.
In: Combinatorial mathematics and its applications. Proceedings of a Conference held at the Mathematical Institute, Oxford, from 7-10 July.
Academic Press,
pp. 221–244.
Arend Rensink (2006):
Nested Quantification in Graph Transformation Rules.
In: Andrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro & Grzegorz Rozenberg: Graph Transformations, Third International Conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings,
Lecture Notes in Computer Science 4178.
Springer Verlag,
pp. 1–13,
doi:10.1007/11841883_1.
Arend Rensink & Jan-Hendrik Kuperus (2009):
Repotting the Geraniums: On Nested Graph Transformation Rules.
Electronic Communications of the European Association of Software Science and Technology 18.
eptcs@eptcs.org