Programming Research Group
Research Report RR-07-08
Full Abstraction for Nominal Exceptions and General References
Nikos Tzevelekos
October 2007, 35pp.
Abstract
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 modeling
functional languages with names and nominal general references. Here we make a
step further by developing a fully abstract semantics for a language with nominal
exceptions and nominal general references.
This paper is available as a 340,095 bytes pdf file.
|
![[Oxford Spires]](/im/spires.gif){kind=small}
oucl