{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T06:50:11Z","timestamp":1719903011896},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1016\/j.ic.2013.02.003","type":"journal-article","created":{"date-parts":[[2013,2,28]],"date-time":"2013-02-28T23:30:50Z","timestamp":1362094250000},"page":"83-118","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["How iterative reflections of monads are constructed"],"prefix":"10.1016","volume":"225","author":[{"given":"Ji\u0159\u00ed","family":"Ad\u00e1mek","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Velebil","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2013.02.003_br0010","series-title":"Logic Colloquium \u02bc73","first-page":"175","article-title":"Monadic computation and iterative algebraic theories","volume":"vol. 80","author":"Elgot","year":"1975"},{"key":"10.1016\/j.ic.2013.02.003_br0020","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0022-0000(78)90024-7","article-title":"On the algebraic structure of rooted trees","volume":"16","author":"Elgot","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.ic.2013.02.003_br0030","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1017\/S0960129506005706","article-title":"Iterative algebras at work","volume":"16","author":"Ad\u00e1mek","year":"2006","journal-title":"Math. Structures Comput. Sci."},{"key":"10.1016\/j.ic.2013.02.003_br0040","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1016\/j.ic.2005.11.005","article-title":"Terminal coalgebras and free iterative theories","volume":"204","author":"Ad\u00e1mek","year":"2006","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.ic.2013.02.003_br0050","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1017\/S0960129509990326","article-title":"Iterative reflections of monads","volume":"20","author":"Ad\u00e1mek","year":"2010","journal-title":"Math. Structures Comput. Sci."},{"key":"10.1016\/j.ic.2013.02.003_br0060","series-title":"Proc. Foundations of Software Science and Computation Structures (FoSSaCS)","first-page":"152","article-title":"A description of iterative reflections of monads","volume":"vol. 5504","author":"Ad\u00e1mek","year":"2009"},{"key":"10.1016\/j.ic.2013.02.003_br0070","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0022-4049(93)90035-R","article-title":"Introduction to extensive and distributive categories","volume":"84","author":"Carboni","year":"1993","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.ic.2013.02.003_br0080","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(83)90014-2","article-title":"Iterative algebras","volume":"25","author":"Nelson","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ic.2013.02.003_br0090","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(80)90056-0","article-title":"Unique fixed points vs. least fixed points","volume":"12","author":"Tiuryn","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ic.2013.02.003_br0100","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0022-0000(79)90032-1","article-title":"Regular trees and the free iterative theory","volume":"18","author":"Ginali","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.ic.2013.02.003_br0110","series-title":"Locally Presentable and Accessible Categories","author":"Ad\u00e1mek","year":"1994"},{"key":"10.1016\/j.ic.2013.02.003_br0120","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2004.05.003","article-title":"Completely iterative algebras and completely iterative monads","volume":"196","author":"Milius","year":"2005","journal-title":"Inform. and Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540113000175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540113000175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T10:25:39Z","timestamp":1539858339000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540113000175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":12,"alternative-id":["S0890540113000175"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2013.02.003","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2013,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"How iterative reflections of monads are constructed","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2013.02.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}