A purely functional library for modular arithmetic and its application to certifying large prime numbers

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

Volumn 4130 LNAI, Issue , 2006, Pages 423-437

  Grégoire, Benjamin ^a   Théry, Laurent ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS; THEOREM PROVING;

FUNCTIONAL LIBRARY; MODULAR ARITHMETIC; PRIME NUMBERS; PROOF ASSISTANT;

NUMBER THEORY;

EID: 33749545230     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_36     Document Type: Conference Paper

References (19)

1. GNU Multiple Precision Arithmetic Library, http://www.swox.com/gmp/.
2. Henk Barendregt and Erik Barendsen. Autarkic computations in formal proofs. J. Autom. Reasoning, 28(3):321-336, 2002.
3. Yves Bertot, Nicolas Magaud, and Paul Zimmermann. A proof of GMP square root. Journal of Automated Reasoning, 29(3-4):225-252, 2002.
4. Samuel Boutin. Using Reflection to Build Efficient and Certified Decision Procedures. In TACS'97, volume 1281 of LNCS, pages 515-529, Sendai, Japan, 1997.
5. m ±1. Mathematics of Computation, 29:620-647, 1975.
6. Christoph Burnikel and Joachim Ziegler. Fast recursive division. Technical Report MPI-I-98-1-022, Max-Planck-Institut, 1998.
7. Olga Caprotti and Martijn Oostdijk. Formal and efficient primality proofs by use of computer algebra oracles. Journal of Symbolic Computation, 32(1/2):55-70, 2001.
8. Richard Crandall and Barry Fagin. Discrete weighted transforms and large-integer arithmetic. 62(205):305-324, 1994.
9. Georges Gonthier. A computer-checked proof of the Four Colour Theorem. Technical report. Available at http://research.microsoft.com/~gonthier/ 4colproof.pdf.
10. Benjamin Grégoire and Xavier Leroy. A compiled implementation of strong reduction. In International Conference on Functional Programming 2002, pages 235-246. ACM Press, 2002.
11. Benjamin Grégoire and Assia Mahboubi. Proving ring equalities done right in Coq. In TPHOLS'05, volume 3603 of LNCS, pages 98-113.
12. Benjamin Grégoire, Laurent Théry, and Benjamin Werner. A computational approach to Pocklington certificates in type theory. In FLOPS'06, volume 3945 of LNCS, pages 97-113.
13. John Harrison and Laurent Théry. A skeptic's approach to combining HOL and Maple. J. Autom. Reasoning, 21(3):279-294, 1998.
14. Anatolii A. Karatsuba and Yu Ofman. Multiplication of Many-Digital Numbers by Automatic Computers. Soviet Physics-Doklad, 7:595-596, 1963.
15. Xavier Leroy. Objective Caml. Available at http://pauillac.inria.fr/ ocaml/, 1997.
16. Valérie Ménissier-Morain. The CAML Numbers Reference Manual. Technical Report 141, INRIA, 1992.
17. Tobias Nipkow, Gertrud Bauer, and Paula Schultz. Flyspeck I: Tame Graphs. Technical report. Available at http://www.in.tum.de/~nipkow/pubs/Flyspeck/.
18. The Coq development team. The Coq Proof Assistant Reference Manual v7.2. Technical Report 255, INRIA, 2002. Available at http://coq.inria.fr/doc.
19. Paul Zimmermann. Karatsuba square root. Research Report 3805, INRIA, 1999.