manip trees: tweaks

Signed-off-by: Jim Pryor <profjim@jimpryor.net>

diff --git a/manipulating_trees_with_monads.mdwn b/manipulating_trees_with_monads.mdwn
index d3ccc98..c279c38 100644 (file)
--- a/manipulating_trees_with_monads.mdwn
+++ b/manipulating_trees_with_monads.mdwn
@@ -48,7 +48,7 @@ Our first task will be to replace each leaf with its double:
          match t with
            | Leaf x -> Leaf (newleaf x)
            | Node (l, r) -> Node ((treemap newleaf l),
          match t with
            | Leaf x -> Leaf (newleaf x)
            | Node (l, r) -> Node ((treemap newleaf l),

-                                 (treemap newleaf r));;
+                                  (treemap newleaf r));;

 
 `treemap` takes a function that transforms old leaves into new leaves,
 and maps that function over all the leaves in the tree, leaving the
 
 `treemap` takes a function that transforms old leaves into new leaves,
 and maps that function over all the leaves in the tree, leaving the


@@ -87,7 +87,7 @@ to each subpart of the computation.  In other words, `treemap` has the
 behavior of a reader monad.  Let's make that explicit.
 
 In general, we're on a journey of making our treemap function more and
 behavior of a reader monad.  Let's make that explicit.
 
 In general, we're on a journey of making our treemap function more and

-more flexible.  So the next step---combining the tree transducer with
+more flexible.  So the next step---combining the tree transformer with

 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.
 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.


@@ -159,7 +159,7 @@ result:
        - : int tree =
        Node (Node (Leaf 4, Leaf 9), Node (Leaf 25, Node (Leaf 49, Leaf 121)))
 
        - : int tree =
        Node (Node (Leaf 4, Leaf 9), Node (Leaf 25, Node (Leaf 49, Leaf 121)))
 

-Now that we have a tree transducer that accepts a monad as a
+Now that we have a tree transformer that accepts a monad as a

 parameter, we can see what it would take to swap in a different monad.
 For instance, we can use a state monad to count the number of nodes in
 the tree.
 parameter, we can see what it would take to swap in a different monad.
 For instance, we can use a state monad to count the number of nodes in
 the tree.