Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Nondeterministic algebraic specifications and nonconfluent term rewriting
Journal of Logic Programming
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
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: 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
Journal of the ACM (JACM)
Parallel Admissible Graph Rewriting
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Proceedings of the Third International Conference on Algebraic and Logic Programming
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
A simple rewrite notion for call-time choice semantics
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Call pattern analysis for functional logic programs
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Evaluation strategies for functional logic programming
Journal of Symbolic Computation
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
A Heterogeneous Pushout Approach to Term-Graph Transformation
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
A dynamic logic for termgraph rewriting
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Graph transformation with focus on incident edges
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
Definitional trees have been introduced by Sergio Antoy in order to design an efficient term rewrite strategy which computes needed outermost redexes. In this paper, we consider the use of definitional trees in the context of term-graph rewriting. We show that, unlike the case of term rewrite systems, the strategies induced by definitional trees do not always compute needed redexes, in presence of term-graph rewrite systems. We then define a new class called inductively sequential term-graph rewrite systems (istGRS) for which needed redexes are still provided by definitional trees. Systems in this class are not confluent in general. We give additional syntactic criteria over istGRS's which ensure the confluence property with respect to the set of admissible term-graphs.