Re: Stacks, was Segments

According to Niklas Holsti  <niklas.holsti@tidorum.invalid>:

Algol 60 only had stack allocation for dynamically sized arrays,
so stacks had to be as big as the data are.

 
Huh?  Algol 60 routines could be mutually recursive so unless it was
a leaf procedure or the outer block, everything not declared "own"
went on the stack.

>
Mitch's point AIUI was that Algol 60 had no heap allocation (and no
explicit pointer types), so indeed all data were either on the stack or
statically allocated.

It sounded to me like he said that dynamically sized arrays were on the
stack, nothing else was.  I think we agree that everything but "own"
is on the stack.

Algol 60 did need a heap because own arrays could have variable size.
That wasn't an accident since sec 5.2.2 shows an example of a variable
size own array.  I suspect they didn't realize the implications both
of resizing non-stack data, and what happens in an upper level call
if a lower level call resizes the array underneath it.

It wasn't the only mistake like that.  Alan Perlis told me that they
intended call by name to be an elegantly phrased definition of call
by reference, and it wasn't until Jensen's device that they realized what
they had actually done.

--
Regards,
John Levine, johnl@taugh.com, Primary Perpetrator of "The Internet for Dummies",
Please consider the environment before reading this e-mail. https://jl.ly