{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:21:01Z","timestamp":1725484861137},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677970"},{"type":"electronic","value":"9783540449577"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_42","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T01:24:41Z","timestamp":1180661081000},"page":"629-643","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions"],"prefix":"10.1007","author":[{"given":"Richard J.","family":"Boulton","sequence":"first","affiliation":[]},{"given":"Konrad","family":"Slind","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"key":"42_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BFb0055131","volume-title":"Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs\u2019 98)","author":"R. Boulton","year":"1998","unstructured":"R. Boulton, K. Slind, A. Bundy, and M. Gordon. An interface between CLAM and HOL. In Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs\u2019 98), volume 1479 of Lecture Notes in Computer Science, pages 87\u2013104, Springer, 1998."},{"key":"42_CR2","unstructured":"R. J. Boulton. Multi-predicate induction schemes for mutual recursion. Informatics Research Report EDI-INF-RR-0014, Division of Informatics, University of Edinburgh, April 2000."},{"key":"42_CR3","series-title":"ACM Monograph Series","volume-title":"A Computational Logic","author":"R. S. Boyer","year":"1979","unstructured":"R. S. Boyer and J S. Moore. A Computational Logic. ACM Monograph Series. Academic Press, New York, 1979."},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0004-3702(93)90079-Q","volume":"62","author":"A. Bundy","year":"1993","unstructured":"A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62:185\u2013253, 1993.","journal-title":"Artificial Intelligence"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The OYSTER-CLAM system. In Proceedings of the 10th International Conference on Automated Deduction, volume 449 of Lecture Notes in Artificial Intelligence, pages 647\u2013648, Springer, 1990.","DOI":"10.1007\/3-540-52885-7_123"},{"key":"42_CR6","unstructured":"M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993."},{"key":"42_CR7","unstructured":"J. T. Hesketh. Using Middle-Out Reasoning to Guide Inductive Theorem Proving. PhD thesis, University of Edinburgh, 1991."},{"key":"42_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014311","volume-title":"Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology (AMAST\u201996)","author":"D. Kapur","year":"1996","unstructured":"D. Kapur and M. Subramaniam. Automating induction over mutually recursive functions. In Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology (AMAST\u201996), volume 1101 of Lecture Notes in Computer Science, Springer, 1996."},{"key":"42_CR9","unstructured":"P. Liu and R.-J. Chang. A new structural induction scheme for proving properties of mutually recursive concepts. In Proceedings of the 6th National Conference on Artificial Intelligence, volume 1, pages 144\u2013148. AAAI, July 1987."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"L. C. Paulson. ML for the Working Programmer. Cambridge University Press, 2nd edition, July 1996.","DOI":"10.1017\/CBO9780511811326"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"M. Protzen. Lazy generation of induction hypotheses. In Proceedings of the 12th International Conference on Automated Deduction (CADE-12), volume 814 of Lecture Notes in Artificial Intelligence, pages 42\u201356, Springer, 1994.","DOI":"10.1007\/3-540-58156-1_4"},{"key":"42_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BFb0105417","volume-title":"Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics (TPHOLs\u201996)","author":"K. Slind","year":"1996","unstructured":"K. Slind. Function definition in higher-order logic. In Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics (TPHOLs\u201996), volume 1125 of Lecture Notes in Computer Science, pages 381\u2013397, Springer, 1996."},{"key":"42_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BFb0028400","volume-title":"Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics (TPHOLs\u201997)","author":"K. Slind","year":"1997","unstructured":"K. Slind. Derivation and use of induction schemes in higher-order logic. In Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics (TPHOLs\u201997), volume 1275 of Lecture Notes in Computer Science, pages 275\u2013290, Springer, 1997."},{"key":"42_CR14","unstructured":"K. Slind. Reasoning about Terminating Functional Programs. PhD Thesis, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, 1999. Accessible at \n                    http:\/\/www.cl.cam.ac.uk\/users\/kxs\/papers\n                    \n                  ."},{"key":"42_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-57826-9_125","volume-title":"Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications (HUG\u201993)","author":"M. Inwegen Van","year":"1994","unstructured":"M. VanInwegen and E. Gunter. HOL-ML. In Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications (HUG\u201993), volume 780 of Lecture Notes in Computer Science, pages 61\u201374, Springer, 1994."},{"key":"42_CR16","unstructured":"C. Walther. Combining induction axioms by machine. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), volume 1, pages 95\u2013100, Morgan Kaufmann Publishers, Inc."}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:30:22Z","timestamp":1558258222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"15 December 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}