A fully abstract game semantics for general references

Samson Abramsky, Kohei Honda, Guy McCusker

Research output: Chapter in Book/Report/Conference proceedingConference contribution

119 Citations (Scopus)

Abstract

A games model of a programming language with higher-order store in the style of ML-references is introduced. The category used for the model is obtained by relaxing certain behavioural conditions on a category of games previously used to provide fully abstract models of pure functional languages. The model is shown to be fully abstract by means of factorization arguments which reduce the question of definability for the language with higher-order store to that for its purely functional fragment.

Original languageEnglish
Title of host publicationProceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998
PublisherIEEE
Pages334-344
Number of pages11
Volume1998-June
ISBN (Print)0818685069
DOIs
Publication statusPublished - 1 Jan 1998
Event13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998 - Indianapolis, USA United States
Duration: 21 Jun 199824 Jun 1998

Conference

Conference13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998
CountryUSA United States
CityIndianapolis
Period21/06/9824/06/98

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Abramsky, S., Honda, K., & McCusker, G. (1998). A fully abstract game semantics for general references. In Proceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998 (Vol. 1998-June, pp. 334-344). IEEE. https://doi.org/10.1109/LICS.1998.705669

A fully abstract game semantics for general references. / Abramsky, Samson; Honda, Kohei; McCusker, Guy.

Proceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998. Vol. 1998-June IEEE, 1998. p. 334-344.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abramsky, S, Honda, K & McCusker, G 1998, A fully abstract game semantics for general references. in Proceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998. vol. 1998-June, IEEE, pp. 334-344, 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998, Indianapolis, USA United States, 21/06/98. https://doi.org/10.1109/LICS.1998.705669
Abramsky S, Honda K, McCusker G. A fully abstract game semantics for general references. In Proceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998. Vol. 1998-June. IEEE. 1998. p. 334-344 https://doi.org/10.1109/LICS.1998.705669
Abramsky, Samson ; Honda, Kohei ; McCusker, Guy. / A fully abstract game semantics for general references. Proceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998. Vol. 1998-June IEEE, 1998. pp. 334-344
@inproceedings{b1b415f7095843aa862a654f9c98e76f,
title = "A fully abstract game semantics for general references",
abstract = "A games model of a programming language with higher-order store in the style of ML-references is introduced. The category used for the model is obtained by relaxing certain behavioural conditions on a category of games previously used to provide fully abstract models of pure functional languages. The model is shown to be fully abstract by means of factorization arguments which reduce the question of definability for the language with higher-order store to that for its purely functional fragment.",
author = "Samson Abramsky and Kohei Honda and Guy McCusker",
year = "1998",
month = "1",
day = "1",
doi = "10.1109/LICS.1998.705669",
language = "English",
isbn = "0818685069",
volume = "1998-June",
pages = "334--344",
booktitle = "Proceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998",
publisher = "IEEE",
address = "USA United States",

}

TY - GEN

T1 - A fully abstract game semantics for general references

AU - Abramsky, Samson

AU - Honda, Kohei

AU - McCusker, Guy

PY - 1998/1/1

Y1 - 1998/1/1

N2 - A games model of a programming language with higher-order store in the style of ML-references is introduced. The category used for the model is obtained by relaxing certain behavioural conditions on a category of games previously used to provide fully abstract models of pure functional languages. The model is shown to be fully abstract by means of factorization arguments which reduce the question of definability for the language with higher-order store to that for its purely functional fragment.

AB - A games model of a programming language with higher-order store in the style of ML-references is introduced. The category used for the model is obtained by relaxing certain behavioural conditions on a category of games previously used to provide fully abstract models of pure functional languages. The model is shown to be fully abstract by means of factorization arguments which reduce the question of definability for the language with higher-order store to that for its purely functional fragment.

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

U2 - 10.1109/LICS.1998.705669

DO - 10.1109/LICS.1998.705669

M3 - Conference contribution

SN - 0818685069

VL - 1998-June

SP - 334

EP - 344

BT - Proceedings - 13th Annual IEEE Symposium on Logic in Computer Science, LICS 1998

PB - IEEE

ER -