{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T23:05:22Z","timestamp":1693868722793},"reference-count":18,"publisher":"Elsevier BV","issue":"4","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)00298-1","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"375-396","source":"Crossref","is-referenced-by-count":11,"title":["Scoped Dynamic Rewrite Rules"],"prefix":"10.1016","volume":"59","author":[{"given":"Eelco","family":"Visser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB1","series-title":"Modern Compiler Implementation in ML","author":"Appel","year":"1998"},{"issue":"5","key":"10.1016\/S1571-0661(04)00298-1_NEWBIB2","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1017\/S0956796897002839","article-title":"Shrinking lambda expressions in linear time","volume":"7","author":"Appel","year":"1997","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB3","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Kirchner, and H. Kirchner. Controlling rewriting by rewriting. In J. Meseguer, editor, Proceedings of the First International Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, Asilomar, Pacific Grove, CA, September 1996. Elsevier.","DOI":"10.1016\/S1571-0661(04)00039-8"},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB4","series-title":"Modern Software Tools in Scientific Computing","first-page":"353","article-title":"The TAMPR program transforming system: Simplifying the development of numerical software","author":"Boyle","year":"1997"},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB5","unstructured":"M. G. J. van den Brand, P. Klint, and J. Vinju. Term rewriting with traversal functions. Technical Report SEN-R0121, Centrum voor Wiskunde en Informatica, 2001."},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB6","unstructured":"M. Clavel and J. Meseguer. Reflection and strategies in rewriting logic. In J. Meseguer, editor, Electronic Notes in Theoretical Computer Science, volume 4. Elsevier Science Publishers, 1996. Proceedings of the First International Workshop on Rewriting Logic and its Applications."},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB7","unstructured":"S. Dietzen and F. Pfenning. A declarative alternative to \u201cassert\u201d in logic programming. In V. Saraswat and K. Ueda, editors, Logic Programming, Proceedings of the 1991 International Symposium, pages 372\u2013386, San Diego, USA, 1991. The MIT Press."},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB8","doi-asserted-by":"crossref","unstructured":"D. R. Hanson and T. A. Proebsting. Dynamic variables. In Programming Language Design and Implementation (PLDI'01), Snowbird, UT, USA, June 2001. ACM.","DOI":"10.1145\/378795.378857"},{"issue":"1\u20134","key":"10.1016\/S1571-0661(04)00298-1_NEWBIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018956702672","article-title":"Warm fusion in Stratego: A case study in the generation of program transformation systems","volume":"29","author":"Johann","year":"2000","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB10","doi-asserted-by":"crossref","unstructured":"H. Kirchner, and P.-E. Moreau. A reflective extension of ELAN. In J. Meseguer, editor, Electronic Notes in Theoretical Computer Science, volume 4. Elsevier Science Publishers, 1996. Proceedings of the First International Workshop on Rewriting Logic and its Applications.","DOI":"10.1016\/S1571-0661(04)00038-6"},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB11","series-title":"Functional Programming Languages and Computer Architecture (FPCA'95)","first-page":"314","article-title":"Warm fusion: Deriving build-catas from recursive definitions","author":"Launchbury","year":"1995"},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB12","doi-asserted-by":"crossref","unstructured":"J. R. Lewis, J. Launchbury, E. Meijer, and M. Shields. Implicit parameters: Dynamic scoping with static types. In Symposium on Principles of Programming Languages (POPL'00), pages 108\u2013118. ACM, January 2000.","DOI":"10.1145\/325694.325708"},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB13","doi-asserted-by":"crossref","unstructured":"P. Maes. Concepts and experiments in computational reflection. SIGPLAN Notices, 22(12):147\u2013155, 1987. Proceedings of OOPSLA'87.","DOI":"10.1145\/38765.38821"},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB14","unstructured":"S. Peyton Jones, A. Tolmach, and T. Hoare. Playing by the rules: rewriting as a practical optimisation technique in GHC. In R. Hinze, editor, 2001 Haskell Workshop, Firenze, Italy, September 2001. ACM SIGPLAN."},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB15","unstructured":"E. Visser. Language independent traversals for program transformation. In J. Jeuring, editor, Workshop on Generic Programming (WGP'00), Ponte de Lima, Portugal, July 2000. Technical Report UU-CS-2000-19, Department of Information and Computing Sciences, Universiteit Utrecht."},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB16","doi-asserted-by":"crossref","unstructured":"E. Visser. A survey of strategies in program transformation systems. In B. Gramlich and S. L. Alba, editors, Workshop on Reduction Strategies in Rewriting and Programming (WRS'01), volume 57 of Electronic Notes in Theoretical Computer Science, Utrecht, The Netherlands, May 2001. Elsevier Science Publishers.","DOI":"10.1016\/S1571-0661(04)00270-1"},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB17","doi-asserted-by":"crossref","unstructured":"E. Visser, Z.-e.-A. Benaissa, and A. Tolmach. Building program optimizers with rewriting strategies. ACM SIGPLAN Notices, 34(1):13\u201326, January 1999. Proceedings of the International Conference on Functional Programming (ICFP'98).","DOI":"10.1145\/291251.289425"},{"key":"10.1016\/S1571-0661(04)00298-1_NEWBIB18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","article-title":"Deforestation: Transforming programs to eliminate trees","volume":"73","author":"Wadler","year":"1990","journal-title":"Theoretical Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002981?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002981?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T06:57:59Z","timestamp":1550213879000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104002981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S1571066104002981"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00298-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}