%0 Journal Article %1 citeulike:933736 %A Backus, John %C New York, NY, USA %D 1978 %I ACM %J Commun. ACM %K functional-programming haskell %N 8 %P 613--641 %R 10.1145/359576.359579 %T Can Programming Be Liberated from the Von Neumann Style?: A Functional Style and Its Algebra of Programs %U http://dx.doi.org/10.1145/359576.359579 %V 21 %X 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.

@article{citeulike:933736, 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.}}, added-at = {2019-06-18T20:47:03.000+0200}, address = {New York, NY, USA}, author = {Backus, John}, biburl = {https://www.bibsonomy.org/bibtex/2ea6770ebaa4800a4a9e39d236b801750/alexv}, citeulike-article-id = {933736}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=359579}, citeulike-linkout-1 = {http://dblp.uni-trier.de/rec/bibtex/journals/cacm/Backus78}, citeulike-linkout-2 = {http://dx.doi.org/10.1145/359576.359579}, doi = {10.1145/359576.359579}, interhash = {3e80ad2dff9c5249a25d5459f36c8f95}, intrahash = {ea6770ebaa4800a4a9e39d236b801750}, issn = {0001-0782}, journal = {Commun. ACM}, keywords = {functional-programming haskell}, month = aug, number = 8, pages = {613--641}, posted-at = {2016-05-18 18:45:57}, priority = {2}, publisher = {ACM}, timestamp = {2019-08-24T00:10:12.000+0200}, title = {{Can Programming Be Liberated from the Von Neumann Style?: A Functional Style and Its Algebra of Programs}}, url = {http://dx.doi.org/10.1145/359576.359579}, volume = 21, year = 1978 }