References

  1. John C. Baez & Jason Erbele (2014): Categories in Control. Available at http://arxiv.org/abs/1405.6881. ArXiv:1405.6881.
  2. Filippo Bonchi, PawełSobociński & Fabio Zanasi (2015): Full Abstraction for Signal Flow Graphs. In: Principles of Programming Languages, POPL`15., doi:10.1145/2676726.2676993.
  3. B. Coecke (2010): Quantum picturalism. Contemporary Physics 51(1), pp. 59–83, doi:10.1080/00107510903257624.
  4. B. Coecke, E. Grefenstette & M. Sadrzadeh (2013): Lambek vs. Lambek: Functorial vector space semantics and string diagrams for Lambek calculus. Annals of Pure and Applied Logic 164(11), pp. 1079 – 1100, doi:10.1016/j.apal.2013.05.009.
  5. B. Courcelle (1995): Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement. Information and Computation 116(2), pp. 275 – 293, doi:10.1006/inco.1995.1020.
  6. L. Dixon & R. Duncan (2009): Graphical reasoning in compact closed categories for quantum computation. Annals of Mathematics and Artificial Intelligence 56(1), pp. 23–42, doi:10.1007/s10472-009-9141-x.
  7. L. Dixon & A. Kissinger (2013): Open-graphs and monoidal theories. Mathematical Structures in Computer Science 23, pp. 308–359, doi:10.1017/S0960129512000138.
  8. A. Habel & H-J. Kreowski (1987): Some structural aspects of hypergraph languages generated by hyperedge replacement. In: STACS 87, Lecture Notes in Computer Science 247. Springer Berlin Heidelberg, pp. 207–219, doi:10.1007/BFb0039608.
  9. A. Joyal & R. Street (1991): The geometry of tensor calculus, I. Advances in Mathematics 88(1), pp. 55 – 112, doi:10.1016/0001-8708(91)90003-P.
  10. A. Kissinger, A. Merry & M. Soloviev (2012): Pattern graph rewrite systems. In: Proceedings 8th International Workshop on Developments in Computational Models 143, pp. 54–66, doi:10.4204/EPTCS.143.5.
  11. A. Kissinger & D. Quick (2014): Tensors, !-graphs, and non-commutative quantum structures. In: Proceedings of QPL 2014 172, pp. 56–67, doi:10.4204/EPTCS.172.5.
  12. Aleks Kissinger & Vladimir Zamdzhiev (2015): Quantomatic: A proof assistant for diagrammatic reasoning. Available at http://arxiv.org/abs/1503.01034. ArXiv:1503.01034.
  13. A. Merry (2014): Reasoning with !-Graphs. DPhil Thesis, University of Oxford, http://arxiv.org/abs/1403.7828.
  14. G. Rozenberg: Handbook of graph grammars and computing by graph transformation, vol 1: Foundations. World Scientific, 1997.
  15. P. Sobocinski (2010): Representations of Petri net interactions. In: CONCUR 2010 - Concurrency Theory, LNCS 6269. Springer, pp. pp 554–568, doi:10.1007/978-3-642-15375-4_38.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org