Recursive program schemes and context-free monads
From MaRDI portal
Recommendations
Cites work
- A coalgebraic view of infinite trees and iteration
- A fixpoint theorem for complete categories
- Algebraic semantics
- Algebras, coalgebras, monads and comonads
- Coequalizers and free triples
- Completely iterative algebras and completely iterative monads
- Coproducts of Ideal Monads
- Dualising initial algebras
- Fundamental properties of infinite trees
- scientific article; zbMATH DE number 3458870 (Why is no real title available?)
- scientific article; zbMATH DE number 3512082 (Why is no real title available?)
- scientific article; zbMATH DE number 575948 (Why is no real title available?)
- Infinite trees and completely iterative theories: A coalgebraic view
- Iterative algebras at work
- Iterative reflections of monads
- Monads of coalgebras: rational terms and term graphs
- On the monadicity of finitary monads
- Parametric corecursion
- Regular trees and the free iterative theory
- Solving Algebraic Equations Using Coalgebra
- Some remarks on finitary and iterative monads
- The category-theoretic solution of recursive program schemes
Cited in
(8)- Monads for the formalization of a pattern matching procedure
- scientific article; zbMATH DE number 5598380 (Why is no real title available?)
- scientific article; zbMATH DE number 3984549 (Why is no real title available?)
- scientific article; zbMATH DE number 4097355 (Why is no real title available?)
- scientific article; zbMATH DE number 7362475 (Why is no real title available?)
- scientific article; zbMATH DE number 7533352 (Why is no real title available?)
- On second-order iterative monads
- The category-theoretic solution of recursive program schemes
This page was built for publication: Recursive program schemes and context-free monads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2919447)