Laws of programming
- 1 August 1987
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 30 (8) , 672-686
- https://doi.org/10.1145/27651.27653
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- Predicative programming Part ICommunications of the ACM, 1984
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- On the calculus of relationsThe Journal of Symbolic Logic, 1941