University of Birmingham > Talks@bham > Theoretical computer science seminar > Polynomials via fibrations

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Polynomials via fibrations

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

If you have a question about this talk, please contact Jamie Vicary.

Polynomials in category theory represent datatypes which, like polynomial functions, can be expressed using sums and products. Extending this analogy, I will characterize the category of polynomials in terms of indexed sums and products for fibrations. This category arises from a distributive law between the pseudomonad ‘freely adding’ indexed sums to a fibration, and its dual adding indexed products. I will also relate this perspective to the structure of categorical models of type theory with dependent sum and product types.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Data Science and Computational Statistics Seminar dddd Metallurgy & Materials – Tech Entrepreneurship Seminar Series

Other talks

Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Test talk TBC Extending the Lax type operator for finite W-algebras Modelling uncertainty in image analysis. Sylow branching coefficients for symmetric groups
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.