| definition: |
openNode :: Eq a => (a, [(a, [String])]) -> IO [Tree (String, [(a, [String])])] openNode (mod,modimps) = let mbimps = lookup mod modimps in return $ maybe [] (map (\m->Leaf m (m,modimps))) mbimps |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{(,)}) |-> _}
|
| name: |
openNode |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Eq a => (a, [(a, [String])]) -> Prelude.IO [Tree (String, [(a, [String])])] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |