scientific article; zbMATH DE number 3562490
From MaRDI portal
Publication:4134935
zbMATH Open0361.68041MaRDI QIDQ4134935FDOQ4134935
Joseph Goguen, Eric G. Wagner, Jesse B. Wright, James W. Thatcher
Publication date: 1976
Title of this publication is not available (Why is that?)
General topics in the theory of software (68N01) Ordered rings, algebras, modules (06F25) Categories of machines, automata (18B20)
Cited In (21)
- On flowchart theories. I. The deterministic case
- Algebraic solutions to recursion schemes
- Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories
- Unique fixed points vs. least fixed points
- Partially additive categories and flow-diagram semantics
- Extensions of iterative congruences of free iterative algebras
- Independence of the equational axioms for iteration theories
- Group axioms for iteration
- Classes of finite relations as initial abstract data types. I
- Completeness of Park induction
- The equational logic of fixed points
- Varieties of chain-complete algebras
- Tree constructions of free continuous algebras
- Free omega-complete algebras
- More on advice on structuring compilers and proving them correct
- Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
- An equational axiomatization of systolic systems
- Algebras of iteration theories
- Algebraic characterization of reducible flowcharts
- Iterative factor algebras and induced metrics
- Algebras, polynomials and programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4134935)
