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

作为lambda演算模型的可寻址机器

Addressing Machines as models of lambda-calculus

Giuseppe Della Penna, Benedetto Intrigila, Giulio Manzonetto

AI总结:

本文提出可寻址机器作为λ演算模型,通过仅操作地址的简单机器及最左归约语义,并引入类似ω和ζ_β的规则,构建完整的无类型λ演算模型。

摘要:

图灵机和寄存器机在理论计算机科学中数十年来一直被用作计算的抽象模型。λ演算在该领域也扮演了核心角色,因为它允许聚焦于基于替换机制的函数式计算概念,同时抽象掉实现细节。本文从以下观察出发:这些形式体系之间的等价性基于丘奇-图灵论题,而非将λ项实际编码到图灵机(或寄存器机)中。原因在于这些机器并不适合建模λ演算程序。我们研究一类抽象机器,称之为“可寻址机器”,因为它们只能操作其他机器的内存地址。这些机器执行的操作非常基础:将地址加载到寄存器中,通过地址将一个机器应用于另一个机器,以及调用另一个机器的地址。我们赋予可寻址机器基于最左归约的操作语义,并研究其行为。这些机器的地址集合可以轻松转化为组合子代数。为了获得完整的无类型λ演算模型,我们需要引入一条规则,该规则与组合子逻辑中的ω规则和ζ_β规则有相似之处。

英文摘要:

Turing machines and register machines have been used for decades in theoretical computer science as abstract models of computation. Also the $λ$-calculus has played a central role in this domain as it allows to focus on the notion of functional computation, based on the substitution mechanism, while abstracting away from implementation details. The present article starts from the observation that the equivalence between these formalisms is based on the Church-Turing Thesis rather than an actual encoding of $λ$-terms into Turing (or register) machines. The reason is that these machines are not well-suited for modelling $λ$-calculus programs. We study a class of abstract machines that we call "addressing machine" since they are only able to manipulate memory addresses of other machines. The operations performed by these machines are very elementary: load an address in a register, apply a machine to another one via their addresses, and call the address of another machine. We endow addressing machines with an operational semantics based on leftmost reduction and study their behaviour. The set of addresses of these machines can be easily turned into a combinatory algebra. In order to obtain a model of the full untyped $λ$-calculus, we need to introduce a rule that bares similarities with the $ω$-rule and the rule $ζ_β$ from combinatory logic.

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

↑