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...

Ful tanımlama

Detaylı Bibliyografya
Yazar: Sufrin, B
Materyal Türü: Journal article
Baskı/Yayın Bilgisi: 1987
Search Result 1
Search Result 2