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...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí: Abramsky, S, Dawar, A, Wang, P
Formáid: Conference item
Foilsithe / Cruthaithe: IEEE 2017

Míreanna comhchosúla