Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Term rewriting systems with priorities
on Rewriting techniques and applications
Implementing term rewrite languages in DACTL
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
Sequentiality in orthogonal term rewriting systems
Journal of Symbolic Computation
Graph rewriting using the annotated functional strategy
Term graph rewriting
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Admissible graph rewriting and narrowing
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Handbook of graph grammars and computing by graph transformation
Computing in Systems Described by Equations
Computing in Systems Described by Equations
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
Proceedings of the Third International Conference on Algebraic and Logic Programming
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Lazy Context Cloning for Non-Deterministic Graph Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Non strict confluent rewrite systems for data-structures with pointers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Workshop on Graph Computation Models
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
| Hi-index | 0.00 |
We tackle the problem of cyclic term-graph rewriting. We first revisit the classical algorithmic approach to term-graph rewriting by providing a definition of rewrite rules of the form lhs-rhs where the left-hand sides are term-graphs and the right-hand sides are sequences of actions. Such actions, which specify how to rewrite a term-graph in a stepwise manner, contribute to simplify substantially the definition of cyclic term-graph rewriting. Then we define a new class of term-graph rewrite systems which are confluent over the so-called admissible term-graphs. Finally, we provide an efficient rewrite strategy which contracts only needed redexes and give pointers to other results regarding optimal rewrite strategies of admissible term-graphs.