Relating structure and power: Comonadic semantics for computational resources
From MaRDI portal
Publication:5158366
DOI10.1093/LOGCOM/EXAB048OpenAlexW3192733234MaRDI QIDQ5158366FDOQ5158366
Publication date: 21 October 2021
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9669/
finite model theorycombinatorial gamesbisimulationcomonadspebble gamescoKleisli categoryEhrenfeucht-FraΓ―ssΓ© gamescoalgebras of a comonad
Cited In (7)
- The pebble-relation comonad in finite model theory
- Monoidal Width
- Structure and Power: an Emerging Landscape
- The pebble-relation comonad in finite model theory
- Discrete density comonads and graph parameters
- Arboreal categories and equi-resource homomorphism preservation theorems
- Arboreal Categories: An Axiomatic Theory of Resources
Recommendations
- Relating Structure and Power: Comonadic Semantics for Computational Resources π π
- Relating structure and power: comonadic semantics for computational resources (extended abstract) π π
- On a power of relational structures π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- On abstract resource semantics and computability logic π π
- Comonadic notions of computation π π
- Hypercompositional structures from the computer theory π π
- Title not available (Why is that?) π π
This page was built for publication: Relating structure and power: Comonadic semantics for computational resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158366)