The category-theoretic solution of recursive program schemes

DOI10.1016/j.tcs.2006.07.002zbMath1154.68041OpenAlexW2137773821MaRDI QIDQ860876

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

zbMATH Keywords

coalgebraalgebraic treescompletely iterative monadElgot algebrarecursive program schemesecond-order substitution

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theories (e.g., algebraic theories), structure, and semantics (18C10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)

Related Items

Monads for behaviour, Complete Iterativity for Algebras with Effects, The coinductive resumption monad, Recursive Program Schemes and Context-Free Monads, On second-order iterative monads, Corrigendum to: ``The category theoretic solution of recursive program schemes [Theoret. Comput. Sci. 366 (2006) 3-59], Semantics of Higher-Order Recursion Schemes, A New Foundation for Finitary Corecursion, A new foundation for finitary corecursion and iterative algebras, A Mezei-Wright theorem for categorical algebras

Cites Work

• On the final sequence of a finitary set functor
• A general theory of self-similarity
• On the greatest fixed point of a set functor
• Solving reflexive domain equations in a category of complete metric spaces
• All solutions of a system of recursion equations in infinite trees and other contraction theories
• Fundamental properties of infinite trees
• Algebraic semantics
• On the algebraic structure of rooted trees
• Banach's fixed-point theorem as a base for data-type equations
• Infinite trees and completely iterative theories: A coalgebraic view
• On coalgebra based on classes
• Completely iterative algebras and completely iterative monads
• On tree coalgebras and coalgebra presentations
• Terminal coalgebras in well-founded set theory
• Terminal coalgebras and free iterative theories
• A fixpoint theorem for complete categories
• On Iteratable Endofunctors
• Free iterative theories: a coalgebraic view
• Dualising initial algebras
• Solving Algebraic Equations Using Coalgebra
• A Coalgebraic View of Infinite Trees and Iteration
• Algebras, Coalgebras, Monads and Comonads
• Algebra and Coalgebra in Computer Science
• A Perspective View of Discrete Automata and Their Design
• Uniform Functors on Sets
• Parametric corecursion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item