New-HOPLA: A Higher-order Process Language with Name Generation

Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain theory are sketched but for the most part the paper concentrates on its operational semantics. The language is typed, the type of a process describing the shape of the computation paths it can perform. Its transition semantics, bisimulation, congruence properties and expressive power are explored. Encodings are given of well-known process algebras, including Ï€-calculus, Higher-Order Ï€-calculus and Mobile Ambients. 1 The origins of new-HOPLA This work is part of a general programme (reported in [8]), to develop a domain theory which scales up to the intricate languages, models and reasoning techniques used in distributed computation. This ambition led to a concentration on path based models, and initially on presheaf models because they can even encompass causal dependency models like event structures; so â€...

• Type: Conference
• Year: 2004
• Where: IFIP
• Authors: Glynn Winskel, Francesco Zappa Nardelli
• Keywords: Communications, Domain Theory, IFIPTCS 2004, Operational Semantics, Presheaf Models