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 t ty id ty' =
54 None -> Tacticals.id_tac
56 Tactics.change ~pattern:(None,[id,Cic.Implicit (Some `Hole)],None)
57 (fun _ metasenv ugraph -> ty,metasenv,ugraph)
62 ~mk_fresh_name_callback:(fun _ _ _ ~typ -> Cic.Name id))
64 [ continuation ; Tactics.apply t ]
71 (Tactics.apply ~term:t)
74 let we_need_to_prove t id ty =
78 None -> Tacticals.id_tac,t
80 Tactics.change ~pattern:(None,[id,Cic.Implicit (Some `Hole)],None)
81 (fun _ metasenv ugraph -> t,metasenv,ugraph), ty in
83 ProofEngineTypes.apply_tactic
87 ~mk_fresh_name_callback:(fun _ _ _ ~typ -> Cic.Name id))
88 ~continuations:[cont])
93 [fst; snd] -> [snd; fst]
98 ProofEngineTypes.mk_tactic aux
101 let existselim t id1 t1 id2 t2 =
102 (*BUG: t1 and t2 not used *)
103 (*PARSING BUG: t2 is parsed in the current context, but it may
104 have occurrences of id1 in it *)
105 Tactics.elim_intros t
106 ~mk_fresh_name_callback:
110 if !i = 1 then Cic.Name id1 else Cic.Name id2)
112 let andelim = existselim;;
114 let rewritingstep lhs rhs just conclude =
115 let aux ((proof,goal) as status) =
116 let (curi,metasenv,proofbo,proofty) = proof in
117 let _,context,_ = CicUtil.lookup_meta goal metasenv in
119 match LibraryObjects.eq_URI () with
120 None -> assert false (*TODO*)
122 Cic.MutInd (uri,0,[]), Cic.Const (LibraryObjects.trans_eq_URI ~eq:uri,[])
125 CicTypeChecker.type_of_aux' metasenv context rhs CicUniv.empty_ugraph in
128 None -> assert false (*TOOD*)
136 (CicTypeChecker.type_of_aux' metasenv context (Cic.Rel 1)
137 CicUniv.empty_ugraph)
139 Cic.Appl [_;_;plhs;prhs] -> plhs,prhs
140 | _ -> assert false in
143 (Some (Cic.Name id,_))::_ -> id
148 ProofEngineTypes.apply_tactic
150 ~start:(Tactics.apply ~term:trans)
152 [ Tactics.apply prhs ;
153 Tactics.apply (Cic.Rel 1) ;
154 Tactics.apply just]) status
156 let mk_fresh_name_callback =
157 fun metasenv context _ ~typ ->
158 FreshNamesGenerator.mk_fresh_name ~subst:[]
159 metasenv context name ~typ
161 ProofEngineTypes.apply_tactic
163 ~start:(Tactics.cut ~mk_fresh_name_callback
164 (Cic.Appl [eq ; ty ; plhs ; rhs]))
166 [ Tactics.clear ~hyps:[last_hyp_name] ;
168 ~start:(Tactics.apply ~term:trans)
170 [ Tactics.apply prhs ;
171 Tactics.apply (Cic.Rel 1) ;
176 None -> ProofEngineTypes.apply_tactic (Tactics.apply just) status
178 let mk_fresh_name_callback =
179 fun metasenv context _ ~typ ->
180 FreshNamesGenerator.mk_fresh_name ~subst:[]
181 metasenv context name ~typ
183 ProofEngineTypes.apply_tactic
186 (Tactics.cut ~mk_fresh_name_callback
187 (Cic.Appl [eq ; ty ; lhs ; rhs]))
188 ~continuations:[ Tacticals.id_tac ; Tactics.apply just ]) status
190 ProofEngineTypes.mk_tactic aux
193 let we_proceed_by_induction_on t pat =
194 (*BUG here: pat unused *)
195 Tactics.elim_intros ~depth:0 t
198 let case id ~params =
199 (*BUG here: id unused*)
200 (*BUG here: it does not verify that the previous branch is closed *)
201 (*BUG here: the params should be parsed telescopically*)
202 (*BUG here: the tactic_terms should be terms*)
203 let rec aux ~params ((proof,goal) as status) =
207 match ProofEngineTypes.apply_tactic (assume id t) status with
208 proof,[goal] -> aux tl (proof,goal)
211 ProofEngineTypes.mk_tactic (aux ~params)
214 let thesisbecomes t =
216 (*BUG here: missing check on t *)
218 None -> Tacticals.id_tac
220 Tactics.change ~pattern:(None,[],Some (Cic.Implicit (Some `Hole)))
221 (fun _ metasenv ugraph -> ty,metasenv,ugraph)
224 let byinduction t id = suppose t id None;;