skip to main content
article
Free Access

Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Published:01 August 1978Publication History
Skip Abstract Section

Abstract

Conventional programming languages are growing ever more enormous, but not stronger. Inherent defects at the most basic level cause them to be both fat and weak: their primitive word-at-a-time style of programming inherited from their common ancestor—the von Neumann computer, their close coupling of semantics to state transitions, their division of programming into a world of expressions and a world of statements, their inability to effectively use powerful combining forms for building new programs from existing ones, and their lack of useful mathematical properties for reasoning about programs.

An alternative functional style of programming is founded on the use of combining forms for creating programs. Functional programs deal with structured data, are often nonrepetitive and nonrecursive, are hierarchically constructed, do not name their arguments, and do not require the complex machinery of procedure declarations to become generally applicable. Combining forms can use high level programs to build still higher level ones in a style not possible in conventional languages.

Associated with the functional style of programming is an algebra of programs whose variables range over programs and whose operations are combining forms. This algebra can be used to transform programs and to solve equations whose “unknowns” are programs in much the same way one transforms equations in high school algebra. These transformations are given by algebraic laws and are carried out in the same language in which programs are written. Combining forms are chosen not only for their programming power but also for the power of their associated algebraic laws. General theorems of the algebra give the detailed behavior and termination conditions for large classes of programs.

A new class of computing systems uses the functional programming style both in its programming language and in its state transition rules. Unlike von Neumann languages, these systems have semantics loosely coupled to states—only one state transition occurs per major computation.

References

  1. 1 Arvind, and Gostelow, K.P. A new interpreter for data flow schemas and its implications for computer architecture. Tech. Rep. No. 72, Dept. Comptr. Sci., U. of California, Irvine, Oct. 1975.Google ScholarGoogle Scholar
  2. 2 Backus, J. Programming language semantics and closed applicative languages. Conf. Record ACM Symp. on Principles of Programming Languages, Boston, Oct. 1973, 71-86. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Berkling, K.J. Reduction languages for reduction machines. Interner Bericht ISF-76-8, Gesellschaft f'dr Mathematik und Datenverarbeitung MBH, Bonn, Sept. 1976.Google ScholarGoogle Scholar
  4. 4 Burge, W.H. Recursive Programming Techniques. Addison- Wesley, Reading, Mass., 1975.Google ScholarGoogle Scholar
  5. 5 Church, A. The Calculi of Lambda-Conversion. Princeton U. Press, Princeton, N.J., 1941. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Curry, H.B., and Feys, R. Combinatory Logic, Vol. 1. North- Holland Pub. Co., Amsterdam, 1958.Google ScholarGoogle Scholar
  7. 7 Dennis, J.B. First version of a data flow procedure language. Tech. Mem. No. 61, Lab. for Comptr. Sci., M.I.T., Cambridge, Mass., May 1973.Google ScholarGoogle Scholar
  8. 8 Dijkstra, E.W. ,4 Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J., 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Friedman, D.P., and Wise, D.S. CONS should not evaluate its arguments. In Automata, Languages and Programming, S. Michaelson and R. Milner, Eds., Edinburgh U. Press, Edinburgh, 1976, pp. 257-284.Google ScholarGoogle Scholar
  10. 10 Henderson, P., and Morris, J.H. Jr. A lazy evaluator. Conf. Record Third ACM Symp. on Principles of Programming Languages, Atlanta, Ga., Jan. 1976, pp. 95-103. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Hoare, C.A.R. An axiomatic basis for computer programming. Comm. ,4CM 12, 10 (Oct. 1969), 576-583. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 Iverson, K. A Programming Language. Wiley, New York, 1962. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Kosinski, P. A data flow programming language. Rep. RC 4264, IBM T.J. Watson Research Ctr., Yorktown Heights, N.Y., March 1973.Google ScholarGoogle Scholar
  14. 14 Landin, P.J. The mechanical evaluation of expressions. Computer J. 6, 4 (1964), 308-320.Google ScholarGoogle ScholarCross RefCross Ref
  15. 15 Mag~, G.A. A network of microprocessors to execute reduction languages. To appear in Int. J. Comptr. and Inform. Sci.Google ScholarGoogle Scholar
  16. 16 Manna, Z., Ness, S., and Vuillemin, J. Inductive methods for proving properties of programs. Comm.4 CM 16,8 (Aug. 1973) 491-502. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 McCarthy, J. Recursive functions of symbolic expressions and their computation by machine, Pt. 1. Comm. ,4CM 3, 4 (April 1960), 184-195. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 Me Jones, P. A Church-Rosser property of closed applicative languages. Rep. RJ 1589, IBM Res. Lab., San Jose, Calif., May 1975.Google ScholarGoogle Scholar
  19. 19 Reynolds, J.C. GEDANKEN--a simple typeless language based on the principle of completeness and the reference concept. Comm. ACM 13, 5 (May 1970), 308-318. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 Reynolds, J.C. Notes on a lattice-theoretic approach to the theory of computation. Dept. Syst. and Inform. Sci., Syracuse U., Syracuse, N.Y., 1972.Google ScholarGoogle Scholar
  21. 21 Scott, D. Outline of a mathematical theory of computation. Proc. 4th Princeton Conf. on Inform. Sci. and Syst., 1970.Google ScholarGoogle Scholar
  22. 22 Scott, D. Lattice-theoretic models for various type-free calculi. Proc. Fourth Int. Congress for Logic, Methodology, and the Philosophy of Science, Bucharest, 1972.Google ScholarGoogle Scholar
  23. 23 Scott, D., and Strachey, C. Towards a mathematical semantics for computer languages. Proc. Symp. on Comptrs. and Automata, Polytechnic Inst. of Brooklyn, 1971.Google ScholarGoogle Scholar

Index Terms

  1. Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

    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

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader