HOPLA-A Higher-Order Process Language

HOPLA-A Higher-Order Process Language
复制标题

HOPLA-高阶过程语言

DOI:
10.1007/3-540-45694-5_29
复制
发表时间:
2002
期刊:
International Conference on Concurrency Theory
影响因子:
--
通讯作者:
G. Winskel
G. Winskel
中科院分区:
--
文献类型:
--
作者:
Mikkel Nygaard;G. Winskel

文献摘要

被引文献

相似文献

介绍了一种小型但功能强大的高阶不确定过程语言。本文概述了它在并发的线性领域理论中的根源,尽管在大多数情况下,它适合于一个更具操作性的帐户。该语言可以被视为具有“前缀和”的lambda演算的扩展,其中类型表示进程能够处理的计算路径的形式。探讨了它的操作语义、互模拟、同余性质和表达能力,特别是它如何直接编码CCS、带有进程传递的CCS和带有公共名称的移动环境等过程语言。
A small but powerful language for higher-order nondeterministic processes is introduced. Its roots in a linear domain theory for concurrency are sketched though for the most part it lends itself to a more operational account. The language can be viewed as an extension of the lambda calculus with a “prefixed sum”, in which types express the form of computation path of which a process is capable. Its operational semantics, bisimulation, congruence properties and expressive power are explored; in particular, it is shown how it can directly encode process languages such as CCS, CCS with process passing, and mobile ambients with public names.