blob: 7ded5f9b8abc1df2096d6efbd7dc31ef87ad171e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
refinement_hole_fits.hs:4:5: warning: [GHC-88464] [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: [Integer] -> Integer
• In an equation for ‘f’: f = _
• Relevant bindings include
f :: [Integer] -> Integer (bound at refinement_hole_fits.hs:4:1)
Valid hole fits include
f :: [Integer] -> Integer (bound at refinement_hole_fits.hs:4:1)
g :: [Integer] -> Integer (bound at refinement_hole_fits.hs:7:1)
head :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
with head @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.List’))
last :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
with last @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.List’))
maximum :: forall (t :: * -> *) a. (Foldable t, Ord a) => t a -> a
with maximum @[] @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Foldable’))
minimum :: forall (t :: * -> *) a. (Foldable t, Ord a) => t a -> a
with minimum @[] @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Foldable’))
product :: forall (t :: * -> *) a. (Foldable t, Num a) => t a -> a
with product @[] @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Foldable’))
sum :: forall (t :: * -> *) a. (Foldable t, Num a) => t a -> a
with sum @[] @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Foldable’))
Valid refinement hole fits include
foldl1 (_ :: Integer -> Integer -> Integer)
where foldl1 :: forall (t :: * -> *) a.
Foldable t =>
(a -> a -> a) -> t a -> a
with foldl1 @[] @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Foldable’))
foldr1 (_ :: Integer -> Integer -> Integer)
where foldr1 :: forall (t :: * -> *) a.
Foldable t =>
(a -> a -> a) -> t a -> a
with foldr1 @[] @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Foldable’))
foldl (_ :: Integer -> Integer -> Integer) (_ :: Integer)
where foldl :: forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
with foldl @[] @Integer @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Foldable’))
foldr (_ :: Integer -> Integer -> Integer) (_ :: Integer)
where foldr :: forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
with foldr @[] @Integer @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Foldable’))
const (_ :: Integer)
where const :: forall a b. a -> b -> a
with const @Integer @[Integer]
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
($) (_ :: [Integer] -> Integer)
where ($) :: forall a b. (a -> b) -> a -> b
with ($) @GHC.Types.LiftedRep
@GHC.Types.LiftedRep
@[Integer]
@Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
($!) (_ :: [Integer] -> Integer)
where ($!) :: forall a b. (a -> b) -> a -> b
with ($!) @GHC.Types.LiftedRep @[Integer] @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
return (_ :: Integer)
where return :: forall (m :: * -> *) a. Monad m => a -> m a
with return @((->) [Integer]) @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
pure (_ :: Integer)
where pure :: forall (f :: * -> *) a. Applicative f => a -> f a
with pure @((->) [Integer]) @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
j (_ :: [Integer] -> Integer)
where j :: forall a. a -> a
with j @([Integer] -> Integer)
(bound at refinement_hole_fits.hs:10:1)
id (_ :: [Integer] -> Integer)
where id :: forall a. a -> a
with id @([Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
head (_ :: [[Integer] -> Integer])
where head :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
with head @([Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.List’))
last (_ :: [[Integer] -> Integer])
where last :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
with last @([Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.List’))
asTypeOf (_ :: [Integer] -> Integer) (_ :: [Integer] -> Integer)
where asTypeOf :: forall a. a -> a -> a
with asTypeOf @([Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
(!!) (_ :: [[Integer] -> Integer]) (_ :: Int)
where (!!) :: forall a.
GHC.Stack.Types.HasCallStack =>
[a] -> Int -> a
with (!!) @([Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.List’))
refinement_hole_fits.hs:7:5: warning: [GHC-88464] [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: Integer -> [Integer] -> Integer
• In the expression: _ 0
In an equation for ‘g’: g = _ 0
• Relevant bindings include
g :: [Integer] -> Integer (bound at refinement_hole_fits.hs:7:1)
Valid hole fits include
const :: forall a b. a -> b -> a
with const @Integer @[Integer]
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
return :: forall (m :: * -> *) a. Monad m => a -> m a
with return @((->) [Integer]) @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
pure :: forall (f :: * -> *) a. Applicative f => a -> f a
with pure @((->) [Integer]) @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
Valid refinement hole fits include
foldl (_ :: Integer -> Integer -> Integer)
where foldl :: forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
with foldl @[] @Integer @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Foldable’))
foldr (_ :: Integer -> Integer -> Integer)
where foldr :: forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
with foldr @[] @Integer @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Foldable’))
curry (_ :: (Integer, [Integer]) -> Integer)
where curry :: forall a b c. ((a, b) -> c) -> a -> b -> c
with curry @Integer @[Integer] @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘Data.Tuple’))
flip (_ :: [Integer] -> Integer -> Integer)
where flip :: forall a b c. (a -> b -> c) -> b -> a -> c
with flip @[Integer] @Integer @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
const (_ :: [Integer] -> Integer)
where const :: forall a b. a -> b -> a
with const @([Integer] -> Integer) @Integer
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
($) (_ :: Integer -> [Integer] -> Integer)
where ($) :: forall a b. (a -> b) -> a -> b
with ($) @GHC.Types.LiftedRep
@GHC.Types.LiftedRep
@Integer
@([Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
($!) (_ :: Integer -> [Integer] -> Integer)
where ($!) :: forall a b. (a -> b) -> a -> b
with ($!) @GHC.Types.LiftedRep @Integer @([Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
return (_ :: [Integer] -> Integer)
where return :: forall (m :: * -> *) a. Monad m => a -> m a
with return @((->) Integer) @([Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
pure (_ :: [Integer] -> Integer)
where pure :: forall (f :: * -> *) a. Applicative f => a -> f a
with pure @((->) Integer) @([Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
j (_ :: Integer -> [Integer] -> Integer)
where j :: forall a. a -> a
with j @(Integer -> [Integer] -> Integer)
(bound at refinement_hole_fits.hs:10:1)
id (_ :: Integer -> [Integer] -> Integer)
where id :: forall a. a -> a
with id @(Integer -> [Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
head (_ :: [Integer -> [Integer] -> Integer])
where head :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
with head @(Integer -> [Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.List’))
last (_ :: [Integer -> [Integer] -> Integer])
where last :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
with last @(Integer -> [Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.List’))
asTypeOf (_ :: Integer -> [Integer] -> Integer)
(_ :: Integer -> [Integer] -> Integer)
where asTypeOf :: forall a. a -> a -> a
with asTypeOf @(Integer -> [Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.Base’))
(!!) (_ :: [Integer -> [Integer] -> Integer]) (_ :: Int)
where (!!) :: forall a.
GHC.Stack.Types.HasCallStack =>
[a] -> Int -> a
with (!!) @(Integer -> [Integer] -> Integer)
(imported from ‘Prelude’ at refinement_hole_fits.hs:1:8-30
(and originally defined in ‘GHC.List’))
refinement_hole_fits.hs:10:7: warning: [GHC-88464] [-Wtyped-holes (in -Wdefault)]
• Found hole: _ :: a
Where: ‘a’ is a rigid type variable bound by
the type signature for:
j :: forall a. a -> a
at refinement_hole_fits.hs:9:1-11
• In an equation for ‘j’: j a = _
• Relevant bindings include
a :: a (bound at refinement_hole_fits.hs:10:3)
j :: a -> a (bound at refinement_hole_fits.hs:10:1)
Valid hole fits include
a :: a (bound at refinement_hole_fits.hs:10:3)
Valid refinement hole fits include
j (_ :: a)
where j :: a -> a
(bound at refinement_hole_fits.hs:10:1)
|
