Introduction to coalgebra

Theory and Applications of Categories

Volumn 14, Issue 8, 2005, Pages

  Adámek, Jiří ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27844483911     PISSN: 1201561X     EISSN: 1201561X     Source Type: Journal    
DOI: None     Document Type: Article

References (56)

1. [Ac] P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes 14, Stanford University, 1988.
2. [Ac] P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes 14, Stanford University, 1988.
3. [AAMV] P. Aczel, J. Adámek, S. Milius and J. Velebil, Infinite Trees and Completely Iterative Theories: A Coalgebraic View, Theor. Comp. Sci. 300(2003), 1-45.
4. [AM] P. Aczel and P. F. Mendier, A Final Coalgebra Theorem, in: Category Theory and Computer Science, D. H. Pitt, D. E. Rydeheard, P. Dybjer, A. M. Pitts, A. Poigné (eds.), LNCS 389, Springer-Verlag, 1989, 357-365.
5. [A0] J. Adámek, Free algebras and automata realization in the language of categories, Comment. Math. Univ. Carolinae 15(1974), 589-602.
6. [Al] J. Adámek, Colimits of algebras revisted, Bull. Austral. Math. Soc. 17(1977), 433-450.
7. [A2] J. Adámek, Birkhoff's covariety theorem without limitations, to appear in Commentationes Mathem. Universitatis Carolinae.
8. [A3] J. Adámek, On a description of terminal coalgebras and iterative theories, Electron. Notes Theor. Comput. Sci. 82(1)(2003).
9. [AHS] J. Adámek, H. Herrlich and G. E. Strecker, Abstract and Concrete Categories, Wiley Publ., New York 1990, see online version at http://katmat.math.uni-bremen.de/acc
10. [AMV1] J. Adámek, S. Milius and J. Velebil, On coalgebra based on classes, Theor. Comput. Sci. 316(2004), 2-23.
11. [AMV2] J. Adámek, S. Milius and J. Velebil, Free iterative theories - a coalgebraic view, Math. Structures Comput. Sci. 13(2003), 259-320.
12. [AMV3] J. Adámek, S. Milius and J. Velebil, ¿From iterative algebras to iterative theories, Electron. Notes Theor. Comput. Sci., to appear; full version available via http://www.iti.cs.tu-bs.de/~milius.
13. [AMV4] J. Adámek, S. Milius and J. Velebil, On iterative algebras and Elgot algebras, submitted.
14. [AMV5] J. Adámek, S. Milius and J. Velebil, Iterative algebras for a base, Electron. Notes Theor. Comput. Sci., to appear, full version available at http://www.iti.cs.tu-bs.de/~milius.
15. [AP1] J. Adámek and H.-E. Porst, On varieties and covarieties in a category, Math. Structures Comput. Sci. 13(2003), 201-232.
16. [AP2] J. Adámek and H.-E. Porst, On tree coalgebras and coalgebra presentations, Theor. Comput. Sci. 311(2004), 257-283.
17. [AR] J. Adámek and J. Rosický, Locally Presentable and Accessible Categories, Cambridge University Press, 1994.
18. [AT1] J. Adámek and V. Trnková, Automata and Algebras in a Category, Kluwer Publishing Company, Dordrecht, 1990.
19. [AT2] J. Adámek and V. Trnková, On the limitations of Birkhoff's variety theorem, submitted.
20. [AMa] M. A. Arbib and E. G. Manes, Parametrized data types do not need highly constrained parameters, Information and Control 52(1982), 139-158.
21. [BH] B. Banaschewsky and H. Herrlich, Subcategories defined by implications, Houston J. Mathem. 2(1976), 149-171.
22. [B1] M. Barr, Coequalizers and free triples, Mathem. Zeitschrift 116(1970), 307-322.
23. [B2] M. Barr, Terminal Coalgebras in Well-Founded Set Theory, Theor. Comput. Sci. 124(1994), 182-192.
24. [Br] F. Bartels, Generalized coinduction, Math. Structures Comput. Sci. 13(2003), 321-348.
25. [BM] J. Barwise and L. Moss, Vicious circles, CSLI Lecture Notes, Vol. 60, Stanford University, Stanford, CA, 996.
26. [BE] S. L. Bloom and C. C. Elgot, The existence and construction of free iterative theories, J. Comput. System Sci. 12(1974), 305-318.
27. [BE] S. L. Bloom and Z. Ésik, Iterative Theories: The Equational Logic of Iterative Processes, EATCS Monograph Series on Theoretical Computer Science, Springer-Verlag, 1993.
28. [E] C. C. Elgot, Monadic Computation and Iterative Algebraic Theories, in: Logic Colloquium'73 (eds: H. E. Rose and J. C. Shepherdson), North-Holland Publishers, Amsterdam, 1975.
29. [EBT] C.C. Elgot, S. L. Bloom and R. Tindell, On the Algebraic Structure of Rooted Trees, J. Comp. Syst. Sciences 16(1978), 361-399.
30. [F] P. Freyd, Algebraically complete categories, Lecture Notes Math. 1488, Springer-Verlag 1991, 95-104.
31. [GU] P. Gabriel and F. Ulmer, Local präsentierbare Kategorien, Lecture Notes in Math. 221, Springer-Verlag 1971.
32. [Gi] S. Ginali, Regular trees and the free iterative theory, J. Comput. System Sci. 18(1979), 228-242.
33. [G] H. P. Gumm, Universelle Koalgebra, in T. Ihringer "Allgemeine Algebra", Heldermann Verlag 2003.
34. [GS1] H. P. Gumm and T. Schröder, Products of coalgebras, Algebra Universalis 46(2001), 163-185.
35. [GS2] H. P. Gumm and T. Schröder, Coalgebraic structure from weak limit preserving functors, Electron. Notes Theor. Comput. Sci. 33(2000).
36. [HL] F. Hanzel and M. Lenisa, Coinductive characterization of applicative structures, Math. Tructures Comput. Sci. 9(1999), 403-435.
37. [J] B. Jacobs, Comprehension for Coalgebras, Electron. Notes Theor.Comput. Sci. 65(2002)
38. [JR] B. Jacobs and J. Rutten, A tutorial on (co)algebras and (co)induction, EATCS Bulletin 62(1997), 222-259.
39. [JPTW] P. Johnstone, J. Power, T. Tsujishita, H. Watanabe and J. Worrell, On the structure of categories of coalgebras, Theor. Comput. Sci. 260(2001), 87-117.
40. [KM] Y. Kawahara and M. Mori, A small final coalgebra theorem, Theor. Comput. Sci. 233(2000), 129-145.
41. [KR] A. Kurz and J. Rosický, Modal predicates and coequations, Electron. Notes Theor. Comput. Sci. 65(2002). Full version to appear in Information and Computation.
42. [L] J. Lambek, A Fixpoint Theorem for Complete Categories, Math. Zeitschrift 103(1968), 151-161.
43. [Li] F. E. J. Linton, Coequalizers in categories of algebras, in: Lecture Notes in Math., Vol. 80, Springer, Berlin 1969, 75-90.
44. [M] R. Milner, Communication and Concurrency, Prentice Hall, 1989.
45. [Mi] S. Milius, Completely iterative algebras and completely iterative monads, Inform, and Comput., to appear.
46. [MM] S. Milius and L. S. Moss, The category theoretic solution of recursive program schemes, submitted.
47. [Mo] L. Moss, Parametric Corecursion, Theor. Comput. Sci. 260(2001), 139-164.
48. [N] E. Nelson, Iterative algebras, Theor. Comput. Sci. 25(1983), 67-94.
49. [R1] J. J. M. M. Rutten, Universal coalgebra: a theory of systems, Theor. Comput. Sci. 249(1)(2000), 3-80.
50. [R2] J. J. M. M. Rutten, Behavioral differential equations: a coinductive calculus of streams, automata, and power series, Theor. Comput. Sci. 308(2003), 1-53.
51. [R3] J. J. M. M. Rutten, Coinductive counting with weighted automata, J. Autom. Lang. Comb. 8(2003), 319-352.
52. [RT] J. J. M. M. Rutten and D. Turi, On the foundations of final coalgebra semantics: non-well-founded sets, partital orders, metric spaces, Math. Structures Comput. Sci. 8(1998), 481-540.
53. [T] J. Tiurin, Unique fixed points vs. least fixed points, Theor. Comput. Sci. 12(1980), 229-254.
54. [U] T. Uustalu, Generalizing substitution, Theoretical Informatics and Appl., to appear.
55. [W1] J. Worrell, On the final sequence of a finitary set functor, Theor. Comput. Sci., to appear.
56. [W2] J. Worrell, Toposes of coalgebras and hidden algebras, Electron. Notes Theor. Comput. Sci. 11(1998)