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

類似資料