formatting

[lambda.git] / topics / week7_introducing_monads.mdwn

diff --git a/topics/week7_introducing_monads.mdwn b/topics/week7_introducing_monads.mdwn
index 39dcdaf..3ca18a1 100644 (file)
--- a/topics/week7_introducing_monads.mdwn
+++ b/topics/week7_introducing_monads.mdwn
@@ -1,5 +1,4 @@
 <!-- λ Λ ∀ ≡ α β γ ρ ω Ω ○ μ η δ ζ ξ ⋆ ★ • ∙ ● 𝟎 𝟏 𝟐 𝟘 𝟙 𝟚 𝟬 𝟭 𝟮 -->
-<!-- Loved this one: http://www.stephendiehl.com/posts/monads.html -->
 
 
 The [[tradition in the functional programming
@@ -392,6 +391,7 @@ This example is a good intuitive basis for thinking about the notions of `mbind`
 
       Some a  >>=<sub>α option</sub>  (\a -> Some 0) ==> Some 0
       None    >>=<sub>α option</sub>  (\a -> Some 0) ==> None
+      Some a  >>=<sub>α option</sub>  (\a -> None  ) ==> None
 
                                                          .
                                                         / \
@@ -437,7 +437,9 @@ As we mentioned above, the notions of Monads have their origin in Category Theor
 [1](http://en.wikipedia.org/wiki/Outline_of_category_theory)
 [2](http://lambda1.jimpryor.net/advanced_topics/monads_in_category_theory/)
 [3](http://en.wikibooks.org/wiki/Haskell/Category_theory)
-[4](https://wiki.haskell.org/Category_theory), where you should follow the further links discussing Functors, Natural Transformations, and Monads.
+[4](https://wiki.haskell.org/Category_theory) <small>(where you should follow the further links discussing Functors, Natural Transformations, and Monads)</small>
+[5](http://www.stephendiehl.com/posts/monads.html)
+
 
 Here are some papers that introduced Monads into functional programming: