{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:34Z","timestamp":1761610354531,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3923,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s1571-0661(04)80784-9","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"42-51","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Demandness in Rewriting and Narrowing"],"prefix":"10.1016","volume":"76","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB1","doi-asserted-by":"crossref","unstructured":"M. Alpuente, M. Falaschi, P. Julian, and G. Vidal. Specialization of lazy functional logic programs. In Proc. of PEPM'97. ACM, 1997.","DOI":"10.1145\/258993.259015"},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB2","series-title":"Logic Programming Synthesis and Transformation (LOPSTR'91)","first-page":"318","article-title":"Non-determinism and lazy evaluation in logic progamming","author":"Antoy","year":"1991"},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB3","series-title":"Proc. of the 4th Intl. Conf. On Algebraic and Logic Programming","first-page":"143","article-title":"Definitional trees","author":"Antoy","year":"1992"},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB4","doi-asserted-by":"crossref","unstructured":"S. Antoy. Optimal non-determinstic functional logic computations. In Proc. of the 6th International Conference on Algebaic and Logic Programming (ALP'97), pages 16\u201330. Springer LNCS 1298, 1997.","DOI":"10.1007\/BFb0027000"},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB5","doi-asserted-by":"crossref","unstructured":"S. Antoy. Constructor-based conditional narrowing. In Proc. of the 3rd International Conference on Principles and Practice of Declarative Programming (PPDP'01), pages 199\u2013206, Florence, Italy, Sept. 2001. ACM.","DOI":"10.1145\/773184.773205"},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB6","doi-asserted-by":"crossref","unstructured":"S. Antoy, R. Echahed, and M. Hanus. Parallel evaluation strategies for functional logic languages. In Proc. of the 14th International Conference on Logic Programming (ICLP'97), pages 138\u2013152. MIT Press, 1997.","DOI":"10.7551\/mitpress\/4299.003.0016"},{"issue":"4","key":"10.1016\/S1571-0661(04)80784-9_NEWBIB7","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1145\/347476.347484","article-title":"A needed narrowinig strategy","volume":"47","author":"Antoy","year":"2000","journal-title":"Journal of the ACM"},{"issue":"1","key":"10.1016\/S1571-0661(04)80784-9_NEWBIB8","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)80784-9_NEWBIB9","unstructured":"M. Hanus (ed.). Curry: An Integrated Functional Logic Language. Available at http:\/\/www.informatik.uni-kiel.de\/~curry, 2000."},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB10","series-title":"Computational logic: essays in honour of Alan Robinson","first-page":"395","article-title":"Computations in orthogonal term rewriting systems","author":"Huet","year":"1991"},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB11","doi-asserted-by":"crossref","unstructured":"R. Loogen, F. L\u00f3pez Fraguas, and M. Rodr\u00edguez Artalejo. A demand driven computation strategy for lazy narrowing. In Proc. 5th International Symposium on Programming Language Implementation and Logic Programming(PLILP'93), pages 184\u2013200. Springer LNCS 714, 1993.","DOI":"10.1007\/3-540-57186-8_79"},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB12","unstructured":"S. Lucas. Context-sensitive rewriting strategies. Information and Computation. to appear."},{"issue":"1","key":"10.1016\/S1571-0661(04)80784-9_NEWBIB13","first-page":"1","article-title":"Context-sensitive computations in functional and functional loic programs","volume":"1998","author":"Lucas","year":"1998","journal-title":"Journal of Functional and Logic Programming"},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB14","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)80784-9_NEWBIB15","series-title":"Electronic Notes in Theoretical Computer Science, volume 64","article-title":"Lazy rewriting and context-sensitive rewriting","author":"Lucas","year":"2002"},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0743-1066(92)90024-W","article-title":"Logic programming with functions and predicates: The language BABEL","volume":"12","author":"Moreno-Navarro","year":"1992","journal-title":"Journal of Logic Programming"},{"year":"1977","series-title":"Computing in Systems Described by Equations","author":"O'Donnell","key":"10.1016\/S1571-0661(04)80784-9_NEWBIB17"},{"key":"10.1016\/S1571-0661(04)80784-9_NEWBIB18","unstructured":"S. Peyton Jones and J. Hughes (ed.). Haskell 98: A non-strict, purely functional language. Available at http:\/\/www.haskell.org\/onlinereport\/."},{"issue":"1","key":"10.1016\/S1571-0661(04)80784-9_NEWBIB19","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1006\/inco.1993.1026","article-title":"Programming in equational logic: Beyond strong sequentiality","volume":"104","author":"Sekar","year":"1993","journal-title":"Information and Computation"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807849?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807849?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:36Z","timestamp":1761609996000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104807849"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":19,"alternative-id":["S1571066104807849"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80784-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Demandness in Rewriting and Narrowing","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80784-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}