A computational approach to pocklington certificates in type theory (2006)


Download Links

by Benjamin Grégoire , Laurent Théry , Benjamin Werner
Venue:In Proc. of the 8th Int. Symp. on Functional and Logic Programming, volume 3945 of LNCS
Citations:14 - 4 self

Documents Related by Co-Citation

69 A Compiled Implementation of Strong Reduction – Benjamin Grégoire, Inria Rocquencourt, Xavier Leroy
10 A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers – Benjamin Grégoire, Laurent Théry - 2006
475 Interactive Theorem Proving and Program Development. Coq’Art: The Calculus of Inductive Constructions – Yves Bertot, Pierre Castéran - 2004
754 publications by the team in recent years – Major
45 Using Reflection to Build Efficient and Certified Decision Procedures – Samuel Boutin - 1997
700 Factoring polynomials with rational coefficients – A. K. Lenstra, H. W. Lenstra - 1982
2 Grégoire and Assia Mahboubi. Proving ring equalities done right in Coq – Benjamin
4 The CAML Numbers Reference Manual – Valérie Ménissier-Morain - 1992
26 Proving Equalities in a Commutative Ring Done Right in Coq – Benjamin Gregoire, Assia Mahboubi - 2005
15 Programmation fonctionnelle certifiée: L’extraction de programmes dans l’assistant Coq – Pierre Letouzey - 2004
49 A new extraction for Coq – P Letouzey - 2003
7 Formal Global Optimisation with Taylor Models,” in IJCAR, ser – R Zumkeller - 2006
6 Primality Proving with Elliptic Curves – Laurent Théry, Guillaume Hanrot, Thème Sym, Laurent Théry, Guillaume Hanrot
22 C’est maintenant qu’on calcule: au cœur de la dualité. Mémoire de habilitation, Université Paris 11, Décembre 2005 – H Herbelin
29 The implicit calculus of constructions as a programming language with dependent types – Bruno Barras, Bruno Bernardo
63 A computer-checked proof of the four-colour theorem. Available at http://research.microsoft.com/~gonthier/4colproof.pdf – Georges Gonthier - 2011
7 Searching worst cases of a one-variable function – Damien Stehlé, Vincent Lefèvre, Paul Zimmermann
5 Algorithmique de la réduction des réseaux et application à la recherche de pires cas pour l’arrondi des fonctions mathématiques – D Stehlé - 2005
33 Worst Cases for Correct Rounding of the Elementary Functions in Double Precision – Jean-michel Muller, Vincent Lefevre Jean-Michel, Vincent Lefèvre, Jean-michel Muller Ý, Thème Génie Logiciel, Projet Arénaire