1 (* Copyright (C) 2000, 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://cs.unibo.it/helm/.
26 (******************************************************************************)
30 (* Ferruccio Guidi <fguidi@cs.unibo.it> *)
34 (******************************************************************************)
36 (* level managing functions *************************************************)
38 type levels_spec = (string * bool * int) list
40 let levels_of_term metasenv context term =
41 let module TC = CicTypeChecker in
42 let module Red = CicReduction in
43 let module Util = MQueryUtil in
45 let rec degree_aux = function
47 | Cic.Cast (u, _) -> degree_aux u
48 | Cic.Prod (_, _, t) -> degree_aux t
51 let u = TC.type_of_aux' metasenv context t in
52 degree_aux (Red.whd context u)
54 let entry_eq (s1, b1, v1) (s2, b2, v2) =
57 let rec entry_in e = function
60 head :: if entry_eq head e then tail else entry_in e tail
62 let inspect_uri main l uri tc v term =
63 let d = degree term in
64 entry_in (Util.string_of_uriref (uri, tc), main, 2 * v + d - 1) l
66 let rec inspect_term main l v term = match term with
71 | Cic.Var (u,exp_named_subst) ->
72 let l' = inspect_uri main l u [] v term in
73 inspect_exp_named_subst l' (v+1) exp_named_subst
74 | Cic.Const (u,exp_named_subst) ->
75 let l' = inspect_uri main l u [] v term in
76 inspect_exp_named_subst l' (v+1) exp_named_subst
77 | Cic.MutInd (u, t, exp_named_subst) ->
78 let l' = inspect_uri main l u [t] v term in
79 inspect_exp_named_subst l' (v+1) exp_named_subst
80 | Cic.MutConstruct (u, t, c, exp_named_subst) ->
81 let l' = inspect_uri main l u [t; c] v term in
82 inspect_exp_named_subst l' (v+1) exp_named_subst
84 inspect_term main l v uu
85 | Cic.Prod (_, uu, tt) ->
86 let luu = inspect_term false l (v + 1) uu in
87 inspect_term main luu (v + 1) tt
88 | Cic.Lambda (_, uu, tt) ->
89 let luu = inspect_term false l (v + 1) uu in
90 inspect_term false luu (v + 1) tt
91 | Cic.LetIn (_, uu, tt) ->
92 let luu = inspect_term false l (v + 1) uu in
93 inspect_term false luu (v + 1) tt
94 | Cic.Appl m -> inspect_list main l true v m
95 | Cic.MutCase (u, t, tt, uu, m) ->
96 let lu = inspect_uri main l u [t] (v + 1) term in
97 let ltt = inspect_term false lu (v + 1) tt in
98 let luu = inspect_term false ltt (v + 1) uu in
99 inspect_list main luu false (v + 1) m
100 | Cic.Fix (_, m) -> inspect_ind l (v + 1) m
101 | Cic.CoFix (_, m) -> inspect_coind l (v + 1) m
102 and inspect_list main l head v = function
105 let ltt = inspect_term main l (if head then v else v + 1) tt in
106 inspect_list false ltt false v m
107 and inspect_exp_named_subst l v = function
110 let l' = inspect_term false l v t in
111 inspect_exp_named_subst l' v tl
112 and inspect_ind l v = function
114 | (_, _, tt, uu) :: m ->
115 let ltt = inspect_term false l v tt in
116 let luu = inspect_term false ltt v uu in
118 and inspect_coind l v = function
120 | (_, tt, uu) :: m ->
121 let ltt = inspect_term false l v tt in
122 let luu = inspect_term false ltt v uu in
123 inspect_coind luu v m
125 let rec inspect_backbone = function
126 | Cic.Cast (uu, _) -> inspect_backbone uu
127 | Cic.Prod (_, _, tt) -> inspect_backbone tt
128 | Cic.LetIn (_, uu, tt) -> inspect_backbone tt
129 | t -> inspect_term true [] 0 t
131 inspect_backbone term
133 let string_of_levels l sep =
134 let entry_out (s, b, v) =
135 let pos = if b then " HEAD: " else " TAIL: " in
136 string_of_int v ^ pos ^ s ^ sep
138 let rec levels_out = function
140 | head :: tail -> entry_out head ^ levels_out tail
144 (* Query issuing functions **************************************************)
150 let query_num = ref 1
152 let log_file = ref ""
154 let confirm_query = ref (fun _ -> true)
161 let set_confirm_query f =
164 let get_query_info () = ! info
166 let execute_query query =
167 let module Util = MQueryUtil in
168 let mode = [Open_wronly; Open_append; Open_creat; Open_text] in
169 let perm = 64 * 6 + 8 * 6 + 4 in
171 let lt = Unix.localtime (Unix.time ()) in
173 string_of_int (lt.Unix.tm_mon + 1) ^ "-" ^
174 string_of_int (lt.Unix.tm_mday + 1) ^ "-" ^
175 string_of_int (lt.Unix.tm_year + 1900) ^ " " ^
176 string_of_int (lt.Unix.tm_hour) ^ ":" ^
177 string_of_int (lt.Unix.tm_min) ^ ":" ^
178 string_of_int (lt.Unix.tm_sec)
181 let och = open_out_gen mode perm ! log_file in
182 if ! query_num = 1 then output_string och (time () ^ nl);
184 "Query: " ^ string_of_int ! query_num ^ nl ^ Util.text_of_query q ^ nl ^
185 "Result:" ^ nl ^ Util.text_of_result r nl in
186 output_string och str;
190 let r = Mqint.execute q in
191 if ! log_file <> "" then log q r;
192 info := string_of_int ! query_num :: ! info;
196 if ! confirm_query query then execute query else raise Discard
198 (* Query building functions ************************************************)
201 let module M = MathQL in
202 let q = M.Ref (M.Fun "objectName" (M.Const [s])) in
205 let searchPattern e c t level =
206 let module M = MathQL in
207 let v_pos = M.Const ["MainConclusion"; "InConclusion"] in
208 let q_where = M.Sub (M.RefOf (
210 M.Relation (M.ExactOp, ["refObj"], M.RVar "uri0", ["pos"]),
211 M.Ex ["uri"] (M.Meet (M.VVar "positions", M.Record ("uri", "pos")))
212 )), M.VVar "universe"
215 let uri_of_entry (r, b, v) = r in
216 let rec restrict level = function
218 | (u, b, v) :: tail ->
219 if v <= level then (u, b, v) :: restrict level tail
220 else restrict level tail
222 let build_select (r, b, v) =
223 let pos = if b then "MainConclusion" else "InConclusion" in
226 M.Relation (M.ExactOp, ["backPointer"], M.Ref (M.Const [r]), ["pos"]),
227 M.Ex ["uri"] (M.Sub (M.Const [pos], M.Record ("uri", "pos")))
230 let rec build_intersect = function
231 | [] -> M.Pattern (M.Const [".*"])
232 | [hd] -> build_select hd
233 | hd :: tl -> M.Intersect (build_select hd, build_intersect tl)
235 let levels = levels_of_term e c t in
236 let rest = restrict level levels in
237 info := [string_of_int (List.length rest)];
238 let q_in = build_intersect rest in
239 let q_select = M.Select ("uri0", q_in, q_where) in
240 let universe = M.Const (List.map uri_of_entry levels) in
241 let q_let_u = M.LetVVar ("universe", universe, q_select) in
242 let q_let_p = M.LetVVar ("positions", v_pos, q_let_u) in
243 execute_query q_let_p