Asynchronous Games: Innocence Without Alternation

@inproceedings{Mellis2007AsynchronousGI,
  title={Asynchronous Games: Innocence Without Alternation},
  author={P. Melli{\`e}s and S. Mimram},
  booktitle={CONCUR},
  year={2007}
}
  • P. Melliès, S. Mimram
  • Published in CONCUR 2007
  • Computer Science, Mathematics
  • The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of ?-terms and PCF programs. An innocent strategy is defined as an alternating strategy with partial memory, in which the strategy plays according to its view. Extending the definition to nonalternating strategies is problematic, because the traditional definition of views is based on the hypothesis that Opponent and Proponent alternate during the interaction. Here, we take advantage… CONTINUE READING
    Categorical combinatorics of scheduling and synchronization in game semantics
    4
    Concurrent Hyland-Ong games
    7
    A Tale of Additives and Concurrency in Game Semantics
    1
    The Parallel Intensionally Fully Abstract Games Model of PCF
    27
    Concurrent Structures in Game Semantics
    5
    Deterministic concurrent strategies
    12
    The Winning Ways of Concurrent Games
    34
    Bicategories of Concurrent Games - (Invited Paper)
    1
    Token Machines for Multiport Interaction Combinators

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 44 REFERENCES
    Asynchronous Games 2: The True Concurrency of Innocence
    52
    Timeless Games
    26
    Games and Full Completeness for Multiplicative Linear Logic
    407
    Angelic Semantics of Fine-Grained Concurrency
    78
    Concurrent games and full completeness
    192
    Sequentiality vs. Concurrency In Games And Logic
    43
    Typed Event Structures and the p-Calculus
    15