×

zbMATH — the first resource for mathematics

Laws of programming. (English) Zbl 0629.68006
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.

MSC:
68N01 General topics in the theory of software
PDF BibTeX XML Cite
Full Text: DOI