Laws of programming

  • Authors:
  • 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

  • Affiliations:
  • Univ. of Texas, Austin;Univ. of Queensland, Australia;Oxford Univ., Oxford, UK;Oxford Univ., Oxford, UK;Oxford Univ., Oxford, UK;Oxford Univ., Oxford, UK;Oxford Univ., Oxford, UK;Oxford Univ., Oxford, UK;Oxford Univ., Oxford, UK

  • Venue:
  • Communications of the ACM
  • Year:
  • 1987

Quantified Score

Hi-index 48.24

Visualization

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.