Conference item icon

Conference item

The pebbling comonad in finite model theory

Abstract:

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 have a natural comonadic formulation. Winning strategies for Duplicator in the k-pebble game for structures A and B are equivalent to morphisms from A to B in the coKleisli category for this comonad...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1109/LICS.2017.8005129

Authors


More by this author
Department:
Wolfson College
Role:
Author
Publisher:
IEEE Publisher's website
Publication date:
2017-08-18
Acceptance date:
2017-03-27
DOI:
Pubs id:
pubs:710341
URN:
uri:40a3dfc2-2b15-4a0d-ae2b-fcbbc06db125
UUID:
uuid:40a3dfc2-2b15-4a0d-ae2b-fcbbc06db125
Local pid:
pubs:710341
ISBN:
978-1-5090-3018-7

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP