CurryInfo: base-3.4.0 / Control.Monad.forever
definition: 
|
forever :: (Applicative f) => f a -> f b forever a = let a' = a *> a' in a' |
|
demand:
|
argument 1 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Repeat an action indefinitely. |
|
failfree:
|
(_, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_) |-> _}
|
|
name:
|
forever |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
Prelude.Applicative a => a b -> a c |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |