Theoretical Computer Science
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Theoretical Computer Science
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Term graph rewriting: theory and practice
Term graph rewriting: theory and practice
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
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation
Static prediction of heap space usage for first-order functional programs
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Abstract Formulation for Rewrite Systems
Category Theory and Computer Science
A 2-Categorical Presentation of Term Graph Rewriting
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Inductively Sequential Term-Graph Rewrite Systems
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
ICGT'06 Proceedings of the Third international conference on Graph Transformations
ICGT'06 Proceedings of the Third 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 |
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L ,R ,*** , *** ) such that L and R are termgraphs representing the left-hand and the right-hand sides of the rule, *** is a mapping from the nodes of L to those of R and *** is a partial function from nodes of R to nodes of L . The mapping *** describes how incident edges of the nodes in L are connected in R , it is not required to be a graph morphism as in classical algebraic approaches of graph transformation. The role of *** is to indicate the parts of L to be cloned (copied). Furthermore, we introduce a notion of heterogeneous pushout and define rewrite steps as heterogeneous pushouts in a given category. Among the features of the proposed rewrite systems, we quote the ability to perform local and global redirection of pointers, addition and deletion of nodes as well as cloning and collapsing substructures.