> Statically typed functional languages like Haskell and OCaml allow much more correct code and reject much more wrong code In functional code, sure. In a pred

> Statically typed functional languages like Haskell and OCaml allow much more correct code and reject much more wrong code In functional code, sure. In a predominantly mutable algorithm, you fight the language more than what you gain, and sometimes, yes, the mutable approach is simpler and easier to reason about. Especially local mutability can be very readable/maintainable.