-- !!! test of datatype with many unboxed fields
--
-import PrelBase
+import PrelFloat
main = putStr (shows (selectee1 + selectee2) "\n")
-
-ds003.hs:5: Pattern match(es) are overlapped in the definition of function `f':
- f (x : (x1 : (x2 : x3))) ~(y, ys) z = ...
- f x y True = ...
+Haskell compiler received signal 2
ds040.hs:7: Pattern match(es) are overlapped in the definition of function `^^^^':
^^^^ _ _ = ...
+NOTE: Simplifier still going after 4 iterations; bailing out.
getEnv_except :: IOError -> IO String
getEnv_except ioe
| isDoesNotExistError ioe = return ""
- | otherwise = fail ioe
+ | otherwise = ioError ioe
main =
system "cat dog 1>/dev/null 2>&1" >>= \ ec ->
case ec of
- ExitSuccess -> putStr "What?!?\n" >> fail (userError "dog succeeded")
+ ExitSuccess -> putStr "What?!?\n" >> ioError (userError "dog succeeded")
ExitFailure _ ->
system "cat io005.hs 2>/dev/null" >>= \ ec ->
case ec of
ExitSuccess -> exitWith ExitSuccess
- ExitFailure _ -> putStr "What?!?\n" >> fail (userError "cat failed")
+ ExitFailure _ -> putStr "What?!?\n" >> ioError (userError "cat failed")
main =
system "cat dog 1>/dev/null 2>&1" >>= \ ec ->
case ec of
- ExitSuccess -> putStr "What?!?\n" >> fail (userError "dog succeeded")
+ ExitSuccess -> putStr "What?!?\n" >> ioError (userError "dog succeeded")
ExitFailure _ ->
system "cat io005.hs 2>/dev/null" >>= \ ec ->
case ec of
ExitSuccess -> exitWith ExitSuccess
- ExitFailure _ -> putStr "What?!?\n" >> fail (userError "cat failed")
+ ExitFailure _ -> putStr "What?!?\n" >> ioError (userError "cat failed")
removeDirectory "foo"
putStr "Okay\n"
else
- fail (userError "Oops")
+ ioError (userError "Oops")
dot :: String -> Bool
dot "." = True
import IO -- 1.3
main =
- accumulate (map hIsOpen [stdin, stdout, stderr]) >>= \ opens ->
+ sequence (map hIsOpen [stdin, stdout, stderr]) >>= \ opens ->
print opens >>
- accumulate (map hIsClosed [stdin, stdout, stderr]) >>= \ closeds ->
+ sequence (map hIsClosed [stdin, stdout, stderr]) >>= \ closeds ->
print closeds >>
- accumulate (map hIsReadable [stdin, stdout, stderr]) >>= \ readables ->
+ sequence (map hIsReadable [stdin, stdout, stderr]) >>= \ readables ->
print readables >>
- accumulate (map hIsWritable [stdin, stdout, stderr]) >>= \ writables ->
+ sequence (map hIsWritable [stdin, stdout, stderr]) >>= \ writables ->
print writables >>
- accumulate (map hIsBlockBuffered [stdin, stdout, stderr]) >>= \ buffereds ->
+ sequence (map hIsBlockBuffered [stdin, stdout, stderr]) >>= \ buffereds ->
print buffereds >>
- accumulate (map hIsLineBuffered [stdin, stdout, stderr]) >>= \ buffereds ->
+ sequence (map hIsLineBuffered [stdin, stdout, stderr]) >>= \ buffereds ->
print buffereds >>
- accumulate (map hIsNotBuffered [stdin, stdout, stderr]) >>= \ buffereds ->
+ sequence (map hIsNotBuffered [stdin, stdout, stderr]) >>= \ buffereds ->
print buffereds
where
-- these didn't make it into 1.3
---!!! Testing RW handles
+-- !!! Testing RW handles
module Main(main) where
---!!! Testing output on stdout
+-- !!! Testing output on stdout
module Main(main) where
-- stdout is buffered, so test if its buffer
---!!! Testing IO.hFileSize
+-- !!! Testing IO.hFileSize
module Main(main) where
import IO
---!!! Testing EOF (and the clearing of it)
+-- !!! Testing EOF (and the clearing of it)
module Main(main) where
import IO
---!!! Flushing
+-- !!! Flushing
module Main(main) where
import IO
---!!! file positions (hGetPosn and hSetPosn)
+-- !!! file positions (hGetPosn and hSetPosn)
module Main(main) where
import IO
---!!! RW files
+-- !!! RW files
module Main(main) where
import IO
-{-# OPTIONS -H12m -syslib exts #-}
+{-# OPTIONS -H12m -syslib lang #-}
module Basic where
import TypesettingTricks
import IO (putStr)
import System hiding (getArgs)
import Monad
-{- rec -}
bindwith ::
{- implicit forall -} (OrdClass a, OrdClass b) => a -> b -> b
g ::
{- implicit forall -}
(Num a, Eq b) =>
Foo a -> [b] -> (a, a, a) -> b
-g x y zz = head y
+g x y z = head y
f _
x
1
'c'
"dog"
~y
- (zz@(Foo a b))
+ (z@(Foo a b))
(c Bar d)
[1, 2]
(3, 4)
((n+42))
= y
expr a b c d
- = ((((((((a zp (ZC a b)) zp (a ZC b))
- zp (((1 zm 'c') zm "abc") zm 1.293))
- zp ((\ x y zz -> x) 42))
- zp ((9 zt)))
- zp ((zt 8)))
- zp (case x of
- Prelude.ZMZN
- | null x -> 99
- | otherwise -> 98
- | True -> 97
- where
- {- rec -}
- null x = False))
- zp ([zz | zz <- c, isSpace zz]))
- zp (let
- {- rec -}
- y = foo
- in
- (((((((y zp [1, 2, 3, 4]) zp (4, 3, 2, 1))
- zp (4 :: {- implicit forall -} (Num a) => a))
- zp (if 42 zeze 42.0 then 1 else 4))
- zp ([1 .. ]))
- zp ([2, 4 .. ]))
- zp ([3 .. 5]))
- zp ([4, 8 .. 999]))
+ = ((((...) + (...))
+ + (case ... of
+ Prelude.[]
+ | ... -> ...
+ | ... -> ...
+ | ... -> ...
+ where
+ ...))
+ + ([z | z <- c, isSpace z]))
+ + (let y = ... in ((...) + (...)) + ([..., ... .. ...]))
mat a b c d
| foof a b = d
| foof a c = d
| foof b c = d
where
- {- rec -}
- foof a b = a zeze b
+ foof a b = a == b
(~(a, b, c))
| nullity b = a
| nullity c = a
| otherwise = a
where
- {- rec -}
nullity = null
recb a = reca a
reca a = recb a
fixl x y = x
fixn x y = x
infix 6 fixn
-infixl 7 zpzh
+infixl 7 +#
infixr 8 fixr
type Pair a b = (a, b)
data FooData = forall. FooCon Int
==================== Parser ====================
module Read003 where
-{- rec -}
~(a, b, c)
| nullity b = a
| nullity c = a
| otherwise = a
where
- {- rec -}
nullity = null
==================== Parser ====================
module ShouldFail where
-{- rec -}
f :: {- implicit forall -} Int -> IO Int
f x = do
- (2 zp 2) <- 2
+ (2 + 2) <- 2
return x
==================== Parser ====================
module ShouldFail where
-{- rec -}
h x = x
-foo = do
- let {- rec -}
- foo = True
+foo = do let foo = True
==================== Parser ====================
module ShouldFail where
import qualified List as L (intersperse)
-{- rec -}
y = intersperse
x = L.intersperse
rnfail014.hs:8:
- None of the type variable(s) in the constraint `Eq a'
- appears in the type `Eq Bool'
+ All of the type variable(s) in the constraint `Eq a' are already in scope
+ At least one must be universally quantified here
In the type signature for an instance decl
rnfail014.hs:12:
- None of the type variable(s) in the constraint `Eq a'
- appears in the type `Int -> Int'
+ All of the type variable(s) in the constraint `Eq a' are already in scope
+ At least one must be universally quantified here
In the type signature for `f'
rnfail014.hs:17:
- None of the type variable(s) in the constraint `Eq a'
- appears in the type `a -> a'
+ All of the type variable(s) in the constraint `Eq a' are already in scope
+ At least one must be universally quantified here
In the type signature for `op'
Compilation had errors
-rnfail018.hs:12:
- The constrained type variable `b' does not appear in the type `m a'
- In the type signature for `setState0'
-
rnfail018.hs:12: Type variable not in scope: `a'
rnfail018.hs:12: Type variable not in scope: `m'
-rnfail019.hs:5:
- The operator `:' [infixr 5] of a section
- must have lower precedence than the operand `:' [infixr 5]
- In the section: `((x : y) :)'
+rnfail020.hs:12:
+ All of the type variable(s) in the constraint `Eq a' are already in scope
+ At least one must be universally quantified here
+ In the type signature for `unionSets'
Compilation had errors
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Point2{Point2} area2;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed a;
1 a :: __forall [a] => {PrelNum.Num a} -> a -> a ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed b;
-1 b :: PrelBase.Integer ;
+1 b :: PrelNum.Integer ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed c d e;
-1 c :: (PrelBase.Integer, PrelBase.Integer) ;
-1 d :: PrelBase.Integer ;
-1 e :: PrelBase.Integer ;
+1 c :: (PrelNum.Integer, PrelNum.Integer) ;
+1 d :: PrelNum.Integer ;
+1 e :: PrelNum.Integer ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f;
1 f :: PrelBase.Bool -> PrelBase.Bool ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed g;
1 g :: __forall [t t1] => {PrelNum.Num t1} -> ([t1], t) -> t1 ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed h;
-1 h :: [PrelBase.Integer] ;
+1 h :: [PrelNum.Integer] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed j k l m;
-1 j :: PrelBase.Integer ;
-1 k :: [PrelBase.Integer] ;
-1 l :: [PrelBase.Integer] ;
-1 m :: PrelBase.Integer ;
+1 j :: PrelNum.Integer ;
+1 k :: [PrelNum.Integer] ;
+1 l :: [PrelNum.Integer] ;
+1 m :: PrelNum.Integer ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed n;
1 n :: __forall [t] => {PrelNum.Num t} -> PrelBase.Bool -> t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed o;
1 o :: __forall [a] => {PrelNum.Num a} -> (PrelBase.Bool, a) -> a ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed p;
-1 p :: [(PrelBase.Integer, PrelBase.Bool)] ;
+1 p :: [(PrelNum.Integer, PrelBase.Bool)] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed x;
1 x :: __forall [t] => t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed q;
1 q :: __forall [t] => t -> t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed r s;
-1 r :: PrelBase.Integer ;
+1 r :: PrelNum.Integer ;
1 s :: PrelBase.Char ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed t;
-1 t :: PrelBase.Integer ;
+1 t :: PrelNum.Integer ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed u;
1 u :: __forall [t t1 t2] => t -> (t1, t2) -> t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f;
1 f :: __forall [t t1] => t -> t1 -> t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed v;
-1 v :: PrelBase.Integer ;
+1 v :: PrelNum.Integer ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed w;
-1 w :: PrelBase.Integer ;
+1 w :: PrelNum.Integer ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed al am;
-1 al :: PrelBase.Integer ;
-1 am :: [PrelBase.Integer] ;
+1 al :: PrelNum.Integer ;
+1 am :: [PrelNum.Integer] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f;
1 f :: __forall [t] => t -> [t] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed a f x;
1 a :: __forall [t t1] => (t, t1) ;
1 f :: __forall [t t1 t2] => t -> (t1, t2) ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed iD main;
1 iD :: __forall [t] => t -> t ;
1 main :: __forall [t] => t -> t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed k main s;
1 k :: __forall [t t1] => t -> t1 -> t ;
1 main :: __forall [t] => t -> t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed k main s;
1 k :: __forall [t t1] => t -> t1 -> t ;
1 main :: __forall [t] => t -> t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed g;
1 g :: PrelBase.Bool -> PrelBase.Bool ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f g;
1 f :: __forall [t] => PrelBase.Bool -> t -> t ;
1 g :: PrelBase.Bool -> PrelBase.Bool ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f g h;
1 f :: __forall [t] => PrelBase.Bool -> t -> t ;
1 g :: __forall [t] => t -> PrelBase.Bool -> t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed H;
1 type H = (PrelBase.Int, PrelBase.Bool) ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed G K{H M};
1 data K = H PrelBase.Bool | M G ;
1 type G = [PrelBase.Int] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed G H;
1 type G = (H, PrelBase.Char) ;
1 type H = [PrelBase.Bool] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Rec{Node};
1 data Rec = Node PrelBase.Int Rec ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed AList{Node Other};
1 data AList b = Node b [b] | Other (b, PrelBase.Char) ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed F Twine{Twine2} Twist{Twist2};
1 data Twine = Twine2 Twist ;
1 data Twist = Twist2 Twine ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed AList{ANull ANode} IntList g;
1 data AList a = ANull | ANode a (AList a) ;
1 g :: __forall [t] => {PrelNum.Num t} -> AList PrelBase.Bool -> t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed AnnExpr Expr{Var App} g;
1 data Expr a = Var [PrelBase.Char] | App (AnnExpr a) (AnnExpr a) ;
1 g :: __forall [a] => (a, Expr a) -> [[PrelBase.Char]] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed A{op1};
1 class {PrelBase.Eq a} => A a where {op1 :: a -> a} ;
+1 zddmop1 :: __forall [a] => {A a} -> a -> a ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eqzq{deq};
instance __forall [a] => {Eqzq a} -> {Eqzq [a]} = zdfEqzqZMZN;
1 class Eqzq a where {deq :: a -> a -> PrelBase.Bool} ;
+1 zddmdeq :: __forall [a] => {Eqzq a} -> a -> a -> PrelBase.Bool ;
1 zdfEqzqZMZN :: __forall [a] => {Eqzq a} -> {Eqzq [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f;
1 f :: __forall [a] => {PrelNum.Num a} -> {PrelBase.Eq a} -> [a] -> [a] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed A{op1};
1 class {PrelBase.Eq a} => A a where {op1 :: a -> a} ;
+1 zddmop1 :: __forall [a] => {A a} -> a -> a ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f;
1 f :: __forall [a] => {PrelBase.Eq a} -> a -> [a] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed H{op1} f;
instance {H PrelBase.Bool} = zdfHBool;
1 class H a where {op1 :: a -> a -> a} ;
1 f :: PrelBase.Bool -> PrelBase.Int -> PrelBase.Bool ;
+1 zddmop1 :: __forall [a] => {H a} -> a -> a -> a ;
1 zdfHBool :: {H PrelBase.Bool} ;
-ghc: module version changed to 1; reason: no old .hi file
__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 ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed A{op1} B{op2} f;
instance {A PrelBase.Int} = zdfAInt;
instance __forall [a] => {B a} -> {B [a]} = zdfBZMZN;
1 class A a where {op1 :: a} ;
1 class B b where {op2 :: b -> PrelBase.Int} ;
1 f :: __forall [t a] => {A a} -> t -> a ;
+1 zddmop1 :: __forall [a] => {A a} -> a ;
+1 zddmop2 :: __forall [b] => {B b} -> b -> PrelBase.Int ;
1 zdfAInt :: {A PrelBase.Int} ;
1 zdfBZMZN :: __forall [a] => {B a} -> {B [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f;
1 f :: __forall [t] => t -> PrelBase.Z0T ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed B{op2} C{op1};
instance __forall [a] => {B a} -> {B [a]} = zdfBZMZN;
instance __forall [a] => {C [a]} = zdfCZMZN;
1 class {C a} => B a where {op2 :: a -> a -> a} ;
1 class C a where {op1 :: a -> a} ;
-1 zdfBZMZN :: __forall [a] => {B a} -> {C [a]} -> {B [a]} ;
+1 zddmop1 :: __forall [a] => {C a} -> a -> a ;
+1 zddmop2 :: __forall [a] => {B a} -> a -> a -> a ;
+1 zdfBZMZN :: __forall [a] => {B a} -> {B [a]} ;
1 zdfCZMZN :: __forall [a] => {C [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed B{op2} C{op1};
1 class {C a} => B a where {op2 :: a -> a -> a} ;
1 class C a where {op1 :: a -> a} ;
+1 zddmop1 :: __forall [a] => {C a} -> a -> a ;
+1 zddmop2 :: __forall [a] => {B a} -> a -> a -> a ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed OL f mp sd;
1 f :: __forall [t t1 t2] => t -> [(t1, t2)] -> [t2] ;
1 mp :: __forall [t t1] => (t -> t1) -> [t] -> [t1] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed AFE{MkAFE} FG{MkFG} OL{MkOL} mAp ranAFE ranOAL sNd;
1 data AFE n a b = MkAFE (OL (n, FG a b)) ;
1 data FG a b = MkFG (OL (a, b)) ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed fib main1 main2 main3 mem mem1 mem2 mem3 mem4 oR oR1;
1 fib :: __forall [a] => {PrelNum.Num a} -> {PrelBase.Ord a} -> a -> a ;
1 main1 :: PrelBase.Bool ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Foo{o_and} f g;
instance {Foo PrelBase.Bool} = zdfFooBool;
instance {Foo PrelBase.Int} = zdfFooInt;
1 class Foo a where {o_and :: a -> a -> a} ;
1 f :: __forall [t] => PrelBase.Bool -> t -> PrelBase.Bool ;
1 g :: __forall [t a] => {PrelNum.Num a} -> {Foo a} -> a -> t -> a ;
+1 zddmo_and :: __forall [a] => {Foo a} -> a -> a -> a ;
1 zdfFooBool :: {Foo PrelBase.Bool} ;
1 zdfFooInt :: {Foo PrelBase.Int} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eqzq{doubleeq} Ordzq{lt};
instance {Eqzq PrelBase.Int} = zdfEqzqInt;
instance __forall [a] => {Eqzq a} -> {Eqzq [a]} = zdfEqzqZMZN;
instance {Ordzq PrelBase.Int} = zdfOrdzqInt;
1 class Eqzq a where {doubleeq :: a -> a -> PrelBase.Bool} ;
1 class {Eqzq a} => Ordzq a where {lt :: a -> a -> PrelBase.Bool} ;
+1 zddmdoubleeq :: __forall [a] => {Eqzq a} -> a -> a -> PrelBase.Bool ;
+1 zddmlt :: __forall [a] => {Ordzq a} -> a -> a -> PrelBase.Bool ;
1 zdfEqzqInt :: {Eqzq PrelBase.Int} ;
1 zdfEqzqZMZN :: __forall [a] => {Eqzq a} -> {Eqzq [a]} ;
1 zdfOrdzqInt :: {Ordzq PrelBase.Int} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed A B C;
1 type A a = B a ;
1 type B c = C ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eqzq{deq} f;
instance {Eqzq PrelBase.Int} = zdfEqzqInt;
instance __forall [a] => {Eqzq a} -> {Eqzq [a]} = zdfEqzqZMZN;
1 class Eqzq a where {deq :: a -> a -> PrelBase.Bool} ;
1 f :: __forall [t] => {PrelNum.Num t} -> {Eqzq [t]} -> [t] -> PrelBase.Bool ;
+1 zddmdeq :: __forall [a] => {Eqzq a} -> a -> a -> PrelBase.Bool ;
1 zdfEqzqInt :: {Eqzq PrelBase.Int} ;
1 zdfEqzqZMZN :: __forall [a] => {Eqzq a} -> {Eqzq [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eqzq{doubleeq} Ordzq{lt} f;
instance {Eqzq PrelBase.Int} = zdfEqzqInt;
instance {Ordzq PrelBase.Int} = zdfOrdzqInt;
1 class Eqzq a where {doubleeq :: a -> a -> PrelBase.Bool} ;
1 class {Eqzq a} => Ordzq a where {lt :: a -> a -> PrelBase.Bool} ;
1 f :: __forall [t a] => {PrelNum.Num a} -> {Ordzq a} -> a -> t -> PrelBase.Bool ;
+1 zddmdoubleeq :: __forall [a] => {Eqzq a} -> a -> a -> PrelBase.Bool ;
+1 zddmlt :: __forall [a] => {Ordzq a} -> a -> a -> PrelBase.Bool ;
1 zdfEqzqInt :: {Eqzq PrelBase.Int} ;
1 zdfOrdzqInt :: {Ordzq PrelBase.Int} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed x y;
1 x :: __forall [t t1] => t -> t ;
1 y :: __forall [t t1] => t1 -> t1 ;
tc056.hs:14:
Warning: Duplicate class assertion `Eq' a' in the context:
(Eq' a, Eq' a) => ...
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eqzq{doubleeq} Ordzq{lt} f;
instance {Eqzq PrelBase.Int} = zdfEqzqInt;
instance __forall [a] => {Eqzq a} -> {Eqzq a} -> {Eqzq [a]} = zdfEqzqZMZN;
1 class Eqzq a where {doubleeq :: a -> a -> PrelBase.Bool} ;
1 class {Eqzq a} => Ordzq a where {lt :: a -> a -> PrelBase.Bool} ;
1 f :: __forall [t t1] => {PrelNum.Num t1} -> {Eqzq [t1]} -> [t1] -> t -> PrelBase.Bool ;
+1 zddmdoubleeq :: __forall [a] => {Eqzq a} -> a -> a -> PrelBase.Bool ;
+1 zddmlt :: __forall [a] => {Ordzq a} -> a -> a -> PrelBase.Bool ;
1 zdfEqzqInt :: {Eqzq PrelBase.Int} ;
-1 zdfEqzqZMZN :: __forall [a] => {Eqzq a} -> {Eqzq [a]} ;
+1 zdfEqzqZMZN :: __forall [a] => {Eqzq a} -> {Eqzq a} -> {Eqzq [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eqzq{deq} dand f;
instance {Eqzq PrelBase.Int} = zdfEqzqInt;
instance __forall [a] => {Eqzq a} -> {Eqzq [a]} = zdfEqzqZMZN;
1 class Eqzq a where {deq :: a -> a -> PrelBase.Bool} ;
1 dand :: PrelBase.Bool -> PrelBase.Bool -> PrelBase.Bool ;
1 f :: __forall [a] => {Eqzq a} -> a -> a -> PrelBase.Bool ;
+1 zddmdeq :: __forall [a] => {Eqzq a} -> a -> a -> PrelBase.Bool ;
1 zdfEqzqInt :: {Eqzq PrelBase.Int} ;
1 zdfEqzqZMZN :: __forall [a] => {Eqzq a} -> {Eqzq [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eq2{doubleeq} Ord2{lt} f;
instance {Eq2 PrelBase.Int} = zdfEq2Int;
instance __forall [a] => {Eq2 a} -> {Ord2 a} -> {Eq2 [a]} = zdfEq2ZMZN;
1 class Eq2 a where {doubleeq :: a -> a -> PrelBase.Bool} ;
1 class {Eq2 a} => Ord2 a where {lt :: a -> a -> PrelBase.Bool} ;
1 f :: __forall [t t1] => {PrelNum.Num t1} -> {Eq2 [t1]} -> [t1] -> t -> PrelBase.Bool ;
+1 zddmdoubleeq :: __forall [a] => {Eq2 a} -> a -> a -> PrelBase.Bool ;
+1 zddmlt :: __forall [a] => {Ord2 a} -> a -> a -> PrelBase.Bool ;
1 zdfEq2Int :: {Eq2 PrelBase.Int} ;
1 zdfEq2ZMZN :: __forall [a] => {Eq2 a} -> {Ord2 a} -> {Eq2 [a]} ;
1 zdfOrd2Int :: {Ord2 PrelBase.Int} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eq2{deq foo} f;
instance {Eq2 PrelBase.Int} = zdfEq2Int;
instance __forall [a] => {Eq2 a} -> {Eq2 [a]} = zdfEq2ZMZN;
1 class Eq2 a where {deq :: a -> a -> PrelBase.Bool; foo :: a -> a} ;
1 f :: __forall [t] => {PrelNum.Num t} -> {Eq2 [t]} -> [t] -> PrelBase.Bool ;
+1 zddmdeq :: __forall [a] => {Eq2 a} -> a -> a -> PrelBase.Bool ;
+1 zddmfoo :: __forall [a] => {Eq2 a} -> a -> a ;
1 zdfEq2Int :: {Eq2 PrelBase.Int} ;
1 zdfEq2ZMZN :: __forall [a] => {Eq2 a} -> {Eq2 [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eq2{deq};
instance {Eq2 PrelBase.Int} = zdfEq2Int;
instance __forall [a] => {Eq2 a} -> {Eq2 [a]} = zdfEq2ZMZN;
1 class Eq2 a where {deq :: a -> a -> PrelBase.Bool} ;
+1 zddmdeq :: __forall [a] => {Eq2 a} -> a -> a -> PrelBase.Bool ;
1 zdfEq2Int :: {Eq2 PrelBase.Int} ;
1 zdfEq2ZMZN :: __forall [a] => {Eq2 a} -> {Eq2 [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eq1{deq};
instance {Eq1 PrelBase.Int} = zdfEq1Int;
instance __forall [a] => {Eq1 a} -> {Eq1 [a]} = zdfEq1ZMZN;
1 class Eq1 a where {deq :: a -> a -> PrelBase.Bool} ;
+1 zddmdeq :: __forall [a] => {Eq1 a} -> a -> a -> PrelBase.Bool ;
1 zdfEq1Int :: {Eq1 PrelBase.Int} ;
1 zdfEq1ZMZN :: __forall [a] => {Eq1 a} -> {Eq1 [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Eq1{deq} f;
instance {Eq1 PrelBase.Int} = zdfEq1Int;
instance __forall [a] => {Eq1 a} -> {Eq1 [a]} = zdfEq1ZMZN;
1 class Eq1 a where {deq :: a -> a -> PrelBase.Bool} ;
1 f :: __forall [t] => {Eq1 [t]} -> [t] -> [t] -> PrelBase.Bool ;
+1 zddmdeq :: __forall [a] => {Eq1 a} -> a -> a -> PrelBase.Bool ;
1 zdfEq1Int :: {Eq1 PrelBase.Int} ;
1 zdfEq1ZMZN :: __forall [a] => {Eq1 a} -> {Eq1 [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Reps{f} X{Tag} g;
instance {Reps PrelBase.Bool} = zdfRepsBool;
instance __forall [q] => {Reps (X q)} = zdfRepsX;
1 class Reps r where {f :: r -> r -> r} ;
1 data X a = Tag a ;
1 g :: __forall [r] => {Reps r} -> r -> r ;
+1 zddmf :: __forall [r] => {Reps r} -> r -> r -> r ;
1 zdfRepsBool :: {Reps PrelBase.Bool} ;
1 zdfRepsX :: __forall [q] => {Reps (X q)} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Boolean{FF TT} idb;
1 data Boolean = FF | TT ;
1 idb :: Boolean -> Boolean ;
-ghc: module version changed to 1; reason: no old .hi file
-__export ShouldSucceed Cycle Digraph{MkDigraph} Edge FlattenedDependencyInfo MaybeErr{Succeeded Failed} dfs isCyclic isRecursiveCycle lookupVertex mkDigraph mkEdges mkVertices stronglyConnComp topSort;
-1 data Digraph vertex = MkDigraph [vertex] ;
-1 data MaybeErr a b = Succeeded a | Failed b ;
-1 dfs :: __forall [a] => {PrelBase.Eq a} -> (a -> [a]) -> ([a], [a]) -> [a] -> ([a], [a]) ;
-1 isCyclic :: __forall [vertex] => {PrelBase.Eq vertex} -> [Edge vertex] -> [vertex] -> PrelBase.Bool ;
-1 isRecursiveCycle :: __forall [vertex] => {PrelBase.Eq vertex} -> Cycle vertex -> [Edge vertex] -> PrelBase.Bool ;
-1 lookupVertex :: __forall [vertex name code] => {PrelBase.Eq vertex} -> {PrelBase.Ord name} -> FlattenedDependencyInfo vertex name code -> vertex -> code ;
-1 mkDigraph :: __forall [vertex] => [vertex] -> Digraph vertex ;
-1 mkEdges :: __forall [vertex name code] => {PrelBase.Eq vertex} -> {PrelBase.Ord name} -> [vertex] -> FlattenedDependencyInfo vertex name code -> [Edge vertex] ;
-1 mkVertices :: __forall [vertex name code] => FlattenedDependencyInfo vertex name code -> [vertex] ;
-1 stronglyConnComp :: __forall [vertex] => {PrelBase.Eq vertex} -> [Edge vertex] -> [vertex] -> [[vertex]] ;
-1 topSort :: __forall [vertex] => {PrelBase.Eq vertex} -> [Edge vertex] -> [vertex] -> MaybeErr [vertex] [[vertex]] ;
-1 type Cycle vertex = [vertex] ;
-1 type Edge vertex = (vertex, vertex) ;
-1 type FlattenedDependencyInfo vertex name code = [(vertex, Set.Set name, Set.Set name, code)] ;
+
+Need to fix up -syslib flag in makefile
+
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Pair{MkPair} f;
1 data Pair a b = MkPair a b ;
1 f :: __forall [a b] => [Pair a b] -> [b] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f;
1 f :: __forall [t] => [t] -> [t] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed B{X Y} T{D C};
instance __forall [b] => {PrelBase.Eq b} -> {PrelBase.Eq (B b)} = zdfEqB;
instance __forall [a] => {PrelBase.Eq a} -> {PrelBase.Eq (T a)} = zdfEqT;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed x y ys;
1 x :: PrelBase.Char ;
1 y :: PrelBase.Char ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Boolean{FF TT} idb;
1 data Boolean = FF | TT ;
1 idb :: Boolean -> Boolean ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f;
1 f :: __forall [t] => [t] -> [t] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed B{X Y} T{D C};
instance __forall [b] => {PrelBase.Eq b} -> {PrelBase.Eq (B b)} = zdfEqB;
instance __forall [a] => {PrelBase.Eq a} -> {PrelBase.Eq (T a)} = zdfEqT;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed x xs;
1 x :: [[PrelBase.Bool]] ;
1 xs :: [PrelBase.Bool] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed EQ{zezeze} NUM{ONE TWO} ORD;
1 class {ORD a, PrelShow.Show a} => EQ a where {zezeze :: a -> a -> PrelBase.Bool} ;
1 class {PrelNum.Num a} => ORD a ;
1 data NUM = ONE | TWO ;
+1 zddmzezeze :: __forall [a] => {EQ a} -> a -> a -> PrelBase.Bool ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldFail Bar{MkBar};
instance __forall [a] => {PrelBase.Eq a} -> {PrelBase.Eq (Bar a)} = zdfEqBar;
instance __forall [a] => {PrelBase.Ord a} -> {PrelBase.Ord (Bar a)} = zdfOrdBar;
1 data Bar a = MkBar PrelBase.Int a ;
1 zdfEqBar :: __forall [a] => {PrelBase.Eq a} -> {PrelBase.Eq (Bar a)} ;
-1 zdfOrdBar :: __forall [a] => {PrelBase.Ord a} -> {PrelBase.Eq (Bar a)} -> {PrelBase.Ord (Bar a)} ;
+1 zdfOrdBar :: __forall [a] => {PrelBase.Ord a} -> {PrelBase.Ord (Bar a)} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Foo{op1 op2};
instance {Foo PrelBase.Int} = zdfFooInt;
instance __forall [a] => {Foo a} -> {Foo [a]} = zdfFooZMZN;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Parse{parseFile parseLine parseType parse forced} charToInt lineszq seperatedBy spanzq strToInt whiteSpace;
instance {Parse PrelBase.Char} = zdfParseChar;
instance {Parse PrelBase.Int} = zdfParseInt;
1 zddmparse :: __forall [a] => {Parse a} -> PrelBase.String -> (a, PrelBase.String) ;
1 zddmparseFile :: __forall [a] => {Parse a} -> PrelBase.String -> [a] ;
1 zddmparseLine :: __forall [a] => {Parse a} -> PrelBase.String -> a ;
+1 zddmparseType :: __forall [a] => {Parse a} -> PrelBase.String -> (a, PrelBase.String) ;
1 zdfParseChar :: {Parse PrelBase.Char} ;
1 zdfParseInt :: {Parse PrelBase.Int} ;
1 zdfParseZMZN :: __forall [a] => {Parse a} -> {Parse [a]} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f f2 f3;
1 f :: __forall [a] => {PrelBase.Ord a} -> {PrelNum.Num a} -> a -> (a, PrelBase.Bool, [PrelBase.Bool], [PrelBase.Char]) ;
1 f2 :: __forall [a] => {PrelBase.Ord a} -> {PrelNum.Num a} -> a -> (a, PrelBase.Bool, [PrelBase.Bool], [PrelBase.Char]) ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Normal{normal} f;
instance __forall [a b] => {Normal (a -> b)} = zdfNormalZLzmzgZR;
1 class Normal a where {normal :: a -> PrelBase.Bool} ;
1 f :: __forall [t] => t -> PrelBase.Bool ;
+1 zddmnormal :: __forall [a] => {Normal a} -> a -> PrelBase.Bool ;
1 zdfNormalZLzmzgZR :: __forall [a b] => {Normal (a -> b)} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed f g h;
1 f :: __forall [b] => PrelBase.Int -> b -> PrelBase.Int ;
1 g :: __forall [a b] => {PrelNum.Num a} -> PrelBase.Bool -> a -> b -> a ;
-ghc: module version changed to 1; reason: no old .hi file
-__export IOExts IOArray IORef boundsIOArray freeHaskellFunctionPtr freezzeIOArray mkWeakIORef newIOArray newIORef performGC readIOArray readIORef thawIOArray trace unsafeFreezzeIOArray unsafePtrEq unsafeThawIOArray writeIOArray writeIORef;
-__export PrelGHC Addrzh All Arrayzh ByteArrayzh CCallable CReturnable Charzh Doublezh Floatzh ForeignObjzh Int64zh Intzh MVarzh MutVarzh MutableArrayzh MutableByteArrayzh RealWorld StableNamezh StablePtrzh Statezh ThreadIdzh Weakzh Word64zh Wordzh ZLzmzgZR acosDoublezh acosFloatzh addIntCzh addr2Integerzh addr2Intzh andzh asinDoublezh asinFloatzh assert atanDoublezh atanFloatzh catchzh chrzh cmpIntegerIntzh cmpIntegerzh cosDoublezh cosFloatzh coshDoublezh coshFloatzh dataToTagzh deRefStablePtrzh deRefWeakzh decodeDoublezh decodeFloatzh delayzh divideFloatzh double2Floatzh double2Intzh eqAddrzh eqCharzh eqFloatzh eqStableNamezh eqStablePtrzh eqWordzh expDoublezh expFloatzh finalizzeWeakzh float2Doublezh float2Intzh forkzh gcdIntegerzh geAddrzh geCharzh geFloatzh geWordzh getTagzh gtAddrzh gtCharzh gtFloatzh gtWordzh iShiftLzh iShiftRAzh iShiftRLzh indexAddrArrayzh indexAddrOffAddrzh indexAddrOffForeignObjzh indexArrayzh indexCharArrayzh indexCharOffAddrzh indexCharOffForeignObjzh indexDoubleArrayzh indexDoubleOffAddrzh indexDoubleOffForeignObjzh indexFloatArrayzh indexFloatOffAddrzh indexFloatOffForeignObjzh indexInt64Arrayzh indexInt64OffAddrzh indexInt64OffForeignObjzh indexIntArrayzh indexIntOffAddrzh indexIntOffForeignObjzh indexStablePtrArrayzh indexStablePtrOffAddrzh indexStablePtrOffForeignObjzh indexWord64Arrayzh indexWord64OffAddrzh indexWord64OffForeignObjzh indexWordArrayzh indexWordOffAddrzh indexWordOffForeignObjzh int2Addrzh int2Doublezh int2Floatzh int2Integerzh int2Wordzh int64ToIntegerzh integer2Intzh integer2Wordzh integerToInt64zh integerToWord64zh isEmptyMVarzh killThreadzh leAddrzh leCharzh leFloatzh leWordzh logDoublezh logFloatzh ltAddrzh ltCharzh ltFloatzh ltWordzh makeForeignObjzh makeStableNamezh makeStablePtrzh minusFloatzh minusIntegerzh mkWeakzh mulIntCzh myThreadIdzh neAddrzh neCharzh neFloatzh neWordzh negateDoublezh negateFloatzh negateIntzh newAddrArrayzh newArrayzh newCharArrayzh newDoubleArrayzh newFloatArrayzh newIntArrayzh newMVarzh newMutVarzh newStablePtrArrayzh newWordArrayzh notzh ordzh orzh parAtAbszh parAtForNowzh parAtRelzh parAtzh parGlobalzh parLocalzh parzh plusFloatzh plusIntegerzh powerFloatzh putMVarzh quotIntzh quotRemIntegerzh quotWordzh raisezh readAddrArrayzh readArrayzh readCharArrayzh readDoubleArrayzh readFloatArrayzh readInt64Arrayzh readIntArrayzh readMutVarzh readStablePtrArrayzh readWord64Arrayzh readWordArrayzh realWorldzh reallyUnsafePtrEqualityzh remIntzh remWordzh sameMVarzh sameMutVarzh sameMutableArrayzh sameMutableByteArrayzh seqzh shiftLzh shiftRLzh sinDoublezh sinFloatzh sinhDoublezh sinhFloatzh sizzeofByteArrayzh sizzeofMutableByteArrayzh sqrtDoublezh sqrtFloatzh stableNameToIntzh subIntCzh tagToEnumzh takeMVarzh tanDoublezh tanFloatzh tanhDoublezh tanhFloatzh timesFloatzh timesIntegerzh unsafeCoercezh unsafeFreezzeArrayzh unsafeFreezzeByteArrayzh unsafeThawArrayzh unsafeThawByteArrayzh waitReadzh waitWritezh word2Integerzh word2Intzh word64ToIntegerzh writeAddrArrayzh writeAddrOffAddrzh writeArrayzh writeCharArrayzh writeCharOffAddrzh writeDoubleArrayzh writeDoubleOffAddrzh writeFloatArrayzh writeFloatOffAddrzh writeForeignObjOffAddrzh writeForeignObjzh writeInt64Arrayzh writeInt64OffAddrzh writeIntArrayzh writeIntOffAddrzh writeMutVarzh writeStablePtrArrayzh writeStablePtrOffAddrzh writeWord64Arrayzh writeWord64OffAddrzh writeWordArrayzh writeWordOffAddrzh xorzh yieldzh zezezh zezezhzh zgzezh zgzezhzh zgzh zgzhzh zlzezh zlzezhzh zlzh zlzhzh zmzh zmzhzh zpzh zpzhzh zszezh zszezhzh zszh zszhzh ztzh ztzhzh ztztzhzh;
-__export PrelHandle IOModeEx{BinaryMode TextMode} hConnectTo hGetEcho hIsTerminalDevice hSetEcho openFileEx;
-__export PrelIOBase fixIO unsafeInterleaveIO unsafePerformIO;
+__export IOExts IOArray IORef boundsIOArray fixIO freeHaskellFunctionPtr freezzeIOArray hSetBinaryMode hTell mkWeakIORef newIOArray newIORef performGC readIOArray readIORef thawIOArray trace unsafeFreezzeIOArray unsafePtrEq unsafeThawIOArray updateIORef withHandleFor withStderr withStdin withStdout writeIOArray writeIORef;
+__export PrelGHC Addrzh All Arrayzh ByteArrayzh CCallable CReturnable Charzh Doublezh Floatzh ForeignObjzh Int64zh Intzh MVarzh MutVarzh MutableArrayzh MutableByteArrayzh RealWorld StableNamezh StablePtrzh Statezh ThreadIdzh Weakzh Word64zh Wordzh ZLzmzgZR acosDoublezh acosFloatzh addIntCzh addr2Integerzh addr2Intzh andzh asinDoublezh asinFloatzh assert atanDoublezh atanFloatzh blockAsyncExceptionszh catchzh chrzh cmpIntegerIntzh cmpIntegerzh cosDoublezh cosFloatzh coshDoublezh coshFloatzh dataToTagzh deRefStablePtrzh deRefWeakzh decodeDoublezh decodeFloatzh delayzh divExactIntegerzh divModIntegerzh divideFloatzh double2Floatzh double2Intzh eqAddrzh eqCharzh eqFloatzh eqStableNamezh eqStablePtrzh eqWordzh expDoublezh expFloatzh finalizzeWeakzh float2Doublezh float2Intzh forkzh gcdIntegerIntzh gcdIntegerzh gcdIntzh geAddrzh geCharzh geFloatzh geWordzh getTagzh gtAddrzh gtCharzh gtFloatzh gtWordzh iShiftLzh iShiftRAzh iShiftRLzh indexAddrArrayzh indexAddrOffAddrzh indexAddrOffForeignObjzh indexArrayzh indexCharArrayzh indexCharOffAddrzh indexCharOffForeignObjzh indexDoubleArrayzh indexDoubleOffAddrzh indexDoubleOffForeignObjzh indexFloatArrayzh indexFloatOffAddrzh indexFloatOffForeignObjzh indexInt64Arrayzh indexInt64OffAddrzh indexInt64OffForeignObjzh indexIntArrayzh indexIntOffAddrzh indexIntOffForeignObjzh indexStablePtrArrayzh indexStablePtrOffAddrzh indexStablePtrOffForeignObjzh indexWord64Arrayzh indexWord64OffAddrzh indexWord64OffForeignObjzh indexWordArrayzh indexWordOffAddrzh indexWordOffForeignObjzh int2Addrzh int2Doublezh int2Floatzh int2Integerzh int2Wordzh int64ToIntegerzh integer2Intzh integer2Wordzh integerToInt64zh integerToWord64zh isEmptyMVarzh killThreadzh leAddrzh leCharzh leFloatzh leWordzh logDoublezh logFloatzh ltAddrzh ltCharzh ltFloatzh ltWordzh makeForeignObjzh makeStableNamezh makeStablePtrzh minusFloatzh minusIntegerzh mkWeakzh mulIntCzh myThreadIdzh neAddrzh neCharzh neFloatzh neWordzh negateDoublezh negateFloatzh negateIntzh newAddrArrayzh newArrayzh newCharArrayzh newDoubleArrayzh newFloatArrayzh newIntArrayzh newMVarzh newMutVarzh newStablePtrArrayzh newWordArrayzh notzh ordzh orzh parAtAbszh parAtForNowzh parAtRelzh parAtzh parGlobalzh parLocalzh parzh plusFloatzh plusIntegerzh powerFloatzh putMVarzh quotIntegerzh quotIntzh quotRemIntegerzh quotWordzh raisezh readAddrArrayzh readArrayzh readCharArrayzh readDoubleArrayzh readFloatArrayzh readInt64Arrayzh readIntArrayzh readMutVarzh readStablePtrArrayzh readWord64Arrayzh readWordArrayzh realWorldzh reallyUnsafePtrEqualityzh remIntegerzh remIntzh remWordzh sameMVarzh sameMutVarzh sameMutableArrayzh sameMutableByteArrayzh seqzh shiftLzh shiftRLzh sinDoublezh sinFloatzh sinhDoublezh sinhFloatzh sizzeofByteArrayzh sizzeofMutableByteArrayzh sqrtDoublezh sqrtFloatzh stableNameToIntzh subIntCzh tagToEnumzh takeMVarzh tanDoublezh tanFloatzh tanhDoublezh tanhFloatzh timesFloatzh timesIntegerzh unblockAsyncExceptionszh unsafeCoercezh unsafeFreezzeArrayzh unsafeFreezzeByteArrayzh unsafeThawArrayzh unsafeThawByteArrayzh waitReadzh waitWritezh word2Integerzh word2Intzh word64ToIntegerzh writeAddrArrayzh writeAddrOffAddrzh writeArrayzh writeCharArrayzh writeCharOffAddrzh writeDoubleArrayzh writeDoubleOffAddrzh writeFloatArrayzh writeFloatOffAddrzh writeForeignObjOffAddrzh writeForeignObjzh writeInt64Arrayzh writeInt64OffAddrzh writeIntArrayzh writeIntOffAddrzh writeMutVarzh writeStablePtrArrayzh writeStablePtrOffAddrzh writeWord64Arrayzh writeWord64OffAddrzh writeWordArrayzh writeWordOffAddrzh xorzh yieldzh zezezh zezezhzh zgzezh zgzezhzh zgzh zgzhzh zlzezh zlzezhzh zlzh zlzhzh zmzh zmzhzh zpzh zpzhzh zszezh zszezhzh zszh zszhzh ztzh ztzhzh ztztzhzh;
+__export PrelHandle HandlePosition HandlePosn{HandlePosn} IOModeEx{BinaryMode TextMode} hConnectTo hGetEcho hIsTerminalDevice hSetEcho openFileEx;
+__export PrelIOBase unsafeInterleaveIO unsafePerformIO;
1 data FooData = FooData ;
1 type FooType = PrelBase.Int ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Group Ring;
-1 class Group a where {compare :: a -> a -> PrelBase.Ordering; fromInteger :: PrelBase.Integer -> a; zp :: a -> a -> a; zm :: a -> a -> a; zzero = :: a; one = :: a} ;
+1 class Group a where {compare :: a -> a -> PrelBase.Ordering; fromInteger :: PrelNum.Integer -> a; zp :: a -> a -> a; zm :: a -> a -> a; zzero = :: a; one = :: a} ;
1 class {Group a} => Ring a where {zt = :: a -> a -> a} ;
+1 zddmcompare :: __forall [a] => {Group a} -> a -> a -> PrelBase.Ordering ;
+1 zddmfromInteger :: __forall [a] => {Group a} -> PrelNum.Integer -> a ;
1 zddmone :: __forall [a] => {Group a} -> a ;
+1 zddmzm :: __forall [a] => {Group a} -> a -> a -> a ;
+1 zddmzp :: __forall [a] => {Group a} -> a -> a -> a ;
1 zddmzt :: __forall [a] => {Ring a} -> a -> a -> a ;
1 zddmzzero :: __forall [a] => {Group a} -> a ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed PriorityQueue{empty single insert meld splitMin} SeqView{Null Cons} check insertMany out pqSort toOrderedList;
1 check :: __forall [q :: (* -> *)] => {PriorityQueue q} -> (__forall [a] => {PrelBase.Ord a} -> q a) -> PrelIOBase.IO PrelBase.Z0T ;
1 class PriorityQueue q :: (* -> *) where {empty :: __forall [a] => {PrelBase.Ord a} -> q a; single :: __forall [a] => {PrelBase.Ord a} -> a -> q a; insert = :: __forall [a] => {PrelBase.Ord a} -> a -> q a -> q a; meld :: __forall [a] => {PrelBase.Ord a} -> q a -> q a -> q a; splitMin :: __forall [a] => {PrelBase.Ord a} -> q a -> SeqView q a} ;
1 out :: __forall [a] => {PrelNum.Num a} -> [a] -> PrelIOBase.IO PrelBase.Z0T ;
1 pqSort :: __forall [a t :: (* -> *)] => {PriorityQueue t} -> {PrelBase.Ord a} -> t a -> [a] -> [a] ;
1 toOrderedList :: __forall [t :: (* -> *) a] => {PrelBase.Ord a} -> {PriorityQueue t} -> t a -> [a] ;
+1 zddmempty :: __forall [q :: (* -> *)] => {PriorityQueue q} -> (__forall [a] => {PrelBase.Ord a} -> q a) ;
1 zddminsert :: __forall [q :: (* -> *)] => {PriorityQueue q} -> (__forall [a] => {PrelBase.Ord a} -> a -> q a -> q a) ;
+1 zddmmeld :: __forall [q :: (* -> *)] => {PriorityQueue q} -> (__forall [a] => {PrelBase.Ord a} -> q a -> q a -> q a) ;
+1 zddmsingle :: __forall [q :: (* -> *)] => {PriorityQueue q} -> (__forall [a] => {PrelBase.Ord a} -> a -> q a) ;
+1 zddmsplitMin :: __forall [q :: (* -> *)] => {PriorityQueue q} -> (__forall [a] => {PrelBase.Ord a} -> q a -> SeqView q a) ;
-ghc: module version changed to 1; reason: no old .hi file
-instance __forall [a b] => {PrelBase.Eq b} -> {PrelBase.Eq (a -> b)} = zdfEqZLzmzgZR;
-instance __forall [a b] => {PrelNum.Num b} -> {PrelNum.Num (a -> b)} = zdfNumZLzmzgZR;
-instance __forall [a b] => {PrelShow.Show (a -> b)} = zdfShowZLzmzgZR;
-1 zdfEqZLzmzgZR :: __forall [a b] => {PrelBase.Eq b} -> {PrelBase.Eq (a -> b)} ;
-1 zdfNumZLzmzgZR :: __forall [a b] => {PrelNum.Num b} -> {PrelBase.Eq (a -> b)} -> {PrelShow.Show (a -> b)} -> {PrelNum.Num (a -> b)} ;
-1 zdfShowZLzmzgZR :: __forall [a b] => {PrelShow.Show (a -> b)} ;
+
+Need to fix up -syslib flag in makefile
+
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed absAnd absIf bottom f f_rec f_rec0 f_rec1 f_rec2 fac fac_rec fac_rec0 fac_rec1 fac_rec2 fac_rec3 fac_rec4 g g_rec g_rec0 g_rec1 g_rec2 g_rec3 g_rec4 g_rec5 g_rec6 g_rec7 g_rec8 head one s_1_0 s_2_0 s_2_1 s_3_0 s_3_1 s_3_2;
1 absAnd :: __forall [t] => t -> t -> t ;
1 absIf :: __forall [t t1 t2] => t -> t1 -> t2 -> t ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed a b;
1 a :: __forall [f] => {PrelBase.Ord f} -> f ;
1 b :: __forall [f] => {PrelBase.Ord f} -> f ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed init_last merge sort;
1 init_last :: __forall [a] => [a] -> PrelBase.Int -> ([a], [a]) ;
1 merge :: __forall [a] => {PrelBase.Ord a} -> [a] -> [a] -> [a] ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Empty{Empty} e0 e1 e2 q;
1 data Empty q :: (* -> *) = Empty (__forall [a] => {PrelBase.Ord a} -> q a) ;
1 e0 :: Empty PrelBase.ZMZN ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed St State{State} TS{TS vs} bindState foo unState unitState;
instance {PrelBase.Eq TS} = zdfEqTS;
instance __forall [c] => {PrelBase.Eq c} -> {PrelBase.Monad (State c)} = zdfMonadState;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed foo;
-1 foo :: __forall [t] => t -> (PrelBase.Integer, PrelBase.Integer) ;
+1 foo :: __forall [t] => t -> (PrelNum.Integer, PrelNum.Integer) ;
NOTE: Simplifier still going after 4 iterations; bailing out.
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed HappyAbsSyn{HappyTerminal HappyErrorToken HappyAbsSyn1 HappyAbsSyn2 HappyAbsSyn3} HappyState{HappyState} Token{TokenInt TokenVar TokenEq} action_0 action_1 action_2 action_3 action_4 action_5 action_6 happyAccept happyError happyFail happyGoto happyMonadReduce happyNewToken happyParse happyReduce happyReduce_1 happyReduce_2 happyReduce_3 happyReturn happyShift happySpecReduce_0 happySpecReduce_1 happySpecReduce_2 happySpecReduce_3 happyThen main myparser notHappyAtAll;
instance {PrelShow.Show Token} = zdfShowToken;
-1 action_0 :: __forall [t t1] => {PrelNum.Num t} -> t -> PrelBase.Int -> Token -> HappyState Token ([HappyAbsSyn (t1 -> PrelBase.Double) [([PrelBase.Char], t1 -> PrelBase.Int)] (t1 -> PrelBase.Int)] -> [Token] -> t1 -> PrelBase.Double) -> [HappyState Token ([HappyAbsSyn (t1 -> PrelBase.Double) [([PrelBase.Char], t1 -> PrelBase.Int)] (t1 -> PrelBase.Int)] -> [Token] -> t1 -> PrelBase.Double)] -> [HappyAbsSyn (t1 -> PrelBase.Double) [([PrelBase.Char], t1 -> PrelBase.Int)] (t1 -> PrelBase.Int)] -> [Token] -> t1 -> PrelBase.Double ;
+1 action_0 :: __forall [t t1] => {PrelNum.Num t} -> t -> PrelBase.Int -> Token -> HappyState Token ([HappyAbsSyn (t1 -> PrelFloat.Double) [([PrelBase.Char], t1 -> PrelBase.Int)] (t1 -> PrelBase.Int)] -> [Token] -> t1 -> PrelFloat.Double) -> [HappyState Token ([HappyAbsSyn (t1 -> PrelFloat.Double) [([PrelBase.Char], t1 -> PrelBase.Int)] (t1 -> PrelBase.Int)] -> [Token] -> t1 -> PrelFloat.Double)] -> [HappyAbsSyn (t1 -> PrelFloat.Double) [([PrelBase.Char], t1 -> PrelBase.Int)] (t1 -> PrelBase.Int)] -> [Token] -> t1 -> PrelFloat.Double ;
1 action_1 :: __forall [t t1 t2 t3 b] => {PrelNum.Num t} -> t -> PrelBase.Int -> b -> HappyState b ([HappyAbsSyn t1 t2 t3] -> [Token] -> t1) -> [HappyState b ([HappyAbsSyn t1 t2 t3] -> [Token] -> t1)] -> [HappyAbsSyn t1 t2 t3] -> [Token] -> t1 ;
-1 action_2 :: __forall [t t1 b t2 t3 t4 t5 t31] => t -> PrelBase.Int -> b -> t2 -> [HappyState b ([HappyAbsSyn (t3 -> PrelBase.Double) [(t4, t3 -> t5)] t31] -> t1)] -> [HappyAbsSyn (t3 -> PrelBase.Double) [(t4, t3 -> t5)] t31] -> t1 ;
+1 action_2 :: __forall [t t1 b t2 t3 t4 t5 t31] => t -> PrelBase.Int -> b -> t2 -> [HappyState b ([HappyAbsSyn (t3 -> PrelFloat.Double) [(t4, t3 -> t5)] t31] -> t1)] -> [HappyAbsSyn (t3 -> PrelFloat.Double) [(t4, t3 -> t5)] t31] -> t1 ;
1 action_3 :: __forall [t t1 t11 a] => {PrelNum.Num t} -> t -> PrelBase.Int -> Token -> HappyState Token ([HappyAbsSyn t1 [([PrelBase.Char], t11 -> PrelBase.Int)] (t11 -> PrelBase.Int)] -> [Token] -> a) -> [HappyState Token ([HappyAbsSyn t1 [([PrelBase.Char], t11 -> PrelBase.Int)] (t11 -> PrelBase.Int)] -> [Token] -> a)] -> [HappyAbsSyn t1 [([PrelBase.Char], t11 -> PrelBase.Int)] (t11 -> PrelBase.Int)] -> [Token] -> a ;
1 action_4 :: __forall [t t1 t11 a] => {PrelNum.Num t} -> t -> PrelBase.Int -> Token -> HappyState Token ([HappyAbsSyn t1 [([PrelBase.Char], t11 -> PrelBase.Int)] (t11 -> PrelBase.Int)] -> [Token] -> a) -> [HappyState Token ([HappyAbsSyn t1 [([PrelBase.Char], t11 -> PrelBase.Int)] (t11 -> PrelBase.Int)] -> [Token] -> a)] -> [HappyAbsSyn t1 [([PrelBase.Char], t11 -> PrelBase.Int)] (t11 -> PrelBase.Int)] -> [Token] -> a ;
1 action_5 :: __forall [t t1 b t2 t11 t3] => t -> PrelBase.Int -> b -> t2 -> [HappyState b ([HappyAbsSyn t11 [([PrelBase.Char], t3)] t3] -> t1)] -> [HappyAbsSyn t11 [([PrelBase.Char], t3)] t3] -> t1 ;
1 happyGoto :: __forall [t b c] => (PrelBase.Int -> PrelBase.Int -> b -> HappyState b c -> [HappyState b c] -> c) -> PrelBase.Int -> b -> t -> [HappyState b c] -> c ;
1 happyMonadReduce :: __forall [a b b1 t] => PrelBase.Int -> PrelBase.Int -> (t -> b1) -> ([b1] -> t) -> PrelBase.Int -> b -> HappyState b ([b1] -> [Token] -> a) -> [HappyState b ([b1] -> [Token] -> a)] -> [b1] -> [Token] -> a ;
1 happyNewToken :: __forall [t t1] => (PrelBase.Int -> PrelBase.Int -> Token -> HappyState Token (t -> [Token] -> t1) -> [HappyState Token (t -> [Token] -> t1)] -> t -> [Token] -> t1) -> [HappyState Token (t -> [Token] -> t1)] -> t -> [Token] -> t1 ;
-1 happyParse :: __forall [t] => [Token] -> t -> PrelBase.Double ;
+1 happyParse :: __forall [t] => [Token] -> t -> PrelFloat.Double ;
1 happyReduce :: __forall [t b t1] => PrelBase.Int -> PrelBase.Int -> (t1 -> t1) -> PrelBase.Int -> b -> HappyState b (t1 -> t) -> [HappyState b (t1 -> t)] -> t1 -> t ;
-1 happyReduce_1 :: __forall [t b t1 t2 t3 t4 t31] => PrelBase.Int -> b -> t1 -> [HappyState b ([HappyAbsSyn (t3 -> PrelBase.Double) [(t2, t3 -> t4)] t31] -> t)] -> [HappyAbsSyn (t3 -> PrelBase.Double) [(t2, t3 -> t4)] t31] -> t ;
+1 happyReduce_1 :: __forall [t b t1 t2 t3 t4 t31] => PrelBase.Int -> b -> t1 -> [HappyState b ([HappyAbsSyn (t3 -> PrelFloat.Double) [(t2, t3 -> t4)] t31] -> t)] -> [HappyAbsSyn (t3 -> PrelFloat.Double) [(t2, t3 -> t4)] t31] -> t ;
1 happyReduce_2 :: __forall [t b t1 t11 t3] => PrelBase.Int -> b -> t1 -> [HappyState b ([HappyAbsSyn t11 [([PrelBase.Char], t3)] t3] -> t)] -> [HappyAbsSyn t11 [([PrelBase.Char], t3)] t3] -> t ;
1 happyReduce_3 :: __forall [t b t1 t11 t2 t21] => PrelBase.Int -> b -> t1 -> [HappyState b ([HappyAbsSyn t11 t2 (t21 -> PrelBase.Int)] -> t)] -> [HappyAbsSyn t11 t2 (t21 -> PrelBase.Int)] -> t ;
1 happyReturn :: __forall [t t1] => t -> t1 -> t ;
1 happySpecReduce_3 :: __forall [t b t1 t2] => PrelBase.Int -> (t1 -> t1 -> t1 -> t1) -> PrelBase.Int -> b -> t -> [HappyState b ([t1] -> t2)] -> [t1] -> t2 ;
1 happyThen :: __forall [t t1] => t -> (t -> t1) -> t1 ;
1 main :: PrelIOBase.IO PrelBase.Z0T ;
-1 myparser :: __forall [t] => [Token] -> t -> PrelBase.Double ;
+1 myparser :: __forall [t] => [Token] -> t -> PrelFloat.Double ;
1 notHappyAtAll :: __forall [t] => t ;
1 zdfShowToken :: {PrelShow.Show Token} ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed main x;
1 main :: PrelIOBase.IO PrelBase.Z0T ;
-1 x :: PrelBase.Double ;
+1 x :: PrelFloat.Double ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Monad2{MkMonad2} halfListMonad;
1 data Monad2 m :: (* -> *) = MkMonad2 (__forall [a] => a -> m a) (__forall [b a] => m a -> (a -> m b) -> m b) ;
1 halfListMonad :: (__forall [b a] => [a] -> (a -> [b]) -> [b]) -> Monad2 PrelBase.ZMZN ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldSucceed Cp cpPairs m mp;
1 cpPairs :: __forall [j a] => Cp [j] -> (a, [j]) -> (a, [j]) -> PrelBase.Ordering ;
1 m :: __forall [a] => {PrelBase.Eq a} -> Cp a -> [a] -> a ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldCompile f g;
1 f :: __forall [a b] => {PrelBase.Eq a} -> (a, b) ;
1 g :: __forall [a b] => {PrelBase.Eq a} -> (a, b) ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldCompile C D{DD} D_;
1 newtype D a = DD (D_ a) ;
1 type C a = D a -> a ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldCompile A f x;
1 f :: __forall [a] => (A a -> a -> PrelBase.Z0T) -> PrelBase.Z0T ;
1 type A a = PrelBase.Z0T ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldCompile p;
1 p :: __forall [a] => a -> a ;
-ghc: module version changed to 1; reason: no old .hi file
__export ShouldCompile C D{DD} D_;
1 newtype D a = DD (D_ a) ;
1 type C a = D a -> a ;
-ghc: module version changed to 1; reason: no old .hi file
__export Main main;
1 main :: __forall [a] => PrelIOBase.IO (a -> a) ;
tcfail006.hs:4:
No instance for `Num Bool'
- arising from the literal `1' at tcfail006.hs:4
+ arising from the literal `1' at tcfail006.hs:4
+ In the right-hand side of a case alternative: (True, 1)
Compilation had errors
tcfail007.hs:3:
No instance for `Num Bool'
- arising from use of `+' at tcfail007.hs:3
+ arising from use of `+' at tcfail007.hs:3
+ In the right-hand side of an equation for `n': x + 1
Compilation had errors
tcfail008.hs:3:
- Ambiguous type variable(s) `t'
- in the constraint `Num [t]'
- arising from the literal `2' at tcfail008.hs:3
+ Ambiguous type variable(s) `t' in the constraint `Num [t]'
+ arising from the literal `2' at tcfail008.hs:3
+ In the second argument of `:', namely `2'
+ In the right-hand side of a pattern binding: 1 : 2
tcfail008.hs:3:
- Ambiguous type variable(s) `t'
- in the constraint `Num t'
- arising from the literal `1' at tcfail008.hs:3
+ Ambiguous type variable(s) `t' in the constraint `Num t'
+ arising from the literal `1' at tcfail008.hs:3
+ In the first argument of `:', namely `1'
+ In the right-hand side of a pattern binding: 1 : 2
Compilation had errors
tcfail010.hs:3:
- Ambiguous type variable(s) `t'
- in the constraint `Num [t]'
- arising from use of `+' at tcfail010.hs:3
+ Ambiguous type variable(s) `t' in the constraint `Num [t]'
+ arising from use of `+' at tcfail010.hs:3
+ In the right-hand side of a lambda abstraction: z + 2
Compilation had errors
tcfail015.hs:7:
No instance for `Num Bool'
- arising from the literal `2' at tcfail015.hs:7
+ arising from the literal `2' at tcfail015.hs:7
+ In the right-hand side of an equation for `g': 2
Compilation had errors
tcfail017.hs:10:
- Could not deduce `C [a]'
- (arising from an instance declaration at tcfail017.hs:10)
- from the context: (B a)
+ Could not deduce `C [a]' from the context: (B a)
Probable cause: missing `C [a]' in instance declaration context
or missing instance declaration for `C [a]'
- When checking the superclasses of an instance declaration
+ arising from an instance declaration at tcfail017.hs:10
Compilation had errors
tcfail018.hs:5:
- Ambiguous type variable(s) `t'
- in the constraint `Num [t]'
- arising from the literal `1' at tcfail018.hs:5
+ Ambiguous type variable(s) `t' in the constraint `Num [t]'
+ arising from the literal `1' at tcfail018.hs:5
+ In the right-hand side of a pattern binding: 1
Compilation had errors
tcfail019.hs:18:
- Could not deduce `C [a]'
- (arising from an instance declaration at tcfail019.hs:18)
- from the context: ()
+ Could not deduce `C [a]' from the context: ()
Probable cause: missing `C [a]' in instance declaration context
or missing instance declaration for `C [a]'
- When checking the superclasses of an instance declaration
+ arising from an instance declaration at tcfail019.hs:18
tcfail019.hs:18:
- Could not deduce `B [a]'
- (arising from an instance declaration at tcfail019.hs:18)
- from the context: ()
+ Could not deduce `B [a]' from the context: ()
Probable cause: missing `B [a]' in instance declaration context
or missing instance declaration for `B [a]'
- When checking the superclasses of an instance declaration
+ arising from an instance declaration at tcfail019.hs:18
Compilation had errors
tcfail020.hs:10:
- Could not deduce `A [a]'
- (arising from an instance declaration at tcfail020.hs:10)
- from the context: (A a)
+ Could not deduce `A [a]' from the context: (A a)
Probable cause: missing `A [a]' in instance declaration context
or missing instance declaration for `A [a]'
- When checking the superclasses of an instance declaration
+ arising from an instance declaration at tcfail020.hs:10
Compilation had errors
tcfail029.hs:6:
- No instance for `Ord Foo' arising from use of `>' at tcfail029.hs:6
+ No instance for `Ord Foo'
+ arising from use of `>' at tcfail029.hs:6
+ In the right-hand side of an equation for `f': x > Bar
Compilation had errors
tcfail034.hs:17:
- Could not deduce `Integral a'
- (arising from use of `mod' at tcfail034.hs:17)
- from the context: (Num a, Eq a)
+ Could not deduce `Integral a' from the context: (Num a, Eq a)
Probable cause: missing `Integral a' in type signature for `test'
- When checking the type signature(s) for `test'
+ arising from use of `mod' at tcfail034.hs:17
+ In the first argument of `==', namely `(x `mod` 3)'
+ In the right-hand side of an equation for `test': (x `mod` 3) == 0
Compilation had errors
-tcfail035.hs:6:
- Warning: No explicit method nor default method for `+'
- in an instance declaration for `Num'
-
-tcfail035.hs:6:
- Warning: No explicit method nor default method for `*'
- in an instance declaration for `Num'
-
-tcfail035.hs:6:
- Warning: No explicit method nor default method for `abs'
- in an instance declaration for `Num'
-
-tcfail035.hs:6:
- Warning: No explicit method nor default method for `signum'
- in an instance declaration for `Num'
-
-tcfail035.hs:6:
- Warning: No explicit method nor default method for `fromInteger'
- in an instance declaration for `Num'
-
-tcfail035.hs:7:
- Warning: No explicit method nor default method for `+'
- in an instance declaration for `Num'
-
-tcfail035.hs:7:
- Warning: No explicit method nor default method for `*'
- in an instance declaration for `Num'
-
-tcfail035.hs:7:
- Warning: No explicit method nor default method for `abs'
- in an instance declaration for `Num'
-
-tcfail035.hs:7:
- Warning: No explicit method nor default method for `signum'
- in an instance declaration for `Num'
-
-tcfail035.hs:7:
- Warning: No explicit method nor default method for `fromInteger'
- in an instance declaration for `Num'
-
tcfail035.hs:3:
Duplicate or overlapping instance declarations
for `Num NUM'
-tcfail036.hs:6:
- Warning: No explicit method nor default method for `*'
- in an instance declaration for `Num'
-
-tcfail036.hs:6:
- Warning: No explicit method nor default method for `abs'
- in an instance declaration for `Num'
-
-tcfail036.hs:6:
- Warning: No explicit method nor default method for `signum'
- in an instance declaration for `Num'
-
-tcfail036.hs:6:
- Warning: No explicit method nor default method for `fromInteger'
- in an instance declaration for `Num'
-
-tcfail036.hs:8:
- Warning: No explicit method nor default method for `+'
- in an instance declaration for `Num'
-
-tcfail036.hs:8:
- Warning: No explicit method nor default method for `*'
- in an instance declaration for `Num'
-
-tcfail036.hs:8:
- Warning: No explicit method nor default method for `abs'
- in an instance declaration for `Num'
-
-tcfail036.hs:8:
- Warning: No explicit method nor default method for `signum'
- in an instance declaration for `Num'
-
-tcfail036.hs:8:
- Warning: No explicit method nor default method for `fromInteger'
- in an instance declaration for `Num'
-
tcfail036.hs:3:
Duplicate or overlapping instance declarations
for `Num NUM'
tcfail036.hs:8:
No instance for `Show NUM'
- arising from an instance declaration at tcfail036.hs:8
+ arising from an instance declaration at tcfail036.hs:8
tcfail036.hs:8:
No instance for `Eq NUM'
- arising from an instance declaration at tcfail036.hs:8
+ arising from an instance declaration at tcfail036.hs:8
tcfail036.hs:9:
Class used as a type constructor: Num
tcfail040.hs:19:
- Ambiguous type variable(s) `a'
- in the constraint `ORD a'
- arising from use of `<<' at tcfail040.hs:19
+ Ambiguous type variable(s) `a' in the constraint `ORD a'
+ arising from use of `<<' at tcfail040.hs:19
+ In the first argument of `===', namely `<<'
+ In the right-hand side of a pattern binding: << === <<
Compilation had errors
tcfail042.hs:15:
- Could not deduce `Num a'
- (arising from an instance declaration at tcfail042.hs:15)
- from the context: (Eq a, Show a)
+ Could not deduce `Num a' from the context: (Eq a, Show a)
Probable cause: missing `Num a' in instance declaration context
- When checking the superclasses of an instance declaration
+ arising from an instance declaration at tcfail042.hs:15
Compilation had errors
tcfail043.hs:38:
- Ambiguous type variable(s) `a'
- in the constraint `Ord_ a'
- arising from use of `gt' at tcfail043.hs:38
+ Ambiguous type variable(s) `a' in the constraint `Ord_ a'
+ arising from use of `gt' at tcfail043.hs:38
+ In the predicate expression: gt (hd bs) a
+ In the right-hand side of a lambda abstraction:
+ if gt (hd bs) a then
+ False
+ else
+ if eq a (hd bs) then True else search a (tl bs)
Compilation had errors
-tcfail044.hs:8:
- Warning: No explicit method nor default method for `abs'
- in an instance declaration for `Num'
-
-tcfail044.hs:8:
- Warning: No explicit method nor default method for `signum'
- in an instance declaration for `Num'
-
tcfail044.hs:5:
Illegal instance declaration for `Eq (a -> a)'
(the instance type must be of form (T a b c)
tcfail046.hs:4:
No instance for `Eq (Process a)'
- When deriving classes for `Message'
+ When deriving classes for `Continuation'
Compilation had errors
tcfail067.hs:60:
- Warning: No explicit method nor default method for `abs'
- in an instance declaration for `Num'
-
-tcfail067.hs:60:
- Warning: No explicit method nor default method for `signum'
- in an instance declaration for `Num'
-
-tcfail067.hs:60:
- Could not deduce `Show (SubRange a)'
- (arising from an instance declaration at tcfail067.hs:60)
- from the context: (Num a)
+ Could not deduce `Show (SubRange a)' from the context: (Num a)
Probable cause: missing `Show (SubRange a)'
in instance declaration context
or missing instance declaration for `Show (SubRange a)'
- When checking the superclasses of an instance declaration
+ arising from an instance declaration at tcfail067.hs:60
tcfail067.hs:61:
Could not deduce `Ord a'
- (arising from use of `numSubRangeNegate' at tcfail067.hs:61)
from the context: (Num (SubRange a),
Num a,
Eq (SubRange a),
- Show (SubRange a),
- Eq (SubRange a),
Show (SubRange a))
Probable cause: missing `Ord a' in instance declaration context
- When checking the methods of an instance declaration
+ arising from use of `numSubRangeNegate' at tcfail067.hs:61
+ In the right-hand side of a pattern binding: numSubRangeNegate
tcfail067.hs:74:
- Could not deduce `Ord a'
- (arising from use of `SubRange' at tcfail067.hs:74)
- from the context: (Num a)
+ Could not deduce `Ord a' from the context: (Num a)
Probable cause: missing `Ord a'
in type signature for `numSubRangeBinOp'
- When checking the type signature(s) for `numSubRangeBinOp'
+ arising from use of `SubRange' at tcfail067.hs:74
+ In the right-hand side of an equation for `numSubRangeBinOp':
+ SubRange (result, result) result
Compilation had errors
tcfail072.hs:23:
- Ambiguous type variable(s) `p'
- in the constraint `Ord p'
- arising from use of `g' at tcfail072.hs:23
+ Ambiguous type variable(s) `p' in the constraint `Ord p'
+ arising from use of `g' at tcfail072.hs:23
+ In the right-hand side of an equation for `g': g A
tcfail072.hs:23:
- Ambiguous type variable(s) `q'
- in the constraint `Ord q'
- arising from use of `g' at tcfail072.hs:23
+ Ambiguous type variable(s) `q' in the constraint `Ord q'
+ arising from use of `g' at tcfail072.hs:23
+ In the right-hand side of an equation for `g': g A
Compilation had errors
tcfail073.hs:3:
Duplicate or overlapping instance declarations
for `Eq (a, b)'
- imported from module `PrelTup' and defined at tcfail073.hs:7
+ defined at tcfail073.hs:7 and imported from module `PrelTup'
tcfail073.hs:8:
- Could not deduce `Eq a'
- (arising from use of `==' at tcfail073.hs:8)
- from the context: (Eq (a, b))
+ Could not deduce `Eq a' from the context: (Eq (a, b))
Probable cause: missing `Eq a' in instance declaration context
- When checking the methods of an instance declaration
+ arising from use of `==' at tcfail073.hs:8
+ In the right-hand side of an equation for `==': m == o
Compilation had errors
tcfail080.hs:11:
- Ambiguous type variable(s) `c'
- in the constraint `Collection c a'
- arising from use of `isempty' at tcfail080.hs:11
+ Ambiguous type variable(s) `c' in the constraint `Collection c a'
+ arising from use of `isempty' at tcfail080.hs:11
+ In the right-hand side of an equation for `q':
+ isempty (singleton x)
Compilation had errors
tcfail082.hs:8:
No instance for `Show FooData'
- arising from use of `print' at tcfail082.hs:8
+ arising from use of `print' at tcfail082.hs:8
+ In the right-hand side of a pattern binding:
+ print ((read "FooData") :: FooData)
Compilation had errors
tcfail084.hs:10:
Constructor `F' does not have field `y'
+ In the record construction: F {y = 2}
In the right-hand side of a pattern binding: F {y = 2}
Compilation had errors
tcfail085.hs:9:
Constructor `F' does not have the required strict field `y'
+ In the record construction: F {x = 2}
In the right-hand side of a pattern binding: F {x = 2}
Compilation had errors
tcfail086.hs:4:
- Can't derive any instances for type Ex
+ Can't derive any instances for type `Ex'
because it has existentially-quantified constructor(s)
Compilation had errors
projects / ghc-hetmet.git / commitdiff