Multiple exits from a loop using neither GO TO nor labels

Evans, Reginald

doi:10.1145/361179.361207

Cited by 4 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Boehmann [2] and Evans [6] mention two, and we have discussed some already. From a theoretical point of view, the best understood [12] is a while or until structure used in conjunction with an exit or escape statement.…”

Section: While-until Versus Until/exitmentioning

confidence: 97%

Boolean-valued loops

Wise

Friedman

Shapiro

et al. 1975

BIT

View full text Add to dashboard Cite

Abstract.A new control structure construct, the while-until, is introduced as a syntactic combination of the while statement and the repeat-until statement. Examples show that the use of the while-until can lead to structured programs that are conceptually more manageable than those attainable without it. The while-until statement is then extended to a value-returning expression which is shown to be more powerful than the classical looping structures. It is shown to be equivalent in power to those structures with exit when a value-returning if-then-else is allowed. As a consequence, there are flowcharts whose implementations require control structures stronger than the while-until. Implementation details are discussed and Hoare-like axioms are presented. A closing discussion on (esthetics discourages some natural generalizations, but it concludes that the basic whileuntil is convenient for all parties on a programming team: coder, reader, compiler, and validator.

show abstract

Section: While-until Versus Until/exitmentioning

confidence: 97%

Boolean-valued loops

Wise

Friedman

Shapiro

et al. 1975

BIT

View full text Add to dashboard Cite

show abstract

A generalized iterative construct and its semantics

Anson¹

1987

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

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.

show abstract

ACM forum

1975

Commun. ACM

View full text Add to dashboard Cite

Multiple exits from a loop using neither GO TO nor labels

Cited by 4 publications

References 3 publications

Boolean-valued loops

Boolean-valued loops

A generalized iterative construct and its semantics

ACM forum

Contact Info

Product

Resources

About