diff --git a/docs/a-fistful-of-monads.html b/docs/a-fistful-of-monads.html index 152f6c2..b469b7b 100644 --- a/docs/a-fistful-of-monads.html +++ b/docs/a-fistful-of-monads.html @@ -1842,8 +1842,9 @@
Just like applicative functors, and functors before them, monads come with a few diff --git a/docs/functors-applicative-functors-and-monoids.html b/docs/functors-applicative-functors-and-monoids.html index 6d0c7bb..19bdb9c 100644 --- a/docs/functors-applicative-functors-and-monoids.html +++ b/docs/functors-applicative-functors-and-monoids.html @@ -556,7 +556,7 @@
In conclusion, applicative functors aren't just interesting, they're also useful, because they allow us to combine different computations, such as I/O computations, non-deterministic computations, computations that might have failed, etc. by using the applicative style. Just by using <$> and <*> we can use normal functions to uniformly operate on any number of applicative functors and take advantage of the semantics of each one.
So far, we've learned how to make our own algebraic data types by using the @@ -1064,8 +1064,9 @@
Type classes in Haskell are used to present an interface for types that have