A Cloning Pushout Approach to Term-Graph Transformation
| dc.creator | Duval, Dominique | |
| dc.creator | Echahed, Rachid | |
| dc.creator | Prost, Frédéric | |
| dc.date | 2008-11-20 | |
| dc.date.accessioned | 2026-07-07T10:19:48Z | |
| dc.date.available | 2026-07-07T10:19:48Z | |
| dc.description | 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 \emph{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. | |
| dc.identifier | https://arxiv.org/abs/0811.3400 | |
| dc.identifier | http://arxiv.org/abs/0811.3400 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/174640 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.4.2 | |
| dc.title | A Cloning Pushout Approach to Term-Graph Transformation | |
| dc.type | text |