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...
Main Author: | Sufrin, B |
---|---|
Format: | Journal article |
Published: |
1987
|
Similar Items
-
Laws of programming
by: Roscoe, A, et al.
Published: (1987) -
The Laws of Programming
by: Hoare, C, et al.
Published: (1987) -
Formal specification and design of a simple assembler
by: Sørensen, I, et al.
Published: (1987) -
مستقبل التعليم في إندونيسية بين الرجاء والتمني
by: Sufrin Efendi Lubis
Published: (2019-10-01) -
مهارة الاستماع وضوابطها في اللغة العربية
by: Sufrin Efendi Lubis
Published: (2020-06-01)