How To Be More Productive

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

• Graham Hutton, University of Nottingham
• Friday 11 November 2011, 16:00-17:00
• LG52 Learning Centre.

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

Streams, or infinite lists, have many applications in functional programming, and are naturally defined using recursive equations. But how do we ensure that such equations make sense, i.e. that they actually produce well-defined streams? In this talk we present a new approach to this problem, based upon the topological notion of contractive functions on streams. In particular, we give a sound an complete representation theorem for contractive functions on streams, and show how this can be used to ensure that recursive stream equations are well-defined. The talk will be aimed at a general audience.

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
• LG52 Learning Centre
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.