News for hackers. Stuff that matters.
Re:How recursion got into programming: a comedy of errors by mark-r on Wednesday July 23, 2014 @03:47PM (#8076558)
It may seem trivial now, but when this was being considered stacks were not a built-in CPU feature. In fact I wonder what was the first architecture that included one?

The machine I learned assembler on would rewrite the instruction at the start of a function with a jump instruction to return to the caller. You returned from the function by jumping back to its beginning. Recursion wasn't an option!

Re:How recursion got into programming: a comedy of errors by acqq on Thursday July 24, 2014 @04:01AM (#8078601)
To get even better idea, the memory used at that time didn't even have to have 8-bit bytes:

http://www.computermuseum.li/Testpage/IBM-1401.htm

"It came with 4,096 characters of memory [6-bit (plus 1 parity bit] CORE memory, constructed from little donut shaped metal rings strung on a wire mesh."

The core memory is explained in the same book which deanmen linked (thanks deanmen!)

http://www.jklp.org/profession/books/mix/c01.html

Re:How recursion got into programming: a comedy of errors by deanmen on Wednesday July 23, 2014 @05:13PM (#8076995)
This convention is even used in Knuth's MIX:

http://www.jklp.org/profession/books/mix/c06.html