{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:35Z","timestamp":1761611195024},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676645"},{"type":"electronic","value":"9783540451013"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721959_7","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T21:12:31Z","timestamp":1167426751000},"page":"99-114","source":"Crossref","is-referenced-by-count":9,"title":["Modular Reasoning in Isabelle"],"prefix":"10.1007","author":[{"given":"Florian","family":"Kamm\u00fcller","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Bailey, A.: The Machine-Checked Literate Formalisation of Algebra in Type Theory. PhD thesis. University of Manchester (1998)"},{"key":"7_CR2","unstructured":"Dowek, G. et al.: The Coq proof assistant user\u2019s guide. Technical Report 154, INRIA-Rocquencourt (1993)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"de Bruijn, N.G.: A Survey of the Project AUTOMATH. In: Seldin and Hindley [SH80], pp. 579\u2013606","DOI":"10.1016\/S0049-237X(08)70203-9"},{"key":"7_CR4","unstructured":"Dowek,G.: Naming and Scoping in a Mathematical Vernacular. Technical Report 1283, INRIA, Rocquencourt (1990)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF00881906","volume":"11","author":"W.M. Farmer","year":"1993","unstructured":"Farmer, W.M., Guttman, J.D., Thayer, F.J.: IMPS: an Interactive Mathematical Proof System. Journal of Automated Reasoning\u00a011, 213\u2013248 (1993)","journal-title":"Journal of Automated Reasoning"},{"volume-title":"Introduction to HOL, a Theorem Proving Environment for Higher Order Logic","year":"1993","key":"7_CR6","unstructured":"Gordon, M.J.C., Melham, T.F. (eds.): Introduction to HOL, a Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge (1993)"},{"key":"7_CR7","unstructured":"Gunter, E. L.: Doing Algebra in Simple Type Theory. Technical Report MS-CIS-89-38, Dep. of Computer and Information Science. University of Pennsylvania (1989)"},{"key":"7_CR8","unstructured":"Gunter, E.L.: The Implementation and Use of Abstract Theories in HOL. In: Third HOL Users Meeting. Aarhus University (1990)"},{"key":"7_CR9","unstructured":"Howard, W.A.: The formulae-as-types notion of construction. In: Seldin and Hindley [SH80], pp. 479\u2013490"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Typed Lambda Calculi and Applications","author":"B. Jacobs","year":"1993","unstructured":"Jacobs, B., Melham, T.F.: Translating Dependent Type Theory into Higher Order Logic. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664. Springer, Heidelberg (1993)"},{"key":"7_CR11","unstructured":"Kamm\u00fcller, F.: Modular Reasoning in Isabelle. PhD thesis. University of Cambridge, Technical Report 470 (1999)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-48167-2_9","volume-title":"Types for Proofs and Programs","author":"F. Kamm\u00fcller","year":"1999","unstructured":"Kamm\u00fcller, F.: Modular Structures as Dependent Types in Isabelle. In: Altenkirch, T., Naraschewski, W., Reus, B. (eds.) TYPES 1998. LNCS, vol.\u00a01657, p. 121. Springer, Heidelberg (1999)"},{"issue":"3-4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1006269330992","volume":"23","author":"F. Kamm\u00fcller","year":"1999","unstructured":"Kamm\u00fcller, F., Paulson, L.C.: A Formal Proof of Sylow\u2019s First Theorem \u2013 An Experiment in Abstract Algebra with Isabelle HOL. Journal of Automated Reasoning\u00a023(3-4), 235\u2013264 (1999)","journal-title":"Journal of Automated Reasoning"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-48256-3_11","volume-title":"Theorem Proving in Higher Order Logics","author":"F. Kamm\u00fcller","year":"1999","unstructured":"Kamm\u00fcller, F., Wenzel, M., Paulson, L.C.: Locales \u2013 a Sectioning Concept for Isabelle. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Th\u00e9ry, L. (eds.) TPHOLs 1999. LNCS, vol.\u00a01690, p. 149. Springer, Heidelberg (1999)"},{"key":"7_CR15","unstructured":"Luo, Z., Pollack, R.: Lego proof development system: User\u2019s manual. Technical Report ECS-LFCS-92-211. University of Edinburgh (1992)"},{"key":"7_CR16","volume-title":"Proc. 13th ACM Symp. Principles Programming Languages","author":"D.B. MacQueen","year":"1986","unstructured":"MacQueen, D.B.: Using Dependant Types to Express Modular Structures. In: Proc. 13th ACM Symp. Principles Programming Languages. ACM Press, New York (1986)"},{"key":"7_CR17","unstructured":"Owre, S., Shankar, N., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS Language Reference. Part of the PVS Manual. Available on the Web as, \n                    \n                      http:\/\/www.csl.sri.com\/pvsweb\/manuals.html\n                    \n                    \n                   (September 1998)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0030541","volume-title":"Isabelle: A Generic Theorem Prover","author":"L.C. Paulson","year":"1994","unstructured":"Paulson, L.C.: Isabelle: A Generic Theorem Prover. LNCS, vol.\u00a0828. Springer, Heidelberg (1994)"},{"volume-title":"H. B. Curry: Essays on Combinatory Logic","year":"1980","key":"7_CR19","unstructured":"Seldin, J.P., Hindley, J.R. (eds.): To H. B. Curry: Essays on Combinatory Logic. Academic Press Limited, London (1980)"},{"key":"7_CR20","unstructured":"Trybulec, A.: Some Features of the Mizar Language (1993), Available from Mizar user\u2019s group"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF00244488","volume":"6","author":"Y. Yu","year":"1990","unstructured":"Yu, Y.: Computer Proofs in Group Theory. Journal of Automated Reasoning\u00a06, 251\u2013286 (1990)","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction - CADE-17"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721959_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T10:19:56Z","timestamp":1553336396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721959_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676645","9783540451013"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/10721959_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}