Ulrich Berger - From coinductive proofs to exact real arithmetic: theory and applications

lmcs:1109 - Logical Methods in Computer Science, March 24, 2011, Volume 7, Issue 1 - https://doi.org/10.2168/LMCS-7(1:8)2011
From coinductive proofs to exact real arithmetic: theory and applicationsArticle

Authors: Ulrich Berger

    Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with respect to the binary signed digit representation of real numbers. The data type corresponding to the coinductive definition of continuous functions consists of finitely branching non-wellfounded trees describing when the algorithm writes and reads digits. We discuss several examples including the extraction of programs for polynomials up to degree two and the definite integral of continuous maps.

    https://doi.org/10.2168/LMCS-7(1:8)2011
    Source: arXiv.org:1101.2162
    Volume: Volume 7, Issue 1
    Published on: March 24, 2011
    Imported on: June 11, 2010
    Keywords: Computer Science - Logic in Computer Science,03F60
    Licence: arXiv.org - Non-exclusive license to distribute

    14 Documents citing this article

    Share and export

    Consultation statistics

    This page has been seen 1923 times.
    This article's PDF has been downloaded 373 times.