Realisability for Coinduction with Applications in Computable Analysis

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

• Ulrich Berger, University of Swansea
• Friday 11 December 2009, 14:00-15:00
• UG40 Computer Science.

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

We introduce a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped lambda-calculus. In order to demonstrate that this interpretation is practically useful we give a coinductive characterisation of uniformly continuous real functions and derive from this several (proven correct) lazy algorithms for exact real number computation.

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.