Open sam701 opened 4 years ago
We do not want a Turing complete language. We should eliminate recursion. The following code leads to stack overflow:
let ff = (x, acc, f) => if x == 0 then acc else f(x-1, acc+2, f) in ff(20000, 0, ff)
jsonnet has the same issue (Dec 2020)
We do not want a Turing complete language. We should eliminate recursion. The following code leads to stack overflow: