{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:27Z","timestamp":1759638087116},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354628"},{"type":"electronic","value":"9783540354642"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780274_22","type":"book-chapter","created":{"date-parts":[[2006,6,20]],"date-time":"2006-06-20T10:50:32Z","timestamp":1150800632000},"page":"420-448","source":"Crossref","is-referenced-by-count":1,"title":["Uniform Functors on Sets"],"prefix":"10.1007","author":[{"given":"Lawrence S.","family":"Moss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"CSLI Lecture Notes","volume-title":"Non-Well-Founded Sets","author":"P. Aczel","year":"1988","unstructured":"Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, vol.\u00a014. CSLI Publications, Stanford (1988)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00728-4","volume":"300","author":"P. Aczel","year":"2003","unstructured":"Aczel, P., Ad\u00e1mek, J., Milius, S., Velebil, J.: Infinite trees and completely iterative Theories: a coalgebraic view. Theoretical Computer Science\u00a0300, 1\u201345 (2003)","journal-title":"Theoretical Computer Science"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Aczel, P., Ad\u00e1mek, J., Velebil, J.: A coalgebraic view of infinite trees and iteration. Electronic Notes in Theoretical Computer Science\u00a044(1) (2001)","DOI":"10.1016\/S1571-0661(04)80900-9"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.: A final coalgebra theorem. In: Pitt, D.H., et al. (eds.) Category Theory and Computer Science, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"issue":"1-3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2003.12.022","volume":"316","author":"J. Ad\u00e1mek","year":"2004","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: On coalgebra based on classes. Theoretical Computer Science\u00a0316(1-3), 3\u201323 (2004)","journal-title":"Theoretical Computer Science"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Elgot algebras (2005) (preprint)","DOI":"10.2168\/LMCS-2(5:4)2006"},{"key":"22_CR7","volume-title":"Automata and Algebras in Categories","author":"J. Ad\u00e1mek","year":"1990","unstructured":"Ad\u00e1mek, J., Trnkov\u00e1, V.: Automata and Algebras in Categories. Kluwer Academic Publishers Group, Dordrecht (1990)"},{"key":"22_CR8","volume-title":"CSLI Lecture Notes","author":"J. Barwise","year":"1996","unstructured":"Barwise, J., Moss, L., Circles, V.: CSLI Lecture Notes, vol.\u00a060. CSLI Publications, Stanford (1996)"},{"key":"22_CR9","unstructured":"Cancila, D.: Ph.D. Dissertation, University of Udine Computer Science Department (2003)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Cancila, D., Honsell, F., Lenisa, M.: Properties of set functors. In: Honsell, F., et al. (eds.) Proceedings of COMETA 2003. ENTCS, vol.\u00a0104, pp. 61\u201380 (2004)","DOI":"10.1016\/j.entcs.2004.08.019"},{"key":"22_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0903-4","volume-title":"The Joy of Sets","author":"K. Devlin","year":"1993","unstructured":"Devlin, K.: The Joy of Sets, 2nd edn. Springer, Heidelberg (1993)","edition":"2"},{"key":"22_CR12","unstructured":"Freyd, P.: Real coalgebra, post on categories mailing list(December 22, 1999), available via http:\/\/www.mta.ca\/~cat-dist"},{"key":"22_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02308-2","volume-title":"Basic Set Theory","author":"A. Levy","year":"1979","unstructured":"Levy, A.: Basic Set Theory. Springer, Heidelberg (1979)"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.05.003","volume":"196","author":"S. Milius","year":"2005","unstructured":"Milius, S.: Completely iterative algebras and completely iterative monads. Inform. and Comput.\u00a0196, 1\u201341 (2005)","journal-title":"Inform. and Comput."},{"key":"22_CR15","unstructured":"Milius, S.: Ph.D. Dissertation, Institute of Theoretical Computer Science, Technical University of Braunschweig (2005)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11548133_19","volume-title":"Algebra and Coalgebra in Computer Science","author":"S. Milius","year":"2005","unstructured":"Milius, S., Moss, L.S.: The category theoretic solution of recursive program schemes. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 293\u2013312. Springer, Heidelberg (2005)"},{"issue":"1-3","key":"22_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0168-0072(98)00042-6","volume":"96","author":"L.S. Moss","year":"1999","unstructured":"Moss, L.S.: Coalgebraic logic. Annals of Pure and Applied Logic\u00a096(1-3), 277\u2013317 (1999)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1-2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0304-3975(00)00126-2","volume":"260","author":"L.S. Moss","year":"2001","unstructured":"Moss, L.S.: Parametric corecursion. Theoretical Computer Science\u00a0260(1-2), 139\u2013163 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1093\/jigpal\/5.2.231","volume":"5","author":"L.S. Moss","year":"1997","unstructured":"Moss, L.S., Danner, N.: On the foundations of corecursion. Logic Journal of the IGPL\u00a05(2), 231\u2013257 (1997)","journal-title":"Logic Journal of the IGPL"},{"issue":"1","key":"22_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"key":"22_CR21","unstructured":"Turi, D.: Functorial Operational Semantics and its Denotational Dual Ph.D. thesis, CWI, Amsterdam (1996)"},{"issue":"5","key":"22_CR22","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0960129598002588","volume":"8","author":"D. Turi","year":"1998","unstructured":"Turi, D., Rutten, J.J.M.M.: On the foundations of final semantics: non-standard sets, metric spaces, partial orders. Mathematical Structures in Computer Science\u00a08(5), 481\u2013540 (1998)","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algebra, Meaning, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780274_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:02Z","timestamp":1619507762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780274_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354628","9783540354642"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11780274_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}