Suppose I want to convert a string to uppercase in a language.
(1) Google it.
(2) Read the official docs or a Stack Overflow answer.
(3) Copy-paste the function/method name to my program.
This is an absurd number of keystrokes! Do any languages aim to minimise this?
miniblog.
Related Posts
Co-Authored-By: An old Stack Overflow answer, blindly accepting the compiler's suggestions, and a linter.
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: