{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:42:51Z","timestamp":1743014571670,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230298"},{"type":"electronic","value":"9783540278184"}],"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_24","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T14:26:47Z","timestamp":1267108007000},"page":"332-346","source":"Crossref","is-referenced-by-count":3,"title":["Mathematical Libraries as Proof Assistant Environments"],"prefix":"10.1007","author":[{"given":"Claudio Sacerdoti","family":"Coen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1022907629104","volume":"38","author":"A. Asperti","year":"2003","unstructured":"Asperti, A., Guidi, F., Padovani, L., Sacerdoti Coen, C., Schena, I.: Mathematical Knowledge Management in HELM. Annals of Mathematics and Artificial Intelligence\u00a038(1), 27\u201346 (2003)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"24_CR2","unstructured":"Buchberger, B.: Computer-Supported Mathematical Theory Exploration: Schemes, Failing Proof Analysis, and Metaprogramming. Technical report, RISC, Austria (September 2004)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Colton, S.: Automated Theory Formation in Pure Mathematics Series: Distinguished Dissertations, vol.\u00a0XVI, p. 380 (2002), ISBN: 1-85233-609-9","DOI":"10.1007\/978-1-4471-0147-5"},{"key":"24_CR4","first-page":"227","volume-title":"Proc. Symposium on Logic in Computer Science","author":"T. Coquand","year":"1986","unstructured":"Coquand, T.: An Analysis of Girard\u2019s Paradox. In: Proc. Symposium on Logic in Computer Science, Cambridge, Massachusetts, pp. 227\u2013236. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"24_CR5","unstructured":"Coquand, T., Huet, G.: The Calculus of Constructions. Technical report 530, INRIA (May 1986)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-45685-6_9","volume-title":"Theorem Proving in Higher Order Logics","author":"J. Courant","year":"2002","unstructured":"Courant, J.: Explicit universes for the calculus of constructions. In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol.\u00a02410, pp. 115\u2013130. Springer, Heidelberg (2002)"},{"key":"24_CR7","unstructured":"Luo, Z.: An Extended Calculus of Constructions. PhD thesis, University of Edinburgh (1990)"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(90)90108-T","volume":"89","author":"R. Harper","year":"1991","unstructured":"Harper, R., Pollack, R.: Type checking with universes. Theoretical Computer Science\u00a089, 107\u2013136 (1991)","journal-title":"Theoretical Computer Science"},{"key":"24_CR9","unstructured":"Sacerdoti Coen, C.: Mathematical Knowledge Management and Interactive Theorem Proving. PhD thesis, University of Bologna (2004)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-36469-2_3","volume-title":"Mathematical Knowledge Management","author":"C. Sacerdoti Coen","year":"2003","unstructured":"Sacerdoti Coen, C.: From Proof-Assistants to Distributed Libraries of Mathematics: Tips and Pitfalls. In: Asperti, A., Buchberger, B., Davenport, J.H. (eds.) MKM 2003. LNCS, vol.\u00a02594, pp. 30\u201344. Springer, Heidelberg (2003)"},{"key":"24_CR11","unstructured":"Werner, B.: Une Theorie des Constructions Inductives. PhD thesis, Universit\u00e9 Paris VII (1994)"}],"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_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T09:50:17Z","timestamp":1552384217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27818-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230298","9783540278184"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27818-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}