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

From Containers to Induction Recursion

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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