Games on graphs and sequentially realizable functionals extended abstract

Martin Hyland, Andrea Schalk

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 fora better understanding of the Longley Conjecture.
    Original languageEnglish
    Title of host publicationProceedings - Symposium on Logic in Computer Science|Proc Symp Logic Comput Sci
    Pages257-264
    Number of pages7
    DOIs
    Publication statusPublished - 2002
    Event17th Annual IEEE Symposium on Logic in Computer Science - Copenhagen
    Duration: 1 Jul 2002 → …

    Conference

    Conference17th Annual IEEE Symposium on Logic in Computer Science
    CityCopenhagen
    Period1/07/02 → …

    Fingerprint

    Dive into the research topics of 'Games on graphs and sequentially realizable functionals extended abstract'. Together they form a unique fingerprint.

    Cite this