scientific article; zbMATH DE number 139634

MaRDI QIDQ4029614zbMATH OpenFDO

Authors Wolfgang Wechler

Publication date 28 March 1993

zbMATH Keywords

free iterative algebrasiterative nondeterministic algebras

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Free algebras (08B20) Semantics in the theory of computing (68Q55)

Review text

[For the entire collection see Zbl 0745.00057.] Iterative algebras have been introduced by J. Tiuryn as models of Elgot's iterative algebraic theories. They are proposed as semantic domains for programming languages when programs are syntactically described by systems of equations. One of the main problems is the construction of free iterative algebras providing a possibility to reduce semantical questions to syntactical ones. The aim of the paper is the construction of free iterative nondeterministic algebras.

Recommendations

• Iterative algebras
• Iterative algebras at work
• From iterative algebras to iterative theories (extended abstract)
• Iterative algebras: how iterative are they?
• Completely iterative algebras and completely iterative monads

Cited in

(5)

• Free semiring-representations and nondeterminism
• Iterating conditionals and symmetric Stone algebras
• Kleene algebra with products and iteration theories
• scientific article; zbMATH DE number 3847366 (Why is no real title available?)
• Algebras of iteration theories

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 Q4029614)