arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.6335cs.LOcs.PL
收藏

无穷项图重写系统的收敛性是简单的(扩展摘要)

Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)

Patrick Bahr

摘要:

在这个扩展的摘要中,我们提出了一个简单的方法来收敛项图,使我们能够统一项图重写和无穷项重写。这种方法是基于偏序和度量的术语图。这些结构是无穷项重写中使用的相应结构的简单概括。我们将我们的简单方法与我们之前开发的更复杂的方法进行比较,并表明这种新方法在许多方面都更优越。唯一不利的财产,我们能够确定,即失败的弱度量和偏序收敛之间的充分对应,是通过采用强收敛纪律纠正。

英文摘要:

In this extended abstract, we present a simple approach to convergence on term graphs that allows us to unify term graph rewriting and infinitary term rewriting. This approach is based on a partial order and a metric on term graphs. These structures arise as straightforward generalisations of the corresponding structures used in infinitary term rewriting. We compare our simple approach to a more complicated approach that we developed earlier and show that this new approach is superior in many ways. The only unfavourable property that we were able to identify, viz. failure of full correspondence between weak metric and partial order convergence, is rectified by adopting a strong convergence discipline.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑