{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:39:43Z","timestamp":1767926383031,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540230298","type":"print"},{"value":"9783540278184","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27818-4_7","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T14:26:47Z","timestamp":1267108007000},"page":"88-103","source":"Crossref","is-referenced-by-count":39,"title":["C-CoRN, the Constructive Coq Repository at Nijmegen"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Cruz-Filipe","sequence":"first","affiliation":[]},{"given":"Herman","family":"Geuvers","sequence":"additional","affiliation":[]},{"given":"Freek","family":"Wiedijk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Knowledge Management","year":"2003","unstructured":"Asperti, A., Buchberger, B., Davenport, J.H. (eds.): MKM 2003. LNCS, vol.\u00a02594. Springer, Heidelberg (2003)"},{"key":"7_CR2","unstructured":"Asperti, A., Wegner, B.: MOWGLI \u2013 A New Approach for the Content Description in Digital Documents. In: Proc. of the 9th Intl. Conference on Electronic Resources and the Social Role of Libraries in the Future, vol.\u00a01, Autonomous Republic of Crimea, Ukraine (2002)"},{"key":"7_CR3","unstructured":"Bailey, A.: The machine-checked literate formalisation of algebra in type theory, PhD thesis. University of Manchester (1998)"},{"key":"7_CR4","volume-title":"Foundations of Constructive Analysis","author":"E. Bishop","year":"1967","unstructured":"Bishop, E.: Foundations of Constructive Analysis. McGraw-Hill, New York (1967)"},{"key":"7_CR5","volume-title":"Proceedings of ISSAC 1997","author":"B. Buchberger","year":"1997","unstructured":"Buchberger, B., et al.: An Overview on the Theorema project. In: Kuechlin, W. (ed.) Proceedings of ISSAC 1997, Maui, Hawaii. ACM Press, New York (1997)"},{"key":"7_CR6","unstructured":"Constructive Coq Repository at Nijmegen, http:\/\/c-corn.cs.kun.nl\/"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cairns, P., Gow, J.: A theoretical analysis of hierarchical proofs, In: Asperti, et\u00a0al., [1], pp.\u00a0175\u2013187","DOI":"10.1007\/3-540-36469-2_14"},{"key":"7_CR8","unstructured":"The CALCULEMUS Initiative, http:\/\/www.calculemus.net\/"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Types for Proofs and Programs","year":"2002","unstructured":"Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.): TYPES 2000. LNCS, vol.\u00a02277. Springer, Heidelberg (2002)"},{"key":"7_CR10","unstructured":"Caprotti, O., Carlisle, D.P., Cohen, A.M.: The OpenMath Standard, version 1.1 (2002), http:\/\/www.openmath.org\/cocoon\/openmath\/standard\/"},{"key":"7_CR11","volume-title":"Algebra Interactive!","author":"A. Cohen","year":"1999","unstructured":"Cohen, A., Cuypers, H., Sterk, H.: Algebra Interactive! Springer, Heidelberg (1999)"},{"key":"7_CR12","volume-title":"Implementing Mathematics with the Nuprl Development System","author":"R.L. Constable","year":"1986","unstructured":"Constable, R.L., et al.: Implementing Mathematics with the Nuprl Development System. Prentice-Hall, NJ (1986)"},{"key":"7_CR13","unstructured":"The Coq Development Team, The Coq Proof Assistant Reference Manual, Version 7.2 (January 2002), http:\/\/pauillac.inria.fr\/coq\/doc\/main.html"},{"key":"7_CR14","unstructured":"Cruz-Filipe, L.: Formalizing real calculus in Coq, Technical report, NASA, Hampton, VA (2002)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Cruz-Filipe, L.: A constructive formalization of the Fundamental Theorem of Calculus. In: Geuvers, Wiedijk [20], pp. 108\u2013126","DOI":"10.1007\/3-540-39185-1_7"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/10930755_14","volume-title":"Theorem Proving in Higher Order Logics","author":"L. Cruz-Filipe","year":"2003","unstructured":"Cruz-Filipe, L., Spitters, B.: Program extraction from large proof developments. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, pp. 205\u2013220. Springer, Heidelberg (2003)"},{"key":"7_CR17","unstructured":"Filli\u00e2tre, J.-C.: CoqDoc: a Documentation Tool for Coq, Version 1.05, The Coq Development Team (September 2003), http:\/\/www.lri.fr\/~filliatr\/coqdoc\/"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Geuvers, H., Niqui, M.: Constructive reals in Coq: Axioms and categoricity. In: [9], pp.\u00a079\u201395","DOI":"10.1007\/3-540-45842-5_6"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Geuvers, H., Pollack, R., Wiedijk, F., Zwanenburg, J.: The algebraic hierarchy of the FTA Project. Journal of Symbolic Computation, pp.\u00a0271\u2013286 (2002)","DOI":"10.1006\/jsco.2002.0552"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Types for Proofs and Programs","year":"2003","unstructured":"Geuvers, H., Wiedijk, F. (eds.): Types for Proofs and Programs. LNCS, vol.\u00a02464. Springer, Heidelberg (2003)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44659-1_11","volume-title":"Theorem Proving in Higher Order Logics","author":"H. Geuvers","year":"2000","unstructured":"Geuvers, H., Wiedijk, F., Zwanenburg, J.: Equational reasoning via partial reflection. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol.\u00a01869, pp. 162\u2013178. Springer, Heidelberg (2000)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Geuvers, H., Wiedijk, F., Zwanenburg, J.: A constructive proof of the Fundamental Theorem of Algebra without using the rationals. In: [9], pp.\u00a096\u2013111","DOI":"10.1007\/3-540-45842-5_7"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Guidi, F., Schena, I.: A query language for a metadata framework about mathematical resources. In: Asperti, et\u00a0al., [1], pp.\u00a0105\u2013118","DOI":"10.1007\/3-540-36469-2_9"},{"key":"7_CR24","unstructured":"Harrison, J.: The HOL Light manual (1.1) (2000), http:\/\/www.cl.cam.ac.uk\/users\/jrh\/hol-light\/manual-1.1.ps.gz"},{"key":"7_CR25","series-title":"LNAI","volume-title":"Proceedings of Artificial Intelligence and Symbolic Computation","author":"M. Kohlhase","year":"2000","unstructured":"Kohlhase, M.: OMDoc: Towards an Internet Standard for the Administration, Distribution and Teaching of Mathematical Knowledge. In: Proceedings of Artificial Intelligence and Symbolic Computation. LNCS (LNAI). Springer, Heidelberg (2000)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Letouzey, P.: A new extraction for Coq. In: Geuvers, Wiedijk [20], pp.\u00a0200\u2013219","DOI":"10.1007\/3-540-39185-1_12"},{"key":"7_CR27","unstructured":"Mayero, M.: Formalisation et automatisation de preuves en analyses r\u00e9elle et num\u00e9rique, PhD thesis, Universit\u00e9 Paris VI (December 2001)"},{"key":"7_CR28","unstructured":"Muzalewski, M.: An Outline of PC Mizar, Fond. Philippe le Hodey, Brussels (1993), http:\/\/www.cs.kun.nl\/~freek\/mizar\/mizarmanual.ps.gz"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-44755-5_23","volume-title":"Theorem Proving in Higher Order Logics","author":"P. Naumov","year":"2001","unstructured":"Naumov, P., Stehr, M.-O., Meseguer, J.: The HOL\/NuPRL Proof Translator: A Practical Approach to Formal Interoperability. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol.\u00a02152, pp. 329\u2013345. Springer, Heidelberg (2001)"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"7_CR31","unstructured":"Shankar, N., Owre, S., Rushby, J.M., Stringer-Calvert, D.W.J.: The PVS System Guide, SRI International (December 2001), http:\/\/pvs.csl.sri.com\/"},{"key":"7_CR32","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-45620-1_12","volume-title":"Automated Deduction - CADE-18","author":"J. Siekmann","year":"2002","unstructured":"Siekmann, J.: Proof Development with Omega. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, p. 144. Springer, Heidelberg (2002)"},{"key":"7_CR33","unstructured":"Slind, K.: HOL98 Draft User\u2019s Manual, Cambridge UCL (January 1999), http:\/\/hol.sourceforge.net\/"}],"container-title":["Lecture Notes in Computer Science","Mathematical Knowledge Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27818-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T07:49:59Z","timestamp":1558856999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27818-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230298","9783540278184"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27818-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}