String Diagram Rewrite Theory I: Rewriting with Frobenius Structure
From MaRDI portal
Publication:5066951
DOI10.1145/3502719zbMath1497.68239arXiv2012.01847OpenAlexW3109435874MaRDI QIDQ5066951
Fabio Zanasi, Paweł Sobociński, Fabio Gadducci, Aleks Kissinger, Filippo Bonchi
Publication date: 31 March 2022
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.01847
Related Items (6)
String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ From gs-monoidal to oplax cartesian categories: constructions and functorial completeness ⋮ A strict constrained superposition calculus for graphs ⋮ A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity ⋮ Categories of Differentiable Polynomial Circuits for Machine Learning ⋮ String diagram rewrite theory III: Confluence with and without Frobenius
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interacting Hopf algebras
- Higher-dimensional word problems with applications to equational logic
- The calculus of signal flow diagrams. I: Linear relations on streams.
- Synthesising CCS bisimulation using graph rewriting
- Cartesian bicategories. I
- The geometry of tensor calculus. I
- Completion for rewriting modulo a congruence
- Towards an algebraic theory of Boolean circuits.
- Hypergraph categories
- Calculational proofs in relational graphical linear algebra
- Full Abstraction for Signal Flow Graphs
- A Survey of Rewriting Strategies in Program Transformation Systems
- Categorical quantum mechanics
- The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
- Picturing Quantum Processes
- Confluence of Graph Rewriting with Interfaces
- A Survey of Graphical Languages for Monoidal Categories
- A Categorical Semantics of Signal Flow Graphs
- Quantomatic: A Proof Assistant for Diagrammatic Reasoning
- Interacting Quantum Observables
- Amalgamations of Categories
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Complete Sets of Reductions for Some Equational Theories
- Topology and logic as a source of algebra
- Introduction to bicategories
- Rewriting modulo symmetric monoidal structure
- Traced monoidal categories
- Open-graphs and monoidal theories
- Essentials of Term Graph Rewriting
- A new description of orthogonal bases
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- Refinement for signal flow graphs
- Rewriting with Frobenius
- Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics
- Categories in Control
- Graph rewriting for the π-calculus
- Foundations of Software Science and Computation Structures
- Adhesive and quasiadhesive categories
- Interacting Bialgebras Are Frobenius
- Abstract Tensor Systems as Monoidal Categories
- Towards 3-Dimensional Rewriting Theory
- String diagram rewrite theory III: Confluence with and without Frobenius
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication: String Diagram Rewrite Theory I: Rewriting with Frobenius Structure
