A Cloning Pushout Approach to Term-Graph Transformation

13 years 2 months ago
A Cloning Pushout Approach to Term-Graph Transformation
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. describes how incident edges of the nodes in L are connected in R. 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 new notion of cloning pushout and define rewrite steps as cloning 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.
Dominique Duval, Rachid Echahed, Fréd&eacut
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Dominique Duval, Rachid Echahed, Frédéric Prost
Comments (0)