- ProofEngineTypes.apply_tactic
- (match termty with
- (C.Appl [(C.MutInd (equri, 0, [])) ; tty ; t1 ; t2])
- when LibraryObjects.is_eq_URI equri ->
- begin
- match tty with
- (C.MutInd (turi,typeno,exp_named_subst))
- | (C.Appl (C.MutInd (turi,typeno,exp_named_subst)::_)) ->
- begin
- match t1,t2 with
- ((C.MutConstruct (uri1,typeno1,consno1,exp_named_subst1)),
- (C.MutConstruct (uri2,typeno2,consno2,exp_named_subst2)))
- when (uri1 = uri2) && (typeno1 = typeno2) &&
- (consno1 = consno2) &&
- (exp_named_subst1 = exp_named_subst2)
- ->
- if first_time then
- raise
- (ProofEngineTypes.Fail (lazy "Injection: nothing to do"))
- else
- continuation ~liftno
- | C.Appl
- ((C.MutConstruct
- (uri1,typeno1,consno1,exp_named_subst1))::applist1),
- C.Appl
- ((C.MutConstruct
- (uri2,typeno2,consno2,exp_named_subst2))::applist2)
- when (uri1 = uri2) && (typeno1 = typeno2) &&
- (consno1 = consno2) &&
- (exp_named_subst1 = exp_named_subst2)
- ->
- let rec traverse_list i l1 l2 =
- match l1,l2 with
- [],[] ->
- if first_time then
- continuation
- else
- (match term with
- C.Rel n ->
- (match List.nth context (n-1) with
- Some (C.Name id,_) ->
- fun ~liftno ->
- T.then_
- ~start:
- (ProofEngineStructuralRules.clear
- ~hyps:[id])
- ~continuation:(continuation ~liftno)
- | _ -> assert false)
- | _ -> assert false)
- | hd1::tl1,hd2::tl2 ->
- if
- fst
- (CicReduction.are_convertible ~metasenv
- context hd1 hd2 CicUniv.empty_ugraph)
- then
- traverse_list (i+1) tl1 tl2
- else
- injection1_tac ~i ~term
- ~continuation:(traverse_list (i+1) tl1 tl2)
- | _ -> assert false (* i 2 termini hanno in testa lo stesso costruttore, ma applicato a un numero diverso di termini *)
- in
- traverse_list 1 applist1 applist2 ~liftno
- | ((C.MutConstruct (uri1,typeno1,consno1,exp_named_subst1)),
- (C.MutConstruct (uri2,typeno2,consno2,exp_named_subst2)))
- | ((C.MutConstruct (uri1,typeno1,consno1,exp_named_subst1)),
- (C.Appl ((C.MutConstruct (uri2,typeno2,consno2,exp_named_subst2))::_)))
- | ((C.Appl ((C.MutConstruct (uri1,typeno1,consno1,exp_named_subst1))::_)),
- (C.MutConstruct (uri2,typeno2,consno2,exp_named_subst2)))
- | ((C.Appl ((C.MutConstruct (uri1,typeno1,consno1,exp_named_subst1))::_)),
- (C.Appl ((C.MutConstruct (uri2,typeno2,consno2,exp_named_subst2))::_)))
- when (consno1 <> consno2) || (exp_named_subst1 <> exp_named_subst2) ->
- discriminate_tac ~term
- (*raise (ProofEngineTypes.Fail (lazy "Injection: not a projectable equality but a discriminable one"))*)
- | _ ->
- if first_time then
- raise (ProofEngineTypes.Fail (lazy "Injection: not a projectable equality"))
- else
- continuation ~liftno
- end
- | _ ->
- if first_time then
- raise (ProofEngineTypes.Fail (lazy "Injection: not a projectable equality"))
- else
- continuation ~liftno
- end
- | _ -> raise (ProofEngineTypes.Fail (lazy "Injection: not an equation"))
- ) status
- in
- ProofEngineTypes.mk_tactic (injection_tac ~term)
+ debug_print (lazy ("\ninjection su : " ^ pp context termty));
+ match termty with (* an equality *)
+ | C.Appl [(C.MutInd (equri, 0, [])) ; tty ; t1 ; t2]
+ when LibraryObjects.is_eq_URI equri ->
+ let turi,typeno,ens,params =
+ match tty with (* some inductive type *)
+ | C.MutInd (turi,typeno,ens) -> turi,typeno,ens,[]
+ | C.Appl (C.MutInd (turi,typeno,ens)::params) -> turi,typeno,ens,params
+ | _ -> raise exn_noneqind
+ in
+ let t1',t2',consno = (* sono i due sottotermini che differiscono *)
+ match t1,t2 with
+ | C.Appl ((C.MutConstruct (uri1,typeno1,consno1,ens1))::applist1),
+ C.Appl ((C.MutConstruct (uri2,typeno2,consno2,ens2))::applist2)
+ when (uri1 = uri2) && (typeno1 = typeno2) &&
+ (consno1 = consno2) && (ens1 = ens2) ->
+ (* controllo ridondante *)
+ List.nth applist1 (i-1),List.nth applist2 (i-1),consno2
+ | _ -> assert false
+ in
+ let tty',_ = CTC.type_of_aux' metasenv context t1' CU.empty_ugraph in
+ let patterns,outtype =
+ match fst (CicEnvironment.get_obj CicUniv.empty_ugraph turi) with
+ | C.InductiveDefinition (ind_type_list,_,paramsno,_)->
+ let left_params, right_params = HExtlib.split_nth paramsno params in
+ let _,_,_,constructor_list = List.nth ind_type_list typeno in
+ let i_constr_id,_ = List.nth constructor_list (consno - 1) in
+ let patterns =
+ let seed = ref 0 in
+ List.map
+ (function (id,cty) ->
+ let reduced_cty = CR.whd context cty in
+ let rec aux k = function
+ | C.Prod (_,_,tgt) when k <= paramsno ->
+ let left = List.nth left_params (k-1) in
+ aux (k+1) (S.subst left tgt)
+ | C.Prod (binder,source,target) when k > paramsno ->
+ let binder' = give_name seed binder in
+ C.Lambda (binder',source,(aux (k+1) target))
+ | _ ->
+ let nr_param_constr = k - paramsno - 1 in
+ if id = i_constr_id then C.Rel (k - i)
+ else S.lift nr_param_constr t1'
+ (* + 1 per liftare anche il lambda aggiunto
+ * esternamente al case *)
+ in S.lift 1 (aux 1 reduced_cty))
+ constructor_list
+ in
+ (* this code should be taken from cases_tac *)
+ let outtype =
+ let seed = ref 0 in
+ let rec to_lambdas te head =
+ match CR.whd context te with
+ | C.Prod (binder,so,ta) ->
+ let binder' = give_name seed binder in
+ C.Lambda (binder',so,to_lambdas ta head)
+ | _ -> head
+ in
+ let rec skip_prods params te =
+ match params, CR.whd context te with
+ | [], _ -> te
+ | left::tl, C.Prod (_,_,ta) ->
+ skip_prods tl (S.subst left ta)
+ | _, _ -> assert false
+ in
+ let abstracted_tty =
+ let tty =
+ List.fold_left (fun x y -> S.subst y x) tty left_params
+ in
+ (* non lift, ma subst coi left! *)
+ match S.lift 1 tty with
+ | C.MutInd _ as tty' -> tty'
+ | C.Appl l ->
+ let keep,abstract = HExtlib.split_nth (paramsno +1) l in
+ let keep = List.map (S.lift paramsno) keep in
+ C.Appl (keep@mk_rels (List.length abstract))
+ | _ -> assert false
+ in
+ match ind_type_list with
+ | [] -> assert false
+ | (_,_,ty,_)::_ ->
+ (* this is in general wrong, do as in cases_tac *)
+ to_lambdas (skip_prods left_params ty)
+ (C.Lambda
+ (C.Name "cased", abstracted_tty,
+ (* here we should capture right parameters *)
+ (* 1 for his Lambda, one for the Lambda outside the match
+ * and then one for each to_lambda *)
+ S.lift (2+List.length right_params) tty'))
+ in
+ patterns,outtype
+ | _ -> raise exn_discrnonind
+ in
+ let cutted = C.Appl [C.MutInd (equri,0,[]) ; tty' ; t1' ; t2'] in
+ let changed =
+ C.Appl [ C.Lambda (C.Name "x", tty,
+ C.MutCase (turi,typeno,outtype,C.Rel 1,patterns)) ; t1]
+ in
+ (* check if cutted and changed are well typed and if t1' ~ changed *)
+ let go_on =
+ try
+ let _,g = CTC.type_of_aux' metasenv context cutted
+ CicUniv.empty_ugraph
+ in
+ let _,g = CTC.type_of_aux' metasenv context changed g in
+ fst (CR.are_convertible ~metasenv context t1' changed g)
+ with
+ | CTC.TypeCheckerFailure _ -> false
+ in
+ if not go_on then
+ PET.apply_tactic T.id_tac status (* FG: ??????? *)
+ else
+ let tac term =
+ let tac status =
+ debug_print (lazy "riempio il cut");
+ let (proof, goal) = status in
+ let _,metasenv,_subst,_,_, _ = proof in
+ let _,context,gty = CicUtil.lookup_meta goal metasenv in
+ let gty = Unshare.unshare gty in
+ let new_t1' = match gty with
+ | (C.Appl (C.MutInd (_,_,_)::_::t::_)) -> t
+ | _ -> raise exn_injwronggoal
+ in
+ debug_print (lazy ("metto: " ^ pp context changed));
+ debug_print (lazy ("al posto di: " ^ pp context new_t1'));
+ debug_print (lazy ("nel goal: " ^ pp context gty));
+ debug_print (lazy ("nel contesto:\n" ^ CicPp.ppcontext context));
+ debug_print (lazy ("e poi rewrite con: "^pp context term));
+ let tac = T.seq ~tactics:[
+ RT.change_tac
+ ~pattern:(None, [], Some (PEH.pattern_of ~term:gty [new_t1']))
+ (fun _ m u -> changed,m,u);
+ EqualityTactics.rewrite_simpl_tac
+ ~direction:`LeftToRight
+ ~pattern:(PET.conclusion_pattern None)
+ term [];
+ EqualityTactics.reflexivity_tac
+ ] in
+ PET.apply_tactic tac status
+ in
+ PET.mk_tactic tac
+ in
+ debug_print (lazy ("CUT: " ^ pp context cutted));
+ let continuation ~map = continuation ~map:(comp succ map) in
+ PET.apply_tactic
+ (T.thens ~start: (P.cut_tac cutted)
+ ~continuations:[
+ (qnify_tac ~first_time:false ~term:(C.Rel 1) ~map:id
+ ~continuation);
+ tac term]
+ ) status
+ | _ -> raise exn_noneq
+ in
+ PET.mk_tactic injection_tac