TY - GEN
T1 - On the algebraic specification of nondeterministic programming languages
AU - Broy, M.
AU - Wirsing, M.
N1 - Publisher Copyright:
© 1981, Springer-Verlag.
PY - 1981
Y1 - 1981
N2 - Different semantic models for a nondeterministic programming language are defined, analysed, and compared in the formal framework of algebraic specifications of programming languages by abstract types. Four abstract types are given representing choice ("erratic") nondeterminism, backtrack ("demonic") nondeterminism, unbounded ("angelic") nondeterminism and loose nondeterminism. The classes of algebras of these types represent classes of semantic models. A comparison of these classes of semantic models shows the connections and differences between the four different concepts of nondeterminism as found in programming languages.
AB - Different semantic models for a nondeterministic programming language are defined, analysed, and compared in the formal framework of algebraic specifications of programming languages by abstract types. Four abstract types are given representing choice ("erratic") nondeterminism, backtrack ("demonic") nondeterminism, unbounded ("angelic") nondeterminism and loose nondeterminism. The classes of algebras of these types represent classes of semantic models. A comparison of these classes of semantic models shows the connections and differences between the four different concepts of nondeterminism as found in programming languages.
UR - http://www.scopus.com/inward/record.url?scp=85034443457&partnerID=8YFLogxK
U2 - 10.1007/3-540-10828-9_61
DO - 10.1007/3-540-10828-9_61
M3 - Conference contribution
AN - SCOPUS:85034443457
SN - 9783540108283
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 162
EP - 179
BT - CAAP 1981
A2 - Astesiano, Egidio
A2 - Bohm, Corrado
PB - Springer Verlag
T2 - 6th Colloquium on Trees in Algebra and Programming, CAAP 1981
Y2 - 5 March 1981 through 7 March 1981
ER -