Implement `fold` on a "Rose Tree" Given the following algebraic data type, a Rose Tree:

data Tree a = Node {
    rootLabel :: a,
    subForest :: [Tree a]
}  


I attempted a foldTree function to fold over this list: (credit to this class's homework from 2013:

treeFold :: (b -&gt; [b] -&gt; b) -&gt; (a -&gt; b) -&gt; Tree a -&gt; b
treeFold f g tree = f (g (rootLabel tree)) (map (g . rootLabel) (subForest tree))


test

*Party&gt; let tree = Node { rootLabel = 100, subForest = [] }
*Party&gt; let tree2 = Node { rootLabel = 200, subForest = [tree] }
*Party&gt; add tree2
300


Please review this implementation.

Given my definition of treeFold, I don't see how I could fold over a Tree Char, producing a [Char]/String result. 

My understanding is that, for the return type, b, it can't be [a].
The implementation isn't correct, because it doesn't traverse sub-trees. Consider

Node 1 [Node 2 [Node 3 []]]


Then your folding function will only fold over 1 and 2, but not over 3.

If you have a recursive structure like this, a folding function over it must also be recursive. Otherwise it won't be able to traverse arbitrarily large recursive structure.

For the other question: If you specialize the folding function as

treeFold :: ([Char] -&gt; [[Char]] -&gt; [Char]) -&gt; (Char -&gt; [Char])
         -&gt; Tree Char -&gt; [Char]


by setting b = [Char], you get what you're looking for - converting a Tree Char to String. You just need to supply the two function for folding, for example

treeFold (\x ys -&gt; x ++ concat ys) (: [])




Update: The signature also isn't correct. The general rule is that the folding function should have one additional argument for each constructor of the data type where recursive types (here Tree a) are replaced by the result of the fold:

treeFold :: (a -&gt; [b] -&gt; b) -&gt; Tree a -&gt; b


For example for a list you have 2 constructors: (:) :: a -&gt; [a] -&gt; [a] and [] :: [a], so its folding function is

foldr :: (a -&gt; b -&gt; b) -&gt; b -&gt; [a] -&gt; b