on master help sign in
Add blank line after "large" messages
commit79351ee7aeeeb4a88162b5685a89c04c91691613 authorJason Felice <jason.m.felice@gmail.com> dateWed 6 Dec 2017, 10:28 (9 years ago) parent6e98ac1
65 files changed+198−1
src/Idris/Output.hs+1−1 test/basic002/expected+2 test/basic006/expected+1 test/basic009/expected+3 test/basic017/expected+1 test/basic018/expected+3 test/directives001/expected+6 test/directives002/expected+1 test/effects003/expected+1 test/error001/expected+1 test/error003/expected+1 test/error004/expected+2 test/error005/expected+5 test/error006/expected+1 test/error007/expected+1 test/error008/expected+2 test/ffi002/expected+1 test/interfaces008/expected+1 test/layout001/expected+1 test/literate001/expected+1 test/meta002/expected+3 test/meta003/expected+1 test/meta004/expected+1 test/proof001/expected+2 test/proof002/expected+4 test/proof003/expected+6 test/proof007/expected+1 test/proof008/expected+1 test/proof011/expected+2 test/quasiquote003/expected+1 test/quasiquote004/expected+4 test/quasiquote006/expected+3 test/reg017/expected+2 test/reg027/expected+1 test/regression002/expected+43 test/sourceLocation001/expected+4 test/syntax001/expected+2 test/totality001/expected+3 test/totality002/expected+3 test/totality003/expected+1 test/totality004/expected+2 test/totality006/expected+3 test/totality007/expected+1 test/totality008/expected+1 test/totality009/expected+10 test/totality010/expected+2 test/totality011/expected+1 test/totality012/expected+2 test/totality013/expected+2 test/totality014/expected+1 test/totality015/expected+3 test/totality016/expected+9 test/totality017/expected+6 test/totality018/expected+1 test/totality019/expected+2 test/totality020/expected+2 test/totality021/expected+5 test/totality022/expected+1 test/totality023/expected+1 test/tutorial002/expected+3 test/tutorial004/expected+2 test/tutorial006/expected+2 test/unique004/expected+10 test/universes001/expected+1 test/universes002/expected+1
src/Idris/Output.hs+1−1
@@ -98,7 +98,7 @@ iWarn fc err =
9898 layoutSource _ _ = Nothing
9999
100100 layoutWarning :: OutputDoc -> Maybe OutputDoc -> OutputDoc -> OutputDoc
101− layoutWarning loc (Just src) err = loc <$$> src <$$> err
101+ layoutWarning loc (Just src) err = loc <$$> src <$$> err <$$> empty
102102 layoutWarning loc Nothing err = loc </> err
103103
104104
test/basic002/expected+2
@@ -3,9 +3,11 @@ test006.idr:25:23-27:
3325 | Main.parity_lemma_2 = proof {
44 | ~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67test006.idr:32:23-27:
78 |
8932 | Main.parity_lemma_1 = proof {
910 | ~~~~~
1011This style of tactic proof is deprecated. See %runElab for the replacement.
12+
1113[False, True, False, True, False, True]
test/basic006/expected+1
@@ -10,5 +10,6 @@ When checking an application of function Prelude.List.reverse:
1010 Vect n a (Type of xs)
1111 and
1212 List a (Expected type)
13+
1314[3, 2, 1]
1415"Number 42"
test/basic009/expected+3
@@ -5,6 +5,7 @@ Faulty.idr:6:9-11:
55 | ~~~
66num is bound as an implicit
77 Did you mean to refer to A.num?
8+
89Faulty.idr:7:7-12:
910 |
10117 | fault = Refl
@@ -22,8 +23,10 @@ Specifically:
2223 0
2324 and
2425 num
26+
2527Multiple.idr:3:21:
2628 |
27293 | import Data.Vect as X
2830 | ^
2931import alias not unique: "X"
32+
test/basic017/expected+1
@@ -5,3 +5,4 @@ basic017a.idr:11:8:
55When checking type of Main.append:
66When checking an application of Main.Vect:
77 No such variable n
8+
test/basic018/expected+3
@@ -4,12 +4,14 @@ basic018.idr:7:12-16:
44 | ~~~~~
55thing is bound as an implicit
66 Did you mean to refer to Main.thing?
7+
78basic018.idr:12:8-12:
89 |
91012 | test : thing = S 41
1011 | ~~~~~
1112thing is bound as an implicit
1213 Did you mean to refer to Main.thing?
14+
1315basic018.idr:13:6-11:
1416 |
151713 | test = Refl
@@ -27,3 +29,4 @@ Specifically:
2729 42
2830 and
2931 thing
32+
test/directives001/expected+6
@@ -4,33 +4,39 @@ directives001.idr:14:7:
44 | ^
55Use of deprecated name directives001.Foo
66To be replaced with `Bar`.
7+
78directives001.idr:14:7:
89 |
91014 | mkFoo : String -> Foo
1011 | ^
1112Use of deprecated name directives001.Foo
1213To be replaced with `Bar`.
14+
1315directives001.idr:15:7-13:
1416 |
151715 | mkFoo = MkFoo
1618 | ~~~~~~~
1719Use of deprecated name directives001.Foo
1820To be replaced with `Bar`.
21+
1922directives001.idr:15:7-13:
2023 |
212415 | mkFoo = MkFoo
2225 | ~~~~~~~
2326Use of deprecated name directives001.Foo
2427To be replaced with `Bar`.
28+
2529directives001.idr:26:8-28:28:
2630 |
273126 | main = do
2832 | ~~~~ ...
2933Use of a fragile construct directives001.mkBar
3034How `Bar`s are to be created is still being discussed, `mkBar` is subject to change.
35+
3136directives001.idr:26:8-28:28:
3237 |
333826 | main = do
3439 | ~~~~ ...
3540Use of a fragile construct directives001.mkBar
3641How `Bar`s are to be created is still being discussed, `mkBar` is subject to change.
42+
test/directives002/expected+1
@@ -3,3 +3,4 @@ directives002.idr:12:3-14:28:
3312 | main = do
44 | ~~~~~~~~~ ...
55directives002.Main.main is possibly not total due to: directives002.loop
6+
test/effects003/expected+1
@@ -3,6 +3,7 @@ hangman.idr:204:8-12:
33204 | wlen = proof search
44 | ~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67------------
78
896 guesses left
test/error001/expected+1
@@ -10,3 +10,4 @@ Universe inconsistency.
1010 ConstraintFC {uconstraint = ./test002.idr.z <= ./test002.idr.a1, ufc = test002.idr:1:6}
1111 ConstraintFC {uconstraint = ./test002.idr.y < ./test002.idr.z, ufc = test002.idr:1:6}
1212 ConstraintFC {uconstraint = ./test002.idr.z <= ./test002.idr.a1, ufc = test002.idr:1:6}
13+
test/error003/expected+1
@@ -6,3 +6,4 @@ When checking right hand side of bad with expected type
66 Tm [] TUnit
77
88DSL type error: (t(504) => t'(503)) doesn't match ()
9+
test/error004/expected+2
@@ -7,6 +7,7 @@ When checking right hand side of badCadr1 with expected type
77
88When checking argument cons2 to function FunErrTest.cadr:
99 Could not prove that [] has at least two elements.
10+
1011FunErrTest.idr:38:12-19:
1112 |
121338 | badCadr2 = cadr [1]
@@ -16,3 +17,4 @@ When checking right hand side of badCadr2 with expected type
1617
1718When checking argument cons2 to function FunErrTest.cadr:
1819 Could not prove that [] has at least two elements.
20+
test/error005/expected+5
@@ -8,6 +8,7 @@ When checking right hand side of two with expected type
88When checking argument prf to function Data.Fin.fromInteger:
99 When using 2 as a literal for a Fin 2
1010 2 is not strictly less than 2
11+
1112error005.idr:14:12:
1213 |
131414 | hahaha n = 0
@@ -18,6 +19,7 @@ When checking right hand side of hahaha with expected type
1819When checking argument prf to function Data.Fin.fromInteger:
1920 When using 0 as a literal for a Fin n
2021 0 is not strictly less than n
22+
2123error005.idr:20:11:
2224 |
232520 | notOk n = 2
@@ -28,6 +30,7 @@ When checking right hand side of notOk with expected type
2830When checking argument prf to function Data.Fin.fromInteger:
2931 When using 2 as a literal for a Fin (S (S n))
3032 2 is not strictly less than S (S n)
33+
3134error005.idr:23:12-24:
3235 |
333623 | b0rken n = fromInteger n
@@ -39,6 +42,7 @@ When checking argument prf to function Data.Fin.fromInteger:
3942 When using n as a literal for a Fin 3
4043 Could not show that n is less than 3 because n is a bound
4144 variable instead of a constant Integer
45+
4246error005.idr:26:17:
4347 |
444826 | x = the (Fin 4) 5
@@ -49,3 +53,4 @@ When checking right hand side of x with expected type
4953When checking argument prf to function Data.Fin.fromInteger:
5054 When using 5 as a literal for a Fin 4
5155 5 is not strictly less than 4
56+
test/error006/expected+1
@@ -4,3 +4,4 @@ WithPatsNoWith.idr:4:1-13:
44 | ~~~~~~~~~~~~~
55When checking left hand side of foo:
66unexpected patterns outside of "with" block
7+
test/error007/expected+1
@@ -16,3 +16,4 @@ When checking argument code to function Main.send_page:
1616 Bits32
1717 and
1818 Int
19+
test/error008/expected+2
@@ -4,9 +4,11 @@ error008.idr:3:4:
44 | ^
55When checking type of Main.s2:
66Can't disambiguate name: Prelude.List.Nil, Data.Vect.Nil
7+
78error008a.idr:3:4:
89 |
9103 | s1 : Num a => {x : a} -> x + sum {a} Nil = x -- * fromInteger 0
1011 | ^
1112When checking type of Main.s1:
1213Can't disambiguate name: Prelude.List.Nil, Data.Vect.Nil
14+
test/ffi002/expected+1
@@ -3,3 +3,4 @@ test023.idr:20:26-36:
3320 | %provide (t : Type) with badProvider
44 | ~~~~~~~~~~~
55Type provider error: Always fails
6+
test/interfaces008/expected+1
@@ -3,3 +3,4 @@ interfaces008.idr:20:18-23:
3320 | implementation Foo2 a where
44 | ~~~~~~
55Default implementations must be for a super interface constraint on the containing interface.
6+
test/layout001/expected+1
@@ -67,6 +67,7 @@ When checking right hand side of term with expected type
6767
6868When checking an application of function Prelude.Applicative.pure:
6969 No such variable f
70+
7071./mplus2.idr:17:37:
7172 |
727317 | `mplus` pure f
test/literate001/expected+1
@@ -3,6 +3,7 @@
331 | Broken
44 | ^
55Program line next to comment
6+
67'a'
78'd'
89zabcdefg
test/meta002/expected+3
@@ -4,6 +4,7 @@ DataDef.idr:74:1-8:
44 | ~~~~~~~~
55While running an elaboration script, the following error occurred:
66Prelude.Either.Either is already defined as a datatype.
7+
78Tacs.idr:299:15-300:78:
89 |
910299 | testElab3 = %runElab (elaborateSTLC (App (Lam "x" (App (Var 0) (Var 0)))
@@ -12,6 +13,7 @@ When checking right hand side of testElab3 with expected type
1213 DPair Ty (Tm [])
1314
1415Unifying ty and ARR ty t would lead to infinite value
16+
1517AgdaStyleReflection.idr:315:5-20:
1618 |
1719315 | baz = tactic trivial
@@ -20,3 +22,4 @@ When checking right hand side of baz with expected type
2022 (Nat, Void)
2123
2224PROOF SEARCH FAILURE is not defined.
25+
test/meta003/expected+1
@@ -7,3 +7,4 @@ Type mismatch between
77 ()
88and
99 String
10+
test/meta004/expected+1
@@ -4,3 +4,4 @@ meta004.idr:50:1-8:
44 | ~~~~~~~~
55While running an elaboration script, the following error occurred:
66Not an impossible case
7+
test/proof001/expected+2
@@ -3,8 +3,10 @@ test029.idr:29:25-29:
3329 | simple.append_lemma_2 = proof {
44 | ~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67test029.idr:36:25-29:
78 |
8936 | simple.append_lemma_1 = proof {
910 | ~~~~~
1011This style of tactic proof is deprecated. See %runElab for the replacement.
12+
test/proof002/expected+4
@@ -3,16 +3,19 @@ Reflect.idr:175:21-25:
33175 | Reflect.appRExpr1 = proof {
44 | ~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67Reflect.idr:184:21-25:
78 |
89184 | Reflect.appRExpr2 = proof {
910 | ~~~~~
1011This style of tactic proof is deprecated. See %runElab for the replacement.
12+
1113Reflect.idr:192:15-19:
1214 |
1315192 | Reflect.bp1 = proof {
1416 | ~~~~~
1517This style of tactic proof is deprecated. See %runElab for the replacement.
18+
1619test030a.idr:12:26-37:
1720 |
182112 | testReflect1 {a} xs ys = AssocProof a
@@ -31,3 +34,4 @@ When checking an application of function Reflect.getJust:
3134 Just x
3235 and
3336 Nothing
37+
test/proof003/expected+6
@@ -3,31 +3,37 @@ Parity.idr:17:18-22:
3317 | parity_lemma_2 = proof {
44 | ~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67Parity.idr:24:18-22:
78 |
8924 | parity_lemma_1 = proof {
910 | ~~~~~
1011This style of tactic proof is deprecated. See %runElab for the replacement.
12+
1113test015.idr:88:15-19:
1214 |
131588 | Main.ntbOdd = proof {
1416 | ~~~~~
1517This style of tactic proof is deprecated. See %runElab for the replacement.
18+
1619test015.idr:97:16-20:
1720 |
182197 | Main.ntbEven = proof {
1922 | ~~~~~
2023This style of tactic proof is deprecated. See %runElab for the replacement.
24+
2125test015.idr:107:20-24:
2226 |
2327107 | Main.adc_lemma_2 = proof {
2428 | ~~~~~
2529This style of tactic proof is deprecated. See %runElab for the replacement.
30+
2631test015.idr:142:20-24:
2732 |
2833142 | Main.adc_lemma_1 = proof {
2934 | ~~~~~
3035This style of tactic proof is deprecated. See %runElab for the replacement.
36+
313700101010
323801011001
3339010000011
test/proof007/expected+1
@@ -7,3 +7,4 @@ When checking right hand side of test with expected type
77
88When checking argument arg to function DefaultArgUnknownName.funWithBadDefArg:
99 No such variable sadgjhsag
10+
test/proof008/expected+1
@@ -3,3 +3,4 @@ ClaimAndUnfocus.idr:8:27-31:
338 | ClaimAndUnfocus.foo_rhs = proof
44 | ~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
test/proof011/expected+2
@@ -11,6 +11,7 @@ rewriting xs ++ ys ++ xs to (xs ++ ys) ++ xs did not change type x ::
1111 x ::
1212 (xs ++ ys) ++
1313 zs
14+
1415proof011a.idr:14:5-37:
1516 |
161714 | = rewrite vassoc xs ys xs in Refl
@@ -24,3 +25,4 @@ rewriting xs ++ ys ++ xs to (xs ++ ys) ++ xs did not change type x ::
2425 x ::
2526 (xs ++ ys) ++
2627 zs
28+
test/quasiquote003/expected+1
@@ -6,3 +6,4 @@ When checking right hand side of zzz with expected type
66 TT
77
88No such variable k
9+
test/quasiquote004/expected+4
@@ -3,16 +3,19 @@ Quasiquote004.idr:39:26-30:
3339 | Quasiquote004.getMeNat = proof
44 | ~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67Quasiquote004.idr:42:28-32:
78 |
8942 | Quasiquote004.fizzyIsAOK = proof
910 | ~~~~~
1011This style of tactic proof is deprecated. See %runElab for the replacement.
12+
1113Quasiquote004.idr:50:27-31:
1214 |
131550 | Quasiquote004.getMeNat' = proof
1416 | ~~~~~
1517This style of tactic proof is deprecated. See %runElab for the replacement.
18+
1619Quasiquote004.idr:50:25-51:18:
1720 |
182150 | Quasiquote004.getMeNat' = proof
@@ -21,3 +24,4 @@ When checking right hand side of Quasiquote004.getMeNat' with expected type
2124 String
2225
2326Not a Nat goal
27+
test/quasiquote006/expected+3
@@ -7,6 +7,7 @@ When checking right hand side of b with expected type
77
88Can't disambiguate name: ForeignEnv.Nil,
99 Prelude.List.Nil
10+
1011quasiquote006.idr:12:3-17:
1112 |
121312 | c = `{alsdkjflkj}
@@ -15,6 +16,7 @@ When checking right hand side of c with expected type
1516 TTName
1617
1718No such variable alsdkjflkj
19+
1820quasiquote006.idr:15:3-11:
1921 |
202215 | d = `{(::)}
@@ -25,4 +27,5 @@ When checking right hand side of d with expected type
2527Can't disambiguate name: ForeignEnv.::,
2628 Prelude.List.::,
2729 Prelude.Stream.::
30+
2831 quasiquote006.idr:17:3:Main.d already defined
test/reg017/expected+2
@@ -3,9 +3,11 @@ reg017.idr:5:17-23:
335 | { default tactics { refine Refl; solve; } prfA : a = a } ->
44 | ~~~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67reg017.idr:8:17-23:
78 |
898 | { default tactics { refine Refl; solve; } prfBC : b = c } ->
910 | ~~~~~~~
1011This style of tactic proof is deprecated. See %runElab for the replacement.
12+
11134
test/reg027/expected+1
@@ -4,3 +4,4 @@ reg027a.idr:9:16-30:
449 | implementation Show (Int -> b) where
55 | ~~~~~~~~~~~~~~~
66Overlapping implementation: Show (Int -> a) already defined
7+
test/regression002/expected+43
@@ -4,28 +4,33 @@ reg003a.idr:4:13-38:
44 | ~~~~~~~~~~~~~~~~~~~~~~~~~~
55When checking type of Main.ECons:
66No such variable OddList
7+
78reg003a.idr:7:13-38:
89 |
9107 | OCons : Nat -> EvenList -> OddList
1011 | ~~~~~~~~~~~~~~~~~~~~~~~~~~
1112When checking type of Main.OCons:
1213No such variable EvenList
14+
1315reg003a.idr:9:6:
1416 |
15179 | test : EvenList
1618 | ^
1719When checking type of Main.test:
1820No such variable EvenList
21+
1922reg006.idr:17:1-23:
2023 |
212417 | lookup k Leaf = Nothing
2225 | ~~~~~~~~~~~~~~~~~~~~~~~
2326RBTree.lookup is possibly not total due to recursive path RBTree.lookup --> RBTree.lookup
27+
2428reg007.lidr:8:3-13:
2529 |
26308 | > A.n = Z -- This is where it's at!
2731 | ~~~~~~~~~~~
2832A.n is already defined
33+
2934reg007.lidr:12:13-18:
3035 |
313612 | > hurrah = isSame
@@ -43,42 +48,50 @@ Specifically:
4348 1
4449 and
4550 0
51+
4652reg010.idr:5:3-26:
4753 |
48545 | unsafeSubst P x x px | _ = px
4955 | ~~~~~~~~~~~~~~~~~~~~~~~~
5056When checking left hand side of with block in usubst.unsafeSubst:
5157Can't match on with block in usubst.unsafeSubst warg a P x x px
58+
5259reg018a.idr:16:1-18:
5360 |
546116 | minusCoNat Z n = Z
5562 | ~~~~~~~~~~~~~~~~~~
5663conat.minusCoNat is possibly not total due to recursive path conat.minusCoNat --> conat.minusCoNat
64+
5765reg018a.idr:21:1-42:
5866 |
596721 | loopForever = minusCoNat infinity infinity
6068 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6169conat.loopForever is possibly not total due to: conat.minusCoNat
70+
6271reg018b.idr:8:1-28:
6372 |
64738 | showB (I x) = "I" ++ showB x
6574 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6675A.showB is possibly not total due to recursive path A.showB --> A.showB
76+
6777reg018b.idr:11:1-6:
6878 |
697911 | Show B where show = showB
7080 | ~~~~~~
7181A.B implementation of Prelude.Show.Show is possibly not total due to: A.showB
82+
7283reg018c.idr:21:1-22:21:
7384 |
748521 | inf (x :: xs) with (hdtl xs)
7586 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ...
7687CodataTest.inf is possibly not total due to: with block in CodataTest.inf
88+
7789reg018d.idr:8:1-39:
7890 |
79918 | pull {n=Z} _ (x :: xs) = (x, xs)
8092 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
8193Main.pull is not total as there are missing cases
94+
8295reg023.idr:7:5-7:
8396 |
84977 | bad = Z
@@ -90,43 +103,51 @@ Type mismatch between
90103 Nat (Type of 0)
91104and
92105 f Nat (Expected type)
106+
93107reg028.idr:5:1-9:
94108 |
951095 | bad Z = Z
96110 | ~~~~~~~~~
97111tbad.bad is possibly not total due to: with block in tbad.bad
112+
98113reg028a.idr:17:14-18:
99114 |
10011517 | qsortLemma = proof
101116 | ~~~~~
102117This style of tactic proof is deprecated. See %runElab for the replacement.
118+
103119reg028a.idr:11:1-14:
104120 |
10512111 | qsort' [] = []
106122 | ~~~~~~~~~~~~~~
107123tbad.qsort' is possibly not total due to: with block in tbad.qsort'
124+
108125reg034.idr:6:1-14:
109126 |
1101276 | bar xs xs Refl = Refl
111128 | ~~~~~~~~~~~~~~
112129When checking left hand side of bar:
113130Can't match on bar xs xs Refl
131+
114132reg034.idr:9:1-14:
115133 |
1161349 | foo f x x Refl = Refl
117135 | ~~~~~~~~~~~~~~
118136When checking left hand side of foo:
119137Can't match on foo f x x Refl
138+
120139reg035b.idr:8:12-38:
121140 |
1221418 | fins Z = ([] ** (finZEmpty {a=_}))
123142 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~
124143No such variable __pi_arg
144+
125145reg044.idr:4:6-10:
126146 |
1271474 | pf = proof
128148 | ~~~~~
129149This style of tactic proof is deprecated. See %runElab for the replacement.
150+
130151reg044.idr:4:4-6:13:
131152 |
1321534 | pf = proof
@@ -144,12 +165,14 @@ Specifically:
144165 b
145166 and
146167 a
168+
147169reg049.idr:2:11-14:
148170 |
1491712 | Bogus : Void
150172 | ~~~~
151173When checking constructor Main.Bogus:
152174Void is not Main.Foo
175+
153176reg049.idr:5:6-12:
154177 |
1551785 | uhOh = Bogus
@@ -158,6 +181,7 @@ When checking right hand side of uhOh with expected type
158181 Void
159182
160183No such variable Bogus
184+
161185./badbangop.idr:7:1:
162186 |
1631877 | (!) : List a -> Nat -> Maybe a
@@ -177,18 +201,21 @@ reg054.idr:18:1-17:
177201When checking left hand side of inf:
178202When checking an application of constructor Main.MkInfer:
179203 Attempting concrete match on polymorphic argument: 0
204+
180205reg054.idr:34:1-18:
181206 |
18220734 | weird {x = Char} y = '5'
183208 | ~~~~~~~~~~~~~~~~~~
184209When checking left hand side of weird:
185210No explicit types on left hand side: Char
211+
186212reg054.idr:37:1-30:
187213 |
18821437 | weird' {x = Prelude.Nat.Nat} y = Z
189215 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
190216When checking left hand side of weird':
191217No explicit types on left hand side: Nat
218+
192219reg054.idr:40:1-7:
193220 |
19422140 | tctrick (Just x) = x
@@ -199,18 +226,21 @@ When checking an application of Main.tctrick:
199226 Maybe a1 (Type of Just x)
200227 and
201228 a (Expected type)
229+
202230reg055.idr:5:1-7:
203231 |
2042325 | g (f Z) = 1
205233 | ~~~~~~~
206234When checking left hand side of g:
207235Can't match on g (f 0)
236+
208237reg055.idr:8:1-5:
209238 |
2102398 | h x x = x
211240 | ~~~~~
212241When checking left hand side of h:
213242Can't match on h x x
243+
214244reg055a.idr:8:1-18:
215245 |
2162468 | foo (CAny Nothing) = 42
@@ -218,56 +248,66 @@ reg055a.idr:8:1-18:
218248When checking left hand side of foo:
219249When checking an application of constructor Foo.CAny:
220250 Attempting concrete match on polymorphic argument: Nothing
251+
221252reg055a.idr:13:1-23:
222253 |
22325413 | apply (\x => \y => x) a = a
224255 | ~~~~~~~~~~~~~~~~~~~~~~~
225256When checking left hand side of Foo.apply:
226257Can't match on apply (\x, y => x) a
258+
227259reg056.idr:7:16-25:
228260 |
2292617 | dodgy n m Refl impossible
230262 | ~~~~~~~~~~
231263dodgy n m Refl is a valid case
264+
232265reg056.idr:10:11-20:
233266 |
23426710 | nonk Refl impossible
235268 | ~~~~~~~~~~
236269nonk Refl is a valid case
270+
237271reg068.idr:1:6-8:
238272 |
2392731 | data nat : Type where --error
240274 | ~~~
241275Main.nat has a name which may be implicitly bound.
242276This is likely to lead to problems!
277+
243278reg068.idr:2:8-10:
244279 |
2452802 | ze : nat --hello.idr:10:6:When checking constructor Main.ze: !!V 0!! is not Main.nat
246281 | ~~~
247282Main.ze has a name which may be implicitly bound.
248283This is likely to lead to problems!
284+
249285reg068.idr:2:8-10:
250286 |
2512872 | ze : nat --hello.idr:10:6:When checking constructor Main.ze: !!V 0!! is not Main.nat
252288 | ~~~
253289nat is bound as an implicit
254290 Did you mean to refer to Main.nat?
291+
255292reg068.idr:2:8-10:
256293 |
2572942 | ze : nat --hello.idr:10:6:When checking constructor Main.ze: !!V 0!! is not Main.nat
258295 | ~~~
259296When checking constructor Main.ze:
260297Type level variable nat is not Main.nat
298+
261299Mod.idr:11:1-22:
262300 |
26330111 | natexp k = S (natfn k)
264302 | ~~~~~~~~~~~~~~~~~~~~~~
265303public export Mod.natexp can't refer to export Mod.natfn
304+
266305reg070.idr:7:1-7:
267306 |
2683077 | Show Te where
269308 | ~~~~~~~
270309Test_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
310+
271311./reg076.idr:8:1:
272312 |
2733138 | <empty line>
@@ -298,13 +338,16 @@ When checking argument value to function Prelude.Basics.the:
298338 -0.0
299339 and
300340 0.0
341+
301342Canonicity.idr:9:1-9:
302343 |
3033449 | f Nil = 0
304345 | ~~~~~~~~~
305346Canonicity.f is not total as there are missing cases
347+
306348Canonicity.idr:12:1-20:
307349 |
30835012 | NaN = f (Cons 0 Nil)
309351 | ~~~~~~~~~~~~~~~~~~~~
310352Canonicity.NaN is possibly not total due to: Canonicity.f
353+
test/sourceLocation001/expected+4
@@ -3,21 +3,25 @@ SourceLoc.idr:12:19-25:
3312 | getLoc : {default tactics { sourceLocation } x : SourceLocation} -> SourceLocation
44 | ~~~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67SourceLoc.idr:21:19-23:
78 |
8921 | fromProofScript = proof sourceLocation
910 | ~~~~~
1011This style of tactic proof is deprecated. See %runElab for the replacement.
12+
1113SourceLoc.idr:41:20-26:
1214 |
131541 | Die : {default tactics { sourceLocation } loc : SourceLocation} -> Tm ctxt t
1416 | ~~~~~~~
1517This style of tactic proof is deprecated. See %runElab for the replacement.
18+
1619SourceLoc.idr:99:18-22:
1720 |
182199 | SourceLoc.meta = proof
1922 | ~~~~~
2023This style of tactic proof is deprecated. See %runElab for the replacement.
24+
2125Testing using definition
2226FileLoc "SourceLoc.idr" (17, 11) (17, 16)
2327Testing using inline tactics
test/syntax001/expected+2
@@ -10,6 +10,7 @@ When checking an application of function Prelude.Interfaces.+:
1010 String (Type of "argh")
1111 and
1212 Nat (Expected type)
13+
1314SyntaxTest.idr:5:7-18:
1415 |
15165 | foo = fnord "argh"
@@ -22,3 +23,4 @@ When checking an application of function Prelude.Interfaces.+:
2223 String (Type of "argh")
2324 and
2425 Nat (Expected type)
26+
test/totality001/expected+3
@@ -3,13 +3,16 @@ test010.idr:15:1-30:
3315 | foo (MkBad f i) = f (MkBad' i)
44 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
55Main.foo is possibly not total due to: Main.MkBad
6+
67test010a.idr:9:1-23:
78 |
899 | bar = MkBad (\x => 3) 3
910 | ~~~~~~~~~~~~~~~~~~~~~~~
1011main.bar is possibly not total due to: main.MkBad
12+
1113test010b.idr:9:1-23:
1214 |
13159 | bar = MkBad (\x => 3) 3
1416 | ~~~~~~~~~~~~~~~~~~~~~~~
1517main.bar is possibly not total due to: main.MkBad
18+
test/totality002/expected+3
@@ -3,13 +3,16 @@ test017.idr:94:26-30:
3394 | maxCommutativeStepCase = proof {
44 | ~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67test017a.idr:7:1-24:
78 |
897 | vtrans [] _ = []
910 | ~~~~~~~~~~~~~~~~~~~~~~~~
1011scg.vtrans is possibly not total due to recursive path scg.vtrans --> scg.vtrans
12+
1113test017b.idr:4:1-9:
1214 |
13154 | foo = foo
1416 | ~~~~~~~~~
1517foo.foo is possibly not total due to recursive path foo.foo
18+
test/totality003/expected+1
@@ -3,3 +3,4 @@ totality003a.idr:5:1-13:
335 | qsort [] = []
44 | ~~~~~~~~~~~~~
55smaller.qsort is possibly not total due to recursive path smaller.qsort --> smaller.qsort --> smaller.qsort
6+
test/totality004/expected+2
@@ -4,8 +4,10 @@ totality004a.idr:13:1-44:
4413 | process (Get f) (x :: xs) = process (f x) xs
55 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
66Main.process is possibly not total due to recursive path Main.process --> Main.process --> Main.process
7+
78totality004a.idr:24:1-60:
89 |
91024 | main = printLn (take 10 (process doubleInt (countStream 1)))
1011 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1112Main.main is possibly not total due to: Main.process
13+
test/totality006/expected+3
@@ -3,13 +3,16 @@ totality006.idr:8:1-29:
338 | prf Z Z Oh impossible
44 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
55Main.prf is not total as there are missing cases
6+
67totality006a.idr:11:21-30:
78 |
8911 | prf' (S _) (S _) Oh impossible
910 | ~~~~~~~~~~
1011prf' (S _) (S _) Oh is a valid case
12+
1113totality006b.idr:10:1-34:
1214 |
131510 | blargh [] (y :: xs) so = absurd so
1416 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1517totality006b.blargh is not total as there are missing cases
18+
test/totality007/expected+1
@@ -4,5 +4,6 @@ Totality.idr:4:1-9:
444 | foo Z = Z
55 | ~~~~~~~~~
66Totality.foo is not total as there are missing cases
7+
78Totality.idr:4:1-9:Could not build: Totality.foo is not total as there are missing cases
89Leaving directory `./src'
test/totality008/expected+1
@@ -3,3 +3,4 @@ totality008.idr:7:1-14:
337 | ElimT _ C1 = 3
44 | ~~~~~~~~~~~~~~
55Main.ElimT is possibly not total due to: Main.C2
6+
test/totality009/expected+10
@@ -3,48 +3,58 @@ TestLambdaPossible.idr:9:25-34:
339 | wrongPossible = (\Flase impossible)
44 | ~~~~~~~~~~
55Warning - TestLambdaPossible.case block in wrongPossible at TestLambdaPossible.idr:9:25-34 is not total as there are missing cases
6+
67TestLambdaPossible.idr:9:1-35:
78 |
899 | wrongPossible = (\Flase impossible)
910 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1011Warning - TestLambdaPossible.wrongPossible is possibly not total due to: TestLambdaPossible.case block in wrongPossible at TestLambdaPossible.idr:9:25-34
12+
1113TestLambdaPossible.idr:12:25:
1214 |
131512 | wrongPossible' x = case x of
1416 | ^
1517Warning - TestLambdaPossible.case block in wrongPossible' at TestLambdaPossible.idr:12:25 is not total as there are missing cases
18+
1619TestLambdaPossible.idr:12:1-13:40:
1720 |
182112 | wrongPossible' x = case x of
1922 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ...
2023Warning - TestLambdaPossible.wrongPossible' is possibly not total due to: TestLambdaPossible.case block in wrongPossible' at TestLambdaPossible.idr:12:25
24+
2125TestLambdaPossible.idr:9:15-35:
2226 |
23279 | wrongPossible = (\Flase impossible)
2428 | ~~~~~~~~~~~~~~~~~~~~~
2529Warning - TestLambdaPossible.case block in wrongPossible at TestLambdaPossible.idr:9:25-34 is not total as there are missing cases
30+
2631TestLambdaPossible.idr:9:1-35:
2732 |
28339 | wrongPossible = (\Flase impossible)
2934 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
3035Warning - TestLambdaPossible.wrongPossible is possibly not total due to: TestLambdaPossible.case block in wrongPossible at TestLambdaPossible.idr:9:25-34
36+
3137TestLambdaPossible.idr:12:18-13:40:
3238 |
333912 | wrongPossible' x = case x of
3440 | ~~~~~~~~~~~ ...
3541Warning - TestLambdaPossible.case block in wrongPossible' at TestLambdaPossible.idr:12:25 is not total as there are missing cases
42+
3643TestLambdaPossible.idr:12:1-13:40:
3744 |
384512 | wrongPossible' x = case x of
3946 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ...
4047Warning - TestLambdaPossible.wrongPossible' is possibly not total due to: TestLambdaPossible.case block in wrongPossible' at TestLambdaPossible.idr:12:25
48+
4149TestLambdaPossible2.idr:10:1-35:
4250 |
435110 | wrongPossible = (\Flase impossible)
4452 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
4553TestLambdaPossible.wrongPossible is possibly not total due to: TestLambdaPossible.case block in wrongPossible at TestLambdaPossible2.idr:10:25-34
54+
4655TestLambdaPossible2.idr:14:1-15:40:
4756 |
485714 | wrongPossible' x = case x of
4958 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ...
5059TestLambdaPossible.wrongPossible' is possibly not total due to: TestLambdaPossible.case block in wrongPossible' at TestLambdaPossible2.idr:14:25
60+
test/totality010/expected+2
@@ -3,8 +3,10 @@ totality010.idr:27:1-35:
3327 | evenNotS MkEven ZeroEven impossible
44 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
55Main.evenNotS is not total as there are missing cases
6+
67totality010.idr:30:1-40:
78 |
8930 | bad = evenNotS ZeroEven $ MkBad ZeroEven
910 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1011Main.bad is possibly not total due to: Main.evenNotS
12+
test/totality011/expected+1
@@ -3,3 +3,4 @@ totality011.lidr:22:3-57:
3322 | > weCanOnlyGetOlder {t'' = Z} {t = Z} _ _ _ = LTEZero
44 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
55Main.weCanOnlyGetOlder is not total as there are missing cases
6+
test/totality012/expected+2
@@ -3,8 +3,10 @@ totality012a.idr:9:1-10:27:
339 | echo2 x = if (x == "quit") then PutStr "Bye!\n"
44 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ...
55Main.echo2 is possibly not total due to recursive path Main.echo2 --> Main.echo2
6+
67totality012b.idr:11:1-17:33:
78 |
8911 | echo = do PutStr "$ "
910 | ~~~~~~~~~~~~~~~~~~~~~ ...
1011Main.echo is possibly not total due to recursive path Main.echo
12+
test/totality013/expected+2
@@ -3,8 +3,10 @@ totality013a.idr:5:3-49:
335 | foo order x xs y ys _ = mtot order (x :: xs) ys
44 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
55Main.foo is possibly not total due to recursive path Main.foo --> Main.mtot --> Main.mtot --> Main.mtot
6+
67totality013a.idr:9:3-36:
78 |
899 | mtot order [] right = right
910 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1011Main.mtot is possibly not total due to: Main.foo
12+
test/totality014/expected+1
@@ -10,3 +10,4 @@ Universe inconsistency.
1010 ConstraintFC {uconstraint = ./totality014.idr.w < ./totality014.idr.u, ufc = totality014.idr:1:6-9}
1111 ConstraintFC {uconstraint = ./totality014.idr.w < ./totality014.idr.u, ufc = totality014.idr:1:6-9}
1212 ConstraintFC {uconstraint = ./totality014.idr.u <= ./totality014.idr.w, ufc = totality014.idr:6:27-29}
13+
test/totality015/expected+3
@@ -3,13 +3,16 @@ totality015a.idr:52:3-53:
3352 | quiz (num1 :: num2 :: nums) score = quiz nums score
44 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
55Main.quiz is possibly not total due to recursive path Main.quiz --> Main.quiz
6+
67totality015a.idr:42:3-44:36:
78 |
8942 | correct nums score
910 | ~~~~~~~~~~~~~~~~~~ ...
1011Main.correct is possibly not total due to: Main.quiz
12+
1113totality015a.idr:47:3-49:28:
1214 |
131547 | wrong nums ans score
1416 | ~~~~~~~~~~~~~~~~~~~~ ...
1517Main.wrong is possibly not total due to: Main.quiz
18+
test/totality016/expected+9
@@ -3,43 +3,52 @@ totality016.idr:15:1-21:
3315 | f1 (MkTP T1 x) = True
44 | ~~~~~~~~~~~~~~~~~~~~~
55Main.f1 is not total as there are missing cases
6+
67totality016.idr:19:1-24:
78 |
8919 | f2 (MkTP T1 x, _) = True
910 | ~~~~~~~~~~~~~~~~~~~~~~~~
1011Main.f2 is not total as there are missing cases
12+
1113totality016.idr:23:1-29:
1214 |
131523 | f3 ((MkTP T1 x, _), _) = True
1416 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1517Main.f3 is not total as there are missing cases
18+
1619totality016.idr:27:1-14:
1720 |
182127 | g1 T1 x = True
1922 | ~~~~~~~~~~~~~~
2023Main.g1 is not total as there are missing cases
24+
2125totality016.idr:31:1-17:
2226 |
232731 | g2 (T1, x) = True
2428 | ~~~~~~~~~~~~~~~~~
2529Main.g2 is not total as there are missing cases
30+
2631totality016.idr:35:1-16:
2732 |
283335 | h1 True x = True
2934 | ~~~~~~~~~~~~~~~~
3035Main.h1 is not total as there are missing cases
36+
3137totality016.idr:39:1-19:
3238 |
333939 | h2 (True, x) = True
3440 | ~~~~~~~~~~~~~~~~~~~
3541Main.h2 is not total as there are missing cases
42+
3643totality016.idr:43:1-25:
3744 |
384543 | h3 (MkTP2 (T1, x)) = True
3946 | ~~~~~~~~~~~~~~~~~~~~~~~~~
4047Main.h3 is not total as there are missing cases
48+
4149totality016.idr:47:1-30:
4250 |
435147 | h4 (MkTP2 (T1, x), _) _ = True
4452 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
4553Main.h4 is not total as there are missing cases
54+
test/totality017/expected+6
@@ -3,28 +3,34 @@ totality017.idr:19:1-15:
3319 | g1 T1 T1 = True
44 | ~~~~~~~~~~~~~~~
55Main.g1 is not total as there are missing cases
6+
67totality017.idr:25:1-17:
78 |
8925 | g2 T1' T1' = True
910 | ~~~~~~~~~~~~~~~~~
1011Main.g2 is not total as there are missing cases
12+
1113totality017.idr:31:1-13:
1214 |
131531 | g3 T1' = True
1416 | ~~~~~~~~~~~~~
1517Main.g3 is not total as there are missing cases
18+
1619totality017.idr:37:1-36:
1720 |
182137 | g4 (MkTTPP (MkPP 0) (MkPP 0)) = True
1922 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2023Main.g4 is not total as there are missing cases
24+
2125totality017.idr:42:1-11:
2226 |
232742 | f' 0 = True
2428 | ~~~~~~~~~~~
2529Main.f' is not total as there are missing cases
30+
2631totality017.idr:47:1-17:
2732 |
283347 | f (MkPP 0) = True
2934 | ~~~~~~~~~~~~~~~~~
3035Main.f is not total as there are missing cases
36+
test/totality018/expected+1
@@ -3,3 +3,4 @@ totality018.idr:12:1-10:
3312 | bar FZ = 0
44 | ~~~~~~~~~~
55Main.bar is not total as there are missing cases
6+
test/totality019/expected+2
@@ -3,8 +3,10 @@ totality019.idr:8:1-36:
338 | testCov False False = ?testCov_rhs_3
44 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
55Main.testCov is not total as there are missing cases
6+
67totality019.idr:12:1-42:
78 |
8912 | testCov' (False ** False) = ?testCov_rhs_3
910 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1011Main.testCov' is not total as there are missing cases
12+
test/totality020/expected+2
@@ -3,8 +3,10 @@ totality020.idr:4:14-23:
334 | bug _ _ Refl impossible
44 | ~~~~~~~~~~
55bug _ _ Refl is a valid case
6+
67totality020.idr:7:14-23:
78 |
897 | foo a b Refl impossible
910 | ~~~~~~~~~~
1011foo a b Refl is a valid case
12+
test/totality021/expected+5
@@ -3,23 +3,28 @@ totality021.idr:8:1-67:
338 | sLevelNotSLevel' (SL (Delay level)) p = sLevelNotSLevel' level Refl
44 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
55Main.sLevelNotSLevel' is possibly not total due to recursive path Main.sLevelNotSLevel' --> Main.sLevelNotSLevel'
6+
67totality021.idr:12:1-66:
78 |
8912 | sLevelNotSLevel (SL (Delay level)) p = sLevelNotSLevel' level Refl
910 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1011Main.sLevelNotSLevel is possibly not total due to: Main.sLevelNotSLevel'
12+
1113totality021.idr:18:1-26:
1214 |
131518 | v = sLevelNotSLevel l Refl
1416 | ~~~~~~~~~~~~~~~~~~~~~~~~~~
1517Main.v is possibly not total due to: Main.sLevelNotSLevel
18+
1619totality021a.idr:9:1-37:
1720 |
18219 | noNonEmptyPointInt {n} Nil impossible
1922 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2023Main.noNonEmptyPointInt is not total as there are missing cases
24+
2125totality021a.idr:12:1-31:
2226 |
232712 | myVoid = noNonEmptyPointInt [2]
2428 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2529Main.myVoid is possibly not total due to: Main.noNonEmptyPointInt
30+
test/totality022/expected+1
@@ -3,3 +3,4 @@ totality022.idr:7:20-29:
337 | f _ [] (RSnoc _ _) impossible -- = ?wat
44 | ~~~~~~~~~~
55f _ [] (RSnoc _ _) is a valid case
6+
test/totality023/expected+1
@@ -3,3 +3,4 @@ totality023.idr:9:1-10:27:
339 | run (Do x f) = do r <- x
44 | ~~~~~~~~~~~~~~~~~~~~~~~~ ...
55Main.run is possibly not total due to recursive path Main.run --> Main.run
6+
test/tutorial002/expected+3
@@ -3,13 +3,16 @@ tutorial002.idr:41:25-29:
3341 | Main.natToBin_lemma_1 = proof
44 | ~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67tutorial002.idr:48:18-22:
78 |
8948 | parity_lemma_1 = proof
910 | ~~~~~
1011This style of tactic proof is deprecated. See %runElab for the replacement.
12+
1113tutorial002.idr:54:18-22:
1214 |
131554 | parity_lemma_2 = proof {
1416 | ~~~~~
1517This style of tactic proof is deprecated. See %runElab for the replacement.
18+
test/tutorial004/expected+2
@@ -3,8 +3,10 @@ tutorial004.idr:46:14-18:
3346 | plusredZ_S = proof {
44 | ~~~~~
55This style of tactic proof is deprecated. See %runElab for the replacement.
6+
67tutorial004.idr:53:14-18:
78 |
8953 | plusredZ_Z = proof {
910 | ~~~~~
1011This style of tactic proof is deprecated. See %runElab for the replacement.
12+
test/tutorial006/expected+2
@@ -16,6 +16,7 @@ When checking argument xs to constructor Data.Vect.:::
1616 plus len len
1717 and
1818 plus len m
19+
1920tutorial006b.idr:10:37-50:
2021 |
212210 | parity (S (S (j + j))) | Even = Even {n=S j}
@@ -33,3 +34,4 @@ Specifically:
3334 plus (S j) (S j)
3435 and
3536 S (S (plus j j))
37+
test/unique004/expected+10
@@ -6,6 +6,7 @@ Type mismatch between
66 Int -> String
77and
88 UniqueType (Int -> String)
9+
910unique001a.idr:46:15-54:28:
1011 |
111246 | showStuff' xs = do
@@ -14,6 +15,7 @@ Type mismatch between
1415 Int -> String
1516and
1617 UniqueType (Int -> String)
18+
1719unique001a.idr:57:15-62:33:
1820 |
192157 | showThings xs = do
@@ -22,31 +24,37 @@ Type mismatch between
2224 UniqueType (Int -> String)
2325and
2426 Int -> String
27+
2528unique001b.idr:18:17-42:
2629 |
273018 | showU (x :: xs) = show x ++ "," ++ free xs
2831 | ~~~~~~~~~~~~~~~~~~~~~~~~~~
2932Borrowed name xs must not be used on RHS
33+
3034unique001c.idr:47:12-62:
3135 |
323647 | ndup {a} x = (\f : Int -> a => MkUPair (f 0) (f 1)) (uconst x)
3337 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
3438Unique name f is used more than once
39+
3540unique001d.idr:4:16-18:
3641 |
37424 | steal (Read x) = x
3843 | ~~~
3944Borrowed name x must not be used on RHS
45+
4046unique001e.idr:4:12-40:
4147 |
42484 | Nil : {a : UniqueType} -> BadList a
4349 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
4450Constructor Main.Nil has a UniqueType, but the data type does not
51+
4552unique002.idr:17:8-20:19:
4653 |
475417 | foo xs = do -- let f = \x : Int => showU xs
4855 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ...
4956Unique name xs is used more than once
57+
5058unique002a.idr:17:8-20:19:
5159 |
526017 | foo xs = do let f = \x : Int => showU xs
@@ -55,6 +63,7 @@ Type mismatch between
5563 Int -> String
5664and
5765 UniqueType (Int -> String)
66+
5867unique003.idr:20:8-24:19:
5968 |
606920 | foo xs = do let f = \x : Int => showU xs -- can't build this in unique context
@@ -63,3 +72,4 @@ Type mismatch between
6372 Int -> String
6473and
6574 UniqueType (Int -> String)
75+
test/universes001/expected+1
@@ -11,3 +11,4 @@ Universe inconsistency.
1111 ConstraintFC {uconstraint = ./universes001.idr.x < ./universes001.idr.y, ufc = universes001.idr:1:6-8}
1212 ConstraintFC {uconstraint = ./universes001.idr.z < ./universes001.idr.x, ufc = universes001.idr:1:6-8}
1313 ConstraintFC {uconstraint = ./universes001.idr.x <= ./universes001.idr.z, ufc = universes001.idr:7:5-21}
14+
test/universes002/expected+1
@@ -11,3 +11,4 @@ Universe inconsistency.
1111 ConstraintFC {uconstraint = ./universes002.idr.b1 < ./universes002.idr.c1, ufc = universes002.idr:3:6-10}
1212 ConstraintFC {uconstraint = ./universes002.idr.b1 <= ./universes002.idr.e7, ufc = universes002.idr:45:9-48}
1313 ConstraintFC {uconstraint = ./universes002.idr.d1 <= ./universes002.idr.b1, ufc = universes002.idr:3:6-10}
14+