Thumbnail
Access Restriction
Subscribed

Author Hoare, C. A. R. ♦ Sorensen, I. H. ♦ Spivey, J. M. ♦ Jifeng, He ♦ Hayes, I. J. ♦ Sufrin, B. A. ♦ Roscoe, A. W. ♦ Morgan, C. C. ♦ Sanders, J. W.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
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.
Description Affiliation: Univ. of Queensland, Australia (Hayes, I. J.) || Univ. of Texas, Austin (Hoare, C. A. R.) || Oxford Univ., Oxford, UK (Jifeng, He; Morgan, C. C.; Roscoe, A. W.; Sanders, J. W.; Sorensen, I. H.; Spivey, J. M.; Sufrin, B. A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 30
Issue Number 8
Page Count 15
Starting Page 672
Ending Page 686


Open content in new tab

   Open content in new tab
Source: ACM Digital Library