Difference between revisions of "Public:Game Comonad Resources"
m |
m (adding Samson's talks) |
||
Line 19: | Line 19: | ||
* Adam Ó Conghaile: Game comonads and generalised quantifiers |
* Adam Ó Conghaile: Game comonads and generalised quantifiers |
||
* Nihil Shah: Path-width and restricting conjunction in k-variable logic |
* Nihil Shah: Path-width and restricting conjunction in k-variable logic |
||
Samson's talks on the topic: |
|||
* Coalgebra Dreams [https://www.coalg.org/coalgebra-now-floc18/files/2018/07/abramsky.pdf] |
|||
* Relating Structure to Power:Comonadic semantics for computational resources [https://www.coalg.org/cmcs18/files/2018/04/Abramsky_slides.pdf] |
Revision as of 17:36, 15 May 2020
Publications
Papers
- Samson Abramsky, Anuj Dawar, and Pengming Wang. "The pebbling comonad in finite model theory." 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. arXiv:1704.05124
- Abramsky, Samson, and Nihil Shah. "Relating Structure and Power: Comonadic semantics for computational resources." International Workshop on Coalgebraic Methods in Computer Science. Springer, Cham, 2018. arXiv:1806.09031
- Samson Abramsky. "Whither semantics?." Theoretical Computer Science 807 (2020): 3-14.
Theses/reports:
- Nihil Shah: Game Comonads in Finite Model Theory (Master Thesis)
- Adam Ó Conghaile: Game comonads, descriptive complexity & finite model theory (First Year Report) [1]
Talks (with slides)
- Dan Marsden: Guards, Structure and Power
- Adam Ó Conghaile: Game comonads and generalised quantifiers
- Nihil Shah: Path-width and restricting conjunction in k-variable logic
Samson's talks on the topic: