Higher-order Algebras and Coalgebras from Parameterized Endofunctors

Authors:
Jiho Kim
Affiliations:
Department of Mathematics, Indiana University, Bloomington, Indiana, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 5
Cited 0

Infinite trees and completely iterative theories: a coalgebraic view

Theoretical Computer Science
Coalgebras and modal logic for parameterised endofunctors

Coalgebras and modal logic for parameterised endofunctors
Foundations for structured programming with GADTs

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comonadic Notions of Computation

Electronic Notes in Theoretical Computer Science (ENTCS)
Parameterised notions of computation

MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The study of algebras and coalgebras involve parametric description of a family of endofunctors. Such descriptions can often be packaged as parameterized endofunctors. A parameterized endofunctor generates a higher-order endofunctor on a functor category. We characterize initial algebras and final coalgebras for these higher-order endofunctors, generalizing several results in the literature.