skip to main content
article
Free Access

Structured programming, programming teaching and the language Pascal

Published:01 July 1974Publication History
First page image

References

  1. ACM Curriculum Committee on Computer Education. "Curriculum 68. Recommendations for academic programs in computer science". C. ACM 11, 3 (1968).]]Google ScholarGoogle Scholar
  2. Sigplan symposium on languages for systems implementation, Lafayette, Indiana. Proceedings available in Sigplan Notices 6, 9 (1971).]]Google ScholarGoogle Scholar
  3. Sigplan-Sigops interface meeting, Savannah, Georgia. Proceedings available in Sigplan Notices 8, 9 (1973).]]Google ScholarGoogle Scholar
  4. Adams W. S. "The use of APL in teaching programming". in {Tur73}.]]Google ScholarGoogle Scholar
  5. Arsac J. "Quelques remarques et suggestions sur la justification des algorithmes". Revue Française d'Informatique et de Recherche Opérationnelle 5, B-3 (1971).]]Google ScholarGoogle Scholar
  6. Arsac J. "Un langage de programmation sans branchements". RIRO 6, B-2 (1972).]]Google ScholarGoogle Scholar
  7. Ashcroft E. & Manna Z. "The translation of goto programs to while programs". in {Fre72}.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Austing R. H. & Engel G. E. "A computer science course program for small colleges". C. ACM 16, 3 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Baker F. T. "System quality through structured programming". Proceedings of AFIPS 1972 FJCC.]]Google ScholarGoogle Scholar
  10. Bauer F. L. "Software engineering". in {Fre72}.]]Google ScholarGoogle Scholar
  11. Bazerque G. (ed.) "Programmes d'enseignement de l'informatique". RIRO 3, B-2 (1969).]]Google ScholarGoogle Scholar
  12. Bochmann G. V. "Multiple exits from a loop without the goto". C. ACM 16, 7 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Brinch-Hansen P. "Structured multiprogramming". C. ACM 15, 7 (1972).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Brooks, N. B. "Tactics, an integrated system for structured programming". Sigplan Notices 8, 6 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Burstall R. M. "Proving properties of programs by structural induction". Computer Journal 12, 1 (1969).]]Google ScholarGoogle ScholarCross RefCross Ref
  16. Chion J. S. & Cleemann E. F. "Le langage Algol W. Initiation aux algorithmes". Presses Universitaires de Grenoble (1973).]]Google ScholarGoogle Scholar
  17. Clark B. L. & Horning J. J. "The system language for project SUE". in {ACM71}.]]Google ScholarGoogle Scholar
  18. Clint M. & Hoare C. A. R. "Program proving: jumps and functions". Acta Informatica 1, 3 (1972).]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Clark B. L. & Horning J. J. "Reflections on a language designed to write an operating system". in {ACM73}.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Dahl O. J. & Hoare C. A. R. "Hierarchical program structures". in {DDH72}.]]Google ScholarGoogle Scholar
  21. Davidson M. "PL/I programming with PL/C". Houghton Miffen Co., Boston (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Dahl, O. J., Dijkstra E. W. & Hoare C. A. R. "Structured programming". Academic Press, London (1972).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Desjardins P. "A Pascal compiler for the Xerox Sigma 6". Sigplan Notices 8, 6 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Desjardins P. "Dynamic data structure mapping". Software practice and experience 4, 2 (1974).]]Google ScholarGoogle Scholar
  25. Dijkstra E. W. "Goto statement considered harmful". C. ACM 11, 3 (1968).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Dijkstra E. W. "A constructive approach to the problem of program correctness". BIT 8, 2 (1968).]]Google ScholarGoogle ScholarCross RefCross Ref
  27. Dijkstra E. W. "Notes on structured programming". Technische Hogeschool Eindhoven (1969).]]Google ScholarGoogle Scholar
  28. Dijkstra E. W. "Structured programming". in Buxton & Randell (ed.): "Software engineering techniques". NATO Science Committee (1970).]]Google ScholarGoogle Scholar
  29. Dijkstra E. W. "A short introduction to the art of programming". Department of Mathematics EWD316, Technological University, Eindhoven (1971).]]Google ScholarGoogle Scholar
  30. Dijkstra E. W. "Notes on structured programming". in {DDH72}.]]Google ScholarGoogle Scholar
  31. Dijkstra E. W. "The humble programmer". C. ACM 15, 10 (1972).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Flores I. "Algorithm 76: Sorting procedures". C. ACM 5, 1 (1962).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Floyd R. W. "Assigning meanings to programs". in Schwartz J. T. (ed.): "Mathematical aspects of computer science". American Mathematical Society, Providence (1967).]]Google ScholarGoogle Scholar
  34. Foley M. & Hoare C. A. R. "Proof of a recursive program: Quicksort". Computer Journal 14, 4 (1971).]]Google ScholarGoogle ScholarCross RefCross Ref
  35. Freiman C. V. (ed.) "Information Processing 71" (proceedings of {IFIP71}). North-Holland, Amsterdam (1972).]]Google ScholarGoogle Scholar
  36. Gries D. "Programming by induction". Information processing letters 1 (1972).]]Google ScholarGoogle Scholar
  37. Habermann A. N. "Critical comments on the programming language Pascal" (see {Wir72a}). Department of Computer Science, Carnegie-Mellon University, Pittsburgh (1973).]]Google ScholarGoogle Scholar
  38. Harrison M. C. "Data structures and programming". Courant Institute, New York University, New York (1971).]]Google ScholarGoogle Scholar
  39. Henderson P. & Snowdon R. "An experiment in structured programming". BIT 12, 1 (1972).]]Google ScholarGoogle ScholarCross RefCross Ref
  40. Hoare C. A. R. "An axiomatic approach to computer programming". C. ACM 12, 10 (1969).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Hoare C. A. R. "Notes on data structuring". in {DDH72}.]]Google ScholarGoogle Scholar
  42. Hoare C. A. R. "A note on the for statement". BIT 12, 3 (1972).]]Google ScholarGoogle ScholarCross RefCross Ref
  43. Hoare C. A. R. "Proof of correctness of data representations". Acta Informatica 1, 4 (1972).]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Hoare C. A. R. "The quality of software". Software practice and experience 2, 2 (1972).]]Google ScholarGoogle Scholar
  45. Hoare C. A. R. "Proof of a structured program: the sieve of Eratosthenes". Computer Journal 15 (1973).]]Google ScholarGoogle Scholar
  46. Hoare C. A. R. "Hints on programming language design". SIGACT/SIGPLAN Symposium on principles of programming languages, Boston (1973).]]Google ScholarGoogle Scholar
  47. Holt R. C. "Teaching the fatal disease (or) introductory computer programming using PL/I". Sigplan Notices 8, 5 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Hopkins M. E. "A case for the goto". Proceedings of ACM Nat. Conf., Boston (1972).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Hoare C. A. R. & Wirth N. "An axiomatic definition of the programming language Pascal". Berichte der Fachgruppe Computer-Wissenschaften 6, Eidgenössische Technische Hochschule, Zürich (1972).]]Google ScholarGoogle Scholar
  50. IBM Laboratory Vienna. "Formal definition of PL/I". Technical report TR 25.095-25.099 (1969).]]Google ScholarGoogle Scholar
  51. International Federation of Information Processing. IFIP Congress 1971, Ljubljana, (Yugoslavia) (1971). Proceedings in {Fre72}.]]Google ScholarGoogle Scholar
  52. International Federation of Information Processing. IFIP Technical Committee 2 working conference on programming teaching techniques, Zakopane, Poland (1972). Proceedings in {Tur73}.]]Google ScholarGoogle Scholar
  53. Ichbiah J. D., Rissen J. P. & Hééliard J. C. "The two-level approach to data definition and space management in the LIS system implementation language". in {ACM73}.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Jensen P. "The grok project: data structures and process communication". in {ACM73}.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. Knuth D. E. & Floyd R. W. "Notes on avoiding goto statements". Information processing lettere 1, 1 (1971).]]Google ScholarGoogle Scholar
  56. Knuth D. E. "The art of computer programming. Vol. I: Fundamental algorithms". Addison-Wesley, Reading (1968).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. Knuth D. E. "The art of computer programming. Vol. II: Seminumerical algorithms". Addison-Wesley, Reading (1969).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  58. Knuth D. E. "The art of computer programing. Vol. III: Sorting and searching". Addison-Wesley, Reading (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  59. Knuth D. E. "A review of 'Structured programming'" (see {DDH72}). Computer Science Department CS-371, Stanford University (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  60. Landin P. J. "The next 700 programming languages". C. ACM 9, 3 (1966).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  61. Laski J. G. "An undergraduate computing course: a critical study of some formative concepts in a real environment". in {Tur73}.]]Google ScholarGoogle Scholar
  62. Leavenworth B. M. "Programming with(out) the goto". Proceedings of ACM Nat. Conf., Boston (1972).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  63. Lecarme O. "What programming language should we use for teaching programming?" in {Tur73}.]]Google ScholarGoogle Scholar
  64. Lecarme O. "An experience in structured programming and transferability". in {ACM73}.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  65. Lee J. A. N. "The formal definition of the Basic language". Computer Journal 15, 1 (1972).]]Google ScholarGoogle ScholarCross RefCross Ref
  66. London R. L. "Correctness of a compiler for a Lisp subset". Sigplan Notices 7, 7 (1972).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  67. Lynch D. (SUNY at Buffalo) Answer to Pascal questionnaire distributed by University of Colorado at Boulder (1973).]]Google ScholarGoogle Scholar
  68. McKeag R. M. "Programming languages for operating systems". in {ACM73}.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  69. McCarthy J. & Painter J. A. "Correctness of a compiler for arithmetic expressions". in Schwartz J. T. (ed.): "Mathematical aspects of computer science" American Mathematical Society, Providence (1967).]]Google ScholarGoogle Scholar
  70. Mills H. "Top-down programming in large systems". in Rustin R. (ed.): "Debugging techniques in large systems". Prentice-Hall, Englewood Cliffs (1971).]]Google ScholarGoogle Scholar
  71. Miller E. F. "Extensions to Fortran to support structured programming". Sigplan Notices 8, 6 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  72. Manna Z., Ness S. & Vuillemin J. "Inductive methods for proving properties of programs". C. ACM 16, 8 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  73. Nassi I. & Shneiderman B. "Flowchart techniques for structured programming". Sigplan Notices 8, 8 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  74. Naur P. "Proof of algorithms by general snapshots". BIT 6, 4 (1966).]]Google ScholarGoogle ScholarCross RefCross Ref
  75. Naur P. "Programming by action clusters". BIT 9, 3 (1969).]]Google ScholarGoogle ScholarCross RefCross Ref
  76. Naur P. "An experiment in program development". BIT 12, 3 (1972).]]Google ScholarGoogle ScholarCross RefCross Ref
  77. Organick E. I. "Information structure concepts for beginners. An informal approach". in {Tur73}.]]Google ScholarGoogle Scholar
  78. Peck J. E. L. "Comparison of languages". in {Tur73}.]]Google ScholarGoogle Scholar
  79. Peterson W. W., Kasami T. & Tokura N. "On the capabilities of while, repeat and exit statements". C. ACM 16, 8 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  80. Polyà G. "How to solve it". Doubleday Anchor, New York (1948).]]Google ScholarGoogle Scholar
  81. Randell B. "Remark on algorithm 76: sorting procedures" (see {Flo62}). C. ACM 5, 6 (1962).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  82. Rice J. R. "The goto statement reconsidered" (see {Dij68a}). C. ACM 11, 8 (1968).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  83. Rosin R. F. "Teaching 'about programming"'. in {Tur73}.]]Google ScholarGoogle Scholar
  84. Rosin R. F. "Teaching 'about programming"' (revision of {Ros72}). C. ACM 16, 7 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  85. Shaw M. "A system for structured programming". Sigplan Notices 8, 6 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  86. Shaw M. & Wulf W. A. "Global variables considered harmful". Sigplan Notices 8, 2 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  87. Singleton R. C. "An efficient algorithm for sorting with minimal storage". C. ACM 12, 3 (1968).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  88. Thibault D. & Mancel P. "Implementation of a Pascal compiler for the CII Iris 80 computer". Sigplan Notices 8, 6 (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  89. Turski W. M. (ed.) "Programming teaching techniques" (proceedings of {IFIP72}). North-Holland, Amsterdam (1973).]]Google ScholarGoogle Scholar
  90. van der Poel W. L. "The programming language Hilt and its use in teaching". in {Tur73}.]]Google ScholarGoogle Scholar
  91. Weinberg G. M. "PL/I programming: a manual of style". McGraw-Hill, New York (1970).]]Google ScholarGoogle Scholar
  92. (72)13,23001 Weinberg G. M. "The psychology of computer programming". Van Nostrand Reinhold, New York (1971).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  93. Weinberg G. M. "Diverse approaches to teaching programming". in {Tur73}.]]Google ScholarGoogle Scholar
  94. Welsh J. & Quinn C. "A Pascal compiler for the ICL 1900 series computer". Software practice and experience 2, 1 (1972).]]Google ScholarGoogle Scholar
  95. Wulf W. A., Geschke C., Wile D. & Apperson J. "Reflections on a systems programming language". in {ACM71}.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  96. Wirth N. & Jensen K. "A user manual for Pascal". Eidgenöössische Technische Hochschule, Zürich (1973).]]Google ScholarGoogle Scholar
  97. Wirth N. "The programming language Pascal". Berichte der Fachgruppe Computer-Wissenschaften 1, Eidgenössische Technische Hochschule, Zürich (1970).]]Google ScholarGoogle Scholar
  98. Wirth N. "Program development by stepwise refinement". C. ACM 14, 4 (1971).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  99. Wirth N. "The programming language Pascal". Acta Informatica 1, 1 (1971).]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  100. "The design of a Pascal compiler". Software practice and experience 1, 4 (1971).]]Google ScholarGoogle Scholar
  101. Wirth N. "The programming language Pascal (revised report)". Berichte der Fachgruppe Computer-Wissenschaften 5, Eidgenössische Technische Hochschule, Zürich (1972).]]Google ScholarGoogle Scholar
  102. Wirth N. "On Pascal, code generation and the CDC 6000 computer". Computer Science Department CS 257, Stanford University (1972).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  103. Wirth N. "Systematisches Programieren". Teubner Verlag, Stuttgart (1972).]]Google ScholarGoogle Scholar
  104. Wirth N. "Systematic programing: an introduction". Prentice-Hall, Englewood Cliffs (1973).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  105. Weinberg G. M., Marcus R. & Yasukawa N. "Structured programing in PL/C. An abecedarian". John Wiley & Sons, New York (1973).]]Google ScholarGoogle Scholar
  106. Woodall A. D. "An internal sorting procedure using a two-way merge". Computer Journal 13, 1 (1970).]]Google ScholarGoogle Scholar
  107. Woodger M. "On semantic levels in programming". in {Fre72}.]]Google ScholarGoogle Scholar
  108. Wortman D. B. "Student PL. A PL/I dialect designed for teaching". Proceedings of Canadian Computer Conference, Montreal (1972).]]Google ScholarGoogle Scholar
  109. Wulf W. A., Russell D. B. & Habermann A. N. "Bliss: a language for systems programming". C. ACM 14, 12 (1971).]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  110. Wulf W. A. "Programming without the goto". in {Fre72}.]]Google ScholarGoogle Scholar
  111. Wulf W. A. "A case against the goto". Proceedings of ACM Nat. Conf., Boston (1972).]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGPLAN Notices
    ACM SIGPLAN Notices  Volume 9, Issue 7
    July 1974
    41 pages
    ISSN:0362-1340
    EISSN:1558-1160
    DOI:10.1145/953224
    Issue’s Table of Contents

    Copyright © 1974 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 July 1974

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader