On second-order iterative monads
DOI10.1016/J.TCS.2011.04.027zbMATH Open1243.68206OpenAlexW1997917280MaRDI QIDQ639639FDOQ639639
Authors: Jiří Adámek, Stefan Milius, Jiří Velebil 
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
Recommendations
Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Accessible and locally presentable categories (18C35) Abstract and axiomatic computability and recursion theory (03D75)
Cites Work
- Infinite trees and completely iterative theories: A coalgebraic view
- Completely iterative algebras and completely iterative monads
- Coequalizers and free triples
- Iterative algebras at work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coproducts of Ideal Monads
- The category-theoretic solution of recursive program schemes
- Algebras, coalgebras, monads and comonads
- Parametric corecursion
- Fundamental properties of infinite trees
- Regular trees and the free iterative theory
- A fixpoint theorem for complete categories
- Iterative reflections of monads
- Algebraic semantics
- A Perspective View of Discrete Automata and Their Design
- Some remarks on finitary and iterative monads
- A coalgebraic view of infinite trees and iteration
- On the monadicity of finitary monads
- DPDA's in 'Atomic normal form' and applications to equivalence problems
- Recursive program schemes and context-free monads
- Dualising initial algebras
- Solving Algebraic Equations Using Coalgebra
- Monads of coalgebras: rational terms and term graphs
Cited In (10)
- Generalizing Substitution
- Strongly normalising cyclic data computation by iteration categories of second-order algebraic theories
- Recursive program schemes and context-free monads
- Equational properties of iterative monads
- Iterative reflections of monads
- A Description of Iterative Reflections of Monads (Extended Abstract)
- A new foundation for finitary corecursion. The locally finite fixpoint and its properties
- Proper functors and fixed points for finite behaviour
- Some remarks on finitary and iterative monads
- A new foundation for finitary corecursion and iterative algebras
This page was built for publication: On second-order iterative monads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q639639)
