arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.06495cs.PLcs.LO
收藏

基于标记引导的图重写算法的有效实现

Efficient Implementation of Evaluation Strategies via Token-Guided Graph Rewriting

Koko Muroya, Dan R. Ghica

摘要:

在实现评价策略的计算,正确性和效率的实施是有效的关注。虽然正确性的概念是由评估策略决定的,但关于效率,可以探索更大的设计空间,特别是空间与时间效率之间的权衡。我们通过引入一个抽象的按需调用机器来研究这种权衡,这是受到Girard的交互几何的启发,一个结合了令牌传递和图形重写的机器。这项工作提出了一个扩展的机器,另外容纳左到右和右到左调用的价值战略。我们显示的健全性和完整性的扩展机器方面的每一个呼叫的需要和两个呼叫的价值战略。分析其执行的时间成本将机器归类为“高效”的抽象机器分类法。

英文摘要:

In implementing evaluation strategies of the lambda-calculus, both correctness and efficiency of implementation are valid concerns. While the notion of correctness is determined by the evaluation strategy, regarding efficiency there is a larger design space that can be explored, in particular the trade-off between space versus time efficiency. We contributed to the study of this trade-off by the introduction of an abstract machine for call-by-need, inspired by Girard's Geometry of Interaction, a machine combining token passing and graph rewriting. This work presents an extension of the machine, to additionally accommodate left-to-right and right-to-left call-by-value strategies. We show soundness and completeness of the extended machine with respect to each of the call-by-need and two call-by-value strategies. Analysing time cost of its execution classifies the machine as "efficient" in Accattoli's taxonomy of abstract machines.

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

↑