University of Birmingham > Talks@bham > Theoretical computer science seminar > From Containers to Induction Recursion

## From Containers to Induction RecursionAdd to your list(s) Download to your calendar using vCal - Neil Ghani, University of Strathclyde
- Friday 03 June 2011, 16:00-17:00
- UG40 Computer Science.
If you have a question about this talk, please contact Paul Levy. I will discuss where we are, and where we are going, from the perspective of data type definition, also known as initial algebra semantics. I will suggest that our goal is often to define what are known as universes, or functions of the form T:U → D where U is “small” and D is large “D”. Within this program I will suggest three well behaved definitional formats: i) containers which accounts for the case where T is a constant function; ii) indexed containers where U is defined in advance of T; and iii) inductive recursive definitions where U and T are defined simultaneously. 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
- UG40 Computer Science
- computer sience
Note that ex-directory lists are not shown. |
## Other listsComputer Science Lunch Time Talk Series Featured talks Applied Topology Colloquium## Other talksSolar Physics: more to come ! TBC TBA Theory: This is moved to next year, 2023 ! Tight Lower Bounds for Parameterized Algorithms under ETH (Special colloquium): Quantum enhanced superresolution confocal microscopy |