HOPLA-A Higher-Order Process Language
HOPLA-A Higher-Order Process Language
复制标题
HOPLA-高阶过程语言
DOI:
10.1007/3-540-45694-5_29
复制
发表时间:
2002
期刊:
影响因子:
--
通讯作者:
G. Winskel
中科院分区:
文献类型:
--
作者:
Mikkel Nygaard;G. Winskel
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.