The Meaning of Names in PL/I

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.