Nominal domain theory for concurrency

Authors:
David Turner;Glynn Winskel
Affiliations:
University of Cambridge, Computer Laboratory;University of Cambridge, Computer Laboratory
Venue:
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Year:
2009

Citing 3
Cited 2

Linear Lambda-Calculus and Categorial Models Revisited

CSL '92 Selected Papers from the Workshop on Computer Science Logic
Domain theory for concurrency

Theoretical Computer Science - Logic, semantics and theory of programming
Name Generation and Linearity

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science

Full abstraction for nominal Scott domains

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Turing Machines with Atoms

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 accordingly this expands to a metalanguage, Nominal HOPLA, with name generation (closely related to an earlier language new-HOPLA). Nominal HOPLA possesses an operational and denotational semantics which are related via soundness and adequacy results, again carried out within FM sets.