{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:32:00Z","timestamp":1720625520659},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"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":4258,"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,12]]},"DOI":"10.1016\/s1571-0661(04)00267-1","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T05:34:35Z","timestamp":1075959275000},"page":"41-63","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Just-in-time"],"prefix":"10.1016","volume":"57","author":[{"given":"Jaco","family":"van de Pol","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB1","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB2","doi-asserted-by":"crossref","DOI":"10.1142\/S0129054101000412","article-title":"Rewriting with strategies in ELAN: a functional semantics","author":"Borovansk\u00fd","year":"2001","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"10.1016\/S1571-0661(04)00267-1_NEWBIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/(SICI)1097-024X(200003)30:3<259::AID-SPE298>3.0.CO;2-Y","article-title":"Efficient annotated terms","volume":"30","author":"van den Brand","year":"2000","journal-title":"Software \u2014 Practice and Experience"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB4","doi-asserted-by":"crossref","unstructured":"M.G.J. van den Brand, P. Klint, and P.A. Olivier. Compilation and memory management for ASF+SDF. In J\u00e4hnichenS., editor, 8th Int. Conf. on Compiler construction CC'99, volume 1575 of LNCS, pages 198\u2013213. Springer, 1999.","DOI":"10.1007\/978-3-540-49051-7_14"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB5","doi-asserted-by":"crossref","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u00ed-Oliet, J. Meseguer, and J.F. Quesada. The Maude system. In P. Narendran and M. Rusinowitch, editors, Proc. of the 10th Int. Conf. on Rewriting Techniques and Applications (RTA-99), volume 1631 of LNCS, pages 240\u2013243. Springer, 1999.","DOI":"10.1007\/3-540-48685-2_18"},{"issue":"3","key":"10.1016\/S1571-0661(04)00267-1_NEWBIB6","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1145\/291889.291903","article-title":"Within ARM's reach: Compilation of left-linear rewrite systems via minimal rewrite systems","volume":"20","author":"Fokkink","year":"1998","journal-title":"ACM Trans. on Programming Languages and Systems"},{"issue":"1","key":"10.1016\/S1571-0661(04)00267-1_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 Trans. on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB8","series-title":"22th Int. Symp. on Mathematical Foundations of Computer Science (MFCS'97) LNCS 1295","first-page":"249","article-title":"Simulation as a correct transformation of rewrite systems","author":"Fokkink","year":"1997"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB9","series-title":"Software Engineering with OBJ: algebraic specification in action","article-title":"Introducing OBJ","author":"Goguen","year":"2000"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB10","doi-asserted-by":"crossref","unstructured":"J.F. Groote and J.C. van de Pol. Equational binary decision diagrams. In M. Parigot and A. Voronkov, editors, Logic for Programming and Reasoning, LPAR2000, volume 1955 of LNAI, pages 161\u2013178. Springer, 2000.","DOI":"10.1007\/3-540-44404-1_11"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB11","series-title":"Handbook of Logic in Computer Science, volume 2","article-title":"Term rewriting systems","author":"Klop","year":"1992"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB12","unstructured":"S. Lucas. Computational properties of term rewriting with strategy annotations. In Proc. of Primeras Jornadas sobre Programaci\u00f3n y Lenguajes (PROLE'01), Universidad de Castilla-La Mancha, 2001 (to appear)."},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB13","doi-asserted-by":"crossref","unstructured":"S. Lucas. Termination of rewriting with strategy annotations. In R. Nieuwenhuis and A. Voronkov, editors, Proc. of 8th Int. Conf. on Logic for Programming, Artificial Intelligence and Reasoning, LPAR'01, volume 2250 of LNAI. Springer, 2001 (to appear).","DOI":"10.1007\/3-540-45653-8_46"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB14","doi-asserted-by":"crossref","unstructured":"S.P. Luttik and E. Visser. Specification of rewriting strategies. In M. P.A. Sellink, editor, Second International Conference on the Theory and Practice of Algebraic Specification (ASF+SDF'97), Electronic Workshops in Computing. Springer, 1997.","DOI":"10.14236\/ewic\/AL1997.9"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB15","unstructured":"T. Nagaya. Reduction Strategies for Term Rewriting Systems. PhD thesis, JAIST, Japan, 1999."},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB16","unstructured":"A.T. Nakagawa, T. Sawada, and K. Futatsugi. CafeOBJ user's manual, version 1.3. Available via http:\/\/www.ipa.go.jp\/STC\/CafeP\/index-e.html."},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB17","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, The 3rd Int. W. on Rewriting Logic and its Applications (WRLA 2000), volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier, 2001.","DOI":"10.1016\/S1571-0661(05)80143-4"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB18","doi-asserted-by":"crossref","unstructured":"K. Ogata and K. Futatsugi. Implementation of term rewritings with the evaluation strategy. In H. Glaser, P. Hartel, and H. Kuchen, editors, 9th Int. Symp. on Programming Languages: Implmentations, Logics, and Programs, PLILP97, volume 1292 of LNCS, pages 225\u2013239, 1997.","DOI":"10.1007\/BFb0033847"},{"key":"10.1016\/S1571-0661(04)00267-1_NEWBIB19","unstructured":"E. Visser. The Stratego tutorial and reference manual. Available via http:\/\/www.stratego-language.org\/."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002671?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002671?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T08:28:58Z","timestamp":1585556938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104002671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":19,"alternative-id":["S1571066104002671"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00267-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}