Mo' nads, mo' problems
From International Center for Computational Logic
Mo' nads, mo' problems
Talk by Kate Birch
- Location: APB 2026
- Start: 17. September 2026 at 11:00 am
- End: 17. September 2026 at 12:00 pm
- Research group: Knowledge-Based Systems
- Event series: Research Seminar Logic and AI
- iCal
There are many important concepts in category theory that find immediate use in theoretical computer science, the most famous of which being monads. This talk will serve as a short introduction for computer scientists to the theory of monads. We will first discuss (using supporting examples from computer science) some of the foundational structures of category theory: mainly functors, natural transformations, equivalences and adjunctions. Then we will move onto monads, covering some basic results and where I am using them in my project this year. If we have enough time, we will also look at their use as transporters of algebraic structures.