Structured Programming With and Without go to Statements
Calvin C. Elgot · IEEE Transactions on Software Engineering · 1976
While "Dijkstra flow-chart schemes" (built out of assignment statement schemes by means of composition, IF—THEN and WHILEDO) are simple and perspicuous, they lack the descriptive power of flow-chart schemes (provided additional "variables" are not permitted). On the other hand, the analogous multiexit composition binary alternation-conditional iteration (CACI) schemes introduced below, which are virtually as simple and perspicuous as Dijkstra schemes, describe exactly the same computational processes as flow-chart schemes (without the aid of additional variables).