Categories, types, and structures: an introduction to category theory for the working computer scientist
String-rewriting systems
Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Term graph rewriting and garbage collection using opfibrations
Theoretical Computer Science
Equational term graph rewriting
Fundamenta Informaticae - Special issue on graph transformations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Term rewriting and all that
Admissible graph rewriting and narrowing
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Handbook of graph grammars and computing by graph transformation
Graph rewriting aspects of functional programming
Handbook of graph grammars and computing by graph transformation
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
The AGG approach: language and environment
Handbook of graph grammars and computing by graph transformation
Journal of the ACM (JACM)
Proceedings of the Parallel Architectures and Languages Europe, Volume I
Dactl: An Experimental Graph Rewriting Language
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
A Graph Rewriting Programming Language for Graph Drawing
VL '98 Proceedings of the IEEE Symposium on Visual Languages
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
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)
On Term-Graph Rewrite Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
Inductively Sequential Term-Graph Rewrite Systems
ICGT '08 Proceedings of the 4th 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
Adjunction for garbage collection with application to graph rewriting
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
| Hi-index | 0.00 |
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirection, the aim of which is to redirect specific pointers determined by means of a pattern; (ii) Replacement, that may add new information to data-structures; (iii) Global redirection, which is aimed at redirecting all pointers targeting a node towards another one. We define a new framework, following the double-pushout approach, where graph rewrite rules may mix these three kinds of actions in a row. We define first the category of graphs we consider and then we define rewrite rules as pairs of graph homomorphisms of the form LR. In our setting, graph K is not arbitrary, it is used to encode pointer redirection. Furthermore, pushouts do not always exist and complement pushouts, when they exist, are not unique. Despite these concerns, our definition of rewriting steps is such that a rewrite rule can always be fired, once a matching is found.