Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Handbook of theoretical computer science (vol. B)
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term graph rewriting and garbage collection using opfibrations
Theoretical Computer Science
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
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
Bisimilarity in term graph rewriting
Information and Computation - Special issue on EXPRESS 1997
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Rewriting Calculus for Cyclic Higher-order Term Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics
Electronic Notes in Theoretical Computer Science (ENTCS)
A survey of strategies in rule-based program transformation systems
Journal of Symbolic Computation
The graph rewriting calculus: confluence and expressiveness
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Confluence of graph transformation revisited
Processes, Terms and Cycles
Skew and ω-skew confluence and abstract Böhm semantics
Processes, Terms and Cycles
User-definable rule priorities for CHR
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Needed Rewriting Strategy for Data-Structures with Pointers
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Non strict confluent rewrite systems for data-structures with pointers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Narrowing data-structures with pointers
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.00 |
We define a new class of rewrite systems operating over term-graphs. Our aim is twofold. First we propose to extend classical first-order rewrite rules in order to process easily data-structures with pointers (e.g., circular lists, doubly linked lists etc). For that, our rules provide specific features such as pointer (edges) redirections, relabeling of existing nodes etc. Unfortunately, such features are very often source of non confluence. Our second aim is then to ensure confluence of the considered rewrite systems in the new class. We introduce the notion of term-graphs with priority and show that orthogonal rewrite systems are confluent in our setting