421 citations · 1.5k across the 77 of their papers we have counts for
Showing 2017 · cs.LOShow all
3 papers · 2 filters
cs.LO2017★ 17 cited
The Quantum Monad on Relational Structures
Samson Abramsky, Rui Soares Barbosa, Nadish de Silva +1
Homomorphisms between relational structures play a central role in finite model theory, constraint satisfaction and database theory. A central theme in quantum computation is to sh…
cs.LO2017★ 19 cited
Intensionality, Definability and Computation
Samson Abramsky
We look at intensionality from the perspective of computation. In particular, we review how game semantics has been used to characterize the sequential functional processes, leadin…
cs.LO2017
The pebbling comonad in finite model theory
Samson Abramsky, Anuj Dawar, Pengming Wang
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 ar…