Data structures and program transformation
Science of Computer Programming
Functional programming with bananas, lenses, envelopes and barbed wire
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Theoretical Computer Science
The dual of substitution is redecoration
Trends in functional programming
Elementary Strong Functional Programming
FPLE '95 Proceedings of the First International Symposium on Functional Programming Languages in Education
Structural Recursive Definitions in Type Theory
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Codifying Guarded Definitions with Recursive Schemes
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
A Typed Lambda Calculus with Categorical Type Constructors
Category Theory and Computer Science
Recursion schemes from comonads
Nordic Journal of Computing
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Infinite trees and completely iterative theories: a coalgebraic view
Theoretical Computer Science
A Universal Characterization of the Closed Euclidean Interval
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Free iterative theories: a coalgebraic view
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Journal of Functional Programming
Completely iterative algebras and completely iterative monads
Information and Computation
Modelling general recursion in type theory
Mathematical Structures in Computer Science
Epigram: practical programming with dependent types
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Hi-index | 0.00 |
The concept of recursive coalgebra of a functor was introduced in the 1970s by Osius in his work on categorical set theory to discuss the relationship between wellfounded induction and recursively specified functions. In this paper, we motivate the use of recursive coalgebras as a paradigm of structured recursion in programming semantics, list some basic facts about recursive coalgebras and, centrally, give new conditions for the recursiveness of a coalgebra based on comonads, comonad-coalgebras and distributive laws of functors over comonads. We also present an alternative construction using countable products instead of coffee comonads.