arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.13795cs.LOcs.PL
收藏

互动空间(长版)

The Space of Interaction (long version)

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

摘要:

函数式程序的空间复杂度还没有得到很好的理解。特别是,传统的实现技术是针对时间效率而定制的,而空间效率导致时间效率低下,因为它更喜欢重新计算而不是节省。Girard的几何互动的基础上的互动抽象机(IAM),声称在文献中的空间效率的另一种方法。它也被证明是为了给微积分提供一个合理的空间概念,但这样一个重要的结果似乎是难以捉摸的。在本文中,我们介绍了一种新的交叉型系统,精确测量的空间消耗的IAM上的类型的条款。交集类型被反复用于度量时间,它们通过丢弃幂等性,将交集转换为多集来实现。在这里,我们表明,IAM的空间消耗连接到进一步的结构修改,把多集成树。树相交类型导致从文献中的一些空间复杂度结果的更好的理解。他们还为有关合理空间的猜想提供了新的线索:我们表明,将图灵机编码到λ演算中的通常方式不能用来证明IAM的空间是合理的成本模型。

英文摘要:

The space complexity of functional programs is not well understood. In particular, traditional implementation techniques are tailored to time efficiency, and space efficiency induces time inefficiencies, as it prefers re-computing to saving. Girard's geometry of interaction underlies an alternative approach based on the interaction abstract machine (IAM), claimed as space efficient in the literature. It has also been conjectured to provide a reasonable notion of space for the lambda-calculus, but such an important result seems to be elusive. In this paper we introduce a new intersection type system precisely measuring the space consumption of the IAM on the typed term. Intersection types have been repeatedly used to measure time, which they achieve by dropping idempotency, turning intersections into multisets. Here we show that the space consumption of the IAM is connected to a further structural modification, turning multisets into trees. Tree intersection types lead to a finer understanding of some space complexity results from the literature. They also shed new light on the conjecture about reasonable space: we show that the usual way of encoding Turing machines into the lambda calculus cannot be used to prove that the space of the IAM is a reasonable cost model.

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

↑