ghc/compiler/tests/typecheck/should_succeed/tc042.stderr

   1
   2
   3 --================================================================================
   4 Typechecked:
   5 {- nonrec -}
   6 Leaf{-rg,x-}{i} =
   7     _/\_ t{-r5r-} -> \ tpl_B1 ->
   8         Leaf{-rg,x-}{i}
   9             {_@_ t{-r5r-} tpl_B1}
  10 Node{-rf,x-}{i} =
  11     _/\_ t{-r5r-} -> \ tpl_B1 tpl_B2 ->
  12         Node{-rf,x-}{i}
  13             {_@_ t{-r5r-} tpl_B1 tpl_B2}
  14 {- nonrec -}
  15 Zero{-rl,x-}{i} =
  16     Zero{-rl,x-}{i}
  17         {}
  18 Succ{-rk,x-}{i} =
  19     \ tpl_B1 ->
  20         Succ{-rk,x-}{i}
  21             {tpl_B1}
  22 {- nonrec -}
  23 Nil{-rq,x-}{i} =
  24     _/\_ alpha{-r5u-} ->
  25         Nil{-rq,x-}{i}
  26             {_@_ alpha{-r5u-}}
  27 Cons{-rp,x-}{i} =
  28     _/\_ alpha{-r5u-} -> \ tpl_B1 tpl_B2 ->
  29         Cons{-rp,x-}{i}
  30             {_@_ alpha{-r5u-} tpl_B1 tpl_B2}
  31 {- nonrec -}
  32 Mkpair{-r5B,x-}{i} =
  33     _/\_ a{-r5w-} b{-r5x-} -> \ tpl_B1 tpl_B2 ->
  34         Mkpair{-r5B,x-}{i}
  35             {_@_ a{-r5w-} _@_ b{-r5x-} tpl_B1 tpl_B2}
  36 {- nonrec -}
  37 FF{-rx,x-}{i} =
  38     FF{-rx,x-}{i}
  39         {}
  40 TT{-rw,x-}{i} =
  41     TT{-rw,x-}{i}
  42         {}
  43 {- rec -}
  44 AbsBinds [t{-aMR-}] [] [([t{-aMR-}], $d1{-rMX,x-}, d.Eval_aMt)]
  45     d.Eval_aMt =
  46         ({-dict-} [] [])
  47 {- rec -}
  48 AbsBinds [] [] [([], $d2{-rMZ,x-}, d.Eval_aMy)]
  49     d.Eval_aMy =
  50         ({-dict-} [] [])
  51 {- rec -}
  52 AbsBinds
  53 [alpha{-aMS-}]
  54 []
  55 [([alpha{-aMS-}], $d3{-rN1,x-}, d.Eval_aME)]
  56     d.Eval_aME =
  57         ({-dict-} [] [])
  58 {- rec -}
  59 AbsBinds
  60 [a{-aMT-}, b{-aMU-}]
  61 []
  62 [([a{-aMT-}, b{-aMU-}], $d4{-rN3,x-}, d.Eval_aML)]
  63     d.Eval_aML =
  64         ({-dict-} [] [])
  65 {- rec -}
  66 AbsBinds [] [] [([], $d5{-rN5,x-}, d.Eval_aMQ)]
  67     d.Eval_aMQ =
  68         ({-dict-} [] [])
  69 {- nonrec -}
  70 {- rec -}
  71 AbsBinds [] [] [([], before{-r4a,x-}, before_aIA)]
  72     before_aIA
  73         xs_r4Y  =   case xs_r4Y of
  74                       Nil{-rq,x-}{i}
  75                               ->  Nil{-rq,x-}{i}
  76                                       Nat{-r5z,x-}
  77                       (Cons{-rp,x-}{i} y_r51 ys_r52)
  78                               ->  case y_r51 of
  79                                     Zero{-rl,x-}{i}
  80                                             ->  Nil{-rq,x-}{i}
  81                                                     Nat{-r5z,x-}
  82                                     (Succ{-rk,x-}{i} n_r55)
  83                                             ->  Cons{-rp,x-}{i}
  84                                                     Nat{-r5z,x-} y_r51 before{-r4a,x-} ys_r52
  85 {- nonrec -}
  86 {- rec -}
  87 AbsBinds [a{-aJ2-}] [] [([a{-aJ2-}], lEngth{-r49,x-}, lEngth_aIZ)]
  88     lEngth_aIZ
  89         xs_r4S  =   case xs_r4S of
  90                       Nil{-rq,x-}{i}
  91                               ->  Zero{-rl,x-}{i}
  92                       (Cons{-rp,x-}{i} y_r4V ys_r4W)
  93                               ->  Succ{-rk,x-}{i} lEngth{-r49,x-}
  94                                                       a{-aJ2-} ys_r4W
  95 {- nonrec -}
  96 {- rec -}
  97 AbsBinds
  98 [alpha{-aJo-}]
  99 []
 100 [([alpha{-aJo-}], app{-r48,x-}, app_aJl)]
 101     app_aJl
 102         xs_r4K zs_r4M
 103                 =   case xs_r4K of
 104                       Nil{-rq,x-}{i}
 105                               ->  zs_r4M
 106                       (Cons{-rp,x-}{i} y_r4P ys_r4Q)
 107                               ->  Cons{-rp,x-}{i}
 108                                       alpha{-aJo-} y_r4P
 109                                                    app{-r48,x-}
 110                                                        alpha{-aJo-} ys_r4Q zs_r4M
 111 {- nonrec -}
 112 {- rec -}
 113 AbsBinds
 114 [alpha{-aJO-}]
 115 []
 116 [([alpha{-aJO-}], rEverse{-r4b,x-}, rEverse_aJL)]
 117     rEverse_aJL
 118         rs_r57  =   case rs_r57 of
 119                       Nil{-rq,x-}{i}
 120                               ->  Nil{-rq,x-}{i}
 121                                       alpha{-aJO-}
 122                       (Cons{-rp,x-}{i} y_r5a ys_r5b)
 123                               ->  app{-r48,x-}
 124                                       alpha{-aJO-} rEverse{-r4b,x-}
 125                                                        alpha{-aJO-} ys_r5b
 126                                                    Cons{-rp,x-}{i}
 127                                                        alpha{-aJO-} y_r5a
 128                                                                     Nil{-rq,x-}{i}
 129                                                                         alpha{-aJO-}
 130 {- nonrec -}
 131 {- rec -}
 132 AbsBinds
 133 [alpha{-aKi-}]
 134 []
 135 [([alpha{-aKi-}], flatten{-r4c,x-}, flatten_aKf)]
 136     flatten_aKf
 137         t_r5d   =   case t_r5d of
 138                       (Leaf{-rg,x-}{i} x_r5f)
 139                               ->  Cons{-rp,x-}{i}
 140                                       alpha{-aKi-} x_r5f
 141                                                    Nil{-rq,x-}{i}
 142                                                        alpha{-aKi-}
 143                       (Node{-rf,x-}{i} l_r5h r_r5i)
 144                               ->  app{-r48,x-}
 145                                       alpha{-aKi-} flatten{-r4c,x-}
 146                                                        alpha{-aKi-} l_r5h
 147                                                    flatten{-r4c,x-}
 148                                                        alpha{-aKi-} r_r5i
 149 {- nonrec -}
 150 {- rec -}
 151 AbsBinds [] [] [([], add{-r47,x-}, add_aKH)]
 152     add_aKH
 153         a_r4D b_r4F
 154                 =   case a_r4D of
 155                       Zero{-rl,x-}{i}
 156                               ->  b_r4F
 157                       (Succ{-rk,x-}{i} c_r4I)
 158                               ->  Succ{-rk,x-}{i} add{-r47,x-} c_r4I b_r4F
 159 {- nonrec -}
 160 {- rec -}
 161 AbsBinds [] [] [([], sUm{-r4d,x-}, sUm_aKR)]
 162     sUm_aKR
 163         t_r5k   =   case t_r5k of
 164                       (Leaf{-rg,x-}{i} t_r5m)
 165                               ->  t_r5m
 166                       (Node{-rf,x-}{i} l_r5o r_r5p)
 167                               ->  add{-r47,x-} sUm{-r4d,x-} l_r5o sUm{-r4d,x-} r_r5p
 168 {- nonrec -}
 169 {- rec -}
 170 AbsBinds [a{-aLe-}] [] [([a{-aLe-}], idl{-r46,x-}, idl_aLb)]
 171     idl_aLb
 172         xs_r4x  =   case xs_r4x of
 173                       Nil{-rq,x-}{i}
 174                               ->  Nil{-rq,x-}{i}
 175                                       a{-aLe-}
 176                       (Cons{-rp,x-}{i} y_r4A ys_r4B)
 177                               ->  Cons{-rp,x-}{i}
 178                                       a{-aLe-} y_r4A
 179                                                idl{-r46,x-}
 180                                                    a{-aLe-} ys_r4B
 181 {- nonrec -}
 182 {- nonrec -}
 183 AbsBinds
 184 [alpha{-aLD-}]
 185 []
 186 [([alpha{-aLD-}], nUll{-r45,x-}, nUll_aLA)]
 187     nUll_aLA
 188         l_r4r   =   case l_r4r of
 189                       Nil{-rq,x-}{i}
 190                               ->  TT{-rw,x-}{i}
 191                       (Cons{-rp,x-}{i} y_r4u ys_r4v)
 192                               ->  FF{-rx,x-}{i}
 193 {- nonrec -}
 194 {- nonrec -}
 195 AbsBinds [] [] [([], neg{-r44,x-}, neg_aLP)]
 196     neg_aLP
 197         b_r4n   =   case b_r4n of
 198                       FF{-rx,x-}{i}
 199                               ->  TT{-rw,x-}{i}
 200                       TT{-rw,x-}{i}
 201                               ->  FF{-rx,x-}{i}
 202 {- nonrec -}
 203 {- nonrec -}
 204 AbsBinds
 205 [a{-aM3-}, b{-aM4-}]
 206 []
 207 [([b{-aM4-}, a{-aM3-}], swap{-r43,x-}, swap_aM0)]
 208     swap_aM0
 209         t_r4i   =   case t_r4i of
 210                       (Mkpair{-r5B,x-}{i} x_r4k y_r4l)
 211                               ->  Mkpair{-r5B,x-}{i}
 212                                       [b{-aM4-}, a{-aM3-}] y_r4l x_r4k
 213 {- nonrec -}
 214 {- nonrec -}
 215 AbsBinds [] [] [([], idb{-r42,x-}, idb_aMl)]
 216     idb_aMl
 217         x_r4g   =   x_r4g
 218 {- nonrec -}
 219 ghc: module version changed to 1; reason: no old .hi file
 220 _interface_ ShouldSucceed 1
 221 _instance_modules_
 222 ArrBase IO PrelNum
 223 _usages_
 224 PrelBase 1 :: $d37 1 $d39 1 $d41 1 $d46 1 Eval 1;
 225 _exports_
 226 ShouldSucceed add app before flatten idb idl lEngth nUll neg rEverse sUm swap Boolean(FF TT) List(Nil Cons) Nat(Zero Succ) Pair(Mkpair) Tree(Leaf Node);
 227 _instances_
 228 instance _forall_ [a] => {PrelBase.Eval (Tree a)} = $d1;
 229 instance {PrelBase.Eval Nat} = $d2;
 230 instance _forall_ [a] => {PrelBase.Eval (List a)} = $d3;
 231 instance _forall_ [a b] => {PrelBase.Eval (Pair a b)} = $d4;
 232 instance {PrelBase.Eval Boolean} = $d5;
 233 _declarations_
 234 1 $d1 _:_ _forall_ [a] => {PrelBase.Eval (Tree a)} ;;
 235 1 $d2 _:_ {PrelBase.Eval Nat} ;;
 236 1 $d3 _:_ _forall_ [a] => {PrelBase.Eval (List a)} ;;
 237 1 $d4 _:_ _forall_ [a b] => {PrelBase.Eval (Pair a b)} ;;
 238 1 $d5 _:_ {PrelBase.Eval Boolean} ;;
 239 1 data Boolean = FF |  TT ;
 240 1 data List r5u = Nil |  Cons r5u (List r5u) ;
 241 1 data Nat = Zero |  Succ Nat ;
 242 1 data Pair r5w r5x = Mkpair r5w r5x ;
 243 1 data Tree r5r = Leaf r5r |  Node (Tree r5r) (Tree r5r) ;
 244 1 add _:_ Nat -> Nat -> Nat ;;
 245 1 app _:_ _forall_ [a] => List a -> List a -> List a ;;
 246 1 before _:_ List Nat -> List Nat ;;
 247 1 flatten _:_ _forall_ [a] => Tree a -> List a ;;
 248 1 idb _:_ Boolean -> Boolean ;;
 249 1 idl _:_ _forall_ [a] => List a -> List a ;;
 250 1 lEngth _:_ _forall_ [a] => List a -> Nat ;;
 251 1 nUll _:_ _forall_ [a] => List a -> Boolean ;;
 252 1 neg _:_ Boolean -> Boolean ;;
 253 1 rEverse _:_ _forall_ [a] => List a -> List a ;;
 254 1 sUm _:_ Tree Nat -> Nat ;;
 255 1 swap _:_ _forall_ [a b] => Pair b a -> Pair a b ;;