* 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
+ 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 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)));
+ (*
+ let time1 = Unix.gettimeofday() in
+ let _, all_paths = NewConstraints.prefixes 5 ty in
+ let time2 = Unix.gettimeofday() in
+ prerr_endline
+ (Printf.sprintf "TEMPO DI CALCOLO = %1.3f" (time2 -. time1) );
+ prerr_endline
+ ("ALL PATHS: n = " ^ string_of_int
+ (List.length all_paths));
+ prerr_endline (NewConstraints.pp_prefixes all_paths);
+ *)
+ (* 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 (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");;
+*)
+
+(**** 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 _ ->
+ 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 reorder = all_choices in
+ auto_new mqi_handle reorder
+ | None -> auto_new mqi_handle ((proof,gtl)::tl)
+;;
+
+
+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";
+ (proof,[])
+ with
+ | NoOtherChoices ->
+ prerr_endline("Auto failed");
+ 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 status =
+ let (proof, goal) = status in
let module C = Cic in
let module R = CicReduction in
let module S = CicSubstitution in
| _ -> find (n+1) tl
)
| [] -> raise (ProofEngineTypes.Fail "Assumption: No such assumption")
- in PrimitiveTactics.apply_tac ~status ~term:(C.Rel (find 1 context))
+ in PrimitiveTactics.apply_tac status ~term:(C.Rel (find 1 context))
;;
(* ANCORA DA DEBUGGARE *)
let generalize_tac
?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name)
- terms ~status:((proof,goal) as status)
+ terms status
=
+ let (proof, goal) = status in
let module C = Cic in
let module P = PrimitiveTactics in
let module T = Tacticals in
~where:ty)
)))
~continuations: [(P.apply_tac ~term:(C.Rel 1)) ; T.id_tac]
- ~status
+ status
;;
projects / helm.git / blobdiff