项图转换的克隆推出方法
A Cloning Pushout Approach to Term-Graph Transformation
摘要：
我们解决的问题，循环termgraph重写。我们提出了一个新的框架，重写规则是元组的形式$(L,R,τ,σ)$，使$L$和$R$是termgraphs表示的左手和右手边的规则，$τ$是一个映射从节点的$L$的$R$和$σ$是一个部分功能从节点的$R$的$L$的节点。$τ$描述了$L$中节点的关联边在$R$中如何连接。$τ$不需要像图变换的经典代数方法那样是图态射。$σ$的作用是指示要克隆（复制）的$L$部分。此外，我们引入了一个新的概念，\emph{cloning pushout}和定义重写步骤克隆推出在一个给定的类别。在建议的重写系统的功能，我们引用的能力，执行本地和全局重定向的指针，添加和删除的节点，以及克隆和折叠子结构。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
