LAWS OF PROGRAMMING.
B.A. Hoare C.A.R. Hayes I.J. He Jifeng Morgan C. C. Roscoe A.W. Sanders J.W. Sorensen I.H. Spivey J.M. Sufrin
Abstract
A complete set of algebraic laws is given for E. W. Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of D. S. Scott's domain theory as fixed points of continuous functionals. A calculus analogous to weakest preconditions is suggested as an aid to deriving programs from their specifications.
ISSN
00010782
Journal
Communications of the ACM
Language
English
Number
8
Pages
672−686
Volume
30
Year
1987