在HyperLMNtal中实现G机

摘要：

由于语言处理系统通常分配/丢弃具有复杂引用关系（包括循环和间接引用）的存储器，因此它们的实现通常不是微不足道的。这里，分配的内存和引用可以抽象为图的标记顶点和边。存在一种图形重写语言、一种程序设计语言或一种计算模型，可以直观、安全、高效地处理图形。因此，作为图重写语言的应用领域，语言处理系统的实现可以被高度期望。为了证明这一点，在这项研究中，我们实现了G机，虚拟机的懒惰的评价，在超图重写语言，HyperLMNtal。

英文摘要：

Since language processing systems generally allocate/discard memory with complex reference relationships, including circular and indirect references, their implementation is often not trivial. Here, the allocated memory and the references can be abstracted to the labeled vertices and edges of a graph. And there exists a graph rewriting language, a programming language or a calculation model that can handle graph intuitively, safely and efficiently. Therefore, the implementation of a language processing system can be highly expected as an application field of graph rewriting language. To show this, in this research, we implemented G-machine, the virtual machine for lazy evaluation, in hypergraph rewriting language, HyperLMNtal.

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