1 CONTENUTO alluris.txt.OK:
3 matita tranne freescale e tests
15 Rocq tranne ails, coc, higman, ALGEBRA/CATEGORY_THEORY
16 Sophia-Antipolis tranne algebra, buchberger, math_groups, float, geometry
22 [CoRN: calcolo grafi da caricare troppo lento]
23 [Coq: calcolo grafi da caricare troppo lento]
24 [Sophia-Antipolis: calcolo grafi da caricare troppo lento]
26 CoRN: type-checking vecchio nucleo troppo lento
27 Rocq/AILS: type-checking vecchio nucleo troppo lento
28 Rocq/COC: type-checking vecchio nucleo troppo lento
29 nijmegen: type-checking vecchio nucleo troppo lento
30 Sophia-Antipolis/Float: vecchio nucleo troppo lento
31 Sophia-Antipolis/geometry: vecchio nucleo troppo lento
32 Rocq/ALGEBRA/CATEGORY_THEORY: vecchio nucleo troppo lento
34 matita/tests: nuovo nucleo problema con universi!!!
36 cic:/Rocq/ALGEBRA/CATEGORY_THEORY/LIMITS/FunForget_UA/UA_FM.con: 15.17s vs 0.14s vecchio nucleo!
37 coq: nuovo nucleo mooooolto lento in guarded by: cic:/Coq/ZArith/Zsqrt/sqrtrempos.con
38 orsay: nuovo nucleo diverge (vedi sopra)
39 Sophia-Antipolis/Buchberger: nuovo nucleo diverge
40 matita/freescale: nuovo nucleo diverge
41 Sophia-Antipolis/Algebra: nuovo nucleo diverge
43 lannion: nuovo nucleo impredicative set
44 rocq.higman: nuovo nucleo impredicative set
45 lyon.impredicative_set: nuovo nucleo impredicative set
47 ============= IMPREDICATIVE SET ======================
51 Lyon/CoinductiveExamples
53 Rocq/Paradoxes: Hurkens e Russell
54 Rocq/HistoricalExamples
57 ============= CONVERSIONE FIX GENERATIVI ================
58 cic:/Coq/IntMap/Lsort/alist_nth_ad_semantics.con
59 Appl: wrong application of le_S_n: the parameter H1 has type
60 le (S (S n0)) (length (prod ad A) (cons (prod ad A) (pair ad A a y) l0))
61 but it should have type
62 le (S (S n0)) (S (alist_nth_ad_semantics___1(0) A l0))
64 cic:/Suresnes/MiniC/Utilitaires/BlockDecl/bdecl_mapkSpec.con
65 Appl: wrong application of ...
66 (eq (prod (list Key) Data) (pair (list Key) Data lk d)
67 (pair (list Key) Data x0 x))
68 (In___1(0) (prod (list Key) Data) (pair (list Key) Data x0 x) lm), found or
69 (eq (prod (list Key) Data) (pair (list Key) Data lk d)
70 (pair (list Key) Data x0 x))
71 (bdecl_mapkSpec___1(0) Key Data (pair (list Key) Data x0 x) lm)
73 cic:/Dyade/Otway-Rees/inv1rel5/POinv1rel5.con
74 Appl: wrong application of AlreadyIn1: the parameter or_introl (eq C (B2C (K2B (KeyAB d0 d1))) (B2C (K2B (KeyAB d0 d1))))
75 (POinv1rel5___1(0) (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyAB))
76 (refl_equal C (B2C (K2B (KeyAB d0 d1)))) has type
77 or (eq C (B2C (K2B (KeyAB d0 d1))) (B2C (K2B (KeyAB d0 d1))))
78 (POinv1rel5___1(0) (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyAB))
79 but it should have type
80 In C (B2C (K2B (KeyAB d0 d1)))
81 (cons C (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyAB))
83 cic:/Dyade/Otway-Rees/invprel5/POinvprel5.con
84 Appl: wrong application of AlreadyIn1: the parameter or_introl (eq C (B2C (K2B (KeyAB d0 d1))) (B2C (K2B (KeyAB d0 d1))))
85 (POinv1rel5___1(0) (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyABminusKab))
86 (refl_equal C (B2C (K2B (KeyAB d0 d1)))) has type
87 or (eq C (B2C (K2B (KeyAB d0 d1))) (B2C (K2B (KeyAB d0 d1))))
88 (POinv1rel5___1(0) (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyABminusKab))
89 but it should have type
90 In C (B2C (K2B (KeyAB d0 d1)))
91 (cons C (B2C (K2B (KeyAB d0 d1))) (app C l rngDDKKeyABminusKab))
93 cic:/Coq/NArith/Pnat/Pmult_nat_l_plus_morphism.con
94 Branch for constructor xI :=
96 λn:nat. refl_equal nat (plus n (Pmult_nat (Pplus_carry p p0) (plus n n)))
97 has type ∀p0: positive.
99 eq nat (plus n (Pmult_nat (Pplus_carry p p0) (plus n n)))
100 (plus n (Pmult_nat (Pplus_carry p p0) (plus n n)))
101 not convertible with positive
104 eq nat (Pmult_nat (Pplus_carry (xI p) p0) n)
105 (plus n (Pmult_nat (Pplus (xI p) p0) n))) (xI __1)
107 cic:/Coq/NArith/Pnat/Pmult_nat_l_plus_morphism.con
108 has type ∀p0: positive.
110 eq nat (Pmult_nat (Pplus_carry p p0) (plus m m))
111 (plus (plus m (Pmult_nat p (plus m m)))
112 (plus m (Pmult_nat p0 (plus m m))))
113 not convertible with positive
116 eq nat (Pmult_nat (Pplus (xI p) p0) n)
117 (plus (Pmult_nat (xI p) n) (Pmult_nat p0 n))) (xI __1)
119 cic:/Coq/NArith/BinPos/Pplus_carry_spec.con
120 has type ∀p0: positive. eq positive (xI (Pplus_carry p p0)) (xI (Pplus_carry p p0))
121 not convertible with positive
123 eq positive (Pplus_carry (xI p) p0) (Psucc (Pplus (xI p) p0)))
126 cic:/Coq/NArith/BinPos/Pplus_comm.con
127 has type ∀p0: positive. eq positive (xO (Pplus_carry p p0)) (xO (Pplus_carry p0 p))
128 not convertible with positive
129 → (λp0:positive. eq positive (Pplus (xI p) p0) (Pplus p0 (xI p)))
132 cic:/Coq/NArith/BinPos/Pplus_succ_permute_r.con
133 has type ∀p0: positive.
134 eq positive (xI (Pplus p (Psucc p0))) (xI (Pplus_carry p p0))
135 not convertible with positive
137 eq positive (Pplus (xI p) (Psucc p0)) (Psucc (Pplus (xI p) p0)))
140 cic:/Coq/NArith/BinPos/Pplus_assoc.con
141 eq positive (xI (Pplus x1 (Pplus_carry y0 z0)))
142 (xI (Pplus (Pplus_carry x1 y0) z0))
143 not convertible with positive
145 eq positive (Pplus (xI x1) (Pplus (xI y0) p))
146 (Pplus (Pplus (xI x1) (xI y0)) p)) (xI __1)
148 cic:/Coq/NArith/BinPos/Pplus_reg_r.con
149 has type ∀y1: positive.
150 ∀H: eq positive (xO (Pplus_carry x1 z0)) (xO (Pplus_carry y1 z0)).
151 eq positive (xI x1) (xI y1)
152 not convertible with positive
154 eq positive (Pplus (xI x1) (xI z0)) (Pplus p (xI z0))
155 → eq positive (xI x1) p) (xI __1)
157 cic:/Coq/NArith/BinPos/ZL10.con
158 has type ∀q: positive.
159 ∀H: eq positive_mask (Pdouble_plus_one_mask (Pminus_mask p q)) (IsPos xH).
160 eq positive_mask (Pdouble_mask (Pminus_mask p q)) IsNul
161 not convertible with positive
163 eq positive_mask (Pminus_mask (xI p) p0) (IsPos xH)
164 → eq positive_mask (Pminus_mask_carry (xI p) p0) IsNul) (xO __1)
165 End: cic:/Coq/NArith/BinPos/ZL10.con
167 cic:/Coq/NArith/BinPos/Pminus_mask_Gt.con
168 has type ∀q: positive.
169 ∀H: eq comparison (Pcompare p q Eq) Gt.
172 and (eq positive_mask (Pdouble_mask (Pminus_mask p q)) (IsPos h))
175 match h return λp0:positive. positive
176 [ xI ⇒ λy':positive. xO (Pplus_carry q y')
177 | xO ⇒ λy':positive. xI (Pplus q y')
178 | xH ⇒ xO (Psucc q)] (xI p))
179 (or (eq positive h xH)
180 (eq positive_mask (Pdouble_plus_one_mask (Pminus_mask_carry p q))
181 (IsPos (Ppred h))))))
182 not convertible with positive
184 eq comparison (Pcompare (xI p) p0 Eq) Gt
187 and (eq positive_mask (Pminus_mask (xI p) p0) (IsPos h))
188 (and (eq positive (Pplus p0 h) (xI p))
189 (or (eq positive h xH)
190 (eq positive_mask (Pminus_mask_carry (xI p) p0)
191 (IsPos (Ppred h))))))) (xI __1)
193 cic:/Coq/NArith/BinPos/Pplus_diag.con
195 ∀IHx: eq positive (Pplus x0 x0) (xO x0).
196 eq positive (xO (Pplus_carry x0 x0)) (xO (xI x0))
197 but it should have type
199 eq positive (Pplus p p) (xO p)
200 → eq positive (Pplus (xI p) (xI p)) (xO (xI p))