scientific article; zbMATH DE number 177452
From MaRDI portal
Publication:4037323
Recommendations
Cited in
(45)- On ``On graph rewritings
- Algebraic transformation of unary partial algebras II: Single-pushout approach
- Term graph rewriting and garbage collection using opfibrations
- Lambda calculus with explicit recursion
- Relational matching for graphical calculi of relations
- Properties of graphs preserved by relational graph rewritings
- Single pushout rewriting in comprehensive systems of graph-like structures
- Partial pullback complement rewriting along admissible matches
- Comprehensive systems: a formal foundation for multi-model consistency management
- Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
- Rewriting abstract structures: materialization explained categorically
- Partial pullback complement rewriting
- Modeling pointer redirection as cyclic term-graph rewriting
- Refined Graph Rewriting in Span-Categories
- Polymorphic sesqui-pushout graph rewriting
- Sesqui-pushout rewriting with type refinements
- On pushouts of partial maps
- Grammar Morphisms and Weakly Adhesive Categories
- Sesqui-Pushout Rewriting
- scientific article; zbMATH DE number 165003 (Why is no real title available?)
- scientific article; zbMATH DE number 1231500 (Why is no real title available?)
- scientific article; zbMATH DE number 1086713 (Why is no real title available?)
- scientific article; zbMATH DE number 1995117 (Why is no real title available?)
- scientific article; zbMATH DE number 1497812 (Why is no real title available?)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Semantics-preserving DPO-based term graph rewriting
- scientific article; zbMATH DE number 7453087 (Why is no real title available?)
- Note on standard representation of graphs and graph derivations
- Relational structures and their partial morphisms in view of single pushout rewriting
- Set-theoretic graph rewriting
- Single pushout rewriting in comprehensive systems
- Patch graph rewriting
- Towards Secrecy for Rewriting in Weakly Adhesive Categories
- Pullback as a generic graph rewriting mechanism
- Node rewriting in graphs and hypergraphs: A categorical framework
- A uniform approach to graph rewriting: The pullback approach
- Computational Category-Theoretic Rewriting
- Algebraic graph derivations for graphical calculi
- Locating the contractum in the double pushout approach
- Relational graph rewritings
- Algebraic approach to single-pushout graph transformation
- Parallel and distributed derivations in the single-pushout approach
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Partial pushout semantics of generics in DOL
- On graph rewritings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037323)