{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:46:49Z","timestamp":1762458409863},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":3984,"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":[[2002,9]]},"DOI":"10.1016\/s1571-0661(04)80353-0","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T19:29:25Z","timestamp":1096399765000},"page":"234-254","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Lazy Rewriting and Context-Sensitive Rewriting"],"prefix":"10.1016","volume":"64","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","article-title":"Termination of Term Rewriting Using Dependency Pairs","volume":"236","author":"Arts","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB2","doi-asserted-by":"crossref","unstructured":"S. Antoy. Definitional Trees. In H. Kirchner and G. Levi, editors, Proc. of 3rd International Conference on Algebraic and Logic Programming, ALP'92, LNCS 632:143\u2013157, Springer-Verlag, Berlin, 1992.","DOI":"10.1007\/BFb0013825"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB3","doi-asserted-by":"crossref","unstructured":"C. Borralleras, S. Lucas, and A. Rubio. Recursive Path Orderings can be Context-Sensitive. In A. Voronkov, editor Proc. of 18th International Conference on Automated Deduction, CADE'02, Springer LNAI volume 2392, to appear, 2002.","DOI":"10.1007\/3-540-45620-1_27"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB4","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":"10.1016\/S1571-0661(04)80353-0_NEWBIB5","doi-asserted-by":"crossref","unstructured":"S. Eker. Term Rewriting with Operator Evaluation Strategies. In C. Kirchner and H. Kirchner, editors, Proc. of 2nd International Workshop on Rewriting Logic and its Applications, WRLA'98, Electronic Notes in Computer Science, 15 (1998):1\u201320, 1998.","DOI":"10.1016\/S1571-0661(05)80019-2"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB6","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'85, pages 52\u201366, ACM Press, 1985.","DOI":"10.1145\/318593.318610"},{"issue":"1","key":"10.1016\/S1571-0661(04)80353-0_NEWBIB7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/345099.345102","article-title":"Lazy Rewriting on Eager Machinery","volume":"22","author":"Fokkink","year":"2000","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB8","doi-asserted-by":"crossref","unstructured":"K. Futatsugi and A. Nakagawa. An Overview of CAFE Specification Environment \u2013- An algebraic approach for creating, verifying, and maintaining formal specification over networks \u2013-. In Proc. of 1st International Conference on Formal Engineering Methods, 1997.","DOI":"10.1109\/ICFEM.1997.630424"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB9","doi-asserted-by":"crossref","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'99, LNCS 1631:286\u2013300, Springer-Verlag, Berlin, 1999.","DOI":"10.1007\/3-540-48685-2_24"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB10","series-title":"Automata, Languages and Programming","first-page":"257","article-title":"CONS should not evaluate its arguments","author":"Friedman","year":"1976"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB11","doi-asserted-by":"crossref","unstructured":"B. Gramlich and S. Lucas. Modular termination of context-sensitive rewriting. In C. Kirchner, editor, Proc. of 4th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'02, ACM Press, New York, to appear, 2002.","DOI":"10.1145\/571157.571163"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB12","doi-asserted-by":"crossref","unstructured":"J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. In P. Narendran and M. Rusinowitch, editors, Proc. of 10th International Conference on Rewriting Techniques and Applications, RTA'99, LNCS 1631:271\u2013285, Springer-Verlag, Berlin, 1999.","DOI":"10.1007\/3-540-48685-2_23"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB13","unstructured":"J. Giesl and A. Middeldorp. Transformation Techniques for Context-Sensitive Rewrite Systems. Technical Report AIB\u20132002\u201302, Department of Computer Science, RWTH Aachen, 2002."},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB14","series-title":"Software Engineering with OBJ: algebraic specification in action","article-title":"Introducing OBJ","author":"Goguen","year":"2000"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB15","series-title":"Computational logic: essays in honour of J. Alan Robinson","first-page":"395","article-title":"Computations in orthogonal term rewriting systems","author":"Huet","year":"1991"},{"issue":"1","key":"10.1016\/S1571-0661(04)80353-0_NEWBIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0190(98)00016-7","article-title":"Strongly sequential and inductively sequential term rewriting systems","volume":"67","author":"Hanus","year":"1998","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB17","doi-asserted-by":"crossref","unstructured":"S. Lucas. Termination of context-sensitive rewriting by rewriting. In F. Meyer auf der Heide and B. Monien, editors, Proc. of 23rd. International Colloquium on Automata, Languages and Programming, ICALP'96, LNCS 1099:122\u2013133, Springer-Verlag, Berlin, 1996.","DOI":"10.1007\/3-540-61440-0_122"},{"issue":"1","key":"10.1016\/S1571-0661(04)80353-0_NEWBIB18","first-page":"1","article-title":"Context-sensitive computations in functional and functional logic programs","volume":"1998","author":"Lucas","year":"1998","journal-title":"Journal of Functional and Logic Programming"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB19","doi-asserted-by":"crossref","unstructured":"S. Lucas. Termination of on-demand rewriting and termination of OBJ programs. In Proc. of 3rd International Conference on Principles and Practice of Declarative Programming, PPDP'01, pages 82\u201393, ACM Press, 2001.","DOI":"10.1145\/773184.773194"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB20","doi-asserted-by":"crossref","unstructured":"S. Lucas. Termination of Rewriting With Strategy Annotations. In R. Nieuwenhuis and A. Voronkov, editors, Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR'01, LNAI 2250:669\u2013684, Springer-Verlag, Berlin, 2001.","DOI":"10.1007\/3-540-45653-8_46"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB21","doi-asserted-by":"crossref","unstructured":"S. Lucas. Context-sensitive rewriting strategies. Information and Computation, to appear.","DOI":"10.1016\/S0890-5401(02)93176-7"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB22","unstructured":"S. Lucas. Context-sensitive rewriting techniques for programs with strategy annotations (tutorial). In U. Montanari, editor, Proc. of 4th International Workshop on Rewriting Logic and its Applications, WRLA'02, Electronic Notes in Theoretical Computer Science, volume 71, to appear."},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB23","doi-asserted-by":"crossref","unstructured":"S. Lucas. Termination of (Canonical) Context-Sensitive Rewriting. In S. Tison, editor, Proc. of 13th International Conference on Rewriting Techniques and Applications, RTA'02, LNCS volume 2378, to appear, 2002.","DOI":"10.1007\/3-540-45610-4_21"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB24","doi-asserted-by":"crossref","unstructured":"Q.-H. Nguyen. Compact Normalisation Trace via Lazy Rewriting. In B. Gramlich and S. Lucas, editors, Proc. of International Workshop on Reduction Strategies in Rewriting and Programming, WRS'01, Electronic Notes in Theoretical Computer Science, volume 57, 2001.","DOI":"10.1016\/S1571-0661(04)00269-5"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB25","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'00, Electronic Notes in Theoretical Computer Science, volume 36, 17 pages, 2001.","DOI":"10.1016\/S1571-0661(05)80143-4"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB26","doi-asserted-by":"crossref","unstructured":"K. Ogata and K. Futatsugi. Operational Semantics of Rewriting with the On-demand Evaluation Strategy. In Proc of 2000 International Symposium on Applied Computing, SAC'00, pages 756\u2013763, ACM Press, 2000.","DOI":"10.1145\/338407.338558"},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB27","unstructured":"J. Steinbach and H. Xi. Freezing \u2013- Termination Proofs for Classical, Context-Sensitive and Innermost Rewriting. Institut f\u00fcr Informatik, T.U. M\u00fcnchen, January 1998."},{"key":"10.1016\/S1571-0661(04)80353-0_NEWBIB28","doi-asserted-by":"crossref","unstructured":"H. Zantema. Termination of Context-Sensitive Rewriting. In H. Comon, editor, Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA'97, LNCS 1232:172\u2013186, Springer-Verlag, Berlin, 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:S1571066104803530?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104803530?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T06:51:52Z","timestamp":1585896712000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104803530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":28,"alternative-id":["S1571066104803530"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80353-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}