{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:44:47Z","timestamp":1762458287024},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"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":6499,"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":[[1995,10]]},"DOI":"10.1016\/0304-3975(95)00011-k","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:38:06Z","timestamp":1027604286000},"page":"57-75","source":"Crossref","is-referenced-by-count":45,"title":["On the greatest fixed point of a set functor"],"prefix":"10.1016","volume":"150","author":[{"given":"Ji\u0159\u00ed","family":"Ad\u00e1mek","sequence":"first","affiliation":[]},{"given":"V\u00e1clav","family":"Koubek","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00011-K_BIB1","first-page":"589","article-title":"Free algebras and automata realizations in the language of categories","volume":"15","author":"Ad\u00e1mek","year":"1974","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"10.1016\/0304-3975(95)00011-K_BIB2","series-title":"Proc. FCT","first-page":"199","article-title":"Remarks on fixed points of functors","author":"Ad\u00e1mek","year":"1977"},{"key":"10.1016\/0304-3975(95)00011-K_BIB3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-0000(79)90026-6","article-title":"Least fixed point of a functor","volume":"19","author":"Ad\u00e1mek","year":"1979","journal-title":"J. Comp. System Sci."},{"key":"10.1016\/0304-3975(95)00011-K_BIB4","series-title":"Automata and Algebras in a Category","author":"Ad\u00e1mek","year":"1990"},{"key":"10.1016\/0304-3975(95)00011-K_BIB5","first-page":"445","article-title":"The metric space of infinite trees","volume":"4","author":"Arnold","year":"1980","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(95)00011-K_BIB6","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1137\/0211041","article-title":"Completions of partially ordered sets","volume":"11","author":"Banaschewski","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00011-K_BIB7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","article-title":"Terminal coalgebras in well-founded set theory","volume":"114","author":"Barr","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00011-K_BIB8","first-page":"175","article-title":"Set functors","volume":"12","author":"Koubek","year":"1971","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"10.1016\/0304-3975(95)00011-K_BIB9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-4049(79)90007-0","article-title":"Categorical constructions of free algebras, colimits, and completions of partial algebras","volume":"14","author":"Koubek","year":"1979","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/0304-3975(95)00011-K_BIB10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01110627","article-title":"Fixpoint theorem for complete categories","volume":"103","author":"Lambek","year":"1968","journal-title":"Math. Z."},{"key":"10.1016\/0304-3975(95)00011-K_BIB11","series-title":"Algebraic Approaches to Program Semantics","author":"Manes","year":"1986"},{"key":"10.1016\/0304-3975(95)00011-K_BIB12","article-title":"Categorical algebraic constructions","author":"Reiterman","year":"1976"},{"key":"10.1016\/0304-3975(95)00011-K_BIB13","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","article-title":"The category-theoretical solution of recursive domain equations","volume":"11","author":"Smyth","year":"1983","journal-title":"SIAM J. Comp."},{"key":"10.1016\/0304-3975(95)00011-K_BIB14","first-page":"323","article-title":"Some properties of set functors","volume":"10","author":"Trnkov\u00e1","year":"1969","journal-title":"Comment Math. Univ. Carolinae"},{"key":"10.1016\/0304-3975(95)00011-K_BIB15","first-page":"339","article-title":"Free algebras, input processes and free monads","volume":"16","author":"Trnkov\u00e1","year":"1975","journal-title":"Comment. Math. Univ. Carolinae"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500011K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500011K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:23:37Z","timestamp":1556522617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500011K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["030439759500011K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00011-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}