Advertisement

The meaning of names in PL/I

  • H. Bekić
Selected Papers Languages
  • 104 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 177)

Abstract

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.

Keywords

Storage Cell Explicit Rule Argument Position Storage Allocation Recursion Level 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. /1/.
    NPL Technical Report — IBM Hursley, Dec. 1964.Google Scholar
  2. /2/.
    IBM Operating System/360. PL/I: Language Specifications — C 28-6571-0, 1965.Google Scholar
  3. /3/.
    P. NAUR, Revised Report on the Algorithmic Language ALGOL 60 — The Comp. J., Jan. 1963.Google Scholar
  4. /4/.
    J. McCARTHY, LISP 1.5 Programmers Manual — M.I.T. 1962.Google Scholar
  5. /5/.
    K. BANDAT, H. BEKIĆ, Scope of Names in NPL — LR 25.0.002, July 1964.Google Scholar
  6. /6/.
    K. BANDAT, H. BEKIĆ, P. LUCAS, Block Concept for NPL — LR 25.0.003, July 1964.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • H. Bekić

There are no affiliations available

Personalised recommendations