1 (* Copyright (C) 2004, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://helm.cs.unibo.it/
29 let critical_value = 7
32 module UriManagerSet = UriManager.UriSet
33 module SetSet = Set.Make (UriManagerSet)
35 type term_signature = (UriManager.uri * UriManager.uri list) option * UriManagerSet.t
37 type cardinality_condition =
42 type rating_criterion =
43 [ `Hits (** order by number of hits, most used objects first *)
47 (library_obj_tbl,library_rel_tbl,library_sort_tbl,library_count_tbl)
49 let current_tables () =
50 (obj_tbl (),rel_tbl (),sort_tbl (), count_tbl ())
52 let tbln n = "table" ^ string_of_int n
55 let add_depth_constr depth_opt cur_tbl where =
58 | Some depth -> (sprintf "%s.h_depth = %d" cur_tbl depth) :: where
61 let mk_positions positions cur_tbl =
66 let pos_str = MetadataPp.pp_position_tag pos in
71 | `MainConclusion None
72 | `MainHypothesis None ->
73 sprintf "%s.h_position = \"%s\"" cur_tbl pos_str
74 | `MainConclusion (Some r)
75 | `MainHypothesis (Some r) ->
76 let depth = MetadataPp.pp_relation r in
77 sprintf "(%s.h_position = \"%s\" and %s.h_depth %s)"
78 cur_tbl pos_str cur_tbl depth)
79 (positions :> MetadataTypes.position list)) ^
82 let explode_card_constr = function
83 | Eq card -> "=", card
84 | Gt card -> ">", card
85 | Lt card -> "<", card
87 let add_card_constr tbl col where = function
90 let op, card = explode_card_constr constr in
91 (* count(_utente).hypothesis = 3 *)
92 (sprintf "%s.%s %s %d" tbl col op card :: where)
94 let add_diff_constr tbl where = function
97 let op, card = explode_card_constr constr in
98 (sprintf "%s.hypothesis - %s.conclusion %s %d" tbl tbl op card :: where)
100 let add_all_constr ?(tbl=library_count_tbl) (n,from,where) concl full diff =
101 match (concl, full, diff) with
102 | None, None, None -> (n,from,where)
104 let cur_tbl = tbln n in
105 let from = (sprintf "%s as %s" tbl cur_tbl) :: from in
106 let where = add_card_constr cur_tbl "conclusion" where concl in
107 let where = add_card_constr cur_tbl "statement" where full in
108 let where = add_diff_constr cur_tbl where diff in
111 sprintf "table0.source = %s.source" cur_tbl :: where
116 let add_constraint ?(start=0) ?(tables=default_tables) (n,from,where) metadata =
117 let obj_tbl,rel_tbl,sort_tbl,count_tbl = tables
119 let cur_tbl = tbln n in
120 let start_table = tbln start in
122 | `Obj (uri, positions) ->
123 let from = (sprintf "%s as %s" obj_tbl cur_tbl) :: from in
125 (sprintf "(%s.h_occurrence = \"%s\")" cur_tbl (UriManager.string_of_uri uri)) ::
126 mk_positions positions cur_tbl ::
128 else [sprintf "%s.source = %s.source" start_table cur_tbl]) @
133 let from = (sprintf "%s as %s" rel_tbl cur_tbl) :: from in
135 mk_positions positions cur_tbl ::
137 else [sprintf "%s.source = %s.source" start_table cur_tbl]) @
141 | `Sort (sort, positions) ->
142 let sort_str = CicPp.ppsort sort in
143 let from = (sprintf "%s as %s" sort_tbl cur_tbl) :: from in
145 (sprintf "%s.h_sort = \"%s\"" cur_tbl sort_str ) ::
146 mk_positions positions cur_tbl ::
150 [sprintf "%s.source = %s.source" start_table cur_tbl ]) @ where
154 let exec ~(dbd:HMysql.dbd) ?rating (n,from,where) =
155 let from = String.concat ", " from in
156 let where = String.concat " and " where in
159 | None -> sprintf "select distinct table0.source from %s where %s" from where
162 ("select distinct table0.source from %s, hits where %s
163 and table0.source = hits.source order by hits.no desc")
166 (* prerr_endline query; *)
167 let result = HMysql.exec dbd query in
169 (fun row -> match row.(0) with Some s -> UriManager.uri_of_string s | _ -> assert false)
172 let at_least ~(dbd:HMysql.dbd) ?concl_card ?full_card ?diff ?rating tables
173 (metadata: MetadataTypes.constr list)
175 let obj_tbl,rel_tbl,sort_tbl, count_tbl = tables
177 if (metadata = []) && concl_card = None && full_card = None then
178 failwith "MetadataQuery.at_least: no constraints given";
180 List.fold_left (add_constraint ~tables) (0,[],[]) metadata
183 add_all_constr ~tbl:count_tbl (n,from,where) concl_card full_card diff
185 exec ~dbd ?rating (n,from,where)
188 ~(dbd:HMysql.dbd) ?concl_card ?full_card ?diff ?rating
189 (metadata: MetadataTypes.constr list)
191 if are_tables_ownerized () then
193 ~dbd ?concl_card ?full_card ?diff ?rating default_tables metadata) @
195 ~dbd ?concl_card ?full_card ?diff ?rating (current_tables ()) metadata)
198 ~dbd ?concl_card ?full_card ?diff ?rating default_tables metadata
201 (** Prefix handling *)
203 let filter_by_card n =
204 SetSet.filter (fun t -> (UriManagerSet.cardinal t) <= n)
207 let init = SetSet.union a b in
208 let merge_single_set s1 b =
210 (fun s2 res -> SetSet.add (UriManagerSet.union s1 s2) res)
213 SetSet.fold (fun s1 res -> SetSet.union (merge_single_set s1 b) res) a init
217 let rec inspect_children n childs =
219 (fun res term -> merge n (inspect_conclusion n term) res)
222 and add_root n root childs =
223 let childunion = inspect_children n childs in
224 let addroot = UriManagerSet.add root in
226 (fun child newsets -> SetSet.add (addroot child) newsets)
228 (SetSet.singleton (UriManagerSet.singleton root))
230 and inspect_conclusion n t =
231 if n = 0 then SetSet.empty
236 | Cic.Implicit _ -> SetSet.empty
237 | Cic.Var (u,exp_named_subst) -> SetSet.empty
238 | Cic.Const (u,exp_named_subst) ->
239 SetSet.singleton (UriManagerSet.singleton u)
240 | Cic.MutInd (u, t, exp_named_subst) ->
241 SetSet.singleton (UriManagerSet.singleton
242 (UriManager.uri_of_uriref u t None))
243 | Cic.MutConstruct (u, t, c, exp_named_subst) ->
244 SetSet.singleton (UriManagerSet.singleton
245 (UriManager.uri_of_uriref u t (Some c)))
246 | Cic.Cast (t, _) -> inspect_conclusion n t
247 | Cic.Prod (_, s, t) ->
248 merge n (inspect_conclusion n s) (inspect_conclusion n t)
249 | Cic.Lambda (_, s, t) ->
250 merge n (inspect_conclusion n s) (inspect_conclusion n t)
251 | Cic.LetIn (_, s, t) ->
252 merge n (inspect_conclusion n s) (inspect_conclusion n t)
253 | Cic.Appl ((Cic.Const (u,exp_named_subst))::l) ->
255 | Cic.Appl ((Cic.MutInd (u, t, exp_named_subst))::l) ->
256 let uri = UriManager.uri_of_uriref u t None in
258 | Cic.Appl ((Cic.MutConstruct (u, t, c, exp_named_subst))::l) ->
259 let suri = UriManager.uri_of_uriref u t (Some c) in
260 add_root (n-1) suri l
263 | Cic.MutCase (u, t, tt, uu, m) ->
267 | Cic.CoFix (_, m) ->
270 let rec inspect_term n t =
278 | Cic.Implicit _ -> None, SetSet.empty
279 | Cic.Var (u,exp_named_subst) -> None, SetSet.empty
280 | Cic.Const (u,exp_named_subst) ->
282 | Cic.MutInd (u, t, exp_named_subst) ->
283 let uri = UriManager.uri_of_uriref u t None in
284 Some uri, SetSet.empty
285 | Cic.MutConstruct (u, t, c, exp_named_subst) ->
286 let uri = UriManager.uri_of_uriref u t (Some c) in
287 Some uri, SetSet.empty
288 | Cic.Cast (t, _) -> inspect_term n t
289 | Cic.Prod (_, _, t) -> inspect_term n t
290 | Cic.LetIn (_, _, t) -> inspect_term n t
291 | Cic.Appl ((Cic.Const (u,exp_named_subst))::l) ->
292 let childunion = inspect_children (n-1) l in
294 | Cic.Appl ((Cic.MutInd (u, t, exp_named_subst))::l) ->
295 let suri = UriManager.uri_of_uriref u t None in
296 if u = HelmLibraryObjects.Logic.eq_URI && n>1 then
297 (* equality is handled in a special way: in particular,
298 the type, if defined, is always added to the prefix,
299 and n is not decremented - it should have been n-2 *)
301 Cic.Const (u1,exp_named_subst1)::l1 ->
302 let inconcl = add_root (n-1) u1 l1 in
304 | Cic.MutInd (u1, t1, exp_named_subst1)::l1 ->
305 let suri1 = UriManager.uri_of_uriref u1 t1 None in
306 let inconcl = add_root (n-1) suri1 l1 in
308 | Cic.MutConstruct (u1, t1, c1, exp_named_subst1)::l1 ->
309 let suri1 = UriManager.uri_of_uriref u1 t1 (Some c1) in
310 let inconcl = add_root (n-1) suri1 l1 in
312 | _ :: _ -> Some suri, SetSet.empty
313 | _ -> assert false (* args number must be > 0 *)
315 let childunion = inspect_children (n-1) l in
316 Some suri, childunion
317 | Cic.Appl ((Cic.MutConstruct (u, t, c, exp_named_subst))::l) ->
318 let suri = UriManager.uri_of_uriref u t(Some c) in
319 let childunion = inspect_children (n-1) l in
320 Some suri, childunion
321 | _ -> None, SetSet.empty
323 let add_cardinality s =
324 let l = SetSet.elements s in
328 let el = UriManagerSet.elements set in
329 (List.length el, el)) l in
330 (* ordered by descending cardinality *)
331 List.sort (fun (n,_) (m,_) -> m - n) ((0,[])::res)
334 match inspect_term n t with
335 Some a, set -> Some a, add_cardinality set
336 | None, set when (SetSet.is_empty set) -> None, []
337 | _, _ -> assert false
340 let rec add children =
342 (fun acc t -> UriManagerSet.union (signature_concl t) acc)
343 (UriManagerSet.empty) children
345 (* this function creates the set of all different constants appearing in
346 the conclusion of the term *)
347 and signature_concl =
352 | Cic.Implicit _ -> UriManagerSet.empty
353 | Cic.Var (u,exp_named_subst) ->
354 (*CSC: TODO if the var has a body it must be processed *)
356 | Cic.Const (u,exp_named_subst) ->
357 UriManagerSet.singleton u
358 | Cic.MutInd (u, t, exp_named_subst) ->
359 let uri = UriManager.uri_of_uriref u t None in
360 UriManagerSet.singleton uri
361 | Cic.MutConstruct (u, t, c, exp_named_subst) ->
362 let uri = UriManager.uri_of_uriref u t (Some c) in
363 UriManagerSet.singleton uri
364 | Cic.Cast (t, _) -> signature_concl t
365 | Cic.Prod (_, s, t) ->
366 UriManagerSet.union (signature_concl s) (signature_concl t)
367 | Cic.Lambda (_, s, t) ->
368 UriManagerSet.union (signature_concl s) (signature_concl t)
369 | Cic.LetIn (_, s, t) ->
370 UriManagerSet.union (signature_concl s) (signature_concl t)
371 | Cic.Appl l -> add l
377 let rec signature_of = function
378 | Cic.Cast (t, _) -> signature_of t
379 | Cic.Prod (_, _, t) -> signature_of t
380 | Cic.LetIn (_, _, t) -> signature_of t
381 | Cic.Appl ((Cic.Const (u,exp_named_subst))::l) ->
383 | Cic.Appl ((Cic.MutInd (u, t, exp_named_subst))::l) ->
384 let suri = UriManager.uri_of_uriref u t None in
385 if u = HelmLibraryObjects.Logic.eq_URI then
386 (* equality is handled in a special way: in particular,
387 the type, if defined, is always added to the prefix,
388 and n is not decremented - it should have been n-2 *)
390 Cic.Const (u1,exp_named_subst1)::l1 ->
391 let inconcl = UriManagerSet.remove u1 (add l1) in
392 Some (suri, [u1]), inconcl
393 | Cic.MutInd (u1, t1, exp_named_subst1)::l1 ->
394 let suri1 = UriManager.uri_of_uriref u1 t1 None in
395 let inconcl = UriManagerSet.remove suri1 (add l1) in
396 Some (suri, [suri1]), inconcl
397 | Cic.MutConstruct (u1, t1, c1, exp_named_subst1)::l1 ->
398 let suri1 = UriManager.uri_of_uriref u1 t1 (Some c1) in
399 let inconcl = UriManagerSet.remove suri1 (add l1) in
400 Some (suri, [suri1]), inconcl
401 | _ :: _ -> Some (suri, []), UriManagerSet.empty
402 | _ -> assert false (* args number must be > 0 *)
404 Some (suri, []), add l
405 | Cic.Appl ((Cic.MutConstruct (u, t, c, exp_named_subst))::l) ->
406 let suri = UriManager.uri_of_uriref u t (Some c) in
407 Some (suri, []), add l
408 | t -> None, signature_concl t
410 (* takes a list of lists and returns the list of all elements
411 without repetitions *)
413 let rec drop_repetitions = function
416 | u1::u2::l when u1 = u2 -> drop_repetitions (u2::l)
417 | u::l -> u::(drop_repetitions l) in
418 drop_repetitions (List.sort Pervasives.compare (List.concat l))
420 let must_of_prefix ?(where = `Conclusion) m s =
423 | `Conclusion -> [`InConclusion]
424 | `Statement -> [`InConclusion; `InHypothesis; `MainHypothesis None]
427 if m = None then `MainConclusion None :: positions else positions in
428 let s' = List.map (fun (u:UriManager.uri) -> `Obj (u, positions)) s in
431 | Some m -> `Obj (m, [`MainConclusion None]) :: s'
433 let escape = Str.global_replace (Str.regexp_string "\'") "\\'"
435 let get_constants (dbd:HMysql.dbd) ~where uri =
436 let uri = escape (UriManager.string_of_uri uri) in
439 | `Conclusion -> [ MetadataTypes.mainconcl_pos; MetadataTypes.inconcl_pos ]
441 [ MetadataTypes.mainconcl_pos; MetadataTypes.inconcl_pos;
442 MetadataTypes.inhyp_pos; MetadataTypes.mainhyp_pos ]
447 (List.map (fun pos -> sprintf "(h_position = \"%s\")" pos) positions)
449 sprintf ("SELECT h_occurrence FROM %s WHERE source=\"%s\" AND (%s) UNION "^^
450 "SELECT h_occurrence FROM %s WHERE source=\"%s\" AND (%s)")
451 (MetadataTypes.obj_tbl ()) uri pos_predicate
452 MetadataTypes.library_obj_tbl uri pos_predicate
455 let result = HMysql.exec dbd query in
456 let set = ref UriManagerSet.empty in
460 | Some uri -> set := UriManagerSet.add (UriManager.uri_of_string uri) !set
461 | _ -> assert false);
464 let at_most ~(dbd:HMysql.dbd) ?(where = `Conclusion) only u =
465 let inconcl = get_constants dbd ~where u in
466 UriManagerSet.subset inconcl only
468 (* Special handling of equality. The problem is filtering out theorems just
469 * containing variables (e.g. all the theorems in cic:/Coq/Ring/). Really
470 * ad-hoc, no better solution found at the moment *)
471 let myspeciallist_of_facts =
472 [0,UriManager.uri_of_string "cic:/Coq/Init/Logic/eq.ind#xpointer(1/1/1)"]
474 [0,UriManager.uri_of_string "cic:/Coq/Init/Logic/eq.ind#xpointer(1/1/1)";
475 (* 0,"cic:/Coq/Init/Logic/sym_eq.con"; *)
476 0,UriManager.uri_of_string "cic:/Coq/Init/Logic/trans_eq.con";
477 0,UriManager.uri_of_string "cic:/Coq/Init/Logic/f_equal.con";
478 0,UriManager.uri_of_string "cic:/Coq/Init/Logic/f_equal2.con";
479 0,UriManager.uri_of_string "cic:/Coq/Init/Logic/f_equal3.con"]
482 let compute_exactly ~(dbd:HMysql.dbd) ?(facts=false) ~where main prefixes =
492 (UriManager.uri_of_string (HelmLibraryObjects.Logic.eq_XURI))),
495 if m = 0 && is_eq then
496 (if facts then myspeciallist_of_facts
500 (* this gets rid of the ~750 objects of type Set/Prop/Type *)
503 let must = must_of_prefix ~where main s in
505 | `Conclusion -> at_least ~dbd ~concl_card:(Eq card) must
506 | `Statement -> at_least ~dbd ~full_card:(Eq card) must
508 List.map (fun uri -> (card, uri)) res)
511 (* critical value reached, fallback to "only" constraints *)
513 let compute_with_only ~(dbd:HMysql.dbd) ?(facts=false) ?(where = `Conclusion)
514 main prefixes constants
516 let max_prefix_length =
519 | (max,_)::_ -> max in
520 let maximal_prefixes =
521 let rec filter res = function
523 | (n,s)::l when n = max_prefix_length -> filter ((n,s)::res) l
525 filter [] prefixes in
531 let card = if main = None then m else m + 1 in
532 let must = must_of_prefix ~where main s in
535 | `Conclusion -> at_least ~dbd ~concl_card:(Gt card) must
536 | `Statement -> at_least ~dbd ~full_card:(Gt card) must
538 (* we tag the uri with m+1, for sorting purposes *)
539 List.map (fun uri -> (card, uri)) res))
542 Printf.fprintf stderr "all: %d\n" (List.length all);flush_all ();
543 List.filter (function (_,uri) -> at_most ~dbd ~where constants uri) all in
544 let equal_to = compute_exactly ~dbd ~facts ~where main prefixes in
545 greater_than @ equal_to
547 (* real match query implementation *)
549 let cmatch ~(dbd:HMysql.dbd) ?(facts=false) t =
550 let (main, constants) = signature_of t in
553 | Some (main, types) ->
554 (* the type of eq is not counted in constants_no *)
555 let types_no = List.length types in
556 let constants_no = UriManagerSet.cardinal constants in
557 if (constants_no > critical_value) then
558 let prefixes = prefixes just_factor t in
560 | Some main, all_concl ->
562 List.fold_right UriManagerSet.add types (UriManagerSet.add main constants)
564 compute_with_only ~dbd ~facts (Some main) all_concl all_constants
567 (* in this case we compute all prefixes, and we do not need
568 to apply the only constraints *)
570 if constants_no = 0 then
571 (if types_no = 0 then
574 Some main, [0, []; types_no, types])
576 prefixes (constants_no+types_no+1) t
579 Some main, all_concl ->
580 compute_exactly ~dbd ~facts ~where:`Conclusion (Some main) all_concl
583 let power_upto upto consts =
584 let l = UriManagerSet.elements consts in
585 List.sort (fun (n,_) (m,_) -> m - n)
589 List.filter (function (n,l) -> n <= upto)
590 (List.map (function (n,l) -> (n+1,a::l)) res) in
595 let l = UriManagerSet.elements consts in
596 List.sort (fun (n,_) (m,_) -> m - n)
598 (fun res a -> res@(List.map (function (n,l) -> (n+1,a::l)) res))
601 type where = [ `Conclusion | `Statement ]
603 let sigmatch ~(dbd:HMysql.dbd) ?(facts=false) ?(where = `Conclusion)
609 | Some (main, types) -> Some main,types
611 let constants_no = UriManagerSet.cardinal constants in
612 (* prerr_endline (("constants_no: ")^(string_of_int constants_no)); *)
613 if (constants_no > critical_value) then
615 let subsets = power_upto just_factor constants in
616 (* let _ = prerr_endline (("subsets: ")^
617 (string_of_int (List.length subsets))) in *)
618 let types_no = List.length types in
619 List.map (function (n,l) -> (n+types_no,types@l)) subsets
622 let all = match main with None -> types | Some m -> m::types in
623 List.fold_right UriManagerSet.add all constants
625 compute_with_only ~dbd ~where main subsets all_constants
628 let subsets = power constants in
629 let types_no = List.length types in
631 (0,[]) :: List.map (function (n,l) -> (n+types_no,types@l)) subsets
634 compute_exactly ~dbd ~facts ~where main subsets
636 (* match query wrappers *)
640 let cmatch ~dbd ?(facts=false) term =
643 (fun x y -> Pervasives.compare (fst y) (fst x))
644 (cmatch' ~dbd ~facts term))
646 let constants_of = signature_concl