Affiliation:
1. CalCamp Display Products Division, Hudson, NH
Abstract
A new programming language construct, called DOupon, subsumes Dijkstra's selective (IF) and iterative (DO) constructs. DOupon has a predicate transformer approximately equivalent in complexity to that for DO. In addition, it simplifies a wide variety of algorithms, in form as well as in discovery and proof. Several theorems are demonstrated that are useful for correctness proofs and for optimization and that are not applicable to DO or IF. The general usefulness of DOupon derives from a separation of the concerns of invariance, through iteration, from those of termination.
Publisher
Association for Computing Machinery (ACM)
Reference8 articles.
1. Multiple exits from a loop without the GOTO
2. DIJKSTRA E.W. A Discipline of Programming. Prentice Hall Englewood Cliffs N.J. 1976. DIJKSTRA E.W. A Discipline of Programming. Prentice Hall Englewood Cliffs N.J. 1976.
3. Multiple exits from a loop using neither GO TO nor labels
4. Communicating sequential processes
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Terminable statements and destructive computation;ACM SIGPLAN Notices;1994-02
2. The flow of control notations pancode and boxcharts;ACM SIGPLAN Notices;1990-08
3. The effect of data abstraction on loop programming techniques;IEEE Transactions on Software Engineering;1990-04
4. On iterative constructs;ACM Transactions on Programming Languages and Systems;1990-01-03
5. A generalization of Dijkstra's calculus;ACM Transactions on Programming Languages and Systems;1989-10