1

Arsac, J. Un langage de programmation sans branchements. Rev. Franc. d'Autom. Inf. Rech. Oper. (June 1972), 3-34.

2

Ahscroft, E., and Manna, Z. The translation of "go to" programs to "while" programs. In Inform, Proc. 71, 1971, pp. 147-152.

3

Ashcroft, E., and Manna, Z. Translating program schemes to while-schemes. SIAM J. Comptng. 4, 2(June 1975), 125-146.

4

Brenda S. Baker, An Algorithm for Structuring Flowgraphs, Journal of the ACM (JACM), v.24 n.1, p.98-120, Jan. 1977  [doi>10.1145/321992.321999]

5

Brenda S. Baker , S. Rao Kosaraju, A Comparison of Multilevel break and next Statements, Journal of the ACM (JACM), v.26 n.3, p.555-566, july 1979  [doi>10.1145/322139.322151]

6

Banachowski, L. Investigation of properties of programs by means of the extended algorithmic logic 1. Annal. Soc. Math. Pol., series IV, Fimdamenta Informaticae 1, 1 (1977), 93-119.

7

Banachowski, L., et al. An intorduction to algorithmic logic. In Mathematical Foundations of Computer Science, Mazurkiewitcz and Pawlak, Eds., Banach Ctr. Publications, Warsaw, Poland, 1977, pp. 7-99.

8

Joseph Louis Bates, A logic for correct program development, 1979

9

Bekic. H. Definable operations in general algebras, and the theory of automata and flowcharts. Tech. rep., IBM Lab., Vienna, Dec. 1969.

10

Benson, J.P. Structured programming techniques. Proc. IEEE Symp. on Comptr. Software Reliability, New York, April 1973, pp. 143-147.

11

Bjorner, D. Flowchart machines, BIT 10 (1970), 415-442.

12

Bloom, S.L., and Tindell, R. Algebraic and graph theoretic characterizations of structured flowchart schemes. Theoretical Comptr. Sci. 9 (1979), 265-286.

13

Boehm, B.W. Software design and structuring. In Practical Strategies for Developing Large Software Systems, E. Horowitz, Ed., Addison-Wesley, Reading, Mass., pp. 103-128.

14

Marilyn Bohl, A Guide for Programmers, Prentice Hall PTR, Upper Saddle River, NJ, 1977

15

Corrado Böhm , Giuseppe Jacopini, Flow diagrams, turing machines and languages with only two formation rules, Communications of the ACM, v.9 n.5, p.366-371, May 1966  [doi>10.1145/355592.365646]

16

Walter S. Brainerd , Lawrence H. Landweber, Theory of Computation, John Wiley & Sons, Inc., New York, NY, 1974

17

J. Bruno , K. Steiglitz, The Expression of Algorithms by Charts, Journal of the ACM (JACM), v.19 n.3, p.517-525, July 1972  [doi>10.1145/321707.321720]

18

Burks, A. W., Goldstine, H. H., and von Neumann, J. Preliminary discussion of the logical design of an electronic computing. instruments, 1946, In J. von Neumann, Collected Works, Vol, v. A.H. Taub, Ed., MacMillan, New York, 1963, pp. 34-79.

19

Ashok K. Chandra, Degrees of translatability and canonical forms in program schemas: Part I, Proceedings of the sixth annual ACM symposium on Theory of computing, p.1-12, April 30-May 02, 1974, Seattle, Washington, United States  [doi>10.1145/800119.803879]

20

Clark, K., and Cowell, D. Programs, Machines and Computations: An Introduction to the Theory of Computing. McGraw-Hill, New York, 1976.

21

Cohen, A.T., and Levi, L.S. Structured flowcharts for multiprocessing. Comptr. Language 3,4 (1978), 209-226.

22

David C. Cooper, Böhm and Jacopini's reduction of flow charts, Communications of the ACM, v.10 n.8, p.463, Aug. 1967  [doi>10.1145/363534.363539]

23

Cooper, D.C. Programs for mechanical program verification. Machine Intell, 6, Edinburgh Univ. Press. 1971, pp. 43-59.

24

Culik, K. Structured algorithms and structured programming Rep. CS-79-40, Dept. of Comptr. Sci., Penn. State Univ., Aug. 1979.

25

Culik, K. Entry strong components and their applications (in computer science). Rep. TR Nov. 79-01, Dept. of Comptr. Sci., Wayne State Univ., Nov. 1979.

26

Karel Culik, What is a flowchart loop and about structured programming, ACM SIGPLAN Notices, v.15 n.1, p.45-57, January 1980  [doi>10.1145/954127.954131]

27

Peter J. Denning, Comments on mathematical overkill, ACM SIGPLAN Notices, v.10 n.9, September 1975  [doi>10.1145/987316.987318]

28

Peter J. Denning, Two misconceptions about structured programming, Proceedings of the 1975 annual conference, p.214-215, January 1975  [doi>10.1145/800181.810321]

29

Edsger W. Dijkstra, Letters to the editor: go to statement considered harmful, Communications of the ACM, v.11 n.3, p.147-148, March 1968  [doi>10.1145/362929.362947]

30

Donaldson, J.R. Structured programming, Datamation 19,12 (Dec. 1973), 52-54.

31

Elgot, C.C. Monadiac computation and iterative algebraic theories. In Logic Colloquium '73, North-Holland Pub. Co., Amsterdam, 1975, pp. 175-230.

32

Elgot, C.C. Structured programming with and without go to statements. IEEE Trans. Software Eng. SE-2, 1 (March 1976), 41-54.

33

Elgot, C.C. Structure and meaning of elementary programs. Proc. Symp. Semantics of Algorithmic Languages, Lecture Notes in Math., Vol. 188, Springer-Verlag, New York, 1971, pp. 89-101.

34

Joost Engelfriet, Simple Program Schemes and Formal Languages, Springer-Verlag New York, Inc., Secaucus, NJ, 1974

35

Fischer, B., and Fischer, H. Structured Programming in PL/I and PL/C Marcel Dekker, Inc, New York and Basel, 1976.

36

Leslie Michael Goldschlager, Synchronous parallel computation., 1978

37

Seymour E. Goodman , S. T. Hedetniemi, Introduction to the Design and Analysis of Algorithms, McGraw-Hill, Inc., New York, NY, 1977

38

Sheila A. Greibach, Theory of Program Structures: Schemes, Semantics, Verification, Springer-Verlag New York, Inc., Secaucus, NJ, 1985

39

Harel, D. And/or programs: A new approach to structured programming. Proc IEEE Specifications for Reliable Software Conf., Cambridge, Mass., April 1979, pp. 80-90.

40

David Harel, On folk theorems, Communications of the ACM, v.23 n.7, p.379-389, July 1980  [doi>10.1145/358886.358892]

41

Harel, D., Norvig, P., Rood, J., and To, T. A universal flowcharter. In Proc. AIAA/IEEE/ACM/NASA Comptrs. in Aerospace Conf. IL, Los Angeles, Calif., Oct. 1979, pp. 218-224.

42

Hirose, K., and Oya, M. Some results in general theory of flow charts. Proc. of the First USA-Japan Comptr. Conf., Sponsored by AFIPS, Tokyo, Janpan, Oct. 1972, pp. 367-371.

43

Hirose, K., and Oya. M. General theory of flow charts. Comment. Math. Univ. St. Pauli, XI-2 (1972), 55-71.

44

Hopkins, M.E. A case for goto. SIGPLAN Notices (ACM) 7, 11 (Nov. 1972), 59-62; Proc. ACM Ann. Conf., boston, 1972.

45

Joan Kirkby Hughes, PL/I structured programming, John Wiley & Sons, Inc., New York, NY, 1986

46

J. K. Hughes , G. C. Michtom , J. I. Michtom, A structured approach to programming, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987

47

Indermark, K. On a class of schematic languages, Technical rep. 82, Inst. for Res. and Programming, Gesellschaft fur Mathematik und Datenverarbeitung mbH, Bonn, Germany, Nov. 1974.

48

Jensen, R. W., and Tonies, C.C., Software Engineering. Prenticehall, Engelwood Cliffs, N.J., 1979.

49

Kasai, T. Translatability of flowcharts into while programs, J. of Comptr. and Syst. Sciences 9, 2 (Oct. 1974), 177-195.

50

Kleene, S.C., Introduction to Metamathematics. Van Nostrand Co., New York, 1952.

51

Kleene, S.C. General recursive functions of natural numbers. Math. Annalan 112 (1936), 727-742.

52

Donald E. Knuth, Structured Programming with go to Statements, ACM Computing Surveys (CSUR), v.6 n.4, p.261-301, Dec. 1974  [doi>10.1145/356635.356640]

53

Knuth, D.E., and Floyd, R.W. Notes on avoiding "go to" statements. Inform. Processing Letters 1, (971), 23-31

54

Kosaraju, S.R. Analysis of structured programs. J. of Comptr. and Syst. Sciences 9, (1974), 232-255.

55

Kreczmar, A. Effectivity problems of algorithmic logic. In Annal. Soc. Math Pol. Series IV; Fundamenta Informaticae I, 1 (1977), 19- 32.

56

B. M. Leavenworth, Programming with(out) the GOTO, Proceedings of the ACM annual conference, p.782-786, August 01-01, 1972, Boston, Massachusetts, United States  [doi>10.1145/800194.805859]

57

Henry F. Ledgard , Michael Marcotty, A genealogy of control structures, Communications of the ACM, v.18 n.11, p.629-639, Nov. 1975  [doi>10.1145/361219.361222]

58

R. C. T. Lee , S. K. Chang, Structured programming and automatic program synthesis, Proceedings of the ACM SIGPLAN symposium on Very high level languages, p.60-70, March 28-29, 1974, Santa Monica, California, United States

59

Linger, R.C., and Mills, H.D. On the development of large reliable programs. In Current Trends in Programming Methodology, Vol. 1. R.T. Yeh, Ed., Prentice-Hall, Englewood, Cliffs, N.J., 1977, pp. 120-139.

60

Richard C. Linger , Bernard I. Witt , H. D. Mills, Structured Programming; Theory and Practice the Systems Programming Series, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1979

61

Johannes J. Martin, The 'natural' set of basic control structures, ACM SIGPLAN Notices, v.8 n.12, December 1973  [doi>10.1145/987006.987008]

62

McGowan, C. Structured programming: A review of some practical concepts. Computer 8, 6 (1975) 25-30.

63

McGowan, C. L., and Kelly, J.R. Top-Down Structured Programming Techniques. Petrocelli/Charter, New York, 1975.

64

Merton, R.K. On the Shoulders of Giants: A Shandean Postscript. Harcourt, Brace and World, New York, 1965.

65

Meyer, A.R., and Ritchie, D.M. The complexity of loop programs. IBM Res. Rep. rc-1817, 1966.

66

Miller, E.F., Jr., and Lindamood, G.E. Structured programming: Top-down approach. Datamation 19, 12 (Dec. 1973), 55-57.

67

Mills, H.D. Mathematical foundations for structured programming. IBM rep. FSC 72-6012, Fed. Syst. Div., Gaithersburg, Md., 1972.

68

Harlan D. Mills, The new math of computer programming, Communications of the ACM, v.18 n.1, p.43-48, Jan. 1975  [doi>10.1145/360569.360659]

69

Mills, H.D. How to write correct programs and know it. Proc. IEEE Tutorial on Structured Programming, Washington, D.C., Sept. 1975, pp. 84-91.

70

Mirkowska, G. Algorithmic logic and its applications. Doctoral diss. Univ. of Warsaw, 1972 (In Polish).

71

Glenford J Myers, Reliable software through composite design, Petrocelli/Charter, 1975

72

Glenford J. Myers, Composite Structure Design, John Wiley & Sons, Inc., New York, NY, 1978

73

I. Nassi , B. Shneiderman, Flowchart techniques for structured programming, ACM SIGPLAN Notices, v.8 n.8, p.12-26, August 1973  [doi>10.1145/953349.953350]

74

Peter M. Neely, On program control structure, Proceedings of the annual conference, p.119-125, August 27-29, 1973, Atlanta, Georgia, United States  [doi>10.1145/800192.805692]

75

John E. Nicholls, The Structure and Design of Programming Languages, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1975

76

Partch, B. Improved technology for application development management overview. Proc. SHARE XLI, Miami, Florida, Aug. 1973, pp. 1281-1300.

77

Perkowska, E. Theorem on the normal form of a program. Bull. Acad. Pol. Sci., Ser. Sci. Math. Astr. Phys. 22, 4 (1974), 439-442.

78

W. W. Peterson , T. Kasami , N. Tokura, On the capabilities of while, repeat, and exit statements, Communications of the ACM, v.16 n.8, p.503-512, Aug. 1973  [doi>10.1145/355609.362337]

79

Thomas W. S. Plum, Mathematical overkill and the structure theorem, ACM SIGPLAN Notices, v.10 n.2, p.32-33, February 1975  [doi>10.1145/953438.953442]

80

Prather, R.E. Structured Turing machines. Inform. and Control 35 (1977), 159-171.

81

Pratt, V.R. Semantical considerations on Floyd-Hoare logic. Proc. 17th Symp. on Foundations of Comptr. Sci., Houston, Texas, Oct. 1976, pp. 109-129.

82

Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987

83

Tnuryn, J. Fixed-points and algebras with infinetly long expressions, part II mu-clones of regular algebras. Technical rep. 311, Inst. of Comptr. Sci. Polish. Acad. of Sci. 1978.

84

Allen van Gelder, Structured programming in Cobol: an approach for application programmers, Communications of the ACM, v.20 n.1, p.2-12, Jan. 1977  [doi>10.1145/359367.359368]

85

Wand. M. A concrete approach to abstract recursive definitions In Automata. Languages and Programmin. M. Nivat. Ed. North- Holland Pub. Co. Amsterdam, 1973, pp. 331-341.

86

Wise, D.S. Foedman, D.P. Shapiro, S.C. and Wand, M. Boolean-valued loops BIT 15 (1975), 431-451.

87

William A. Wulf, A case against the GOTO, Proceedings of the ACM annual conference, p.791-797, August 01-01, 1972, Boston, Massachusetts, United States  [doi>10.1145/800194.805861]

88

Edward Yourdon, Techniques of Program Structure and Design, Prentice Hall PTR, Upper Saddle River, NJ, 1986

89

E. Yourdon, Managing the structured techniques: 4th edition, Prentice-Hall, Inc., Upper Saddle River, NJ, 1988

90

Edward Yourdon , Larry L. Constantine, Structured Design: Fundamentals of a Discipline of Computer Program and Systems Design, Prentice-Hall, Inc., Upper Saddle River, NJ, 1979

91

Marvin V. Zelkowitz , Alan C. Shaw , John D. Gannon, Principles of Software Engineering and Design, Prentice Hall Professional Technical Reference, 1979

Steven D. Johnson, Applicative programming and digital design, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.218-227, January 15-18, 1984, Salt Lake City, Utah, United States

R. Gerth , A. Pnueli, Rooting UNITY, ACM SIGSOFT Software Engineering Notes, v.14 n.3, p.11-19, May 1989

Robert L. Ashenhurst, ACM forum, Communications of the ACM, v.23 n.12, p.735-737, Dec. 1980

David Harel, On folk theorems, Communications of the ACM, v.23 n.7, p.379-389, July 1980

Leslie Lamport, win and sin: predicate transformers for concurrency, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.3, p.396-428, July 1990

J. R. Allen , Ken Kennedy , Carrie Porterfield , Joe Warren, Conversion of control dependence to data dependence, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.177-189, January 24-26, 1983, Austin, Texas

Dexter Kozen, Kleene algebra with tests, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.3, p.427-443, May 1997

Lyle Ramshaw, Eliminating go to's while preserving program structure, Journal of the ACM (JACM), v.35 n.4, p.893-920, Oct. 1988

Raúl Rojas, How to Make Zuse's Z3 a Universal Computer, IEEE Annals of the History of Computing, v.20 n.3, p.51-54, July 1998

Jeanette M. Bruno , Daniel J. Rosenkrantz, Interactive control restructuring, ACM SIGAda Ada Letters, v.XIV n.SI, p.36-53, Fall 1994

L. P. Lisovik, Structured Turing Machines, Cybernetics and Systems Analysis, v.40 n.2, p.162-168, March-April 2004

G. A. Ringwood, SLD: a folk acronym?, ACM SIGPLAN Notices, v.24 n.5, p.71-75, May 1989

Thuy Duong Vu, Goto elimination in program algebra, Science of Computer Programming, v.73 n.2-3, p.95-128, October, 2008

David Harel: colleagues