{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:23:57Z","timestamp":1769315037300,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141270","type":"print"},{"value":"9783642141287","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14128-7_13","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T10:45:36Z","timestamp":1277808336000},"page":"147-156","source":"Crossref","is-referenced-by-count":8,"title":["Some Considerations on the Usability of Interactive Provers"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Asperti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Sacerdoti Coen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"13_CR1","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1017\/S0960129509990041","volume":"19","author":"A. Asperti","year":"2009","unstructured":"Asperti, A., Geuvers, H., Natarajan, R.: Social processes, program verification and all that. Mathematical Structures in Computer Science\u00a019(5), 877\u2013896 (2009)","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-02444-3_2","volume-title":"Types for Proofs and Programs","author":"A. Asperti","year":"2009","unstructured":"Asperti, A., Ricciotti, W.: About the formalization of some results by Chebyshev in number theory. In: Berardi, S., Damiani, F., de\u2019Liguoro, U. (eds.) TYPES 2008. LNCS, vol.\u00a05497, pp. 19\u201331. Springer, Heidelberg (2009)"},{"key":"13_CR3","series-title":"LNAI","first-page":"263","volume-title":"AISC\/Calculemus\/MKM 2010","author":"A. Asperti","year":"2010","unstructured":"Asperti, A., Tassi, E.: Smart matching. In: Autexier, S., et al. (eds.) AISC\/Calculemus\/MKM 2010. LNCS (LNAI), vol.\u00a06167, pp. 263\u2013277. Springer, Heidelberg (2010)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Avigad, J., Donnelly, K., Gray, D., Raff, P.: A formally verified proof of the prime number theorem. ACM Trans. Comput. Log.\u00a09(1) (2007)","DOI":"10.1145\/1297658.1297660"},{"key":"13_CR5","volume-title":"Implementing Mathematics with the Nuprl Development System","author":"R.L. Constable","year":"1986","unstructured":"Constable, R.L., Allen, S.F., Bromley, H.M., Cleaveland, W.R., Cremer, J.F., Harper, R.W., Howe, D.J., Knoblock, T.B., Mendler, N.P., Panangaden, P., Sasaki, J.T., Smith, S.F.: Implementing Mathematics with the Nuprl Development System. Prentice-Hall, Englewood Cliffs (1986)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2007.01.004","volume":"177","author":"S. Escobar","year":"2007","unstructured":"Escobar, S., Meseguer, J., Thati, P.: Narrowing and rewriting logic: from foundations to applications. Electr. Notes Theor. Comput. Sci.\u00a0177, 5\u201333 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12046-009-0001-5","volume":"34","author":"H. Geuvers","year":"2009","unstructured":"Geuvers, H.: Proof Assistants: history, ideas and future. Sadhana\u00a034(1), 3\u201325 (2009)","journal-title":"Sadhana"},{"key":"13_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-87827-8_28","volume-title":"Computer Mathematics","author":"G. Gonthier","year":"2008","unstructured":"Gonthier, G.: The four colour theorem: Engineering of a formal proof. In: Kapur, D. (ed.) ASCM 2007. LNCS (LNAI), vol.\u00a05081, p. 333. Springer, Heidelberg (2008)"},{"key":"13_CR9","first-page":"1382","volume":"55","author":"G. Gonthier","year":"2008","unstructured":"Gonthier, G.: Formal proof \u2013 the four color theorem. Notices of the American Mathematical Society\u00a055, 1382\u20131394 (2008)","journal-title":"Notices of the American Mathematical Society"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.7551\/mitpress\/5641.003.0012","volume-title":"Proof, Language, and Interaction: Essays in Honour of Robin Milner","author":"M. Gordon","year":"2000","unstructured":"Gordon, M.: From lcf to hol: a short history. In: Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 169\u2013186. MIT Press, Cambridge (2000)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71067-7_1","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Gordon","year":"2008","unstructured":"Gordon, M.: Twenty years of theorem proving for hols past, present and future. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol.\u00a05170, pp. 1\u20135. Springer, Heidelberg (2008)"},{"key":"13_CR12","first-page":"1370","volume":"55","author":"T. Hales","year":"2008","unstructured":"Hales, T.: Formal proof. Notices of the American Mathematical Society\u00a055, 1370\u20131381 (2008)","journal-title":"Notices of the American Mathematical Society"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1080\/00029890.2007.11920481","volume":"114","author":"T.C. Hales","year":"2007","unstructured":"Hales, T.C.: The Jordan curve theorem, formally and informally. The American Mathematical Monthly\u00a0114, 882\u2013894 (2007)","journal-title":"The American Mathematical Monthly"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-73433-8_24","volume-title":"Algebraic Biology","author":"J. Harrison","year":"2007","unstructured":"Harrison, J.: A Short Survey of Automated Reasoning. In: Anai, H., Horimoto, K., Kutsia, T. (eds.) Ab 2007. LNCS, vol.\u00a04545, pp. 334\u2013349. Springer, Heidelberg (2007)"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10817-009-9145-6","volume":"43","author":"J. Harrison","year":"2009","unstructured":"Harrison, J.: Formalizing an analytic proof of the prime number theorem. J. Autom. Reasoning\u00a043(3), 243\u2013261 (2009)","journal-title":"J. Autom. Reasoning"},{"key":"13_CR16","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Selected Papers on Automath","year":"1994","unstructured":"Nederpelt, R.P., Geuvers, J.H., de Vrijer, R.C. (eds.): Selected Papers on Automath. Studies in Logic and the Foundations of Mathematics, vol.\u00a0133. Elsevier Science, Amsterdam (1994) ISBN-0444898220"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. J. ACM\u00a027(2), 356\u2013364 (1980)","journal-title":"J. ACM"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Rubio, A.: Paramodulation-based thorem proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 471\u2013443. Elsevier and MIT Press (2001); ISBN-0-262-18223-8","DOI":"10.1016\/B978-044450813-3\/50009-6"},{"key":"13_CR19","first-page":"51","volume":"1","author":"C.S. Coen","year":"2008","unstructured":"Coen, C.S., Tassi, E.: A constructive and formal proof of Lebesgue\u2019s dominated convergence theorem in the interactive theorem prover Matita. Journal of Formalized Reasoning\u00a01, 51\u201389 (2008)","journal-title":"Journal of Formalized Reasoning"},{"key":"13_CR20","unstructured":"van Benthem Jutting, J.: Checking Landau\u2019s \u201cGrundlagen\u201d in the Automath system. Mathematical centre tracts n. 83. Mathematisch Centrum, Amsterdam (1979)"},{"key":"13_CR21","unstructured":"Wiedijk, F.: The \u201cDe Bruijn factor\u201d (2000), http:\/\/www.cs.ru.nl\/~freek\/factor\/"},{"key":"13_CR22","unstructured":"Wiedijk, F.: Estimating the cost of a standard library for a mathematical proof checker (2001), http:\/\/www.cs.ru.nl\/~freek\/notes\/mathstdlib2.pdf"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1023\/A:1021983302516","volume":"29","author":"F. Wiedijk","year":"2002","unstructured":"Wiedijk, F.: A new implementation of Automath. Journal of Automated Reasoning\u00a029, 365\u2013387 (2002)","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14128-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T21:21:08Z","timestamp":1711574468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14128-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141270","9783642141287"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14128-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}