Recursive coalgebras from comonads
From MaRDI portal
Publication:2495640
DOI10.1016/J.IC.2005.08.005zbMath1110.68068OpenAlexW2163256338WikidataQ62043269 ScholiaQ62043269MaRDI QIDQ2495640
Venanzio Capretta, Varmo Vene, Tarmo Uustalu
Publication date: 30 June 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2005.08.005
Semantics in the theory of computing (68Q55) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Eilenberg-Moore and Kleisli constructions for monads (18C20)
Related Items (10)
Fantastic morphisms and where to find them. A guide to recursion schemes ⋮ Recursive coalgebras of finitary functors ⋮ Unifying structured recursion schemes ⋮ Unnamed Item ⋮ A Type of Partial Recursive Functions ⋮ The Recursion Scheme from the Cofree Recursive Comonad ⋮ Long-term values in Markov decision processes, (co)algebraically ⋮ Steps and traces ⋮ A Coalgebraic View of Bar Recursion and Bar Induction ⋮ From Coinductive Proofs to Exact Real Arithmetic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data structures and program transformation
- Iterative algebras
- Infinite trees and completely iterative theories: A coalgebraic view
- Completely iterative algebras and completely iterative monads
- Categorical set theory: A characterization of the category of sets
- A fixpoint theorem for complete categories
- Free iterative theories: a coalgebraic view
- Generalised coinduction
- The view from the left
- Advanced Functional Programming
- Intuitionistic sets and ordinals
- Modelling general recursion in type theory
- Parametric corecursion
This page was built for publication: Recursive coalgebras from comonads
