A fully abstract game semantics of local exceptions

J. Laird

doi:10.1109/LICS.2001.932487

A fully abstract game semantics of local exceptions

Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

30 Citations (SciVal)

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", 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.

Original language	English
Title of host publication	Proceedings of 16th Annual IEEE Symposium on Logic in Computer Science, 2001
Publisher	IEEE
Pages	105-114
Number of pages	10
ISBN (Print)	076951281X
DOIs	https://doi.org/10.1109/LICS.2001.932487
Publication status	Published - Jun 2001
Event	16th Annual IEEE Symposium on Logic in Computer Science - Boston, MA, USA United States Duration: 16 Jun 2001 → 19 Jun 2001

Conference

Conference	16th Annual IEEE Symposium on Logic in Computer Science
Country/Territory	USA United States
City	Boston, MA
Period	16/06/01 → 19/06/01

Access to Document

10.1109/LICS.2001.932487

http://dx.doi.org/10.1109/LICS.2001.932487

Cite this

@inproceedings{280381caf6be44c4b2f48bb153a6de1f,

title = "A fully abstract game semantics of local exceptions",

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{"}, 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.",

author = "J. Laird",

year = "2001",

month = jun,

doi = "10.1109/LICS.2001.932487",

language = "English",

isbn = "076951281X ",

pages = "105--114",

booktitle = "Proceedings of 16th Annual IEEE Symposium on Logic in Computer Science, 2001",

publisher = "IEEE",

address = "USA United States",

note = "16th Annual IEEE Symposium on Logic in Computer Science ; Conference date: 16-06-2001 Through 19-06-2001",

}

TY - GEN

T1 - A fully abstract game semantics of local exceptions

AU - Laird, J.

PY - 2001/6

Y1 - 2001/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034865457&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1109/LICS.2001.932487

U2 - 10.1109/LICS.2001.932487

DO - 10.1109/LICS.2001.932487

M3 - Chapter in a published conference proceeding

AN - SCOPUS:0034865457

SN - 076951281X

SP - 105

EP - 114

BT - Proceedings of 16th Annual IEEE Symposium on Logic in Computer Science, 2001

PB - IEEE

T2 - 16th Annual IEEE Symposium on Logic in Computer Science

Y2 - 16 June 2001 through 19 June 2001

ER -

A fully abstract game semantics of local exceptions

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this