@@ -26,7 +26,7 @@ module which defines a binary tree type ``BTree`` (in a file
2626
2727 toList : BTree a -> List a
2828 toList Leaf = []
29− toList (Node l v r) = btree.toList l ++ (v :: btree.toList r)
29+ toList (Node l v r) = Btree.toList l ++ (v :: Btree.toList r)
3030
3131 toTree : Ord a => List a -> BTree a
3232 toTree [] = Leaf
@@ -44,7 +44,7 @@ Then, this gives a main program (in a file
4444
4545 main : IO ()
4646 main = do let t = toTree [1,8,2,7,9,3]
47− print (btree.toList t)
47+ print (Btree.toList t)
4848
4949
5050
@@ -118,7 +118,7 @@ functions to be exported as ``abstract``, as we see below:
118118 abstract
119119 toList : BTree a -> List a
120120 toList Leaf = []
121− toList (Node l v r) = btree.toList l ++ (v :: btree.toList r)
121+ toList (Node l v r) = Btree.toList l ++ (v :: Btree.toList r)
122122
123123 abstract
124124 toTree : Ord a => List a -> BTree a
@@ -144,7 +144,7 @@ directive, for example:
144144
145145 toList : BTree a -> List a
146146 toList Leaf = []
147− toList (Node l v r) = btree.toList l ++ (v :: btree.toList r)
147+ toList (Node l v r) = Btree.toList l ++ (v :: Btree.toList r)
148148
149149 toTree : Ord a => List a -> BTree a
150150 toTree [] = Leaf