A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
The pebbling comonad in Finite Model Theory
2017
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern functional programming. We show that existential kpebble games have a natural comonadic formulation. Winning strategies for Duplicator in the k-pebble game for structures A and B are equivalent to morphisms from A to B in the coKleisli category for this comonad.
doi:10.1109/lics.2017.8005129
dblp:conf/lics/AbramskyDW17
fatcat:mxmtmosgyvhwrbsemoqz7oqhfm