Foundations of stack machines#
Reverse Polish notation, the halting problem and busy beavers, hardware stacks, structured control flow, and Forth.
Reverse Polish notation: the stack’s natural order (Łukasiewicz 1924, Hamblin 1957)
Reverse Polish notation: the stack's natural order (Łukasiewicz 1924, Hamblin 1957)
The halting problem: why every call needs a budget (Turing 1936)
The halting problem: why every call needs a budget (Turing 1936)
Stack hardware: a bounded stack (Burroughs B5000, Barton 1961)
Stack hardware: a bounded stack (Burroughs B5000, Barton 1961)
The busy beaver: the longest a small machine can run (Radó 1962)
The busy beaver: the longest a small machine can run (Radó 1962)
Structured programming: sequence, selection, iteration (Böhm and Jacopini 1966)
Structured programming: sequence, selection, iteration (Böhm and Jacopini 1966)
