Coinduction for Exact Real Number Computation

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. Key words: Exact real number computation, coinduction, corecursion, signed digit streams.

• Type: Journal
• Year: 2008
• Where: MST
• Authors: Ulrich Berger, Tie Hou
• Keywords: Coinductive, Exact Real Number, MST 2008, Real Number