Cited By
View all- Noonan RBrown RGlaze D(1974)Dynamic algebraProceedings of the 1974 annual conference - Volume 110.1145/800182.810420(326-334)Online publication date: 1-Jan-1974
A report on the value of some advanced high level language operators on current sequential computers
Pages 117 - 123
Abstract
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.
References
[1]
N. R. Lincoln, "Parallel Programming Techniques," unpublished paper at the Symposium on Compiler Optimization, University of Illinois at Urbana-Champaign, May 27-28, 1970.
[2]
N.R. Lincoln, unpublished presentation at the Symposium on Languages for Systems Implementation, Purdue University, October 25-26, 1971.
[3]
J. Backus, "Reduction languages and variable-free programming," IBM Research Report RJ1010, (April, 1972).
[4]
B. M. Leavenworth, Editor, Special Issue on Control Structures in Programming Languages, SIGPLAN Notices, 7,11 (November, 1972).
[5]
K. E. Iverson, A Programming Language, (New York: John Wiley and Sons, 1962), p. viii.
[6]
H. Aiken, "The Algebracizing of Computer Programs," Purdue University Colloquium, (November, 1969).
[7]
R. E. Noonan, Computer Programming in a Dynamic Algebra, Ph. D. thesis, Purdue University, (June, 1971).
[8]
R. F. Boyce, Topological Reorganization as an Aid to Program Simplification, Ph. D. thesis, Purdue University, (June, 1972).
[9]
L. J. Schutte, Ph. D. thesis, to be published, Purdue University, (1973).
[10]
R. C. Holt, "Teaching the Fatal Disease (or) Introductory Computer Programming Using PL/I," SIGPLAN Notices, 8, 5 (May, 1973), p. 22.
[11]
R. C. Holt, ibid, p. 16.
[12]
Anonymous, IBM System/360 Model 44 Functional Characteristics, Form A22-6875-6, pp. 15-34.
[13]
C. Bohm and G. Jacopini, "Flow Diagrams, Turing Machines and Languages With Only Two Formation Rules," CACM, 9, 5 (May, 1966).
Index Terms
- A report on the value of some advanced high level language operators on current sequential computers
Recommendations
A report on the value of some advanced high level language operators on current sequential computers
Proceedings of a symposium on high-level-language computer architectureRecent 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 ...
Modular language implementation in Rascal - experience report
All software evolves, and programming languages and programming language tools are no exception. And just like in ordinary software construction, modular implementations can help ease the process of changing a language implementation and its dependent ...
Interactive High-Level Language Direct-Execution Microprocessor System
It is our habit in writing an English composition that, as we write each word, each phrase, each sentence, and each paragraph, we consciously or unconsciously check the syntax and the semantics of the composition just written. Writing a computer program ...
Comments
Information & Contributors
Information
Published In
Copyright © 1973 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
- SIGPLAN: ACM Special Interest Group on Programming Languages
- ACM: Association for Computing Machinery
- IEEE: Institute of Electrical and Electronics Engineers
- SIGARCH: ACM Special Interest Group on Computer Architecture
- TCCA: TCCA
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 November 1973
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 264Total Downloads
- Downloads (Last 12 months)47
- Downloads (Last 6 weeks)12
Reflects downloads up to 29 Jan 2025
Other Metrics
Citations
Cited By
View all- Noonan RBrown RGlaze D(1974)Dynamic algebraProceedings of the 1974 annual conference - Volume 110.1145/800182.810420(326-334)Online publication date: 1-Jan-1974
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in