1 (* Copyright (C) 2006, 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/.
29 (Tactics.intros ~howmany:1
30 ~mk_fresh_name_callback:(fun _ _ _ ~typ -> Cic.Name id) ())
32 (Tactics.change ~pattern:(None,[id,Cic.Implicit (Some `Hole)],None)
33 (fun _ metasenv ugraph -> t,metasenv,ugraph))
37 (*BUG: check on t missing *)
38 let ty = match ty with None -> t | Some ty -> ty in
41 (Tactics.intros ~howmany:1
42 ~mk_fresh_name_callback:(fun _ _ _ ~typ -> Cic.Name id) ())
44 (Tactics.change ~pattern:(None,[id,Cic.Implicit (Some `Hole)],None)
45 (fun _ metasenv ugraph -> ty,metasenv,ugraph))
48 let by_term_we_proved ~dbd t ty id ty' =
51 None -> Tactics.auto ~dbd ~params:[]
52 | Some t -> Tactics.apply t
56 None -> Tacticals.id_tac
58 Tactics.change ~pattern:(None,[id,Cic.Implicit (Some `Hole)],None)
59 (fun _ metasenv ugraph -> ty,metasenv,ugraph)
64 ~mk_fresh_name_callback:(fun _ _ _ ~typ -> Cic.Name id))
65 ~continuations:[ continuation ; just ]
71 None -> Tactics.auto ~dbd ~params:[]
72 | Some t -> Tactics.apply t
77 let we_need_to_prove t id ty =
81 None -> Tacticals.id_tac,t
83 Tactics.change ~pattern:(None,[id,Cic.Implicit (Some `Hole)],None)
84 (fun _ metasenv ugraph -> t,metasenv,ugraph), ty in
86 ProofEngineTypes.apply_tactic
90 ~mk_fresh_name_callback:(fun _ _ _ ~typ -> Cic.Name id))
91 ~continuations:[cont])
96 [fst; snd] -> [snd; fst]
101 ProofEngineTypes.mk_tactic aux
104 let existselim t id1 t1 id2 t2 =
105 (*BUG: t1 and t2 not used *)
106 (*PARSING BUG: t2 is parsed in the current context, but it may
107 have occurrences of id1 in it *)
108 Tactics.elim_intros t
109 ~mk_fresh_name_callback:
113 if !i = 1 then Cic.Name id1 else Cic.Name id2)
115 let andelim = existselim;;
117 let rewritingstep ~dbd lhs rhs just conclude =
118 let aux ((proof,goal) as status) =
119 let (curi,metasenv,proofbo,proofty) = proof in
120 let _,context,_ = CicUtil.lookup_meta goal metasenv in
122 match LibraryObjects.eq_URI () with
123 None -> raise (ProofEngineTypes.Fail (lazy "You need to register the default equality first. Please use the \"default\" command"))
125 Cic.MutInd (uri,0,[]), Cic.Const (LibraryObjects.trans_eq_URI ~eq:uri,[])
128 CicTypeChecker.type_of_aux' metasenv context rhs CicUniv.empty_ugraph in
133 ~params:["paramodulation","on"; "timeout","3"]
134 | Some just -> Tactics.apply just
141 (CicTypeChecker.type_of_aux' metasenv context (Cic.Rel 1)
142 CicUniv.empty_ugraph)
144 Cic.Appl [_;_;plhs;prhs] -> plhs,prhs
145 | _ -> assert false in
148 (Some (Cic.Name id,_))::_ -> id
153 ProofEngineTypes.apply_tactic
155 ~start:(Tactics.apply ~term:trans)
157 [ Tactics.apply prhs ;
158 Tactics.apply (Cic.Rel 1) ;
161 let mk_fresh_name_callback =
162 fun metasenv context _ ~typ ->
163 FreshNamesGenerator.mk_fresh_name ~subst:[]
164 metasenv context name ~typ
166 ProofEngineTypes.apply_tactic
168 ~start:(Tactics.cut ~mk_fresh_name_callback
169 (Cic.Appl [eq ; ty ; plhs ; rhs]))
171 [ Tactics.clear ~hyps:[last_hyp_name] ;
173 ~start:(Tactics.apply ~term:trans)
175 [ Tactics.apply prhs ;
176 Tactics.apply (Cic.Rel 1) ;
181 None -> ProofEngineTypes.apply_tactic just status
183 let mk_fresh_name_callback =
184 fun metasenv context _ ~typ ->
185 FreshNamesGenerator.mk_fresh_name ~subst:[]
186 metasenv context name ~typ
188 ProofEngineTypes.apply_tactic
191 (Tactics.cut ~mk_fresh_name_callback
192 (Cic.Appl [eq ; ty ; lhs ; rhs]))
193 ~continuations:[ Tacticals.id_tac ; just ]) status
195 ProofEngineTypes.mk_tactic aux
198 let we_proceed_by_induction_on t pat =
199 (*BUG here: pat unused *)
200 Tactics.elim_intros ~depth:0 t
203 let case id ~params =
204 (*BUG here: id unused*)
205 (*BUG here: it does not verify that the previous branch is closed *)
206 (*BUG here: the params should be parsed telescopically*)
207 (*BUG here: the tactic_terms should be terms*)
208 let rec aux ~params ((proof,goal) as status) =
212 match ProofEngineTypes.apply_tactic (assume id t) status with
213 proof,[goal] -> aux tl (proof,goal)
216 ProofEngineTypes.mk_tactic (aux ~params)
219 let thesisbecomes t =
221 (*BUG here: missing check on t *)
223 None -> Tacticals.id_tac
225 Tactics.change ~pattern:(None,[],Some (Cic.Implicit (Some `Hole)))
226 (fun _ metasenv ugraph -> ty,metasenv,ugraph)
229 let byinduction t id = suppose t id None;;