1 let print_metasenv metasenv =
2 String.concat "\n--------------------------\n"
3 (List.map (fun (i, context, term) ->
4 (string_of_int i) ^ " [\n" ^ (CicPp.ppcontext context) ^
5 "\n] " ^ (CicPp.ppterm term))
10 let print_subst subst =
13 (fun (i, (c, t, ty)) ->
14 Printf.sprintf "?%d -> %s : %s" i
15 (CicPp.ppterm t) (CicPp.ppterm ty))
19 (* (weight of constants, [(meta, weight_of_meta)]) *)
20 type weight = int * (int * int) list;;
22 let string_of_weight (cw, mw) =
25 (List.map (function (m, w) -> Printf.sprintf "(%d,%d)" m w) mw)
27 Printf.sprintf "[%d; %s]" cw s
30 let weight_of_term term =
31 (* ALB: what to consider as a variable? I think "variables" in our case are
32 Metas and maybe Rels... *)
34 let vars_dict = Hashtbl.create 5 in
35 let rec aux = function
36 | C.Meta (metano, _) ->
38 let oldw = Hashtbl.find vars_dict metano in
39 Hashtbl.replace vars_dict metano (oldw+1)
41 Hashtbl.add vars_dict metano 1);
46 | C.MutInd (_, _, ens)
47 | C.MutConstruct (_, _, _, ens) ->
48 List.fold_left (fun w (u, t) -> (aux t) + w) 1 ens
51 | C.Lambda (_, t1, t2)
53 | C.LetIn (_, t1, t2) ->
58 | C.Appl l -> List.fold_left (+) 0 (List.map aux l)
60 | C.MutCase (_, _, outt, t, pl) ->
63 let w3 = List.fold_left (+) 0 (List.map aux pl) in
67 List.fold_left (fun w (n, i, t1, t2) -> (aux t1) + (aux t2) + w) 1 fl
70 List.fold_left (fun w (n, t1, t2) -> (aux t1) + (aux t2) + w) 1 fl
76 Hashtbl.fold (fun meta metaw resw -> (meta, metaw)::resw) vars_dict [] in
79 | (m1, _), (m2, _) -> m2 - m1
81 (w, List.sort compare l) (* from the biggest meta to the smallest (0) *)
85 (* returns a "normalized" version of the polynomial weight wl (with type
86 * weight list), i.e. a list sorted ascending by meta number,
87 * from 0 to maxmeta. wl must be sorted descending by meta number. Example:
88 * normalize_weight 5 (3, [(3, 2); (1, 1)]) ->
89 * (3, [(1, 1); (2, 0); (3, 2); (4, 0); (5, 0)]) *)
90 let normalize_weight maxmeta (cw, wl) =
91 (* Printf.printf "normalize_weight: %d, %s\n" maxmeta *)
92 (* (string_of_weight (cw, wl)); *)
93 let rec aux = function
95 | m -> (m, 0)::(aux (m-1))
97 let tmpl = aux maxmeta in
100 (fun (m, _) (n, _) -> Pervasives.compare m n)
102 (fun res (m, w) -> (m, w)::(List.remove_assoc m res)) tmpl wl)
108 let normalize_weights (cw1, wl1) (cw2, wl2) =
109 let rec aux wl1 wl2 =
112 | (m, w)::tl1, (n, w')::tl2 when m = n ->
113 let res1, res2 = aux tl1 tl2 in
114 (m, w)::res1, (n, w')::res2
115 | (m, w)::tl1, ((n, w')::_ as wl2) when m < n ->
116 let res1, res2 = aux tl1 wl2 in
117 (m, w)::res1, (m, 0)::res2
118 | ((m, w)::_ as wl1), (n, w')::tl2 when m > n ->
119 let res1, res2 = aux wl1 tl2 in
120 (n, 0)::res1, (n, w')::res2
122 let res1, res2 = aux [] tl2 in
123 (n, 0)::res1, (n, w)::res2
125 let res1, res2 = aux tl1 [] in
126 (m, w)::res1, (m, 0)::res2
128 let cmp (m, _) (n, _) = compare m n in
129 let wl1, wl2 = aux (List.sort cmp wl1) (List.sort cmp wl2) in
130 (cw1, wl1), (cw2, wl2)
134 type comparison = Lt | Le | Eq | Ge | Gt | Incomparable;;
136 let string_of_comparison = function
142 | Incomparable -> "I"
145 let compare_weights ?(normalize=false)
146 ((h1, w1) as weight1) ((h2, w2) as weight2)=
147 let (h1, w1), (h2, w2) =
150 (* let maxmeta l = *)
152 (* match List.hd l with *)
154 (* with Failure _ -> 0 *)
156 (* max (maxmeta w1) (maxmeta w2) *)
158 (* (normalize_weight maxmeta (h1, w1)), (normalize_weight maxmeta (h2, w2)) *)
159 normalize_weights weight1 weight2
166 (fun ((lt, eq, gt), diffs) w1 w2 ->
168 | (meta1, w1), (meta2, w2) when meta1 = meta2 ->
169 let diffs = (w1 - w2) + diffs in
170 let r = compare w1 w2 in
171 if r < 0 then (lt+1, eq, gt), diffs
172 else if r = 0 then (lt, eq+1, gt), diffs
173 else (lt, eq, gt+1), diffs
174 | (meta1, w1), (meta2, w2) ->
175 Printf.printf "HMMM!!!! %s, %s\n"
176 (string_of_weight weight1) (string_of_weight weight2);
179 with Invalid_argument _ ->
180 Printf.printf "Invalid_argument: %s{%s}, %s{%s}, normalize = %s\n"
181 (string_of_weight (h1, w1)) (string_of_weight weight1)
182 (string_of_weight (h2, w2)) (string_of_weight weight2)
183 (string_of_bool normalize);
186 let hdiff = h1 - h2 in
190 else if hdiff > 0 then Gt
191 else Eq (* Incomparable *)
194 if m > 0 || hdiff < 0 then Lt
195 else if diffs >= (- hdiff) then Le else Incomparable
197 if diffs >= (- hdiff) then Le else Incomparable
200 if m > 0 || hdiff > 0 then Gt
201 else if (- diffs) >= hdiff then Ge else Incomparable
203 if (- diffs) >= hdiff then Ge else Incomparable
204 | (m, _, n) when m > 0 && n > 0 ->
209 let rec aux_ordering t1 t2 =
210 let module C = Cic in
211 let compare_uris u1 u2 =
213 compare (UriManager.string_of_uri u1) (UriManager.string_of_uri u2) in
215 else if res = 0 then Eq
220 | _, C.Meta _ -> Incomparable
222 | t1, t2 when t1 = t2 -> Eq
224 | C.Rel n, C.Rel m -> if n > m then Lt else Gt (* ALB: changed < to > *)
228 | C.Const (u1, _), C.Const (u2, _) -> compare_uris u1 u2
232 | C.MutInd (u1, _, _), C.MutInd (u2, _, _) -> compare_uris u1 u2
233 | C.MutInd _, _ -> Lt
234 | _, C.MutInd _ -> Gt
236 | C.MutConstruct (u1, _, _, _), C.MutConstruct (u2, _, _, _) ->
238 | C.MutConstruct _, _ -> Lt
239 | _, C.MutConstruct _ -> Gt
241 | C.Appl l1, C.Appl l2 ->
247 | hd1::tl1, hd2::tl2 ->
248 let o = aux_ordering hd1 hd2 in
249 if o = Eq then cmp tl1 tl2
255 Printf.printf "These two terms are not comparable:\n%s\n%s\n\n"
256 (CicPp.ppterm t1) (CicPp.ppterm t2);
261 (* w1, w2 are the weights, they should already be normalized... *)
262 let nonrec_kbo_w (t1, w1) (t2, w2) =
263 match compare_weights w1 w2 with
264 | Le -> if aux_ordering t1 t2 = Lt then Lt else Incomparable
265 | Ge -> if aux_ordering t1 t2 = Gt then Gt else Incomparable
266 | Eq -> aux_ordering t1 t2
271 let nonrec_kbo t1 t2 =
272 let w1 = weight_of_term t1 in
273 let w2 = weight_of_term t2 in
274 match compare_weights ~normalize:true w1 w2 with
275 | Le -> if aux_ordering t1 t2 = Lt then Lt else Incomparable
276 | Ge -> if aux_ordering t1 t2 = Gt then Gt else Incomparable
277 | Eq -> aux_ordering t1 t2
282 let names_of_context context =
286 | Some (n, e) -> Some n)
291 let string_of_equality ?env =
295 | _, (ty, left, right), _, _ ->
296 Printf.sprintf "{%s}: %s = %s" (CicPp.ppterm ty)
297 (CicPp.ppterm left) (CicPp.ppterm right)
299 | Some (_, context, _) -> (
300 let names = names_of_context context in
302 | _, (ty, left, right), _, _ ->
303 Printf.sprintf "{%s}: %s = %s" (CicPp.pp ty names)
304 (CicPp.pp left names) (CicPp.pp right names)