Abstract

We implement exact real numbers in the logical framework Coq using streams, i.e., infinite sequences, of digits, and characterize constructive real numbers through a minimal axiomatization. We prove that our construction inhabits the axiomatization, working formally with coinductive types and corecursive proofs. Thus we obtain reliable, corecursive algorithms for computing on real numbers.

Citations

417	The calculus of constructions - Coquand, Huet - 1988
342	Constructive Analysis - Bishop, Bridges - 1985
112	Computable Analysis: an Introduction - Weihrauch - 2000
75	Theorem Proving with the Real Numbers - Harrison - 1998
65	Infinite Objects in Type Theory - Coquand - 1994
63	Codifying Guarded Definitions with Recursive Schemes - Giménez - 1994
28	Semantics of exact real arithmetic - Potts, Edalat, et al. - 1996
19	Constructive mathematics: a foundation for computable analysis - Bridges - 1999
13	M.: Constructive reals in coq: Axioms and categoricity - Geuvers, Niqui - 2002
12	Implementing constructive real analysis: a preliminary report - Chirimar, Howe - 1991
11	Certified Reasoning on Real Numbers and Objects in Coinductive Type Theory - Ciaffaglione - 1993
11	Formalisation et automatisation de preuves en analyses réelle et numérique - Mayero - 2001
10	Completing the rationals and metric spaces - Jones - 1993
8	Checking Landau’s ”Grundlagen” in the AUTOMATH System - Jutting - 1977
7	Pointfree Approach to Constructive Analysis in Type Theory - Cederquist - 1997
7	Gianantonio. A coinductive approach to real numbers - Ciaffaglione, Di - 2000
4	Gianantonio. A tour with constructive real numbers - Ciaffaglione, Di - 2001
2	Gianantonio, The Web Appendix of this paper, Dipartimento di Matematica e Informatica - Ciaffaglione, Di - 2004
2	The Fundamental Theorem of Algebra - Geuvers, Pollack, et al. - 2000