| definition: |
set1 :: (a1 -> b) -> a1 -> Values b #ifdef __KICS2__ set1 f x = set1With dfsStrategy f x |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Combinator to transform a unary function into a corresponding set function. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> {Values}}
|
| name: |
set1 |
| precedence: |
no precedence defined |
| result-values: |
{Values}
|
| signature: |
(a -> b) -> a -> Values b |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |