| definition: |
invf1 :: (Data a, Data b) => (a -> b) -> (b -> a) invf1 f y | f x =:<= y = x where x free |
| demand: |
argument 3 |
| deterministic: |
possibly non-deterministic operation |
| documentation: |
--- Inverts a unary function. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,_) |-> _}
|
| name: |
invf1 |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(Prelude.Data a, Prelude.Data b) => (a -> b) -> b -> a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |