Recursive program schemes and context-free monads
type: Item
instance of: scholarly article
zbMATH Open document ID: 1247.68049
author: Jiří Adámek
author: Stefan Milius
author: Jiří Velebil
published in: Electronic Notes in Theoretical Computer Science
publication date: 2012-10-02T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 18C15
Mathematics Subject Classification ID: 18C50
zbMATH DE Number: 6089938
zbMATH Keywords: algebraic trees
zbMATH Keywords: recursive program schemes
zbMATH Keywords: ideal theory
zbMATH Keywords: monads
MaRDI profile type: Publication
full work available at URL: j.entcs.2010.07.011
OpenAlex ID: W2040324402
cites work: Infinite trees and completely iterative theories: A coalgebraic view
cites work: A Coalgebraic View of Infinite Trees and Iteration
cites work: Q4044767
cites work: Iterative algebras at work
cites work: Semantics of Higher-Order Recursion Schemes
cites work: Iterative reflections of monads
cites work: Some remarks on finitary and iterative monads
cites work: Q4293501
cites work: Coequalizers and free triples
cites work: Fundamental properties of infinite trees
cites work: Q4091917
cites work: Solving Algebraic Equations Using Coalgebra
cites work: Monads of coalgebras: rational terms and term graphs
cites work: Algebras, Coalgebras, Monads and Comonads
cites work: Dualising initial algebras
cites work: Coproducts of Ideal Monads
cites work: Regular trees and the free iterative theory
cites work: Algebraic semantics
cites work: On the monadicity of finitary monads
cites work: A fixpoint theorem for complete categories
cites work: Completely iterative algebras and completely iterative monads
cites work: The category-theoretic solution of recursive program schemes
cites work: Parametric corecursion
DOI: 10.1016/J.ENTCS.2010.07.011
title: Recursive program schemes and context-free monads
description: scientific article; zbMATH DE number 6089938