Difference between revisions of "Public:Game Comonad Resources"

m (adding Samson's talks)
m (adding Nihil's talk)
Line 24: Line 24:
* Coalgebra Dreams [https://www.coalg.org/coalgebra-now-floc18/files/2018/07/abramsky.pdf]
* 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]
* Relating Structure to Power:Comonadic semantics for computational resources [https://www.coalg.org/cmcs18/files/2018/04/Abramsky_slides.pdf]

Related:
* Nihil Shah - Cofree Comonads and their Uses (at LamdaConf), [https://www.youtube.com/watch?v=ydZ_fLwo9yI recording on youtube]

Revision as of 17:40, 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)

From Online Workshop on Resources and Co-Resources: A Junction between Semantics and Descriptive Complexity:

  • 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:

  • Coalgebra Dreams [2]
  • Relating Structure to Power:Comonadic semantics for computational resources [3]

Related: