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 TheTypeOfTheCurrentGoalIsAMetaICannotChooseTheRightElimiantionPrinciple
30 exception NotAnInductiveTypeToEliminate
31 exception WrongUriToVariable of string
33 (* lambda_abstract newmeta ty *)
34 (* returns a triple [bo],[context],[ty'] where *)
35 (* [ty] = Pi/LetIn [context].[ty'] ([context] is a vector!) *)
36 (* and [bo] = Lambda/LetIn [context].(Meta [newmeta]) *)
37 (* So, lambda_abstract is the core of the implementation of *)
38 (* the Intros tactic. *)
39 (* howmany = -1 means Intros, howmany > 0 means Intros n *)
40 let lambda_abstract ?(howmany=(-1)) metasenv context newmeta ty mk_fresh_name =
42 let rec collect_context context howmany ty =
46 CicMkImplicit.identity_relocation_list_for_metavariable context
48 context, ty, (C.Meta (newmeta,irl))
51 C.Cast (te,_) -> collect_context context howmany te
53 let n' = mk_fresh_name metasenv context n ~typ:s in
54 let (context',ty,bo) =
55 collect_context ((Some (n',(C.Decl s)))::context) (howmany - 1) t
57 (context',ty,C.Lambda(n',s,bo))
59 let (context',ty,bo) =
60 collect_context ((Some (n,(C.Def (s,None))))::context) (howmany - 1) t
62 (context',ty,C.LetIn(n,s,bo))
66 CicMkImplicit.identity_relocation_list_for_metavariable context
68 context, t, (C.Meta (newmeta,irl))
70 raise (Fail "intro(s): not enough products or let-ins")
72 collect_context context howmany ty
74 let eta_expand metasenv context t arg =
75 let module T = CicTypeChecker in
76 let module S = CicSubstitution in
80 t' when t' = S.lift n arg -> C.Rel (1 + n)
81 | C.Rel m -> if m <= n then C.Rel m else C.Rel (m+1)
82 | C.Var (uri,exp_named_subst) ->
83 let exp_named_subst' = aux_exp_named_subst n exp_named_subst in
84 C.Var (uri,exp_named_subst')
87 List.map (function None -> None | Some t -> Some (aux n t)) l
91 | C.Implicit _ as t -> t
92 | C.Cast (te,ty) -> C.Cast (aux n te, aux n ty)
93 | C.Prod (nn,s,t) -> C.Prod (nn, aux n s, aux (n+1) t)
94 | C.Lambda (nn,s,t) -> C.Lambda (nn, aux n s, aux (n+1) t)
95 | C.LetIn (nn,s,t) -> C.LetIn (nn, aux n s, aux (n+1) t)
96 | C.Appl l -> C.Appl (List.map (aux n) l)
97 | C.Const (uri,exp_named_subst) ->
98 let exp_named_subst' = aux_exp_named_subst n exp_named_subst in
99 C.Const (uri,exp_named_subst')
100 | C.MutInd (uri,i,exp_named_subst) ->
101 let exp_named_subst' = aux_exp_named_subst n exp_named_subst in
102 C.MutInd (uri,i,exp_named_subst')
103 | C.MutConstruct (uri,i,j,exp_named_subst) ->
104 let exp_named_subst' = aux_exp_named_subst n exp_named_subst in
105 C.MutConstruct (uri,i,j,exp_named_subst')
106 | C.MutCase (sp,i,outt,t,pl) ->
107 C.MutCase (sp,i,aux n outt, aux n t,
110 let tylen = List.length fl in
113 (fun (name,i,ty,bo) -> (name, i, aux n ty, aux (n+tylen) bo))
116 C.Fix (i, substitutedfl)
118 let tylen = List.length fl in
121 (fun (name,ty,bo) -> (name, aux n ty, aux (n+tylen) bo))
124 C.CoFix (i, substitutedfl)
125 and aux_exp_named_subst n =
126 List.map (function uri,t -> uri,aux n t)
129 T.type_of_aux' metasenv context arg CicUniv.empty_ugraph (* TASSI: FIXME *)
132 FreshNamesGenerator.mk_fresh_name ~subst:[]
133 metasenv context (Cic.Name "Heta") ~typ:argty
135 (C.Appl [C.Lambda (fresh_name,argty,aux 0 t) ; arg])
137 (*CSC: ma serve solamente la prima delle new_uninst e l'unione delle due!!! *)
138 let classify_metas newmeta in_subst_domain subst_in metasenv =
140 (fun (i,canonical_context,ty) (old_uninst,new_uninst) ->
141 if in_subst_domain i then
142 old_uninst,new_uninst
144 let ty' = subst_in canonical_context ty in
145 let canonical_context' =
147 (fun entry canonical_context' ->
150 Some (n,Cic.Decl s) ->
151 Some (n,Cic.Decl (subst_in canonical_context' s))
152 | Some (n,Cic.Def (s,None)) ->
153 Some (n,Cic.Def ((subst_in canonical_context' s),None))
155 | Some (_,Cic.Def (_,Some _)) -> assert false
157 entry'::canonical_context'
158 ) canonical_context []
161 ((i,canonical_context',ty')::old_uninst),new_uninst
163 old_uninst,((i,canonical_context',ty')::new_uninst)
166 (* Useful only inside apply_tac *)
168 generalize_exp_named_subst_with_fresh_metas context newmeta uri exp_named_subst
170 let module C = Cic in
172 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
173 CicUtil.params_of_obj o
175 let exp_named_subst_diff,new_fresh_meta,newmetasenvfragment,exp_named_subst'=
176 let next_fresh_meta = ref newmeta in
177 let newmetasenvfragment = ref [] in
178 let exp_named_subst_diff = ref [] in
184 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
186 C.Variable (_,_,ty,_,_) ->
187 CicSubstitution.subst_vars !exp_named_subst_diff ty
188 | _ -> raise (WrongUriToVariable (UriManager.string_of_uri uri))
190 (* CSC: patch to generate ?1 : ?2 : Type in place of ?1 : Type to simulate ?1 :< Type
192 C.Sort (C.Type _) as s -> (* TASSI: ?? *)
193 let fresh_meta = !next_fresh_meta in
194 let fresh_meta' = fresh_meta + 1 in
195 next_fresh_meta := !next_fresh_meta + 2 ;
196 let subst_item = uri,C.Meta (fresh_meta',[]) in
197 newmetasenvfragment :=
198 (fresh_meta,[],C.Sort (C.Type (CicUniv.fresh()))) ::
200 (fresh_meta',[],C.Meta (fresh_meta,[])) :: !newmetasenvfragment ;
201 exp_named_subst_diff := !exp_named_subst_diff @ [subst_item] ;
202 subst_item::(aux (tl,[]))
206 CicMkImplicit.identity_relocation_list_for_metavariable context
208 let subst_item = uri,C.Meta (!next_fresh_meta,irl) in
209 newmetasenvfragment :=
210 (!next_fresh_meta,context,ty)::!newmetasenvfragment ;
211 exp_named_subst_diff := !exp_named_subst_diff @ [subst_item] ;
212 incr next_fresh_meta ;
213 subst_item::(aux (tl,[]))(*)*)
214 | uri::tl1,((uri',_) as s)::tl2 ->
215 assert (UriManager.eq uri uri') ;
217 | [],_ -> assert false
219 let exp_named_subst' = aux (params,exp_named_subst) in
220 !exp_named_subst_diff,!next_fresh_meta,
221 List.rev !newmetasenvfragment, exp_named_subst'
223 new_fresh_meta,newmetasenvfragment,exp_named_subst',exp_named_subst_diff
226 let new_metasenv_and_unify_and_t newmeta' metasenv' context term' ty termty goal_arity =
227 let (consthead,newmetasenv,arguments,_) =
228 saturate_term newmeta' metasenv' context termty goal_arity in
229 let subst,newmetasenv',_ =
230 CicUnification.fo_unif newmetasenv context consthead ty CicUniv.empty_ugraph
233 if List.length arguments = 0 then term' else Cic.Appl (term'::arguments)
237 let rec count_prods context ty =
238 match CicReduction.whd context ty with
239 Cic.Prod (n,s,t) -> 1 + count_prods (Some (n,Cic.Decl s)::context) t
242 let apply_tac_verbose_with_subst ~term (proof, goal) =
243 (* Assumption: The term "term" must be closed in the current context *)
244 let module T = CicTypeChecker in
245 let module R = CicReduction in
246 let module C = Cic in
247 let (_,metasenv,_,_) = proof in
248 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
249 let newmeta = new_meta_of_proof ~proof in
250 let exp_named_subst_diff,newmeta',newmetasenvfragment,term' =
252 C.Var (uri,exp_named_subst) ->
253 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
254 generalize_exp_named_subst_with_fresh_metas context newmeta uri
257 exp_named_subst_diff,newmeta',newmetasenvfragment,
258 C.Var (uri,exp_named_subst')
259 | C.Const (uri,exp_named_subst) ->
260 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
261 generalize_exp_named_subst_with_fresh_metas context newmeta uri
264 exp_named_subst_diff,newmeta',newmetasenvfragment,
265 C.Const (uri,exp_named_subst')
266 | C.MutInd (uri,tyno,exp_named_subst) ->
267 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
268 generalize_exp_named_subst_with_fresh_metas context newmeta uri
271 exp_named_subst_diff,newmeta',newmetasenvfragment,
272 C.MutInd (uri,tyno,exp_named_subst')
273 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
274 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
275 generalize_exp_named_subst_with_fresh_metas context newmeta uri
278 exp_named_subst_diff,newmeta',newmetasenvfragment,
279 C.MutConstruct (uri,tyno,consno,exp_named_subst')
280 | _ -> [],newmeta,[],term
282 let metasenv' = metasenv@newmetasenvfragment in
284 CicTypeChecker.type_of_aux' metasenv' context term' CicUniv.empty_ugraph
287 CicSubstitution.subst_vars exp_named_subst_diff termty in
288 let goal_arity = count_prods context ty in
289 let subst,newmetasenv',t =
290 let rec add_one_argument n =
292 new_metasenv_and_unify_and_t newmeta' metasenv' context term' ty
294 with CicUnification.UnificationFailure _ when n > 0 ->
295 add_one_argument (n - 1)
297 add_one_argument goal_arity
299 let in_subst_domain i = List.exists (function (j,_) -> i=j) subst in
300 let apply_subst = CicMetaSubst.apply_subst subst in
301 let old_uninstantiatedmetas,new_uninstantiatedmetas =
302 (* subst_in doesn't need the context. Hence the underscore. *)
303 let subst_in _ = CicMetaSubst.apply_subst subst in
304 classify_metas newmeta in_subst_domain subst_in newmetasenv'
306 let bo' = apply_subst t in
307 let newmetasenv'' = new_uninstantiatedmetas@old_uninstantiatedmetas in
309 (* if we just apply the subtitution, the type is irrelevant:
310 we may use Implicit, since it will be dropped *)
311 CicMetaSubst.apply_subst ((metano,(context,bo',Cic.Implicit None))::subst)
313 let (newproof, newmetasenv''') =
314 subst_meta_and_metasenv_in_proof proof metano subst_in newmetasenv''
316 (((metano,(context,bo',Cic.Implicit None))::subst)(* subst_in *), (* ALB *)
318 List.map (function (i,_,_) -> i) new_uninstantiatedmetas))
322 let apply_tac_verbose_with_subst ~term status =
324 (* apply_tac_verbose ~term status *)
325 apply_tac_verbose_with_subst ~term status
326 (* TODO cacciare anche altre eccezioni? *)
328 | CicUnification.UnificationFailure _ as e ->
329 raise (Fail (Printexc.to_string e))
330 | CicTypeChecker.TypeCheckerFailure _ as e ->
331 raise (Fail (Printexc.to_string e))
334 let apply_tac_verbose ~term status =
335 let subst, status = apply_tac_verbose_with_subst ~term status in
336 (CicMetaSubst.apply_subst subst), status
338 let apply_tac ~term status = snd (apply_tac_verbose ~term status)
340 (* TODO per implementare i tatticali e' necessario che tutte le tattiche
341 sollevino _solamente_ Fail *)
342 let apply_tac ~term =
343 let apply_tac ~term status =
345 apply_tac ~term status
346 (* TODO cacciare anche altre eccezioni? *)
348 | CicUnification.UnificationFailure _ as e ->
349 raise (Fail (Printexc.to_string e))
350 | CicTypeChecker.TypeCheckerFailure _ as e ->
351 raise (Fail (Printexc.to_string e))
353 mk_tactic (apply_tac ~term)
355 let intros_tac ?howmany ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[]) ()=
357 ?(mk_fresh_name_callback = (FreshNamesGenerator.mk_fresh_name ~subst:[])) ()
360 let module C = Cic in
361 let module R = CicReduction in
362 let (_,metasenv,_,_) = proof in
363 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
364 let newmeta = new_meta_of_proof ~proof in
365 let (context',ty',bo') =
366 lambda_abstract ?howmany metasenv context newmeta ty mk_fresh_name_callback
369 subst_meta_in_proof proof metano bo' [newmeta,context',ty']
371 (newproof, [newmeta])
373 mk_tactic (intros_tac ~mk_fresh_name_callback ())
375 let cut_tac ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[]) term =
377 ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[])
380 let module C = Cic in
381 let curi,metasenv,pbo,pty = proof in
382 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
383 let newmeta1 = new_meta_of_proof ~proof in
384 let newmeta2 = newmeta1 + 1 in
386 mk_fresh_name_callback metasenv context (Cic.Name "Hcut") ~typ:term in
387 let context_for_newmeta1 =
388 (Some (fresh_name,C.Decl term))::context in
390 CicMkImplicit.identity_relocation_list_for_metavariable
394 CicMkImplicit.identity_relocation_list_for_metavariable context
396 let newmeta1ty = CicSubstitution.lift 1 ty in
399 [C.Lambda (fresh_name,term,C.Meta (newmeta1,irl1)) ;
400 C.Meta (newmeta2,irl2)]
403 subst_meta_in_proof proof metano bo'
404 [newmeta2,context,term; newmeta1,context_for_newmeta1,newmeta1ty];
406 (newproof, [newmeta1 ; newmeta2])
408 mk_tactic (cut_tac ~mk_fresh_name_callback term)
410 let letin_tac ?(mk_fresh_name_callback=FreshNamesGenerator.mk_fresh_name ~subst:[]) term =
412 ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[])
415 let module C = Cic in
416 let curi,metasenv,pbo,pty = proof in
417 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
418 let _,_ = (* TASSI: FIXME *)
419 CicTypeChecker.type_of_aux' metasenv context term CicUniv.empty_ugraph in
420 let newmeta = new_meta_of_proof ~proof in
422 mk_fresh_name_callback metasenv context (Cic.Name "Hletin") ~typ:term in
423 let context_for_newmeta =
424 (Some (fresh_name,C.Def (term,None)))::context in
426 CicMkImplicit.identity_relocation_list_for_metavariable
429 let newmetaty = CicSubstitution.lift 1 ty in
430 let bo' = C.LetIn (fresh_name,term,C.Meta (newmeta,irl)) in
433 proof metano bo'[newmeta,context_for_newmeta,newmetaty]
435 (newproof, [newmeta])
437 mk_tactic (letin_tac ~mk_fresh_name_callback term)
439 (** functional part of the "exact" tactic *)
440 let exact_tac ~term =
441 let exact_tac ~term (proof, goal) =
442 (* Assumption: the term bo must be closed in the current context *)
443 let (_,metasenv,_,_) = proof in
444 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
445 let module T = CicTypeChecker in
446 let module R = CicReduction in
447 let ty_term,u = T.type_of_aux' metasenv context term CicUniv.empty_ugraph in
448 let b,_ = R.are_convertible context ty_term ty u in (* TASSI: FIXME *)
451 let (newproof, metasenv') =
452 subst_meta_in_proof proof metano term [] in
456 raise (Fail "The type of the provided term is not the one expected.")
458 mk_tactic (exact_tac ~term)
460 (* not really "primitive" tactics .... *)
462 let elim_tac ~term (proof, goal) =
463 let module T = CicTypeChecker in
464 let module U = UriManager in
465 let module R = CicReduction in
466 let module C = Cic in
467 let (curi,metasenv,proofbo,proofty) = proof in
468 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
469 let termty,_ = T.type_of_aux' metasenv context term CicUniv.empty_ugraph in
470 let (termty,metasenv',arguments,fresh_meta) =
471 ProofEngineHelpers.saturate_term
472 (ProofEngineHelpers.new_meta_of_proof proof) metasenv context termty 0 in
473 let term = if arguments = [] then term else Cic.Appl (term::arguments) in
474 let uri,exp_named_subst,typeno,args =
476 C.MutInd (uri,typeno,exp_named_subst) -> (uri,exp_named_subst,typeno,[])
477 | C.Appl ((C.MutInd (uri,typeno,exp_named_subst))::args) ->
478 (uri,exp_named_subst,typeno,args)
479 | _ -> raise NotAnInductiveTypeToEliminate
482 let buri = U.buri_of_uri uri in
484 let o,_ = CicEnvironment.get_obj CicUniv.empty_ugraph uri in
486 C.InductiveDefinition (tys,_,_,_) ->
487 let (name,_,_,_) = List.nth tys typeno in
491 let ty_ty,_ = T.type_of_aux' metasenv' context ty CicUniv.empty_ugraph in
494 C.Sort C.Prop -> "_ind"
495 | C.Sort C.Set -> "_rec"
496 | C.Sort C.CProp -> "_rec"
497 | C.Sort (C.Type _)-> "_rect"
498 | C.Meta (_,_) -> raise TheTypeOfTheCurrentGoalIsAMetaICannotChooseTheRightElimiantionPrinciple
501 U.uri_of_string (buri ^ "/" ^ name ^ ext ^ ".con")
503 let eliminator_ref = C.Const (eliminator_uri,exp_named_subst) in
505 T.type_of_aux' metasenv' context eliminator_ref CicUniv.empty_ugraph in
506 let rec find_args_no =
508 C.Prod (_,_,t) -> 1 + find_args_no t
509 | C.Cast (s,_) -> find_args_no s
510 | C.LetIn (_,_,t) -> 0 + find_args_no t
513 let args_no = find_args_no ety in
515 let rec make_tl base_case =
518 | n -> (C.Implicit None)::(make_tl base_case (n - 1))
520 C.Appl (eliminator_ref :: make_tl term (args_no - 1))
522 let metasenv', term_to_refine' =
523 CicMkImplicit.expand_implicits metasenv' [] context term_to_refine in
524 let refined_term,_,metasenv'',_ =
525 CicRefine.type_of_aux' metasenv' context term_to_refine'
529 ProofEngineHelpers.compare_metasenvs
530 ~oldmetasenv:metasenv ~newmetasenv:metasenv''
532 let proof' = curi,metasenv'',proofbo,proofty in
533 let proof'', new_goals' =
534 apply_tactic (apply_tac ~term:refined_term) (proof',goal)
536 (* The apply_tactic can have closed some of the new_goals *)
537 let patched_new_goals =
538 let (_,metasenv''',_,_) = proof'' in
540 (function i -> List.exists (function (j,_,_) -> j=i) metasenv'''
541 ) new_goals @ new_goals'
543 proof'', patched_new_goals
545 mk_tactic (elim_tac ~term)
548 let elim_intros_tac ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[])
550 Tacticals.then_ ~start:(elim_tac ~term:what)
551 ~continuation:(intros_tac ~mk_fresh_name_callback ?howmany:depth ())
554 (* The simplification is performed only on the conclusion *)
555 let elim_intros_simpl_tac ?(mk_fresh_name_callback = FreshNamesGenerator.mk_fresh_name ~subst:[])
557 Tacticals.then_ ~start:(elim_tac ~term:what)
560 ~start:(intros_tac ~mk_fresh_name_callback ?howmany:depth ())
562 [ReductionTactics.simpl_tac
563 ~pattern:(ProofEngineTypes.conclusion_pattern None)])