do considered od: A contribution to the programming calculus
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.
Unable to display preview. Download preview PDF.
- 1.Dijkstra, E.W.: A Discipline of Programming. New Jersey: Prentice-Hall 1976Google Scholar
- 2.Dijkstra, E.W.: Guarded commands, non-determinacy, and formal derivation of programs. CACM 18(8) p. 453, August 1975Google Scholar
- 3.Dijkstra, E.W.: A Short Introduction to the Art of Programming. Report EWD316, Technological University of Eindhoven, August 1971Google Scholar
- 4.Knuth, D.E.: Structured programming with go to statements. ACM Computing Surveys 6(4), December 1974Google Scholar
- 5.Ledgard, H.F., Marcotty, M.: A genealogy of control structures. CACM 18(11), November 1975Google Scholar
- 6.Scott, D.: Outline of a mathematical theory of computation. Proceedings of Fourth Annual Princeton Conference on Information Science and Systems, pp. 169–176, 1970Google Scholar
- 7.Wirth, N.: Program development by stepwise refinement, CACM 14(4) pp. 221–227, April 1971Google Scholar