Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Term graph rewriting: theory and practice
Term graph rewriting: theory and practice
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming in equational logic: beyond strong sequentiality
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
Equational term graph rewriting
Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
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
Confluent rewriting of bisimilar term graphs
Theoretical Computer Science
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
A Needed Rewriting Strategy for Data-Structures with Pointers
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Inductively Sequential Term-Graph Rewrite Systems
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
| Hi-index | 0.00 |
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems. We show, however, that the considered relation is always confluent, as well as confluent modulo bisimilarity, for a large class of graphs called admissible graphs. Afterwards, we define a parallel graph rewriting relation and propose an efficient parallel graph rewriting strategy.