Re: [Haskell-cafe] Rose Tree

2007-11-04 Thread Andrew Wagner
I think it's not at all clear what you're asking for here. can you give an example inputs and outputs you'd expect? It looks like you're trying to implement some kind of dictionary or something? Also, have you looked at the library Data.Tree? It might be useful for you. On 11/3/07, Ryan Bloor

Re: [Haskell-cafe] Rose Tree

2007-11-04 Thread Kalman Noel
Ryan Bloor: Data Tree a = Empty | Leaf a | Node a [(Tree a)] The Leaf constructor seems superfluous to me. Any (Leaf x) value is equivalent to (Node x []). So I rather just have data Tree a = Empty | Node a [Tree a] which will mean less work for your task of writing processing functions,

[Haskell-cafe] Rose Tree

2007-11-03 Thread Ryan Bloor
Hello, I need help... I am having trouble with rose trees. 1 2 3 4 5 6 7 8910 11 That is the rose tree that I seek.