arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1209.5407cs.PLcs.FL
收藏

关于程序专业化的说明。剩余程序的语法特性揭示了什么?

A Note on Program Specialization. What Can Syntactical Properties of Residual Programs Reveal?

Alexei Lisitsa, Andrei P. Nemytykh

摘要:

本文给出了Turchin超编译方法在程序特殊化中的两个非传统应用实例。在这两种情况下,我们感兴趣的语法属性的剩余程序产生的超编译。在第一个例子中,我们将超编译应用于一个编码单词方程的程序,结果我们得到了一个表示描述单词方程的解集的图的程序。第二个例子的想法属于亚历山大·V·科尔柳科夫。他考虑了一个模拟著名的传教士-食人族之谜的解释器。解释器的超编译允许我们解决这个难题。解释器也可以被视为非确定性协议的编码。

英文摘要:

The paper presents two examples of non-traditional using of program specialization by Turchin's supercompilation method. In both cases we are interested in syntactical properties of residual programs produced by supercompilation. In the first example we apply supercompilation to a program encoding a word equation and as a result we obtain a program representing a graph describing the solution set of the word equation. The idea of the second example belongs to Alexandr V. Korlyukov. He considered an interpreter simulating the dynamic of the well known missionaries-cannibals puzzle. Supercompilation of the interpreter allows us to solve the puzzle. The interpreter may also be seen as an encoding of a non-deterministic protocol.

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

↑