Abstract
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).
Theorem 9.1 makes contact with “reducible flow-graphs” an active area in its own right.
An erratum to this chapter is available at http://dx.doi.org/10.1007/978-1-4613-8177-8_14
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Ashcroft and A. Manna, “The translation of ‘go to’ programs to ‘while’ programs,” in Proc. Int. Fed. Inform. Processing Congr., 1971, vol. 1. Amsterdam, The Netherlands: North-Holland, 1972.
S. L. Bloom and C. C. Elgot, “The existence and construction of free iterative theories,” IBM Corp., Yorktown Heights, NY, Res. Rep. RC-4937, July 1974; also to appear in J. Comput. Syst. Sci.
A. Bohm and A. Jacopini, “Flow diagrams, turing machines and languages with only two formation rules,” Commun. Ass. Comput. Mach., May 1966.
A. Bruno and A. Stieglitz, “The expression of algorithms by charts,” J. Ass. Comput. Mach., July 1972.
C. C. Elgot, “The common algebraic structure of exit automata and machines,” Comput., Jan. 1971.
C. C. Elgot, “Monadic computation and iterative algebraic theories,” in Logic Colloquium ’73, vol. 80, Studies in Logic, H. E. Rose and J. C. Shepherdson, Ed. Amsterdam, The Netherlands: North-Holland, 1975.
C. C. Elgot, “Matrical theories,” IBM Corp., Yorktown Heights, NY, Res. Rep. RC-4833, May 1974; also to appear in J. Algebra.
D. C. Copper, “Bohm and Jacopini’s reduction of flow charts,” Commun. Ass. Comput. Mach. (Lett. Editor), Aug. 1967.
D. E. Knuth, “Structured programming with go to statements,” Comput. Surveys, Dec. 1974.
F. E. Allen, “Control flow analysis,” SIGPLAN Notices, vol. 5, pp. 1–19, 1970.
F. T. Baker, “Chief programmer team management of production programming,” IBM Syst. J., vol. 11, no. 1, 1972.
H. D. Mills, “Mathematical foundations for structured programming,” IBM Corp., Gaithersburg, MD, Rep. FSC 72-6012, FSD, 1972.
H. D. Mills, “Top down programming in large systems,” in Debugging Techniques in Large Systems, Courant Computer Science Symp., vol. 1, R. Rustin, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1971.
M. S. Hecht and J. D. Ullman, “Flow graph reducibility,” SIAM J. Comput., vol. 1, pp. 188–202, June 1972.
J. Cocke, “Global common subexpression elimination,” SIGPLAN Notices, vol. 5, pp. 20–24, 1970.
J. D. Rutledge, “On Ianov’s program schemata,” J. Ass. Comput. Mach., Jan. 1964.
A. Knuth and A. Floyd, “Notes on avoiding ‘go to’ statements,” Inform. Processing Lett., vol. 1, 1971; errata, Inform. Processing Lett., vol. 1, 1972.
A. Luckham, A. Park, and A. Paterson, “On formalized computer programs,” J. Comput. Syst. Sci., June 1970.
S. R. Kosaraju, “Analysis of structured programs,” in Proc. Fifth Annu. Ass. Comput. Mach. Symp. Theory of Computing, May 1973; also in J. Comput. Syst. Sci., Dec. 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Elgot, C.C. (1982). Structured Programming With and Without GO TO Statements. In: Bloom, S.L. (eds) Selected Papers. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8177-8_10
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8177-8_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-8179-2
Online ISBN: 978-1-4613-8177-8
eBook Packages: Springer Book Archive