Games on graphs and sequentially realizable functionals. Extended abstract

M. Hyland, A. Schalk
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science  
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
more » ... sional setting and the prospects for a better understanding of the Longley Conjecture.
doi:10.1109/lics.2002.1029834 dblp:conf/lics/HylandS02 fatcat:lbps7wjspfhr7hgyg5iz7huvya