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

交互机的动态几何:按需调用的图重写器

The Dynamic Geometry of Interaction Machine: A Call-by-need Graph Rewriter

Koko Muroya, Dan R. Ghica

摘要:

Girard的交互几何(GoI),一种为线性逻辑证明而设计的语义,也已成功地应用于程序设计语言语义。一种方法是使用抽象机器,沿着GoI指示的路径在固定图上传递令牌。这些令牌传递抽象机器是空间有效的,因为它们通过在固定图上重复令牌的相同移动来处理重复的计算。虽然它们可以被调整以获得关于λ演算的各种评估策略的方程理论的合理模型,但这可能以显著的时间成本为代价。在本文中,我们展示了一个令牌传递抽象机,可以实现评估策略的λ演算,认证的时间效率。我们的抽象机器,称为动态GoI机器(DGoIM),重写图形以避免重复计算,使用令牌来查找赎回。交错令牌转换和图形重写的灵活性允许DGoIM平衡空间和时间成本的权衡。本文表明,DGoIM可以实现调用按需评估的λ演算,通过使用交错令牌传递与尽可能多的图重写的策略。我们的定量分析证实,DGoIM与这种策略的交错的两种可能的操作图可以被归类为“高效”以下Accattoli的分类抽象机器。

英文摘要:

Girard's Geometry of Interaction (GoI), a semantics designed for linear logic proofs, has been also successfully applied to programming language semantics. One way is to use abstract machines that pass a token on a fixed graph along a path indicated by the GoI. These token-passing abstract machines are space efficient, because they handle duplicated computation by repeating the same moves of a token on the fixed graph. Although they can be adapted to obtain sound models with regard to the equational theories of various evaluation strategies for the lambda calculus, it can be at the expense of significant time costs. In this paper we show a token-passing abstract machine that can implement evaluation strategies for the lambda calculus, with certified time efficiency. Our abstract machine, called the Dynamic GoI Machine (DGoIM), rewrites the graph to avoid replicating computation, using the token to find the redexes. The flexibility of interleaving token transitions and graph rewriting allows the DGoIM to balance the trade-off of space and time costs. This paper shows that the DGoIM can implement call-by-need evaluation for the lambda calculus by using a strategy of interleaving token passing with as much graph rewriting as possible. Our quantitative analysis confirms that the DGoIM with this strategy of interleaving the two kinds of possible operations on graphs can be classified as "efficient" following Accattoli's taxonomy of abstract machines.

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

↑