Acta Informatica

, Volume 11, Issue 4, pp 287–304

do considered od: A contribution to the programming calculus

Authors

  • Eric C. R. Hehner
    • Computer Systems Research GroupUniversity of Toronto
Article

DOI: 10.1007/BF00289091

Cite this article as:
Hehner, E.C.R. Acta Informatica (1979) 11: 287. doi:10.1007/BF00289091

Summary

The utility of repetitive constructs is challenged. Recursive refinement is claimed to be semantically as simple, and superior for programming ease and clarity. Some programming examples are offered to support this claim. The relation between the semantics of predicate transformers and “least fixed point” semantics is presented.

Copyright information

© Springer-Verlag 1979