1 (* Copyright (C) 2002, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
26 let search_theorems_in_context status =
27 let (proof, goal) = status in
29 let module R = CicReduction in
30 let module S = CicSubstitution in
31 prerr_endline "Entro in search_context";
32 let _,metasenv,_,_ = proof in
33 let _,context,ty = CicUtil.lookup_meta goal metasenv in
34 let rec find n = function
39 Some (PrimitiveTactics.apply_tac status ~term:(C.Rel n))
41 ProofEngineTypes.Fail _ -> None in
43 Some res -> res::(find (n+1) tl)
44 | None -> find (n+1) tl)
47 let res = find 1 context in
48 prerr_endline "Ho finito context";
51 prerr_endline ("SIAM QUI = " ^ s); []
54 exception NotAProposition;;
55 exception NotApplicableTheorem;;
60 let rec auto_tac_aux mqi_handle level proof goal =
61 prerr_endline ("Entro in Auto_rec; level = " ^ (string_of_int level));
64 (prerr_endline ("MaxDepth");
67 (* let us verify that the metavariable is still an open goal --
68 it could have been closed by closing other goals -- and that
70 let _,metasenv,_,_ = proof in
73 let (_, ey ,ty) = CicUtil.lookup_meta goal metasenv in
78 prerr_endline ("CURRENT GOAL = " ^ (CicPp.ppterm ty));
80 let time1 = Unix.gettimeofday() in
81 let _, all_paths = NewConstraints.prefixes 5 ty in
82 let time2 = Unix.gettimeofday() in
84 (Printf.sprintf "TEMPO DI CALCOLO = %1.3f" (time2 -. time1) );
86 ("ALL PATHS: n = " ^ string_of_int
87 (List.length all_paths));
88 prerr_endline (NewConstraints.pp_prefixes all_paths);
90 (* if the goal does not have a sort Prop we return the
91 current proof and a list containing the goal *)
92 let ty_sort = CicTypeChecker.type_of_aux' metasenv ey ty in
93 if CicReduction.are_convertible
94 ey (Cic.Sort Cic.Prop) ty_sort then
96 (* choices is a list of pairs proof and goallist *)
98 (search_theorems_in_context (proof,goal))@
99 (TacticChaser.searchTheorems mqi_handle (proof,goal))
101 let rec try_choices = function
102 [] -> raise NotApplicableTheorem
103 | (proof,goallist)::tl ->
104 prerr_endline ("GOALLIST = " ^ string_of_int (List.length goallist));
108 auto_tac_aux mqi_handle (level-1) proof goal)
112 | NotApplicableTheorem
117 (* CUT AND PASTE DI PROVA !! *)
119 (search_theorems_in_context (proof,goal))@
120 (TacticChaser.searchTheorems mqi_handle (proof,goal))
122 let rec try_choices = function
123 [] -> raise NotApplicableTheorem
124 | (proof,[])::tl -> proof
125 | _::tl -> try_choices tl in
127 (* raise NotAProposition *)
131 let auto_tac mqi_handle (proof,goal) =
132 prerr_endline "Entro in Auto";
134 let proof = auto_tac_aux mqi_handle depth proof goal in
135 prerr_endline "AUTO_TAC HA FINITO";
138 | MaxDepth -> assert false (* this should happens only if depth is 0 above *)
139 | NotApplicableTheorem ->
140 prerr_endline("No applicable theorem");
141 raise (ProofEngineTypes.Fail "No Applicable theorem");;
143 (* TODO se ce n'e' piu' di una, prende la prima che trova... sarebbe meglio
144 chiedere: find dovrebbe restituire una lista di hyp (?) da passare all'utonto con una
145 funzione di callback che restituisce la (sola) hyp da applicare *)
147 let assumption_tac status =
148 let (proof, goal) = status in
149 let module C = Cic in
150 let module R = CicReduction in
151 let module S = CicSubstitution in
152 let _,metasenv,_,_ = proof in
153 let _,context,ty = CicUtil.lookup_meta goal metasenv in
154 let rec find n = function
157 (Some (_, C.Decl t)) when
158 (R.are_convertible context (S.lift n t) ty) -> n
159 | (Some (_, C.Def (_,Some ty'))) when
160 (R.are_convertible context ty' ty) -> n
161 | (Some (_, C.Def (t,None))) when
162 (R.are_convertible context
163 (CicTypeChecker.type_of_aux' metasenv context (S.lift n t)) ty) -> n
166 | [] -> raise (ProofEngineTypes.Fail "Assumption: No such assumption")
167 in PrimitiveTactics.apply_tac status ~term:(C.Rel (find 1 context))
170 (* ANCORA DA DEBUGGARE *)
172 exception AllSelectedTermsMustBeConvertible;;
174 (* serve una funzione che cerchi nel ty dal basso a partire da term, i lambda
175 e li aggiunga nel context, poi si conta la lunghezza di questo nuovo
176 contesto e si lifta di tot... COSA SIGNIFICA TUTTO CIO'?????? *)
179 ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name)
182 let (proof, goal) = status in
183 let module C = Cic in
184 let module P = PrimitiveTactics in
185 let module T = Tacticals in
186 let _,metasenv,_,_ = proof in
187 let _,context,ty = CicUtil.lookup_meta goal metasenv in
192 (* We need to check that all the convertibility of all the terms *)
195 if not (CicReduction.are_convertible context he t) then
196 raise AllSelectedTermsMustBeConvertible
198 (CicTypeChecker.type_of_aux' metasenv context he)
204 (mk_fresh_name_callback metasenv context C.Anonymous typ),
206 (ProofEngineReduction.replace_lifting_csc 1
209 ~with_what:(List.map (function _ -> C.Rel 1) terms)
212 ~continuations: [(P.apply_tac ~term:(C.Rel 1)) ; T.id_tac]