blob: 6f9e16f2b4301227f771a24f22e6b2aa49b26de4 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
TYPE SIGNATURES
test1 ::
forall (f :: * -> *). Applicative f => (Int -> f Int) -> f Int
test1a ::
forall (f :: * -> *). Applicative f => (Int -> f Int) -> f Int
test2 ::
forall t b (f :: * -> *).
(Num b, Num t, Applicative f) =>
(t -> f b) -> f b
test2a ::
forall t b (f :: * -> *).
(Num b, Num t, Functor f) =>
(t -> f b) -> f b
test2b ::
forall (m :: * -> *) a t. (Num t, Monad m) => (t -> a) -> m a
test2c ::
forall t b (f :: * -> *).
(Num b, Num t, Functor f) =>
(t -> f b) -> f b
test3 ::
forall a t1 (m :: * -> *) t2.
(Num t2, Monad m) =>
(t2 -> m t1) -> (t1 -> t1 -> m a) -> m a
test4 ::
forall a1 a2 (m :: * -> *) t.
(Num t, Monad m) =>
(t -> m a2) -> (a2 -> a2 -> m a1) -> m a1
test5 ::
forall a1 a2 (m :: * -> *) t.
(Num t, Monad m) =>
(t -> m a2) -> (a2 -> a2 -> m a1) -> m a1
test6 ::
forall a (m :: * -> *) p.
(Num (m a), Monad m) =>
(m a -> m (m a)) -> p -> m a
TYPE CONSTRUCTORS
COERCION AXIOMS
Dependent modules: []
Dependent packages: [base-4.9.0.0, ghc-prim-0.5.0.0,
integer-gmp-1.0.0.1]
|
