Exact Real Computer Arithmetic with Continued Fractions
IEEE Transactions on Computers
Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Elementary functions: algorithms and implementation
Elementary functions: algorithms and implementation
Exact real arithmetic: a case study in higher order programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
A Mechanically Checked Proof of Correctness of the AMD K5 Floating Point Square Root Microcode
Formal Methods in System Design
Using Reflection to Build Efficient and Certified Decision Procedures
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Comparing Functional Paradigms for Exact Real-Number Computation
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Codifying Guarded Definitions with Recursive Schemes
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
A golden ratio notation for the real numbers
A golden ratio notation for the real numbers
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Implementing the cylindrical algebraic decomposition within the Coq system
Mathematical Structures in Computer Science
A proof-producing decision procedure for real arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Filters on coinductive streams, an application to eratosthenes' sieve
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Theorem Proving with the Real Numbers
Theorem Proving with the Real Numbers
Inductive and Coinductive Components of Corecursive Functions in Coq
Electronic Notes in Theoretical Computer Science (ENTCS)
Real Number Calculations and Theorem Proving
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Certified exact real arithmetic using co-induction in arbitrary integer base
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Coinductive correctness of homographic and quadratic algorithms for exact real numbers
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Constructive mathematics and functional programming
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
From coinductive proofs to exact real arithmetic
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Computer certified efficient exact reals in Coq
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
| Hi-index | 0.00 |
We extend the work of A. Ciaffaglione and P. di Gianantonio on the mechanical verification of algorithms for exact computation on real numbers, using infinite streams of digits implemented as a co-inductive type. Four aspects are studied. The first concerns the proof that digit streams correspond to axiomatised real numbers when they are already present in the proof system. The second re-visits the definition of an addition function, looking at techniques to let the proof search engine perform the effective construction of an algorithm that is correct by construction. The third concerns the definition of a function to compute affine formulas with positive rational coefficients. This is an example where we need to combine co-recursion and recursion. Finally, the fourth aspect concerns the definition of a function to compute series, with an application on the series that is used to compute Euler's number e. All these experiments should be reproducible in any proof system that supports co-inductive types, co-recursion and general forms of terminating recursion; we used the COQ system (Dowek et al. 1993; Bertot and Castéran 2004; Giménez 1994).