On second-order iterative monads
From MaRDI portal
Publication:639639
DOI10.1016/j.tcs.2011.04.027zbMath1243.68206OpenAlexW1997917280MaRDI QIDQ639639
Stefan Milius, Jiří Velebil, Jiří Adámek
Publication date: 22 September 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.027
Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Accessible and locally presentable categories (18C35) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Abstract and axiomatic computability and recursion theory (03D75)
Related Items (3)
Unnamed Item ⋮ A New Foundation for Finitary Corecursion ⋮ A new foundation for finitary corecursion and iterative algebras
Cites Work
- Unnamed Item
- Unnamed Item
- The category-theoretic solution of recursive program schemes
- Fundamental properties of infinite trees
- Algebraic semantics
- DPDA's in 'Atomic normal form' and applications to equivalence problems
- 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
- Recursive Program Schemes and Context-Free Monads
- 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
- A Perspective View of Discrete Automata and Their Design
- Semantics of Higher-Order Recursion Schemes
- Parametric corecursion
This page was built for publication: On second-order iterative monads
