The category-theoretic solution of recursive program schemes
From MaRDI portal
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 5572668 (Why is no real title available?)
- scientific article; zbMATH DE number 3709584 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 46168 (Why is no real title available?)
- scientific article; zbMATH DE number 194082 (Why is no real title available?)
- scientific article; zbMATH DE number 3540387 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 692330 (Why is no real title available?)
- scientific article; zbMATH DE number 952378 (Why is no real title available?)
- scientific article; zbMATH DE number 233974 (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
- A general theory of self-similarity
- Algebra and Coalgebra in Computer Science
- Algebraic semantics
- Algebras, coalgebras, monads and comonads
- All solutions of a system of recursion equations in infinite trees and other contraction theories
- Banach's fixed-point theorem as a base for data-type equations
- Completely iterative algebras and completely iterative monads
- Dualising initial algebras
- Free iterative theories: a coalgebraic view
- Fundamental properties of infinite trees
- General self-similarity: an overview
- Infinite trees and completely iterative theories: A coalgebraic view
- On coalgebra based on classes
- On iteratable endofunctors
- On the algebraic structure of rooted trees
- On the final sequence of a finitary set functor
- On the greatest fixed point of a set functor
- On tree coalgebras and coalgebra presentations
- Parametric corecursion
- Solving Algebraic Equations Using Coalgebra
- Solving reflexive domain equations in a category of complete metric spaces
- Substitution in non-wellfounded syntax with variable binding
- Terminal coalgebras and free iterative theories
- Terminal coalgebras in well-founded set theory
- Uniform Functors on Sets
Cited in
(25)- Naturality of the conditional and the recursion∗
- All solutions of a system of recursion equations in infinite trees and other contraction theories
- A new foundation for finitary corecursion. The locally finite fixpoint and its properties
- scientific article; zbMATH DE number 729924 (Why is no real title available?)
- R-fuzzy computation
- A Mezei-Wright theorem for categorical algebras
- The coinductive resumption monad
- Corrigendum to: ``The category theoretic solution of recursive program schemes [Theoret. Comput. Sci. 366 (2006) 3-59]
- scientific article; zbMATH DE number 177429 (Why is no real title available?)
- Complete iterativity for algebras with effects
- On second-order iterative monads
- The bicategory-theoretic solution of recursive domain equations
- Tail recursion through universal invariants
- Algebra and Coalgebra in Computer Science
- A category theoretic view of nondeterministic recursive program schemes
- Algebraic solutions to recursion schemes
- Algebra and Coalgebra in Computer Science
- scientific article; zbMATH DE number 3940702 (Why is no real title available?)
- Categorial generalization of algebraic recursion theory
- scientific article; zbMATH DE number 5572668 (Why is no real title available?)
- A new foundation for finitary corecursion and iterative algebras
- Monads for behaviour
- Towards a geometry of recursion
- Recursive program schemes and context-free monads
- scientific article; zbMATH DE number 742726 (Why is no real title available?)
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)
