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 open ProofEngineHelpers
29 exception NotAnInductiveTypeToEliminate
30 exception NotTheRightEliminatorShape
31 exception NoHypothesesFound
32 exception WrongUriToVariable of string
34 (* lambda_abstract newmeta ty *)
35 (* returns a triple [bo],[context],[ty'] where *)
36 (* [ty] = Pi/LetIn [context].[ty'] ([context] is a vector!) *)
37 (* and [bo] = Lambda/LetIn [context].(Meta [newmeta]) *)
38 (* So, lambda_abstract is the core of the implementation of *)
39 (* the Intros tactic. *)
40 let lambda_abstract metasenv context newmeta ty mk_fresh_name =
42 let rec collect_context context =
44 C.Cast (te,_) -> collect_context context te
46 let n' = mk_fresh_name metasenv context n ~typ:s in
47 let (context',ty,bo) =
48 collect_context ((Some (n',(C.Decl s)))::context) t
50 (context',ty,C.Lambda(n',s,bo))
52 let (context',ty,bo) =
53 collect_context ((Some (n,(C.Def (s,None))))::context) t
55 (context',ty,C.LetIn(n,s,bo))
58 CicMkImplicit.identity_relocation_list_for_metavariable context
60 context, t, (C.Meta (newmeta,irl))
62 collect_context context ty
64 let eta_expand metasenv context t arg =
65 let module T = CicTypeChecker in
66 let module S = CicSubstitution in
70 t' when t' = S.lift n arg -> C.Rel (1 + n)
71 | C.Rel m -> if m <= n then C.Rel m else C.Rel (m+1)
72 | C.Var (uri,exp_named_subst) ->
73 let exp_named_subst' = aux_exp_named_subst n exp_named_subst in
74 C.Var (uri,exp_named_subst')
77 List.map (function None -> None | Some t -> Some (aux n t)) l
81 | C.Implicit _ as t -> t
82 | C.Cast (te,ty) -> C.Cast (aux n te, aux n ty)
83 | C.Prod (nn,s,t) -> C.Prod (nn, aux n s, aux (n+1) t)
84 | C.Lambda (nn,s,t) -> C.Lambda (nn, aux n s, aux (n+1) t)
85 | C.LetIn (nn,s,t) -> C.LetIn (nn, aux n s, aux (n+1) t)
86 | C.Appl l -> C.Appl (List.map (aux n) l)
87 | C.Const (uri,exp_named_subst) ->
88 let exp_named_subst' = aux_exp_named_subst n exp_named_subst in
89 C.Const (uri,exp_named_subst')
90 | C.MutInd (uri,i,exp_named_subst) ->
91 let exp_named_subst' = aux_exp_named_subst n exp_named_subst in
92 C.MutInd (uri,i,exp_named_subst')
93 | C.MutConstruct (uri,i,j,exp_named_subst) ->
94 let exp_named_subst' = aux_exp_named_subst n exp_named_subst in
95 C.MutConstruct (uri,i,j,exp_named_subst')
96 | C.MutCase (sp,i,outt,t,pl) ->
97 C.MutCase (sp,i,aux n outt, aux n t,
100 let tylen = List.length fl in
103 (fun (name,i,ty,bo) -> (name, i, aux n ty, aux (n+tylen) bo))
106 C.Fix (i, substitutedfl)
108 let tylen = List.length fl in
111 (fun (name,ty,bo) -> (name, aux n ty, aux (n+tylen) bo))
114 C.CoFix (i, substitutedfl)
115 and aux_exp_named_subst n =
116 List.map (function uri,t -> uri,aux n t)
119 T.type_of_aux' metasenv context arg CicUniv.empty_ugraph (* TASSI: FIXME *)
122 FreshNamesGenerator.mk_fresh_name ~subst:[]
123 metasenv context (Cic.Name "Heta") ~typ:argty
125 (C.Appl [C.Lambda (fresh_name,argty,aux 0 t) ; arg])
127 (*CSC: ma serve solamente la prima delle new_uninst e l'unione delle due!!! *)
128 let classify_metas newmeta in_subst_domain subst_in metasenv =
130 (fun (i,canonical_context,ty) (old_uninst,new_uninst) ->
131 if in_subst_domain i then
132 old_uninst,new_uninst
134 let ty' = subst_in canonical_context ty in
135 let canonical_context' =
137 (fun entry canonical_context' ->
140 Some (n,Cic.Decl s) ->
141 Some (n,Cic.Decl (subst_in canonical_context' s))
142 | Some (n,Cic.Def (s,None)) ->
143 Some (n,Cic.Def ((subst_in canonical_context' s),None))
145 | Some (_,Cic.Def (_,Some _)) -> assert false
147 entry'::canonical_context'
148 ) canonical_context []
151 ((i,canonical_context',ty')::old_uninst),new_uninst
153 old_uninst,((i,canonical_context',ty')::new_uninst)
156 (* Auxiliary function for apply: given a type (a backbone), it returns its *)
157 (* head, a META environment in which there is new a META for each hypothesis,*)
158 (* a list of arguments for the new applications and the indexes of the first *)
159 (* and last new METAs introduced. The nth argument in the list of arguments *)
160 (* is just the nth new META. *)
161 let new_metasenv_for_apply newmeta proof context ty =
162 let module C = Cic in
163 let module S = CicSubstitution in
164 let rec aux newmeta =
166 C.Cast (he,_) -> aux newmeta he
167 (* CSC: patch to generate ?1 : ?2 : Type in place of ?1 : Type to simulate ?1 :< Type
168 (* If the expected type is a Type, then also Set is OK ==>
169 * we accept any term of type Type *)
170 (*CSC: BUG HERE: in this way it is possible for the term of
171 * type Type to be different from a Sort!!! *)
172 | C.Prod (name,(C.Sort (C.Type _) as s),t) ->
173 (* TASSI: ask CSC if BUG HERE refers to the C.Cast or C.Propd case *)
175 CicMkImplicit.identity_relocation_list_for_metavariable context
177 let newargument = C.Meta (newmeta+1,irl) in
178 let (res,newmetasenv,arguments,lastmeta) =
179 aux (newmeta + 2) (S.subst newargument t)
182 (newmeta,[],s)::(newmeta+1,context,C.Meta (newmeta,[]))::newmetasenv,
183 newargument::arguments,lastmeta
185 | C.Prod (name,s,t) ->
187 CicMkImplicit.identity_relocation_list_for_metavariable context
189 let newargument = C.Meta (newmeta,irl) in
190 let (res,newmetasenv,arguments,lastmeta) =
191 aux (newmeta + 1) (S.subst newargument t)
193 res,(newmeta,context,s)::newmetasenv,newargument::arguments,lastmeta
194 | t -> t,[],[],newmeta
196 (* WARNING: here we are using the invariant that above the most *)
197 (* recente new_meta() there are no used metas. *)
198 let (res,newmetasenv,arguments,lastmeta) = aux newmeta ty in
199 res,newmetasenv,arguments,lastmeta
201 (* Useful only inside apply_tac *)
203 generalize_exp_named_subst_with_fresh_metas context newmeta uri exp_named_subst
205 let module C = Cic in
207 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
208 CicUtil.params_of_obj o
210 let exp_named_subst_diff,new_fresh_meta,newmetasenvfragment,exp_named_subst'=
211 let next_fresh_meta = ref newmeta in
212 let newmetasenvfragment = ref [] in
213 let exp_named_subst_diff = ref [] in
219 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
221 C.Variable (_,_,ty,_,_) ->
222 CicSubstitution.subst_vars !exp_named_subst_diff ty
223 | _ -> raise (WrongUriToVariable (UriManager.string_of_uri uri))
225 (* CSC: patch to generate ?1 : ?2 : Type in place of ?1 : Type to simulate ?1 :< Type
227 C.Sort (C.Type _) as s -> (* TASSI: ?? *)
228 let fresh_meta = !next_fresh_meta in
229 let fresh_meta' = fresh_meta + 1 in
230 next_fresh_meta := !next_fresh_meta + 2 ;
231 let subst_item = uri,C.Meta (fresh_meta',[]) in
232 newmetasenvfragment :=
233 (fresh_meta,[],C.Sort (C.Type (CicUniv.fresh()))) ::
235 (fresh_meta',[],C.Meta (fresh_meta,[])) :: !newmetasenvfragment ;
236 exp_named_subst_diff := !exp_named_subst_diff @ [subst_item] ;
237 subst_item::(aux (tl,[]))
241 CicMkImplicit.identity_relocation_list_for_metavariable context
243 let subst_item = uri,C.Meta (!next_fresh_meta,irl) in
244 newmetasenvfragment :=
245 (!next_fresh_meta,context,ty)::!newmetasenvfragment ;
246 exp_named_subst_diff := !exp_named_subst_diff @ [subst_item] ;
247 incr next_fresh_meta ;
248 subst_item::(aux (tl,[]))(*)*)
249 | uri::tl1,((uri',_) as s)::tl2 ->
250 assert (UriManager.eq uri uri') ;
252 | [],_ -> assert false
254 let exp_named_subst' = aux (params,exp_named_subst) in
255 !exp_named_subst_diff,!next_fresh_meta,
256 List.rev !newmetasenvfragment, exp_named_subst'
258 new_fresh_meta,newmetasenvfragment,exp_named_subst',exp_named_subst_diff
261 let apply_tac_verbose ~term (proof, goal) =
262 (* Assumption: The term "term" must be closed in the current context *)
263 let module T = CicTypeChecker in
264 let module R = CicReduction in
265 let module C = Cic in
266 let (_,metasenv,_,_) = proof in
267 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
268 let newmeta = new_meta_of_proof ~proof in
269 let exp_named_subst_diff,newmeta',newmetasenvfragment,term' =
271 C.Var (uri,exp_named_subst) ->
272 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
273 generalize_exp_named_subst_with_fresh_metas context newmeta uri
276 exp_named_subst_diff,newmeta',newmetasenvfragment,
277 C.Var (uri,exp_named_subst')
278 | C.Const (uri,exp_named_subst) ->
279 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
280 generalize_exp_named_subst_with_fresh_metas context newmeta uri
283 exp_named_subst_diff,newmeta',newmetasenvfragment,
284 C.Const (uri,exp_named_subst')
285 | C.MutInd (uri,tyno,exp_named_subst) ->
286 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
287 generalize_exp_named_subst_with_fresh_metas context newmeta uri
290 exp_named_subst_diff,newmeta',newmetasenvfragment,
291 C.MutInd (uri,tyno,exp_named_subst')
292 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
293 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
294 generalize_exp_named_subst_with_fresh_metas context newmeta uri
297 exp_named_subst_diff,newmeta',newmetasenvfragment,
298 C.MutConstruct (uri,tyno,consno,exp_named_subst')
299 | _ -> [],newmeta,[],term
301 let metasenv' = metasenv@newmetasenvfragment in
302 let termty,_ = (* TASSI:FIXME *)
303 CicTypeChecker.type_of_aux' metasenv' context term CicUniv.empty_ugraph in
305 CicSubstitution.subst_vars exp_named_subst_diff termty
307 (* newmeta is the lowest index of the new metas introduced *)
308 let (consthead,newmetas,arguments,_) =
309 new_metasenv_for_apply newmeta' proof context termty
311 let newmetasenv = metasenv'@newmetas in
312 let subst,newmetasenv',_ = (* TASSI:FIXME *)
313 CicUnification.fo_unif newmetasenv context consthead ty
316 let in_subst_domain i = List.exists (function (j,_) -> i=j) subst in
317 let apply_subst = CicMetaSubst.apply_subst subst in
318 let old_uninstantiatedmetas,new_uninstantiatedmetas =
319 (* subst_in doesn't need the context. Hence the underscore. *)
320 let subst_in _ = CicMetaSubst.apply_subst subst in
321 classify_metas newmeta in_subst_domain subst_in newmetasenv'
325 (if List.length newmetas = 0 then
328 Cic.Appl (term'::arguments)
331 let newmetasenv'' = new_uninstantiatedmetas@old_uninstantiatedmetas in
333 (* if we just apply the subtitution, the type is irrelevant:
334 we may use Implicit, since it will be dropped *)
335 CicMetaSubst.apply_subst
336 ((metano,(context, bo', Cic.Implicit None))::subst)
338 let (newproof, newmetasenv''') =
339 subst_meta_and_metasenv_in_proof
340 proof metano subst_in newmetasenv''
342 (subst_in,(newproof, List.map (function (i,_,_) -> i) new_uninstantiatedmetas))
344 let apply_tac ~term status = snd (apply_tac_verbose ~term status)
346 let apply_tac_verbose ~term status =
348 apply_tac_verbose ~term status
349 (* TODO cacciare anche altre eccezioni? *)
350 with CicUnification.UnificationFailure _ as e ->
351 raise (Fail (Printexc.to_string e))
353 (* TODO per implementare i tatticali e' necessario che tutte le tattiche
354 sollevino _solamente_ Fail *)
355 let apply_tac ~term =
356 let apply_tac ~term status =
358 apply_tac ~term status
359 (* TODO cacciare anche altre eccezioni? *)
360 with CicUnification.UnificationFailure _ as e ->
361 raise (Fail (Printexc.to_string e))
363 mk_tactic (apply_tac ~term)
365 let intros_tac ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[]) ()=
367 ?(mk_fresh_name_callback = (FreshNamesGenerator.mk_fresh_name ~subst:[])) ()
370 let module C = Cic in
371 let module R = CicReduction in
372 let (_,metasenv,_,_) = proof in
373 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
374 let newmeta = new_meta_of_proof ~proof in
375 let (context',ty',bo') =
376 lambda_abstract metasenv context newmeta ty mk_fresh_name_callback
379 subst_meta_in_proof proof metano bo' [newmeta,context',ty']
381 (newproof, [newmeta])
383 mk_tactic (intros_tac ~mk_fresh_name_callback ())
385 let cut_tac?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[]) ~term=
387 ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[])
390 let module C = Cic in
391 let curi,metasenv,pbo,pty = proof in
392 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
393 let newmeta1 = new_meta_of_proof ~proof in
394 let newmeta2 = newmeta1 + 1 in
396 mk_fresh_name_callback metasenv context (Cic.Name "Hcut") ~typ:term in
397 let context_for_newmeta1 =
398 (Some (fresh_name,C.Decl term))::context in
400 CicMkImplicit.identity_relocation_list_for_metavariable
404 CicMkImplicit.identity_relocation_list_for_metavariable context
406 let newmeta1ty = CicSubstitution.lift 1 ty in
409 [C.Lambda (fresh_name,term,C.Meta (newmeta1,irl1)) ;
410 C.Meta (newmeta2,irl2)]
413 subst_meta_in_proof proof metano bo'
414 [newmeta2,context,term; newmeta1,context_for_newmeta1,newmeta1ty];
416 (newproof, [newmeta1 ; newmeta2])
418 mk_tactic (cut_tac ~mk_fresh_name_callback term)
420 let letin_tac ?(mk_fresh_name_callback=FreshNamesGenerator.mk_fresh_name ~subst:[]) ~term=
422 ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[])
425 let module C = Cic in
426 let curi,metasenv,pbo,pty = proof in
427 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
428 let _,_ = (* TASSI: FIXME *)
429 CicTypeChecker.type_of_aux' metasenv context term CicUniv.empty_ugraph in
430 let newmeta = new_meta_of_proof ~proof in
432 mk_fresh_name_callback metasenv context (Cic.Name "Hletin") ~typ:term in
433 let context_for_newmeta =
434 (Some (fresh_name,C.Def (term,None)))::context in
436 CicMkImplicit.identity_relocation_list_for_metavariable
439 let newmetaty = CicSubstitution.lift 1 ty in
440 let bo' = C.LetIn (fresh_name,term,C.Meta (newmeta,irl)) in
443 proof metano bo'[newmeta,context_for_newmeta,newmetaty]
445 (newproof, [newmeta])
447 mk_tactic (letin_tac ~mk_fresh_name_callback term)
449 (** functional part of the "exact" tactic *)
450 let exact_tac ~term =
451 let exact_tac ~term (proof, goal) =
452 (* Assumption: the term bo must be closed in the current context *)
453 let (_,metasenv,_,_) = proof in
454 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
455 let module T = CicTypeChecker in
456 let module R = CicReduction in
457 let ty_term,u = T.type_of_aux' metasenv context term CicUniv.empty_ugraph in
458 let b,_ = R.are_convertible context ty_term ty u in (* TASSI: FIXME *)
461 let (newproof, metasenv') =
462 subst_meta_in_proof proof metano term [] in
466 raise (Fail "The type of the provided term is not the one expected.")
468 mk_tactic (exact_tac ~term)
470 (* not really "primitive" tactics .... *)
472 let elim_tac ~term (proof, goal) =
473 let module T = CicTypeChecker in
474 let module U = UriManager in
475 let module R = CicReduction in
476 let module C = Cic in
477 let (curi,metasenv,proofbo,proofty) = proof in
478 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
479 let termty,_ = T.type_of_aux' metasenv context term CicUniv.empty_ugraph in
481 let uri,exp_named_subst,typeno,args =
483 C.MutInd (uri,typeno,exp_named_subst) -> (uri,exp_named_subst,typeno,[])
484 | C.Appl ((C.MutInd (uri,typeno,exp_named_subst))::args) ->
485 (uri,exp_named_subst,typeno,args)
486 | _ -> raise NotAnInductiveTypeToEliminate
489 let buri = U.buri_of_uri uri in
491 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
493 C.InductiveDefinition (tys,_,_,_) ->
494 let (name,_,_,_) = List.nth tys typeno in
498 let ty_ty,_ = T.type_of_aux' metasenv context ty CicUniv.empty_ugraph in
502 C.Sort C.Prop -> "_ind"
503 | C.Sort C.Set -> "_rec"
504 | C.Sort C.CProp -> "_rec"
505 | C.Sort (C.Type _)-> "_rect"
508 U.uri_of_string (buri ^ "/" ^ name ^ ext ^ ".con")
510 let eliminator_ref = C.Const (eliminator_uri,exp_named_subst) in
512 T.type_of_aux' metasenv context eliminator_ref CicUniv.empty_ugraph in
513 let rec find_args_no =
515 C.Prod (_,_,t) -> 1 + find_args_no t
516 | C.Cast (s,_) -> find_args_no s
517 | C.LetIn (_,_,t) -> 0 + find_args_no t
520 let args_no = find_args_no ety in
522 let rec make_tl base_case =
525 | n -> (C.Implicit None)::(make_tl base_case (n - 1))
527 C.Appl (eliminator_ref :: make_tl term (args_no - 1))
529 let metasenv', term_to_refine' =
530 CicMkImplicit.expand_implicits metasenv [] context term_to_refine in
531 let refined_term,_,metasenv'',_ = (* TASSI: FIXME *)
532 CicRefine.type_of_aux' metasenv' context term_to_refine'
536 ProofEngineHelpers.compare_metasenvs
537 ~oldmetasenv:metasenv ~newmetasenv:metasenv''
539 let proof' = curi,metasenv'',proofbo,proofty in
540 let proof'', new_goals' =
541 apply_tactic (apply_tac ~term:refined_term) (proof',goal)
543 (* The apply_tactic can have closed some of the new_goals *)
544 let patched_new_goals =
545 let (_,metasenv''',_,_) = proof'' in
547 (function i -> List.exists (function (j,_,_) -> j=i) metasenv'''
548 ) new_goals @ new_goals'
550 proof'', patched_new_goals
552 mk_tactic (elim_tac ~term)
555 (* The simplification is performed only on the conclusion *)
556 let elim_intros_simpl_tac ~term =
557 Tacticals.then_ ~start:(elim_tac ~term)
560 ~start:(intros_tac ())
562 [ReductionTactics.simpl_tac ~also_in_hypotheses:false ~terms:None])
565 exception NotConvertible
567 (*CSC: Bug (or feature?). [with_what] is parsed in the context of the goal, *)
568 (*CSC: while [what] can have a richer context (because of binders) *)
569 (*CSC: So it is _NOT_ possible to use those binders in the [with_what] term. *)
570 (*CSC: Is that evident? Is that right? Or should it be changed? *)
571 let change_tac ~what ~with_what =
572 let change_tac ~what ~with_what (proof, goal) =
573 let curi,metasenv,pbo,pty = proof in
574 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
575 (* are_convertible works only on well-typed terms *)
577 CicTypeChecker.type_of_aux' metasenv context with_what
579 in (* TASSI: FIXME *)
581 CicReduction.are_convertible context what with_what u
586 ProofEngineReduction.replace
587 ~equality:(==) ~what:[what] ~with_what:[with_what]
589 let ty' = replace ty in
593 Some (name,Cic.Def (t,None))->
594 Some (name,Cic.Def ((replace t),None))
595 | Some (name,Cic.Decl t) -> Some (name,Cic.Decl (replace t))
597 | Some (_,Cic.Def (_,Some _)) -> assert false
603 (n,_,_) when n = metano -> (metano,context',ty')
607 (curi,metasenv',pbo,pty), [metano]
610 raise (ProofEngineTypes.Fail "Not convertible")
612 mk_tactic (change_tac ~what ~with_what)