The category-theoretic solution of recursive program schemes
DOI10.1016/J.TCS.2006.07.002zbMATH Open1154.68041OpenAlexW2137773821MaRDI QIDQ860876FDOQ860876
Authors: Stefan Milius, Lawrence S. Moss 
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.002
Recommendations
coalgebraalgebraic treescompletely iterative monadElgot algebrarecursive program schemesecond-order substitution
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theories (e.g., algebraic theories), structure, and semantics (18C10) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinite trees and completely iterative theories: A coalgebraic view
- Completely iterative algebras and completely iterative monads
- On tree coalgebras and coalgebra presentations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Free iterative theories: a coalgebraic view
- On the final sequence of a finitary set functor
- On the algebraic structure of rooted trees
- Title not available (Why is that?)
- Algebras, coalgebras, monads and comonads
- Parametric corecursion
- Fundamental properties of infinite trees
- On coalgebra based on classes
- Terminal coalgebras in well-founded set theory
- Terminal coalgebras and free iterative theories
- A fixpoint theorem for complete categories
- Title not available (Why is that?)
- Solving reflexive domain equations in a category of complete metric spaces
- Title not available (Why is that?)
- A general theory of self-similarity
- Title not available (Why is that?)
- On the greatest fixed point of a set functor
- Algebraic semantics
- A Perspective View of Discrete Automata and Their Design
- A coalgebraic view of infinite trees and iteration
- General self-similarity: an overview
- Dualising initial algebras
- Solving Algebraic Equations Using Coalgebra
- Substitution in non-wellfounded syntax with variable binding
- Title not available (Why is that?)
- All solutions of a system of recursion equations in infinite trees and other contraction theories
- On iteratable endofunctors
- Banach's fixed-point theorem as a base for data-type equations
- Title not available (Why is that?)
- Algebra and Coalgebra in Computer Science
- Uniform Functors on Sets
Cited In (25)
- A category theoretic view of nondeterministic recursive program schemes
- Towards a geometry of recursion
- Monads for behaviour
- Algebraic solutions to recursion schemes
- Title not available (Why is that?)
- Recursive program schemes and context-free monads
- The coinductive resumption monad
- Categorial generalization of algebraic recursion theory
- Complete iterativity for algebras with effects
- Algebra and Coalgebra in Computer Science
- Title not available (Why is that?)
- On second-order iterative monads
- Title not available (Why is that?)
- Naturality of the conditional and the recursion∗
- A new foundation for finitary corecursion. The locally finite fixpoint and its properties
- Title not available (Why is that?)
- A Mezei-Wright theorem for categorical algebras
- Algebra and Coalgebra in Computer Science
- A new foundation for finitary corecursion and iterative algebras
- All solutions of a system of recursion equations in infinite trees and other contraction theories
- R-fuzzy computation
- Title not available (Why is that?)
- Corrigendum to: ``The category theoretic solution of recursive program schemes [Theoret. Comput. Sci. 366 (2006) 3-59]
- The bicategory-theoretic solution of recursive domain equations
- Tail recursion through universal invariants
This page was built for publication: The category-theoretic solution of recursive program schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860876)
