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

关于无名称lambda演算中beta还原的一种非传统观点

An Unconventional View on Beta-Reduction in Namefree Lambda-Calculus

Eindhoven University of Technology(埃因霍温理工大学);University of Bologna(博洛尼亚大学)

Rob Nederpelt, Ferruccio Guidi

AI总结:

本文提出了一种新的beta还原形式,通过分析lambda演算中树的分支,重新定义了beta还原,强调减少过程中的树结构扩展关系。

摘要:

在lambda演算中,术语可以表示为带有抽象和应用符号的平面树,其叶节点为变量。本文集中于此类树的分支,而非树本身。我们以这种观点重新表述了几种已知的beta还原概念。以自然的方式,这种重新审视最终导致了一种新的beta还原形式,即扩展型,其含义是术语t1减少到术语t2意味着t1的树是t2的树的子树。

英文摘要:

Terms in the lambda-calculus can be represented as planar trees decorated with symbols for abstraction and application, and having variables as leaves. In this paper, we concentrate on the branches of such trees, rather than on the trees themselves. We reformulate several well-known notions of beta-reduction in this view. In a natural manner, this reconsideration eventually leads to a new form of beta-reduction, being expanding in the sense that the reduction of term t1 to term t2 entails that the tree of t1 is a subtree of the tree of t2.

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

↑