Connecting Gröbner bases programs with Coq to do proofs in algebra, geometry and arithmetics

by Loïc Pottier , Inria Sophia Antipolis
Citations:3 - 0 self

Documents Related by Co-Citation

466 Interactive Theorem Proving and Program Development, Coq’Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series – Yves Bertot, Pierre Castéran - 2004
13 A mechanically verified, sound and complete theorem prover for first order logic – Tom Ridge, James Margetson - 2005
13 Groebner Bases: Applications – B Buchberger - 2002
8 Complex quantifier elimination in HOL – John Harrison - 2001
13 Über die Vollständigkeit des Logikkalküls – K Gödel - 1929
3 Formal proof, computation, and the construction problem in algebraic geometry – Carlos Simpson, Alain Connes, Andy Magid, Ehud Hrushowski For Their
4 quantifier elimination – Linear - 2008
1 Schémas normaux; morphismes; ensembles constructibles – Claude Chevalley, Henri Cartan - 1955
1 François Garillot and Assia Mahboubi and Laurence Rideau. Packaging mathematical structures – Georges Gonthier - 2009
43 Definability and decision problems in arithmetic – Julia Robinson - 1949
7 Ould Biha, and Ioana Pasca. Canonical big operators – Yves Bertot, Georges Gonthier, Sidi - 2008
7 Sets in Coq, Coq in sets – Bruno Barras
4 Krivine’s intuitionistic proof of classical completeness (for countable languages – S Berardi, S Valentini - 2004
11 A Constructive Algebraic Hierarchy in Coq – Herman Geuvers, Y Pollack, Freek Wiedijk
8 Incompleteness & Completeness: Formalizing Logic and Analysis in Type Theory – Russell S S O’Connor - 2009
537 Model Theory – Wilfrid Hodges - 2000
562 A Decision Method for Elementary Algebra and Geometry – A Tarski - 1951
1 Dependent Types, Theorem Proving, and Applications for a Verifying Compiler – Yves Bertot, Laurent Théry - 2005
1 Proofs for freshmen with Coqweb – J BLANC, J GIACOMETTI, A HIRSCHOWITZ, L POTTIER