X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Focaml%2Ftactics%2FvariousTactics.ml;h=927552f0a60219c558dc35a38368541f90586ed7;hb=97c2d258a5c524eb5c4b85208899d80751a2c82f;hp=ccbf6c63c92d5412040e5ead5c1a28a265e71381;hpb=7ec7262cfa317c1962164350361f82a56c5d1826;p=helm.git diff --git a/helm/ocaml/tactics/variousTactics.ml b/helm/ocaml/tactics/variousTactics.ml index ccbf6c63c..927552f0a 100644 --- a/helm/ocaml/tactics/variousTactics.ml +++ b/helm/ocaml/tactics/variousTactics.ml @@ -23,218 +23,6 @@ * http://cs.unibo.it/helm/. *) - -(* Da rimuovere, solo per debug*) -let print_context ctx = - let print_name = - function - Cic.Name n -> n - | Cic.Anonymous -> "_" - in - List.fold_right - (fun i (output,context) -> - let (newoutput,context') = - match i with - Some (n,Cic.Decl t) -> - print_name n ^ ":" ^ CicPp.pp t context ^ "\n", (Some n)::context - | Some (n,Cic.Def (t,None)) -> - print_name n ^ ":=" ^ CicPp.pp t context ^ "\n", (Some n)::context - | None -> - "_ ?= _\n", None::context - | Some (_,Cic.Def (_,Some _)) -> assert false - in - output^newoutput,context' - ) ctx ("",[]) - ;; - - - - - -let search_theorems_in_context status = - let (proof, goal) = status in - let module C = Cic in - let module R = CicReduction in - let module S = CicSubstitution in - let module PET = ProofEngineTypes in - let module PT = PrimitiveTactics in - prerr_endline "Entro in search_context"; - let _,metasenv,_,_ = proof in - let _,context,ty = CicUtil.lookup_meta goal metasenv in - let rec find n = function - [] -> [] - | hd::tl -> - let res = - try - Some (PET.apply_tactic (PT.apply_tac ~term:(C.Rel n)) status ) - with - PET.Fail _ -> None in - (match res with - Some res -> res::(find (n+1) tl) - | None -> find (n+1) tl) - in - try - let res = find 1 context in - prerr_endline "Ho finito context"; - res - with Failure s -> - prerr_endline ("SIAM QUI = " ^ s); [] -;; - -exception NotAProposition;; -exception NotApplicableTheorem;; -exception MaxDepth;; - -let depth = 3;; - -(* -let rec auto_tac_aux mqi_handle level proof goal = -prerr_endline ("Entro in Auto_rec; level = " ^ (string_of_int level)); -if level = 0 then - (* (proof, [goal]) *) - (prerr_endline ("MaxDepth"); - raise MaxDepth) -else - (* let us verify that the metavariable is still an open goal -- - it could have been closed by closing other goals -- and that - it is of sort Prop *) - let _,metasenv,_,_ = proof in - let meta_inf = - (try - let (_, ey ,ty) = CicUtil.lookup_meta goal metasenv in - Some (ey, ty) - with _ -> None) in - match meta_inf with - Some (ey, ty) -> - prerr_endline ("CURRENT GOAL = " ^ (CicPp.ppterm ty)); - prerr_endline ("CURRENT HYP = " ^ (fst (print_context ey))); - (* if the goal does not have a sort Prop we return the - current proof and a list containing the goal *) - let ty_sort = CicTypeChecker.type_of_aux' metasenv ey ty in - if CicReduction.are_convertible - ey (Cic.Sort Cic.Prop) ty_sort then - (* sort Prop *) - (* choices is a list of pairs proof and goallist *) - let choices = - (search_theorems_in_context (proof,goal))@ - (TacticChaser.searchTheorems mqi_handle (proof,goal)) - in - let rec try_choices = function - [] -> raise NotApplicableTheorem - | (proof,goallist)::tl -> -prerr_endline ("GOALLIST = " ^ string_of_int (List.length goallist)); - (try - List.fold_left - (fun proof goal -> - auto_tac_aux mqi_handle (level-1) proof goal) - proof goallist - with - | MaxDepth - | NotApplicableTheorem - | NotAProposition -> - try_choices tl) in - try_choices choices - else - (* CUT AND PASTE DI PROVA !! *) - let choices = - (search_theorems_in_context (proof,goal))@ - (TacticChaser.searchTheorems mqi_handle (proof,goal)) - in - let rec try_choices = function - [] -> raise NotApplicableTheorem - | (proof,[])::tl -> proof - | _::tl -> try_choices tl in - try_choices choices - (* raise NotAProposition *) - | None -> proof -;; - -let auto_tac mqi_handle = - let module PET = ProofEngineTypes in - let auto_tac mqi_handle (proof,goal) = - prerr_endline "Entro in Auto"; - try - let proof = auto_tac_aux mqi_handle depth proof goal in - prerr_endline "AUTO_TAC HA FINITO"; - (proof,[]) - with - | MaxDepth -> assert false (* this should happens only if depth is 0 above *) - | NotApplicableTheorem -> - prerr_endline("No applicable theorem"); - raise (ProofEngineTypes.Fail "No Applicable theorem") - in - PET.mk_tactic (auto_tac mqi_handle) -;; - -*) - -(**** ESPERIMENTO ************************) - -let new_search_theorems f proof goal depth gtl = - let local_choices = f (proof,goal) - in - List.map - (function (proof, goallist) -> - (proof, (List.map (function g -> (g,depth)) goallist)@gtl)) - local_choices -;; - -exception NoOtherChoices;; - -let rec auto_new mqi_handle = function - [] -> raise NoOtherChoices - | (proof, [])::tl -> (proof, [])::tl - | (proof, (goal,0)::gtl)::tl -> auto_new mqi_handle tl - | (proof, (goal,depth)::gtl)::tl -> - let _,metasenv,_,_ = proof in - let meta_inf = - (try - let (_, ey ,ty) = CicUtil.lookup_meta goal metasenv in - Some (ey, ty) - with _ -> None) in - match meta_inf with - Some (ey, ty) -> - prerr_endline ("CURRENT GOAL = " ^ (CicPp.ppterm ty)); - prerr_endline ("CURRENT HYP = " ^ (fst (print_context ey))); - let local_choices = - new_search_theorems - search_theorems_in_context proof goal (depth-1) gtl in - let global_choices = - new_search_theorems - (TacticChaser.searchTheorems mqi_handle) - proof goal (depth-1) gtl in - let all_choices = - local_choices@global_choices@tl in - let sorting_list (_,g1) (_,g2) = - let l1 = List.length g1 in - let l2 = List.length g2 in - if (l1 = l2 && not(l1 = 0)) then - (snd(List.nth g2 0)) - (snd(List.nth g1 0)) - else l1 - l2 in - let reorder = - List.stable_sort sorting_list all_choices - in - auto_new mqi_handle reorder - | None -> auto_new mqi_handle ((proof,gtl)::tl) -;; - - -let auto_tac mqi_handle = - CicMetaSubst.reset_counters (); - let auto_tac mqi_handle (proof,goal) = - prerr_endline "Entro in Auto"; - try - let (proof,_)::_ = auto_new mqi_handle [(proof, [(goal,depth)])] in - prerr_endline "AUTO_TAC HA FINITO"; - CicMetaSubst.print_counters (); - (proof,[]) - with - | NoOtherChoices -> - prerr_endline("Auto failed"); - raise (ProofEngineTypes.Fail "No Applicable theorem") - in - ProofEngineTypes.mk_tactic (auto_tac mqi_handle) -;; (* TODO se ce n'e' piu' di una, prende la prima che trova... sarebbe meglio chiedere: find dovrebbe restituire una lista di hyp (?) da passare all'utonto con una @@ -248,21 +36,26 @@ let assumption_tac = let module R = CicReduction in let module S = CicSubstitution in let module PT = PrimitiveTactics in - let _,metasenv,_,_ = proof in - let _,context,ty = CicUtil.lookup_meta goal metasenv in - let rec find n = function - hd::tl -> - (match hd with + let _,metasenv,_,_ = proof in + let _,context,ty = CicUtil.lookup_meta goal metasenv in + let rec find n = function + hd::tl -> + (match hd with (Some (_, C.Decl t)) when - (R.are_convertible context (S.lift n t) ty) -> n + fst (R.are_convertible context (S.lift n t) ty + CicUniv.empty_ugraph) -> n | (Some (_, C.Def (_,Some ty'))) when - (R.are_convertible context ty' ty) -> n - | (Some (_, C.Def (t,None))) when - (R.are_convertible context - (CicTypeChecker.type_of_aux' metasenv context (S.lift n t)) ty) -> n + fst (R.are_convertible context (S.lift n ty') ty + CicUniv.empty_ugraph) -> n + | (Some (_, C.Def (t,None))) -> + let ty_t, u = (* TASSI: FIXME *) + CicTypeChecker.type_of_aux' metasenv context (S.lift n t) + CicUniv.empty_ugraph in + let b,_ = R.are_convertible context ty_t ty u in + if b then n else find (n+1) tl | _ -> find (n+1) tl ) - | [] -> raise (PET.Fail "Assumption: No such assumption") + | [] -> raise (PET.Fail (lazy "Assumption: No such assumption")) in PET.apply_tactic (PT.apply_tac ~term:(C.Rel (find 1 context))) status in PET.mk_tactic assumption_tac @@ -270,37 +63,99 @@ let assumption_tac = (* ANCORA DA DEBUGGARE *) +exception UnableToDetectTheTermThatMustBeGeneralizedYouMustGiveItExplicitly;; +exception TheSelectedTermsMustLiveInTheGoalContext exception AllSelectedTermsMustBeConvertible;; - -(* serve una funzione che cerchi nel ty dal basso a partire da term, i lambda -e li aggiunga nel context, poi si conta la lunghezza di questo nuovo -contesto e si lifta di tot... COSA SIGNIFICA TUTTO CIO'?????? *) +exception GeneralizationInHypothesesNotImplementedYet;; let generalize_tac - ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name) terms + ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[]) + pattern = let module PET = ProofEngineTypes in - let generalize_tac mk_fresh_name_callback terms status = + let generalize_tac mk_fresh_name_callback + ~pattern:(term,hyps_pat,concl_pat) status + = + if hyps_pat <> [] then raise GeneralizationInHypothesesNotImplementedYet; let (proof, goal) = status in let module C = Cic in let module P = PrimitiveTactics in let module T = Tacticals in - let _,metasenv,_,_ = proof in - let _,context,ty = CicUtil.lookup_meta goal metasenv in - let typ = - match terms with - [] -> assert false - | he::tl -> - (* We need to check that all the convertibility of all the terms *) - List.iter - (function t -> - if not (CicReduction.are_convertible context he t) then - raise AllSelectedTermsMustBeConvertible - ) tl ; - (CicTypeChecker.type_of_aux' metasenv context he) + let uri,metasenv,pbo,pty = proof in + let (_,context,ty) as conjecture = CicUtil.lookup_meta goal metasenv in + let subst,metasenv,u,selected_hyps,terms_with_context = + ProofEngineHelpers.select ~metasenv ~ugraph:CicUniv.empty_ugraph + ~conjecture ~pattern in + let context = CicMetaSubst.apply_subst_context subst context in + let metasenv = CicMetaSubst.apply_subst_metasenv subst metasenv in + let pbo = CicMetaSubst.apply_subst subst pbo in + let pty = CicMetaSubst.apply_subst subst pty in + let status = (uri,metasenv,pbo,pty),goal in + let term = + match term with + None -> None + | Some term -> + Some (fun context metasenv ugraph -> + let term, metasenv, ugraph = term context metasenv ugraph in + CicMetaSubst.apply_subst subst term, metasenv, ugraph) + in + let u,typ,term, metasenv = + let context_of_t, (t, metasenv, u) = + match terms_with_context, term with + [], None -> + raise + UnableToDetectTheTermThatMustBeGeneralizedYouMustGiveItExplicitly + | [], Some t -> context, t context metasenv u + | (context_of_t, _)::_, Some t -> + context_of_t, t context_of_t metasenv u + | (context_of_t, t)::_, None -> context_of_t, (t, metasenv, u) in - PET.apply_tactic - (T.thens + let t,subst,metasenv' = + try + CicMetaSubst.delift_rels [] metasenv + (List.length context_of_t - List.length context) t + with + CicMetaSubst.DeliftingARelWouldCaptureAFreeVariable -> + raise TheSelectedTermsMustLiveInTheGoalContext in + (*CSC: I am not sure about the following two assertions; + maybe I need to propagate the new subst and metasenv *) + assert (subst = []); + assert (metasenv' = metasenv); + let typ,u = CicTypeChecker.type_of_aux' ~subst metasenv context t u in + u,typ,t,metasenv + in + (* We need to check: + 1. whether they live in the context of the goal; + if they do they are also well-typed since they are closed subterms + of a well-typed term in the well-typed context of the well-typed + term + 2. whether they are convertible + *) + ignore ( + (* TASSI: FIXME *) + List.fold_left + (fun u (context_of_t,t) -> + (* 1 *) + let t,subst,metasenv' = + try + CicMetaSubst.delift_rels [] metasenv + (List.length context_of_t - List.length context) t + with + CicMetaSubst.DeliftingARelWouldCaptureAFreeVariable -> + raise TheSelectedTermsMustLiveInTheGoalContext in + (*CSC: I am not sure about the following two assertions; + maybe I need to propagate the new subst and metasenv *) + assert (subst = []); + assert (metasenv' = metasenv); + (* 2 *) + let b,u1 = CicReduction.are_convertible ~subst context term t u in + if not b then + raise AllSelectedTermsMustBeConvertible + else + u1 + ) u terms_with_context) ; + PET.apply_tactic + (T.thens ~start: (P.cut_tac (C.Prod( @@ -308,14 +163,14 @@ let generalize_tac typ, (ProofEngineReduction.replace_lifting_csc 1 ~equality:(==) - ~what:terms - ~with_what:(List.map (function _ -> C.Rel 1) terms) + ~what:(List.map snd terms_with_context) + ~with_what:(List.map (function _ -> C.Rel 1) terms_with_context) ~where:ty) ))) - ~continuations: [(P.apply_tac ~term:(C.Rel 1)) ; T.id_tac]) + ~continuations: + [(P.apply_tac ~term:(C.Appl [C.Rel 1; CicSubstitution.lift 1 term])) ; + T.id_tac]) status in - PET.mk_tactic (generalize_tac mk_fresh_name_callback terms) + PET.mk_tactic (generalize_tac mk_fresh_name_callback ~pattern) ;; - -