LAWS OF PROGRAMMING.
A complete set of algebraic laws is given for E. W. Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of D. S. Scott's domain theory as fixed points of continuous functionals. A calculus analogous to weakest preconditions is suggest...
| מחבר ראשי: | |
|---|---|
| פורמט: | Journal article |
| יצא לאור: |
1987
|
| סיכום: | A complete set of algebraic laws is given for E. W. Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of D. S. 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. |
|---|