Semantics-preserving DPO-based term graph rewriting
From MaRDI portal
Recommendations
Cites work
- M, N-adhesive transformation systems
- A Heterogeneous Pushout Approach to Term-Graph Transformation
- An algebraic presentation of term graphs, via gs-monoidal categories
- An Optimized Cell BE Special Function Library Generated by Coconut
- Bisimilarity in term graph rewriting.
- Categorical rewriting of term-like structures
- Dependently-typed formalisation of typed term graphs
- Essentials of term graph rewriting
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- scientific article; zbMATH DE number 1086713 (Why is no real title available?)
- scientific article; zbMATH DE number 234035 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Implementing term rewriting by jungle evaluation
- On term graphs as an adhesive category
- Relational Methods in Computer Science
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Towards ``mouldable code via nested code graph transformation
Cited in
(2)
This page was built for publication: Semantics-preserving DPO-based term graph rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5018495)
