loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
Full abstraction for nominal general references
Wroclaw, Poland
July 10-July 14
ISBN: 0-7695-2908-9
ASCII Text
x 
 
Nikos Tzevelekos, "Full abstraction for nominal general references," Logic in Computer Science, Symposium on, pp. 399-410, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2007.21,
author = {Nikos Tzevelekos},
title = {Full abstraction for nominal general references},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2007},
issn = {1043-6871},
pages = {399-410},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2007.21},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Full abstraction for nominal general references
SN - 1043-6871
SP399
EP410
A1 - Nikos Tzevelekos,
PY - 2007
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Nikos Tzevelekos, Oxford University
Game semantics has been used with considerable suc- cess in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computa- tional effects. Recently, nominal games have been proposed for modeling functional languages with names. These are ordinary games cast in the theory of nominal sets devel- oped 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:
Nikos Tzevelekos, "Full abstraction for nominal general references," lics, pp.399-410, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.