Article ID Journal Published Year Pages File Type
423895 Electronic Notes in Theoretical Computer Science 2011 10 Pages PDF
Abstract

We give an explicit combinatorial construction of final coalgebras for a modest generalization of polynomial functors on Set. Type signatures are modeled as directed multigraphs instead of endofunctors. The final coalgebra for a type signature F involves the notion of Brzozowski derivative on sets of paths in F.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics