A Sound and Complete Bisimulation for Contextual Equivalence in λ-Calculus with Call/cc
A Sound and Complete Bisimulation for Contextual Equivalence in λ-Calculus with Call/cc
复制标题
具有 Call/cc 的 λ 演算中上下文等价的健全且完整的互模拟
DOI：
10.1007/978-3-319-47958-3_10
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Eijiro Sumii
中科院分区：
文献类型：
--
作者：
Taichi Yachi;Eijiro Sumii
我们开发了一个健全的和完整的证明方法的上下文等价在微积分与流产控制算子call/cc（相对于分隔的控制算子，如and），并证明了非平凡等价之间，例如，两者都是我们所知的第一次。虽然我们的方法是基于环境双模拟的（Sumii et al. 2004-），但它对他们的元理论进行了基本和一般的改变，这不仅是处理call/cc所必需的，而且也适用于其他没有控制运算符的语言。
We develop a sound and complete proof method of contextual equivalence in-calculus with the abortive control operator call/cc (as opposed to delimited control operators likeand), and prove the non-trivial equivalence betweenandfor example, both for the first time to our knowledge. Although our method is based on environmental bisimulations (Sumii et al. 2004-), it makes an essential and general change to their metatheory, which is not only necessary for handling call/cc but is also applicable in other languages with no control operator.