1 CONTENUTO alluris.txt.OK, NEW typing, OLD typing
3 matita 11.89 11.71 tranne freescale e tests
10 Lyon impredicative set
17 Rocq impredicative set tranne ails, coc, higman,
18 ALGEBRA/CATEGORY_THEORY
19 Sophia-Antipolis tranne algebra, buchberger,
20 math_groups, float, geometry
26 file bug_universi.ma: sbaglia a fare il ranking!
28 [CoRN: calcolo grafi da caricare troppo lento]
29 [Coq: calcolo grafi da caricare troppo lento]
30 [Sophia-Antipolis: calcolo grafi da caricare troppo lento]
32 CoRN: type-checking vecchio nucleo troppo lento
33 Rocq/AILS: type-checking vecchio nucleo troppo lento
34 Rocq/COC: type-checking vecchio nucleo troppo lento
35 nijmegen: type-checking vecchio nucleo troppo lento
36 Sophia-Antipolis/Float: vecchio nucleo troppo lento
37 Sophia-Antipolis/geometry: vecchio nucleo troppo lento
38 Rocq/ALGEBRA/CATEGORY_THEORY: vecchio nucleo troppo lento
40 matita/tests: nuovo nucleo problema con universi!!!
42 Sophia-Antipolis/Algebra: nuovo nucleo diverge
43 cic:/Sophia-Antipolis/Algebra/Sub_module/submodule_op.con
44 Sophia-Antipolis/Buchberger: nuovo nucleo diverge
45 cic:/Sophia-Antipolis/Buchberger/BuchRed/redbuch_stable.con
46 matita/freescale: nuovo nucleo molto piu' lento del vecchio?
48 lannion: nuovo nucleo impredicative set
49 rocq.higman: nuovo nucleo impredicative set
50 lyon.impredicative_set: nuovo nucleo impredicative set
52 ============= IMPREDICATIVE SET ======================
56 Lyon/CoinductiveExamples
58 Rocq/Paradoxes: Hurkens e Russell
59 Rocq/HistoricalExamples
62 ============= CONVERSIONE FIX GENERATIVI ================
63 cic:/Coq/IntMap/Lsort/alist_nth_ad_semantics.con
64 Appl: wrong application of le_S_n: the parameter H1 has type
65 le (S (S n0)) (length (prod ad A) (cons (prod ad A) (pair ad A a y) l0))
66 but it should have type
67 le (S (S n0)) (S (alist_nth_ad_semantics___1(0) A l0))
69 cic:/Suresnes/MiniC/Utilitaires/BlockDecl/bdecl_mapkSpec.con
70 Appl: wrong application of ...
71 (eq (prod (list Key) Data) (pair (list Key) Data lk d)
72 (pair (list Key) Data x0 x))
73 (In___1(0) (prod (list Key) Data) (pair (list Key) Data x0 x) lm), found or
74 (eq (prod (list Key) Data) (pair (list Key) Data lk d)
75 (pair (list Key) Data x0 x))
76 (bdecl_mapkSpec___1(0) Key Data (pair (list Key) Data x0 x) lm)
78 cic:/Dyade/Otway-Rees/inv1rel5/POinv1rel5.con
79 Appl: wrong application of AlreadyIn1: the parameter or_introl (eq C (B2C (K2B (KeyAB d0 d1))) (B2C (K2B (KeyAB d0 d1))))
80 (POinv1rel5___1(0) (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyAB))
81 (refl_equal C (B2C (K2B (KeyAB d0 d1)))) has type
82 or (eq C (B2C (K2B (KeyAB d0 d1))) (B2C (K2B (KeyAB d0 d1))))
83 (POinv1rel5___1(0) (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyAB))
84 but it should have type
85 In C (B2C (K2B (KeyAB d0 d1)))
86 (cons C (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyAB))
88 cic:/Dyade/Otway-Rees/invprel5/POinvprel5.con
89 Appl: wrong application of AlreadyIn1: the parameter or_introl (eq C (B2C (K2B (KeyAB d0 d1))) (B2C (K2B (KeyAB d0 d1))))
90 (POinv1rel5___1(0) (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyABminusKab))
91 (refl_equal C (B2C (K2B (KeyAB d0 d1)))) has type
92 or (eq C (B2C (K2B (KeyAB d0 d1))) (B2C (K2B (KeyAB d0 d1))))
93 (POinv1rel5___1(0) (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyABminusKab))
94 but it should have type
95 In C (B2C (K2B (KeyAB d0 d1)))
96 (cons C (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyABminusKab))
98 cic:/Coq/NArith/Pnat/Pmult_nat_l_plus_morphism.con
99 Branch for constructor xI :=
101 λn:nat. refl_equal nat (plus n (Pmult_nat (Pplus_carry p p0) (plus n n)))
102 has type ∀p0: positive.
104 eq nat (plus n (Pmult_nat (Pplus_carry p p0) (plus n n)))
105 (plus n (Pmult_nat (Pplus_carry p p0) (plus n n)))
106 not convertible with positive
109 eq nat (Pmult_nat (Pplus_carry (xI p) p0) n)
110 (plus n (Pmult_nat (Pplus (xI p) p0) n))) (xI __1)
112 cic:/Coq/NArith/Pnat/Pmult_nat_l_plus_morphism.con
113 has type ∀p0: positive.
115 eq nat (Pmult_nat (Pplus_carry p p0) (plus m m))
116 (plus (plus m (Pmult_nat p (plus m m)))
117 (plus m (Pmult_nat p0 (plus m m))))
118 not convertible with positive
121 eq nat (Pmult_nat (Pplus (xI p) p0) n)
122 (plus (Pmult_nat (xI p) n) (Pmult_nat p0 n))) (xI __1)
124 cic:/Coq/NArith/BinPos/Pplus_carry_spec.con
125 has type ∀p0: positive. eq positive (xI (Pplus_carry p p0)) (xI (Pplus_carry p p0))
126 not convertible with positive
128 eq positive (Pplus_carry (xI p) p0) (Psucc (Pplus (xI p) p0)))
131 cic:/Coq/NArith/BinPos/Pplus_comm.con
132 has type ∀p0: positive. eq positive (xO (Pplus_carry p p0)) (xO (Pplus_carry p0 p))
133 not convertible with positive
134 → (λp0:positive. eq positive (Pplus (xI p) p0) (Pplus p0 (xI p)))
137 cic:/Coq/NArith/BinPos/Pplus_succ_permute_r.con
138 has type ∀p0: positive.
139 eq positive (xI (Pplus p (Psucc p0))) (xI (Pplus_carry p p0))
140 not convertible with positive
142 eq positive (Pplus (xI p) (Psucc p0)) (Psucc (Pplus (xI p) p0)))
145 cic:/Coq/NArith/BinPos/Pplus_assoc.con
146 eq positive (xI (Pplus x1 (Pplus_carry y0 z0)))
147 (xI (Pplus (Pplus_carry x1 y0) z0))
148 not convertible with positive
150 eq positive (Pplus (xI x1) (Pplus (xI y0) p))
151 (Pplus (Pplus (xI x1) (xI y0)) p)) (xI __1)
153 cic:/Coq/NArith/BinPos/Pplus_reg_r.con
154 has type ∀y1: positive.
155 ∀H: eq positive (xO (Pplus_carry x1 z0)) (xO (Pplus_carry y1 z0)).
156 eq positive (xI x1) (xI y1)
157 not convertible with positive
159 eq positive (Pplus (xI x1) (xI z0)) (Pplus p (xI z0))
160 → eq positive (xI x1) p) (xI __1)
162 cic:/Coq/NArith/BinPos/ZL10.con
163 has type ∀q: positive.
164 ∀H: eq positive_mask (Pdouble_plus_one_mask (Pminus_mask p q)) (IsPos xH).
165 eq positive_mask (Pdouble_mask (Pminus_mask p q)) IsNul
166 not convertible with positive
168 eq positive_mask (Pminus_mask (xI p) p0) (IsPos xH)
169 → eq positive_mask (Pminus_mask_carry (xI p) p0) IsNul) (xO __1)
170 End: cic:/Coq/NArith/BinPos/ZL10.con
172 cic:/Coq/NArith/BinPos/Pminus_mask_Gt.con
173 has type ∀q: positive.
174 ∀H: eq comparison (Pcompare p q Eq) Gt.
177 and (eq positive_mask (Pdouble_mask (Pminus_mask p q)) (IsPos h))
180 match h return λp0:positive. positive
181 [ xI ⇒ λy':positive. xO (Pplus_carry q y')
182 | xO ⇒ λy':positive. xI (Pplus q y')
183 | xH ⇒ xO (Psucc q)] (xI p))
184 (or (eq positive h xH)
185 (eq positive_mask (Pdouble_plus_one_mask (Pminus_mask_carry p q))
186 (IsPos (Ppred h))))))
187 not convertible with positive
189 eq comparison (Pcompare (xI p) p0 Eq) Gt
192 and (eq positive_mask (Pminus_mask (xI p) p0) (IsPos h))
193 (and (eq positive (Pplus p0 h) (xI p))
194 (or (eq positive h xH)
195 (eq positive_mask (Pminus_mask_carry (xI p) p0)
196 (IsPos (Ppred h))))))) (xI __1)
198 cic:/Coq/NArith/BinPos/Pplus_diag.con
200 ∀IHx: eq positive (Pplus x0 x0) (xO x0).
201 eq positive (xO (Pplus_carry x0 x0)) (xO (xI x0))
202 but it should have type
204 eq positive (Pplus p p) (xO p)
205 → eq positive (Pplus (xI p) (xI p)) (xO (xI p))