Most provide other forms of mutability as well, such as Haskell's ST monad and IORef's.
Research into data structures and algorithms best suited for lazy functional immutable languages lags behind that for strict imperative mutable languages.