On second-order iterative monads

DOI10.1016/J.TCS.2011.04.027MaRDI QIDQ639639zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

rational treesalgebraic treesguarded recursive program schemesideal monads

Mathematics Subject Classification ID

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)

Recommendations

• Recursive program schemes and context-free monads
• On iteratable endofunctors
• On rational monads and free iterative theories
• Equational properties of iterative monads
• Iterative algebras at work

Cites work

• scientific article; zbMATH DE number 3458870 (Why is no real title available?)
• scientific article; zbMATH DE number 575948 (Why is no real title available?)
• A Perspective View of Discrete Automata and Their Design
• 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
• DPDA's in 'Atomic normal form' and applications to equivalence problems
• Dualising initial algebras
• Fundamental properties of infinite trees
• 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
• Recursive program schemes and context-free monads
• 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

(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)