On the algebraic structure of rooted trees
From MaRDI portal
Publication:1251061
DOI10.1016/0022-0000(78)90024-7zbMath0389.68007OpenAlexW4210249530MaRDI QIDQ1251061
Stephen L. Bloom, Ralph Tindell, Calvin C. Elgot
Publication date: 1978
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(78)90024-7
Trees (05C05) Semantics in the theory of computing (68Q55) Directed graphs (digraphs), tournaments (05C20) General topics in the theory of software (68N01)
Related Items (53)
The coinductive resumption monad ⋮ Some quasi-varieties of iteration theories ⋮ Matrix and matricial iteration theories. II ⋮ On flowchart theories. I. The deterministic case ⋮ Independence of the equational axioms for iteration theories ⋮ The category-theoretic solution of recursive program schemes ⋮ Unnamed Item ⋮ How iterative reflections of monads are constructed ⋮ The equational logic of fixed points ⋮ Completeness of Park induction ⋮ Partially additive categories and flow-diagram semantics ⋮ Equational properties of iterative monads ⋮ Unique fixed points vs. least fixed points ⋮ Infinite trees and completely iterative theories: A coalgebraic view ⋮ Unnamed Item ⋮ In memoriam Calvin C. Elgot ⋮ Base modules for parametrized iterativity ⋮ Finiteness and rational sequences, constructively ⋮ Iteration Semirings ⋮ Unnamed Item ⋮ Programs as partial graphs. I: Flow equivalence and correctness ⋮ Unifying Guarded and Unguarded Iteration ⋮ Classes of finite relations as initial abstract data types. I ⋮ An algebraic model of synchronous systems ⋮ Elgot theories: a new perspective on the equational properties of iteration ⋮ A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization ⋮ Iterative reflections of monads ⋮ Completely iterative algebras and completely iterative monads ⋮ Infinite trees in normal form and recursive equations having a unique solution ⋮ Codes and equations on trees ⋮ Distributive laws for the coinductive solution of recursive equations ⋮ Terminal coalgebras and free iterative theories ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Scalar and vector iteration ⋮ On the many facets of lists ⋮ A Description of Iterative Reflections of Monads (Extended Abstract) ⋮ Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract) ⋮ A semantically meaningful characterization of reducible flowchart schemes ⋮ Final coalgebras in accessible categories ⋮ Solving Algebraic Equations Using Coalgebra ⋮ Generalizing Substitution ⋮ Axiomatizing schemes and their behaviors ⋮ The solutions of two star-height problems for regular trees ⋮ Equational logic of circular data type specification ⋮ Group axioms for iteration ⋮ Representation of ordered trees ⋮ Coalgebraic Monads ⋮ On Rational Monads and Free Iterative Theories ⋮ On Iteratable Endofunctors ⋮ Calvin C. Elgot (1922-1980) ⋮ All solutions of a system of recursion equations in infinite trees and other contraction theories ⋮ Fundamental properties of infinite trees ⋮ Algebraic presentation of semifree monads
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The existence and construction of free iterative theories
- Scalar and vector iteration
- Matricial theories
- Parallel concepts in graph theory
- Initial Algebra Semantics and Continuous Algebras
- Automata in general algebras
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- A Perspective View of Discrete Automata and Their Design
This page was built for publication: On the algebraic structure of rooted trees
