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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dijkstra, E.W.: A Discipline of Programming. New Jersey: Prentice-Hall 1976
Dijkstra, E.W.: Guarded commands, non-determinacy, and formal derivation of programs. CACM 18(8) p. 453, August 1975
Dijkstra, E.W.: A Short Introduction to the Art of Programming. Report EWD316, Technological University of Eindhoven, August 1971
Knuth, D.E.: Structured programming with go to statements. ACM Computing Surveys 6(4), December 1974
Ledgard, H.F., Marcotty, M.: A genealogy of control structures. CACM 18(11), November 1975
Scott, D.: Outline of a mathematical theory of computation. Proceedings of Fourth Annual Princeton Conference on Information Science and Systems, pp. 169–176, 1970
Wirth, N.: Program development by stepwise refinement, CACM 14(4) pp. 221–227, April 1971
Author information
Authors and Affiliations
Additional information
This work was partially supported by the National Research Council of Canada
Rights and permissions
About this article
Cite this article
Hehner, E.C.R. do considered od: A contribution to the programming calculus. Acta Informatica 11, 287–304 (1979). https://doi.org/10.1007/BF00289091
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00289091