Laws of programming (1987)
Cached
Download Links
- [web.comlab.ox.ac.uk]
- [www.cas.mcmaster.ca]
- DBLP
Other Repositories/Bibliography
by
C. A. R. Hoare
,
J. Hayes
,
He Jifeng
,
C. C. Morgan
,
A. W. Roscoe
,
J. W. Sanders
,
H. Sorensen
,
J. M. Spivey
,
B. A. Sufrin
| Venue: | Communications of the ACM |
| Citations: | 86 - 4 self |
BibTeX
@ARTICLE{Hoare87lawsof,
author = {C. A. R. Hoare and J. Hayes and He Jifeng and C. C. Morgan and A. W. Roscoe and J. W. Sanders and H. Sorensen and J. M. Spivey and B. A. Sufrin},
title = {Laws of programming},
journal = {Communications of the ACM},
year = {1987},
volume = {30},
pages = {672--686}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
