"we worry about details so obscure, even USENIX reviewers don't want to hear about them" http://t.co/SkGftjjNJo
miniblog.
Related Posts
I'm a big fan of segmented stacks (or 'split stacks'), where stack frames are heap allocated, You can write recursive functions with less worry, and you get better tracebacks than TCO.
Go is the most popular language with this feature, to my knowledge: https://dave.cheney.net/2013/06/02/why-is-a-goroutines-stack-infinite
I'd assumed that LLVM didn't support this, but gollvm handles it fine! https://groups.google.com/g/golang-nuts/c/ivOZ-j6Zt2c/m/BUBX2Td9BgAJ
I'm a big fan of segmented stacks (or 'split stacks'), where stack frames are heap allocated, You can write recursive functions with less worry, and you get better tracebacks than TCO.
Go is the most popular language with this feature, to my knowledge:
TIL there are multiple developer tools called asdf!
(1) https://github.com/fare/asdf (Common Lisp build tool)
(2) https://asdf-vm.com/ (manages installed PL runtimes, like a generic nvm or rbenv)
I'm surprised multiple folks like the name, I'd worry that it's easy to forget.