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
68 | Cic.Meta (_, _) -> l
71 | Cic.Var u -> inspect_uri main l u [] v term
72 | Cic.Const (u, _) -> inspect_uri main l u [] v term
73 | Cic.MutInd (u, _, t) -> inspect_uri main l u [t] v term
74 | Cic.MutConstruct (u, _, t, c) -> inspect_uri main l u [t; c] v term
76 inspect_term main l v uu
77 | Cic.Prod (_, uu, tt) ->
78 let luu = inspect_term false l (v + 1) uu in
79 inspect_term main luu (v + 1) tt
80 | Cic.Lambda (_, uu, tt) ->
81 let luu = inspect_term false l (v + 1) uu in
82 inspect_term false luu (v + 1) tt
83 | Cic.LetIn (_, uu, tt) ->
84 let luu = inspect_term false l (v + 1) uu in
85 inspect_term false luu (v + 1) tt
86 | Cic.Appl m -> inspect_list main l true v m
87 | Cic.MutCase (u, _, t, tt, uu, m) ->
88 let lu = inspect_uri main l u [t] (v + 1) term in
89 let ltt = inspect_term false lu (v + 1) tt in
90 let luu = inspect_term false ltt (v + 1) uu in
91 inspect_list main luu false (v + 1) m
92 | Cic.Fix (_, m) -> inspect_ind l (v + 1) m
93 | Cic.CoFix (_, m) -> inspect_coind l (v + 1) m
94 and inspect_list main l head v = function
97 let ltt = inspect_term main l (if head then v else v + 1) tt in
98 inspect_list false ltt false v m
99 and inspect_ind l v = function
101 | (_, _, tt, uu) :: m ->
102 let ltt = inspect_term false l v tt in
103 let luu = inspect_term false ltt v uu in
105 and inspect_coind l v = function
107 | (_, tt, uu) :: m ->
108 let ltt = inspect_term false l v tt in
109 let luu = inspect_term false ltt v uu in
110 inspect_coind luu v m
112 let rec inspect_backbone = function
113 | Cic.Cast (uu, _) -> inspect_backbone uu
114 | Cic.Prod (_, _, tt) -> inspect_backbone tt
115 | Cic.LetIn (_, uu, tt) -> inspect_backbone tt
116 | t -> inspect_term true [] 0 t
118 inspect_backbone term
120 let string_of_levels l sep =
121 let entry_out (s, b, v) =
122 let pos = if b then " HEAD: " else " TAIL: " in
123 string_of_int v ^ pos ^ s ^ sep
125 let rec levels_out = function
127 | head :: tail -> entry_out head ^ levels_out tail
131 (* Query issuing functions **************************************************)
137 let log_file = ref ""
139 let confirm_query = ref (fun _ -> true)
146 let set_confirm_query f =
149 let get_query_info () = ! info
151 let execute_query query =
152 let module Util = MQueryUtil in
153 let mode = [Open_wronly; Open_append; Open_creat; Open_text] in
154 let perm = 64 * 6 + 8 * 6 + 4 in
156 let och = open_out_gen mode perm ! log_file in
157 let str = "Query:" ^ nl ^ Util.text_of_query q ^ nl ^
158 "Result:" ^ nl ^ Util.text_of_result r nl in
159 output_string och str;
163 let r = Mqint.execute q in
164 if ! log_file <> "" then log q r; r
166 if ! confirm_query query then execute query else raise Discard
168 (* Query building functions ************************************************)
171 let module M = MathQL in
172 let q = M.Ref (M.Fun "uri_of_alias" (M.Const [s])) in
175 let backward e c t level =
176 let module M = MathQL in
177 let v_pos = M.Const ["MainConclusion"; "InConclusion"] in
178 let q_where = M.Sub (M.RefOf (
180 M.Relation (M.ExactOp, ["refObj"], M.RVar "uri0", ["pos"]),
181 M.Ex ["uri"] (M.Meet (M.VVar "positions", M.Record ("uri", "pos")))
182 )), M.VVar "universe"
185 let uri_of_entry (r, b, v) = r in
186 let rec restrict level = function
188 | (u, b, v) :: tail ->
189 if v <= level then (u, b, v) :: restrict level tail
190 else restrict level tail
192 let build_select (r, b, v) =
193 let pos = if b then "MainConclusion" else "InConclusion" in
195 M.Relation (M.ExactOp, ["backPointer"], M.Ref (M.Const [r]), ["pos"]),
196 M.Ex ["uri"] (M.Sub (M.Const [pos], M.Record ("uri", "pos")))
199 let rec build_intersect = function
200 | [] -> M.Pattern (M.Const [".*"])
201 | [hd] -> build_select hd
202 | hd :: tl -> M.Intersect (build_select hd, build_intersect tl)
204 let levels = levels_of_term e c t in
205 let rest = restrict level levels in
206 info := [string_of_int (List.length rest)];
207 let q_in = build_intersect rest in
208 let q_select = M.Select ("uri0", q_in, q_where) in
209 let universe = M.Const (List.map uri_of_entry levels) in
210 let q_let_u = M.LetVVar ("universe", universe, q_select) in
211 let q_let_p = M.LetVVar ("positions", v_pos, q_let_u) in
212 execute_query q_let_p