Distributive Laws in the Boom Hierarchy (YR-OWLS)

Maaike Zwart (University of Oxford)

02-Dec-2020, 14:00-15:00 (3 years ago)

Abstract: During my PhD research I have studied distributive laws for monads, and developed various no-go theorems. These theorems prove that monads with certain algebraic properties cannot be composed with each other via a distributive law. In this talk I will focus on examples, and share the intuition that I have developed from my results. All the examples in this talk will be based on the Boom hierarchy, a hierarchy of data structures which lends itself perfectly for the study of monad compositions. Based on which monads in this hierarchy do and do not compose with each other via a distributive law, I will make predictions about the behaviour of monad compositions in general.

formal languages and automata theorylogic in computer sciencelogic

Audience: researchers in the discipline


Online Worldwide Seminar on Logic and Semantics (OWLS)

Series comments: The Online Worldwide Seminar on Logic and Semantics is a new series of research talks, highlighting the most exciting recent work in the international computer science logic community. The scope of the seminar series is roughly that of the major computer science logic conferences such as LICS, ICALP and FSCD. It takes place on most Wednesdays, with a focus every other week on the work of young researchers.

In this time of restricted international travel, a key aim of this series is to provide a forum for the informal discussion and social interaction that is so important for the progress of science. To facilitate this, the seminar incorporates in virtual form a number of features more normally associated with physical meetings.

For more details, please visit the homepage. There is no need to register for the talks, just show up.

Organizers: Alexandra Silva, Pawel Sobocinski, Jamie Vicary, Nathanaƫl Fijalkow, Charles Grellois, S. Krishna, Koko Muroya
Curator: Alakh Dhruv Chopra*
*contact for this listing

Export talk to