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, B. A. Laws of programming. (English) Zbl 0629.68006 Commun. ACM 30, No. 8, 672-686 (1987). A complete set of algebraic laws is given for Dijkstra’s nondeterministic sequential programming language. Iteration and recursion are explained in terms of 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. Cited in 2 ReviewsCited in 56 Documents MSC: 68N01 General topics in the theory of software PDF BibTeX XML Cite \textit{C. A. R. Hoare} et al., Commun. ACM 30, No. 8, 672--686 (1987; Zbl 0629.68006) Full Text: DOI