People often say state is hard in functional programming, but things like the Tardis monad have convinced me that (semantically speaking) functional programming is even better at state than the imperative/OOP paradigms. Imperative programs are essentially restricted to one global monad implicitly hardcoded into the language semantics, whereas with functional programming you have the freedom to choose the most appropriate monad for the task at hand. You want state? Use the state monad. You want continuations? Use that monad. You want time traveling? Yep, there's a monad for that too. IO, randomness, nondeterminism, parallelism, environment variables, failure, backtracking, software transactional memory, you name it. Many problems are best solved with a custom monad, rather than one of the standard ones; for example, using a monad that allows your code to emit constraints to be solved (this is a common technique for implementing type inference in compilers). Satisfyingly, reifying effects with monads preserves referential transparency and is therefore compatible with laziness, unlike traditional side effects which are sensitive to evaluation order.
Unbelievably, I actually used this in a project when I found myself thinking that I needed a combination of a forward and backward propagating state monad.<p>[1] <a href="https://github.com/ElementsProject/simplicity/blob/35627fc49ad96fcb844cca72ffbc69b6e934cb4c/Haskell/Core/Simplicity/LibSecp256k1/Spec.hs#L548" rel="nofollow">https://github.com/ElementsProject/simplicity/blob/35627fc49...</a>
I just coded an example usage of this monad last week:<p><a href="https://github.com/jasonincanada/kattis/blob/master/src/Pivot.hs#L62" rel="nofollow">https://github.com/jasonincanada/kattis/blob/master/src/Pivo...</a><p>This tests each element of a list to see if it's a pivot, meaning it's between the maximum to the left and the minimum to the right. In a single logical traversal it shouldn't be able to see the minimum yet, since it hasn't visited those elements. With reverse state you pretend you can anyway and let Haskell figure out the dependencies during execution
Se also: <a href="https://tech-blog.capital-match.com/posts/5-the-reverse-state-monad.html" rel="nofollow">https://tech-blog.capital-match.com/posts/5-the-reverse-stat...</a>