The meaning of names in PL/I
- 104 Downloads
Recursion as defined in PL/I is essantially different from recursion in existing languages (ALGOL, LISP, common mathematical notation). This difference follows from the specific explicit rules by which recursion, instead of resulting implicitly from a dynamic block concept, is defined in PL/I, particularly from the intermixture of recursion and storage allocation. On the other hand, there is a number of arguments which seem to prove that this difference has not been intended.
KeywordsStorage Cell Explicit Rule Argument Position Storage Allocation Recursion Level
Unable to display preview. Download preview PDF.
- /1/.NPL Technical Report — IBM Hursley, Dec. 1964.Google Scholar
- /2/.IBM Operating System/360. PL/I: Language Specifications — C 28-6571-0, 1965.Google Scholar
- /3/.P. NAUR, Revised Report on the Algorithmic Language ALGOL 60 — The Comp. J., Jan. 1963.Google Scholar
- /4/.J. McCARTHY, LISP 1.5 Programmers Manual — M.I.T. 1962.Google Scholar
- /5/.K. BANDAT, H. BEKIĆ, Scope of Names in NPL — LR 25.0.002, July 1964.Google Scholar
- /6/.K. BANDAT, H. BEKIĆ, P. LUCAS, Block Concept for NPL — LR 25.0.003, July 1964.Google Scholar