|
ABSTRACT
The structure of a digital computer programming language which covers a wide class of business and file processing applications is presented. Such a structure, based on identifying and incorporating into a compiler the aspects common to all processes of such class, permits writing extremely compact programs, even for comparatively complex applications, in terms of tables of control expressions which express only information characteristic of the particular application. Furthermore, local changes of a process (e.g. changes affecting only one of the output files involved) can be effected by local modifications in the program (e.g. modification of only one entry of the tables). This structure also allows for inexpensive preparation of loading-speed compilers which translate the source programs into efficient machine codes.
The approach adopted here departs from conventional mechanical language design philosophies. It stresses the structural analysis of the class of processes to be represented in the languages, as opposed to emphasizing formal (i.e., contents-independent) syntactical definitions. It relies exclusively on nonprocedural representation of processes as sets (tables) of relations between data and results (there are no control statements such as GO TO, etc.), instead of using procedure descriptions (which are one-to-one translations of flowcharts). Here an invariant pattern of procedure is identified as characteristic of the class of all batch file processes.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Robert Bosak , Richard F. Clippinger , Carey Dobbs , Roy Goldfinger , Renee B. Jasper , William Keating , George Kendrick , Jean E. Sammet, An information algebra: phase 1 report—language structure group of the CODASYL development committee, Communications of the ACM, v.5 n.4, p.190-204, April 1962
[doi> 10.1145/366920.366935]
|
| |
2
|
KAVANAGH, T. F. TABSOL: a fundamental concept for systems-oriented languages. Proc. 1960 Eastern Joint Comput. Conf., Paper 3.2.
|
| |
3
|
POLLACK, S. L. DETAB-X: an improved business-oriented computer language. Mem. RM-3273-PR, RAND Corp., Santa Monica, Calif., Aug. 1962.
|
| |
4
|
----. Analysis of the diagram rules in decision tables. Mem. RM-3669-PR, RAND Corp. Santa Monica, Calif., May 1963.
|
| |
5
|
CODASYL SYSTEMS GROUP. DETAB-X: preliminary specifications for a decision table structured language. Sept. 1962.
|
| |
6
|
GREGORY, R. H., AND VAN HORN, R. L. Business Data Processing and Programming. Wadsworth, San Francisco, 1963.
|
 |
7
|
|
| |
8
|
LOMBARDI, L. A. Inexpensive punched card equipment. J. Mach. Acc. 12, 8 (1961), 11-18.
|
| |
9
|
----. Theory of files. Proc. 1960 Eastern Joint Comput. Conf., Paper 3.3.
|
 |
10
|
|
| |
11
|
----. On the control of the data flow by means of recursive functions. In Symbolic Languages in Data Processing, Gordon and Breach, 1962, 173-186.
|
| |
12
|
----. Mathematical models of file processes. Atti. Sem. Mat. Fis. Univ. Modena (in press).
|
| |
13
|
----. On table operating algorithms. Proc. 2nd IFIP Congress, Munich, Aug. 1962. Section 14, North Holland Publ. Co., 1963.
|
CITED BY 6
|
|
|
|
|
|
|
|
|
|
|
William F. Atchison , Samuel D. Conte , John W. Hamblen , Thomas E. Hull , Thomas A. Keenan , William B. Kehl , Edward J. McCluskey , Silvio O. Navarro , Werner C. Rheinboldt , Earl J. Schweppe , William Viavant , David M. Young, Jr., Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science, Communications of the ACM, v.11 n.3, p.151-197, March 1968
|
|
|
|
|
|
|
|