Theoretical Computer Science
Equational term graph rewriting
Fundamenta Informaticae - Special issue on graph transformations
Term rewriting and all that
Handbook of graph grammars and computing by graph transformation
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
CPO Models for Infinite Term Rewriting
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Proceedings of the Parallel Architectures and Languages Europe, Volume I
Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science
Narrowing data-structures with pointers
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.00 |
The notion of path is classical in graph theory but not directly used in the term rewriting community. The main idea of this work is to raise the notion of path to the level of first-order terms, i.e. paths become partof the terms and not just meta-information about them. These paths are represented by words of integers (positive or negative) and are interpreted as relative addresses in terms. In this way, paths can also be seen as a generalization of the classical notion of position for the first-order terms and are inspired by de Bruijn indexes.In this paper, we define an original framework called Referenced Term Rewriting where paths are used to represent pointers between subterms. Using this approach, any term-graph rewriting systems can be simulated using a term rewrite-based environment.