University of Birmingham > Talks@bham > Theoretical computer science seminar > A coalgebraic approach to term graphs

A coalgebraic approach to term graphs

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

If you have a question about this talk, please contact Paul Levy.

An important notion in computer science is that of a term graph—-a syntax tree in which subnodes may be shared. Whilst the intuitive idea is clear, the formal definition is rather messy. In this talk, I describe an alternative, cleaner, representation of term graphs as coalgebras for a certain comonad.

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.