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 (* Query issuing functions **************************************************)
29 type position = string
30 type depth = int option
33 type r_obj = (uri * position * depth)
34 type r_rel = (position* depth)
35 type r_sort = (position* depth * sort)
37 type must_restrictions = (r_obj list * r_rel list * r_sort list)
38 type only_restrictions =
39 (r_obj list option * r_rel list option * r_sort list option)
44 | "MH" -> ns ^ "MainHypothesis"
45 | "IH" -> ns ^ "InHypothesis"
46 | "MC" -> ns ^ "MainConclusion"
47 | "IC" -> ns ^ "InConclusion"
48 | "IB" -> ns ^ "InBody"
50 | "PROP" -> ns ^ "Prop"
51 | "TYPE" -> ns ^ "Type"
52 | _ -> raise (Failure "MQueryGenerator.builtin")
54 (* Query building functions ************************************************)
59 M.Ref (M.Property true M.RefineExact ("objectName", []) (M.Const [s]))
61 let searchPattern must_use can_use =
62 let in_path s = (s, []) in
63 let assign v p = (in_path v, in_path p) in
65 (* can restrictions *)
67 let (cr_o,cr_r,cr_s) = can_use in
69 let uri_of_entry (r, p, d) = r in
74 | Some cr_o -> List.map uri_of_entry cr_o
77 let tfst (a,b,c) = a in
78 let tsnd (a,b,c) = b in
79 let trd (a,b,c) = c in
90 | Some cr_o -> (List.map tsnd cr_o) in
95 | Some cr_o -> List.map trd cr_o
96 (* let odep_option_list = List.map trd cr_o in
97 let lo_dep_int = List.fold_left to_int_list [] odep_option_list in
98 List.map string_of_int lo_dep_int*)
100 print_string "#### LUNGHEZZA ODEP: "; print_int (List.length odep); flush stdout;
105 | Some cr_r -> (List.map fst cr_r) in
110 | Some cr_r -> List.map snd cr_r
111 (* let rdep_option_list = List.map snd cr_r in
112 let lr_dep_int = List.fold_left to_int_list [] rdep_option_list in
113 List.map string_of_int lr_dep_int *)
120 | Some cr_s -> (List.map tfst cr_s) in
126 | Some cr_s -> List.map tsnd cr_s
127 (* let sdep_option_list = List.map tsnd cr_s in
128 let ls_dep_int = List.fold_left to_int_list [] sdep_option_list in
129 List.map string_of_int ls_dep_int*)
136 | Some cr_s -> List.map trd cr_s in
138 (* let q_where_obj = function
145 M.Relation (false, M.RefineExact, in_path "refObj", M.Ref (M.RefOf (M.RVar "uri0")), [assign "pos" "position"]),
147 (M.Meet (M.VVar "obj_positions", M.Record ("uri", in_path "pos"))))),
155 (false, M.RefineExact, in_path "refObj",
156 M.Ref (M.RefOf (M.RVar "uri0")),
157 [assign "p" "position"; assign "d" "depth"]
161 ((M.Meet(M.VVar "obj_positions",M.Record("uri",in_path "p"))),
162 (M.Meet(M.VVar "obj_depths", M.Record("uri",in_path "d")))))
173 let q_where_obj n = function
175 let rec q_ex n = function
178 M.Meet (M.VVar ("obj_position" ^ string_of_int n), M.Record ("uri", in_path "p"))
181 print_string "@@@@@ IN-WHERE-OBJ"; flush stdout;
184 (M.Meet(M.VVar ("obj_position" ^ string_of_int n),M.Record("uri",in_path "p")),
185 M.Meet(M.VVar ("obj_depth" ^ string_of_int n), M.Record("uri",in_path "d")))
188 (M.Meet (M.VVar ("obj_position" ^ string_of_int n), M.Record ("uri", in_path "p")),
191 print_string "@@@@@ IN-WHERE-OBJ"; flush stdout;
195 ((M.Meet(M.VVar ("obj_position" ^ string_of_int n),M.Record("uri",in_path "p"))),
196 (M.Meet(M.VVar ("obj_depth" ^ string_of_int n), M.Record("uri",in_path "d"))))),
204 (false, M.RefineExact, in_path "refObj",
205 M.Ref (M.RefOf (M.RVar "uri0")),
206 [assign "p" "position"; assign "d" "depth"]
217 let rec q_where_rel n cr_r= (*function*)
222 (false, M.RefineExact, ("refRel", ["position"]),
223 M.RefOf(M.RVar "uri0")),
224 M.VVar ("rel_position" ^ string_of_int n))
228 | Some [(p,None)] -> q0
234 (false, M.RefineExact, ("refRel", ["depth"]),
235 M.RefOf(M.RVar "uri0")),
236 M.VVar ("rel_depth" ^ string_of_int n)))
237 | Some ((p,None)::tl) ->
240 q_where_rel (n+1) (Some tl))
241 | Some ((p,d)::tl) ->
247 (false, M.RefineExact, ("refRel", ["depth"]),
248 M.RefOf(M.RVar "uri0")),
249 M.VVar ("rel_depth" ^ string_of_int n))),
250 q_where_rel (n+1) (Some tl))
254 let rec q_where_sort n cr_s = (*function *)
260 (false, M.RefineExact, ("refSort", ["position"]),
261 M.RefOf(M.RVar "uri0")
263 M.VVar ("sort_position" ^ string_of_int n)),
266 (false, M.RefineExact, ("refSort", ["sort"]),
267 M.RefOf(M.RVar "uri0")),
268 M.VVar ("sort" ^ string_of_int n)))
272 | Some [(p,None,s)] -> q0
279 (false, M.RefineExact, ("refSort", ["depth"]),
280 M.RefOf(M.RVar "uri0")),
281 M.VVar ("sort_depth" ^ string_of_int n)))
283 | Some ((p,None,s)::tl) ->
286 q_where_sort (n+1) (Some tl))
288 | Some((p,d,s)::tl) ->
294 (false, M.RefineExact, ("refSort", ["depth"]),
295 M.RefOf(M.RVar "uri0")),
296 M.VVar ("sort_depth" ^ string_of_int n))),
297 q_where_sort (n+1) (Some tl))
305 let (cr_o,cr_r,cr_s) = cr in
306 M.And(M.And(q_where_obj 1 cr_o, (q_where_rel 1 cr_r)), (q_where_sort 1 cr_s))
310 (* must restrictions *)
312 let build_select_obj (r, pos, dep) =
316 M.Relation (false, M.RefineExact, ("backPointer", []),
317 M.Ref (M.Const [r]), [assign "p" "position"]),
319 ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p")))))
320 | Some dep -> let string_dep = string_of_int dep in
323 M.Relation (false, M.RefineExact, ("backPointer", []),
324 M.Ref (M.Const [r]), [assign "p" "position";assign "d" "depth"]),
327 ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))),
328 (M.Sub (M.Const [string_dep], M.Record ("uri", in_path "d"))))))
331 let build_select_rel (pos, dep) =
335 M.Relation (true, M.RefineExact, ("refRel", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth"]),
337 (M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))))
338 | Some dep -> let string_dep = string_of_int dep in
341 M.Relation (true, M.RefineExact, ("refRel", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth"]),
344 ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))),
345 (M.Sub (M.Const [string_dep], M.Record ("uri", in_path "d"))))))
348 let build_select_sort (pos, dep, sor) =
352 M.Relation (true, M.RefineExact, ("refSort", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth";assign "s" "sort"]),
355 ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))),
356 (M.Sub (M.Const [sor], M.Record ("uri", in_path "s"))))))
358 | Some dep -> let string_dep = string_of_int dep in
361 M.Relation (true, M.RefineExact, ("refSort", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth";assign "s" "sort"]),
365 ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))),
366 (M.Sub (M.Const [string_dep], M.Record ("uri", in_path "d"))))),
367 (M.Sub (M.Const [sor], M.Record ("uri", in_path "s"))))))
370 let rec build_intersect_obj = function
371 [] -> M.Pattern (M.Const ["[.]*"])
372 | [hd] -> build_select_obj hd
373 | hd :: tl -> M.Intersect (build_select_obj hd, build_intersect_obj tl)
376 let rec build_intersect_rel = function
377 [] -> M.Ref(M.Const [])
378 | [hd] -> build_select_rel hd
379 | hd :: tl -> M.Intersect (build_select_rel hd, build_intersect_rel tl)
382 let rec build_intersect_sort = function
383 [] -> M.Ref(M.Const [])
384 | [hd] -> build_select_sort hd
385 | hd :: tl -> M.Intersect (build_select_sort hd, build_intersect_sort tl)
388 let build_intersect = function
389 (* let tostring_sort (a,b,c) =
390 let b1 = string_of_int b in
393 let tostring_rel (a,b) =
394 let b1 = string_of_int b in
398 (* let (l1,l2,l3) = must in
399 match (l1,l2,l3) with *)
400 l1,[],[] -> build_intersect_obj l1
401 | [],l2,[] -> (*let lrel = List.map tostring_rel l2 in*)
402 build_intersect_rel l2
403 | [],[],l3 ->(* let lsort = List.map tostring_sort l3 in*)
404 build_intersect_sort l3
405 | l1,l2,[] -> (*let lrel = List.map tostring_rel l2 in*)
406 M.Intersect (build_intersect_obj l1, build_intersect_rel l2)
407 | l1,[],l3 ->(* let lsort = List.map tostring_sort l3 in *)
408 M.Intersect (build_intersect_obj l1, build_intersect_sort l3)
409 | [],l2,l3 ->(* let lrel = List.map tostring_rel l2 in
410 let lsort = List.map tostring_sort l3 in*)
411 M.Intersect (build_intersect_rel l2, build_intersect_sort l3)
412 | l1,l2,l3 ->(* let lrel = List.map tostring_rel l2 in
413 let lsort = List.map tostring_sort l3 in *)
414 M.Intersect (M.Intersect (build_intersect_obj l1, build_intersect_rel l2), build_intersect_sort l3)
417 let q_in = build_intersect must_use in
418 let q_select = M.Select ("uri0", q_in, q_where can_use) in
420 (* variables for can restrictions *)
422 let q_let_u = M.LetVVar ("universe", M.Const universe, q_select) in
424 let rec q_let_s sor n =
427 | [s] -> M.LetVVar ("sort" ^ (string_of_int n), M.Const [s], q_let_u)
428 | s::tl -> M.LetVVar ("sort" ^ (string_of_int n), M.Const [s], q_let_s tl (n+1))
431 (* let q_let_s = M.LetVVar ("sorts", M.Const sor, q_let_u) in *)
433 let rec q_let_ds sdep n =
436 | [None] -> q_let_s sor 1
437 | (None)::tl -> q_let_ds tl (n+1)
438 | [Some d] -> M.LetVVar ("sort_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_s sor 1)
439 | (Some d)::tl -> M.LetVVar ("sort_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_ds tl (n+1))
442 (* let q_let_ds = M.LetVVar ("sort_depths", M.Const sdep, q_let_s) in *)
444 let rec q_let_dr rdep n =
447 | [None] -> q_let_ds sdep 1
448 | (None)::tl -> q_let_dr tl (n+1)
449 | [Some d] -> M.LetVVar ("rel_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_ds sdep 1)
450 | (Some d)::tl -> M.LetVVar ("rel_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_dr tl (n+1))
454 (*let q_let_dr = M.LetVVar ("rel_depths", M.Const rdep, q_let_ds) in*)
456 let rec q_let_do odep n =
459 | [None] -> q_let_dr rdep 1
460 | (None)::tl -> q_let_do tl (n+1)
461 | [Some d] -> M.LetVVar ("obj_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_dr rdep 1)
462 | (Some d)::tl -> M.LetVVar ("obj_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_do tl (n+1))
466 (* let q_let_do = M.LetVVar ("obj_depths", M.Const odep, q_let_dr) in *)
469 let rec q_let_ps spos n =
471 [] -> q_let_do odep 1
472 | [p] -> M.LetVVar ("sort_position" ^ (string_of_int n), M.Const [p], q_let_do odep 1)
473 | p::tl -> M.LetVVar ("sort_position" ^ (string_of_int n), M.Const [p], q_let_ps tl (n+1))
477 (* let q_let_ps = M.LetVVar ("sort_positions", M.Const spos, q_let_do) in *)
480 let rec q_let_pr rpos n =
482 [] -> q_let_ps spos 1
483 | [p] -> M.LetVVar ("rel_position" ^ (string_of_int n), M.Const [p], q_let_ps spos 1)
484 | p::tl -> M.LetVVar ("rel_position" ^ (string_of_int n), M.Const [p], q_let_pr tl (n+1))
489 (* let q_let_pr = M.LetVVar ("rel_positions", M.Const rpos, q_let_ps) in *)
491 let rec q_let_po opos n =
493 [] -> q_let_pr rpos 1
494 | [p] -> M.LetVVar ("obj_position" ^ (string_of_int n), M.Const [p], q_let_pr rpos 1)
495 | p::tl -> M.LetVVar ("obj_position" ^ (string_of_int n), M.Const [p], q_let_po tl (n+1))
498 (*let q_let_po = M.LetVVar ("obj_positions", M.Const opos, q_let_pr) in*)
500 let query = (M.Ref (M.RefOf (q_let_po opos 1))) in
502 print_endline "### "; MQueryUtil.text_of_query print_string query "\n"; flush stdout;