Categorical Combinatorics for Innocent Strategies

  title={Categorical Combinatorics for Innocent Strategies},
  author={Russell Harmer and Martin Hyland and Paul-Andr{\'e} Melli{\`e}s},
  journal={22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)},
We show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former distributing over the latter. Innocent strategies are the maps in the induced two-sided Kleisli category. Thus the problematic composition of innocent strategies reflects the use of the distributive law. The composition of simple strategies, and the combinatorics of pointers used to give the comonad and monad are… CONTINUE READING
Highly Cited
This paper has 59 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.

60 Citations

Citations per Year
Semantic Scholar estimates that this publication has 60 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 34 references

On Model-Checking Trees Generated by Higher-Order Recursion Schemes

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) • 2006
View 1 Excerpt

Some results on a game-semantic approach to the verification of infinite structures

C.-H.L. Ong
Proceedings of 20th International Workshop and 15th Annual Conference of the EACSL, Lecture Notes in Computer Science, • 2006
View 1 Excerpt

Classical isomorphisms of types

Mathematical Structures in Computer Science • 2005
View 1 Excerpt

Nominal games and full abstraction for the nu-calculus

Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004. • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…