From the stack principle to ALGOL

Authors:
Friedrich L. Bauer
Affiliations:
Professor of Mathematics and Informatics (Emeritus), Technische Universität München
Venue:
Software pioneers
Year:
2002

Citing 7
Cited 1

The Cellar Principle of State Transition and Storage Allocation

IEEE Annals of the History of Computing - Special issue on the history of computing in France—machines
Recursive processes and ALGOL translation

Communications of the ACM
Revised report on the algorithm language ALGOL 60

Communications of the ACM
Sequential formula translation

Communications of the ACM
Report on the algorithmic language ALGOL 60

Communications of the ACM
The arithmetic translator-compiler of the IBM FORTRAN automatic coding system

Communications of the ACM
Preliminary report: international algebraic language

Communications of the ACM

Grammar semantics, analysis and parsing by abstract interpretation

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Certainly one of the most characteristic principles to organize computations with the help of appropriate data structures is the so-called stack principle. It is used not only when expressions with parentheses are to be evaluated, but even more importantly it is also the essential principle of organizing the data inside the memory when calling nested procedures. The stack principle also works for locally declared data within scopes and is therefore the most prominent implementation idea when dealing with high-level languages, scopes and block structures such as the languages of the ALGOL family. The paper describes the early ideas on using stacks starting from evaluating expressions and the development processes that have led to the ALGOL language family.