{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:36Z","timestamp":1761611136799,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3893,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s1571-0661(04)80510-3","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"124-145","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards Proof Planning for\n\t\t\n\t\t\t\n\t\t\u03c9+"],"prefix":"10.1016","volume":"70","author":[{"given":"Carsten","family":"Sch\u00fcrmann","sequence":"first","affiliation":[]},{"given":"Serge","family":"Autexier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Andrew W. Appel. Foundational proof-carrying code. In 16th Annual IEEE Symposium on Logic in Computer Science (LICS '01), pages 247\u2013258, Boston, USA, June 2001.","DOI":"10.1109\/LICS.2001.932501"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB2","series-title":"ACM monograph series","article-title":"A Computational Logic","author":"Boyer","year":"1979"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Alan Bundy. The use of explicit plans to guide inductive proofs. In R. Lusk and R. Overbeek, editors, Proceedings of the 9th International Conference on Automated Deduction (CADE-9), pages 111\u2013120, Argonne, Illinois, USA, 1988. Springer Verlag LNCS 310.","DOI":"10.1007\/BFb0012826"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB4","series-title":"Logical Frameworks","first-page":"255","article-title":"An algorithm for testing conversion in type theory","author":"Coquand","year":"1991"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB5","unstructured":"Gilles Dowek, Amy Felty, Hugo Herbelin, G\u00e9rard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France, 1993. Version 5.8."},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Milner A. J. Gordon, M. J. and C. P. Wadsworth. Edinburgh LCF:A Mechanised Logic of Computation. Springer Verlag LNCS 78, 1979.","DOI":"10.1007\/3-540-09724-4"},{"issue":"2\u20133","key":"10.1016\/S1571-0661(04)80510-3_NEWBIB7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0004-3702(92)90021-O","article-title":"A theory of abstraction","volume":"57","author":"Giunchiglia","year":"1992","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S1571-0661(04)80510-3_NEWBIB8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","article-title":"A framework for defining logics","volume":"40","author":"Harper","year":"1993","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Dieter Hutter. Inka - the next generation. In 13th International Conference on Automated Deduction, New Brunswick, USA, 1996.","DOI":"10.1007\/3-540-61511-3_92"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB10","unstructured":"Zhaohui Luo and Robert Pollack. The LEGO proof development system: A user's manual. Technical Report ECS-LFCS-92\u2013211, University of Edinburgh, May 1992."},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Spiro Michaylov and Frank Pfenning. Natural semantics and some of its meta-theory in Elf. In L.-H. Eriksson, L. Halln\u00e4s, and P. Schroeder-Heister, editors, Proceedings of the Second International Workshop on Extensions of Logic Programming, pages 299\u2013344, Stockholm, Sweden, January 1991. Springer-Verlag LNAI 596.","DOI":"10.1007\/BFb0013612"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB12","doi-asserted-by":"crossref","unstructured":"George C. Necula. Proof-carrying code. In Neil D. Jones, editor, Conference Record of the 24th Symposium on Principles of Programming Languages (POPL'97), pages 106\u2013119, Paris, France, January 1997. ACM Press.","DOI":"10.1145\/263699.263712"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB13","doi-asserted-by":"crossref","unstructured":"S. Owre, J.M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction (CADE-11), pages 748\u2013752, Saratoga Springs, New York, June 1992. Springer Verlag LNAI 607.","DOI":"10.1007\/3-540-55602-8_217"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB14","series-title":"Isabelle: A Generic Theorem Prover","first-page":"828","author":"Lawrence Paulson","year":"1994"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB15","series-title":"Logical Frameworks","first-page":"149","article-title":"Logic programming in the LF logical framework","author":"Pfenning","year":"1991"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB16","series-title":"Handbook of Automated Reasoning","article-title":"Logical frameworks","author":"Pfenning","year":"1999"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB17","doi-asserted-by":"crossref","unstructured":"David A. Plaisted. Abstraction mappings in mechanical theorem proving. In Wolfgang Bibel and Robert A. Kowalski, editors, Proceedings of the 5th International Conference on Automated Deduction (CADE-5), pages 264\u2013280, Les Arcs, France, July 1980. Sringer Verlag LNCS 87.","DOI":"10.1007\/3-540-10009-1_21"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Frank Pfenning and Carsten Sch\u00fcrmann. System description: Twelf \u2014 a meta-logical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 202\u2013206, Trento, Italy, July 1999. Springer-Verlag LNAI 1632.","DOI":"10.1007\/3-540-48660-7_14"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB19","unstructured":"Carsten Sch\u00fcrmann and Serge Autexier. Towards proof planning for\n\t\t\t\t\t\t\n\t\t\t\t\t\t\tm\n\t\t\t\t\t\t+\u03c9. Technical Report Yale\/DCS\/TR1231, Yale University, Computer Science, New Haven, CT, USA, June 2002."},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB20","unstructured":"Carsten Sch\u00fcrmann. Automating the Meta-Theory of Deductive Systems. PhD thesis, Carnegie Mellon University, 2000. CMU-CS-00\u2013146."},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB21","doi-asserted-by":"crossref","unstructured":"Carsten Sch\u00fcrmann. Recursion for higher-order encodings. In Laurent Fribourg, editor, Proceedings of the Conference on Computer Science Logic (CSL 2001), pages 585\u2013599, Paris, France, August 2001. Springer Verlag LNCS 2142.","DOI":"10.1007\/3-540-44802-0_41"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB22","doi-asserted-by":"crossref","unstructured":"Carsten Sch\u00fcrmann. A type-theoretic approach to induction with higher-order encodings. In Proceedings of the Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2001), pages 266\u2013281, Havana, Cuba, 2001. Springer Verlag LNAI 2250.","DOI":"10.1007\/3-540-45653-8_18"},{"key":"10.1016\/S1571-0661(04)80510-3_NEWBIB23","first-page":"133","article-title":"Automata on infinite objects","volume":"volume B","author":"Thomas","year":"1990"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805103?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805103?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:06Z","timestamp":1761609966000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S1571066104805103"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80510-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards Proof Planning for\n\t\t\u03c9+","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80510-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}