An Axiomatic Account of a Fully Abstract Game Semantics for General References

Research output: Chapter or section in a book/report/conference proceedingChapter or section

Abstract

We present an analysis of the game semantics of general references introduced by Abramsky, Honda and McCusker which exposes the algebraic structure of the model. Using the notion of sequoidal category, we give a coalgebraic definition of the denotational semantics of storage cells of arbitrary type. We identify further conditions on the model which allow an axiomatic presentation of the proof that finite elements of the model are definable by programs, in the style of Abramsky’s Axioms for Definability.

Original languageEnglish
Title of host publicationSamson Abramsky on Logic and Structure in Computer Science and Beyond
EditorsA. Palmigiano, M. Sadrzadeh
Place of PublicationCham, Switzerland
PublisherSpringer, Cham
Pages251-292
Number of pages42
ISBN (Electronic)9783031241178
ISBN (Print)9783031241161
DOIs
Publication statusPublished - 2 Aug 2023

Publication series

NameOutstanding Contributions to Logic
Volume25
ISSN (Print)2211-2758
ISSN (Electronic)2211-2766

Keywords

  • Computational adequacy
  • Computational effects
  • Full abstraction
  • Game semantics
  • Higher-order store
  • Semantics of programming languages

ASJC Scopus subject areas

  • Logic

Fingerprint

Dive into the research topics of 'An Axiomatic Account of a Fully Abstract Game Semantics for General References'. Together they form a unique fingerprint.

Cite this