Public:Game Comonad Resources

Revision as of 20:36, 27 May 2020 by Tj330 (talk | contribs) (removing, it only works for <ref> tags)

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: