{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:42:01Z","timestamp":1747546921140},"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_8","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T21:12:31Z","timestamp":1167426751000},"page":"115-131","source":"Crossref","is-referenced-by-count":13,"title":["An Infrastructure for Intertheory Reasoning"],"prefix":"10.1007","author":[{"given":"William M.","family":"Farmer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"An Introduction to Mathematical Logic and Type Theory: To Truth through Proof","author":"P.B. Andrews","year":"1986","unstructured":"Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth through Proof. Academic Press, London (1986)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-10007-5_41","volume-title":"Abstract Software Specifications","author":"R. Burstall","year":"1980","unstructured":"Burstall, R., Goguen, J.: The semantics of Clear, a specification language. In: Bjorner, D. (ed.) Abstract Software Specifications. LNCS, vol.\u00a086, pp. 292\u2013332. Springer, Heidelberg (1980)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic\u00a05, 56\u201368 (1940)","journal-title":"Journal of Symbolic Logic"},{"key":"8_CR4","volume-title":"A Mathematical Introduction to Logic","author":"H.B. Enderton","year":"1972","unstructured":"Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, London (1972)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.2307\/2274487","volume":"55","author":"W.M. Farmer","year":"1990","unstructured":"Farmer, W.M.: A partial functions version of Church\u2019s simple theory of types. Journal of Symbolic Logic\u00a055, 1269\u20131291 (1990)","journal-title":"Journal of Symbolic Logic"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0168-0072(93)90144-3","volume":"64","author":"W.M. Farmer","year":"1993","unstructured":"Farmer, W.M.: A simple type theory with partial functions and subtypes. Annals of Pure and Applied Logic\u00a064, 211\u2013240 (1993)","journal-title":"Annals of Pure and Applied Logic"},{"key":"8_CR7","unstructured":"Farmer, W.M.: A general method for safely overwriting theories in mechanized mathematics systems. Technical report, The MITRE Corporation (1994)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-58233-9_6","volume-title":"Higher-Order Algebra, Logic, and Term Rewriting","author":"W.M. Farmer","year":"1994","unstructured":"Farmer, W.M.: Theory interpretation in simple type theory. In: Heering, J., Meinke, K., M\u00f6ller, B., Nipkow, T. (eds.) HOA 1993. LNCS, vol.\u00a0816, pp. 96\u2013123. Springer, Heidelberg (1994)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","first-page":"8","volume-title":"Automated Deduction - Cade-13","author":"W.M. Farmer","year":"1996","unstructured":"Farmer, W.M., Guttman, J.D., Thayer F\u00e1brega, F.J.: IMPS: An updated system description. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol.\u00a01104, pp. 8\u2013302. Springer, Heidelberg (1996)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/3-540-55602-8_192","volume-title":"Automated Deduction - CADE-11","author":"W.M. Farmer","year":"1992","unstructured":"Farmer, W.M., Guttman, J.D., Thayer, F.J.: Little theories. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.\u00a0607, pp. 567\u2013581. Springer, Heidelberg (1992)"},{"key":"8_CR11","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"},{"key":"8_CR12","unstructured":"Goguen, J.A., Winkler, T.: Introducing OBJ3. Technical Report SRI-CSL-99-9, SRI International (August 1988)"},{"key":"8_CR13","volume-title":"Introduction to HOL: A Theorem Proving Environment for Higher Order Logic","author":"M.J.C. Gordon","year":"1993","unstructured":"Gordon, M.J.C., Melham, T.F.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge (1993)"},{"key":"8_CR14","unstructured":"Hamilton, N., Nickson, R., Traynor, O., Utting, M.: Interpretation and instantiation of theories for reasoning about formal specifications. In: Pate, M. (ed.) Proceedings of the Twentieth Australasian Computer Science Conference. Australian Computer Science Communications, vol.\u00a019, pp. 37\u201345 (1997)"},{"key":"8_CR15","unstructured":"Kaufmann, M., Moore, J.S.: Structured theory development for a mechanized logic (1999), Available at \n                    \n                      http:\/\/www.cs.utexas.edu\/users\/moore\/publications\/acl2-papers.html"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"The IOTA Programming System","year":"1982","unstructured":"Nakajima, R., Yuasa, T. (eds.): The IOTA Programming System. LNCS, vol.\u00a0160. Springer, Heidelberg (1982)"},{"key":"8_CR17","unstructured":"Nickson, R., Traynor, O., Utting, M.: Cogito ergo sum\u2013providing structured theorem prover support for specification formalisms. In: Ramamohanarao, K. (ed.) Proceedings of the Nineteenth Australian computer science conference. Australian Computer Science Communications, vol.\u00a018, pp. 149\u2013158 (1997)"},{"key":"8_CR18","unstructured":"Rushby, J., von Henke, F., Owre, S.: An introduction to formal specification and verification using EHDM. Technical Report SRI-CSL-91-02, SRI International (1991)"},{"key":"8_CR19","volume-title":"Mathematical Logic","author":"J.R. Shoenfield","year":"1967","unstructured":"Shoenfield, J.R.: Mathematical Logic. Addison-Wesley, Reading (1967)"},{"key":"8_CR20","first-page":"483","volume-title":"Automating Software Design","author":"D. Smith","year":"1991","unstructured":"Smith, D.: KIDS: A knowledge-based software development system. In: Lowry, M., McCartney, R. (eds.) Automating Software Design, pp. 483\u2013514. MIT Press, Cambridge (1991)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Srinivas, Y., Jullig, R.: Specware: Formal support for composing software. In: Proceedings of the Conference on Mathematics of Program Construction (1995)","DOI":"10.1007\/3-540-60117-1_22"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction - CADE-17"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721959_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T10:30:26Z","timestamp":1553337026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721959_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676645","9783540451013"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/10721959_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}