| definition: |
(.) :: (b -> c) -> (a -> b) -> (a -> c) f . g = \x -> f (g x) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Function composition. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
infixr |
| iotype: |
{(_,_) |-> {.._#lambda508}}
|
| name: |
. |
| precedence: |
9 |
| result-values: |
{.._#lambda508}
|
| signature: |
(a -> b) -> (c -> a) -> c -> b |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |