The contour model of block structured processes
- 1 February 1971
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 6 (2) , 55-82
- https://doi.org/10.1145/1115880.1115883
Abstract
There appears to be a need for an intuitive implementable cell-based model of the semantics of algorithm execution. It is contended that for block structured processes, such a model must be based on the concepts of nested blocks, access environments, labels, and cell retention. A model so based, the contour model, is introduced by illustrating the execution of an ALGOL 60 program in terms of the model. The model is informally specified and some of its major features are pointed out. A companion paper by D. M. Berry shows that semantically powerful languages can be directly implemented in terms of the model.Keywords
This publication has 5 references indexed in Scilit:
- GEDANKEN—a simple typeless language based on the principle of completeness and the reference conceptCommunications of the ACM, 1970
- Structure of multiple activity algorithmsPublished by Association for Computing Machinery (ACM) ,1969
- EULER: A generalization of ALGOL and its formal definition: Part 1Communications of the ACM, 1966
- The Design of the GIER ALGOL CompilerPublished by Elsevier ,1964
- Revised report on the algorithmic language ALGOL 60Communications of the ACM, 1963