首页> 外文期刊>Computer Languages, Systems & Structures >First-order reasoning for higher-order concurrency
【24h】

First-order reasoning for higher-order concurrency

机译:高阶并发的一阶推理

获取原文
获取原文并翻译 | 示例
       

摘要

We present a practical first-order theory of a higher-order 7t-calculus which is both sound and complete with respect to a standard semantic equivalence. The theory is a product of combining and simplifying two of the most prominent theories for HO71 of Sangiorgi et al. and Jeffrey and Rathke [10,21], and a novel approach to scope extrusion. In this way we obtain an elementary labelled transition system where the standard theory of first-order weak bisimulation and its corresponding prepositional Hennessy-Milner logic can be applied. The usefulness of our theory is demonstrated by straightforward proofs of equivalences between compact but intricate higher-order processes using witness first-order bisimula-tions, and proofs of inequivalence using the prepositional Hennessy-Milner logic. Finally we show that contextual equivalence in a higher-order setting is a conservative extension of the first-order 71-calculus.
机译:我们提出了一个实用的高阶7t演算的一阶理论,它相对于标准语义等效性而言既合理又完整。该理论是对Sangiorgi等人的HO71最重要的两个理论进行合并和简化的产物。以及Jeffrey和Rathke [10,21],以及一种新颖的示波器挤压方法。通过这种方式,我们获得了一个基本的标记过渡系统,在其中可以应用一阶弱双模拟的标准理论及其相应的介词Hennessy-Milner逻辑。我们的理论的有用性通过使用证人一阶双模拟的紧凑但复杂的高阶过程之间的等价性的直接证明,以及使用介词轩尼诗-米尔纳逻辑的不等式的证明来证明。最后,我们证明高阶环境中的上下文对等是一阶71演算的保守扩展。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号