{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:13Z","timestamp":1761610093591,"version":"build-2065373602"},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":6784,"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":[[1995]]},"DOI":"10.1016\/s1571-0661(04)80016-1","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T15:29:25Z","timestamp":1096385365000},"page":"290-301","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["A fully abstract semantics for a nondeterministic functional language with monadic types"],"prefix":"10.1016","volume":"1","author":[{"given":"Alan","family":"Jeffrey","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB1","unstructured":"ISO 8807. LOTOS\u2013\u2013A formal description technique based on the temporal ordering of observational behaviour, 1989."},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB2","series-title":"Declarative Programming","article-title":"The lazy lambda calculus","author":"Abramsky","year":"1989"},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"Abramsky","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB4","unstructured":"Matthew Hennessy. A denotational model for higher-order processes. Technical Report 6\/92, University of Sussex, 1992."},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB5","unstructured":"Douglas Howe. Proving congruence of simulation orderings in functional languages. Unpublished manuscript, 1989."},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB6","unstructured":"Douglas J. Howe. Equality in lazy computation systems. In Proc. LICS 89, pages 198\u2013203, 1989."},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB7","unstructured":"Alan Jeffrey. A fully abstract semantics for a higher-order functional conurrent language. Technical report, University of Sussex, 1994. In preparation."},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract semantics of typed \u03bb-calculi","volume":"4","author":"Milner","year":"1977","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computation and mondad","volume":"93","author":"Moggi","year":"1991","journal-title":"Inform, and Computing"},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB10","unstructured":"C.-H. L. Ong. Non-determinism in a functional setting. In Proc. LICS 93, pages 275\u2013286. IEEE Computer Soc. Press, 1993."},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB11","unstructured":"C.-H. Luke Ong. The Lazy Lambda Calculus: An Investigation into the Foundations of Functional Programming. PhD thesis, Imperial College, London University, 1988."},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB13","unstructured":"J. H. Reppy. A higher-order concurrent langauge. In Proc. SIGPLAN 91, pages 294\u2013305, 1991."},{"key":"10.1016\/S1571-0661(04)80016-1_NEWBIB14","unstructured":"J. H. Reppy. Higher-Order Concurrency. Ph.D thesis, Cornell University, 1992."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800161?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800161?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:03:09Z","timestamp":1761609789000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104800161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":14,"alternative-id":["S1571066104800161"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80016-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A fully abstract semantics for a nondeterministic functional language with monadic types","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)80016-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}