manip trees: tweaks

[lambda.git] / manipulating_trees_with_monads.mdwn

diff --git a/manipulating_trees_with_monads.mdwn b/manipulating_trees_with_monads.mdwn
index c279c38..dcba312 100644 (file)
--- a/manipulating_trees_with_monads.mdwn
+++ b/manipulating_trees_with_monads.mdwn
@@ -35,7 +35,7 @@ We'll be using trees where the nodes are integers, e.g.,
         ___|___
         |     |
         .     .
-       _|__  _|__
+       _|_   _|__
        |  |  |  |
        2  3  5  .
                _|__
@@ -92,18 +92,17 @@ a reader monad---is to have the treemap function return a (monadized)
 tree that is ready to accept any `int->int` function and produce the
 updated tree.
 
-\tree (. (. (f2) (f3))(. (f5) (.(f7)(f11))))
-
-       \f    .
-         ____|____
-         |       |
-         .       .
-       __|__   __|__
-       |   |   |   |
-       f2  f3  f5  .
-                 __|___
-                 |    |
-                 f7  f11
+
+       \f      .
+          _____|____
+          |        |
+          .        .
+        __|___   __|___
+        |    |   |    |
+       f 2  f 3  f 5  .
+                    __|___
+                    |    |
+                   f 7  f 11
 
 That is, we want to transform the ordinary tree `t1` (of type `int
 tree`) into a reader object of type `(int->int)-> int tree`: something