OASIcs.CCA.2009.2258.pdf
- Filesize: 323 kB
- 12 pages
We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped $\lambda$-calculus with fixed-points. We illustrate the use of this interpretation for program extraction by some simple examples in the area of exact real number computation and hint at further non-trivial applications in computable analysis.
Feedback for Dagstuhl Publishing