X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2FgTopLevel%2FmQueryGenerator.ml;h=7e061eb0be302de929f024498d6d275f8edd13fb;hb=7ff85e55518d06d96b9abbea4aa68d83e6be35b0;hp=8616cf9d2c9d04ff6fac696fae466d67e1586d88;hpb=161def82d0797a15a73f5b4826e81726ae8dd374;p=helm.git diff --git a/helm/gTopLevel/mQueryGenerator.ml b/helm/gTopLevel/mQueryGenerator.ml index 8616cf9d2..7e061eb0b 100644 --- a/helm/gTopLevel/mQueryGenerator.ml +++ b/helm/gTopLevel/mQueryGenerator.ml @@ -33,115 +33,22 @@ (* *) (******************************************************************************) -(* level managing functions *************************************************) +(* Query issuing functions **************************************************) -type levels_spec = (string * bool * int) list -let levels_of_term metasenv context term = - let module TC = CicTypeChecker in - let module Red = CicReduction in - let module Util = MQueryUtil in - let degree t = - let rec degree_aux = function - | Cic.Sort _ -> 1 - | Cic.Cast (u, _) -> degree_aux u - | Cic.Prod (_, _, t) -> degree_aux t - | _ -> 2 - in - let u = TC.type_of_aux' metasenv context t in - degree_aux (Red.whd context u) - in - let entry_eq (s1, b1, v1) (s2, b2, v2) = - s1 = s2 && b1 = b2 - in - let rec entry_in e = function - | [] -> [e] - | head :: tail -> - head :: if entry_eq head e then tail else entry_in e tail - in - let inspect_uri main l uri tc v term = - let d = degree term in - entry_in (Util.string_of_uriref (uri, tc), main, 2 * v + d - 1) l - in - let rec inspect_term main l v term = match term with - Cic.Rel _ -> l - | Cic.Meta _ -> l - | Cic.Sort _ -> l - | Cic.Implicit -> l - | Cic.Var (u,exp_named_subst) -> - let l' = inspect_uri main l u [] v term in - inspect_exp_named_subst l' (v+1) exp_named_subst - | Cic.Const (u,exp_named_subst) -> - let l' = inspect_uri main l u [] v term in - inspect_exp_named_subst l' (v+1) exp_named_subst - | Cic.MutInd (u, t, exp_named_subst) -> - let l' = inspect_uri main l u [t] v term in - inspect_exp_named_subst l' (v+1) exp_named_subst - | Cic.MutConstruct (u, t, c, exp_named_subst) -> - let l' = inspect_uri main l u [t; c] v term in - inspect_exp_named_subst l' (v+1) exp_named_subst - | Cic.Cast (uu, _) -> - inspect_term main l v uu - | Cic.Prod (_, uu, tt) -> - let luu = inspect_term false l (v + 1) uu in - inspect_term main luu (v + 1) tt - | Cic.Lambda (_, uu, tt) -> - let luu = inspect_term false l (v + 1) uu in - inspect_term false luu (v + 1) tt - | Cic.LetIn (_, uu, tt) -> - let luu = inspect_term false l (v + 1) uu in - inspect_term false luu (v + 1) tt - | Cic.Appl m -> inspect_list main l true v m - | Cic.MutCase (u, t, tt, uu, m) -> - let lu = inspect_uri main l u [t] (v + 1) term in - let ltt = inspect_term false lu (v + 1) tt in - let luu = inspect_term false ltt (v + 1) uu in - inspect_list main luu false (v + 1) m - | Cic.Fix (_, m) -> inspect_ind l (v + 1) m - | Cic.CoFix (_, m) -> inspect_coind l (v + 1) m - and inspect_list main l head v = function - | [] -> l - | tt :: m -> - let ltt = inspect_term main l (if head then v else v + 1) tt in - inspect_list false ltt false v m - and inspect_exp_named_subst l v = function - [] -> l - | (_,t) :: tl -> - let l' = inspect_term false l v t in - inspect_exp_named_subst l' v tl - and inspect_ind l v = function - | [] -> l - | (_, _, tt, uu) :: m -> - let ltt = inspect_term false l v tt in - let luu = inspect_term false ltt v uu in - inspect_ind luu v m - and inspect_coind l v = function - | [] -> l - | (_, tt, uu) :: m -> - let ltt = inspect_term false l v tt in - let luu = inspect_term false ltt v uu in - inspect_coind luu v m - in - let rec inspect_backbone = function - | Cic.Cast (uu, _) -> inspect_backbone uu - | Cic.Prod (_, _, tt) -> inspect_backbone tt - | Cic.LetIn (_, uu, tt) -> inspect_backbone tt - | t -> inspect_term true [] 0 t - in - inspect_backbone term -let string_of_levels l sep = - let entry_out (s, b, v) = - let pos = if b then " HEAD: " else " TAIL: " in - string_of_int v ^ pos ^ s ^ sep - in - let rec levels_out = function - | [] -> "" - | head :: tail -> entry_out head ^ levels_out tail - in - levels_out l +type uri = string +type position = string +type depth = int option +type sort = string -(* Query issuing functions **************************************************) +type r_obj = (uri * position * depth) +type r_rel = (position* depth) +type r_sort = (position* depth * sort) + +type must_restrictions = (r_obj list * r_rel list * r_sort list) +type only_restrictions = + (r_obj list option * r_rel list option * r_sort list option) exception Discard @@ -199,45 +106,450 @@ let execute_query query = let locate s = let module M = MathQL in - let q = M.Ref (M.Fun "objectName" (M.Const [s])) in - execute_query q + let q = + M.Ref (M.Property true M.RefineExact ("objectName", []) (M.Const [s])) + in + execute_query q -let searchPattern e c t level = +let searchPattern must_use can_use = let module M = MathQL in - let v_pos = M.Const ["MainConclusion"; "InConclusion"] in - let q_where = M.Sub (M.RefOf ( - M.Select ("uri", - M.Relation (M.ExactOp, ["refObj"], M.RVar "uri0", ["pos"]), - M.Ex ["uri"] (M.Meet (M.VVar "positions", M.Record ("uri", "pos"))) - )), M.VVar "universe" - ) - in - let uri_of_entry (r, b, v) = r in - let rec restrict level = function - | [] -> [] - | (u, b, v) :: tail -> - if v <= level then (u, b, v) :: restrict level tail - else restrict level tail - in - let build_select (r, b, v) = - let pos = if b then "MainConclusion" else "InConclusion" in - M.Select - ("uri", - M.Relation (M.ExactOp, ["backPointer"], M.Ref (M.Const [r]), ["pos"]), - M.Ex ["uri"] (M.Sub (M.Const [pos], M.Record ("uri", "pos"))) - ) + let in_path s = (s, []) in + let assign v p = (in_path v, in_path p) in + +(* can restrictions *) + + let (cr_o,cr_r,cr_s) = can_use in + + let uri_of_entry (r, p, d) = r in + + let universe = + match cr_o with + None -> [] + | Some cr_o -> List.map uri_of_entry cr_o + in + + let tfst (a,b,c) = a in + let tsnd (a,b,c) = b in + let trd (a,b,c) = c in + + let to_int_list l d = + match d with + None -> l + | Some d -> l@[d] + in + + let opos = + match cr_o with + None -> [] + | Some cr_o -> (List.map tsnd cr_o) in + + let odep = + match cr_o with + None -> [] + | Some cr_o -> List.map trd cr_o + (* let odep_option_list = List.map trd cr_o in + let lo_dep_int = List.fold_left to_int_list [] odep_option_list in + List.map string_of_int lo_dep_int*) + in + print_string "#### LUNGHEZZA ODEP: "; print_int (List.length odep); flush stdout; + print_endline""; + let rpos = + match cr_r with + None -> [] + | Some cr_r -> (List.map fst cr_r) in + + let rdep = + match cr_r with + None -> [] + | Some cr_r -> List.map snd cr_r + (* let rdep_option_list = List.map snd cr_r in + let lr_dep_int = List.fold_left to_int_list [] rdep_option_list in + List.map string_of_int lr_dep_int *) in - let rec build_intersect = function - | [] -> M.Pattern (M.Const [".*"]) - | [hd] -> build_select hd - | hd :: tl -> M.Intersect (build_select hd, build_intersect tl) - in - let levels = levels_of_term e c t in - let rest = restrict level levels in - info := [string_of_int (List.length rest)]; - let q_in = build_intersect rest in - let q_select = M.Select ("uri0", q_in, q_where) in - let universe = M.Const (List.map uri_of_entry levels) in - let q_let_u = M.LetVVar ("universe", universe, q_select) in - let q_let_p = M.LetVVar ("positions", v_pos, q_let_u) in - execute_query q_let_p + + + let spos = + match cr_s with + None -> [] + | Some cr_s -> (List.map tfst cr_s) in + + + let sdep = + match cr_s with + None -> [] + | Some cr_s -> List.map tsnd cr_s + (* let sdep_option_list = List.map tsnd cr_s in + let ls_dep_int = List.fold_left to_int_list [] sdep_option_list in + List.map string_of_int ls_dep_int*) + in + + + let sor = + match cr_s with + None -> [] + | Some cr_s -> List.map trd cr_s in + + (* let q_where_obj = function + Some l -> + if odep = [] then + M.Sub + (M.RefOf + (M.Select + ("uri", + M.Relation (false, M.RefineExact, in_path "refObj", M.Ref (M.RefOf (M.RVar "uri0")), [assign "pos" "position"]), + M.Ex ["uri"] + (M.Meet (M.VVar "obj_positions", M.Record ("uri", in_path "pos"))))), + M.VVar "universe") + else + M.Sub + (M.RefOf + (M.Select + ("uri", + M.Relation + (false, M.RefineExact, in_path "refObj", + M.Ref (M.RefOf (M.RVar "uri0")), + [assign "p" "position"; assign "d" "depth"] + ), + M.Ex ["uri"] + (M.And + ((M.Meet(M.VVar "obj_positions",M.Record("uri",in_path "p"))), + (M.Meet(M.VVar "obj_depths", M.Record("uri",in_path "d"))))) + ) + ), + M.VVar "universe" + ) + + | None -> M.True + in*) + + + + let q_where_obj n = function + Some l -> + let rec q_ex n = function + [] -> M.True + | [(u,p,None)] -> + M.Meet (M.VVar ("obj_position" ^ string_of_int n), M.Record ("uri", in_path "p")) + + | [(u,p,d)] -> + print_string "@@@@@ IN-WHERE-OBJ"; flush stdout; + print_endline""; + M.And + (M.Meet(M.VVar ("obj_position" ^ string_of_int n),M.Record("uri",in_path "p")), + M.Meet(M.VVar ("obj_depth" ^ string_of_int n), M.Record("uri",in_path "d"))) + | (u,p,None)::tl -> + M.Or + (M.Meet (M.VVar ("obj_position" ^ string_of_int n), M.Record ("uri", in_path "p")), + q_ex (n+1) tl) + | (u,p,d)::tl -> + print_string "@@@@@ IN-WHERE-OBJ"; flush stdout; + print_endline""; + M.Or + ((M.And + ((M.Meet(M.VVar ("obj_position" ^ string_of_int n),M.Record("uri",in_path "p"))), + (M.Meet(M.VVar ("obj_depth" ^ string_of_int n), M.Record("uri",in_path "d"))))), + q_ex (n+1) tl) + in + M.Sub + (M.RefOf + (M.Select + ("uri", + M.Relation + (false, M.RefineExact, in_path "refObj", + M.Ref (M.RefOf (M.RVar "uri0")), + [assign "p" "position"; assign "d" "depth"] + ), + M.Ex ["uri"] + (q_ex 1 l))), + M.VVar "universe") + | None -> M.True + in + + + + + let rec q_where_rel n cr_r= (*function*) + (* Some l ->*) + let q0 = + M.Sub + (M.Property + (false, M.RefineExact, ("refRel", ["position"]), + M.RefOf(M.RVar "uri0")), + M.VVar ("rel_position" ^ string_of_int n)) + in + match cr_r with + Some [] -> M.True + | Some [(p,None)] -> q0 + | Some [(p,d)] -> + M.And + (q0, + M.Sub + (M.Property + (false, M.RefineExact, ("refRel", ["depth"]), + M.RefOf(M.RVar "uri0")), + M.VVar ("rel_depth" ^ string_of_int n))) + | Some ((p,None)::tl) -> + M.Or + (q0, + q_where_rel (n+1) (Some tl)) + | Some ((p,d)::tl) -> + M.Or + (M.And + (q0, + M.Sub + (M.Property + (false, M.RefineExact, ("refRel", ["depth"]), + M.RefOf(M.RVar "uri0")), + M.VVar ("rel_depth" ^ string_of_int n))), + q_where_rel (n+1) (Some tl)) + | None -> M.True + in + + let rec q_where_sort n cr_s = (*function *) + (* Some l ->*) + let q0 = + M.And + (M.Sub + (M.Property + (false, M.RefineExact, ("refSort", ["position"]), + M.RefOf(M.RVar "uri0") + ), + M.VVar ("sort_position" ^ string_of_int n)), + M.Sub + (M.Property + (false, M.RefineExact, ("refSort", ["sort"]), + M.RefOf(M.RVar "uri0")), + M.VVar ("sort" ^ string_of_int n))) + in + match cr_s with + Some [] -> M.True + | Some [(p,None,s)] -> q0 + + | Some [(p,d,s)] -> + M.And + (q0, + M.Sub + (M.Property + (false, M.RefineExact, ("refSort", ["depth"]), + M.RefOf(M.RVar "uri0")), + M.VVar ("sort_depth" ^ string_of_int n))) + + | Some ((p,None,s)::tl) -> + M.Or + (q0, + q_where_sort (n+1) (Some tl)) + + | Some((p,d,s)::tl) -> + M.Or + (M.And + (q0, + M.Sub + (M.Property + (false, M.RefineExact, ("refSort", ["depth"]), + M.RefOf(M.RVar "uri0")), + M.VVar ("sort_depth" ^ string_of_int n))), + q_where_sort (n+1) (Some tl)) + | None -> M.True + in + + + + + let q_where cr = + let (cr_o,cr_r,cr_s) = cr in + M.And(M.And(q_where_obj 1 cr_o, (q_where_rel 1 cr_r)), (q_where_sort 1 cr_s)) + + in + +(* must restrictions *) + + let build_select_obj (r, pos, dep) = + match dep with + None -> M.Select + ("uri", + M.Relation (false, M.RefineExact, ("backPointer", []), + M.Ref (M.Const [r]), [assign "p" "position"]), + M.Ex ["uri"] + ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))))) + | Some dep -> let string_dep = string_of_int dep in + M.Select + ("uri", + M.Relation (false, M.RefineExact, ("backPointer", []), + M.Ref (M.Const [r]), [assign "p" "position";assign "d" "depth"]), + M.Ex ["uri"] + (M.And + ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))), + (M.Sub (M.Const [string_dep], M.Record ("uri", in_path "d")))))) + in + + let build_select_rel (pos, dep) = + match dep with + None -> M.Select + ("uri", + M.Relation (true, M.RefineExact, ("refRel", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth"]), + M.Ex ["uri"] + (M.Sub (M.Const [pos], M.Record ("uri", in_path "p")))) + | Some dep -> let string_dep = string_of_int dep in + M.Select + ("uri", + M.Relation (true, M.RefineExact, ("refRel", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth"]), + M.Ex ["uri"] + (M.And + ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))), + (M.Sub (M.Const [string_dep], M.Record ("uri", in_path "d")))))) + in + + let build_select_sort (pos, dep, sor) = + match dep with + None -> M.Select + ("uri", + M.Relation (true, M.RefineExact, ("refSort", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth";assign "s" "sort"]), + M.Ex ["uri"] + (M.And + ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))), + (M.Sub (M.Const [sor], M.Record ("uri", in_path "s")))))) + + | Some dep -> let string_dep = string_of_int dep in + M.Select + ("uri", + M.Relation (true, M.RefineExact, ("refSort", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth";assign "s" "sort"]), + M.Ex ["uri"] + (M.And + ((M.And + ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))), + (M.Sub (M.Const [string_dep], M.Record ("uri", in_path "d"))))), + (M.Sub (M.Const [sor], M.Record ("uri", in_path "s")))))) + in + + let rec build_intersect_obj = function + [] -> M.Pattern (M.Const ["[.]*"]) + | [hd] -> build_select_obj hd + | hd :: tl -> M.Intersect (build_select_obj hd, build_intersect_obj tl) + in + + let rec build_intersect_rel = function + [] -> M.Ref(M.Const []) + | [hd] -> build_select_rel hd + | hd :: tl -> M.Intersect (build_select_rel hd, build_intersect_rel tl) + in + + let rec build_intersect_sort = function + [] -> M.Ref(M.Const []) + | [hd] -> build_select_sort hd + | hd :: tl -> M.Intersect (build_select_sort hd, build_intersect_sort tl) + in + + let build_intersect = function +(* let tostring_sort (a,b,c) = + let b1 = string_of_int b in + (a,b1,c) + in + let tostring_rel (a,b) = + let b1 = string_of_int b in + (a,b1) + in*) + +(* let (l1,l2,l3) = must in + match (l1,l2,l3) with *) + l1,[],[] -> build_intersect_obj l1 + | [],l2,[] -> (*let lrel = List.map tostring_rel l2 in*) + build_intersect_rel l2 + | [],[],l3 ->(* let lsort = List.map tostring_sort l3 in*) + build_intersect_sort l3 + | l1,l2,[] -> (*let lrel = List.map tostring_rel l2 in*) + M.Intersect (build_intersect_obj l1, build_intersect_rel l2) + | l1,[],l3 ->(* let lsort = List.map tostring_sort l3 in *) + M.Intersect (build_intersect_obj l1, build_intersect_sort l3) + | [],l2,l3 ->(* let lrel = List.map tostring_rel l2 in + let lsort = List.map tostring_sort l3 in*) + M.Intersect (build_intersect_rel l2, build_intersect_sort l3) + | l1,l2,l3 ->(* let lrel = List.map tostring_rel l2 in + let lsort = List.map tostring_sort l3 in *) + M.Intersect (M.Intersect (build_intersect_obj l1, build_intersect_rel l2), build_intersect_sort l3) + in + + let q_in = build_intersect must_use in + let q_select = M.Select ("uri0", q_in, q_where can_use) in + +(* variables for can restrictions *) + + let q_let_u = M.LetVVar ("universe", M.Const universe, q_select) in + + let rec q_let_s sor n = + match sor with + [] -> q_let_u + | [s] -> M.LetVVar ("sort" ^ (string_of_int n), M.Const [s], q_let_u) + | s::tl -> M.LetVVar ("sort" ^ (string_of_int n), M.Const [s], q_let_s tl (n+1)) + in + +(* let q_let_s = M.LetVVar ("sorts", M.Const sor, q_let_u) in *) + + let rec q_let_ds sdep n = + match sdep with + [] + | [None] -> q_let_s sor 1 + | (None)::tl -> q_let_ds tl (n+1) + | [Some d] -> M.LetVVar ("sort_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_s sor 1) + | (Some d)::tl -> M.LetVVar ("sort_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_ds tl (n+1)) + in + +(* let q_let_ds = M.LetVVar ("sort_depths", M.Const sdep, q_let_s) in *) + + let rec q_let_dr rdep n = + match rdep with + [] + | [None] -> q_let_ds sdep 1 + | (None)::tl -> q_let_dr tl (n+1) + | [Some d] -> M.LetVVar ("rel_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_ds sdep 1) + | (Some d)::tl -> M.LetVVar ("rel_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_dr tl (n+1)) + in + + + (*let q_let_dr = M.LetVVar ("rel_depths", M.Const rdep, q_let_ds) in*) + + let rec q_let_do odep n = + match odep with + [] + | [None] -> q_let_dr rdep 1 + | (None)::tl -> q_let_do tl (n+1) + | [Some d] -> M.LetVVar ("obj_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_dr rdep 1) + | (Some d)::tl -> M.LetVVar ("obj_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_do tl (n+1)) + in + + +(* let q_let_do = M.LetVVar ("obj_depths", M.Const odep, q_let_dr) in *) + + + let rec q_let_ps spos n = + match spos with + [] -> q_let_do odep 1 + | [p] -> M.LetVVar ("sort_position" ^ (string_of_int n), M.Const [p], q_let_do odep 1) + | p::tl -> M.LetVVar ("sort_position" ^ (string_of_int n), M.Const [p], q_let_ps tl (n+1)) + in + + +(* let q_let_ps = M.LetVVar ("sort_positions", M.Const spos, q_let_do) in *) + + + let rec q_let_pr rpos n = + match rpos with + [] -> q_let_ps spos 1 + | [p] -> M.LetVVar ("rel_position" ^ (string_of_int n), M.Const [p], q_let_ps spos 1) + | p::tl -> M.LetVVar ("rel_position" ^ (string_of_int n), M.Const [p], q_let_pr tl (n+1)) + in + + + +(* let q_let_pr = M.LetVVar ("rel_positions", M.Const rpos, q_let_ps) in *) + + let rec q_let_po opos n = + match opos with + [] -> q_let_pr rpos 1 + | [p] -> M.LetVVar ("obj_position" ^ (string_of_int n), M.Const [p], q_let_pr rpos 1) + | p::tl -> M.LetVVar ("obj_position" ^ (string_of_int n), M.Const [p], q_let_po tl (n+1)) + in + + (*let q_let_po = M.LetVVar ("obj_positions", M.Const opos, q_let_pr) in*) + +print_endline ("### " ^ MQueryUtil.text_of_query (q_let_po opos 1)) ; flush stdout; + execute_query (q_let_po opos 1)