{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:46:38Z","timestamp":1762458398097},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4288,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0661(04)00284-1","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"155-188","source":"Crossref","is-referenced-by-count":7,"title":["Induction for termination with local strategies"],"prefix":"10.1016","volume":"58","author":[{"given":"Olivier","family":"Fissore","sequence":"first","affiliation":[]},{"given":"Isabelle","family":"Gnaedig","sequence":"additional","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB1","doi-asserted-by":"crossref","unstructured":"T. Arts and J. Giesl. Proving innermost normalisation automatically. In Proceedings 8th Conference on Rewriting Techniques and Applications, Sitges (Spain), volume 1232 of Lecture Notes in Computer Science, pages 157\u2013171. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62950-5_68"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB2","unstructured":"T. Arts and Giesl. J. Proving innermost normalization automatically. Technical Report 96\/39, Technische Hochschule Darmstadt, Germany, 1996."},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB3","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, P.-E. Moreau, and Ch. Ringeissen. An Overview of ELAN. In C. Kirchner and H. Kirchner, editors, Proc. Second Intl. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Pont-\u00e0-Mousson (France), September 1998. Elsevier.","DOI":"10.1016\/S1571-0661(05)82552-6"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Peter Borovansk\u00fd, Claude Kirchner, H\u00e9l\u00e8ne Kirchner, Pierre-Etienne Moreau, and Christophe Ringeissen. An overview of ELAN. In Claude Kirchner and H\u00e9l\u00e8ne Kirchner, editors, Proceedings of the second International Workshop on Rewriting Logic and Applications, volume 15, http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html, Pont-\u00e0-Mousson (France), September 1998. Electronic Notes in Theoretical Computer Science. Report LORIA 98-R-316.","DOI":"10.1016\/S1571-0661(05)82552-6"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB5","doi-asserted-by":"crossref","unstructured":"M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, Proceedings of the 1st International Workshop on Rewriting Logic and its Applications, volume 5 of Electronic Notes in Theoretical Computer Science, Asilomar, Pacific Grove, CA, USA, September 1996. North Holland.","DOI":"10.1016\/S1571-0661(04)00034-9"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244\u2013320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB7","doi-asserted-by":"crossref","unstructured":"S. Eker. Term rewriting with operator evaluation strategies. In C Kirchner and H. Kirchner, editors, Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, Pont-\u00e0-Mousson, France, September 1998.","DOI":"10.1016\/S1571-0661(05)80019-2"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB8","unstructured":"O. Fissore. Terminaison par induction. M\u00e9moire de DEA, Universit\u00e9 Henri Poincar\u00e9 \u2013 Nancy 1, June 2000."},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB9","doi-asserted-by":"crossref","unstructured":"O. Fissore, I. Gnaedig, and H. Kirchner. Termination of rewriting with local strategies. Technical Report A01-R-177, LORIA, Nancy, France, 2001.","DOI":"10.1016\/S1571-0661(04)00284-1"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB10","doi-asserted-by":"crossref","unstructured":"K. Futatsugi and A. Nakagawa. An overview of CAFE specification environment \u2014 an algebraic approach for creating, verifying, and maintaining formal specifications over networks. In Proceedings of the 1st IEEE Int. Conference on Formal Engineering Methods, 1997.","DOI":"10.1109\/ICFEM.1997.630424"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB11","doi-asserted-by":"crossref","unstructured":"J. Giesl and Middeldorp A. Transforming Context-Sensitive Rewrite Systems. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications, volume 1631 of Lecture Notes in Computer Science, pages 271\u2013285, Trento, Italy, 1999. Springer-Verlag.","DOI":"10.1007\/3-540-48685-2_23"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB12","unstructured":"I. Gnaedig, H. Kirchner, and O. Fissore. Induction for innermost and outermost ground termination. Technical Report A01-R-178, LORIA, Nancy, France, 2001."},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB13","doi-asserted-by":"crossref","unstructured":"J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.P. Jouannaud. Introducing OBJ3. Technical report, Computer Science Laboratory, SRI International, march 1992.","DOI":"10.1007\/978-1-4757-6541-0_1"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB14","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1145\/151257.151260","article-title":"A meta-environment for generating programming environments","volume":"2","author":"Klint","year":"1993","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0304-3975(99)00215-7","article-title":"Some characteristics of strong normalization","volume":"239","author":"Krishna Rao","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB16","doi-asserted-by":"crossref","unstructured":"S. Lucas. Termination of context-sensitive rewriting by rewriting. In Proceedings of the 23rd International Colloquium on Automata, Languages and Programming, volume 1099 of Lecture Notes in Computer Science, pages 122\u2013133. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61440-0_122"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB17","unstructured":"S. Lucas. Context-sensitive rewriting strategies. Technical Report DSIC-II\/7\/00, Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n, Universidad Polit\u00e9cnica de Valencia, Spain, 2000."},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Nakamura M. and Ogata K. The evaluation strategy for head normal form with and without on-demand flags. In K. Futatsugi, editor, Proceedings of the Third International Workshop on Rewriting Logic and its Applications, WRLA'2000, pages 211\u2013227, Kanazawa City Cultural Halt, Kanazawa, Japan, September 2000. Electronic Notes in Theoretical Computer Science.","DOI":"10.1016\/S1571-0661(05)80143-4"},{"issue":"3 & 4","key":"10.1016\/S1571-0661(04)00284-1_NEWBIB19","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01190830","article-title":"Completeness results for basic narrowing","volume":"5","author":"Middeldorp","year":"1994","journal-title":"Applicable Algebra in Engineering, Communication and Computation"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB20","doi-asserted-by":"crossref","unstructured":"E. Visser. Stratego: A Language for Program Transformation based on Rewriting Strategies. System Description for Stratego 0.5. In Aart Middeldorp, editor, Proceedings of the 12th International Conference on Rewriting Techniques and Applications. Springer-Verlag, 2001. To appear.","DOI":"10.1007\/3-540-45127-7_27"},{"key":"10.1016\/S1571-0661(04)00284-1_NEWBIB21","doi-asserted-by":"crossref","unstructured":"H. Zantema. Termination of context-sensitive rewriting. In Proceedings of the 8th International Conference on Rewriting Techniques and Applications, volume 1232 of Lecture Notes in Computer Science, pages 172\u2013186. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62950-5_69"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002841?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:25:45Z","timestamp":1585484745000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104002841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S1571066104002841"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00284-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}