{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:12:34Z","timestamp":1794381154429,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540230175","type":"print"},{"value":"9783540301424","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30142-4_12","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T20:14:09Z","timestamp":1284840849000},"page":"152-167","source":"Crossref","is-referenced-by-count":12,"title":["Theorem Reuse by Proof Term Transformation"],"prefix":"10.1007","author":[{"given":"Einar Broch","family":"Johnsen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"L\u00fcth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1006\/jsco.1999.0346","volume":"30","author":"P. Anderson","year":"2000","unstructured":"Anderson, P., Basin, D.: Program development schemata as derived rules. Journal of Symbolic Computation\u00a030(1), 5\u201336 (2000)","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0304-3975(01)00368-1","volume":"286","author":"E. Astesiano","year":"2002","unstructured":"Astesiano, E., Bidoit, M., Kirchner, H., Krieg-Br\u00fcckner, B., Mosses, P.D., Sannella, D., Tarlecki, A.: Casl: The Common Algebraic Specification Language. Theoretical Computer Science\u00a0286(2), 153\u2013196 (2002)","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-45719-4_34","volume-title":"Algebraic Methodology and Software Technology","author":"S. Autexier","year":"2002","unstructured":"Autexier, S., Hutter, D., Mossakowski, T., Schairer, A.: The development graph manager MAYA. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, pp. 495\u2013501. Springer, Heidelberg (2002)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-44659-1_3","volume-title":"Theorem Proving in Higher Order Logics","author":"S. Berghofer","year":"2000","unstructured":"Berghofer, S., Nipkow, T.: Proof terms for simply typed higher order logic. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol.\u00a01869, pp. 38\u201352. Springer, Heidelberg (2000)"},{"key":"12_CR5","unstructured":"Bertot, Y., Pons, O., Rideau, L.: Notions of dependency in proof assistants. In: User Interfaces in Theorem Provers, Eindhoven Univ. of Technology (1998)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Logic Programming and Automated Reasoning","author":"A. Felty","year":"1994","unstructured":"Felty, A., Howe, D.: Generalization and reuse of tactic proofs. In: Pfenning, F. (ed.) LPAR 1994. LNCS, vol.\u00a0822, pp. 1\u201315. Springer, Heidelberg (1994)"},{"issue":"3-4","key":"12_CR7","first-page":"167","volume":"10","author":"F. Giunchiglia","year":"1997","unstructured":"Giunchiglia, F., Villafiorita, A., Walsh, T.: Theories of abstraction. AI Communications\u00a010(3-4), 167\u2013176 (1997)","journal-title":"AI Communications"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the ACM\u00a040(1), 143\u2013184 (1993)","journal-title":"Journal of the ACM"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/A:1006282725324","volume":"25","author":"D. Hutter","year":"2000","unstructured":"Hutter, D., Kohlhase, M.: Managing structural information by higher-order colored unification. Journal of Automated Reasoning\u00a025, 123\u2013164 (2000)","journal-title":"Journal of Automated Reasoning"},{"issue":"4","key":"12_CR10","first-page":"313","volume":"10","author":"E.B. Johnsen","year":"2003","unstructured":"Johnsen, E.B., L\u00fcth, C.: Abstracting refinements for transformation. Nordic Journal of Computing\u00a010(4), 313\u2013336 (2003)","journal-title":"Nordic Journal of Computing"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-44659-1_25","volume-title":"Theorem Proving in Higher Order Logics","author":"C. L\u00fcth","year":"2000","unstructured":"L\u00fcth, C., Wolff, B.: TAS \u2013 a generic window inference system. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol.\u00a01869, pp. 405\u2013422. Springer, Heidelberg (2000)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/10930755_6","volume-title":"Theorem Proving in Higher Order Logics","author":"N. Magaud","year":"2003","unstructured":"Magaud, N.: Changing data representation within the coq system. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, pp. 87\u2013102. Springer, Heidelberg (2003)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-45842-5_12","volume-title":"Types for Proofs and Programs","author":"N. Magaud","year":"2002","unstructured":"Magaud, N., Bertot, Y.: Changing data structures in type theory: A study of natural numbers. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol.\u00a02277, pp. 181\u2013196. Springer, Heidelberg (2002)"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1005936130801","volume":"22","author":"E. Melis","year":"1999","unstructured":"Melis, E., Whittle, J.: Analogy in inductive theorem proving. Journal of Automated Reasoning\u00a022(2), 117\u2013147 (1999)","journal-title":"Journal of Automated Reasoning"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic\u00a051, 125\u2013157 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL \u2013 A Proof Assistant for Higher-Order Logic","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle\/HOL \u2013 A Proof Assistant for Higher-Order Logic. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"12_CR17","first-page":"361","volume-title":"Logic and Computer Science","author":"L.C. Paulson","year":"1990","unstructured":"Paulson, L.C.: Isabelle: The next 700 theorem provers. In: Odifreddi, P. (ed.) Logic and Computer Science, pp. 361\u2013386. Academic Press, London (1990)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1017\/CBO9780511569807.008","volume-title":"Logical Frameworks","author":"F. Pfenning","year":"1991","unstructured":"Pfenning, F.: Logic programming in the LF logical framework. In: Huet, G., Plotkin, G. (eds.) Logical Frameworks, pp. 149\u2013181. Cambridge Univ. Press, Cambridge (1991)"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1016\/B978-044450813-3\/50019-9","volume-title":"Handbook of Automated Reasoning","author":"F. Pfenning","year":"2001","unstructured":"Pfenning, F.: Logical frameworks. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 1063\u20131147. Elsevier Science Publishers, Amsterdam (2001)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-45842-5_14","volume-title":"Types for Proofs and Programs","author":"O. Pons","year":"2002","unstructured":"Pons, O.: Generalization in type theory based proof assistants. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol.\u00a02277, pp. 217\u2013232. Springer, Heidelberg (2002)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0049-237X(08)70849-8","volume-title":"Proceedings of the Second Scandinavian Logic Symposium, Studies in Logic and the Foundations of Mathematics","author":"D. Prawitz","year":"1971","unstructured":"Prawitz, D.: Ideas and results in proof theory. In: Fenstad, J.E. (ed.) Proceedings of the Second Scandinavian Logic Symposium, Studies in Logic and the Foundations of Mathematics, vol.\u00a063, pp. 235\u2013307. North-Holland, Amsterdam (1971)"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/3-540-57529-4_61","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"W. Reif","year":"1993","unstructured":"Reif, W., Stenzel, K.: Reuse of proofs in software verification. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol.\u00a0761, pp. 284\u2013293. Springer, Heidelberg (1993)"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S0747-7171(06)80006-4","volume":"15","author":"D. Smith","year":"1993","unstructured":"Smith, D.: Constructing specification morphisms. Journal of Symbolic Computation\u00a015, 571\u2013606 (1993)","journal-title":"Journal of Symbolic Computation"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0167-6423(90)90025-9","volume":"14","author":"D.R. Smith","year":"1990","unstructured":"Smith, D.R., Lowry, M.R.: Algorithm theories and design tactics. Science of Computer Programming\u00a014, 305\u2013321 (1990)","journal-title":"Science of Computer Programming"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematics of Program Construction","author":"Y.V. Srinivas","year":"1995","unstructured":"Srinivas, Y.V., Jullig, R.: Specware: Formal support for composing software. In: M\u00f6ller, B. (ed.) MPC 1995. LNCS, vol.\u00a0947, Springer, Heidelberg (1995)"},{"issue":"1-2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0004-3702(99)00096-X","volume":"116","author":"C. Walther","year":"2000","unstructured":"Walther, C., Kolbe, T.: Proving theorems by reuse. Artificial Intelligence\u00a0116(1-2), 17\u201366 (2000)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30142-4_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:52:16Z","timestamp":1619999536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30142-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230175","9783540301424"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30142-4_12","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b100400","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}