Recursive Coalgebras from Comonads

Authors:
Venanzio Capretta;Tarmo Uustalu;Varmo Vene
Affiliations:
Dept. of Mathematics and Statistics, University of Ottawa, 585 King Edward Ave., Ottawa, Ont. K1N 6N5, Canada;Institute of Cybernetics at Tallinn Technical University, Akadeemia tee 21, EE-12618 Tallinn, Estonia;Dept. of Computer Science, University of Tartu, J. Liivi 2, EE-50409 Tartu, Estonia
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2004

Citing 13
Cited 1

Parametric corecursion

Theoretical Computer Science
The dual of substitution is redecoration

Trends in functional programming
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
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
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
Generalised coinduction

Mathematical Structures in Computer Science
The view from the left

Journal of Functional Programming
Modelling general recursion in type theory

Mathematical Structures in Computer Science

A Type of Partial Recursive Functions

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss Osius's [G. Osius, Categorical set theory: A characterisation of the category of sets, J. of Pure and Appl. Algebra 4 (1974) 79-119] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiveness of a functor-coalgebra that are based on comonads, comonad-coalgebras and distributive laws.