Open-graphs and monoidal theories

DOI10.1017/S0960129512000138zbMath1268.18002arXiv1011.4114MaRDI QIDQ4917191

Lucas Dixon, Aleks Kissinger

Publication date: 29 April 2013

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.4114

zbMATH Keywords

PROPsstring diagramsmechanised reasoningdouble-pushout graph rewritingadhesive category of typed graphscategory of open-graphsfree symmetric monoidal categoriesselective adhesive functor

Mathematics Subject Classification ID

Related Items (11)

Quantomatic: A Proof Assistant for Diagrammatic Reasoning ⋮ String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ Tensors, !-graphs, and non-commutative quantum structures ⋮ Equational Reasoning with Context-Free Families of String Diagrams ⋮ Monads and distributive laws for Rota-Baxter and differential algebras ⋮ A Category of Surface-Embedded Graphs ⋮ Unnamed Item ⋮ Computing with Semirings and Weak Rig Groupoids ⋮ Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus} ⋮ Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC

Cites Work

• Unnamed Item
• Construction and properties of adhesive and weak adhesive high-level replacement categories
• A convenient category of locally preordered spaces
• The geometry of tensor calculus. I
• Towards an algebraic theory of Boolean circuits.
• Formal molecular biology
• Pure bigraphs: structure and dynamics
• Fundamentals of algebraic graph transformation
• Unfolding Graph Transformation Systems: Theory and Applications to Verification
• Interacting Quantum Observables
• Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks

This page was built for publication: Open-graphs and monoidal theories