Confluence of Graph Rewriting with Interfaces
From MaRDI portal
Publication:2988637
DOI10.1007/978-3-662-54434-1_6zbMath1485.68124OpenAlexW2596819160MaRDI QIDQ2988637
Fabio Zanasi, Filippo Bonchi, Fabio Gadducci, Paweł Sobociński, Aleks Kissinger
Publication date: 19 May 2017
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/406231/1/main.pdf
Grammars and rewriting systems (68Q42) Monoidal categories, symmetric monoidal categories (18M05) Extensive, distributive, and adhesive categories (18B50)
Related Items (11)
String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ Initial Conflicts for Transformation Rules with Nested Application Conditions ⋮ Drags: a compositional algebraic framework for graph rewriting ⋮ A strict constrained superposition calculus for graphs ⋮ Unification of drags and confluence of drag rewriting ⋮ A Category of Surface-Embedded Graphs ⋮ Unnamed Item ⋮ Single pushout rewriting in comprehensive systems of graph-like structures ⋮ Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality ⋮ String diagram rewrite theory III: Confluence with and without Frobenius
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monoidal computer. I: Basic computability by string diagrams
- Higher-dimensional word problems with applications to equational logic
- Matrices, relations, and group representations
- Finite complete rewriting systems and the complexity of word problem
- A basic algebra of stateless connectors
- On ground-confluence of term rewriting systems
- Petri nets are monoids
- Synthesising CCS bisimulation using graph rewriting
- Cartesian bicategories. I
- The geometry of tensor calculus. I
- Limits indexed by category-valued 2-functors
- Towards an algebraic theory of Boolean circuits.
- Normal forms for algebras of connections.
- Full Abstraction for Signal Flow Graphs
- The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
- Conditional Reactive Systems
- Strong Complementarity and Non-locality in Categorical Quantum Mechanics
- A Survey of Graphical Languages for Monoidal Categories
- Adhesivity Is Not Enough: Local Church-Rosser Revisited
- A Connector Algebra for P/T Nets Interactions
- A Categorical Semantics of Signal Flow Graphs
- Quantomatic: A Proof Assistant for Diagrammatic Reasoning
- Decorated Cospans
- Interacting Quantum Observables
- A categorical approach to open and interconnected dynamical systems
- Rewriting modulo symmetric monoidal structure
- The Algebra of Directed Acyclic Graphs
- Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits
- A Programming Language for Spatial Distribution of Net Systems
- Categories in Control
- Graph Transformations
- Graph rewriting for the π-calculus
- Foundations of Software Science and Computation Structures
- Adhesive and quasiadhesive categories
- Computing Critical Pairs in 2-Dimensional Rewriting Systems
- Towards 3-Dimensional Rewriting Theory
- Categorical algebra
This page was built for publication: Confluence of Graph Rewriting with Interfaces
