Realization of Coinductive Types
Dexter C. Kozen · Electronic Notes in Theoretical Computer Science · 2011
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 .