A constructive algebraic hierarchy in Coq

Journal of Symbolic Computation

Volumn 34, Issue 4, 2002, Pages 271-286

  Geuvers, Herman ^a   Pollack, Randy ^a   Wiedijk, Freek ^a   Zwanenburg, Jan ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036800445     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2002.0552     Document Type: Article

References (25)

1. Bailey, A. (1999). The machine-checked literate formalisation of algebra in type theory. Ph.D. Thesis, Manchester University.
2. Barras et al., B. (2000). The Coq Proof Assistant Reference Manual, URL: ftp://ftp.inria.fr/INRIA/coq/V6.3.1/doc/Reference-Manual-all.ps.gz.
3. Barthe, G. (1996). Implicit coercions in type systems. In Berardi, S., Coppo, M. eds, Types for Proofs and Programs: International Workshop TYPES '95, (Torino, Italy: selected papers), LNCS 1185, pp. 1-15. Berlin, Springer.
4. Bishop, E. (1967). Foundations of Constructive Analysis. McGraw-Hill.
5. Boulmé, S. (2000). Opérateurs de raffinement sur les structures algébriques. In Actes des Journées Francophones des Langages Applicatifs.
6. Boulmé, S., Hardin, T., Hirschkoff, D., Ménissier-Morain, V., Rioboo, R. (1999). On the way to certify computer algebra systems. In Proceedings of the Calculemus Workshop of FLOC'99 (Federated Logic Conference, Trento, Italy), ENTCS 23, Elsevier.
7. Boyer, R. (1994). The QED manifesto. In Bundy, A. ed., Automated Deduction-CADE 12, LNAI 814, pp. 238-251. Springer.
8. Delahaye, D., Mayero, M. (2001). Field: une procédure de décision pour les nombres réels en Coq. In Proceedings of JFLA'2001, INRIA, URL: http://pauillac.inria.fr/jfla/2001/actes/04-delahaye.ps.
9. The FTA project (2002). http://www.cs.kun.nl/˜freek/fta/.
10. Geuvers, H., Wiedijk, F., Zwanenburg, J., Barendregt, H., Niqui, M., Pollack, R. (forthcoming). Formalizing the fundamental theorem of algebra.
11. Geuvers, H., Niqui, M. (2002). Constructive reals in Coq: Axioms and categoricity. In Proceedings of the Workshop Types 2000, Durham UK. Springer.
12. Geuvers, H., Wiedijk, F., Zwanenburg, J. (2000). Equational reasoning via partial reflection. In Aagaard, M., Harrison, J. eds, Theorem Proving in Higher Order Logics, TPHOLs 2000, (Portland), LNCS 1869, pp. 162-178. Berlin, Springer.
13. Geuvers, H., Wiedijk, F., Zwanenburg, J. (2002). A constructive proof of the fundamental theorem of algebra without using the rationals. In Proceedings of the Workshop Types 2000, Durham UK. Springer.
14. Harrison, J. (2001). Complex quantifier elimination in HOL. In Boulton, R., Jackson, P. eds, TPHOLs 2001, Supplemental Proceedings. Informatics Research Report, pp. 159-174. Division of Informatics, University of Edinburgh.
15. Jackson, P. (1995). Enhancing the Nuprl proof-development system and applying it to computational abstract algebra. Ph.D. Thesis, Cornell University.
16. Jenks, R., Sutor, R. (1992). AXIOM: The Scientific Computation System. Berlin, Springer.
17. Kneser, M. (1981). Ergänzung zu einer Arbeit von Hellmuth Kneser über den Fundamentalsatz der Algebra. Math. Z., 177, 285-287.
18. Luo, Z. (1999). Coercive subtyping. J. Logic Comput., 9, 105-130.
19. Milewski, R. (2000). Fundamental theorem of algebra. J. Formalized Math., 12, MML Identifier: POLYNOM5.
20. Muzalewski, M. (1993). An Outline of PC Mizar. Brussels, Fond. Philippe le Hodey.
21. Owre, S., Rushby, J., Shankar, N. (1992). PVS: a prototype verification system. In Kapur, D. ed., 11th International Conference on Automated Deduction (CADE), LNAI 607, pp. 748-752. Berlin, Springer.
22. Pollack, R. (2000). Dependently typed records for representing mathematical structure. In Aagaard, M., Harrison, J. eds, Theorem Proving in Higher Order Logics, TPHOLs 2000, (Portland), LNCS 1869, pp. 462-479. Berlin, Springer.
23. Pottier, L. (2001). Un début de formalisation de l'algèbre en Coq et Ctcoq. Web page, URL: http: //www-sop.inria.fr/croap/CFC/Ctcoqmath.html.
24. Saïbi, A. (1997). Typing algorithm in type theory with inheritance. In Proceedings of the 24th Symposium on Principles of Programming Languages (POPL'97), pp. 292-301.
25. Wiedijk, F. (1999). Mizar: an impression, unpublished, URL: http://www.cs.kun.nl/˜freek/mizar/mizarintro.ps.gz.