A coalgebraic approach to term graphs

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

• Richard Garner, University of Cambridge
• Friday 04 June 2010, 14:00-15:00
• UG40 Computer Science.

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.

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.