Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
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
Teaching the fatal disease: (or) introductory computer programming using PL/I
ACM SIGPLAN Notices
A programming language
ACM '74 Proceedings of the 1974 annual conference - Volume 1
| Hi-index | 0.00 |
Recent advances in programming languages have sometimes drastically altered program structure as in the Reduction Languages of Backus (3) or produced less drastic but nonetheless dramatic effects like the elimination of the “goto” statement in an increasing number of “structured” programming languages (4). Now waiting in the wings are demands for topologically simpler program structures which will ease code optimization problems, increase programmer productivity, and aid automatic verification of program correctness. In these respects, perhaps the most advanced high-level programming language yet developed is Aiken Dynamic Algebra (ADA), the younger sister of APL (5, 6, 7). Boyce (8) has already shown the improved efficiency of ADA on pipeline and parallel machines, but his results for ADA in a sequential environment were inconclusive. This study reports the comparison of a sequential ADA implementation with the standard instruction sets of two existing sequential machine designs, the IBM 1130 and the IBM 360. Addition of 150 microinstructions allowed simultaneously a 5 to 35% decrease in execution time and a 5 to 40% decrease in the storage requirements for code to implement identical algorithms.