{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:11:22Z","timestamp":1775790682793,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":7351,"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":[[1993,6]]},"DOI":"10.1016\/0304-3975(93)90076-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"299-315","source":"Crossref","is-referenced-by-count":166,"title":["Terminal coalgebras in well-founded set theory"],"prefix":"10.1016","volume":"114","author":[{"given":"Michael","family":"Barr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90076-6_BIB1","series-title":"Category Theory and Computer Science","first-page":"357","article-title":"A final coalgebra theorem","volume":"Vol. 389","author":"Aczel","year":"1989"},{"key":"10.1016\/0304-3975(93)90076-6_BIB2","series-title":"Triples, Toposes and Theories","author":"Barr","year":"1985"},{"key":"10.1016\/0304-3975(93)90076-6_BIB3","series-title":"Category Theory for Computing Science","author":"Barr","year":"1990"},{"key":"10.1016\/0304-3975(93)90076-6_BIB4","series-title":"Algebraically complete categories","author":"Freyd","year":"1991"},{"key":"10.1016\/0304-3975(93)90076-6_BIB5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.4153\/CMB-1970-065-6","article-title":"Subequalizers","volume":"13","author":"Lambek","year":"1970","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0304-3975(93)90076-6_BIB6","article-title":"Accessible Categories","volume":"Vol. 104","author":"Makkai","year":"1990"},{"key":"10.1016\/0304-3975(93)90076-6_BIB7","unstructured":"N.P. Mendler, P. Panangaden and R.L. Constable, Infinite objects in type theory, in: Proc. First Annual IEEE Symp. on Logic in Computer Science, 249\u2013257."},{"key":"10.1016\/0304-3975(93)90076-6_BIB8","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":"1983","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900766?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900766?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:23:11Z","timestamp":1555129391000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593900766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["0304397593900766"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90076-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}