University of Birmingham > Talks@bham > Theoretical computer science seminar > Towards a Categorical Foundation for Generic Programming

## Towards a Categorical Foundation for Generic ProgrammingAdd to your list(s) Download to your calendar using vCal - Ralf Hinze, University of Oxford
- Tuesday 18 October 2011, 13:00-14:00
- UG06 Learning Centre.
If you have a question about this talk, please contact Paul Levy. Generic Haskell is an extension of Haskell that supports datatype-generic programming. The central idea of Generic Haskell is to interpret a type by a function, the so-called instance of a generic function at that type. Since types in Haskell include parametric types such as `list of’, Generic Haskell represents types by terms of the simply-typed lambda calculus. This talk puts the idea of interpreting types as functions on a firm theoretical footing, exploiting the fact that the simply-typed lambda calculus can be interpreted in a cartesian closed category. We identify a suitable target category, a subcategory of Cat, and argue that slice, coslice and comma categories are a good fit for interpreting generic functions at base types. Generic crush, also known as reduce, serves as a running example. Joint work with Nicolas Wu, Well-Typed LLP . 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
- Theoretical computer science seminar
- UG06 Learning Centre
- computer sience
Note that ex-directory lists are not shown. |
## Other listsMetallurgy & Materials – Tech Entrepreneurship Seminar Series Analysis Reading Seminar 2019/2020 School of Mathematics events## Other talksWaveform modelling and the importance of multipole asymmetry in Gravitational Wave astronomy TBA TBA TBC The tragic destiny of Mileva Marić Einstein Ultrafast Spectroscopy and Microscopy as probes of Energy Materials |