On the Orthogonality of Assignments and Procedures in Algol (1992)
Cached
Download Links
- [www.ccs.neu.edu]
- [www.cs.rice.edu]
- [www.cs.rice.edu]
- [www.cs.rice.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. 20th ACM Symposium on Principles of Programming Languages |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Weeks92onthe,
author = {Stephen Weeks and Matthias Felleisen},
title = {On the Orthogonality of Assignments and Procedures in Algol},
booktitle = {In Proc. 20th ACM Symposium on Principles of Programming Languages},
year = {1992},
pages = {57--70},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
According to folklore, Algol is an "orthogonal" extension of a simple imperative programming language with a call-by-name functional language. The former contains assignments, branching constructs, and compound statements; the latter is based on the typed -calculus. In an attempt to formalize the claim of "orthogonality", we define a simple version of Algol and an extended -calculus. The calculus includes the full fi-rule and rules for the reduction of assignment statements and commands. It has the usual properties, e.g., it satisfies a Church-Rosser and Strong Normalization Theorem. In support of the claim that the imperative and functional components are orthogonal to each other, we show that the proofs of the corresponding theorems are combinations of separate Church-Rosser and Strong Normalization theorems for each sub-language. An acclaimed consequence of Algol's orthogonal design is the idea that the evaluation of a program has two distinct phases. The first phase corresponds to...
Citations
No citations identified.
