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

類似資料