Commit cdc14b48 authored by thomie's avatar thomie

Testsuite: remove Windows CR again.. [skip ci]

parent e7e42c83
T11010.hs:9:36: error:
• Couldn't match type ‘a1’ with ‘Int’
‘a1’ is a rigid type variable bound by
a pattern with constructor:
Fun :: forall b a. String -> (a -> b) -> Expr a -> Expr b,
in a pattern synonym declaration
at T11010.hs:9:26-36
Expected type: a -> b
Actual type: a1 -> b
• In the declaration for pattern synonym ‘IntFun’
• Relevant bindings include
x :: Expr a1 (bound at T11010.hs:9:36)
f :: a1 -> b (bound at T11010.hs:9:34)
T11010.hs:9:36: error:
• Couldn't match type ‘a1’ with ‘Int’
‘a1’ is a rigid type variable bound by
a pattern with constructor:
Fun :: forall b a. String -> (a -> b) -> Expr a -> Expr b,
in a pattern synonym declaration
at T11010.hs:9:26-36
Expected type: a -> b
Actual type: a1 -> b
• In the declaration for pattern synonym ‘IntFun’
• Relevant bindings include
x :: Expr a1 (bound at T11010.hs:9:36)
f :: a1 -> b (bound at T11010.hs:9:34)
T11039.hs:8:15: error:
• Couldn't match type ‘f’ with ‘A’
‘f’ is a rigid type variable bound by
the signature for pattern synonym ‘Q’ at T11039.hs:7:14-38
Expected type: f a
Actual type: A a
• In the pattern: A a
In the declaration for pattern synonym ‘Q’
T11039.hs:8:15: error:
• Couldn't match type ‘f’ with ‘A’
‘f’ is a rigid type variable bound by
the signature for pattern synonym ‘Q’ at T11039.hs:7:14-38
Expected type: f a
Actual type: A a
• In the pattern: A a
In the declaration for pattern synonym ‘Q’
T11667.hs:12:22: error:
• Could not deduce (Num a) arising from the literal ‘42’
from the context: Eq a
bound by the signature for pattern synonym ‘Pat1’
at T11667.hs:12:9-12
Possible fix:
add (Num a) to the "required" context of
the signature for pattern synonym ‘Pat1’
• In the pattern: 42
In the pattern: Just 42
In the declaration for pattern synonym ‘Pat1’
T11667.hs:18:28: error:
• Couldn't match type ‘b’ with ‘Bool’
arising from the "provided" constraints claimed by
the signature of ‘Pat2’
‘b’ is a rigid type variable bound by
the signature for pattern synonym ‘Pat2’ at T11667.hs:17:17-50
• In the declaration for pattern synonym ‘Pat2’
• Relevant bindings include y :: b (bound at T11667.hs:18:21)
T11667.hs:24:24: error:
• No instance for (Show a)
arising from the "provided" constraints claimed by
the signature of ‘Pat3’
In other words, a successful match on the pattern
Just x
does not provide the constraint (Show a)
• In the declaration for pattern synonym ‘Pat3’
T11667.hs:31:16: error:
• Could not deduce (Num a) arising from a use of ‘MkS’
from the context: (Eq a, Show a)
bound by the signature for pattern synonym ‘Pat4’
at T11667.hs:31:1-21
Possible fix:
add (Num a) to the "required" context of
the signature for pattern synonym ‘Pat4’
• In the expression: MkS 42
In an equation for ‘Pat4’: Pat4 = MkS 42
T11667.hs:12:22: error:
• Could not deduce (Num a) arising from the literal ‘42’
from the context: Eq a
bound by the signature for pattern synonym ‘Pat1’
at T11667.hs:12:9-12
Possible fix:
add (Num a) to the "required" context of
the signature for pattern synonym ‘Pat1’
• In the pattern: 42
In the pattern: Just 42
In the declaration for pattern synonym ‘Pat1’
T11667.hs:18:28: error:
• Couldn't match type ‘b’ with ‘Bool’
arising from the "provided" constraints claimed by
the signature of ‘Pat2’
‘b’ is a rigid type variable bound by
the signature for pattern synonym ‘Pat2’ at T11667.hs:17:17-50
• In the declaration for pattern synonym ‘Pat2’
• Relevant bindings include y :: b (bound at T11667.hs:18:21)
T11667.hs:24:24: error:
• No instance for (Show a)
arising from the "provided" constraints claimed by
the signature of ‘Pat3’
In other words, a successful match on the pattern
Just x
does not provide the constraint (Show a)
• In the declaration for pattern synonym ‘Pat3’
T11667.hs:31:16: error:
• Could not deduce (Num a) arising from a use of ‘MkS’
from the context: (Eq a, Show a)
bound by the signature for pattern synonym ‘Pat4’
at T11667.hs:31:1-21
Possible fix:
add (Num a) to the "required" context of
the signature for pattern synonym ‘Pat4’
• In the expression: MkS 42
In an equation for ‘Pat4’: Pat4 = MkS 42
ExPatFail.hs:12:15: error:
• Couldn't match expected type ‘t’ with actual type ‘a’
because type variable ‘a’ would escape its scope
This (rigid, skolem) type variable is bound by
a pattern with constructor:
MkT :: forall a. Integral a => a -> Int -> T,
in a pattern binding
at ExPatFail.hs:12:11-17
• In the pattern: MkT y _
In a pattern binding: MkT y _ = x
In the expression: let MkT y _ = x in y
• Relevant bindings include
f :: T -> t (bound at ExPatFail.hs:12:1)
ExPatFail.hs:12:15: error:
• Couldn't match expected type ‘t’ with actual type ‘a’
because type variable ‘a’ would escape its scope
This (rigid, skolem) type variable is bound by
a pattern with constructor:
MkT :: forall a. Integral a => a -> Int -> T,
in a pattern binding
at ExPatFail.hs:12:11-17
• In the pattern: MkT y _
In a pattern binding: MkT y _ = x
In the expression: let MkT y _ = x in y
• Relevant bindings include
f :: T -> t (bound at ExPatFail.hs:12:1)
FD1.hs:16:1: error:
• Couldn't match expected type ‘a’ with actual type ‘Int -> Int’
‘a’ is a rigid type variable bound by
the type signature for:
plus :: forall a. E a (Int -> Int) => Int -> a
at FD1.hs:15:1-38
• The equation(s) for ‘plus’ have two arguments,
but its type ‘Int -> a’ has only one
• Relevant bindings include plus :: Int -> a (bound at FD1.hs:16:1)
FD1.hs:16:1: error:
• Couldn't match expected type ‘a’ with actual type ‘Int -> Int’
‘a’ is a rigid type variable bound by
the type signature for:
plus :: forall a. E a (Int -> Int) => Int -> a
at FD1.hs:15:1-38
• The equation(s) for ‘plus’ have two arguments,
but its type ‘Int -> a’ has only one
• Relevant bindings include plus :: Int -> a (bound at FD1.hs:16:1)
FD2.hs:26:36: error:
• Couldn't match expected type ‘e’ with actual type ‘e1’
‘e1’ is a rigid type variable bound by
the type signature for:
mf :: forall e1. Elem a e1 => e1 -> Maybe e1 -> Maybe e1
at FD2.hs:24:12-54
‘e’ is a rigid type variable bound by
the type signature for:
foldr1 :: forall e. Elem a e => (e -> e -> e) -> a -> e
at FD2.hs:21:13-47
• In the first argument of ‘f’, namely ‘x’
In the first argument of ‘Just’, namely ‘(f x y)’
In the expression: Just (f x y)
• Relevant bindings include
y :: e1 (bound at FD2.hs:26:23)
x :: e1 (bound at FD2.hs:26:15)
mf :: e1 -> Maybe e1 -> Maybe e1 (bound at FD2.hs:25:12)
f :: e -> e -> e (bound at FD2.hs:22:10)
foldr1 :: (e -> e -> e) -> a -> e (bound at FD2.hs:22:3)
FD2.hs:26:36: error:
• Couldn't match expected type ‘e’ with actual type ‘e1’
‘e1’ is a rigid type variable bound by
the type signature for:
mf :: forall e1. Elem a e1 => e1 -> Maybe e1 -> Maybe e1
at FD2.hs:24:12-54
‘e’ is a rigid type variable bound by
the type signature for:
foldr1 :: forall e. Elem a e => (e -> e -> e) -> a -> e
at FD2.hs:21:13-47
• In the first argument of ‘f’, namely ‘x’
In the first argument of ‘Just’, namely ‘(f x y)’
In the expression: Just (f x y)
• Relevant bindings include
y :: e1 (bound at FD2.hs:26:23)
x :: e1 (bound at FD2.hs:26:15)
mf :: e1 -> Maybe e1 -> Maybe e1 (bound at FD2.hs:25:12)
f :: e -> e -> e (bound at FD2.hs:22:10)
foldr1 :: (e -> e -> e) -> a -> e (bound at FD2.hs:22:3)
FD3.hs:15:15: error:
• Couldn't match type ‘a’ with ‘(String, a)’
arising from a functional dependency between:
constraint ‘MkA (String, a) a’ arising from a use of ‘mkA’
instance ‘MkA a1 a1’ at FD3.hs:12:10-16
‘a’ is a rigid type variable bound by
the type signature for:
translate :: forall a. (String, a) -> A a
at FD3.hs:14:1-31
• In the expression: mkA a
In an equation for ‘translate’: translate a = mkA a
• Relevant bindings include
a :: (String, a) (bound at FD3.hs:15:11)
translate :: (String, a) -> A a (bound at FD3.hs:15:1)
FD3.hs:15:15: error:
• Couldn't match type ‘a’ with ‘(String, a)’
arising from a functional dependency between:
constraint ‘MkA (String, a) a’ arising from a use of ‘mkA’
instance ‘MkA a1 a1’ at FD3.hs:12:10-16
‘a’ is a rigid type variable bound by
the type signature for:
translate :: forall a. (String, a) -> A a
at FD3.hs:14:1-31
• In the expression: mkA a
In an equation for ‘translate’: translate a = mkA a
• Relevant bindings include
a :: (String, a) (bound at FD3.hs:15:11)
translate :: (String, a) -> A a (bound at FD3.hs:15:1)
T10072.hs:3:31: error:
• Found type wildcard ‘_’ standing for ‘b’
Where: ‘b’ is a rigid type variable bound by
the RULE "map/empty" at T10072.hs:3:1-47
To use the inferred type, enable PartialTypeSignatures
• In a RULE for ‘f’: a -> _
When checking the transformation rule "map/empty"
T10072.hs:3:31: error:
• Found type wildcard ‘_’ standing for ‘b’
Where: ‘b’ is a rigid type variable bound by
the RULE "map/empty" at T10072.hs:3:1-47
To use the inferred type, enable PartialTypeSignatures
• In a RULE for ‘f’: a -> _
When checking the transformation rule "map/empty"
T10632.hs:3:1: warning: [-Wredundant-constraints (in -Wall)]
• Redundant constraint: ?file1::String
• In the type signature for:
f :: (?file1::String) => IO ()
T10632.hs:3:1: warning: [-Wredundant-constraints (in -Wall)]
• Redundant constraint: ?file1::String
• In the type signature for:
f :: (?file1::String) => IO ()
T11339.hs:15:5: error:
• Overloaded signature conflicts with monomorphism restriction
t :: forall (f :: * -> *). Applicative f => (a -> f b) -> f t
• In an equation for ‘failing’:
failing left right afb s
= case pins t of {
[] -> right afb s
_ -> t afb }
where
t :: Applicative f => (a -> f b) -> f t
Bazaar {getBazaar = t} = left sell s
sell :: a -> Bazaar a b b
sell w = Bazaar ($ w)
....
T11339.hs:15:5: error:
• Overloaded signature conflicts with monomorphism restriction
t :: forall (f :: * -> *). Applicative f => (a -> f b) -> f t
• In an equation for ‘failing’:
failing left right afb s
= case pins t of {
[] -> right afb s
_ -> t afb }
where
t :: Applicative f => (a -> f b) -> f t
Bazaar {getBazaar = t} = left sell s
sell :: a -> Bazaar a b b
sell w = Bazaar ($ w)
....
T2494.hs:15:14: error:
• Couldn't match type ‘b’ with ‘a’
‘b’ is a rigid type variable bound by
the RULE "foo/foo" at T2494.hs:14:16-62
‘a’ is a rigid type variable bound by
the RULE "foo/foo" at T2494.hs:13:16-62
Expected type: Maybe (m a) -> Maybe (m a)
Actual type: Maybe (m b) -> Maybe (m b)
• In the first argument of ‘foo’, namely ‘g’
In the second argument of ‘foo’, namely ‘(foo g x)’
In the expression: foo f (foo g x)
• Relevant bindings include
f :: forall (m :: * -> *). Monad m => Maybe (m a) -> Maybe (m a)
(bound at T2494.hs:13:11)
g :: forall (m :: * -> *). Monad m => Maybe (m b) -> Maybe (m b)
(bound at T2494.hs:14:11)
x :: Maybe a (bound at T2494.hs:14:65)
T2494.hs:15:30: error:
• Couldn't match type ‘b’ with ‘a’
‘b’ is a rigid type variable bound by
the RULE "foo/foo" at T2494.hs:14:16-62
‘a’ is a rigid type variable bound by
the RULE "foo/foo" at T2494.hs:13:16-62
Expected type: Maybe (m b) -> Maybe (m a)
Actual type: Maybe (m b) -> Maybe (m b)
• In the second argument of ‘(.)’, namely ‘g’
In the first argument of ‘foo’, namely ‘(f . g)’
In the expression: foo (f . g) x
• Relevant bindings include
f :: forall (m :: * -> *). Monad m => Maybe (m a) -> Maybe (m a)
(bound at T2494.hs:13:11)
g :: forall (m :: * -> *). Monad m => Maybe (m b) -> Maybe (m b)
(bound at T2494.hs:14:11)
x :: Maybe a (bound at T2494.hs:14:65)
T2494.hs:15:14: error:
• Couldn't match type ‘b’ with ‘a’
‘b’ is a rigid type variable bound by
the RULE "foo/foo" at T2494.hs:14:16-62
‘a’ is a rigid type variable bound by
the RULE "foo/foo" at T2494.hs:13:16-62
Expected type: Maybe (m a) -> Maybe (m a)
Actual type: Maybe (m b) -> Maybe (m b)
• In the first argument of ‘foo’, namely ‘g’
In the second argument of ‘foo’, namely ‘(foo g x)’
In the expression: foo f (foo g x)
• Relevant bindings include
f :: forall (m :: * -> *). Monad m => Maybe (m a) -> Maybe (m a)
(bound at T2494.hs:13:11)
g :: forall (m :: * -> *). Monad m => Maybe (m b) -> Maybe (m b)
(bound at T2494.hs:14:11)
x :: Maybe a (bound at T2494.hs:14:65)
T2494.hs:15:30: error:
• Couldn't match type ‘b’ with ‘a’
‘b’ is a rigid type variable bound by
the RULE "foo/foo" at T2494.hs:14:16-62
‘a’ is a rigid type variable bound by
the RULE "foo/foo" at T2494.hs:13:16-62
Expected type: Maybe (m b) -> Maybe (m a)
Actual type: Maybe (m b) -> Maybe (m b)
• In the second argument of ‘(.)’, namely ‘g’
In the first argument of ‘foo’, namely ‘(f . g)’
In the expression: foo (f . g) x
• Relevant bindings include
f :: forall (m :: * -> *). Monad m => Maybe (m a) -> Maybe (m a)
(bound at T2494.hs:13:11)
g :: forall (m :: * -> *). Monad m => Maybe (m b) -> Maybe (m b)
(bound at T2494.hs:14:11)
x :: Maybe a (bound at T2494.hs:14:65)
T9834.hs:23:10: warning: [-Wdeferred-type-errors (in -Wdefault)]
• Couldn't match type ‘p’ with ‘(->) (p a0)’
‘p’ is a rigid type variable bound by
the class declaration for ‘ApplicativeFix’ at T9834.hs:21:39
Expected type: (forall (q :: * -> *).
Applicative q =>
Comp p q a -> Comp p q a)
-> p a
Actual type: (forall (q :: * -> *).
Applicative q =>
Nat (Comp p q) (Comp p q))
-> p a0 -> p a0
• In the expression: wrapIdComp
In an equation for ‘afix’: afix = wrapIdComp
• Relevant bindings include
afix :: (forall (q :: * -> *).
Applicative q =>
Comp p q a -> Comp p q a)
-> p a
(bound at T9834.hs:23:3)
T9834.hs:23:10: warning: [-Wdeferred-type-errors (in -Wdefault)]
• Couldn't match type ‘a’ with ‘a1’
‘a’ is a rigid type variable bound by
the type signature for:
afix :: forall a.
(forall (q :: * -> *). Applicative q => Comp p q a -> Comp p q a)
-> p a
at T9834.hs:22:11-74
‘a1’ is a rigid type variable bound by
a type expected by the context:
forall (q :: * -> *) a1.
Applicative q =>
Comp p q a1 -> Comp p q a1
at T9834.hs:23:10-19
Expected type: Comp p q a1 -> Comp p q a1
Actual type: Comp p q a -> Comp p q a
• In the expression: wrapIdComp
In an equation for ‘afix’: afix = wrapIdComp
• Relevant bindings include
afix :: (forall (q :: * -> *).
Applicative q =>
Comp p q a -> Comp p q a)
-> p a
(bound at T9834.hs:23:3)
T9834.hs:23:10: warning: [-Wdeferred-type-errors (in -Wdefault)]
• Couldn't match type ‘p’ with ‘(->) (p a0)’
‘p’ is a rigid type variable bound by
the class declaration for ‘ApplicativeFix’ at T9834.hs:21:39
Expected type: (forall (q :: * -> *).
Applicative q =>
Comp p q a -> Comp p q a)
-> p a
Actual type: (forall (q :: * -> *).
Applicative q =>
Nat (Comp p q) (Comp p q))
-> p a0 -> p a0
• In the expression: wrapIdComp
In an equation for ‘afix’: afix = wrapIdComp
• Relevant bindings include
afix :: (forall (q :: * -> *).
Applicative q =>
Comp p q a -> Comp p q a)
-> p a
(bound at T9834.hs:23:3)
T9834.hs:23:10: warning: [-Wdeferred-type-errors (in -Wdefault)]
• Couldn't match type ‘a’ with ‘a1’
‘a’ is a rigid type variable bound by
the type signature for:
afix :: forall a.
(forall (q :: * -> *). Applicative q => Comp p q a -> Comp p q a)
-> p a
at T9834.hs:22:11-74
‘a1’ is a rigid type variable bound by
a type expected by the context:
forall (q :: * -> *) a1.
Applicative q =>
Comp p q a1 -> Comp p q a1
at T9834.hs:23:10-19
Expected type: Comp p q a1 -> Comp p q a1
Actual type: Comp p q a -> Comp p q a
• In the expression: wrapIdComp
In an equation for ‘afix’: afix = wrapIdComp
• Relevant bindings include
afix :: (forall (q :: * -> *).
Applicative q =>
Comp p q a -> Comp p q a)
-> p a
(bound at T9834.hs:23:3)
T9939.hs:5:1: warning: [-Wredundant-constraints (in -Wall)]
• Redundant constraint: Eq a
• In the type signature for:
f1 :: (Eq a, Ord a) => a -> a -> Bool
T9939.hs:9:1: warning: [-Wredundant-constraints (in -Wall)]
• Redundant constraint: Eq a
• In the type signature for:
f2 :: (Eq a, Ord a) => a -> a -> Bool
T9939.hs:13:1: warning: [-Wredundant-constraints (in -Wall)]
• Redundant constraint: Eq b
• In the type signature for:
f3 :: (Eq a, a ~ b, Eq b) => a -> b -> Bool
T9939.hs:20:1: warning: [-Wredundant-constraints (in -Wall)]
• Redundant constraint: Eq a
• In the type signature for:
f4 :: (Eq a, Eq b) => a -> b -> Equal a b -> Bool
T9939.hs:5:1: warning: [-Wredundant-constraints (in -Wall)]
• Redundant constraint: Eq a
• In the type signature for:
f1 :: (Eq a, Ord a) => a -> a -> Bool
T9939.hs:9:1: warning: [-Wredundant-constraints (in -Wall)]
• Redundant constraint: Eq a
• In the type signature for:
f2 :: (Eq a, Ord a) => a -> a -> Bool
T9939.hs:13:1: warning: [-Wredundant-constraints (in -Wall)]
• Redundant constraint: Eq b
• In the type signature for:
f3 :: (Eq a, a ~ b, Eq b) => a -> b -> Bool
T9939.hs:20:1: warning: [-Wredundant-constraints (in -Wall)]
• Redundant constraint: Eq a
• In the type signature for:
f4 :: (Eq a, Eq b) => a -> b -> Equal a b -> Bool
holes.hs:3:5: warning: [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: t
Where: ‘t’ is a rigid type variable bound by
the inferred type of f :: t at holes.hs:3:1-5
• In the expression: _
In an equation for ‘f’: f = _
• Relevant bindings include f :: t (bound at holes.hs:3:1)
holes.hs:6:7: warning: [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: Char
• In the expression: _
In an equation for ‘g’: g x = _
• Relevant bindings include
x :: Int (bound at holes.hs:6:3)
g :: Int -> Char (bound at holes.hs:6:1)
holes.hs:8:5: warning: [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: [Char]
• In the first argument of ‘(++)’, namely ‘_’
In the expression: _ ++ "a"
In an equation for ‘h’: h = _ ++ "a"
• Relevant bindings include h :: [Char] (bound at holes.hs:8:1)
holes.hs:11:15: warning: [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: b0
Where: ‘b0’ is an ambiguous type variable
• In the second argument of ‘const’, namely ‘_’
In the expression: const y _
In an equation for ‘z’: z y = const y _
• Relevant bindings include
y :: [a] (bound at holes.hs:11:3)
z :: [a] -> [a] (bound at holes.hs:11:1)
holes.hs:3:5: warning: [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: t
Where: ‘t’ is a rigid type variable bound by
the inferred type of f :: t at holes.hs:3:1-5
• In the expression: _
In an equation for ‘f’: f = _
• Relevant bindings include f :: t (bound at holes.hs:3:1)
holes.hs:6:7: warning: [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: Char
• In the expression: _
In an equation for ‘g’: g x = _
• Relevant bindings include
x :: Int (bound at holes.hs:6:3)
g :: Int -> Char (bound at holes.hs:6:1)
holes.hs:8:5: warning: [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: [Char]
• In the first argument of ‘(++)’, namely ‘_’
In the expression: _ ++ "a"
In an equation for ‘h’: h = _ ++ "a"
• Relevant bindings include h :: [Char] (bound at holes.hs:8:1)
holes.hs:11:15: warning: [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: b0
Where: ‘b0’ is an ambiguous type variable
• In the second argument of ‘const’, namely ‘_’
In the expression: const y _
In an equation for ‘z’: z y = const y _
• Relevant bindings include
y :: [a] (bound at holes.hs:11:3)
z :: [a] -> [a] (bound at holes.hs:11:1)
holes3.hs:3:5: error:
• Found hole: _ :: t
Where: ‘t’ is a rigid type variable bound by
the inferred type of f :: t at holes3.hs:3:1-5
• In the expression: _
In an equation for ‘f’: f = _
• Relevant bindings include f :: t (bound at holes3.hs:3:1)