Tzevelekos, Nikos - Full abstraction for nominal general references

lmcs:918 - Logical Methods in Computer Science, September 11, 2009, Volume 5, Issue 3
Full abstraction for nominal general references

Authors: Tzevelekos, Nikos

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.


Source : oai:arXiv.org:0907.4477
DOI : 10.2168/LMCS-5(3:8)2009
Volume: Volume 5, Issue 3
Published on: September 11, 2009
Submitted on: January 2, 2008
Keywords: Computer Science - Programming Languages,Computer Science - Logic in Computer Science,D.3.1


Share

Consultation statistics

This page has been seen 51 times.
This article's PDF has been downloaded 68 times.