Commit 9b9cfbbc authored by simonpj's avatar simonpj
Browse files

[project @ 2005-03-01 21:44:48 by simonpj]

Accept output
parent 2004baba
tcfail008.hs:3:6:
Ambiguous type variable `a' in the constraints:
`Num [a]' arising from the literal `2' at tcfail008.hs:3:6
`Num a' arising from the literal `1' at tcfail008.hs:3:4
Possible cause: the monomorphism restriction applied to the following:
o :: [a] (bound at tcfail008.hs:3:0)
Probable fix: give these definition(s) an explicit type signature
or use -fno-monomorphism-restriction
tcfail008.hs:3:6:
No instance for (Num [a])
arising from the literal `2' at tcfail008.hs:3:6
Probable fix: add an instance declaration for (Num [a])
In the second argument of `(:)', namely `2'
In the definition of `o': o = 1 : 2
tcfail010.hs:3:17:
Ambiguous type variable `a' in the constraint:
`Num [a]' arising from the literal `2' at tcfail010.hs:3:17
Possible cause: the monomorphism restriction applied to the following:
q :: [a] -> [a] (bound at tcfail010.hs:3:0)
Probable fix: give these definition(s) an explicit type signature
or use -fno-monomorphism-restriction
tcfail010.hs:3:17:
No instance for (Num [a])
arising from the literal `2' at tcfail010.hs:3:17
Probable fix: add an instance declaration for (Num [a])
In the second argument of `(+)', namely `2'
In a lambda abstraction: \ (y : z) -> z + 2
In the definition of `q': q = \ (y : z) -> z + 2
tcfail018.hs:5:9:
Ambiguous type variable `a' in the constraint:
`Num [a]' arising from the literal `1' at tcfail018.hs:5:9
Possible cause: the monomorphism restriction applied to the following:
a :: a (bound at tcfail018.hs:5:1)
Probable fix: give these definition(s) an explicit type signature
or use -fno-monomorphism-restriction
tcfail018.hs:5:9:
No instance for (Num [a])
arising from the literal `1' at tcfail018.hs:5:9
Probable fix: add an instance declaration for (Num [a])
In a pattern binding: (a : []) = 1
tcfail032.hs:14:7:
Inferred type is less polymorphic than expected
Quantified type variable `a' escapes
It is mentioned in the environment:
f :: (a -> Int) -> t (bound at tcfail032.hs:14:0)
x :: a -> Int (bound at tcfail032.hs:14:2)
In the expression: x :: (Eq a) => a -> Int
In the definition of `f': f x = (x :: (Eq a) => a -> Int)
tcfail032.hs:14:7:
Inferred type is less polymorphic than expected
Quantified type variable `a' is mentioned in the environment:
f :: (a -> Int) -> t (bound at tcfail032.hs:14:0)
x :: a -> Int (bound at tcfail032.hs:14:2)
In the expression: x :: (Eq a) => a -> Int
In the definition of `f': f x = (x :: (Eq a) => a -> Int)
tcfail068.hs:14:8:
Couldn't match the rigid variable `s' against the rigid variable `s1'
`s' is bound by the type signature for `itgen'
`s1' is bound by the polymorphic type `forall s. GHC.ST.ST s a'
at tcfail068.hs:(13,8)-(14,30)
Expected type: GHC.ST.ST s1 (IndTree s a)
Inferred type: GHC.ST.ST s1 (STArray s1 i e)
In the application `newSTArray ((1, 1), n) x'
In the first argument of `runST', namely `(newSTArray ((1, 1), n) x)'
tcfail068.hs:19:8:
Couldn't match the rigid variable `s' against the rigid variable `s1'
`s' is bound by the polymorphic type `forall s. GHC.ST.ST s a'
at tcfail068.hs:(18,8)-(21,18)
`s1' is bound by the type signature for `itiap'
Expected type: GHC.ST.ST s (IndTree s1 a)
Inferred type: GHC.ST.ST s1 (IndTree s1 a)
In the expression:
(readSTArray arr i) >>= (\ val -> (writeSTArray arr i (f val)) >> (return arr))
In the first argument of `runST', namely
`((readSTArray arr i)
>>= (\ val -> (writeSTArray arr i (f val)) >> (return arr)))'
tcfail068.hs:24:34:
Couldn't match the rigid variable `s' against the rigid variable `s1'
`s' is bound by the polymorphic type `forall s. GHC.ST.ST s a'
at tcfail068.hs:24:28-44
`s1' is bound by the type signature for `itrap'
Expected type: GHC.ST.ST s (IndTree s1 a)
Inferred type: GHC.ST.ST s1 (IndTree s1 a)
In the application `itrap' i k'
In the first argument of `runST', namely `(itrap' i k)'
tcfail068.hs:36:45:
Couldn't match the rigid variable `s' against the rigid variable `s1'
`s' is bound by the polymorphic type `forall s. GHC.ST.ST s a'
at tcfail068.hs:36:39-62
`s1' is bound by the type signature for `itrapstate'
Expected type: GHC.ST.ST s (c, IndTree s1 b)
Inferred type: GHC.ST.ST s1 (c, IndTree s1 b)
In the application `itrapstate' i k s'
In the first argument of `runST', namely `(itrapstate' i k s)'
tcfail068.hs:14:8:
Couldn't match the rigid variable `s' against the rigid variable `s1'
`s' is bound by the type signature for `itgen'
`s1' is bound by the polymorphic type `forall s1. GHC.ST.ST s1 a'
at tcfail068.hs:(13,8)-(14,30)
Expected type: GHC.ST.ST s1 (IndTree s a1)
Inferred type: GHC.ST.ST s1 (STArray s1 i e)
In the application `newSTArray ((1, 1), n) x'
In the first argument of `runST', namely `(newSTArray ((1, 1), n) x)'
tcfail068.hs:19:8:
Couldn't match the rigid variable `s' against the rigid variable `s1'
`s' is bound by the polymorphic type `forall s. GHC.ST.ST s a'
at tcfail068.hs:(18,8)-(21,18)
`s1' is bound by the type signature for `itiap'
Expected type: GHC.ST.ST s (IndTree s1 a1)
Inferred type: GHC.ST.ST s1 (IndTree s1 a1)
In the expression:
(readSTArray arr i) >>= (\ val -> (writeSTArray arr i (f val)) >> (return arr))
In the first argument of `runST', namely
`((readSTArray arr i)
>>= (\ val -> (writeSTArray arr i (f val)) >> (return arr)))'
tcfail068.hs:24:34:
Couldn't match the rigid variable `s' against the rigid variable `s1'
`s' is bound by the polymorphic type `forall s. GHC.ST.ST s a'
at tcfail068.hs:24:28-44
`s1' is bound by the type signature for `itrap'
Expected type: GHC.ST.ST s (IndTree s1 a1)
Inferred type: GHC.ST.ST s1 (IndTree s1 a1)
In the application `itrap' i k'
In the first argument of `runST', namely `(itrap' i k)'
tcfail068.hs:36:45:
Couldn't match the rigid variable `s' against the rigid variable `s1'
`s' is bound by the polymorphic type `forall s. GHC.ST.ST s a'
at tcfail068.hs:36:39-62
`s1' is bound by the type signature for `itrapstate'
Expected type: GHC.ST.ST s (c, IndTree s1 b)
Inferred type: GHC.ST.ST s1 (c, IndTree s1 b)
In the application `itrapstate' i k s'
In the first argument of `runST', namely `(itrapstate' i k s)'
tcfail071.hs:8:0:
Mis-match between the contexts of the signatures for
f :: forall d. (Ord d) => d -> d
g :: forall e. e -> e
The signature contexts in a mutually recursive group should all be identical
tcfail071.hs:8:0:
Contexts differ in length
When matching the contexts of the signatures for
f :: forall d. (Ord d) => d -> d
g :: forall e. e -> e
The signature contexts in a mutually recursive group should all be identical
tcfail076.hs:18:81:
Couldn't match the rigid variable `res' against the rigid variable `res1'
`res' is bound by the polymorphic type `forall res. (a -> m res) -> m res'
at tcfail076.hs:18:63-87
`res1' is bound by the polymorphic type `forall res. (a -> m res) -> m res'
at tcfail076.hs:18:27-95
Expected type: m res
Inferred type: m res1
In the application `cont a'
In a lambda abstraction: \ cont' -> cont a
tcfail076.hs:18:81:
Couldn't match the rigid variable `res' against the rigid variable `res1'
`res' is bound by the polymorphic type `forall res. (a -> m res) -> m res'
at tcfail076.hs:18:63-87
`res1' is bound by the polymorphic type `forall res1.
(a1 -> m1 res1) -> m1 res1'
at tcfail076.hs:18:27-95
Expected type: m2 res
Inferred type: m2 res1
In the application `cont a'
In a lambda abstraction: \ cont' -> cont a
tcfail099.hs:9:0:
Inferred type is less polymorphic than expected
Quantified type variable `a' escapes
It is mentioned in the environment:
call :: DS -> a -> Int (bound at tcfail099.hs:9:0)
When checking an existential match that binds
f :: a -> Int
The pattern(s) have type(s): DS
a
The body has type: Int
In the definition of `call': call (C f) arg = f arg
tcfail099.hs:9:0:
Inferred type is less polymorphic than expected
Quantified type variable `a' is mentioned in the environment:
call :: DS -> a -> Int (bound at tcfail099.hs:9:0)
When checking an existential match that binds
f :: a -> Int
The pattern(s) have type(s): DS
a
The body has type: Int
In the definition of `call': call (C f) arg = f arg
tcfail103.hs:15:0:
Inferred type is less polymorphic than expected
Quantified type variable `t' escapes
It is mentioned in the environment:
s = t bound at: tcfail103.hs:15:7
When trying to generalise the type inferred for `f'
Signature type: forall t. ST t Int
Type to generalise: ST t Int
In the type signature for `f'
When generalising the type(s) for `f'
tcfail103.hs:15:0:
Inferred type is less polymorphic than expected
Quantified type variable `t' is mentioned in the environment:
Scoped type variable `s' = t (bound at: tcfail103.hs:15:7)
When trying to generalise the type inferred for `f'
Signature type: forall t. ST t Int
Type to generalise: ST t Int
In the type signature for `f'
When generalising the type(s) for `f'
tcfail128.hs:18:15:
Ambiguous type variable `b' in the constraint:
`Data.Array.Base.MArray b FlatVector IO'
arising from use of `thaw' at tcfail128.hs:18:15-18
Probable fix: add a type signature that fixes these type variable(s)
tcfail128.hs:18:15:
No instance for (Data.Array.Base.MArray b FlatVector IO)
arising from use of `thaw' at tcfail128.hs:18:15-18
Probable fix:
add an instance declaration for (Data.Array.Base.MArray b FlatVector IO)
In a 'do' expression: v <- thaw tmp
In the definition of `main':
main = do
let sL = [1, 4, 6, 3, 2, 5]
dim = length sL
help :: [FlatVector]
help = [... | s <- ...]
tmp :: Vector FlatVector
tmp = listVector (1, dim) help
v <- thaw tmp
return ()
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment