{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:49:35Z","timestamp":1762458575636,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429579"},{"type":"electronic","value":"9783540456537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45653-8_46","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:57:30Z","timestamp":1181365050000},"page":"669-684","source":"Crossref","is-referenced-by-count":17,"title":["Termination of Rewriting with Strategy Annotations"],"prefix":"10.1007","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"46_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-62950-5_68","volume-title":"Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA\u201997","author":"T. Arts","year":"1997","unstructured":"T. Arts and J. Giesl. ProvingInnermost Normalisation Automatically. In H. Comon, editor, Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA\u201997, LNCS 1232:157\u2013171, Springer-Verlag, Berlin, 1997."},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00ed, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen. An Overview of ELAN. In C. Kirchner and H. Kirchner, editors, Proc. of 2nd International Workshop on Rewriting Logic and its Applications, WRLA\u201998, Electronic Notes in Computer Science, 15(1998):1\u201316, 1998.","DOI":"10.1016\/S1571-0661(05)82552-6"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewritingand All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, Proc. 1st International Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, volume 4, 25 pages, Elsevier Sciences, 1996.","DOI":"10.1016\/S1571-0661(04)00034-9"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69\u2013115, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and D.A. Plaisted. Rewriting. In A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning, volume 1, chapter 9, Elsevier, 2001.","DOI":"10.1016\/B978-044450813-3\/50011-4"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"S. Eker. Term Rewritingwith Operator Evaluation Strategies. In C. Kirchner and H. Kirchner, editors, Proc. of 2nd International Workshop on Rewriting Logic and its Applications, WRLA\u201998, Electronic Notes in Computer Science, 15(1998):1\u201320, 1998.","DOI":"10.1016\/S1571-0661(05)80019-2"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL\u201985, pages 52\u201366, ACM Press, 1985.","DOI":"10.1145\/318593.318610"},{"key":"46_CR9","unstructured":"O. Fissore, I. Gnaedig, and H. Kirchner. Termination of rewriting with local strategies. In M.P. Bonacina and B. Gramlich, editors, Proc. of 4th International Workshop on Strategies in Automated Deduction, STRATEGIES\u201901, pages 35\u201354, 2001."},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"K. Futatsugi and A. Nakagawa. An Overview of CAFE Specification Environment-An algebraic approach for creating, verifying, and maintainingformal specification over networks-. In Proc. of 1st International Conference on Formal Engineering Methods, 1997.","DOI":"10.1109\/ICFEM.1997.630424"},{"key":"46_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-48685-2_24","volume-title":"Proc. of 10th International Conference on Rewriting Techniques and Applications, RTA\u201999","author":"M.C.F. Ferreira","year":"1999","unstructured":"M.C.F. Ferreira and A.L. Ribeiro. Context-Sensitive AC-Rewriting. In P. Narendran and M. Rusinowitch, editors, Proc. of 10th International Conference on Rewriting Techniques and Applications, RTA\u201999, LNCS 1631:286\u2013300, Springer-Verlag, Berlin, 1999."},{"key":"46_CR12","unstructured":"I. Gnaedigand O. Fissore. Personal communication. July 2001."},{"key":"46_CR13","unstructured":"B. Gramlich and S. Lucas editors. 1st International Workshop on Reduction Strategies in Rewriting and Programming, WRS\u201901. Proceedings, volume 2359, Servicio de Publicaciones de la Universidad Polit\u00e9cnica de Valencia, 2001. See also: volume 57 of ENTCS, Elsevier, to appear."},{"key":"46_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-48685-2_23","volume-title":"Proc. of 10th International Conference on Rewriting Techniques and Applications, RTA\u201999","author":"J. Giesl","year":"1999","unstructured":"J. Giesl and A. Middeldorp. TransformingCon text-Sensitive Rewrite Systems. In P. Narendran and M. Rusinowitch, editors, Proc. of 10th International Conference on Rewriting Techniques and Applications, RTA\u201999, LNCS 1631:271\u2013285, Springer-Verlag, Berlin, 1999."},{"key":"46_CR15","unstructured":"J. Giesl and A. Middeldorp. Personal communication. May 2001."},{"key":"46_CR16","series-title":"Lect Notes Comput Sci","first-page":"97","volume-title":"Proc. of 7th International Conference on Rewriting Techniques and Applications, RTA\u201996","author":"B. Gramlich","year":"1996","unstructured":"B. Gramlich. On ProvingT ermination by Innermost Termination. In H. Ganzinger, editor, Proc. of 7th International Conference on Rewriting Techniques and Applications, RTA\u201996, LNCS 1103:97\u2013107, Springer-Verlag, Berlin, 1996."},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"J.A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud. Introducing OBJ. In J. Goguen and G. Malcolm, editors, Software Engineering with OBJ: algebraic specification in action, Kluwer, 2000.","DOI":"10.1007\/978-1-4757-6541-0_1"},{"key":"46_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-61440-0_122","volume-title":"Proc. of 23rd. International Colloquium on Automata, Languages and Programming, ICALP\u201996","author":"S. Lucas","year":"1996","unstructured":"S. Lucas. Termination of context-sensitive rewritingb y rewriting. In F. Meyer auf der Heide and B. Monien, editors, Proc. of 23rd. International Colloquium on Automata, Languages and Programming, ICALP\u201996, LNCS 1099:122\u2013133, Springer-Verlag, Berlin, 1996."},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1):1\u201361, January 1998.","DOI":"10.1142\/9789814528849"},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"S. Lucas. Termination of on-demand rewritingand termination of OBJ programs. In Proc. of 3rd International Conference on Principles and Practice of Declarative Programming, PPDP\u201901, pages 82\u201393, ACMPress, 2001.","DOI":"10.1145\/773184.773194"},{"key":"46_CR21","unstructured":"T. Nagaya. Reduction Strategies for Term Rewriting Systems. PhD Thesis, School of Information Science, Japan Advanced Institute of Science and Technology, March 1999."},{"key":"46_CR22","doi-asserted-by":"crossref","unstructured":"M. Nakamura and K. Ogata. The evaluation strategy for head normal form with and without on-demand flags. In K. Futatsugi, editor, Proc. of 3rd International Workshop on Rewriting Logic and its Applications, WRLA\u201900, Electronic Notes in Theoretical Computer Science, volume 36, 17 pages, 2001.","DOI":"10.1016\/S1571-0661(05)80143-4"},{"key":"46_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BFb0033847","volume-title":"Proc of 9th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP\u201997","author":"K. Ogata","year":"1997","unstructured":"K. Ogata and K. Futatsugi. Implementation of Term Rewritings with the Evaluation Strategy. In H. Glaser and P. Hartel, editors, Proc of 9th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP\u201997, LNCS 1292:225\u2013239, Springer-Verlag, Berlin, 1997."},{"key":"46_CR24","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(97)00283-1","volume":"200","author":"J. Pol van de","year":"1998","unstructured":"J. van de Pol. Operational semantics of rewritingwith priorities. Theoretical Computer Science, 200:289\u2013312, 1998.","journal-title":"Theoretical Computer Science"},{"key":"46_CR25","unstructured":"J. van de Pol. Just-in-time: on Strategy Annotations. In [GL01], pages 39\u201358."},{"key":"46_CR26","unstructured":"E. Visser. A Survey of Strategies in Program Transformation Systems. In [GL01], pages 97\u2013128."},{"key":"46_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/3-540-62950-5_69","volume-title":"Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA\u201997","author":"H. Zantema","year":"1997","unstructured":"H. Zantema. Termination of Context-Sensitive Rewriting. In H. Comon, editor, Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA\u201997, LNCS 1232:172\u2013186, Springer-Verlag, Berlin, 1997."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45653-8_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T04:23:09Z","timestamp":1737087789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45653-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429579","9783540456537"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45653-8_46","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}