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 ?(prefix="\n") 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 ?(consider_metas=true) 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, _) when consider_metas ->
38 let oldw = Hashtbl.find vars_dict metano in
39 Hashtbl.replace vars_dict metano (oldw+1)
41 Hashtbl.add vars_dict metano 1);
43 | C.Meta _ -> 0 (* "variables" are lighter than constants and functions...*)
47 | C.MutInd (_, _, ens)
48 | C.MutConstruct (_, _, _, ens) ->
49 List.fold_left (fun w (u, t) -> (aux t) + w) 1 ens
52 | C.Lambda (_, t1, t2)
54 | C.LetIn (_, t1, t2) ->
59 | C.Appl l -> List.fold_left (+) 0 (List.map aux l)
61 | C.MutCase (_, _, outt, t, pl) ->
64 let w3 = List.fold_left (+) 0 (List.map aux pl) in
68 List.fold_left (fun w (n, i, t1, t2) -> (aux t1) + (aux t2) + w) 1 fl
71 List.fold_left (fun w (n, t1, t2) -> (aux t1) + (aux t2) + w) 1 fl
77 Hashtbl.fold (fun meta metaw resw -> (meta, metaw)::resw) vars_dict [] in
80 | (m1, _), (m2, _) -> m2 - m1
82 (w, List.sort compare l) (* from the biggest meta to the smallest (0) *)
86 let compute_equality_weight ty left right =
89 let w, m = (weight_of_term ~consider_metas:true(* false *) t) in
90 (* let mw = List.fold_left (fun mw (_, c) -> mw + 2 * c) 0 m in *)
91 (* metasw := !metasw + mw; *)
92 metasw := !metasw + (2 * (List.length m));
95 (weight_of ty) + (weight_of left) + (weight_of right) + !metasw
99 (* returns a "normalized" version of the polynomial weight wl (with type
100 * weight list), i.e. a list sorted ascending by meta number,
101 * from 0 to maxmeta. wl must be sorted descending by meta number. Example:
102 * normalize_weight 5 (3, [(3, 2); (1, 1)]) ->
103 * (3, [(1, 1); (2, 0); (3, 2); (4, 0); (5, 0)]) *)
104 let normalize_weight maxmeta (cw, wl) =
105 (* Printf.printf "normalize_weight: %d, %s\n" maxmeta *)
106 (* (string_of_weight (cw, wl)); *)
107 let rec aux = function
109 | m -> (m, 0)::(aux (m-1))
111 let tmpl = aux maxmeta in
114 (fun (m, _) (n, _) -> Pervasives.compare m n)
116 (fun res (m, w) -> (m, w)::(List.remove_assoc m res)) tmpl wl)
122 let normalize_weights (cw1, wl1) (cw2, wl2) =
123 let rec aux wl1 wl2 =
126 | (m, w)::tl1, (n, w')::tl2 when m = n ->
127 let res1, res2 = aux tl1 tl2 in
128 (m, w)::res1, (n, w')::res2
129 | (m, w)::tl1, ((n, w')::_ as wl2) when m < n ->
130 let res1, res2 = aux tl1 wl2 in
131 (m, w)::res1, (m, 0)::res2
132 | ((m, w)::_ as wl1), (n, w')::tl2 when m > n ->
133 let res1, res2 = aux wl1 tl2 in
134 (n, 0)::res1, (n, w')::res2
136 let res1, res2 = aux [] tl2 in
137 (n, 0)::res1, (n, w)::res2
139 let res1, res2 = aux tl1 [] in
140 (m, w)::res1, (m, 0)::res2
142 let cmp (m, _) (n, _) = compare m n in
143 let wl1, wl2 = aux (List.sort cmp wl1) (List.sort cmp wl2) in
144 (cw1, wl1), (cw2, wl2)
148 type comparison = Lt | Le | Eq | Ge | Gt | Incomparable;;
150 let string_of_comparison = function
156 | Incomparable -> "I"
159 let compare_weights ?(normalize=false)
160 ((h1, w1) as weight1) ((h2, w2) as weight2)=
161 let (h1, w1), (h2, w2) =
164 (* let maxmeta l = *)
166 (* match List.hd l with *)
168 (* with Failure _ -> 0 *)
170 (* max (maxmeta w1) (maxmeta w2) *)
172 (* (normalize_weight maxmeta (h1, w1)), (normalize_weight maxmeta (h2, w2)) *)
173 normalize_weights weight1 weight2
180 (fun ((lt, eq, gt), diffs) w1 w2 ->
182 | (meta1, w1), (meta2, w2) when meta1 = meta2 ->
183 let diffs = (w1 - w2) + diffs in
184 let r = compare w1 w2 in
185 if r < 0 then (lt+1, eq, gt), diffs
186 else if r = 0 then (lt, eq+1, gt), diffs
187 else (lt, eq, gt+1), diffs
188 | (meta1, w1), (meta2, w2) ->
189 Printf.printf "HMMM!!!! %s, %s\n"
190 (string_of_weight weight1) (string_of_weight weight2);
193 with Invalid_argument _ ->
194 Printf.printf "Invalid_argument: %s{%s}, %s{%s}, normalize = %s\n"
195 (string_of_weight (h1, w1)) (string_of_weight weight1)
196 (string_of_weight (h2, w2)) (string_of_weight weight2)
197 (string_of_bool normalize);
200 let hdiff = h1 - h2 in
204 else if hdiff > 0 then Gt
205 else Eq (* Incomparable *)
208 if m > 0 || hdiff < 0 then Lt
209 else if diffs >= (- hdiff) then Le else Incomparable
211 if diffs >= (- hdiff) then Le else Incomparable
214 if m > 0 || hdiff > 0 then Gt
215 else if (- diffs) >= hdiff then Ge else Incomparable
217 if (- diffs) >= hdiff then Ge else Incomparable
218 | (m, _, n) when m > 0 && n > 0 ->
223 let rec aux_ordering t1 t2 =
224 let module C = Cic in
225 let compare_uris u1 u2 =
227 compare (UriManager.string_of_uri u1) (UriManager.string_of_uri u2) in
229 else if res = 0 then Eq
234 | _, C.Meta _ -> Incomparable
236 | t1, t2 when t1 = t2 -> Eq
238 | C.Rel n, C.Rel m -> if n > m then Lt else Gt
242 | C.Const (u1, _), C.Const (u2, _) -> compare_uris u1 u2
246 | C.MutInd (u1, _, _), C.MutInd (u2, _, _) -> compare_uris u1 u2
247 | C.MutInd _, _ -> Lt
248 | _, C.MutInd _ -> Gt
250 | C.MutConstruct (u1, _, _, _), C.MutConstruct (u2, _, _, _) ->
252 | C.MutConstruct _, _ -> Lt
253 | _, C.MutConstruct _ -> Gt
255 | C.Appl l1, C.Appl l2 ->
261 | hd1::tl1, hd2::tl2 ->
262 let o = aux_ordering hd1 hd2 in
263 if o = Eq then cmp tl1 tl2
269 Printf.printf "These two terms are not comparable:\n%s\n%s\n\n"
270 (CicPp.ppterm t1) (CicPp.ppterm t2);
275 (* w1, w2 are the weights, they should already be normalized... *)
276 let nonrec_kbo_w (t1, w1) (t2, w2) =
277 match compare_weights w1 w2 with
278 | Le -> if aux_ordering t1 t2 = Lt then Lt else Incomparable
279 | Ge -> if aux_ordering t1 t2 = Gt then Gt else Incomparable
280 | Eq -> aux_ordering t1 t2
285 let nonrec_kbo t1 t2 =
286 let w1 = weight_of_term t1 in
287 let w2 = weight_of_term t2 in
288 match compare_weights ~normalize:true w1 w2 with
289 | Le -> if aux_ordering t1 t2 = Lt then Lt else Incomparable
290 | Ge -> if aux_ordering t1 t2 = Gt then Gt else Incomparable
291 | Eq -> aux_ordering t1 t2
296 let names_of_context context =
300 | Some (n, e) -> Some n)
309 let compare = Pervasives.compare
312 module TermSet = Set.Make(OrderedTerm);;
313 module TermMap = Map.Make(OrderedTerm);;
315 let symbols_of_term term =
316 let module C = Cic in
317 let rec aux map = function
320 List.fold_left (fun res t -> (aux res t)) map l
324 let c = TermMap.find t map in
325 TermMap.add t (c+1) map
331 aux TermMap.empty term
335 let metas_of_term term =
336 let module C = Cic in
337 let rec aux = function
338 | C.Meta _ as t -> TermSet.singleton t
340 List.fold_left (fun res t -> TermSet.union res (aux t)) TermSet.empty l
341 | t -> TermSet.empty (* TODO: maybe add other cases? *)
348 let module C = Cic in
350 | t1, t2 when t1 = t2 -> Eq
351 | t1, (C.Meta _ as m) ->
352 if TermSet.mem m (metas_of_term t1) then Gt else Incomparable
353 | (C.Meta _ as m), t2 ->
354 if TermSet.mem m (metas_of_term t2) then Lt else Incomparable
355 | C.Appl (hd1::tl1), C.Appl (hd2::tl2) -> (
363 let res1 = List.fold_left (f t2) false tl1 in
365 else let res2 = List.fold_left (f t1) false tl2 in
369 if res <> Incomparable then
373 if not r then false else
378 match aux_ordering hd1 hd2 with
380 let res = List.fold_left (f t1) false tl2 in
384 let res = List.fold_left (f t2) false tl1 in
391 (fun r t1 t2 -> if r <> Eq then r else lpo t1 t2)
393 with Invalid_argument _ ->
398 if List.fold_left (f t1) false tl2 then Gt
401 if List.fold_left (f t2) false tl1 then Lt
407 | t1, t2 -> aux_ordering t1 t2
411 (* settable by the user... *)
412 let compare_terms = ref nonrec_kbo;;
415 type equality_sign = Negative | Positive;;
417 let string_of_sign = function
418 | Negative -> "Negative"
419 | Positive -> "Positive"
423 type pos = Left | Right
425 let string_of_pos = function