University of Birmingham > Talks@bham > Theoretical computer science seminar > Conjugate Hylomorphisms

## Conjugate HylomorphismsAdd to your list(s) Download to your calendar using vCal - Nicolas Wu (Bristol)
- Friday 18 December 2015, 13:00-14:00
- CS 217.
If you have a question about this talk, please contact Neel Krishnaswami. The past decades have witnessed an extensive study of structured recursion schemes. A general scheme is the hylomorphism, which captures the essence of divide-and-conquer: a problem is broken into sub-problems by a coalgebra; sub-problems are solved recursively; the sub-solutions are combined by an algebra to form a solution. In this talk we introduce a simple toolbox for assembling recursive coalgebras, which by definition ensure that their hylo equations have unique solutions, whatever the algebra. Our main tool is the conjugate rule, a generic rule parametrized by an adjunction and a conjugate pair of natural transformations. We show that many basic adjunctions induce useful recursion schemes. In fact, almost every structured recursion scheme seems to arise as an instance of the conjugate rule. This talk is part of the Theoretical computer science seminar series. ## This talk is included in these lists:- CS 217
- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Theoretical computer science seminar
- computer sience
Note that ex-directory lists are not shown. |
## Other listsCold atoms Jane Langdale Midlands Logic Seminar## Other talksUltrafast, all-optical, and highly efficient imaging of molecular chirality TBC Sensing and metrology activities at NPL, India Hodge Theory: Connecting Algebra and Analysis Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Quantum simulations using ultra cold ytterbium |