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

## Polynomials via fibrationsAdd to your list(s) Download to your calendar using vCal - Tamara von Glehn, University of Cambridge
- Friday 16 November 2018, 10:30-11:30
- Computer Science, The Sloman Lounge (UG).
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. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Computer Science, The Sloman Lounge (UG)
- Theoretical computer science seminar
- computer sience
Note that ex-directory lists are not shown. |
## Other listsData Science and Computational Statistics Seminar dddd Metallurgy & Materials – Tech Entrepreneurship Seminar Series## Other talksProvably 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 |