[project @ 1999-02-10 15:45:52 by simonpj]

[ghc-hetmet.git] / ghc / tests / typecheck / should_compile / tc042.stderr

diff --git a/ghc/tests/typecheck/should_compile/tc042.stderr b/ghc/tests/typecheck/should_compile/tc042.stderr
index b20faff..b9fff93 100644 (file)
--- a/ghc/tests/typecheck/should_compile/tc042.stderr
+++ b/ghc/tests/typecheck/should_compile/tc042.stderr
@@ -1,37 +1,19 @@
 ghc: module version changed to 1; reason: no old .hi file
-_interface_ ShouldSucceed 1
-_instance_modules_
-IO PrelAddr PrelArr PrelBounded PrelCCall PrelForeign PrelNum
-_usages_
-PrelBase 1 :: $d2 1 $d29 1 $d31 1 $d33 1 $d38 1 Eval 1;
-_exports_
-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);
-_instances_
-instance _forall_ [a] => {PrelBase.Eval (Tree a)} = $d1;
-instance {PrelBase.Eval Nat} = $d2;
-instance _forall_ [a] => {PrelBase.Eval (List a)} = $d3;
-instance _forall_ [a b] => {PrelBase.Eval (Pair a b)} = $d4;
-instance {PrelBase.Eval Boolean} = $d5;
-_declarations_
-1 $d1 _:_ _forall_ [a] => {PrelBase.Eval (Tree a)} ;;
-1 $d2 _:_ {PrelBase.Eval Nat} ;;
-1 $d3 _:_ _forall_ [a] => {PrelBase.Eval (List a)} ;;
-1 $d4 _:_ _forall_ [a b] => {PrelBase.Eval (Pair a b)} ;;
-1 $d5 _:_ {PrelBase.Eval Boolean} ;;
-1 add _:_ Nat -> Nat -> Nat ;;
-1 app _:_ _forall_ [a] => List a -> List a -> List a ;;
-1 before _:_ List Nat -> List Nat ;;
+__export ShouldSucceed Boolean{FF TT} List{Nil Cons} Nat{ZZero Succ} Pair{Mkpair} Tree{Leaf Node} add app before flatten idb idl lEngth nUll neg rEverse sUm swap;
+1 add :: Nat -> Nat -> Nat ;
+1 app :: __forall [alpha] => List alpha -> List alpha -> List alpha ;
+1 before :: List Nat -> List Nat ;
 1 data Boolean = FF |  TT ;
 1 data List alpha = Nil |  Cons alpha (List alpha) ;
-1 data Nat = Zero |  Succ Nat ;
+1 data Nat = ZZero |  Succ Nat ;
 1 data Pair a b = Mkpair a b ;
 1 data Tree t = Leaf t |  Node (Tree t) (Tree t) ;
-1 flatten _:_ _forall_ [a] => Tree a -> List a ;;
-1 idb _:_ Boolean -> Boolean ;;
-1 idl _:_ _forall_ [a] => List a -> List a ;;
-1 lEngth _:_ _forall_ [a] => List a -> Nat ;;
-1 nUll _:_ _forall_ [a] => List a -> Boolean ;;
-1 neg _:_ Boolean -> Boolean ;;
-1 rEverse _:_ _forall_ [a] => List a -> List a ;;
-1 sUm _:_ Tree Nat -> Nat ;;
-1 swap _:_ _forall_ [a b] => Pair a b -> Pair b a ;;
+1 flatten :: __forall [alpha] => Tree alpha -> List alpha ;
+1 idb :: Boolean -> Boolean ;
+1 idl :: __forall [a] => List a -> List a ;
+1 lEngth :: __forall [a] => List a -> Nat ;
+1 nUll :: __forall [alpha] => List alpha -> Boolean ;
+1 neg :: Boolean -> Boolean ;
+1 rEverse :: __forall [alpha] => List alpha -> List alpha ;
+1 sUm :: Tree Nat -> Nat ;
+1 swap :: __forall [a b] => Pair a b -> Pair b a ;