Information and Computation
Extensive Games as Process Models
Journal of Logic, Language and Information
Games on Graphs and Sequentially Realizable Functionals
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
From Programs to Games: Invariance and Safety for Bisimulation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
An Explicit Formula for the Free Exponential Modality of Linear Logic
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Hi-index | 0.00 |
We consider a general notion of coalgebraic game, whereby games are viewed as elements of a final coalgebra. This allows for a smooth definition of game operations (e.g. sum, negation, and linear implication) as final morphisms. The notion of coalgebraic game subsumes different notions of games, e.g. possibly non-wellfounded Conway games and games arising in Game Semantics à la [AJM00]. We define various categories of coalgebraic games and (total) strategies, where the above operations become functorial, and induce a structure of monoidal closed or *-autonomous category. In particular, we define a category of coalgebraic games corresponding to AJM-games and winning strategies, and a generalization to non-wellfounded games of Joyal's category of Conway games. This latter construction provides a categorical characterization of the equivalence by Berlekamp, Conway, Guy on loopy games.