Difference between revisions of "Paper/Laws of programming"
Jump to navigation
Jump to search
| Line 25: | Line 25: | ||
|volume=30 | |volume=30 | ||
|number=8 | |number=8 | ||
|location=[[Paper/Laws of programming|local page]] | |||
}} | }} | ||
Latest revision as of 04:45, 20 January 2022
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. (Aug 1987). "Laws of Programming" (PDF). 30 (8). local page: ACM.
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.
One should also watch Dana Scott's lectures on calculus[1].
