{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:31:56Z","timestamp":1720625516278},"reference-count":24,"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)00265-8","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"1-16","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Evaluation Strategies for Functional Logic Programming"],"prefix":"10.1016","volume":"57","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB1","series-title":"Logic Programming Synthesis and Transformation (LOPSTR'91)","first-page":"318","article-title":"Non-determinism and lazy evaluation in logic programming","author":"Antoy","year":"1991"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB2","doi-asserted-by":"crossref","unstructured":"S. Antoy. Definitional trees. In Proc. of the 4th Intl. Conf. on Algebraic and Logic Programming, pages 143\u2013157. Springer LNCS 632, 1992.","DOI":"10.1007\/BFb0013825"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB3","doi-asserted-by":"crossref","unstructured":"S. Antoy. Optimal non-deterministic functional logic computations. In Proc. of the 6th International Conference on Algebraic and Logic Programming (ALP'97), pages 16\u201330. Springer LNCS 1298, 1997.","DOI":"10.1007\/BFb0027000"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB4","doi-asserted-by":"crossref","unstructured":"S. Antoy. Constructor-based conditional narrowing. In Proc. of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'01), pages 199\u2013205, Florence, Italy, Sept. 2001.","DOI":"10.1145\/773184.773205"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB5","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)00265-8_NEWBIB6","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1145\/347476.347484","article-title":"A needed narrowing strategy","volume":"47","author":"Antoy","year":"2000","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB7","doi-asserted-by":"crossref","unstructured":"S. Antoy and A. Tolmach. Typed higher-order narrowing without higher-order strategies. In 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99), volume 1722, pages 335\u2013350, Tsukuba, Japan, 11 1999. Springer LNCS.","DOI":"10.1007\/10705424_22"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB8","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"issue":"3","key":"10.1016\/S1571-0661(04)00265-8_NEWBIB9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","article-title":"Conditional rewrite rules: Confluence and termination","volume":"32","author":"Bergstra","year":"1986","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB10","series-title":"Introduction to Functional Programming","author":"Bird","year":"1988"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB11","series-title":"Handbook of Theoretical Computer Science B: Formal Methods and Semantics, chapter 6","first-page":"243","article-title":"Rewrite systems","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB12","unstructured":"J. C. Gonz\u00e1lez-Moreno. A correctness proof for Warren's HO into FO translation. In Proc. GULP' 93, pages 569\u2013585, Gizzeria Lido, IT, Oct. 1993."},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB13","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","article-title":"The Integration of Functions into Logic Programming: From Theory to Practice","volume":"19&20","author":"Hanus","year":"1994","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"10.1016\/S1571-0661(04)00265-8_NEWBIB14","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)00265-8_NEWBIB15","doi-asserted-by":"crossref","unstructured":"M. Hanus and C. Prehofer. Higher-order narrowing with definitional trees. In Proc. 7th International Conference on Rewriting Techniques and Applications (RTA'96), pages 138\u2013152. Springer LNCS 1103, 1996.","DOI":"10.1007\/3-540-61464-8_48"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB16","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)00265-8_NEWBIB17","series-title":"Handbook of Logic in Computer Science, Vol. II","first-page":"1","article-title":"Term Rewriting Systems","author":"Klop","year":"1992"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB18","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)00265-8_NEWBIB19","doi-asserted-by":"crossref","unstructured":"K. Nakahara, A. Middeldorp, and T. Ida. A complete narrowing calculus for higher-order functional logic programming. In Proc. 7th International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP'95), pages 97\u2013114. Springer LNCS 982, 1995.","DOI":"10.1007\/BFb0026816"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB20","series-title":"Computing in Systems Described by Equations","author":"O'Donnell","year":"1977"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB21","series-title":"The Craft of Prolog","author":"O'Keefe","year":"1990"},{"issue":"1","key":"10.1016\/S1571-0661(04)00265-8_NEWBIB22","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"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB23","doi-asserted-by":"crossref","unstructured":"F. van Raamsdonk. Higher-order rewriting. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA '99), pages 220\u2013239. Springer LNCS 1631, 99.","DOI":"10.1007\/3-540-48685-2_17"},{"key":"10.1016\/S1571-0661(04)00265-8_NEWBIB24","series-title":"Machine Intelligence 10","first-page":"441","article-title":"Higher-order extensions to PROLOG: are they needed?","author":"Warren","year":"1982"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002658?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002658?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T11:25:35Z","timestamp":1705058735000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104002658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":24,"alternative-id":["S1571066104002658"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00265-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}