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