按名称调用计算的Turchin关系:一种形式化方法
Turchin's Relation for Call-by-Name Computations: A Formal Approach
摘要:
超编译是一种程序转换技术,最早由V.F. 1970年代的Turchin。在超级编译中,Turchin关系作为调用堆栈配置上的相似关系用于按值调用和按名称调用语义,以终止正在转换的程序的展开。在本文中,我们给出了一个形式文法模型的调用的名称堆栈行为。我们分类的Chomsky层次的模型,然后正式证明,Turchin的关系可以终止所有的计算模型产生的。
英文摘要:
Supercompilation is a program transformation technique that was first described by V. F. Turchin in the 1970s. In supercompilation, Turchin's relation as a similarity relation on call-stack configurations is used both for call-by-value and call-by-name semantics to terminate unfolding of the program being transformed. In this paper, we give a formal grammar model of call-by-name stack behaviour. We classify the model in terms of the Chomsky hierarchy and then formally prove that Turchin's relation can terminate all computations generated by the model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。