X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Focaml%2Ftactics%2FvariousTactics.ml;h=c1006032471a7d6fffc86959dcedca987c4a05bf;hb=acf29bdbdcdc6ad8c2d9d27e8a47500981b605cd;hp=70952d84d5157d2d6a73f1aec8b89165261824f4;hpb=f654787b2156ede958a1d35ca8daf239de1b7b89;p=helm.git diff --git a/helm/ocaml/tactics/variousTactics.ml b/helm/ocaml/tactics/variousTactics.ml index 70952d84d..c10060324 100644 --- a/helm/ocaml/tactics/variousTactics.ml +++ b/helm/ocaml/tactics/variousTactics.ml @@ -23,103 +23,42 @@ * http://cs.unibo.it/helm/. *) -let search_theorems_in_context ~status:((proof,goal) as status) = - let module C = Cic in - let module R = CicReduction in - let module S = CicSubstitution 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 (PrimitiveTactics.apply_tac ~status ~term:(C.Rel n)) - with - ProofEngineTypes.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 NotApplicableTheorem;; -exception MaxDepth;; - -let depth = 5;; - -let rec auto_tac mqi_handle level proof goal = -prerr_endline "Entro in Auto_rec"; -if level = 0 then - (* (proof, [goal]) *) - (prerr_endline ("NON ci credo"); - raise MaxDepth) -else - (* choices is a list of pairs proof and goallist *) - let choices = - (search_theorems_in_context ~status:(proof,goal))@ - (TacticChaser.searchTheorems mqi_handle ~status:(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,opengoals) goal -> - let newproof, newgoals = auto_tac mqi_handle (level-1) proof goal in - (newproof, newgoals@opengoals)) - (proof,[]) goallist - with - | MaxDepth - | NotApplicableTheorem -> - try_choices tl) in - try_choices choices;; - -let auto_tac mqi_handle ~status:(proof,goal) = - prerr_endline "Entro in Auto"; - try - let res = auto_tac mqi_handle depth proof goal in -prerr_endline "AUTO_TAC HA FINITO"; - res - 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");; (* 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 funzione di callback che restituisce la (sola) hyp da applicare *) -let assumption_tac ~status:((proof,goal) as status) = +let assumption_tac = + let module PET = ProofEngineTypes in + let assumption_tac status = + let (proof, goal) = status in let module C = Cic in let module R = CicReduction in let module S = CicSubstitution 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 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 (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 (ProofEngineTypes.Fail "Assumption: No such assumption") - in PrimitiveTactics.apply_tac ~status ~term:(C.Rel (find 1 context)) + | [] -> raise (PET.Fail "Assumption: No such assumption") + in PET.apply_tactic (PT.apply_tac ~term:(C.Rel (find 1 context))) status + in + PET.mk_tactic assumption_tac ;; (* ANCORA DA DEBUGGARE *) @@ -130,41 +69,56 @@ exception AllSelectedTermsMustBeConvertible;; e li aggiunga nel context, poi si conta la lunghezza di questo nuovo contesto e si lifta di tot... COSA SIGNIFICA TUTTO CIO'?????? *) -let generalize_tac - ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name) - terms ~status:((proof,goal) as status) -= - 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) - in - T.thens - ~start: - (P.cut_tac - (C.Prod( - (mk_fresh_name_callback metasenv context C.Anonymous typ), - typ, - (ProofEngineReduction.replace_lifting_csc 1 - ~equality:(==) - ~what:terms - ~with_what:(List.map (function _ -> C.Rel 1) terms) - ~where:ty) - ))) - ~continuations: [(P.apply_tac ~term:(C.Rel 1)) ; T.id_tac] - ~status +let generalize_tac + ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[]) terms + = + let module PET = ProofEngineTypes in + let generalize_tac mk_fresh_name_callback terms status = + 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 *) + let u = List.fold_left ( (* TASSI: FIXME *) + fun u t -> + let b,u1 = CicReduction.are_convertible context he t u in + if not b then + raise AllSelectedTermsMustBeConvertible + else + u1) CicUniv.empty_ugraph tl in + (CicTypeChecker.type_of_aux' metasenv context he u) + in + PET.apply_tactic + (T.thens + ~start: + (P.cut_tac + (C.Prod( + (mk_fresh_name_callback metasenv context C.Anonymous ~typ:typ), + typ, + (ProofEngineReduction.replace_lifting_csc 1 + ~equality:(==) + ~what:terms + ~with_what:(List.map (function _ -> C.Rel 1) terms) + ~where:ty) + ))) + ~continuations: [(P.apply_tac ~term:(C.Rel 1)) ; T.id_tac]) + status + in + PET.mk_tactic (generalize_tac mk_fresh_name_callback terms) ;; +let set_goal n = + ProofEngineTypes.mk_tactic + (fun (proof, goal) -> + let (_, metasenv, _, _) = proof in + if CicUtil.exists_meta n metasenv then + (proof, [n]) + else + raise (ProofEngineTypes.Fail ("no such meta: " ^ string_of_int n)))