3 --================================================================================
7 _/\_ t{-r5r-} -> \ tpl_B1 ->
11 _/\_ t{-r5r-} -> \ tpl_B1 tpl_B2 ->
13 {_@_ t{-r5r-} tpl_B1 tpl_B2}
28 _/\_ alpha{-r5u-} -> \ tpl_B1 tpl_B2 ->
30 {_@_ alpha{-r5u-} tpl_B1 tpl_B2}
33 _/\_ a{-r5w-} b{-r5x-} -> \ tpl_B1 tpl_B2 ->
35 {_@_ a{-r5w-} _@_ b{-r5x-} tpl_B1 tpl_B2}
44 AbsBinds [t{-aMR-}] [] [([t{-aMR-}], $d1{-rMX,x-}, d.Eval_aMt)]
48 AbsBinds [] [] [([], $d2{-rMZ,x-}, d.Eval_aMy)]
55 [([alpha{-aMS-}], $d3{-rN1,x-}, d.Eval_aME)]
62 [([a{-aMT-}, b{-aMU-}], $d4{-rN3,x-}, d.Eval_aML)]
66 AbsBinds [] [] [([], $d5{-rN5,x-}, d.Eval_aMQ)]
71 AbsBinds [] [] [([], before{-r4a,x-}, before_aIA)]
73 xs_r4Y = case xs_r4Y of
77 (Cons{-rp,x-}{i} y_r51 ys_r52)
82 (Succ{-rk,x-}{i} n_r55)
84 Nat{-r5z,x-} y_r51 before{-r4a,x-} ys_r52
87 AbsBinds [a{-aJ2-}] [] [([a{-aJ2-}], lEngth{-r49,x-}, lEngth_aIZ)]
89 xs_r4S = case xs_r4S of
92 (Cons{-rp,x-}{i} y_r4V ys_r4W)
93 -> Succ{-rk,x-}{i} lEngth{-r49,x-}
100 [([alpha{-aJo-}], app{-r48,x-}, app_aJl)]
106 (Cons{-rp,x-}{i} y_r4P ys_r4Q)
110 alpha{-aJo-} ys_r4Q zs_r4M
116 [([alpha{-aJO-}], rEverse{-r4b,x-}, rEverse_aJL)]
118 rs_r57 = case rs_r57 of
122 (Cons{-rp,x-}{i} y_r5a ys_r5b)
124 alpha{-aJO-} rEverse{-r4b,x-}
135 [([alpha{-aKi-}], flatten{-r4c,x-}, flatten_aKf)]
137 t_r5d = case t_r5d of
138 (Leaf{-rg,x-}{i} x_r5f)
143 (Node{-rf,x-}{i} l_r5h r_r5i)
145 alpha{-aKi-} flatten{-r4c,x-}
151 AbsBinds [] [] [([], add{-r47,x-}, add_aKH)]
157 (Succ{-rk,x-}{i} c_r4I)
158 -> Succ{-rk,x-}{i} add{-r47,x-} c_r4I b_r4F
161 AbsBinds [] [] [([], sUm{-r4d,x-}, sUm_aKR)]
163 t_r5k = case t_r5k of
164 (Leaf{-rg,x-}{i} 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
170 AbsBinds [a{-aLe-}] [] [([a{-aLe-}], idl{-r46,x-}, idl_aLb)]
172 xs_r4x = case xs_r4x of
176 (Cons{-rp,x-}{i} y_r4A ys_r4B)
186 [([alpha{-aLD-}], nUll{-r45,x-}, nUll_aLA)]
188 l_r4r = case l_r4r of
191 (Cons{-rp,x-}{i} y_r4u ys_r4v)
195 AbsBinds [] [] [([], neg{-r44,x-}, neg_aLP)]
197 b_r4n = case b_r4n of
207 [([b{-aM4-}, a{-aM3-}], swap{-r43,x-}, 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
215 AbsBinds [] [] [([], idb{-r42,x-}, idb_aMl)]
219 ghc: module version changed to 1; reason: no old .hi file
220 _interface_ ShouldSucceed 1
224 PrelBase 1 :: $d37 1 $d39 1 $d41 1 $d46 1 Eval 1;
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);
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;
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 ;;