数据结构重写
Data-Structure Rewriting
摘要：
我们解决了包括指针重定向在内的数据结构重写问题。我们提出了两个基本的重写步骤：（i）局部重定向和替换步骤，其目的是重定向通过模式确定的特定指针，以及向现有数据添加新信息;和（ii）全局重定向步骤，其目的是将所有指向节点的指针重定向到另一个节点。我们定义这两个重写步骤后，双推出的方法。我们首先定义我们考虑的图的类别，然后将重写规则定义为形式为“L <- K ->R”的图同态对。不幸的是，逆推出（互补推出）在我们的设置中并不唯一，而且推出并不总是存在。因此，我们定义重写步骤，以便一旦找到匹配，就可以始终执行重写规则。
英文摘要：
We tackle the problem of data-structure rewriting including pointer redirections. We propose two basic rewrite steps: (i) Local Redirection and Replacement steps the aim of which is redirecting specific pointers determined by means of a pattern, as well as adding new information to an existing data ; and (ii) Global Redirection steps which are aimed to redirect all pointers targeting a node towards another one. We define these two rewriting steps following the double pushout approach. We define first the category of graphs we consider and then define rewrite rules as pairs of graph homomorphisms of the form "L <- K ->R". Unfortunately, inverse pushouts (complement pushouts) are not unique in our setting and pushouts do not always exist. Therefore, we define rewriting steps so that a rewrite rule can always be performed once a matching is found.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
