A game semantics of local names and good variables (2004)
Cached
Download Links
- [www.cogs.susx.ac.uk]
- [www.informatics.sussex.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | of Lecture Notes in Computer Science |
| Citations: | 14 - 4 self |
BibTeX
@INPROCEEDINGS{Laird04agame,
author = {J. Laird},
title = {A game semantics of local names and good variables},
booktitle = {of Lecture Notes in Computer Science},
year = {2004},
pages = {289--303},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We describe a game semantics for local names in a functional setting. It is based on a category of dialogue games acted upon by the automorphism group of the natural numbers; this allows properties of names such as freshness and locality to be characterized semantically. We describe a model of the nu-calculus in this category, and extend it with named references (without bad variables) using names as pointers to a store. After refining the semantics via a notion of garbage collection, we prove that the compact elements are definable as terms, and hence obtain a full abstraction result. 1 Introduction Local names are a pervasive and subtle feature of programming languages and other calculi. Not only are they used for manipulating important constructs such as locally bound references and exceptions, name-passing is itself a very expressive computational paradigm, as demonstrated by the ss-calculus, for example. Local names can also represent items of secret information which are dynamically generated, passed between agents and used to access further information or activity. They therefore have a key r^ole in specifying properties of secure systems [1, 24].
