The existence and construction of free iterative theories
From MaRDI portal
Publication:1228350
DOI10.1016/S0022-0000(76)80003-7zbMath0333.68017MaRDI QIDQ1228350
Calvin C. Elgot, Stephen L. Bloom
Publication date: 1976
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Categories of machines, automata (18B20) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)
Related Items (21)
On flowchart theories. I. The deterministic case ⋮ Algebraic solutions to recursion schemes ⋮ Independence of the equational axioms for iteration theories ⋮ Iterative and recursive matrix theories ⋮ Unnamed Item ⋮ In memoriam Calvin C. Elgot ⋮ Base modules for parametrized iterativity ⋮ Finiteness and rational sequences, constructively ⋮ Regular trees and the free iterative theory ⋮ Terminal coalgebras and free iterative theories ⋮ On the algebraic structure of rooted trees ⋮ A semantically meaningful characterization of reducible flowchart schemes ⋮ Axiomatizing schemes and their behaviors ⋮ The solutions of two star-height problems for regular trees ⋮ On Rational Monads and Free Iterative Theories ⋮ Calvin C. Elgot (1922-1980) ⋮ Recursion and iteration in continuous theories: the M-construction ⋮ Implementation of data types by algebraic methods ⋮ Fundamental properties of infinite trees ⋮ Deterministic and nondeterministic flowchart interpretations ⋮ Closure functions and general iterates as reflectors
Cites Work
This page was built for publication: The existence and construction of free iterative theories
