基于交互网的就地图重写
In-place Graph Rewriting with Interaction Nets
摘要：
当一个算法不需要任何额外的内存来执行超过一个小的常量时，它就是就地的，或者说是就地运行的。有许多算法是有效的，因为这个功能，因此它是算法的一个重要方面。在大多数程序设计语言中，算法何时可以就地运行并不明显，而且通常也不清楚实现是否尊重这一思想。在本文中，我们研究交互网络作为一种形式主义，我们可以直接，直观地看到，算法是到位的，而且实现将尊重它是到位的。然而，并不是所有的算法都可以就地运行。尽管如此，我们仍然可以使用相同的语言，但现在我们可以注释可以就地运行的算法部分。我们提出了一个规则的注释，并给出了一个算法，通过分析的相互作用规则，自动找到这个。
英文摘要：
An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute beyond a small constant amount. There are many algorithms that are efficient because of this feature, therefore it is an important aspect of an algorithm. In most programming languages, it is not obvious when an algorithm can run in-place, and moreover it is often not clear that the implementation respects that idea. In this paper we study interaction nets as a formalism where we can see directly, visually, that an algorithm is in-place, and moreover the implementation will respect that it is in-place. Not all algorithms can run in-place however. We can nevertheless still use the same language, but now we can annotate parts of the algorithm that can run in-place. We suggest an annotation for rules, and give an algorithm to find this automatically through analysis of the interaction rules.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
