{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:30Z","timestamp":1761611070723,"version":"3.30.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7106,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0304-3975(94)90014-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"195-219","source":"Crossref","is-referenced-by-count":32,"title":["A co-induction principle for recursively defined domains"],"prefix":"10.1016","volume":"124","author":[{"given":"Andrew M","family":"Pitts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90014-0_BIB1","series-title":"Research Topics in Functional Programming","first-page":"65","article-title":"The lazy lambda calculus","author":"Abramsky","year":"1990"},{"key":"10.1016\/0304-3975(94)90014-0_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/inco.1991.9999","article-title":"A domain equation for bisimulation","volume":"92","author":"Abramsky","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)90014-0_BIB3","doi-asserted-by":"crossref","unstructured":"S. Abramsky and C.-H.L. Ong, Full abstraction in the lazy lambda calculus, Inform. and Comput., to appear.","DOI":"10.1006\/inco.1993.1044"},{"year":"1988","series-title":"Introduction to Functional Programming","author":"Bird","key":"10.1016\/0304-3975(94)90014-0_BIB4"},{"key":"10.1016\/0304-3975(94)90014-0_BIB5","series-title":"Proc. 1990 Como Category Theory Conf.","first-page":"95","article-title":"Algebraically complete categories","volume":"Vol. 1488","author":"Freyd","year":"1991"},{"key":"10.1016\/0304-3975(94)90014-0_BIB6","doi-asserted-by":"crossref","unstructured":"D. Howe, Equality in lazy computation systems, pp.198\u2013203 in [8]","DOI":"10.1109\/LICS.1989.39174"},{"year":"1991","series-title":"Report on the Programming Language Haskell: Version 1.1","key":"10.1016\/0304-3975(94)90014-0_BIB7"},{"year":"1989","series-title":"Proc. 4th IEEE Ann. Symp. on Logic in Computer Science","key":"10.1016\/0304-3975(94)90014-0_BIB8"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/0304-3975(94)90014-0_BIB9"},{"key":"10.1016\/0304-3975(94)90014-0_BIB10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(91)90033-X","article-title":"Co-induction in relational semantics","volume":"87","author":"Milner","year":"1991","journal-title":"Theoret. Comput. Sci."},{"year":"1990","series-title":"The Definition of Standard ML","author":"Milner","key":"10.1016\/0304-3975(94)90014-0_BIB11"},{"key":"10.1016\/0304-3975(94)90014-0_BIB12","doi-asserted-by":"crossref","unstructured":"E. Moggi Computational lambda-calculus and monads, 14\u201323 in [8]","DOI":"10.1109\/LICS.1989.39155"},{"year":"1989","series-title":"An Abstract View of Programming Languages","author":"Moggi","key":"10.1016\/0304-3975(94)90014-0_BIB13"},{"key":"10.1016\/0304-3975(94)90014-0_BIB14","first-page":"59","article-title":"Fixpoint induction and proofs of program properties","volume":"5","author":"Park","year":"1970","journal-title":"Mach. Intell."},{"year":"1991","series-title":"ML for the Working Programmer","author":"Paulson","key":"10.1016\/0304-3975(94)90014-0_BIB15"},{"key":"10.1016\/0304-3975(94)90014-0_BIB16","series-title":"Proc. 8th IEEE Ann. Symp. on Logic in Computer Science","first-page":"86","article-title":"Relational properties of recursively defined datatypes","author":"Pitts","year":"1993"},{"key":"10.1016\/0304-3975(94)90014-0_BIB17","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","article-title":"A powerdomain construction","volume":"5","author":"Plotkin","year":"1976","journal-title":"SIAM J. Comput."},{"year":"1981","author":"Plotkin","key":"10.1016\/0304-3975(94)90014-0_BIB18"},{"year":"1985","author":"Plotkin","key":"10.1016\/0304-3975(94)90014-0_BIB19"},{"key":"10.1016\/0304-3975(94)90014-0_BIB20","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","article-title":"The category-theoretic solution of recursive domain equations","volume":"11","author":"Smyth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90014-0_BIB21","series-title":"Semantics of Data Types","first-page":"109","article-title":"Using information systems to solve recursive domain equations effectively","volume":"Vol. 173","author":"Winskel","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T21:55:30Z","timestamp":1733522130000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0304397594900140"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90014-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}