Avoiding "RangeError: Maximum call stack size exceeded"

[rupert]

Is ‘tail call modulo cons’ implemented in elm-optimize-level-2? I saw some comments around that in the thread linked below. Not sure if level-2 would be a convenient place to implement that, maybe needs to be in the compiler.

A faster `List.map` for Elm

I just ran some benchmarks on an alternative List.map implementation in JavaScript and it looks really fast! There’s an old LISP trick from the 70’s called “tail recursion modulo cons” that allows you to optimise certain linked list functions that are “not quite” tail recursive. “Not quite” in this case means they do a “cons” before the tail call. The trick allows you to get around that and turn it into a while loop as the compiler does for proper tail recursive functions. @jreusch mentioned t…