HOPLA -- a higher-order process language. 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.
Keywords for this software
References in zbMATH (referenced in 10 articles , 1 standard article )
Showing results 1 to 10 of 10.
- Hyland, J.M.E.: Elements of a theory of algebraic theories (2014)
- Levy, Paul Blain; Weldemariam, Kidane Yemane: Exploratory functions on nondeterministic strategies, up to lower bisimilarity (2009)
- Virbitskaite, I.B.; Dubtsov, R.S.: Semantic domains of timed event structures (2008)
- Dubtsov, R.S.: Real-time stable event structures and marked Scott domains: An adjunction (2007)
- Lamarche, François: Exploring the gap between linear and classical logic (2007)
- Hyland, Martin: Abstract interpretation of proofs: Classical propositional calculus (2004)
- Nygaard, Mikkel; Winskel, Glynn: Domain theory for concurrency (2004)
- Winskel, Glynn; Zappa Nardelli, Francesco: New-HOPLA: a higher-order process language with name generation (2004)
- Nygaard, Mikkel; Winskel, Glynn: Full abstraction for HOPLA. (2003)
- Nygaard, Mikkel; Winskel, Glynn: HOPLA -- a higher-order process language (2002)