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...
主要な著者: | Abramsky, S, Dawar, A, Wang, P |
---|---|
フォーマット: | Conference item |
出版事項: |
IEEE
2017
|
類似資料
-
The Pebble-Relation Comonad in Finite Model Theory
著者:: Yoàv Montacute, 等
出版事項: (2024-05-01) -
Game Comonads & Generalised Quantifiers
著者:: Adam Ó Conghaile, 等
出版事項: (2024-07-01) -
Lovasz-type theorems and game comonads
著者:: Dawar, A, 等
出版事項: (2021) -
Relating structure to power: comonadic semantics for computational resources
著者:: Abramsky, S, 等
出版事項: (2018) -
A comonadic view of simulation and quantum resources
著者:: Abramsky, S, 等
出版事項: (2019)