Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
greghendershott
on Aug 8, 2017
|
parent
|
context
|
favorite
| on:
Dijkstra was right – recursion should not be diffi...
In some languages the "stack" may grow until all memory is exhausted.
(Some of those languages also guarantee tail call elimination.)
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
(Some of those languages also guarantee tail call elimination.)