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/
28 module Constr = MetadataConstraints
29 module PET = ProofEngineTypes
31 (** maps a shell like pattern (which uses '*' and '?') to a sql pattern for
32 * the "like" operator (which uses '%' and '_'). Does not support escaping. *)
33 let sqlpat_of_shellglob =
34 let star_RE, qmark_RE, percent_RE, uscore_RE =
35 Pcre.regexp "\\*", Pcre.regexp "\\?", Pcre.regexp "%", Pcre.regexp "_"
38 Pcre.replace ~rex:star_RE ~templ:"%"
39 (Pcre.replace ~rex:qmark_RE ~templ:"_"
40 (Pcre.replace ~rex:percent_RE ~templ:"\\%"
41 (Pcre.replace ~rex:uscore_RE ~templ:"\\_"
45 let len = String.length s in
46 let suffix = String.sub s (len-4) 4 in
49 let locate ~(dbd:Mysql.dbd) ?(vars = false) pat =
50 let sql_pat = sqlpat_of_shellglob pat in
52 sprintf ("SELECT source FROM %s WHERE value LIKE \"%s\" UNION "^^
53 "SELECT source FROM %s WHERE value LIKE \"%s\"")
54 (MetadataTypes.name_tbl ()) sql_pat
55 MetadataTypes.library_name_tbl sql_pat
57 let result = Mysql.exec dbd query in
60 (fun cols -> match cols.(0) with Some s -> s | _ -> assert false))
62 let match_term ~(dbd:Mysql.dbd) ty =
63 let metadata = MetadataExtractor.compute ~body:None ~ty in
65 MetadataConstraints.StringSet.cardinal (MetadataConstraints.constants_of ty)
67 let constraints = List.map MetadataTypes.constr_of_metadata metadata in
68 Constr.at_least ~dbd ~full_card:(MetadataConstraints.Eq constants_no)
71 let ( ** ) x y = int_of_float ((float_of_int x) ** (float_of_int y))
73 let signature_of_hypothesis context =
78 | Some (_, Cic.Decl t)
79 | Some (_, Cic.Def (t, _)) ->
80 Constr.StringSet.union set (Constr.constants_of t))
81 Constr.StringSet.empty context
83 let intersect uris siguris =
84 let set1 = List.fold_right Constr.StringSet.add uris Constr.StringSet.empty in
86 List.fold_right Constr.StringSet.add siguris Constr.StringSet.empty
88 let inter = Constr.StringSet.inter set1 set2 in
89 List.filter (fun s -> Constr.StringSet.mem s inter) uris
91 let filter_uris_forward ~dbd (main, constants) uris =
95 | Some (main, types) -> main :: types
98 List.fold_right Constr.StringSet.add main_uris constants
100 List.filter (Constr.at_most ~dbd ~where:`Statement full_signature) uris
102 let filter_uris_backward ~dbd ~facts signature uris =
105 (MetadataConstraints.sigmatch ~dbd ~facts ~where:`Statement signature)
107 intersect uris siguris
109 let compare_goal_list proof goal1 goal2 =
110 let _,metasenv,_,_ = proof in
111 let (_, ey1, ty1) = CicUtil.lookup_meta goal1 metasenv in
112 let (_, ey2, ty2) = CicUtil.lookup_meta goal2 metasenv in
114 CicTypeChecker.type_of_aux' metasenv ey1 ty1 CicUniv.empty_ugraph
117 CicTypeChecker.type_of_aux' metasenv ey2 ty2 CicUniv.empty_ugraph
121 CicReduction.are_convertible
122 ey1 (Cic.Sort Cic.Prop) ty_sort1 CicUniv.empty_ugraph
129 CicReduction.are_convertible
130 ey2 (Cic.Sort Cic.Prop) ty_sort2 CicUniv.empty_ugraph
137 let hint ~(dbd:Mysql.dbd) ?(facts=false) ?signature ((proof, goal) as status) =
138 let (_, metasenv, _, _) = proof in
139 let (_, context, ty) = CicUtil.lookup_meta goal metasenv in
140 let (uris, (main, sig_constants)) =
142 | Some signature -> (Constr.sigmatch ~dbd ~facts signature, signature)
143 | None -> (Constr.cmatch' ~dbd ~facts ty, Constr.signature_of ty)
145 let uris = List.filter nonvar (List.map snd uris) in
146 let uris = List.filter Hashtbl_equiv.not_a_duplicate uris in
147 let types_constants =
149 | None -> Constr.StringSet.empty
150 | Some (main, types) ->
151 List.fold_right Constr.StringSet.add (main :: types)
152 Constr.StringSet.empty
155 Constr.StringSet.diff (signature_of_hypothesis context) types_constants
157 Constr.StringSet.iter prerr_endline hyp_constants;
158 let other_constants = Constr.StringSet.union sig_constants hyp_constants in
160 let pow = 2 ** (Constr.StringSet.cardinal other_constants) in
161 if ((List.length uris < pow) or (pow <= 0))
163 prerr_endline "MetadataQuery: large sig, falling back to old method";
164 filter_uris_forward ~dbd (main, other_constants) uris
166 filter_uris_backward ~dbd ~facts (main, other_constants) uris
168 let rec aux = function
173 let (proof, goal_list) =
174 (* prerr_endline ("STO APPLICANDO " ^ uri); *)
176 (PrimitiveTactics.apply_tac
177 ~term:(CicUtil.term_of_uri uri))
181 List.stable_sort (compare_goal_list proof) goal_list
183 Some (uri, (proof, goal_list))
184 with ProofEngineTypes.Fail _ -> None
192 (fun (_, (_, goals1)) (_, (_, goals2)) ->
193 Pervasives.compare (List.length goals1) (List.length goals2))
196 (* experimental_hint is a version of hint for experimental
197 purposes. It uses auto_tac_verbose instead of auto tac.
198 Auto_tac verbose also returns a substitution - for the moment
199 as a function from cic to cic, to be changed into an association
200 list in the future -. This substitution is used to build a
201 hash table of the inspected goals with their associated proofs.
202 The cose is a cut and paste of the previous one: at the end
203 of the experimentation we shall make a choice. *)
205 let experimental_hint
206 ~(dbd:Mysql.dbd) ?(facts=false) ?signature ((proof, goal) as status) =
207 let (_, metasenv, _, _) = proof in
208 let (_, context, ty) = CicUtil.lookup_meta goal metasenv in
209 let (uris, (main, sig_constants)) =
212 (Constr.sigmatch ~dbd ~facts signature, signature)
214 (Constr.cmatch' ~dbd ~facts ty, Constr.signature_of ty)
216 let uris = List.filter nonvar (List.map snd uris) in
217 let uris = List.filter Hashtbl_equiv.not_a_duplicate uris in
218 let types_constants =
220 | None -> Constr.StringSet.empty
221 | Some (main, types) ->
222 List.fold_right Constr.StringSet.add (main :: types)
223 Constr.StringSet.empty
226 Constr.StringSet.diff (signature_of_hypothesis context) types_constants
228 Constr.StringSet.iter prerr_endline hyp_constants;
229 let other_constants = Constr.StringSet.union sig_constants hyp_constants in
231 let pow = 2 ** (Constr.StringSet.cardinal other_constants) in
232 if ((List.length uris < pow) or (pow <= 0))
234 prerr_endline "MetadataQuery: large sig, falling back to old method";
235 filter_uris_forward ~dbd (main, other_constants) uris
237 filter_uris_backward ~dbd ~facts (main, other_constants) uris
239 let rec aux = function
244 let (subst,(proof, goal_list)) =
245 (* prerr_endline ("STO APPLICANDO" ^ uri); *)
246 PrimitiveTactics.apply_tac_verbose
247 ~term:(CicUtil.term_of_uri uri)
251 List.stable_sort (compare_goal_list proof) goal_list
253 Some (uri, (subst,(proof, goal_list)))
254 with ProofEngineTypes.Fail _ -> None
258 | Some status' -> status' :: aux tl)
261 (fun (_,(_, (_, goals1))) (_,(_, (_, goals2))) ->
262 Pervasives.compare (List.length goals1) (List.length goals2))
267 [`Rel [`MainConclusion None];
268 `Sort (Cic.Prop,[`MainHypothesis (Some 1)]);
269 `Obj (uri,[`MainHypothesis (Some 0)]);
270 `Obj (uri,[`InHypothesis]);
273 MetadataConstraints.at_least ~dbd constraints