Coinduction for Exact Real Number Computation

Abstract This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is shown how the associated coinductive principle can be used to give straightforward and easily implementable proofs of the equivalence of the two representations as well as the correctness of various corecursive exact real number algorithms. The basic framework is the classical theory of coinductive sets as greatest fixed points of monotone operators and hence is different from (though related to) the type theoretic approach by Ciaffaglione and Gianantonio.

[1]  Milad Niqui,et al.  Formalising Exact Arithmetic in Type Theory , 2005, CiE.

[2]  Alberto Ciaffaglione,et al.  A certified, corecursive implementation of exact real numbers , 2006, Theor. Comput. Sci..

[3]  Yves Bertot,et al.  Affine functions and series with co-inductive real numbers , 2006, Mathematical Structures in Computer Science.

[4]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[5]  Makoto Tatsuta.  Realizability of Monotone Coinductive Definitions and Its Application to Program Synthesis , 1998, MPC.

[6]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[7]  B. Jacobs,et al.  A tutorial on (co)algebras and (co)induction , 1997 .

[8]  Abbas Edalat,et al.  A new representation for exact real numbers , 1997, MFPS.

[9]  David Turner,et al.  Ensuring the Productivity of Infinite Structures , 1997 .

[10]  Helmut Schwichtenberg,et al.  Inverting Monotone Continuous Functions in Constructive Analysis , 2006, CiE.

[11]  Jawahar Chirimar,et al.  Implementing Constructive Real Analysis: Preliminary Report , 1992, Constructivity in Computer Science.

[12]  Marina Lenisa,et al.  From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems , 1999, CMCS.

[13]  Yves Bertot,et al.  CoInduction in Coq , 2006, ArXiv.

[14]  Alan M. Turing,et al.  Systems of Logic Based on Ordinals , 2012, Alan Turing's Systems of Logic.

[15]  Abbas Edalat,et al.  Computing with real numbers. I. The LFT approach to real number computation. II. A domain framework for computational geometry , 2002 .

[16]  D. Plume.  A calculator for exact real number computation , 1998 .

[17]  Martín Hötzel Escardó,et al.  A universal characterization of the closed Euclidean interval , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[18]  Wilfried Buchholz.  A term calculus for (co-)recursive definitions on streamlike data structures , 2005, Ann. Pure Appl. Log..

[19]  Claire Jones.  Completing the rationals and metric spaces in LEGO , 1993 .

[20]  Jeremy Gibbons,et al.  Streaming Representation-Changers , 2004, MPC.

[21]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

[22]  Milad Niqui.  Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers , 2006, TYPES.

[23]  Abbas Edalat,et al.  Computing with Real Numbers , 2000, APPSEM.