skip to main content
article
Free Access

The paradigms of programming

Published:01 August 1979Publication History
Skip Abstract Section

Abstract

Today I want to talk about the paradigms of programming, how they affect our success as designers of computer programs, how they should be taught, and how they should be embodied in our programming languages.

References

  1. 1 Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass. 1974.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Aho, A.V., and Ullman, J.D. The Theory of Parsing, Translation, and Compiling, Vol. 1: Parsing. Prentice-Hall, Englewood Cliffs, New Jersey, 1972.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Balzer, R. Imprecise program specification. Report ISI/RR-75- 36, Inform. Sciences Inst., Dec. 1975.]]Google ScholarGoogle Scholar
  4. 4 Conway, M.E. Design of a separable transition-diagram compiler. Comm. ACM 6, 7 (July 1963), 396-408.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Davis, R. Interactive transfer of expertise: acquisition of new inference rules. Proc. Int. Joint Conf. on Artif. Intell., MIT, Cambridge, Mass., August 1977, pp. 321-328.]]Google ScholarGoogle Scholar
  6. 6 Dijkstra, E.W. Notes on structured programming. In Structured Programming, O.J. Dahl, E.W. Dijkstra, and C.A.R. Hoare, Academic Press, New York, 1972, pp. 1-82.]] Google ScholarGoogle Scholar
  7. 7 Donzeau-Gouge, V., Huet, G., Kahn, G., Lang, B., and Levy, J.J. A structure oriented program editor: A first step towards computer assisted programming. Res. Rep. 114, IRIA, Paris, April 1975.]]Google ScholarGoogle Scholar
  8. 8 Floyd, R.W. The syntax of programming languages--a survey. IEEE EC-13, 4 (Aug. 1964), 346-353.]]Google ScholarGoogle Scholar
  9. 9 Floyd, R.W. Nondeterministic algorithms. J.ACM 14, 4 (Oct. 1967), 636-644.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Gelernter. Realization of a geometry-theorem proving machine. In Computers and Thought, E. Feigenbaum and J. Feldman, Eds., McGraw-Hill, New York, 1963, pp. 134--152.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Green, C.C., and Barstow, D. On program synthesis knowledge. Artif. lntell. 10, 3 (June 1978), 241-279.]]Google ScholarGoogle Scholar
  12. 12 Hewitt, C. PLANNER: A language for proving theorems in robots. Proc. Int. Joint Conf. on Artif. Intell., Washington, D.C., 1969.]]Google ScholarGoogle Scholar
  13. 13 Hewitt, C. Description and theoretical analysis (using schemata) of PLANNER... AI TR-258, MIT, Cambridge, Mass., April 1972.]]Google ScholarGoogle Scholar
  14. 14 Hoare, C.A.R. Communicating sequential processes. Comm. ACM 21, 8 (Aug. 1978), 666-677.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 Jensen, K., and Wirth, N. Pascal User Manual and Report. Springer-Verlag, New York, 1978.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 Kuhn, T.S. The Structure of Scientific Revolutions. Univ. of Chicago Press, Chicago, Ill., 1970.]]Google ScholarGoogle Scholar
  17. 17 Lawler, E., and Wood, D. Branch and bound methods: A survey. Operations Res. 14, 4 (July-Aug. 1966), 699-719.]]Google ScholarGoogle Scholar
  18. 18 MACLISP Manual. MIT, Cambridge, Mass., July 1978.]]Google ScholarGoogle Scholar
  19. 19 Minsky, M. Form and content in computer science. Comm. A CM 17, 2 (April 1970), 197-215.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 Nilsson, N.J. Problem Solving Methods in Artificial Intelligence. McGraw-Hill, New York, 1971.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21 Parnas, D. On the criteria for decomposing systems into modules. Comm. ACM 15, 12 (Dec. 1972), 1053-1058.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22 Rich, C., and Shrobe, H. Initial report on a LISP programmer's apprentice. IEEE J. Software Eng. SE-4, 6 (Nov. 1978), 456--467.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23 Rulifson, J.F., Derkson, J.A., and Waldinger, R.J. QA4: A procedural calculus for intuitive reasoning. Tech. Note 73, Stanford Res. Inst., Menlo Park, Calif., Nov. 1972.]]Google ScholarGoogle Scholar
  24. 24 Shortliffe, E.H. Computer-based Medical Consultations: MYCIN. American Elsevier, New York, 1976.]]Google ScholarGoogle Scholar
  25. 25 Sussman, G.J., Winograd, T., and Charniak, C. MICRO- PLANNER reference manual. AI Memo 203A, MIT, Cambridge, Mass., 1972.]]Google ScholarGoogle Scholar
  26. 26 Teitelman, W., et al. INTERLISP manual. Xerox Palo Alto Res, Ctr., 1974.]]Google ScholarGoogle Scholar
  27. 27 Wirth, N. Program development by stepwise refinement. Comm. ACM 14, (April 1971), 221-227.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. 28 Wirth, N. The programming language Pascal. Acta lnformatica 1, 1 (1971), 35-63.]]Google ScholarGoogle Scholar
  29. 29 Wirth, N. Systematic Programming, an Introduction. Prentice- Hall, Englewood Cliffs, New Jersey, 1973.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The paradigms of programming
          Index terms have been assigned to the content through auto-classification.

          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 Communications of the ACM
            Communications of the ACM  Volume 22, Issue 8
            Aug. 1979
            40 pages
            ISSN:0001-0782
            EISSN:1557-7317
            DOI:10.1145/359138
            Issue’s Table of Contents

            Copyright © 1979 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 August 1979

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader