License
when quoting this document, please refer to the following
DOI: 10.4230/OASIcs.CCA.2009.2258
URN: urn:nbn:de:0030-drops-22581
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2258/
Berger, Ulrich
Contributed Papers

Realisability and Adequacy for (Co)induction

pdf-format:
Dokument 1.pdf (324 KB)

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.

BibTeX - Entry

@InProceedings{berger:DSP:2009:2258,
  author =	{Ulrich Berger},
  title =	{Realisability and Adequacy for (Co)induction},
  booktitle =	{6th Int'l Conf. on Computability and Complexity in Analysis},
  year =	{2009},
  editor =	{Andrej Bauer and Peter Hertling and Ker-I Ko},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2258},
  annote =	{Keywords: Constructive Analysis, realisability, program extraction, semantics},
}

Keywords: Constructive Analysis, realisability, program extraction, semantics
Seminar: 6th International Conference on Computability and Complexity in Analysis (CCA'09)
Issue date: 2009
Date of publication: 25.11.2009

DROPS-Home | Fulltext Search | Imprint Published by LZI