- let _,context,ty = CicUtil.lookup_meta goal metasenv in
- let typ,_ =
- match terms with
- [] -> assert false
- | he::tl ->
- (* We need to check that all the convertibility of all the terms *)
- let u = List.fold_left ( (* TASSI: FIXME *)
- fun u t ->
- let b,u1 = CicReduction.are_convertible context he t u in
- if not b then
- raise AllSelectedTermsMustBeConvertible
- else
- u1) CicUniv.empty_ugraph tl in
- (CicTypeChecker.type_of_aux' metasenv context he u)
- in
- PET.apply_tactic
- (T.thens
+ let (_,context,ty) as conjecture = CicUtil.lookup_meta goal metasenv in
+ let selected_hyps,terms_with_context =
+ ProofEngineHelpers.select ~metasenv ~conjecture ~pattern in
+ let typ,term =
+ match terms_with_context, term with
+ [], None ->
+ raise UnableToDetectTheTermThatMustBeGeneralizedYouMustGiveItExplicitly
+ | _, Some term
+ | (_,term)::_, None ->
+ fst
+ (CicTypeChecker.type_of_aux' metasenv context term
+ CicUniv.empty_ugraph),
+ term in
+ (* We need to check:
+ 1. whether they live in the context of the goal;
+ if they do they are also well-typed since they are closed subterms
+ of a well-typed term in the well-typed context of the well-typed
+ term
+ 2. whether they are convertible
+ *)
+ ignore (
+ (* TASSI: FIXME *)
+ List.fold_left
+ (fun u (context_of_t,t) ->
+ (* 1 *)
+ begin
+ try
+ ignore
+ (CicMetaSubst.delift_rels [] metasenv
+ (List.length context_of_t - List.length context) t)
+ with
+ CicMetaSubst.DeliftingARelWouldCaptureAFreeVariable ->
+ raise TheSelectedTermsMustLiveInTheGoalContext
+ end;
+ (* 2 *)
+ let b,u1 = CicReduction.are_convertible context term t u in
+ if not b then
+ raise AllSelectedTermsMustBeConvertible
+ else
+ u1
+ ) CicUniv.empty_ugraph terms_with_context) ;
+ PET.apply_tactic
+ (T.thens