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...
Главный автор: | Sufrin, B |
---|---|
Формат: | Journal article |
Опубликовано: |
1987
|
Схожие документы
-
The Laws of Programming
по: Hoare, C, и др.
Опубликовано: (1987) -
Laws of programming
по: Roscoe, A, и др.
Опубликовано: (1987) -
Formal specification and design of a simple assembler
по: Sørensen, I, и др.
Опубликовано: (1987) -
MA SEBAGAI HURUF DAN PERUBAHAN MAKNANYA DALAM BAHASA ARAB
по: Sufrin Efendi Lubis
Опубликовано: (2020-09-01) -
مستقبل التعليم في إندونيسية بين الرجاء والتمني
по: Sufrin Efendi Lubis
Опубликовано: (2019-10-01)