Concurrent games over relational structures: the origin of game comonads

DOI10.1145/3661814.3662075MaRDI QIDQ6970214zbMATH OpenFDO

Authors Glynn Winskel

Publication date 18 June 2025

Full work available at URL https://doi.org/10.1145/3661814.3662075

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Eilenberg-Moore and Kleisli constructions for monads (18C20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• An optimal lower bound on the number of variables for graph identification
• Arboreal Categories: An Axiomatic Theory of Resources
• Bisimulation from open maps
• Concurrent quantum strategies
• Deterministic concurrent strategies
• Distributed probabilistic and quantum strategies
• Event structures with symmetry
• Finite model theory and its applications.
• scientific article; zbMATH DE number 3650529 (Why is no real title available?)
• scientific article; zbMATH DE number 3821120 (Why is no real title available?)
• Introduction to mathematical philosophy. 1. Auflage 1919, 2. Auflage 1920.
• Making concurrency functional
• Partial Orders, Event Structures and Linear Strategies
• Relating structure and power: Comonadic semantics for computational resources
• Strategies as profunctors
• The formal theory of monads
• The pebble-relation comonad in finite model theory
• The pebbling comonad in finite model theory
• The winning ways of concurrent games
• Winning, losing and drawing in concurrent games with perfect or imperfect information

This page was built for publication: Concurrent games over relational structures: the origin of game comonads

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970214)