I think it is very dependent on the problem at hand. Some traditional CS algorithm? Mutable it is. But a compiler with different passes is a great fit for the

I think it is very dependent on the problem at hand. Some traditional CS algorithm? Mutable it is. But a compiler with different passes is a great fit for the FP paradigm. But even if we go to pure math, you will have constructive proofs beside traditional ones.