Pages that link to "Item:Q1251061"
From MaRDI portal
The following pages link to On the algebraic structure of rooted trees (Q1251061):
Displaying 50 items.
- The coinductive resumption monad (Q283770) (← links)
- How iterative reflections of monads are constructed (Q384934) (← links)
- Equational properties of iterative monads (Q618163) (← links)
- The solutions of two star-height problems for regular trees (Q760212) (← links)
- Calvin C. Elgot (1922-1980) (Q788706) (← links)
- All solutions of a system of recursion equations in infinite trees and other contraction theories (Q791310) (← links)
- The category-theoretic solution of recursive program schemes (Q860876) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- On flowchart theories. I. The deterministic case (Q1093364) (← links)
- Independence of the equational axioms for iteration theories (Q1106011) (← links)
- Partially additive categories and flow-diagram semantics (Q1137858) (← links)
- Unique fixed points vs. least fixed points (Q1142573) (← links)
- In memoriam Calvin C. Elgot (Q1154455) (← links)
- Programs as partial graphs. I: Flow equivalence and correctness (Q1168723) (← links)
- Classes of finite relations as initial abstract data types. I (Q1179266) (← links)
- An algebraic model of synchronous systems (Q1186811) (← links)
- A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization (Q1193888) (← links)
- Scalar and vector iteration (Q1238420) (← links)
- On the many facets of lists (Q1249041) (← links)
- A semantically meaningful characterization of reducible flowchart schemes (Q1254851) (← links)
- Group axioms for iteration (Q1283821) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Completeness of Park induction (Q1391869) (← links)
- Infinite trees and completely iterative theories: A coalgebraic view (Q1399957) (← links)
- Completely iterative algebras and completely iterative monads (Q1767976) (← links)
- Axiomatizing schemes and their behaviors (Q1819574) (← links)
- Equational logic of circular data type specification (Q1825026) (← links)
- Algebraic presentation of semifree monads (Q2104481) (← links)
- Matrix and matricial iteration theories. II (Q2366692) (← links)
- Base modules for parametrized iterativity (Q2435311) (← links)
- Distributive laws for the coinductive solution of recursive equations (Q2495644) (← links)
- Terminal coalgebras and free iterative theories (Q2500475) (← links)
- Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract) (Q2805168) (← links)
- Coalgebraic Monads (Q2842553) (← links)
- On Rational Monads and Free Iterative Theories (Q2842813) (← links)
- On Iteratable Endofunctors (Q2842827) (← links)
- Unifying Guarded and Unguarded Iteration (Q2988389) (← links)
- Elgot theories: a new perspective on the equational properties of iteration (Q3005993) (← links)
- Final coalgebras in accessible categories (Q3094168) (← links)
- Iteration Semirings (Q3532996) (← links)
- Iterative reflections of monads (Q3564343) (← links)
- A Description of Iterative Reflections of Monads (Extended Abstract) (Q3617727) (← links)
- Infinite trees in normal form and recursive equations having a unique solution (Q3851585) (← links)
- Representation of ordered trees (Q3919099) (← links)
- (Q4192947) (← links)
- Solving Algebraic Equations Using Coalgebra (Q4460687) (← links)
- Generalizing Substitution (Q4460688) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- (Q4968384) (← links)
- (Q5274901) (← links)
