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...
Auteur principal: | Sufrin, B |
---|---|
Format: | Journal article |
Publié: |
1987
|
Documents similaires
-
The Laws of Programming
par: Hoare, C, et autres
Publié: (1987) -
Laws of programming
par: Roscoe, A, et autres
Publié: (1987) -
Formal specification and design of a simple assembler
par: Sørensen, I, et autres
Publié: (1987) -
MA SEBAGAI HURUF DAN PERUBAHAN MAKNANYA DALAM BAHASA ARAB
par: Sufrin Efendi Lubis
Publié: (2020-09-01) -
مستقبل التعليم في إندونيسية بين الرجاء والتمني
par: Sufrin Efendi Lubis
Publié: (2019-10-01)