| definition: |
fix :: (a -> a) -> a fix f = let x = f x in x |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- `fix f` is the least fixed point of the function `f`, --- i.e. the least defined `x` such that `f x = x`. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> _}
|
| name: |
fix |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(a -> a) -> a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |