Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects. Recently, nominal games have been proposed for modelling functional languages with names. These are ordinary, stateful games cast in the theory of nominal sets developed by Pitts and Gabbay. Here we take nominal games one step further, by developing a fully abstract semantics for a language with nominal general references.
CITATION STYLE
Tzevelekos, N. (2009). Full abstraction for nominal general references. Logical Methods in Computer Science, Volume 5, Issue 3. https://doi.org/10.2168/lmcs-5(3:8)2009
Mendeley helps you to discover research relevant for your work.