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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
NPL Technical Report — IBM Hursley, Dec. 1964.
IBM Operating System/360. PL/I: Language Specifications — C 28-6571-0, 1965.
P. NAUR, Revised Report on the Algorithmic Language ALGOL 60 — The Comp. J., Jan. 1963.
J. McCARTHY, LISP 1.5 Programmers Manual — M.I.T. 1962.
K. BANDAT, H. BEKIĆ, Scope of Names in NPL — LR 25.0.002, July 1964.
K. BANDAT, H. BEKIĆ, P. LUCAS, Block Concept for NPL — LR 25.0.003, July 1964.
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bekić, H. (1984). The meaning of names in PL/I. In: Jones, C.B. (eds) Programming Languages and Their Definition. Lecture Notes in Computer Science, vol 177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0048936
Download citation
DOI: https://doi.org/10.1007/BFb0048936
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13378-0
Online ISBN: 978-3-540-38933-0
eBook Packages: Springer Book Archive