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...
Príomhchruthaitheoirí: | Abramsky, S, Dawar, A, Wang, P |
---|---|
Formáid: | Conference item |
Foilsithe / Cruthaithe: |
IEEE
2017
|
Míreanna comhchosúla
Míreanna comhchosúla
-
The Pebble-Relation Comonad in Finite Model Theory
de réir: Yoàv Montacute, et al.
Foilsithe / Cruthaithe: (2024-05-01) -
Game Comonads & Generalised Quantifiers
de réir: Adam Ó Conghaile, et al.
Foilsithe / Cruthaithe: (2024-07-01) -
Lovasz-type theorems and game comonads
de réir: Dawar, A, et al.
Foilsithe / Cruthaithe: (2021) -
Relating structure to power: comonadic semantics for computational resources
de réir: Abramsky, S, et al.
Foilsithe / Cruthaithe: (2018) -
A comonadic view of simulation and quantum resources
de réir: Abramsky, S, et al.
Foilsithe / Cruthaithe: (2019)