Proving equalities in a commutative ring done right in Coq

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 98-113

  Grégoire, Benjamin ^a   Mahboubi, Assia ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

COQ SYSTEMS; SEMI-RING; SETOID EQUALITY; SYMBOLIC COMPUTATION;

THEOREM PROVING;

EID: 26844557830     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_7     Document Type: Conference Paper

References (12)

1. th Symposium on Logic in Computer Science, pages 95-197, Philadelphia, Pennsylvania, June 1990. IEEE, IEEE Computer Society Press.
2. Y. Bertot and P.Casteran. Interactive Theorem Proving and Program Development. Cog'Art: the Calculus of Inductive Constructions. Texts in Theoretical Computer Science. 2004.
3. S. Boutin. Using reflection to build efficient and certified decision procedures. In TACS, pages 515-529, 1997.
4. G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition, volume 33 of Lecture Notes In Computer Science, pages 134-183. Springer-Verlag, Berlin, 1975.
5. D. Delahaye. A Tactic Language for the System Coq. In LPAR, Reunion Island, volume 1955, pages 85-95. Springer-Verlag LNCS/LNAI, November 2000, http://cedric.cnam.fr/delahaye/publications/LPAR2000-Itac.ps.gz.
6. D. Delahaye and M. Mayero. Field: une procédure de décision pour les nombres réels en Coq. In Journees Francophones des Langages Applicatifs, Pontarlier. INRIA, Janvier 2001. http://cedric.cnam.fr/delahaye/ publications/JFLA2000-Field.ps.gz.
7. V. C. G. Barthe and O. Pons. Setoids in type theory. Journal of Functional Programming, 13(2):261-293, March 2003.
8. B. Grégoire and X. Leroy. A compiled implementation of strong reduction. In International Conference on Functional Programming 2002, pages 235-246. ACM Press, 2002.
9. J. Harrison and L. Théry. A skeptic's approach to combining HOL and Maple. Journal of Automated Reasoning, 21:279-294, 1998.
10. M. Hofmann. A simple model for quotient types. In TLCA '95, pages 216-234, April 1995.
11. J. Narboux. A decision procedure for geometry in coq. In TPHOLs, pages 225-240, 2004.
12. The Coq development team. The coq proof assistant reference manual v7.2. Technical Report 255, INRIA, France, mars 2002. http://coq.inria.fr/doc8/main. html.