scientific article; zbMATH DE number 3562490

zbMath0361.68041MaRDI QIDQ4134935

Joseph A. Goguen, Jesse B. Wright, James W. Thatcher, Eric G. Wagner

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Ordered rings, algebras, modules (06F25) Categories of machines, automata (18B20)

Related Items (21)

On flowchart theories. I. The deterministic case ⋮ Algebraic solutions to recursion schemes ⋮ Independence of the equational axioms for iteration theories ⋮ An equational axiomatization of systolic systems ⋮ The equational logic of fixed points ⋮ Completeness of Park induction ⋮ Partially additive categories and flow-diagram semantics ⋮ Unique fixed points vs. least fixed points ⋮ Varieties of chain-complete algebras ⋮ More on advice on structuring compilers and proving them correct ⋮ Tree constructions of free continuous algebras ⋮ Free omega-complete algebras ⋮ Classes of finite relations as initial abstract data types. I ⋮ Group axioms for iteration ⋮ Algebras of iteration theories ⋮ Algebraic characterization of reducible flowcharts ⋮ Iterative factor algebras and induced metrics ⋮ Extensions of iterative congruences of free iterative algebras ⋮ Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories ⋮ Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories ⋮ Algebras, polynomials and programs

This page was built for publication: