http://blog.sigfpe.com/2006/08/you-could-have-invented-monads-and.html
says that
“If you hadn’t guessed, this is about monads as they appear in pure functional programming languages like Haskell. They are closely related to the monads of category theory, but are not exactly the same because Haskell doesn’t enforce the identities satisfied by categorical monads.”
What is the point of Haskell monads then, if they do not enforce the monad laws?
As I see, some of them do admit monad laws. But what happens when I use an almost-monad? Do I lose some guarantees?