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

Descrizione completa

Dettagli Bibliografici
Autore principale: Sufrin, B
Natura: Journal article
Pubblicazione: 1987

Documenti analoghi