HOPLA--A Higher-Order Process Language
Keyword(s):
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.
Keyword(s):
2018 ◽
Vol 28
(9)
◽
pp. 1606-1638
◽
1996 ◽
Vol 6
(5)
◽
pp. 409-453
◽
Keyword(s):
2018 ◽
Vol 29
(3)
◽
pp. 465-510
◽
1998 ◽
Vol 8
(5)
◽
pp. 447-491
◽
Keyword(s):
2011 ◽
Vol 403-408
◽
pp. 4859-4866
◽
Keyword(s):