Message from JavaScript discussions

April 2017

— It's the first time I even saw them, but apparently the inventor of Fortran came up with some functional programming idea where you can use them to write recursive functions without recursing

Message permanent page


The best part is, it supposedly works on any recursive function under the sun, and is faster in JS due to not having to manage a call stack

— While you do have to manage state a lot more between "recursions", essentially you wrap the whole thing in a loop, then when you want to recurse you save state, then run continue myLoop;

Message permanent page

— Implementing a stack to save state into is best because it then emulates the behavior of a real call stack

Message permanent page

— Without the RangeError :p

— Wow

— Fuck

— That's genious

— You mean tail call elimination?

— I don't think this is the same thing

— That's hardly new or novel and it does not work for all recursive functions

— Recursion by tricking the JS engine to recurse by loop