Recursion schemes from comonads
From MaRDI portal
Recommendations
Cited in
(24)- Recursive constructions for large caps
- Corecursion up-to via causal transformations
- Recursive proof composition from accumulation schemes
- Generic recursive lens combinators and their calculation laws
- Bisimulation and coinduction enhancements: a historical perspective
- Structural operational semantics for continuous state stochastic transition systems
- Recursive coalgebras from comonads
- Distributive laws for the coinductive solution of recursive equations
- Functional programming with apomorphisms (corecursion)
- Conjugate hylomorphisms -- or: the mother of all structured recursion schemes
- Simple Models for Recursive Schemes
- The Expression Lemma
- scientific article; zbMATH DE number 1343506 (Why is no real title available?)
- scientific article; zbMATH DE number 517048 (Why is no real title available?)
- Generalizing Substitution
- scientific article; zbMATH DE number 874495 (Why is no real title available?)
- The Recursion Scheme from the Cofree Recursive Comonad
- Some remarks on type systems for course-of-value recursion
- Unifying structured recursion schemes
- Unifying structured recursion schemes. An extended study
- Advanced Functional Programming
- Initial algebras of terms with binding and algebraic structure
- Fantastic morphisms and where to find them. A guide to recursion schemes
- Strong induction is an up-to technique
This page was built for publication: Recursion schemes from comonads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765926)