The category-theoretic solution of recursive program schemes
type: Item
instance of: scholarly article
title: The category-theoretic solution of recursive program schemes
zbMATH Open document ID: 1154.68041
author: Stefan Milius
author: Lawrence S. Moss
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 18C10
Mathematics Subject Classification ID: 18C15
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 5083518
zbMATH Keywords: recursive program scheme
zbMATH Keywords: Elgot algebra
zbMATH Keywords: coalgebra
zbMATH Keywords: completely iterative monad
zbMATH Keywords: algebraic trees
zbMATH Keywords: second-order substitution
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.07.002
OpenAlex ID: W2137773821
cites work: Q3992552
cites work: Infinite trees and completely iterative theories: A coalgebraic view
cites work: A Coalgebraic View of Infinite Trees and Iteration
cites work: On the greatest fixed point of a set functor
cites work: Terminal coalgebras and free iterative theories
cites work: Free iterative theories: a coalgebraic view
cites work: On coalgebra based on classes
cites work: On tree coalgebras and coalgebra presentations
cites work: Banach's fixed-point theorem as a base for data-type equations
cites work: Q3996444
cites work: Solving reflexive domain equations in a category of complete metric spaces
cites work: Q3900995
cites work: Q4040874
cites work: Terminal coalgebras in well-founded set theory
cites work: Q4717366
cites work: All solutions of a system of recursion equations in infinite trees and other contraction theories
cites work: Q5287508
cites work: Q4314472
cites work: Fundamental properties of infinite trees
cites work: A Perspective View of Discrete Automata and Their Design
cites work: On the algebraic structure of rooted trees
cites work: Algebras, Coalgebras, Monads and Comonads
cites work: Solving Algebraic Equations Using Coalgebra
cites work: Dualising initial algebras
cites work: Algebraic semantics
cites work: A fixpoint theorem for complete categories
cites work: Q5755494
cites work: A general theory of self-similarity
cites work: Q4215784
cites work: Substitution in non-wellfounded syntax with variable binding
cites work: On iteratable endofunctors
cites work: Completely iterative algebras and completely iterative monads
cites work: Algebra and Coalgebra in Computer Science
cites work: Q3635984
cites work: Parametric corecursion
cites work: Uniform Functors on Sets
cites work: Q4116078
cites work: On the final sequence of a finitary set functor
DOI: 10.1016/J.TCS.2006.07.002
description: scientific article; zbMATH DE number 5083518