{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:42Z","timestamp":1761610422259,"version":"build-2065373602"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5688,"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":[[1998]]},"DOI":"10.1016\/s1571-0661(05)80704-2","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"246-266","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["Similarity and Bisimilarity for Countable Non-Determinism and Higher-Order Functions (Extended Abstract)"],"prefix":"10.1016","volume":"10","author":[{"given":"S\u00f8ren B.","family":"Lassen","sequence":"first","affiliation":[]},{"given":"Corin S.","family":"Pitcher","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80704-2_BIB1","series-title":"Research Topics in Functional Programming, The UT Year of Programming Series","first-page":"65","article-title":"The lazy lambda calculus","author":"Abramsky","year":"1990"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB2","series-title":"Handbook of Mathematical Logic, number 90 in Studies in Logic. North_Holland Publishing Company","article-title":"An introduction to inductive definitions","author":"Aczel","year":"1977"},{"issue":"4","key":"10.1016\/S1571-0661(05)80704-2_BIB3","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1145\/6490.6494","article-title":"Countable nondeterminism and random assignment","volume":"33","author":"Apt","year":"1986","journal-title":"Journal of the ACM"},{"year":"1997","series-title":"The Algebra of Programming","author":"Bird","key":"10.1016\/S1571-0661(05)80704-2_BIB4"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB5","series-title":"Symposium on Theoretical Aspects of Computer Science, Sendai, Japan, volume 1281 of Lecture Notes in Computer Science","article-title":"Operational interpretations of recursive types in an operational setting (summary)","author":"Birkedal","year":"1997"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB6","first-page":"83","article-title":"Inductive definitions, semantics and abstract interpretations","author":"Cousot","year":"1992","journal-title":"In Conference Record of the 19th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB7","series-title":"Distinguished Dissertations in Computer Science","article-title":"Functional Programming and Input\/Output","author":"Gordon","year":"1994"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB8","series-title":"BRICS Notes Series NS-95-3, Department of Computer Science, University of Aarhus","article-title":"Bisimilarity as a theory of functional programming","author":"Gordon","year":"1995"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3573-9_6","article-title":"A tutorial on co-induction and functional programming","author":"Gordon","year":"1995"},{"year":"1992","series-title":"Semantics of Programming Languages: Structures and Techniques","author":"Gunter","key":"10.1016\/S1571-0661(05)80704-2_BIB10"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB11","first-page":"198","article-title":"Equality in lazy computation systems","author":"Howe","year":"1989"},{"issue":"2","key":"10.1016\/S1571-0661(05)80704-2_BIB12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/inco.1996.0008","article-title":"Proving congruence of bisimulation in functional programming languages","volume":"124","author":"Howe","year":"1996","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB13","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1017\/S0960129597002417","article-title":"Action semantics reasoning about functional programs","author":"Lassen","year":"1997","journal-title":"Math Struct. in Comp. Science"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB14","series-title":"Higher Order Operational Techniques in Semantics, Publications of the Newton Institute","first-page":"91","article-title":"Relational reasoning about contexts","author":"Lassen","year":"1998"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB15","unstructured":"S. B. Lassen. Relational Reasoning about Functions and Nondeterminism. PhD thesis, Department of Computer Science, University of Aarhus, February 1998. URL http:\/\/WWW.cl.cam.ac.uk\/users\/sbl21\/docs\/phd.html."},{"key":"10.1016\/S1571-0661(05)80704-2_BIB16","series-title":"International Series in Computer Science","article-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"issue":"1","key":"10.1016\/S1571-0661(05)80704-2_BIB17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computations and monads","volume":"93","author":"Moggi","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB18","series-title":"Licentiate thesis, Chalmers University of Technology and University of G\u00f6teborg","article-title":"Natural semantics for non-determinism","author":"Moran","year":"1994"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB19","series-title":"Number 26 in Cambridge Tracts in Theoretical Computer Science","article-title":"Action Semantics","author":"Mosses","year":"1992"},{"year":"1989","series-title":"Classical Recursion Theory, volume 125 of Studies in Logic","author":"Odifreddi","key":"10.1016\/S1571-0661(05)80704-2_BIB20"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB21","article-title":"Concurrent lambda calculus, and a general pre-congruence theorem for applicative bisimulation","author":"Ong","year":"1992","journal-title":"Preliminary version"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB22","first-page":"275","article-title":"Non-determinism in a functional setting","author":"Ong","year":"1993"},{"year":"1998","series-title":"Functional Programming and Erratic Non-Determinism","author":"Pitcher","key":"10.1016\/S1571-0661(05)80704-2_BIB23"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB24","unstructured":"A. M. Pitts. Parametric polymorphism and operational equivalence. Preliminary version. In this volume."},{"issue":"4","key":"10.1016\/S1571-0661(05)80704-2_BIB25","first-page":"589","article-title":"A note on logical relations between semantics and syntax","volume":"5","author":"Pitts","year":"1997","journal-title":"Logic Journal of the Interest Group in Pure and Applied Logics"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB26","series-title":"Semantics and Logics of Computation.","article-title":"Operationally-based theories of program equivalence","author":"Pitts","year":"1997"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB27","series-title":"URL http:\/\/hypatia.dcs.qmw.ac.uk\/sites\/other\/domain.notes.other\/","article-title":"Domains","author":"Plotkin","year":"1983"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB28","series-title":"Automata, Languages and Programming, volume 443 of Lecture Notes in Computer Science","first-page":"765","article-title":"Operational and algebraic semantics for Facile: A symmetric integration of concurrent and functional programming","author":"Prasad","year":"1990"},{"year":"1967","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","key":"10.1016\/S1571-0661(05)80704-2_BIB29"},{"key":"10.1016\/S1571-0661(05)80704-2_BIB30","series-title":"Technical Report PRG-67, Programming Resarch Group","article-title":"Two papers on CSP","author":"Roscoe","year":"1988"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105807042?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105807042?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:09:09Z","timestamp":1761610149000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105807042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":30,"alternative-id":["S1571066105807042"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80704-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Similarity and Bisimilarity for Countable Non-Determinism and Higher-Order Functions (Extended Abstract)","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(05)80704-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}