Recursive coalgebras from comonads

DOI10.1016/J.IC.2005.08.005MaRDI QIDQ2495640zbMATH OpenOpenAlexWikidataFDO

Authors Venanzio Capretta, Tarmo Uustalu, Varmo Vene

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

zbMATH Keywords

comonadsdistributive lawsrecursive coalgebrasstructured recursionwellfounded coalgebras

Mathematics Subject Classification ID

Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Eilenberg-Moore and Kleisli constructions for monads (18C20) Semantics in the theory of computing (68Q55)

Recommendations

• Recursive coalgebras from comonads
• On well-founded and recursive coalgebras
• CIA structures and the semantics of recursion
• Recursive coalgebras of finitary functors
• scientific article; zbMATH DE number 5994844

Cites work

• A fixpoint theorem for complete categories
• Advanced Functional Programming
• Categorical set theory: A characterization of the category of sets
• Completely iterative algebras and completely iterative monads
• Data structures and program transformation
• Free iterative theories: a coalgebraic view
• From iterative algebras to iterative theories (extended abstract)
• Generalised coinduction
• Generalized coiteration schemata
• scientific article; zbMATH DE number 431762 (Why is no real title available?)
• scientific article; zbMATH DE number 4047683 (Why is no real title available?)
• scientific article; zbMATH DE number 19484 (Why is no real title available?)
• scientific article; zbMATH DE number 48157 (Why is no real title available?)
• scientific article; zbMATH DE number 1223720 (Why is no real title available?)
• scientific article; zbMATH DE number 1289305 (Why is no real title available?)
• scientific article; zbMATH DE number 1343506 (Why is no real title available?)
• scientific article; zbMATH DE number 1497814 (Why is no real title available?)
• scientific article; zbMATH DE number 1863381 (Why is no real title available?)
• Infinite trees and completely iterative theories: A coalgebraic view
• Intuitionistic sets and ordinals
• Iterative algebras
• Modelling general recursion in type theory
• Parametric corecursion
• Recursion schemes from comonads
• Relating two approaches to coinductive solution of recursive equations
• The view from the left

Cited in

(26)

• Combinatorial models for coalgebraic structures
• Cofree coalgebras and multivariable recursiveness.
• Long-term values in Markov decision processes, (co)algebraically
• Steps and traces
• Coalgebras and monads in the semantics of Java
• On well-founded and recursive coalgebras
• A coalgebraic view of bar recursion and bar induction
• Recursive coalgebras from comonads
• scientific article; zbMATH DE number 5994844 (Why is no real title available?)
• Recursive coalgebras of finitary functors
• A Type of Partial Recursive Functions
• CIA structures and the semantics of recursion
• From Coinductive Proofs to Exact Real Arithmetic
• Corecursive algebras: a study of general structured corecursion
• The Recursion Scheme from the Cofree Recursive Comonad
• Language constructs for non-well-founded computation
• Unifying structured recursion schemes. An extended study
• The Sierpinski carpet as a final coalgebra
• Fantastic morphisms and where to find them. A guide to recursion schemes
• Coalgebras in functional programming and type theory
• Recursion schemes in Coq
• The Sierpinski carpet as a final coalgebra
• Relative fixed points of functors
• Fractals from regular behaviours
• Initial algebras unchained -- a novel initial algebra construction formalized in Agda
• Strong induction is an up-to technique

Describes a project that uses

Uses Software

• Epigram

This page was built for publication: Recursive coalgebras from comonads

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495640)