See: https://wiki.haskell.org/MonadFix https://wiki.haskell.org/MonadFix Basically it's the primitive that allows monadic computations to be written in the sam

See: https://wiki.haskell.org/MonadFix https://wiki.haskell.org/MonadFix Basically it's the primitive that allows monadic computations to be written in the same lazy cyclic style as regular values in Haskell. (e.g. `ones = 1:ones` to create an infinite lazy list of 1.) There isn't a single answer to "why?" any more than there is for monads in general, but as an example, I've been looking into using this abstraction to model circuit graphs.