|
definition: |
set3With :: Strategy b -> (a1 -> a2 -> a3 -> b) -> a1 -> a2 -> a3 -> Values b set3With s f x1 x2 x3 = allVs s (\_ -> f x1 x2 x3) |
|
demand: |
no demanded arguments |
|
deterministic: |
deterministic operation |
|
documentation: |
Combinator to transform a function of arity 3 into a corresponding set function that uses a given strategy to compute its values. |
|
failfree: |
(_, _, _, _, _) |
|
indeterministic: |
referentially transparent operation |
|
infix: |
no fixity defined |
|
iotype: |
{(_,_,_,_,_) |-> {Values}}
|
|
name: |
set3With |
|
precedence: |
no precedence defined |
|
result-values: |
{Values}
|
|
signature: |
(Control.Search.SearchTree.SearchTree a -> Control.Search.SearchTree.ValueSequence a) -> (b -> c -> d -> a) -> b -> c -> d -> Values a |
|
solution-complete: |
operation might suspend on free variables |
|
terminating: |
yes |
|
totally-defined: |
reducible on all ground data terms |