Laws of programming

C. A.R. Hoare; I. J. Hayes; He Jifeng; C. C. Morgan; A. W. Roscoe; J. W. Sanders; I. H. Sorensen; J. M. Spivey; B. A. Sufrin

doi:10.1145/27651.27653

Laws of programming

C. A.R. Hoare
, I. J. Hayes
, He Jifeng
, C. C. Morgan
, A. W. Roscoe
, J. W. Sanders
, I. H. Sorensen
, J. M. Spivey
, B. A. Sufrin

Research output: Contribution to journal › Article › peer-review

291 Scopus citations

Abstract

A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of 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.

Original language	English
Pages (from-to)	672-686
Number of pages	15
Journal	Communications of the ACM
Volume	30
Issue number	8
DOIs	https://doi.org/10.1145/27651.27653
State	Published - 1 Aug 1987
Externally published	Yes

Access to Document

10.1145/27651.27653

Cite this

@article{510bdb998f4d49859d7bcae9f45c313b,

title = "Laws of programming",

abstract = "A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of 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.",

author = "Hoare, \{C. A.R.\} and Hayes, \{I. J.\} and He Jifeng and Morgan, \{C. C.\} and Roscoe, \{A. W.\} and Sanders, \{J. W.\} and Sorensen, \{I. H.\} and Spivey, \{J. M.\} and Sufrin, \{B. A.\}",

year = "1987",

month = aug,

day = "1",

doi = "10.1145/27651.27653",

language = "英语",

volume = "30",

pages = "672--686",

journal = "Communications of the ACM",

issn = "0001-0782",

publisher = "Association for Computing Machinery (ACM)",

number = "8",

}

TY - JOUR

T1 - Laws of programming

AU - Hoare, C. A.R.

AU - Hayes, I. J.

AU - Jifeng, He

AU - Morgan, C. C.

AU - Roscoe, A. W.

AU - Sanders, J. W.

AU - Sorensen, I. H.

AU - Spivey, J. M.

AU - Sufrin, B. A.

PY - 1987/8/1

Y1 - 1987/8/1

N2 - A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of 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.

AB - A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of 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.

UR - https://www.scopus.com/pages/publications/0023399227

U2 - 10.1145/27651.27653

DO - 10.1145/27651.27653

M3 - 文章

AN - SCOPUS:0023399227

SN - 0001-0782

VL - 30

SP - 672

EP - 686

JO - Communications of the ACM

JF - Communications of the ACM

IS - 8

ER -

Laws of programming

Abstract

Access to Document

Other files and links

Fingerprint

Cite this