Contextual equivalence for higher-order pi-calculus revisited
Contextual equivalence for higher-order pi-calculus revisited
复制标题
DOI：
10.2168/lmcs-1(1:4)2005
复制
发表时间：
2005-03
期刊：
影响因子：
--
通讯作者：
A. Jeffrey;J. Rathke
中科院分区：
文献类型：
--
作者：
A. Jeffrey;J. Rathke
高阶pi-calculus是pi-calculus的扩展，它允许交流过程的抽象，而不仅仅是名称。Sangiorgi在他的论文中对它进行了深入的研究，其中使用标记跃迁系统和正常双模拟提供了高阶pi-微积分的上下文等价的表征。不幸的是，这里使用的证明技术需要对语言进行限制，只允许有限类型。我们重新审视这个演算，并提供标记转移系统的替代表示和一种新的证明技术，它允许我们使用标记转移和递归类型的高阶pi演算的双模拟提供上下文等价的完全抽象表征。
The higher-order pi-calculus is an extension of the pi-calculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence for higher-order pi-calculus is provided using labelled transition systems and normal bisimulations. Unfortunately the proof technique used there requires a restriction of the language to only allow finite types. We revisit this calculus and offer an alternative presentation of the labelled transition system and a novel proof technique which allows us to provide a fully abstract characterisation of contextual equivalence using labelled transitions and bisimulations for higher-order pi-calculus with recursive types also.