| definition: |
nodeChildren :: Node -> [NodeID] nodeChildren (FuncNode _ cs) = cs nodeChildren (ConsNode _ cs) = cs nodeChildren (PartNode _ _ cs) = cs nodeChildren (ChoiceNode _ c1 c2) = [c1, c2] nodeChildren FreeNode = [] |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({FuncNode}) |-> _ || ({ConsNode}) |-> _ || ({PartNode}) |-> _ || ({ChoiceNode}) |-> {:} || ({FreeNode}) |-> {[]}}
|
| name: |
nodeChildren |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Node -> [Prelude.Int] |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |