Abstract
We give a categorical description of a class of sound and adequate models of a functional language with assignable variables. This is based on a notion of ``sequoidal category'', a symmetric monoidal category with an additional non-commutative and non-associative tensor product. We describe a category G of games and strategies, and show that it satisfies our axioms. We give an axiomatic characterization of those categories (including G) which give rise to fully abstract models.
- Full text (.pdf)
- Slides (.pdf) from the conference presentation.
- Bibtex entry:
@inproceedings{ctcs,
author = "J. Laird",
title = "A Categorical Semantics of Higher-Order Store",
booktitle = "Proceedings of CTCS '02",
publisher = "Elsevier",
series = "ENTCS",
number = 69,
year = 2002}