Polynomial functors

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

• Nicola Gambino
• Friday 21 November 2008, 14:00-15:00
• Room FW11, Computer Laboratory, William Gates Building.

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.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computing and Mathematics
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Logic and Semantics Seminar (Computer Laboratory)
• Room FW11, Computer Laboratory, William Gates Building
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.