CurryInfo: icurry-3.3.0 / ICurry.Graph.reachableGraph
demand: 
|
argument 1 |
|
deterministic:
|
deterministic operation |
|
failfree:
|
(_, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{({Graph},_) |-> {Graph}}
|
|
name:
|
reachableGraph |
|
precedence:
|
no precedence defined |
|
result-values:
|
{Graph}
|
|
signature:
|
Graph -> [Prelude.Int] -> Graph |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
possibly non-reducible on same data term |