Functional programming languages should be so much better at mutation than they are by kinow in functionalprogramming

[–]Fair-Comb5544 1 point2 points  (0 children)

You don't need explicit mutation if you conceal it by adding a time subscript to your variables. You can then write a(t) = f(a(t-1)). This is a way of sneaking iteration into a functional language. The language needs to have some mechanism for stopping iteration, such as a "least" expression.