{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:28:31Z","timestamp":1767929311040,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540418641","type":"print"},{"value":"9783540453154","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_20","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:28:39Z","timestamp":1196663319000},"page":"303-317","source":"Crossref","is-referenced-by-count":11,"title":["Categories of Processes Enriched in Final Coalgebras"],"prefix":"10.1007","author":[{"given":"Sava","family":"Krsti\u0107","sequence":"first","affiliation":[]},{"given":"John","family":"Launchbury","sequence":"additional","affiliation":[]},{"given":"Du\u0161ko","family":"Pavlovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky. Interaction categories. In Theory and Formal Methods\u2019 93, Workshops in Computer Science, pages 57\u201370. Springer-Verlag, 1996.","DOI":"10.1007\/978-1-4471-3503-6_5"},{"key":"20_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"CONCUR\u2019 96: Concurrency Theory, 7th International Conference","author":"S. Abramsky","year":"1996","unstructured":"S. Abramsky. Retracing some paths in process algebra. In U. Montanari and V. Sassone, editors, CONCUR\u2019 96: Concurrency Theory, 7th International Conference, volume 1119 of Lecture Notes in Computer Science, pages 1\u201317, 1996."},{"key":"20_CR3","unstructured":"P. Aczel. Non-Well-Founded Sets. CSLI Publications, 1988."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3. Clarendon Press, 1994.","DOI":"10.1093\/oso\/9780198537625.001.0001"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1137\/1016026","volume":"16","author":"M. A. Arbib","year":"1974","unstructured":"M. A. Arbib and E. G. Manes. Machines in a category: An expository introduction. SIAM Review, 16:163\u2013192, 1974.","journal-title":"SIAM Review"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0005-1098(66)90011-2","volume":"3","author":"M. A. Arbib","year":"1966","unstructured":"M. A. Arbib. A common framework for automata theory-a rapprochement. Automatica, 3:161\u2013189, 1966.","journal-title":"Automatica"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(90)90151-7","volume":"70","author":"E. Bainbridge","year":"1990","unstructured":"E. Bainbridge, P.J. Freyd, A. Scedrov, and P. Scott. Functorial polymorphism. Theoretical Computer Science, 70:35\u201364, 1990.","journal-title":"Theoretical Computer Science"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"S. Brookes and S. Geva. Computational comonads and intensional semantics. In M.P. Fourman, P.T. Johnstone, and A.M. Pitts, editors, Categories in Computer Science, pages 1\u201344. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511525902.003"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"J. W. Gray. Formal Category Theory: Adjointness for 2-categories. Springer, 1974.","DOI":"10.1007\/BFb0061280"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0168-0072(88)90018-8","volume":"40","author":"M. Hyland","year":"1988","unstructured":"M. Hyland. A small complete category. Annals of Pure and Applied Logic, 40:135\u2013165, 1988.","journal-title":"Annals of Pure and Applied Logic"},{"key":"20_CR11","first-page":"222","volume":"62","author":"B. Jacobs","year":"1997","unstructured":"B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science, 62:222\u2013259, 1997.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"20_CR12","unstructured":"G. M. Kelly. Basic Concepts of Enriched Category Theory. Cambridge University Press, 1982."},{"key":"20_CR13","unstructured":"J. Launchbury, S. Krsti\u0107, and T. E. Sauerwein. Zip fusion with hyperfunctions. Technical report, Oregon Graduate Institute, 2000. Preprint available on http:\/\/www.cse.ogi.edu\/~krstic ."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1017\/S0960129500001298","volume":"1","author":"G. Longo","year":"1991","unstructured":"G. Longo and E. Moggi. onstructive natural deduction and its \u2018omega-set\u2019 interpretation. Mathematical Structures in Computer Science, 1:215\u2013254, 1991.","journal-title":"Mathematical Structures in Computer Science"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"E. Moggi. Notions of computation and monads. Information and Computation, 93:55\u201392, 1991.","journal-title":"Information and Computation"},{"key":"20_CR16","first-page":"301","volume":"118","author":"P. S. Mulry","year":"199","unstructured":"P. S. Mulry. Categorical fixed-point semantics. Theoretical Computer Science, 118:301\u2013314, 199.","journal-title":"Theoretical Computer Science"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. J. M. M. Rutten","year":"1996","unstructured":"J. J. M. M. Rutten. Universal coalgebra: a theory of systems. Theoretical Computer Science, 249:3\u201380, 1996.","journal-title":"Theoretical Computer Science"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0304-3975(93)90112-7","volume":"118","author":"A. Simpson","year":"1993","unstructured":"A. Simpson. A characterization of the least-fixed-point operator by dinaturality. Theoretical Computer Science, 118:301\u2013314, 1993.","journal-title":"Theoretical Computer Science"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"A. Simpson and G. Plotkin. Complete axioms for categorical fixed-point operators. In 15th Symposium on Logic in Computer Science (LICS 2000). IEEE Computer Society, 2000.","DOI":"10.1109\/LICS.2000.855753"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0960129598002588","volume":"8","author":"D. Turi","year":"1998","unstructured":"D. Turi and J. J. M. M. Rutten. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Mathematical Structures in Computer Science, 8:481\u2013540, 1998.","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T04:57:22Z","timestamp":1737608242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}