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...
Main Author: | |
---|---|
Format: | Journal article |
Published: |
1987
|
_version_ | 1797063522000044032 |
---|---|
author | Sufrin, B |
author_facet | Sufrin, B |
author_sort | Sufrin, B |
collection | OXFORD |
description | 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 suggested as an aid to deriving programs from their specifications. |
first_indexed | 2024-03-06T21:01:05Z |
format | Journal article |
id | oxford-uuid:3ae692fe-2d79-453b-a022-b13f8ae0d4b5 |
institution | University of Oxford |
last_indexed | 2024-03-06T21:01:05Z |
publishDate | 1987 |
record_format | dspace |
spelling | oxford-uuid:3ae692fe-2d79-453b-a022-b13f8ae0d4b52022-03-26T14:04:22ZLAWS OF PROGRAMMING.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:3ae692fe-2d79-453b-a022-b13f8ae0d4b5Department of Computer Science1987Sufrin, BA 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 suggested as an aid to deriving programs from their specifications. |
spellingShingle | Sufrin, B LAWS OF PROGRAMMING. |
title | LAWS OF PROGRAMMING. |
title_full | LAWS OF PROGRAMMING. |
title_fullStr | LAWS OF PROGRAMMING. |
title_full_unstemmed | LAWS OF PROGRAMMING. |
title_short | LAWS OF PROGRAMMING. |
title_sort | laws of programming |
work_keys_str_mv | AT sufrinb lawsofprogramming |