Backus, J., Can programming be liberated from the yon Neumann style? A functional style and its algebra of processes, CACM, 21,613-41, 1978.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to use compile time methods based on source to source transformations so as to avoid run time overheads and achieve our goals of efficient communication, synchronization, and sequential execution. The use of meta programs to specify program transformations is common in declarative programming [3, 28, 38, 12, 5, 42]. Novel features of our approach include the integration of a pro grammable transformer into the compilation pipeline, linguistic support for invocation of transformations, and the use of set oriented abstractions for specifying transformations. An alternative approach to the implementation of ....

Backus, J., Can programming be liberated from the yon Neumann style? A functional style and its algebra of processes, CACM, 21,613-41, 1978.

....context and not on some notion of computational history. Each variable is given a value just once where it is declared. Assignments which alter data structures are particularly prone to cause bugs; disallowing them greatly simplifies the language although it does slow down execution. Backus [2] makes this case strongly. Maximum use of user defined tVDeS The user should define his own types whenever possible; thus type age rather than type integer . The machine must cheek these types. The language should allow polymorphie types so that code can be as general as possible; for ....

....selection of well understood ideas. HOPE seeks some blend of LISP power with the discipline of strong typing and modularity. It bears some resemblance to a number of other languages, including PROLOG [30] ML [17] SASL [28] OBJ [15] SCRATCHPAD [22] and languages by Burge [4] and Backus [2]. HOPE (in its present form) is an experiment in language design and a means of testing certain ideas in programming methodology rather than the ultimate in programming languages. It is still somewhat incomplete and lacks such conveniences as sensible input output facilities (but see section ....

[Article contains additional citation context not shown here]

Backus, J. Can Programming Be Liberated from the yon Neumann Style? A Functional Style and Its Algebra of Programs. CDmm. ACM?I, 8 (August 1978), 63-641.

....role of activity names, ii) it suggests how activity names can be represented by smaller tags, iii) it provides a framework for describing the resource requirements of programs, and (iv) it suggests how the resource requirements of programs can be controlled. It has been argued in the literature [12] that dataflw modeis are extremely amenable to formal 112 Conclusion : 9.0 analysis. This viewpoint is born out extensively in the thesis; powerful algebraic and graph theoretic techniques have been employed to analyze the nature of dataflow p The applications for these techniques extend beyond ....

Backus, J. "Can Programming Be Liberated from the yon Neumann Style? A Functional Style and Its Algebra of Programs". Communications of the ACM 21, 8 (August 1978), 613-641. 116

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC