论文信息 - A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers

A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers

Computing efficiently with numbers can be crucial for some theorem proving applications. In this paper, we present a library of modular arithmetic that has been developed within the Coq proof assistant. The library proposes the usual operations that have all been proved correct. The library is purely functional but can also be used on top of some native modular arithmetic. With this library, we have been capable of certifying the primality of numbers with more than 13000 digits.

Benjamin Grégoire | Laurent Théry | B. Grégoire | L. Théry

[1] Olga Caprotti,et al. Formal and Efficient Primality Proofs by Use of Computer Algebra Oracles , 2001, J. Symb. Comput..

[2] John Harrison,et al. A Skeptic's Approach to Combining HOL and Maple , 1998, Journal of Automated Reasoning.

[3] B. Fagin,et al. Discrete weighted transforms and large-integer arithmetic , 1994 .

[4] Hendrik Pieter Barendregt,et al. Autarkic Computations in Formal Proofs , 2002, Journal of Automated Reasoning.

[5] Samuel Boutin,et al. Using Reflection to Build Efficient and Certified Decision Procedures , 1997, TACS.

[6] Benjamin Grégoire,et al. A compiled implementation of strong reduction , 2002, ICFP '02.

[7] V. Menissier-Morain. The CAML numbers reference manual , 1992 .

[8] Benjamin Grégoire,et al. Proving Equalities in a Commutative Ring Done Right in Coq , 2005, TPHOLs.

[9] D. H. Lehmer,et al. New primality criteria and factorizations of 2^{}±1 , 1975 .

[10] Paul Zimmermann. Karatsuba Square Root , 1999 .

[11] Georges Gonthier. A computer-checked proof of the Four Colour Theorem , 2005 .

[12] Joachim Ziegler,et al. Fast recursive division , 1998 .

[13] Nicolas Magaud,et al. A Proof of GMP Square Root , 2004, Journal of Automated Reasoning.

[14] Benjamin Grégoire,et al. A Computational Approach to Pocklington Certificates in Type Theory , 2006, FLOPS.