| definition: |
tree2strings :: Int -> Tree a -> [String]
tree2strings n (Leaf t _) = [blanks n ++ "+ "++t]
tree2strings n (Node t _ trees) = (blanks n ++"- "++t)
: concatMap (tree2strings (n+2)) trees
|
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{Leaf}) |-> {:} || (_,{Node}) |-> {:}}
|
| name: |
tree2strings |
| precedence: |
no precedence defined |
| result-values: |
{:}
|
| signature: |
Prelude.Int -> Tree a -> [String] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |