A fully abstract game semantics of local exceptions

Laird, James (2001) A fully abstract game semantics of local exceptions. In: LICS Conference 2001.

Full text not available from this repository.


A fully abstract game semantics for an extension of Idealized Algol with locally declared exceptions is presented. It is based on "Hyland-Ong games", but as well as relaxing the constraints which impose functional behaviour (as in games models of other computational effects such as continuations and references), new structure is added to plays in the form of additional pointers which track the flow of control. The semantics is proved to be fully abstract by a factorization of strategies into a 'new-exception generator' and a strategy with local control flow. It is shown, using examples, that there is no model of exceptions which is a conservative extension of the semantics of Idealized Algol without the new pointers.

Item Type: Conference or Workshop Item (Paper)
Schools and Departments: School of Engineering and Informatics > Informatics
Depositing User: James David Laird
Date Deposited: 06 Feb 2012 18:42
Last Modified: 31 May 2012 11:44
URI: http://sro.sussex.ac.uk/id/eprint/17856
📧 Request an update