On coalgebra based on classes

被引：18
作者：
Adámek, J
Milius, S [1 ]
Velebil, J
机构：
[1] Tech Univ Braunschweig, Inst Theoret Comp Sci, D-3300 Braunschweig, Germany
[2] Czech Tech Univ, Fac Elect Engn, Dept Math, Prague 16627, Czech Republic
来源：
THEORETICAL COMPUTER SCIENCE | 2004年 / 316卷 / 1-3期
关键词：
category of classes; set-based endofunctor; terminal coalgebra; iterative monad;
D O I：
10.1016/j.tcs.2003.12.022
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The category Class of classes and functions is proved to have a number of properties suitable for algebra and coalgebra: every endofunctor is set-based, it has an initial algebra and a terminal coalgebra, the categories of algebras and coalgebras are complete and cocomplete, and every endofunctor generates a free completely iterative monad. A description of a terminal coalgebra for the power-set functor is provided. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：3 / 23
页数：21
相关论文
共 24 条
[1]  
ACZEL P, 1989, LECT NOTES COMPUT SC, V389, P357
[2]   Infinite trees and completely iterative theories:: a coalgebraic view [J].
Aczel, P ;
Adámek, J ;
Milius, S ;
Velebil, J .
THEORETICAL COMPUTER SCIENCE, 2003, 300 (1-3) :1-45
[3]  
Aczel P., 1988, CSLI Lecture Notes
[4]  
Adamek J., 2003, Mathematical Structures in Computer Science, V13, P201, DOI 10.1017/S0960129502003882
[5]   On tree coalgebras and coalgebra presentations [J].
Adámek, J ;
Porst, HE .
THEORETICAL COMPUTER SCIENCE, 2004, 311 (1-3) :257-283
[6]  
ADAMEK J, 2002, ELECT NOTES THEORET, V65, P1
[7]  
Adamek J., 1990, Automata and Algebras in Categories
[8]  
ADAMEK J, 2003, ELECT NOTES THEORET, V82
[9]  
Adamek Jiri, 1974, Commentationes Mathematicae Universitatis Carolinae, V015, P589
[10]  
[Anonymous], FUND MATH
123