| definition: |
until :: (a -> Bool) -> (a -> a) -> a -> a until p f x = if p x then x else until p f (f x) |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Repeats application of a function until a predicate holds. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
until |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(a -> Bool) -> (a -> a) -> a -> a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |