A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Games on graphs and sequentially realizable functionals. Extended abstract
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
doi:10.1109/lics.2002.1029834
dblp:conf/lics/HylandS02
fatcat:lbps7wjspfhr7hgyg5iz7huvya