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

交互等价性

Interaction Equivalence

Beniamino Accattoli, Adrienne Lancelot, Giulio Manzonetto, Gabriele Vanoni

AI总结:

本文在无类型λ演算中提出交互等价性,通过只观察项与上下文的交互步数而忽略内部步骤,证明其构成等式理论并首次在不增强上下文区分能力的情况下观察性刻画了Böhm树相等理论B。

摘要:

上下文等价是程序等价的事实标准概念。一个关键定理是上下文等价构成一个等式理论。使上下文等价更具内涵性,例如考虑计算的时间成本,似乎是一种自然的细化。然而,这样的改变并不会诱导出等式理论,原因似乎很本质:成本在归约下不是不变的。在无类型λ演算的典范情形中,我们引入了交互等价性。受博弈语义启发,我们观察项与上下文之间的交互步数,但关键的是忽略它们自身的内部步骤。我们证明交互等价是一个等式理论,并将其刻画为B,即由Böhm树相等所诱导的著名理论。我们的结果是B的第一个观察性刻画,且无需通过非确定性等额外特征来增强上下文的区分能力。为证明我们的结果,我们开发了基于交互的Böhm-out技术和交集类型的细化。

英文摘要:

Contextual equivalence is the de facto standard notion of program equivalence. A key theorem is that contextual equivalence is an equational theory. Making contextual equivalence more intensional, for example taking into account the time cost of the computation, seems a natural refinement. Such a change, however, does not induce an equational theory, for an apparently essential reason: cost is not invariant under reduction. In the paradigmatic case of the untyped $λ$-calculus, we introduce interaction equivalence. Inspired by game semantics, we observe the number of interaction steps between terms and contexts but -- crucially -- ignore their own internal steps. We prove that interaction equivalence is an equational theory and we characterize it as $B$, the well-known theory induced by Böhm tree equality. Ours is the first observational characterization of $B$ obtained without enriching the discriminating power of contexts with extra features such as non-determinism. To prove our results, we develop interaction-based refinements of the Böhm-out technique and of intersection types.

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

↑