Recursive Program Schemes and Context-Free Monads

DOI10.1016/j.entcs.2010.07.011zbMath1247.68049MaRDI QIDQ2919447

Jiří Adámek, Jiří Velebil, Stefan Milius

Publication date: 2 October 2012

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2010.07.011

zbMATH Keywords

recursive program schemes; monads; algebraic trees; ideal theory

Mathematics Subject Classification ID

18C50: Categorical semantics of formal languages

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

18C15: Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads

Related Items

On second-order iterative monads

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The category-theoretic solution of recursive program schemes
• Fundamental properties of infinite trees
• Algebraic semantics
• Regular trees and the free iterative theory
• On the monadicity of finitary monads
• Infinite trees and completely iterative theories: A coalgebraic view
• Some remarks on finitary and iterative monads
• Completely iterative algebras and completely iterative monads
• A fixpoint theorem for complete categories
• Coequalizers and free triples
• Iterative algebras at work
• Iterative reflections of monads
• Dualising initial algebras
• Solving Algebraic Equations Using Coalgebra
• Coproducts of Ideal Monads
• A Coalgebraic View of Infinite Trees and Iteration
• Algebras, Coalgebras, Monads and Comonads
• Monads of coalgebras: rational terms and term graphs
• Semantics of Higher-Order Recursion Schemes
• Parametric corecursion