Skip to main content

Full Abstraction for Nominal Exceptions and General References

Nikos Tzevelekos

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.

Institution
Oxford University Computing Laboratory
Month
October
Number
RR−07−08
Year
2007