| definition: |
(<$) :: res1 -> Grappa t res2 -> Grappa t res1 f <$ p = const f <$> p |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> {<*>}}
|
| name: |
<$ |
| precedence: |
no precedence defined |
| result-values: |
{<*>}
|
| signature: |
a -> ([(b, [Prelude.Int])] -> (c, [(b, [Prelude.Int])])) -> [(b, [Prelude.Int])] -> (a, [(b, [Prelude.Int])]) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |