1 ghc: module version changed to 1; reason: no old .hi file
2 _interface_ ShouldSucceed 1
4 IO PrelAddr PrelArr PrelBounded PrelCCall PrelForeign PrelNum
6 PrelBase 1 :: $d2 1 $d29 1 $d31 1 $d33 1 $d38 1 Eval 1;
8 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);
10 instance _forall_ [a] => {PrelBase.Eval (Tree a)} = $d1;
11 instance {PrelBase.Eval Nat} = $d2;
12 instance _forall_ [a] => {PrelBase.Eval (List a)} = $d3;
13 instance _forall_ [a b] => {PrelBase.Eval (Pair a b)} = $d4;
14 instance {PrelBase.Eval Boolean} = $d5;
16 1 $d1 _:_ _forall_ [a] => {PrelBase.Eval (Tree a)} ;;
17 1 $d2 _:_ {PrelBase.Eval Nat} ;;
18 1 $d3 _:_ _forall_ [a] => {PrelBase.Eval (List a)} ;;
19 1 $d4 _:_ _forall_ [a b] => {PrelBase.Eval (Pair a b)} ;;
20 1 $d5 _:_ {PrelBase.Eval Boolean} ;;
21 1 add _:_ Nat -> Nat -> Nat ;;
22 1 app _:_ _forall_ [a] => List a -> List a -> List a ;;
23 1 before _:_ List Nat -> List Nat ;;
24 1 data Boolean = FF | TT ;
25 1 data List alpha = Nil | Cons alpha (List alpha) ;
26 1 data Nat = Zero | Succ Nat ;
27 1 data Pair a b = Mkpair a b ;
28 1 data Tree t = Leaf t | Node (Tree t) (Tree t) ;
29 1 flatten _:_ _forall_ [a] => Tree a -> List a ;;
30 1 idb _:_ Boolean -> Boolean ;;
31 1 idl _:_ _forall_ [a] => List a -> List a ;;
32 1 lEngth _:_ _forall_ [a] => List a -> Nat ;;
33 1 nUll _:_ _forall_ [a] => List a -> Boolean ;;
34 1 neg _:_ Boolean -> Boolean ;;
35 1 rEverse _:_ _forall_ [a] => List a -> List a ;;
36 1 sUm _:_ Tree Nat -> Nat ;;
37 1 swap _:_ _forall_ [a b] => Pair a b -> Pair b a ;;