University of Cambridge > > Logic and Semantics Seminar (Computer Laboratory) > Polynomial functors

Polynomial functors

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sam Staton.

Joint work with Joachim Kock (Barcelona).

The theory of polynomial functors provides a general framework to study the universal properties of recursive sets, such as sets of wellfounded trees. One important fact in this theory is that every polynomial functor has an associated free monad, characterized by an evident universal property. Our main result shows how the free monad on a polynomial functor enjoys also another, less evident, universal property, which is most elegantly expressed by organizing polynomial functors in a double category.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity