Book 1087 views
Realisability and adequacy for (co)induction
Ulrich Berger 
,
David Benton,
David Benton,
David Benton,
Katharina Hall,
Robert Rhys
,
David Benton,
David Benton,
David Benton,
Katharina Hall,
Robert Rhys
Pages: 49 - 60
Swansea University Author:
Ulrich Berger
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.4230/OASIcs.CCA.2009.2258
Abstract
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...
| Published: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2009
|
|---|---|
| Online Access: |
http://drops.dagstuhl.de/opus/volltexte/2009/2258 |
| URI: | https://cronfa.swan.ac.uk/Record/cronfa53 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
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. |
|---|---|
| Item Description: |
In CCA '09, Proc. Sixth Intl. Conference on Computability and Complexity in Analysis, Ljubljana, Slovenia |
| College: |
Faculty of Science and Engineering |
| Start Page: |
49 |
| End Page: |
60 |