Nominal Domain Theory for Concurrency

This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a domain theory for concurrency within FM sets the domain theory inherits types and operations for name generation, essentially without disturbing its original higher-order features. The original domain theory had a metalanguage HOPLA (Higher Order Process LAnguage) and this expands to Nominal HOPLA, with name generation (closely related to an earlier language new-HOPLA, whose denotational semantics has been problematic). Nominal HOPLA possesses an operational and denotational semantics which are related via soundness and adequacy results, again carried out within FM sets.

• Type: Conference
• Year: 2009
• Where: CSL
• Authors: David Turner, Glynn Winskel
• Keywords: Artificial Intelligence, CSL 2009, Domain Theory, Nominal HOPLA, Nominal Set Theory