| definition: |
someValueWith :: Strategy a -> a -> a someValueWith strategy x = head (vsToList (strategy (someSearchTree x))) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Returns some value for an expression w.r.t. a search strategy. --- A search strategy is an operation to traverse a search tree --- and collect all values, e.g., 'dfsStrategy' or 'bfsStrategy'. --- --- Note that this operation is not purely declarative since --- the computed value depends on the ordering of the program rules. --- Thus, this operation should be used only if the expression --- has a single value. It fails if the expression has no value. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
someValueWith |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(SearchTree a -> ValueSequence a) -> a -> a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |