on ca34dec help sign in
368 lines 8.5 kB history raw
1reg001.idr:2:1-9:
2 |
32 | foo a a x = x
4 | ~~~~~~~~~
5When checking left hand side of foo:
6Can't match on foo a a x
8reg002.idr:3:1-19:
9 |
103 | append (X :: XS) ys = X :: append XS ys
11 | ~~~~~~~~~~~~~~~~~~~
12When checking left hand side of append:
13When checking argument x to constructor Prelude.List.:::
14 X is not a valid name for a pattern variable
16reg003a.idr:4:13-38:
17 |
184 | ECons : Nat -> OddList -> EvenList
19 | ~~~~~~~~~~~~~~~~~~~~~~~~~~
20When checking type of Main.ECons:
21No such variable OddList
23reg003a.idr:7:13-38:
24 |
257 | OCons : Nat -> EvenList -> OddList
26 | ~~~~~~~~~~~~~~~~~~~~~~~~~~
27When checking type of Main.OCons:
28No such variable EvenList
30reg003a.idr:9:6:
31 |
329 | test : EvenList
33 | ^
34When checking type of Main.test:
35No such variable EvenList
37reg006.idr:17:1-23:
38 |
3917 | lookup k Leaf = Nothing
40 | ~~~~~~~~~~~~~~~~~~~~~~~
41RBTree.lookup is possibly not total due to recursive path RBTree.lookup --> RBTree.lookup
43reg007.lidr:8:3-13:
44 |
458 | > A.n = Z -- This is where it's at!
46 | ~~~~~~~~~~~
47A.n is already defined
49reg007.lidr:12:13-18:
50 |
5112 | > hurrah = isSame
52 | ~~~~~~
53When checking right hand side of hurrah with expected type
54 0 = 1
56Type mismatch between
57 n = lala (Type of isSame)
58and
59 0 = 1 (Expected type)
61Specifically:
62 Type mismatch between
63 1
64 and
65 0
67reg010.idr:5:3-26:
68 |
695 | unsafeSubst P x x px | _ = px
70 | ~~~~~~~~~~~~~~~~~~~~~~~~
71When checking left hand side of with block in usubst.unsafeSubst:
72Can't match on with block in usubst.unsafeSubst warg a P x x px
74reg018a.idr:16:1-18:
75 |
7616 | minusCoNat Z n = Z
77 | ~~~~~~~~~~~~~~~~~~
78conat.minusCoNat is possibly not total due to recursive path conat.minusCoNat --> conat.minusCoNat
80reg018a.idr:21:1-42:
81 |
8221 | loopForever = minusCoNat infinity infinity
83 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
84conat.loopForever is possibly not total due to: conat.minusCoNat
86reg018b.idr:8:1-28:
87 |
888 | showB (I x) = "I" ++ showB x
89 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
90A.showB is possibly not total due to recursive path A.showB --> A.showB
92reg018b.idr:11:1-6:
93 |
9411 | Show B where show = showB
95 | ~~~~~~
96A.B implementation of Prelude.Show.Show is possibly not total due to: A.showB
98reg018c.idr:21:1-22:21:
99 |
10021 | inf (x :: xs) with (hdtl xs)
101 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ...
102CodataTest.inf is possibly not total due to: with block in CodataTest.inf
104reg018d.idr:8:1-39:
105 |
1068 | pull {n=Z} _ (x :: xs) = (x, xs)
107 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
108Main.pull is not total as there are missing cases
110reg023.idr:7:7:
111 |
1127 | bad = Z
113 | ^
114When checking right hand side of bad with expected type
115 f Nat
117Type mismatch between
118 Nat (Type of 0)
119and
120 f Nat (Expected type)
122reg028.idr:5:1-9:
123 |
1245 | bad Z = Z
125 | ~~~~~~~~~
126tbad.bad is possibly not total due to: with block in tbad.bad
128reg028a.idr:17:14-18:
129 |
13017 | qsortLemma = proof
131 | ~~~~~
132This style of tactic proof is deprecated. See %runElab for the replacement.
134reg028a.idr:11:1-14:
135 |
13611 | qsort' [] = []
137 | ~~~~~~~~~~~~~~
138tbad.qsort' is possibly not total due to: with block in tbad.qsort'
140reg034.idr:6:1-14:
141 |
1426 | bar xs xs Refl = Refl
143 | ~~~~~~~~~~~~~~
144When checking left hand side of bar:
145Can't match on bar xs xs Refl
147reg034.idr:9:1-14:
148 |
1499 | foo f x x Refl = Refl
150 | ~~~~~~~~~~~~~~
151When checking left hand side of foo:
152Can't match on foo f x x Refl
154reg035b.idr:8:14-38:
155 |
1568 | fins Z = ([] ** (finZEmpty {a=_}))
157 | ~~~~~~~~~~~~~~~~~~~~~~~~~
158No such variable __pi_arg
160reg044.idr:4:6-10:
161 |
1624 | pf = proof
163 | ~~~~~
164This style of tactic proof is deprecated. See %runElab for the replacement.
166reg044.idr:4:6-6:13:
167 |
1684 | pf = proof
169 | ~~~~~ ...
170When checking right hand side of Main.pf with expected type
171 (b : Nat) -> (a : Nat) -> (S a = S b) -> a = b
173Type mismatch between
174 b = b (Type of Refl)
175and
176 a = b (Expected type)
178Specifically:
179 Type mismatch between
180 b
181 and
182 a
184reg049.idr:2:11-14:
185 |
1862 | Bogus : Void
187 | ~~~~
188When checking constructor Main.Bogus:
189Void is not Main.Foo
191reg049.idr:5:8-12:
192 |
1935 | uhOh = Bogus
194 | ~~~~~
195When checking right hand side of uhOh with expected type
196 Void
198No such variable Bogus
200badbangop.idr:7:1:
201 |
2027 | (!) : List a -> Nat -> Maybe a
203 | ^
204! is not a valid operator
206baddoublebang.idr:6:28:
207 |
2086 | doubleBang mmn = do pure !!mmn
209 | ^
210unexpected Operator without known fixity: !!
212reg054.idr:18:1-17:
213 |
21418 | inf (MkInfer _ Z) = True
215 | ~~~~~~~~~~~~~~~~~
216When checking left hand side of inf:
217When checking an application of constructor Main.MkInfer:
218 Attempting concrete match on polymorphic argument: 0
220reg054.idr:34:1-18:
221 |
22234 | weird {x = Char} y = '5'
223 | ~~~~~~~~~~~~~~~~~~
224When checking left hand side of weird:
225No explicit types on left hand side: Char
227reg054.idr:37:1-30:
228 |
22937 | weird' {x = Prelude.Nat.Nat} y = Z
230 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
231When checking left hand side of weird':
232No explicit types on left hand side: Nat
234reg054.idr:40:1-7:
235 |
23640 | tctrick (Just x) = x
237 | ~~~~~~~
238When checking left hand side of tctrick:
239When checking an application of Main.tctrick:
240 Type mismatch between
241 Maybe a1 (Type of Just x)
242 and
243 a (Expected type)
245reg055.idr:5:1-7:
246 |
2475 | g (f Z) = 1
248 | ~~~~~~~
249When checking left hand side of g:
250Can't match on g (f 0)
252reg055.idr:8:1-5:
253 |
2548 | h x x = x
255 | ~~~~~
256When checking left hand side of h:
257Can't match on h x x
259reg055a.idr:8:1-18:
260 |
2618 | foo (CAny Nothing) = 42
262 | ~~~~~~~~~~~~~~~~~~
263When checking left hand side of foo:
264When checking an application of constructor Foo.CAny:
265 Attempting concrete match on polymorphic argument: Nothing
267reg055a.idr:13:1-23:
268 |
26913 | apply (\x => \y => x) a = a
270 | ~~~~~~~~~~~~~~~~~~~~~~~
271When checking left hand side of Foo.apply:
272Can't match on apply (\x, y => x) a
274reg056.idr:7:16-25:
275 |
2767 | dodgy n m Refl impossible
277 | ~~~~~~~~~~
278dodgy n m Refl is a valid case
280reg056.idr:10:11-20:
281 |
28210 | nonk Refl impossible
283 | ~~~~~~~~~~
284nonk Refl is a valid case
286reg068.idr:1:6-8:
287 |
2881 | data nat : Type where --error
289 | ~~~
290Main.nat has a name which may be implicitly bound.
291This is likely to lead to problems!
293reg068.idr:2:8-10:
294 |
2952 | ze : nat --hello.idr:10:6:When checking constructor Main.ze: !!V 0!! is not Main.nat
296 | ~~~
297Main.ze has a name which may be implicitly bound.
298This is likely to lead to problems!
300reg068.idr:2:8-10:
301 |
3022 | ze : nat --hello.idr:10:6:When checking constructor Main.ze: !!V 0!! is not Main.nat
303 | ~~~
304nat is bound as an implicit
305 Did you mean to refer to Main.nat?
307reg068.idr:2:8-10:
308 |
3092 | ze : nat --hello.idr:10:6:When checking constructor Main.ze: !!V 0!! is not Main.nat
310 | ~~~
311When checking constructor Main.ze:
312Type level variable nat is not Main.nat
314Mod.idr:11:1-22:
315 |
31611 | natexp k = S (natfn k)
317 | ~~~~~~~~~~~~~~~~~~~~~~
318public export Mod.natexp can't refer to export Mod.natfn
320reg070.idr:7:1-7:
321 |
3227 | Show Te where
323 | ~~~~~~~
324Test_show.Te implementation of Prelude.Show.Show is possibly not total due to: Prelude.Show.Test_show.Te implementation of Prelude.Show.Show, method show
326reg076.idr:8:1:
327 |
3288 | <end of file>
329 | ^
330Missing fixity declaration for Main.:>
332reg077.idr:3:1:
333 |
3343 | <end of file>
335 | ^
336Missing fixity declaration for Main.:>>
338DoubleEquality.idr:4:83-103:
339 |
3404 | oops = the ((False = True) -> Void) (\Refl impossible) $ cong {f = (>0) . (1/)} $ the (-0.0 = 0.0) Refl
341 | ~~~~~~~~~~~~~~~~~~~~~
342When checking right hand side of oops with expected type
343 Void
345When checking argument value to function Prelude.Basics.the:
346 Type mismatch between
347 x = x (Type of Refl)
348 and
349 -0.0 = 0.0 (Expected type)
351 Specifically:
352 Type mismatch between
353 -0.0
354 and
355 0.0
357Canonicity.idr:9:1-9:
358 |
3599 | f Nil = 0
360 | ~~~~~~~~~
361Canonicity.f is not total as there are missing cases
363Canonicity.idr:12:1-20:
364 |
36512 | NaN = f (Cons 0 Nil)
366 | ~~~~~~~~~~~~~~~~~~~~
367Canonicity.NaN is possibly not total due to: Canonicity.f