Inductively Sequential Term-Graph Rewrite Systems
From MaRDI portal
Recommendations
Cites work
- A needed narrowing strategy
- Evaluation strategies for functional logic programming
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 1418367 (Why is no real title available?)
- scientific article; zbMATH DE number 1420819 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- Lazy context cloning for non-deterministic graph rewriting
- Modeling pointer redirection as cyclic term-graph rewriting
- Narrowing Data-Structures with Pointers
- Non Strict Confluent Rewrite Systems for Data-Structures with Pointers
- Nondeterministic algebraic specifications and nonconfluent term rewriting
Cited in
(11)- Algebraic graph rewriting with controlled embedding
- Parallel rewriting of attributed graphs
- Parallel coherent graph transformations
- Term-graph rewriting in \textsc{Tom} using relative positions
- Strongly sequential and inductively sequential term rewriting systems
- AGREE -- algebraic graph rewriting with controlled embedding
- Ensuring correctness of model transformations while remaining decidable
- A Heterogeneous Pushout Approach to Term-Graph Transformation
- Compiling collapsing rules in certain constructor systems
- A strict constrained superposition calculus for graphs
- Programming with narrowing: a tutorial
This page was built for publication: Inductively Sequential Term-Graph Rewrite Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540390)
