The following pages link to (Q4134935):
Displaying 21 items.
- Algebras of iteration theories (Q789159) (← links)
- Algebraic characterization of reducible flowcharts (Q789162) (← links)
- Iterative factor algebras and induced metrics (Q790606) (← links)
- Extensions of iterative congruences of free iterative algebras (Q792751) (← links)
- Algebras, polynomials and programs (Q802882) (← links)
- Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories (Q1059404) (← links)
- Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories (Q1059405) (← links)
- On flowchart theories. I. The deterministic case (Q1093364) (← links)
- Algebraic solutions to recursion schemes (Q1098617) (← links)
- Independence of the equational axioms for iteration theories (Q1106011) (← links)
- An equational axiomatization of systolic systems (Q1122990) (← links)
- Partially additive categories and flow-diagram semantics (Q1137858) (← links)
- Unique fixed points vs. least fixed points (Q1142573) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- More on advice on structuring compilers and proving them correct (Q1156472) (← links)
- Tree constructions of free continuous algebras (Q1160149) (← links)
- Free omega-complete algebras (Q1162535) (← links)
- Classes of finite relations as initial abstract data types. I (Q1179266) (← links)
- Group axioms for iteration (Q1283821) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Completeness of Park induction (Q1391869) (← links)
