HOPLA--A Higher-Order Process Language
Mikkel Nygaard
December 2002 |
Abstract:
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
Available as PostScript, PDF, DVI. |