Open AccessHOPLA--A Higher-Order Process Language
Author(s) -
Mikkel Nygaard,
Glynn Winskel
Publication year - 2002
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v9i49.21764
Subject(s) - nondeterministic algorithm , concurrency , bisimulation , process calculus , operational semantics , computer science , expressive power , programming language , encode , process (computing) , semantics (computer science) , domain theory , theoretical computer science , congruence (geometry) , path (computing) , mathematics , discrete mathematics , biochemistry , chemistry , geometry , gene
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.