{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T02:25:22Z","timestamp":1784255122528,"version":"3.55.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"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":3558,"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":[[2003,11]]},"DOI":"10.1016\/s1571-0661(04)80691-1","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"16-34","source":"Crossref","is-referenced-by-count":6,"title":["A Monadic Semantics for Core Curry1 1This work has been supported in part by the National Science Foundation under grants CCR-0110496 and CCR-0218224"],"prefix":"10.1016","volume":"86","author":[{"given":"Andrew","family":"Tolmach","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergio","family":"Antoy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB1","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(04)80782-5","article-title":"Operational semantics for functional logic languages","volume":"76","author":"Albert","year":"2002","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Antoy S., Definitional trees, in: Proc. 3rd International Conference on Algebraic and Logic Programming (ALP'92) (1992), pp. 143\u2013157.","DOI":"10.1007\/BFb0013825"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB3","article-title":"Typed logical variables in Haskell","volume":"41","author":"Claessen","year":"2001","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB4","unstructured":"Hanus M., editor, \u201cCurry: An Integrated Functional Logic Language,\u201d Available at http:\/\/www.informatik.uni-kiel.de\/~mh\/curry\/."},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB5","unstructured":"Hanus M., A unified computation model for declarative programming, in: Proc. 1997 Joint Conference on Declarative Programming (APPIA-GULPPRODE'97), 1997, pp. 9\u201324."},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Hanus M., A unified computation model for functional and logic programming, in: Proc. POPL'97, 24st ACM Symp. on Principles of Programming Languages, 1997, pp. 80\u201393.","DOI":"10.1145\/263699.263710"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB7","series-title":"Third Fuji International Symp. on Functional and Logic Programming (FLOPS'98)","first-page":"98","article-title":"Prological features in a functional setting \u2014 axioms and implementations","author":"Hinze","year":"1998"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1017\/S0956796800000277","article-title":"Tail recursion without space leaks","volume":"2","author":"Jones","year":"1992","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Labra Gayo, J. E., J. M. Cueva Lovelle, M. C. Luengo D\u00edez and A. C. del R\u00edo, Specification of logic programming languages from reusable semantic building blocks, in: Proc. International Workshop on Functional and (Constraint) Logic Programming, 2001.","DOI":"10.1016\/S1571-0661(04)80352-9"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB10","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","article-title":"The mechanical evaluation of expressions","volume":"6","author":"Landin","year":"1964","journal-title":"Computer J"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB11","doi-asserted-by":"crossref","unstructured":"Launchbury J., A natural semantics for lazy evaluation, in: Proc. POPL '93, 20th Annual ACM Symp. on Principles of Programming Languages, 1993, pp. 144\u2013154.","DOI":"10.1145\/158511.158618"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Liang S., P. Hudak and M. Jones, Monad transformers and modular interpreters, in: Proc. 22nd ACM Symp. on Principles of Programming Languages, 1995, pp. 333\u2013343.","DOI":"10.1145\/199448.199528"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB13","series-title":"Computer Programming and Formal Systems","first-page":"33","article-title":"A basis for a mathematical theory of computations","author":"McCarthy","year":"1963"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB14","series-title":"\u201cPurely Functional Data Structures,\u201d","author":"Okasaki","year":"1998"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB15","unstructured":"Papaspyrou, N. S., A resumption monad transformer and its applications in the semantics of concurrency, in: Proc. 3rd Panhellenic Logic Symposium, 2001."},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB16","series-title":"\u201cDenotational Semantics: A Methodology for Language Development,\u201d","author":"Schmidt","year":"1986"},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB17","unstructured":"Seres S., M. Spivey and T. Hoare, Algebra of logic programming, in: Proc. International Conference on Logic Programming (ICLP'99), 1999, pp. 184\u2013199."},{"key":"10.1016\/S1571-0661(04)80691-1_NEWBIB18","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)80691-1_NEWBIB19","doi-asserted-by":"crossref","unstructured":"Wadler P., The essence of functional programming, in: Proc. POPL'92, Nineteenth Annual ACM Symp. on Principles of Programming Languages, 1992, pp. 1\u201314.","DOI":"10.1145\/143165.143169"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806911?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806911?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T11:42:45Z","timestamp":1682768565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S1571066104806911"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80691-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}