The pebbling comonad in finite model theory
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 h...
Autors principals: | Abramsky, S, Dawar, A, Wang, P |
---|---|
Format: | Conference item |
Publicat: |
IEEE
2017
|
Ítems similars
-
The Pebble-Relation Comonad in Finite Model Theory
per: Yoàv Montacute, et al.
Publicat: (2024-05-01) -
Game Comonads & Generalised Quantifiers
per: Adam Ó Conghaile, et al.
Publicat: (2024-07-01) -
Lovasz-type theorems and game comonads
per: Dawar, A, et al.
Publicat: (2021) -
Relating structure to power: comonadic semantics for computational resources
per: Abramsky, S, et al.
Publicat: (2018) -
A comonadic view of simulation and quantum resources
per: Abramsky, S, et al.
Publicat: (2019)