Communications of the ACM
Letters to the editor: go to statement considered harmful
Communications of the ACM
The next 700 programming languages
Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
A report on the value of some advanced high level language operators on current sequential computers
HLLCA '73 Proceedings of the ACM-IEEE symposium on High-level-language computer architecture
Reflections on a systems programming language
Proceedings of the SIGPLAN symposium on Languages for system implementation
A program verifier
Computer programming with a dynamic algebra
Computer programming with a dynamic algebra
Topological reorganization as an aid to program simplification
Topological reorganization as an aid to program simplification
A programming language
Towards a canonical form for computer programs
ACM '75 Proceedings of the 1975 annual conference
| Hi-index | 0.00 |
A language or set of languages, called dynamic algebras, which will simplify programming and provide the capability of simplifying programs are proposed. In such languages, the constructions of arithmetic and algebra are emphasized, resulting in fewer but larger statements, rather than smaller, explicitly sequenced assignments and transfer A set of operators (called the Aiken operators) are introduced and their usefulness demonstrated. Three examples are presented of the simplification of dynamic algebra programs using the ordinary rules of algebra. Finally, the efficiency of such programs on von Neumann, parallel, and pipeline machines is discussed.