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...
Prif Awduron: | Abramsky, S, Dawar, A, Wang, P |
---|---|
Fformat: | Conference item |
Cyhoeddwyd: |
IEEE
2017
|
Eitemau Tebyg
-
The Pebble-Relation Comonad in Finite Model Theory
gan: Yoàv Montacute, et al.
Cyhoeddwyd: (2024-05-01) -
Game Comonads & Generalised Quantifiers
gan: Adam Ó Conghaile, et al.
Cyhoeddwyd: (2024-07-01) -
Lovasz-type theorems and game comonads
gan: Dawar, A, et al.
Cyhoeddwyd: (2021) -
Relating structure to power: comonadic semantics for computational resources
gan: Abramsky, S, et al.
Cyhoeddwyd: (2018) -
A comonadic view of simulation and quantum resources
gan: Abramsky, S, et al.
Cyhoeddwyd: (2019)