Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Communications of the ACM
Recovery of reentrant list structures in SLIP
Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1
Communications of the ACM
Programming semantics for multiprogrammed computations
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Communications of the ACM
Properties of deterministic top down grammars
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
MUTANT 0.5: an experimental programming language
MUTANT 0.5: an experimental programming language
The multics interprocess communication facility
SOSP '69 Proceedings of the second symposium on Operating systems principles
Ten mini-languages in need of formal definition
ACM SIGPLAN Notices
Algol-60 Implementation
LISP 1.5 Programmer's Manual
Programming Languages, Information Structures, and Machine Organization.
Programming Languages, Information Structures, and Machine Organization.
Segment sizes and liftetimes in Algol 60 programs
Communications of the ACM
Communications of the ACM
Two PARALLEL EULER run time models: The dangling reference, impostor environment, and label problems
HLLCA '73 Proceedings of the ACM-IEEE symposium on High-level-language computer architecture
A high level language extension for creating and controlling dynamic pictures
The papers of the ACM symposium on Graphic languages
Block structure (Extended Abstract): Retention or deletion?
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Programming with(out) the GOTO
ACM '72 Proceedings of the ACM annual conference - Volume 2
Computational processor demands of Algol-60 programs
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
Proceedings of ACM conference on Proving assertions about programs
Two parallel EULER run time models: the dangling reference, impostor environment, and label problems
HLLCA '73 Proceedings of a symposium on High-level-language computer architecture
Visible semantics for programming languages
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
The description and control of changing pictures
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Scheme for invalidating references to freed storage
IBM Journal of Research and Development
The formal definition of semantics by string automata
Computer Languages
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 0.03 |
This paper introduces Oregano, a practical generalization of ALGOL 60. The semantic definition of the language is in terms of an information structure model for its implementation, the contour model. Some of the major features are emphasized, including that of retention (non-deallocation of still accessible cells). The contour model is briefly described as a cell-based, fixed program component model with a retentive deallocation scheme. Modes (data types) are described as cell templates. Then, blocks, declarations, assignments, and pointer handling are illustrated in terms of sequences of pictorial snapshots in the model. A wide variety of heterogeneous and homogeneous multiple values are described using the data structure models of their implementation. Labels and procedures, which can be called recursively, are generalized to the full status of values. Coroutines and tasks are introduced as simple extensions of procedure calls, and various synchronization devices such as locking and events are illustrated. Finally, the practicality and ease of use of the language are demonstrated.