| definition: |
permute :: [a] -> [a]
permute [] = []
permute (x:xs) = ndinsert (permute xs)
where ndinsert ys = x : ys
ndinsert (y:ys) = y : ndinsert ys
|
| demand: |
argument 1 |
| deterministic: |
possibly non-deterministic operation |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({[]}) |-> {[]} || ({:}) |-> {:}}
|
| name: |
permute |
| precedence: |
no precedence defined |
| result-values: |
{:,[]}
|
| signature: |
[a] -> [a] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |