On the final sequence of a finitary set functor

Theoretical Computer Science

Volumn 338, Issue 1-3, 2005, Pages 184-199

  Worrell, James ^a  

^a Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BOUNDARY CONDITIONS; FUNCTION EVALUATION; PROBLEM SOLVING; TREES (MATHEMATICS);

ENDOFUNCTORS; FUNCTORS; POWERSET FUNCTORS; REGULAR CARDINAL;

SET THEORY;

EID: 18544388945     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.12.009     Document Type: Article

References (21)

1. P. Aczel Non-well-founded sets CLSI Lecture Notes Vol. 14 1988 Center for the Study of Languages and Information Stanford
2. P. Aczel, P.F. Mendler, A final coalgebra theorem, in: Category Theory and Computer Science, Lecture Notes in Computer Science, Vol. 389, Springer, Berlin, 1989, pp. 357-365.
3. J. Adámek On final coalgebras of continuous functors Theoret. Comput. Sci. 294 2003 3 29
4. J. Adámek, and V. Koubek Least fixed point of a functor J. Comput. System Sci. 19 1979 163 178
5. J. Adámek, and V. Koubek On the greatest fixed point of a set functor Theoret. Comput. Sci. 150 1995 57 75
6. J. Adámek, and H.E. Porst From varieties of algebras to covarieties of coalegbras Proc. CMCS'01, Electron. Notes Theoret. Comput. Sci. 44 2001
7. J. Adámek, and J. Rosický Locally presentable and accessible categories LMS Lecture Notes Vol. 189 1994 Cambridge University Press Cambridge
8. P. America, and J. Rutten Solving reflexive domain equations in a category of complete metric spaces J. Comput. System Sci. 39 3 1989 343 375
9. M. Barr Algebraically compact functors J. Pure Appl. Algebra 82 1992 211 231
10. M. Barr Terminal coalgebras in well-founded set theory Theoret. Comput. Sci. 114 1993 299 315
11. H.P. Gumm Functors for coalgebras Algebra Universalis 45 2001 135 147
12. Y. Kawahara, and M. Mori A small final coalgebra theorem Theoret. Comput. Sci. 233 1-2 2000 129 145
13. M.W. Mislove, L.S. Moss, and F.J. Oles Non-well-founded sets modelled as ideal fixed points Inform. and Comput. 93 1 1991 16 54
14. L.S. Moss Coalgebraic logic Ann. Pure Appl. Logic 99 1-3 1999 241 259
15. L.C. Paulson Final coalgebras as greatest fixed points in ZF set theory Math. Struct. Comput. Sci. 9 5 1999 545 567
16. J.J.M.M. Rutten Universal coalgebra a theory of systems Theoret. Comput. Sci. 249 1 2000 3 80
17. M.B. Smyth Topology S. Abramsky D. Gabbay T.S.E. Maibaum Handbook of Logic in Computer Science 1990 Oxford University Press Oxford
18. V. Trnková Some properties of set functors Comment. Math. Univ. Carolinae 10 1969 323 352
19. D. Turi, and J. Rutten On the foundations of final semantics non-standard sets, metric spaces, partial orders Math. Struct. Comput. Sci. 8 5 1998 481 540
20. E. de Vink, and J. Rutten Bisimulation for probabilistic transition systems a coalgebraic approach Theoret. Comput. Sci. 221 1-2 1999 271 293
21. J.B. Worrell, Terminal sequences for accessible endofunctors, Proceedings of Coalgebraic Methods in Computer Science '99, Elect. Notes Theor. Comp. Sci. 19 (1999) 39-54.