再论高阶pi-演算的上下文等价性
Contextual equivalence for higher-order pi-calculus revisited
摘要：
高阶pi演算是pi演算的扩展，允许进程抽象的通信，而不仅仅是名称。Sangiorgi在他的论文中深入研究了高阶π演算的上下文等价性，使用标记的过渡系统和正常的互模拟。不幸的是，这里使用的证明技术需要限制语言只允许有限类型。我们重新审视这种演算，并提供了一种替代的介绍标记的过渡系统和一种新的证明技术，使我们能够提供一个完全抽象的上下文等价的特性，使用标记的过渡和互模拟高阶π演算递归类型也。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
