Article ID Journal Published Year Pages File Type
9657842 Theoretical Computer Science 2005 16 Pages PDF
Abstract
A standard construction of the final coalgebra of an endofunctor involves defining a chain of iterates, starting at the final object of the underlying category and successively applying the functor. In this paper we show that, for a finitary set functor, this construction always yields a final coalgebra in ω2=ω+ω steps.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,