Realization of Coinductive Types

Authors:
Dexter Kozen
Affiliations:
Department of Computer Science, Cornell University, Ithaca, New York 14853-7501, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 7
Cited 0

Terminal coalgebras in well-founded set theory

Theoretical Computer Science
On the greatest fixed point of a set functor

Theoretical Computer Science
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
A Final Coalgebra Theorem

Category Theory and Computer Science
On final coalgebras of continuous functors

Theoretical Computer Science - Category theory and computer science
On the final sequence of a finitary set functor

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.