University of Birmingham > Talks@bham > Theoretical computer science seminar > Realisability for Coinduction with Applications in Computable Analysis

Realisability for Coinduction with Applications in Computable Analysis

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

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.

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.