Equational Reasoning with Context-Free Families of String Diagrams

DOI10.1007/978-3-319-21145-9_9zbMath1321.68332arXiv1504.02716OpenAlexW3100985285MaRDI QIDQ2947216

Aleks Kissinger, Vladimir Zamdzhiev

Publication date: 22 September 2015

Published in: Graph Transformation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

Quantomatic: A Proof Assistant for Diagrammatic Reasoning ⋮ Equational Reasoning with Context-Free Families of String Diagrams ⋮ A Category of Surface-Embedded Graphs ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Lambek vs. Lambek: functorial vector space semantics and string diagrams for Lambek calculus
• The geometry of tensor calculus. I
• Pair grammars, graph languages and string-to-graph translations
• Full Abstraction for Signal Flow Graphs
• Equational Reasoning with Context-Free Families of String Diagrams
• Strong Complementarity and Non-locality in Categorical Quantum Mechanics
• The ZX-calculus is complete for stabilizer quantum mechanics
• Quantomatic: A Proof Assistant for Diagrammatic Reasoning
• Graph States and the Necessity of Euler Decomposition
• Representations of Petri Net Interactions
• The Compositional Structure of Multipartite Quantum Entanglement
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Handbook of Graph Grammars and Computing by Graph Transformation
• Open-graphs and monoidal theories
• Pattern graph rewrite systems
• Interacting quantum observables: categorical algebra and diagrammatics
• Categories in Control

This page was built for publication: Equational Reasoning with Context-Free Families of String Diagrams