重访按值调用Böhm树:基于其Taylor展开的视角
Revisiting Call-by-value Böhm trees in light of their Taylor expansion
AI总结:
本文在按值调用lambda演算中引入置换规则,定义了Böhm树和程序逼近理论,证明相同Böhm树的项观测等价,并给出Taylor展开与Böhm树范式的等价条件。
摘要:
按值调用lambda演算可以配备由线性逻辑证明网产生的置换规则,其优势在于能够解除在归约过程中被卡住的一些可归约式。我们证明,这种扩展允许在按值调用环境中定义令人满意的Böhm(类)树概念和程序逼近理论。我们证明所有具有相同Böhm树的lambda项在观测上是等价的,并刻画了那些作为lambda项实际Böhm树出现的Böhm类树。我们还将该方法与Ehrhard基于lambda项Taylor展开的程序逼近理论进行比较,后者将每个lambda项翻译为可能无限的所谓资源项集合。我们提供了资源项集合成为lambda项Taylor展开的充分必要条件。最后,我们证明lambda项的Taylor展开的范式可以通过对其Böhm树进行归一化Taylor展开来计算。由此得出,两个lambda项具有相同的Böhm树当且仅当它们的Taylor展开的范式一致。
英文摘要:
The call-by-value lambda calculus can be endowed with permutation rules, arising from linear logic proof-nets, having the advantage of unblocking some redexes that otherwise get stuck during the reduction. We show that such an extension allows to define a satisfying notion of Böhm(-like) tree and a theory of program approximation in the call-by-value setting. We prove that all lambda terms having the same Böhm tree are observationally equivalent, and characterize those Böhm-like trees arising as actual Böhm trees of lambda terms. We also compare this approach with Ehrhard's theory of program approximation based on the Taylor expansion of lambda terms, translating each lambda term into a possibly infinite set of so-called resource terms. We provide sufficient and necessary conditions for a set of resource terms in order to be the Taylor expansion of a lambda term. Finally, we show that the normal form of the Taylor expansion of a lambda term can be computed by performing a normalized Taylor expansion of its Böhm tree. From this it follows that two lambda terms have the same Böhm tree if and only if the normal forms of their Taylor expansions coincide.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。