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
41
42
43
44
45
46
47
48
49
50
51
|
==================== Tidy Core ====================
Result size of Tidy Core = {terms: 78, types: 81, coercions: 0, joins: 0/1}
-- RHS size: {terms: 6, types: 4, coercions: 0, joins: 0/0}
T18109.$WU :: [Int] %1 -> U
T18109.$WU = \ (dt_aDr :: [Int]) -> case dt_aDr of dt_X0 { __DEFAULT -> T18109.U dt_X0 }
-- RHS size: {terms: 6, types: 12, coercions: 0, joins: 0/0}
T18109.$wg :: (Int, Int) -> (# (Int, Int) #)
T18109.$wg = \ (ww_sKr :: (Int, Int)) -> case ww_sKr of p_X2 { (ipv_sIU, ipv1_sIV) -> (# p_X2 #) }
-- RHS size: {terms: 10, types: 13, coercions: 0, joins: 0/0}
g :: T -> T
g = \ (w_sKp :: T) -> case w_sKp of { T ww_sKr -> case T18109.$wg ww_sKr of { (# ww1_sKJ #) -> T18109.T ww1_sKJ } }
-- RHS size: {terms: 6, types: 5, coercions: 0, joins: 0/0}
T18109.$wf :: Int -> (# Int -> Int #)
T18109.$wf = \ (w_sKw :: Int) -> (# \ (v_B2 :: Int) -> GHC.Num.$fNumInt_$c+ v_B2 w_sKw #)
-- RHS size: {terms: 7, types: 7, coercions: 0, joins: 0/0}
f :: Int -> F
f = \ (w_sKw :: Int) -> case T18109.$wf w_sKw of { (# ww_sKL #) -> T18109.F ww_sKL }
-- RHS size: {terms: 26, types: 10, coercions: 0, joins: 0/1}
T18109.$wh :: GHC.Prim.Int# -> [Int]
T18109.$wh
= \ (ww_sKE :: GHC.Prim.Int#) ->
case GHC.Prim.># 0# ww_sKE of {
__DEFAULT ->
letrec {
go3_aKm :: GHC.Prim.Int# -> [Int]
go3_aKm
= \ (x_aKn :: GHC.Prim.Int#) ->
GHC.Types.:
@Int
(GHC.Types.I# x_aKn)
(case GHC.Prim.==# x_aKn ww_sKE of {
__DEFAULT -> go3_aKm (GHC.Prim.+# x_aKn 1#);
1# -> GHC.Types.[] @Int
}); } in
go3_aKm 0#;
1# -> GHC.Types.[] @Int
}
-- RHS size: {terms: 10, types: 5, coercions: 0, joins: 0/0}
h :: Int -> U
h = \ (w_sKC :: Int) -> case w_sKC of { GHC.Types.I# ww_sKE -> case T18109.$wh ww_sKE of ww1_sKN { __DEFAULT -> T18109.U ww1_sKN } }
|