|
ABSTRACT
A new programming language control structure as well as an improved approach to a formal definition of programming languages are presented. The control structure can replace both iteration and conditional structures. Because it is a semantic generalization of those structures, a single statement using the new control structure can implement the functions of loops, conditionals, and also programs that would require several conventional constructs. As a consequence of this increased capability, it is possible to write algorithms that are simpler, more efficient, and more clearly correct than those that can be written with earlier structured-programming control structures. In order to provide a precise definition of the new constructs, a new version of relational semantics, called LD-relations is presented. An algebra of these relations is developed and used to define the meaning of the new constructs. A short discussion of program development and the history of control structures is included.
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
|
ACM statement on ADA. Comm. ACM 25, 2 (Feb. 1982),
|
| |
2
|
de Bruijn, N.G. Private communication.
|
| |
3
|
|
| |
4
|
Forthofer, M.J. Extending PDL to include a search superstructure. Tech. Rept. FSD 81-0010, Federal Systems Div., IBM Corp., Bethesda, Md., Apr. 1981.
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
Mills, H.D. Functional semantics for sequential programs. Prec. IFIP 1980, North-Holland, Amsterdam.
|
 |
9
|
|
| |
10
|
Parnas, D.L An alternative control structure and its formal definition. IBM Tech. Rept. TR FSD-81-0012, IBM Corp., Bethesda, Md, 1981.
|
| |
11
|
|
|