A Categorical Semantics of Higher Order Store

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.

[1]  Dan R. Ghica,et al.  Reasoning about Idealized ALGOL Using Regular Languages , 2000, ICALP.

[2]  Patrick Baillot.  Approches dynamiques en sémantique de la logique linéaire : jeux et géométrie de l'interaction , 1999 .

[3]  Gavin M. Bierman.  What is a Categorical Model of Intuitionistic Linear Logic? , 1995, TLCA.

[4]  Ross Street,et al.  Traced monoidal categories , 1996 .

[5]  Edmund Robinson,et al.  Premonoidal categories and notions of computation , 1997, Mathematical Structures in Computer Science.

[6]  John C. Reynolds,et al.  Syntactic control of interference , 1978, POPL.

[7]  Peter W. O'Hearn,et al.  Algol-like Languages , 1997, Progress in Theoretical Computer Science.

[8]  Samson Abramsky,et al.  Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions , 1996, Electron. Notes Theor. Comput. Sci..

[9]  Peter W. O'Hearn,et al.  Linearly Used Continuations , 2000 .

[10]  Uday S. Reddy,et al.  A linear logic model of state , 1993 .

[11]  Russell Harmer,et al.  A fully abstract game semantics for finite nondeterminism , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[12]  Samson Abramsky,et al.  A fully abstract game semantics for general references , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[13]  James David Laird,et al.  A semantic analysis of control , 1999 .

[14]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[15]  Guy McCusker.  Games and Full Abstraction for a Functional Metalanguage with Recursive Types , 1998, Distinguished Dissertations.

[16]  Andrew M. Pitts,et al.  Relational Properties of Domains , 1996, Inf. Comput..

[17]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[18]  James Laird.  A fully abstract game semantics of local exceptions , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[19]  Masahito Hasegawa,et al.  Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi , 1997, TLCA.