{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:41Z","timestamp":1761610361857,"version":"build-2065373602"},"reference-count":23,"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,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":3942,"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)80782-5","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Operational Semantics for Functional Logic Languages"],"prefix":"10.1016","volume":"76","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hanus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Huch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Oliver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB1","doi-asserted-by":"crossref","unstructured":"E. Albert, S. Antoy, and G. Vidal. Measuring the Effectiveness of Partial Evaluation in Founctiona Logic Languages. In Proc. of the 10th Int'l Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'00), pages 103\u2013124. Springer LNCS 2024, 2001.","DOI":"10.1007\/3-540-45142-0_7"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB2","unstructured":"E. Albert, M. Hanus, F. Huch, J. Oliver, and G. Vidal. Operational Semantics for Lazy Functional Logic Programs. In Proc. of Workshop on Reduction Strategies in Rewriting and Programming (WRS'02), pages 97\u2013112, 2002."},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB3","doi-asserted-by":"crossref","unstructured":"E. Albert and G. Vidal. Symbolic Profiling of Multi-Paradigm Declarative Languages. In Proc. of Int'l Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'01), pages 148\u2013167. Springer LNCS 2372, 2002.","DOI":"10.1007\/3-540-45607-4_9"},{"key":"10.1016\/S1571-0661(04)80782-5_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 2001), pages 199\u2013205. ACM Press, 2001.","DOI":"10.1145\/773184.773205"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB5","doi-asserted-by":"crossref","unstructured":"S. Antoy and M. Hanus. Compiling Multi-Paradigm Declarative Programs into Prolog. In Proc. of the Int'l Workshop on Frontiers of Combining Systems (FroCoS'2000), pages 171\u2013185. Springer LNCS 1794, 2000.","DOI":"10.1007\/10720084_12"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB6","doi-asserted-by":"crossref","unstructured":"E. B\u00f6rger. A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control. In Proc. of the 3rd Int'l Workshop on Computer Science Logic (CSL'89), pages 36-64. Springer LNCS 440, 1990.","DOI":"10.1007\/3-540-52753-2_31"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB7","doi-asserted-by":"crossref","unstructured":"E. B\u00f6rger. A logical operational semantics of full Prolog. Part II: Built-in predicates for database manipulations. In Proc. of Mathematical Foundations of Computer Science (MFCS'90), pages 1\u201314. Springer LNCS 452, 1990.","DOI":"10.1007\/BFb0029592"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0743-1066(88)90007-6","article-title":"Denotational and Operational Semantics for Prolog","volume":"5","author":"Debray","year":"1988","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB9","unstructured":"R. Echahed and J. Janodet. Admissible Graph Rewriting and Narrowing. In Proc. of the 1998 Joint Int'l Conference and Symposium on Logic Programming (JICSLP'98), pages 325\u2013340. MIT Press, 1998."},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","article-title":"An Approach to Declarative Programming based on a Rewriting Logic","volume":"40","author":"Gonz\u00e1lez-Moreno","year":"1999","journal-title":"Journal of Logic Programming"},{"issue":"6","key":"10.1016\/S1571-0661(04)80782-5_NEWBIB11","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1017\/S0960129500070122","article-title":"Term Graph Narrowing","volume":"6","author":"Habel","year":"1996","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB12","doi-asserted-by":"crossref","unstructured":"M. Hanus. A Unified Computation Model for Founctional and Logic Programming. In Proc. of the 24th ACM Symp. on Principles of Programming Languages (POPL'97), pages 80\u201393. ACM, New York, 1997.","DOI":"10.1145\/263699.263710"},{"issue":"1","key":"10.1016\/S1571-0661(04)80782-5_NEWBIB13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1017\/S0956796899003330","article-title":"Higher-Order Narrowing with Definitional Trees","volume":"9","author":"Hanus","year":"1999","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB14","unstructured":"M. Hanus (ed.). Curry: An Integrated Functional Logic Language. Available at: http:\/\/www.informatik.uni-kiel.de\/~mh\/curry\/."},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB15","doi-asserted-by":"crossref","unstructured":"T. Hortal\u00e1-Gonz\u00e1lez and Ull\u00e1n. An Abstact Machine Based System for a Lazy Narrowing Calculus. In Proc. of the 5th Int'l Symp. on Functional and Logic Programming (FLOPS 2001), pages 216\u2013232. Springer LNCS 2024, 2001.","DOI":"10.1007\/3-540-44716-4_14"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB16","unstructured":"N.D. Jones and A. Mycroft. Stepwise Development of Operational and Denotational Semantics for Prolog. In S. T\u00e1rnlund, editor, Proc. of the 2nd Int'l Conf. on Logic Programming (ICLP'84), pages 281\u2013288, 1984."},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB17","doi-asserted-by":"crossref","unstructured":"J. Launchbury. A Natural Semantics for Lazy Evaluation. In Proc. of the ACM Symp. on Principles of Programming Languages (POPL'93), pages 144\u2013154. ACM Press, 1993.","DOI":"10.1145\/158511.158618"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB18","doi-asserted-by":"crossref","unstructured":"F. L\u00f3per-Fraguas and J. S\u00e1nchez-Hern\u00e1ndez. TOY: A Multiparadigm Declarative System. In Proc. of the 10th Int'l Conf. on Rewriting Techniques and Applications (RTA'99), pages 244\u2013247. Springer LNCS 1631, 1999.","DOI":"10.1007\/3-540-48685-2_19"},{"issue":"2","key":"10.1016\/S1571-0661(04)80782-5_NEWBIB19","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1145\/244795.244802","article-title":"Formally Based Profiling for Higher-Order Functional Languages","volume":"19","author":"Sansom","year":"1997","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"10.1016\/S1571-0661(04)80782-5_NEWBIB20","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1017\/S0956796897002712","article-title":"Deriving a Lazy Abstract Machine","volume":"7","author":"Sestoft","year":"1997","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB21","doi-asserted-by":"crossref","unstructured":"G. Vidal. Cost-Augmented Narrowing-Driven Specialization. In Proc. of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'02), pages 52\u201362. ACM Press, 2002.","DOI":"10.1145\/503032.503037"},{"key":"10.1016\/S1571-0661(04)80782-5_NEWBIB22","article-title":"Higher-Order Extensions to Prolog \u2013 Are they needed?","volume":"volume 10","author":"Warren","year":"1982"},{"year":"1983","series-title":"An Abstract Prolog Instruction Set. Technical note 309","author":"Warren","key":"10.1016\/S1571-0661(04)80782-5_NEWBIB23"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807825?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807825?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:46Z","timestamp":1761610006000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104807825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":23,"alternative-id":["S1571066104807825"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80782-5","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":"Operational Semantics for Functional Logic Languages","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)80782-5","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"}]}}