Abstract
For an arbitrary-type functor
For an arbitrary-type functor
P. Aczel and N. Mendler, “A final coalgebra theorem,” in Category Theory and Computer Science (Manchester, 1989), D. H. Pitt, D. E. Rydeheard, P. Dybjer, A. M. Pitts, and A. Poigné, Eds., vol. 389 of Lecture Notes in Computer Science, pp. 357–365, Springer, Berlin, 1989.
View at: Google Scholar | MathSciNetM. Barr, “Terminal coalgebras in well-founded set theory,” Theoretical Computer Science, vol. 114, no. 2, pp. 299–315, 1993.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetH. P. Gumm, “Elements of the general theory of coalgebras,” in Logic, Universal Algebra, and Theoretical Computer Science (LUATCS '99), Rand Africaans University, Johannesburg, January 1999.
View at: Google ScholarH. P. Gumm and T. Schröder, “Coalgebraic structure from weak limit preserving functors,” in CMCS'2000: Coalgebraic Methods in Computer Science (Berlin), vol. 33 of Electronic Notes in Theoretical Computer Science, p. 21, Elsevier, Amsterdam, 2000.
View at: Google Scholar | Zentralblatt MATH | MathSciNetH. P. Gumm and T. Schröder, “Products of coalgebras,” Algebra Universalis, vol. 46, no. 1-2, pp. 163–185, 2001.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetY. Kawahara and M. Mori, “A small final coalgebra theorem,” Theoretical Computer Science, vol. 233, no. 1-2, pp. 129–145, 2000.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetJ. J. M. M. Rutten, “Universal coalgebra: a theory of systems,” Tech. Rep. CS-R9652, Centrum voor Wiskunde en Informatica, Amsterdam, 1996.
View at: Google ScholarJ. J. M. M. Rutten, “Universal coalgebra: a theory of systems,” Theoretical Computer Science, vol. 249, no. 1, pp. 3–80, 2000.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetH. Schubert, Categories, Springer, New York, 1972.
View at: Google Scholar | Zentralblatt MATH | MathSciNet