Abstract
We describe two representations for real numbers, signed digit streams and Cauchy sequences. We give coinductive proofs for the correctness of functions converting between these two representations to show the adequacy of signed digit stream representation. We also show a coinductive proof for the correctness of a corecursive program for the average function with regard to the signed digit stream representation. We implemented this proof in the interactive proof system Minlog. Thus, reliable, corecursive functions for real computation can be guaranteed, which is very helpful in formal software development for real numbers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertot, Y.: Coinduction in Coq. In: Lecture Notes of TYPES Summer School 2005, Sweden, August 15-26, 2005, vol. II (2005), http://www.cs.chalmers.se/Cs/Research/Logic/TypesSS05/Extra/bertot.pdf
Buchholz, W.: A term calculus for (co-)recursive definitions on streamlike data-structures. Annals of Pure and Applied Logic 136, 75–90 (2005)
Ciaffaglione, A., Gianantonio, D.: A certified, corecursive implementation of exact real numbers. Theoretical Computer Science 351, 39–51 (2006)
Chirimar, J., Howe, D.J.: Implementing constructive real analysis: preliminary report. In: Myers Jr., J.P., O’Donnell, M.J. (eds.) Constructivity in CS 1991. LNCS, vol. 613, pp. 165–178. Springer, Heidelberg (1992)
Ciaffaglione, A.: Certified reasoning on real numbers and objects in co-inductive type theory. Ph.D Thesis. Department of Mathematics and Computer Science, University of Udine, and INPL-ENSMNS, Nancy, France (2003)
Edalat, A., Heckmann, R.: Computing with real numbers - I. The LFT approach to real number computation - II. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 193–267. Springer, Heidelberg (2002)
Escardo, M.H., Simpson, A.: A universal characterization of the closed Euclidean interval (extended abstract). In: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, Boston, Massachusetts, pp. 115–125 (2001)
Gibbons, J.: Streaming Representation-Changers. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 142–168. Springer, Heidelberg (2004)
Jones, C.: Completing the rationals and metric spaces in LEGO. In: Huet, G., Plotkin, G. (eds.) Proceedings of the Second Annual Workshop on Logical Frameworks (1992)
Ko, K.-I.: Complexity theory of real functions. Birkhauser, Boston (1991)
Lenisa, M.: From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems. In: Jacobs, B., Rutten, J. (eds.) Coalgebraic Methods in Computer Science CMCS 1999 Conference Proceedings. ENTCS, vol. 19 (1999)
Niqui, M.: Formalising exact arithmetic in type theory. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 368–377. Springer, Heidelberg (2005)
Plume, D.: A Calculator for Exact Real Number Computation. 4th year project. Departments of Computer Science and Artificial Intelligence, University of Edinburgh (1998)
Schwichtenberg, H.: Inverting monotone continuous functions in constructive analysis. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988. Springer, Heidelberg (2006)
Turing, A.M.: Systems of logic based on ordinals. Proc. London Math. Soc. 45, 161–228 (1939)
Weihrauch, K.: Computable analysis, an introduction. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hou, T. (2006). Coinductive Proofs for Basic Real Computation. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_24
Download citation
DOI: https://doi.org/10.1007/11780342_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35466-6
Online ISBN: 978-3-540-35468-0
eBook Packages: Computer ScienceComputer Science (R0)