A fully abstract game semantics for general references

Samson Abramsky, Kohei Honda, Guy McCusker

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

121 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)

Fingerprint Dive into the research topics of 'A fully abstract game semantics for general references'. Together they form a unique fingerprint.

Cite this