Difference between revisions of "Public:Seminar"
m (adding slides) |
m |
||
| Line 1: | Line 1: | ||
=== Upcoming === |
=== Upcoming === |
||
* 29 June 2022: '''[https://agoy.fr/ Alexandre Goy]''' will give a talk |
|||
| Line 19: | Line 17: | ||
==== 2022 ==== |
==== 2022 ==== |
||
* 29 June 2022: '''[https://agoy.fr/ Alexandre Goy]''' talked about Weakening distributive laws using string diagrams <!-- abstract: Monads are usually composed using distributive laws. If a no-go theorem forbids such a law to exist, there may still be ways to get something looking like a composite monad. This is the purpose of weak distributive laws. In this talk, I will introduce different weakenings of distributive laws and show how string diagrams can help reason about them, using the example of iterated weak distributive laws. --> |
|||
* 22 June 2022: '''Nihil Shah''' '''[https://kam.mff.cuni.cz/~jaklt/comonadwiki/images/2/27/2022-06-22-Shah_-_Linear_modal_comonad_and_linear_arboreal_%28slides%29.pdf (slides)]''' spoke about Linear modal comonad and arboreal categories (joint with Samson and Yoàv) <!-- abstract: A key part of the categorical semantics provided by Spoiler-Duplicator game comonads utilizes the arboreal category structure, axiomatized by Abramsky and Reggio, of their category of coalgebras. Arboreal categories admit a categorical notion of bisimulation. In this talk, I will discuss ongoing work on a notion of linear arboreal category. This notion generalizes the connection between the pebble-relation comonad and the pebbling comonad. As another simpler example, we develop a notion of linear modal comonad which captures trace inclusion, trace equivalence, and another weaker behavioral equivalence. --> |
* 22 June 2022: '''Nihil Shah''' '''[https://kam.mff.cuni.cz/~jaklt/comonadwiki/images/2/27/2022-06-22-Shah_-_Linear_modal_comonad_and_linear_arboreal_%28slides%29.pdf (slides)]''' spoke about Linear modal comonad and arboreal categories (joint with Samson and Yoàv) <!-- abstract: A key part of the categorical semantics provided by Spoiler-Duplicator game comonads utilizes the arboreal category structure, axiomatized by Abramsky and Reggio, of their category of coalgebras. Arboreal categories admit a categorical notion of bisimulation. In this talk, I will discuss ongoing work on a notion of linear arboreal category. This notion generalizes the connection between the pebble-relation comonad and the pebbling comonad. As another simpler example, we develop a notion of linear modal comonad which captures trace inclusion, trace equivalence, and another weaker behavioral equivalence. --> |
||
* 15 June 2022: '''Amin Karamlou''' will talk about No-Go Theorems For Mixed Distributive Laws: Containers over Non-determinism <!-- abstract: Monads and comonads are important constructions of category theory which find widespread application in computer science and other related disciplines. Distributive laws allow these constructions |
* 15 June 2022: '''Amin Karamlou''' will talk about No-Go Theorems For Mixed Distributive Laws: Containers over Non-determinism <!-- abstract: Monads and comonads are important constructions of category theory which find widespread application in computer science and other related disciplines. Distributive laws allow these constructions |
||
Revision as of 16:05, 29 June 2022
Contents
Upcoming
And at some point in the future, we will also have the talks
- Dan will talk about bialgebraic semantics
- Tomas will talk about Adjunctions and a comonad in the Wonderland of (P)CSPs
- Tomas will spark a discussion about adding a layer of quantifiers
Would be nice to have:
- ...
Previous
2022
- 29 June 2022: Alexandre Goy talked about Weakening distributive laws using string diagrams
- 22 June 2022: Nihil Shah (slides) spoke about Linear modal comonad and arboreal categories (joint with Samson and Yoàv)
- 15 June 2022: Amin Karamlou will talk about No-Go Theorems For Mixed Distributive Laws: Containers over Non-determinism
- 8 June 2022: Samson Abramsky gave a talk titled "From Kochen-Specker to Feder-Vardi" (Joint work with Adam Ó Conghaile and Anuj Dawar)
- 1 June 2022: Achim Blumensath gave a tutorial on the composition method
- 25 May 2022: Elena di Lavore will talk about Monoidal Width (slides)
- 11 May 2022: Rafal Stefanski talked about single-use Automata for Infinite Alphabets
- 4 May 2022: we had a general discussion regarding the future of the project, led by Tomas Jakl
- 27 April 2022: Dan Marsden talked about bimorphisms and FVM theorems
- 20 April 2022: Luca Reggio talked about arboreal categories and homomorphism preservation theorems (slides)
- 13 April 2022: Tomas Jakl led a discussion on comonadic tools in Twin-Width I
2021
- 9 December 2021: Tomas Jakl talked about A game comonads' perspective on Courcelle and Feferman-Vaught-Mostowski theorems, (slides)
- 25 November 2021: Algorithms Discussion II
- 11 November 2021: Algorithms Discussion
- 21 October 2021: Luca Reggio talked about Polyadic sets and homomorphism counting
- 21 October 2021: Samson Abramsky talked about Cohomology for Everyone
- 22 April 2021: Tomas Jakl talked about Discrete density comonads (and combinatorial properties), (slides)
- 25 March 2021: Luca Reggio continued with an Introduction to Arboreal Categories (part II)
- 18 March 2021: Samson Abramsky gave an Introduction to Arboreal Categories (part I)
- 11 March 2021: Nihil Shah talked about Metrics on the homomorphism order
- 4 March 2021: Anuj Dawar talked about Invertible Map Games and Linear Algebraic Quantifiers, (slides)
2020
- 3 December 2020: Nihil Shah talked about progress on pebble-relation comonad
- 12 November 2020: Dan Marsden talked about acyclicity in finite Kripke structures
- 22 October 2020: Samson Abramsky talked about his recent work on open span bisimulation
- 15 October 2020: Luca Reggio talked about (locally) finitely presentable categories
- 8 October 2020: Tom Paine talked about Courcelle’s theorem, covering the regular approach, a game theoretic approach, and how it's related to Comonads
- 24 September 2020: Adam Ó Conghaile talked about Brambles, havens, shelters, and other obstructions to nice decompositions: where do they fit in the world of game comonads?
- 17 September 2020: Tomas Jakl talked about 3 new Lovasz-type results
- 3 September 2020: Louis Parlant from the UCL talked about his recent PhD work on general methods for composing monads via distributive laws
- 13 August 2020: Dan Marsden talked about some simple observations relating to modal logics and model constructions within our setting (early work in progress)
- 30 July 2020: Nihil Shah talked about the loosely guarded fragment and hypertree width, (notes)
- 23 July 2020: Samson Abramsky talked about comonadic semantics for guarded fragments
- 16 July 2020: Rui Soares Barbosa talked about the Quantum monad
- 2 July 2020: Tom Paine talked about game comonads and locality
- 25 June 2020: Luca Reggio talked about some of his recent work on results à la Lovász
- 18 June 2020: Alexis Toumi, a DPhil in Oxford, gave a speculative talk about applications of game comonads for work in linguistics and cognition being conducted in our group
- 11 June 2020: Tomas Jakl talked about "retractions" of comonads
- 28 May 2020: Samson Abramsky talked about some of the new material in the extended journal version of his CSL paper with Nihil, (slides)
- 14 May 2020: Luca Reggio talked about the Rossman homomorphism theorem
- 7 May 2020: Dan Marsden talked about string diagrams
- 30 April 2020: Nihil Shah talked about CSP
- 23 April 2020: Tom Paine talked about Interpreting comonads as adjunctions into modal logic
- 9 April 2020: Adam Ó Conghaile talked about Game comonads and generalised quantifiers
