An algebraic account of references in game semantics - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

An algebraic account of references in game semantics

Paul-André Melliès
Nicolas Tabareau


We study the algebraic structure of a programming language with higher-order store, in the style of ML references. Instead of working directly on the operational semantics of the language, we consider its fully abstract game semantics defined by Abramsky, Honda and McCusker one decade ago. This alternative description of the language is nice and conceptual, except on one significant point: the interactive behavior of the higher-order memory cell is reflected in the model by a strategy $\mathtt{cell}$ whose definition remains slightly enigmatic. The purpose of our work is precisely to clarify this point, by providing a neat algebraic definition of the strategy. This conceptual reconstruction of the memory cell is based on the idea that a general reference behaves essentially as a linear feedback (or trace operator) in an ambient category of Conway games and strategies. This analysis leads to a purely axiomatic proof of soundness of the model, based on a natural refinement of the replication modality of tensor logic.
Fichier principal
Vignette du fichier
references_mfps.pdf (360.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00374933 , version 1 (10-04-2009)
hal-00374933 , version 2 (28-05-2009)


  • HAL Id : hal-00374933 , version 2


Paul-André Melliès, Nicolas Tabareau. An algebraic account of references in game semantics. Mathematical Foundations of Programming Semantics, Apr 2009, Oxford, United Kingdom. pp.377-405. ⟨hal-00374933v2⟩
499 View
116 Download


Gmail Facebook Twitter LinkedIn More