Where to go from here
Part of the Texts and Monographs in Computer Science book series (MCS)
We have seen a number of methods. We have applied these methods to a number of examples. While the examples were not the subject matter, I have tried to choose generally useful ones.
KeywordsProgramming Language Binary Tree Mathematical Argument Quantification Elimination Predicate Transformer
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- Edsger W. Dijkstra (ed.), Formal Development of Programs and Proofs, Addison-Wesley 1989.Google Scholar
- E.W. Dijkstra, On the cruelty of really teaching computing science, EWD 1036, The University of Texas at Austin, 1988.Google Scholar
- Roland C. Backhouse, Program Construction and Verification, Prentice Hall 1986.Google Scholar
- David Gries (ed.), Programming Methodology, Springer-Verlag 1978.Google Scholar
- E.W. Dijkstra, Ascending functions and The Welfare Crook, EWD 1031, The University of Texas at Austin, 1988.Google Scholar
- E.W. Dijkstra, Guarded commands, nondeterminacy and the formal derivation of programs, Communications of the ACM 18 (1975), 453–7. (Also reproduced in .)Google Scholar
- Eric C.R. Hehner, The Logic of Programming, Prentice-Hall 1984.Google Scholar
- M. Rem, Small programming exercises, Science of Computer Programming. This is an on-going column. Problems posed in one column are solved in the subsequent one. Great attention is paid to “solution strategies”.Google Scholar
- E.W. Dijkstra and W.H.J. Feijen, The linear search revisited, Structured Programming 10 (1989), 5–9.Google Scholar
- Anne Kaldewaij and Barry Schoenmakers, Searching by elimination, Science of Computer Programming, to appear.Google Scholar
- W.H.J. Feijen, A bagatelle (for the files), WF101, The University of Texas at Austin, 1988.Google Scholar
- Rob Hoogerwoord, The design of functional programs: a calculational approach, Ph.D. thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, 1989.Google Scholar
- Richard Bird and Phillip Wadler, An Introduction to Functional Programming, Prentice-Hall 1988.Google Scholar
- A.J.M. van Gasteren and W.H.J. Feijen, Shiloach’s algorithm, taken as an exercise in presenting programs, Nieuw Archief voor Wiskunde XXX (1982), 277–282.Google Scholar
- R.S. Boyer and J.S. Moore, MJRTY, A fast majority-vote algorithm.Google Scholar
- D. Gries, What programmers don’t and should know, Technical Report, Computer Science Department, Cornell University 1987.Google Scholar
© Springer-Verlag New York Inc. 1990