Journal article

LAWS OF PROGRAMMING.

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

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Sufrin, B. (1987). LAWS OF PROGRAMMING. Communications of the ACM, 30(8), 672–686.

MLA Style

Sufrin, B. “LAWS OF PROGRAMMING.” Communications of the ACM, vol. 30, no. 8, 1987, pp. 672–86.

Chicago Style

Sufrin, B. 1987. “LAWS OF PROGRAMMING.” Communications of the ACM 30 (8): 672–86.
Share
Print

Access Document

Publisher copy:: 10.1145/27651.27653

Authors

+ Sufrin, B More by this author

Role:: Author

Journal:: Communications of the ACM More from this journal
Volume:: 30
Issue:: 8
Pages:: 672-686
Publication date:: 1987-01-01
DOI:: 10.1145/27651.27653
ISSN:: 00010782

UUID:: uuid:3ae692fe-2d79-453b-a022-b13f8ae0d4b5
Local pid:: cs:5365
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 1987

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP