A fully abstract game semantics of local exceptions

Author

Laird, J.

Author_Institution

Sussex Univ., Brighton, UK

fYear

2001

fDate

2001

Firstpage

105

Lastpage

114

Abstract

A fully abstract game semantics for an extension of Idealized Algol with locally declared exceptions is presented. It is based on “Hyland-Ong games” (J.M.E. Hyland & C.-H.L. Ong, 1995), but as well as relaxing the constraints which impose functional behavior (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

Keywords

ALGOL; abstract data types; exception handling; game theory; programming language semantics; programming theory; Hyland-Ong games; Idealized Algol; abstract game semantics; computational effects; constraint relaxation; continuations; control flow tracking; functional behavior; local control flow; locally declared exceptions; new-exception generator; plays; pointers; references; strategy factorization; Computational modeling; Computer languages; Context modeling; Error correction; Java; Programming profession;

fLanguage

English

Publisher

ieee

Conference_Titel

Logic in Computer Science, 2001. Proceedings. 16th Annual IEEE Symposium on

Conference_Location

Boston, MA

ISSN

1043-6871

Print_ISBN

0-7695-1281-X

Type

conf

DOI

10.1109/LICS.2001.932487

Filename

932487