X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fcomponents%2Facic_procedural%2Fprocedural2.ml;h=e3a2d62e757c47f4b89b5376d995c69fe8e8fa54;hb=b378b7f4f2a3a897c4b69f44d4d1d54cc4d0aa56;hp=9dcd20304dbab87e5ef3ffd2ca533472f1bbac74;hpb=916c558005ed665c62699a7a4c5347870c8a3efb;p=helm.git diff --git a/helm/software/components/acic_procedural/procedural2.ml b/helm/software/components/acic_procedural/procedural2.ml index 9dcd20304..e3a2d62e7 100644 --- a/helm/software/components/acic_procedural/procedural2.ml +++ b/helm/software/components/acic_procedural/procedural2.ml @@ -30,7 +30,6 @@ module TC = CicTypeChecker module Un = CicUniv module UM = UriManager module Obj = LibraryObjects -module HObj = HelmLibraryObjects module A = Cic2acic module Ut = CicUtil module E = CicEnvironment @@ -40,6 +39,7 @@ module HEL = HExtlib module DTI = DoubleTypeInference module NU = CicNotationUtil module L = Librarian +module G = GrafiteAst module Cl = ProceduralClassify module T = ProceduralTypes @@ -47,12 +47,14 @@ module Cn = ProceduralConversion module H = ProceduralHelpers type status = { - sorts : (C.id, A.sort_kind) Hashtbl.t; - types : (C.id, A.anntypes) Hashtbl.t; + sorts : (C.id, A.sort_kind) Hashtbl.t; + types : (C.id, A.anntypes) Hashtbl.t; + params : G.inline_param list; max_depth: int option; - depth: int; - context: C.context; - case: int list + depth : int; + defaults : bool; + context : C.context; + case : int list } let debug = ref false @@ -109,24 +111,22 @@ try | Some d -> if st.depth < d then true, msg else false, "DEPTH EXCEDED: " with Invalid_argument _ -> failwith "A2P.test_depth" -let is_rewrite_right = function - | C.AConst (_, uri, []) -> - UM.eq uri HObj.Logic.eq_ind_r_URI || Obj.is_eq_ind_r_URI uri +let is_rewrite_right st = function + | C.AConst (_, uri, []) -> st.defaults && Obj.is_eq_ind_r_URI uri | _ -> false -let is_rewrite_left = function - | C.AConst (_, uri, []) -> - UM.eq uri HObj.Logic.eq_ind_URI || Obj.is_eq_ind_URI uri +let is_rewrite_left st = function + | C.AConst (_, uri, []) -> st.defaults && Obj.is_eq_ind_URI uri | _ -> false -let is_fwd_rewrite_right hd tl = - if is_rewrite_right hd then match List.nth tl 3 with +let is_fwd_rewrite_right st hd tl = + if is_rewrite_right st hd then match List.nth tl 3 with | C.ARel _ -> true | _ -> false else false -let is_fwd_rewrite_left hd tl = - if is_rewrite_left hd then match List.nth tl 3 with +let is_fwd_rewrite_left st hd tl = + if is_rewrite_left st hd then match List.nth tl 3 with | C.ARel _ -> true | _ -> false else false @@ -138,16 +138,7 @@ try | {A.annsynthesized = st; A.annexpected = Some et} -> Some (st, et) | {A.annsynthesized = st; A.annexpected = None} -> Some (st, st) with Not_found -> None -with Invalid_argument _ -> failwith "A2P.get_inner_types" - -let is_proof st v = -try - let id = Ut.id_of_annterm v in - try match Hashtbl.find st.sorts id with - | `Prop -> true - | _ -> false - with Not_found -> H.is_proof st.context (H.cic v) -with Invalid_argument _ -> failwith "P1.is_proof" +with Invalid_argument _ -> failwith "P2.get_inner_types" let get_entry st id = let rec aux = function @@ -180,43 +171,57 @@ let get_type msg st t = H.get_type msg st.context (H.cic t) let anonymous_premise = C.Name "UNNAMED" -let mk_exp_args hd tl classes synth = +let mk_exp_args hd tl classes synth qs = + let exp = ref 0 in let meta id = C.AImplicit (id, None) in let map v (cl, b) = - if I.overlaps synth cl && b then v else meta "" + if I.overlaps synth cl then + let w = if H.is_atomic (H.cic v) then v else meta "" in + if b then v, v else meta "", w + else + meta "", meta "" in - let rec aux b = function - | [] -> b, [] + let rec rev a = function + | [] -> a + | hd :: tl -> + if snd hd <> meta "" then incr exp; + rev (snd hd :: a) tl + in + let rec aux = function + | [] -> [] | hd :: tl -> - if hd = meta "" then aux true tl else b, List.rev (hd :: tl) + if fst hd = meta "" then aux tl else rev [] (hd :: tl) in let args = T.list_rev_map2 map tl classes in - let b, args = aux false args in - if args = [] then b, hd else b, C.AAppl ("", hd :: args) + let args = aux args in + let part = !exp < List.length tl in + if args = [] then part, hd, qs else part, C.AAppl ("", hd :: args), qs let mk_convert st ?name sty ety note = + let ppterm t = + let a = ref "" in Ut.pp_term (fun s -> a := !a ^ s) [] st.context t; !a + in let e = Cn.hole "" in let csty, cety = H.cic sty, H.cic ety in - let script = + let note = if !debug then let sname = match name with None -> "" | Some (id, _) -> id in - let note = Printf.sprintf "%s: %s\nSINTH: %s\nEXP: %s" - note sname (Pp.ppterm csty) (Pp.ppterm cety) - in - [T.Note note] - else [] + Printf.sprintf "%s: %s\nSINTH: %s\nEXP: %s" + note sname (ppterm csty) (ppterm cety) + else "" in - assert (Ut.is_sober st.context csty); - assert (Ut.is_sober st.context cety); - if Ut.alpha_equivalence csty cety then script else + if H.alpha_equivalence ~flatten:true st.context csty cety then [T.Note note] else let sty, ety = H.acic_bc st.context sty, H.acic_bc st.context ety in match name with - | None -> T.Change (sty, ety, None, e, "") :: script + | None -> [T.Change (sty, ety, None, e, note)] | Some (id, i) -> begin match get_entry st id with - | C.Def _ -> assert false (* T.ClearBody (id, "") :: script *) + | C.Def _ -> + [T.Change (ety, sty, Some (id, Some id), e, note); + T.ClearBody (id, "") + ] | C.Decl _ -> - T.Change (ety, sty, Some (id, Some id), e, "") :: script + [T.Change (ety, sty, Some (id, Some id), e, note)] end let convert st ?name v = @@ -237,14 +242,14 @@ let mk_arg st = function | C.ARel (_, _, i, name) as what -> convert st ~name:(name, i) what | _ -> [] -let mk_fwd_rewrite st dtext name tl direction v t ity = +let mk_fwd_rewrite st dtext name tl direction v t ity ety = let compare premise = function | None -> true | Some s -> s = premise in assert (List.length tl = 6); let what, where, predicate = List.nth tl 5, List.nth tl 3, List.nth tl 2 in - let e = Cn.mk_pattern 1 predicate in + let e = Cn.mk_pattern 1 ety predicate in if (Cn.does_not_occur e) then st, [] else match where with | C.ARel (_, _, i, premise) as w -> @@ -265,17 +270,17 @@ let mk_fwd_rewrite st dtext name tl direction v t ity = end | _ -> assert false -let mk_rewrite st dtext where qs tl direction t = +let mk_rewrite st dtext where qs tl direction t ety = assert (List.length tl = 5); let predicate = List.nth tl 2 in - let e = Cn.mk_pattern 1 predicate in + let e = Cn.mk_pattern 1 ety predicate in let script = [T.Branch (qs, "")] in if (Cn.does_not_occur e) then script else T.Rewrite (direction, where, None, e, dtext) :: script let rec proc_lambda st what name v t = let name = match name with - | C.Anonymous -> H.mk_fresh_name st.context anonymous_premise + | C.Anonymous -> H.mk_fresh_name true st.context anonymous_premise | name -> name in let entry = Some (name, C.Decl (H.cic v)) in @@ -288,21 +293,26 @@ and proc_letin st what name v w t = let intro = get_intro name in let proceed, dtext = test_depth st in let script = if proceed then - let st, hyp, rqv = match get_inner_types st v with - | Some (ity, _) -> + let st, hyp, rqv = match get_inner_types st what, get_inner_types st v with + | Some (C.ALetIn (_, _, iv, iw, _), _), _ when + H.alpha_equivalence ~flatten:true st.context (H.cic v) (H.cic iv) && + H.alpha_equivalence ~flatten:true st.context (H.cic w) (H.cic iw) + -> + st, C.Def (H.cic v, H.cic w), [T.Intros (Some 1, [intro], dtext)] + | _, Some (ity, ety) -> let st, rqv = match v with - | C.AAppl (_, hd :: tl) when is_fwd_rewrite_right hd tl -> - mk_fwd_rewrite st dtext intro tl true v t ity - | C.AAppl (_, hd :: tl) when is_fwd_rewrite_left hd tl -> - mk_fwd_rewrite st dtext intro tl false v t ity - | v -> - assert (Ut.is_sober st.context (H.cic ity)); - let ity = H.acic_bc st.context ity in + | C.AAppl (_, hd :: tl) when is_fwd_rewrite_right st hd tl -> + mk_fwd_rewrite st dtext intro tl true v t ity ety + | C.AAppl (_, hd :: tl) when is_fwd_rewrite_left st hd tl -> + mk_fwd_rewrite st dtext intro tl false v t ity ety + | v -> + assert (Ut.is_sober st.context (H.cic ety)); + let ety = H.acic_bc st.context ety in let qs = [proc_proof (next st) v; [T.Id ""]] in - st, [T.Branch (qs, ""); T.Cut (intro, ity, dtext)] + st, [T.Branch (qs, ""); T.Cut (intro, ety, dtext)] in st, C.Decl (H.cic ity), rqv - | None -> + | _, None -> st, C.Def (H.cic v, H.cic w), [T.LetIn (intro, v, dtext)] in let entry = Some (name, hyp) in @@ -345,7 +355,11 @@ and proc_appl st what hd tl = let parsno, argsno = List.length classes, List.length tl in let decurry = parsno - argsno in let diff = goal_arity - decurry in - if diff < 0 then failwith (Printf.sprintf "NOT TOTAL: %i %s |--- %s" diff (Pp.ppcontext st.context) (Pp.ppterm (H.cic hd))); + if diff < 0 then + let text = Printf.sprintf "partial application: %i" diff in + prerr_endline ("Procedural 2: " ^ text); + [T.Exact (what, dtext ^ text)] + else let classes = Cl.adjust st.context tl ?goal classes in let rec mk_synth a n = if n < 0 then a else mk_synth (I.S.add n a) (pred n) @@ -355,30 +369,35 @@ and proc_appl st what hd tl = let script = List.rev (mk_arg st hd) in let tactic b t n = if b then T.Apply (t, n) else T.Exact (t, n) in match rc with - | Some (i, j, uri, tyno) -> + | Some (i, j, uri, tyno) when decurry = 0 -> let classes2, tl2, _, where = split2_last classes tl in let script2 = List.rev (mk_arg st where) @ script in let synth2 = I.S.add 1 synth in let names = H.get_ind_names uri tyno in let qs = proc_bkd_proofs (next st) synth2 names classes2 tl2 in - if List.length qs <> List.length names then + let ety = match get_inner_types st what with + | Some (_, ety) -> ety + | None -> + Cn.fake_annotate "" st.context (get_type "TC3" st what) + in + if List.length qs <> List.length names then let qs = proc_bkd_proofs (next st) synth [] classes tl in - let b, hd = mk_exp_args hd tl classes synth in + let b, hd, qs = mk_exp_args hd tl classes synth qs in script @ [tactic b hd (dtext ^ text); T.Branch (qs, "")] - else if is_rewrite_right hd then - script2 @ mk_rewrite st dtext where qs tl2 false what - else if is_rewrite_left hd then - script2 @ mk_rewrite st dtext where qs tl2 true what + else if is_rewrite_right st hd then + script2 @ mk_rewrite st dtext where qs tl2 false what ety + else if is_rewrite_left st hd then + script2 @ mk_rewrite st dtext where qs tl2 true what ety else let predicate = List.nth tl2 (parsno - i) in - let e = Cn.mk_pattern j predicate in + let e = Cn.mk_pattern j ety predicate in let using = Some hd in script2 @ [T.Elim (where, using, e, dtext ^ text); T.Branch (qs, "")] - | None -> + | _ -> let names = get_sub_names hd tl in let qs = proc_bkd_proofs (next st) synth names classes tl in - let b, hd = mk_exp_args hd tl classes synth in + let b, hd, qs = mk_exp_args hd tl classes synth qs in script @ [tactic b hd (dtext ^ text); T.Branch (qs, "")] else [T.Exact (what, dtext)] @@ -395,7 +414,12 @@ and proc_case st what uri tyno u v ts = let ps, _ = H.get_ind_parameters st.context (H.cic v) in let _, rps = HEL.split_nth lpsno ps in let rpsno = List.length rps in - let e = Cn.mk_pattern rpsno u in + let ety = match get_inner_types st what with + | Some (_, ety) -> ety + | None -> + Cn.fake_annotate "" st.context (get_type "TC4" st what) + in + let e = Cn.mk_pattern rpsno ety u in let text = "" in let script = List.rev (mk_arg st v) in script @ [T.Cases (v, e, dtext ^ text); T.Branch (qs, "")] @@ -458,51 +482,20 @@ try with Invalid_argument s -> failwith ("A2P.proc_bkd_proofs: " ^ s) -(* object costruction *******************************************************) - -let th_flavours = [`Theorem; `Lemma; `Remark; `Fact] +(* initialization ***********************************************************) -let def_flavours = [`Definition] - -let get_flavour ?flavour st v attrs = - let rec aux = function - | [] -> - if is_proof st v then List.hd th_flavours else List.hd def_flavours - | `Flavour fl :: _ -> fl - | _ :: tl -> aux tl +let init ~ids_to_inner_sorts ~ids_to_inner_types params context = + let depth_map x y = match x, y with + | None, G.IPDepth depth -> Some depth + | _ -> x in - match flavour with - | Some fl -> fl - | None -> aux attrs - -let proc_obj ?flavour ?(info="") st = function - | C.AConstant (_, _, s, Some v, t, [], attrs) -> - begin match get_flavour ?flavour st v attrs with - | flavour when List.mem flavour th_flavours -> - let ast = proc_proof st v in - let steps, nodes = T.count_steps 0 ast, T.count_nodes 0 ast in - let text = Printf.sprintf "%s\n%s%s: %u\n%s: %u\n%s" - "COMMENTS" info "Tactics" steps "Final nodes" nodes "END" - in - T.Statement (flavour, Some s, t, None, "") :: ast @ [T.Qed text] - | flavour when List.mem flavour def_flavours -> - [T.Statement (flavour, Some s, t, Some v, "")] - | _ -> - failwith "not a theorem, definition, axiom or inductive type" - end - | C.AConstant (_, _, s, None, t, [], attrs) -> - [T.Statement (`Axiom, Some s, t, None, "")] - | C.AInductiveDefinition (_, types, [], lpsno, attrs) -> - [T.Inductive (types, lpsno, "")] - | _ -> - failwith "not a theorem, definition, axiom or inductive type" - -let init ~ids_to_inner_sorts ~ids_to_inner_types ?depth context = { sorts = ids_to_inner_sorts; types = ids_to_inner_types; - max_depth = depth; + params = params; + max_depth = List.fold_left depth_map None params; depth = 0; + defaults = not (List.mem G.IPNoDefaults params); context = context; case = [] }