QArith: Coq Formalisation of Lazy Rational Arithmetic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3085, Issue , 2004, Pages 309-323

  Niqui, Milad ^a   Bertot, Yves ^b  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; COMPUTATION THEORY; MACHINERY; RECURSIVE FUNCTIONS;

FORMALISATION; RATIONAL ARITHMETICS; RATIONAL NUMBERS; THEOREM PROVERS; TYPE THEORY;

THEOREM PROVING;

EID: 35048892792     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24849-1_20     Document Type: Article

References (18)

1. A. Balaa and Y. Bertot. Fonctions récursives géné rales par itération en théorie des types. In Proceedings of JFLA'2002. INRIA, 2002.
2. G. Barthe and P. Courtieu. Efficient Reasoning about Executable Specifications in Coq. In V. Carreño, C. Muñoz, and S. Tashar, editors, Theorem Proving in Higher Order Logics, TPHOLs'02, volume 2410 of LNCS, pages 31-46. Springer-Verlag, 2002.
3. Y. Bertot. Simple canonical representation of rational numbers. In H. Geuvers and F. Kamareddine, editors, Electronic Notes in Theoretical Computer Science, volume 85(7). Elsevier, 2003.
4. Y. Bertot and P. Castéran. Coq'Art. To be published by Springer-Verlag, 2004.
5. A. Bove and V. Capretta. Nested general recursion and partiality in type theory. In R. J. Boulton and P. B. Jackson, editors, Theorem Proving in Higher Order Logics, TPHOLs'01, volume 2152 of LNCS, pages 121-135. Springer-Verlag, 2001.
6. The Coq Development Team. The Coq Proof Assistant Reference Manual, Version 7.4. INRIA, http://coq.inria.fr/doc/main.html, Feb. 2003.
7. D. Delahaye and M. Mayero. Field: une procédure de décision pour les nombres réels en Coq. In Proceedings of JFLA'2001. INRIA, 2001.
8. R. W. Gosper. HAKMEM, Item 101 B. http://www.inwap.com/pdp10/hbaker/ hakmem/cf.html\#item101b, Feb. 1972. MIT AI Laboratory Memo No.239.
9. M. Konecny. Many-Valued Real Functions Computable by Finite Transducers using IFS-Representations. PhD thesis, The University of Birmingham, Oct. 2000.
10. P. Letouzey. A New Extraction for Coq. In H. Geuvers and F. Wiedijk, editors, Types for Proofs and Programs, TYPES 2002, volume 2646 of LNCS, pages 388-405. Springer-Verlag, 2003.
11. N. Magaud. Changing Data Representation within the Coq System. In D. Basin and B. Wolff, editors, Theorem Proving in Higher Order Logics, TPHOLs'03, volume 2758 of LNCS, pages 87-102. Springer-Verlag, 2003.
12. V. Ménissier-Morain. Arithmétique exacte, conception, algorithmique et performances d'une implémentation informatique en précision arbitraire. Thèse, Université Paris 7, Dec. 1994.
13. M. Niqui. Exact Arithmetic on Stern-Brocot Tree. Technical Report NIII-R0325, Nijmegen Institute for Computer and Information Sciences, Nov. 2003.
14. M. Niqui and Y. Bertot. http://coqcvs.inria.fr/cgi-bin/cvswebcoq.cgi/ contrib/Nijmegen/QArith/, May 2003. Coq contribution.
15. Ch. Paulin. Coq club mailing list correspondence, Aug. 2002.
16. ω's programs from proofs in the Calculus of Constructions. In Proceedings of POPL 1989, pages 89-104. ACM, Jan. 1989.
17. P. J. Potts. Exact Real Arithmetic using Möbius Transformations. PhD thesis, University of London, Imperial College, July 1998.
18. J. E. Vuillemin. Exact real computer arithmetic with continued fractions. IEEE Transactions on Computers, 39(8):1087-1105, Aug. 1990.