Abstract

We present a new category of games on graphs and derive from it a model for Intuitionistic Linear Logic. Our category has the computational flavour of concrete data structures but embeds fully and faithfully in an abstract games model. It differs markedly from the usual Intuitionistic Linear Logic setting for sequential algorithms. However, we show that with a natural exponential we obtain a model for PCF essentially equivalent to the sequential algorithms model. We briefly consider a more extensional setting and the prospects for a better understanding of the Longley Conjecture. 1

Citations

83	Sequential algorithms on concrete data structures - Berry, Curien - 1982
74	Categorical combinators, sequential algorithms, and functional programming, 2nd ed - Curien - 1993
55	Hypercoherences: a strongly stable model of linear logic - Ehrhard - 1993
34	On the symmetry of sequentiality - Curien - 1993
32	Concrete domains - Kahn, Plotkin - 1993
30	Event Structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, volume - Winskel - 1987
28	Gluing and orthogonality for models of linear logic - Hyland, Schalk
21	A combinatory algebra for sequential functionals of finite type - Oosten - 1997
13	Believe it or not, ajm’s games model is a model of classical linear logic - Baillot, Danos, et al. - 1997
11	A relative definability result for strongly stable functions and some corollaries - Ehrhard - 1997
9	Abstract Games for Linear Logic. Extended Abstract - Hyland, Schalk - 1999
7	The sequentially realizable functionals,” Annals of Pure and - Longley - 1927
1	On the extensional content of sequential games. Available electronically at the url http://www.pps.jussieu.fr/mellies/ extensionalgames.ps.gz - Mellies