University of Birmingham > Talks@bham > Theoretical computer science seminar > Universal algebra over nominal sets

## Universal algebra over nominal setsAdd to your list(s) Download to your calendar using vCal - Daniela Petrisan, University of Leicester
- Friday 12 March 2010, 14:00-15:00
- UG40 Computer Science.
If you have a question about this talk, please contact Paul Levy. We investigate the foundations of a theory of algebraic data types with variable binding inside classical many-sorted universal algebra. The nominal sets introduced by Gabbay and Pitts give an elegant treatment of abstract syntax with binders. This talk presents a category-theoretic study of monads over nominal sets that leads us to introduce new notions of finitary based monads and uniform monads. The close connection between nominal sets and the presheaf category [I,Set] enables us to spell out these notions in the language of universal algebra. We show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and how to transfer classical results from universal algebra to nominal sets. This is joint work with Alexander Kurz (University of Leicester) and Jirí Velebil (Czech Technical University, Prague). This talk is part of the Theoretical computer science seminar series. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Theoretical computer science seminar
- UG40 Computer Science
- computer sience
Note that ex-directory lists are not shown. |
## Other listsMidlands Logic Seminar Particle Physics Seminars Computer Science Lunch Time Talk Series## Other talksModule tensor categories and the Landau-Ginzburg/conformal field theory correspondence View fusion vis-à-vis a Bayesian interpretation of Black-Litterman for portfolio allocation Structured Decompositions: recursive data and recursive algorithms Theory: This is moved to next year, 2023 ! TBA Energy release and transport in solar eruptive events |