论文信息 - Can programming be liberated from the von Neumann style

Can programming be liberated from the von Neumann style

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 styl...

BackusJohn

[1] Arvind,et al. A new interpreter for data flow schemas and its implications for computer architecture , 1975 .

[2] Jack B. Dennis,et al. First version of a data flow procedure language , 1974, Symposium on Programming.

[3] William H. Burge,et al. Recursive Programming Techniques , 1975 .

[4] P. J. Landin. The Mechanical Evaluation of Expressions , 1964, Comput. J..

[5] John W. Backus. Programming language semantics and closed applicative languages , 1973, POPL '73.

[6] Zohar Manna,et al. Inductive methods for proving properties of programs , 1973, Commun. ACM.

[7] John C. Reynolds,et al. GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept , 1970, Commun. ACM.

[8] A. Church. The calculi of lambda-conversion , 1941 .

[9] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .

[10] Daniel P. Friedman,et al. CONS Should Not Evaluate its Arguments , 1976, ICALP.

[11] E. Blum,et al. A programming language , 1899, AIEE-IRE '62 (Spring).

[12] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .

[13] Peter Henderson,et al. A lazy evaluator , 1976, POPL.

[14] John McCarthy,et al. Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.