Introduction to Oregano

ABSTRACT

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.

REFERENCES

• 1: Alber, K. <u>et al</u>., <u>Informal Introduction to Abstract Syntax and Interpretation of PL/1</u>, IBM Lab., Vienna, TR 25.099 (June 30, 1969).
• 2: Applied Data Research Inc., Mass. Computer Assoc., <u>Basel Language Programmer Manual</u>, CA-7005-2011, Wakefield, Mass. (May 20, 1970).
• 3: Barron, D. W. <u>et al.</u>, "The Main Features of CPL," <u>Comp. J</u>., 6, p. 134 (1963).
• 4: David Beech, A Structural View of PL/I, ACM Computing Surveys (CSUR), v.2 n.1, p.33-64, March 1970 [doi>10.1145/356561.356564]
• 5: Bernstein, A. J. and Johnston, J. B., <u>Implementation of a Parallel Processing Language</u>, General Electric TIS Report 67-C--080 (March 1967).
• 6: Berry, D. M., <u>Property Grammars, Basel</u>, <u>Contour Model, and Coercion</u>, Brown Univ. (May 1970).
• 7: Daniel M. Berry, The importance of implementation models in ALGOL 68: or how to discover the concept of necessary environment, ACM SIGPLAN Notices, v.5 n.9, September 1970 [doi>10.1145/987429.987432]
• 8: Cleary, J. G., "Process Handling on Burroughs B6500, "<u>Proc. 4th Australian Comp. Conf.</u>, p. 231 (1969).
• 9: Jack B. Dennis , Earl C. Van Horn, Programming semantics for multiprogrammed computations, Communications of the ACM, v.9 n.3, p.143-155, March 1966 [doi>10.1145/365230.365252]
• 10: Goos, Gerhard, "Some Problems in Compiling Algol 68", Rechenzentrum der Technischen Hochschule, Munchen, Germany; paper delivered to ACM SIGPLAN Algol 68 Symp. (June 1970).
• 11: Johnston, J. B., "The Contour Model of Block Structured Processes," <u>Proc. ACM SIGPLAN Symp. - Data Structures and Programming Languages</u>, Gainesville, Fla. (1971).
• 12: Johnston, J. B., "Structure of Multiple Activity Algorithms," Proc. Third Ann. Princeton Conf. on Info. Sci. and Systems, p. 38 (March 1969).
• 13: Johnston, J. B., private communication on a model of the process concept (Spring 1970).
• 14: Jorrand, P. and Wegner, P., <u>Some Aspects of the Structure of Basel</u>, Brown Univ., Providence, R. I. (Jan. 1970).
• 15: Knuth, D. E., <u>The Art of Computer Programming</u>, Vol. I, Addison-Wesley (1968).
• 16: Henry F. Ledgard, Ten mini-languages in need of formal definition, ACM SIGPLAN Notices, v.5 n.4-5, April-May 1970 [doi>10.1145/987438.987440]
• 17: P. M. Lewis, II , R. E. Stearns, Syntax-Directed Transduction, Journal of the ACM (JACM), v.15 n.3, p.465-488, July 1968 [doi>10.1145/321466.321477]
• 18: Lucas, P., Lauer, P. and Stigleitner, H., <u>Method and Notation for the Formal Definition of Programming Languages</u>, IBM Lab., Vienna, Tech. Report TR 25.087 (28 June 1968).
• 19: Lucas, P. and Walk, K., "On the Formal Description of PL/1"--<u>Annual Review in Automatic Programming</u>, 6:3 pp. 105--182 (1969).
• 20: Marshall, S., <u>An Algol 68 Garbage Collector</u>, TM0111, Dartmouth College (Dec. 1969).
• 21: John McCarthy, LISP 1.5 Programmer's Manual, The MIT Press, 1962
• 22: J. W. Backus , F. L. Bauer , J. Green , C. Katz , J. McCarthy , A. J. Perlis , H. Rutishauser , K. Samelson , B. Vauquois , J. H. Wegstein , A. van Wijngaarden , M. Woodger , P. Naur, Revised report on the algorithm language ALGOL 60, Communications of the ACM, v.6 n.1, p.1-17, Jan. 1963 [doi>10.1145/366193.366201]
• 23: Brian Randall , Lawford J. Russell, Algol-60 Implementation, Academic Press, Inc., Orlando, FL, 1964
• 24: John C. Reynolds, G/EDANKEN—a simple typeless language based on the principle of completeness and the reference concept, Communications of the ACM, v.13 n.5, p.308-319, May 1970 [doi>10.1145/362349.362364]
• 25: D. J. Rosenkrantz , R. E. Stearns, Properties of deterministic top down grammars, Proceedings of the first annual ACM symposium on Theory of computing, p.165-180, May 05-07, 1969, Marina del Rey, California, United States [doi>10.1145/800169.805431]
• 26: Edwin H. Satterthwaite, MUTANT 0.5: an experimental programming language, Stanford University, Stanford, CA, 1969
• 27: Michael J. Spier , Elliott I. Organick, The multics interprocess communication facility, Proceedings of the second symposium on Operating systems principles, October 20-22, 1969, Princeton, New Jersey [doi>10.1145/961053.961086]
• 28: Stearns, R. E., and Lewis, P. M. H. "Property Grammars and Table Machines," <u>Info. and Control</u>, 14, p. 524 (1969).
• 29: Van Wijngaarden, A., Mailloux, B. J., Peck, J. E. L., and Koster, C. H. A., "Report on the Algorithmic Language Algol 68," <u>Num. Math.</u>, 14, pp. 79--218 (1969).
• 30: J. Weizenbaum, Symmetric list processor, Communications of the ACM, v.6 n.9, p.524-536, Sept. 1963 [doi>10.1145/367593.367617]
• 31: Joseph Weizenbaum, Recovery of reentrant list structures in SLIP, Communications of the ACM, v.12 n.7, p.370-372, July 1969 [doi>10.1145/363156.363159]
• 32: Peter. Wegner, Programming Languages, Information Structures, and Machine Organization., McGraw Hill Text, 1968
• 33: Wegner, P., "Three Computer Cultures; Computer Technology, Computer Mathematics and Computer Science," <u>Advances in Computers</u>, Vol. 10 (1970).
• 34: Wegner, P., <u>Theories of Semantics</u>, TR69-10, Center for Comp. and Info. Sciences, Brown Univ. (Sept. 1969).
• 35: Wegner, P., <u>The Variability of Computations</u>, TR-70-22, Center for Comp. and Info. Sciences, Brown Univ. (July 1970).
• 36: Wegner, P., <u>The Vienna Definition Language</u>, TR-70-21-2, Center for Comp. and Info. Sciences, Brown Univ. (May 1970).
• 37: Niklaus Wirth , Helmut Weber, EULER: a generalization of ALGOL and it formal definition: Part 1, Communications of the ACM, v.9 n.1, p.13-25, Jan. 1966 [doi>10.1145/365153.365162]
• 38: Henhapl, W. and Jones, C. B., <u>The Block Concept and Some Possible Implementations</u>, <u>with Proofs of Equivalence</u>, IBM Lab., Vienna, TR 25.104 (April 3, 1970).