- (* precondizione: t1 e t2 hanno in testa lo stesso costruttore ma differiscono (o potrebbero differire?) nell'i-esimo parametro del costruttore *)
- let module C = Cic in
- let module S = CicSubstitution in
- let module U = UriManager in
- let module P = PrimitiveTactics in
- let module T = Tacticals in
- let term = CicSubstitution.lift liftno term in
- let _,metasenv,_,_, _ = proof in
- let _,context,_ = CicUtil.lookup_meta goal metasenv in
- let termty,_ = (* TASSI: FIXME *)
- CicTypeChecker.type_of_aux' metasenv context term CicUniv.empty_ugraph
- in
- match termty with (* an equality *)
- (C.Appl [(C.MutInd (equri, 0, [])) ; tty ; t1 ; t2])
- when LibraryObjects.is_eq_URI equri -> (
- match tty with (* some inductive type *)
- (C.MutInd (turi,typeno,exp_named_subst))
- | (C.Appl (C.MutInd (turi,typeno,exp_named_subst)::_)) ->
- let t1',t2',consno = (* sono i due sottotermini che differiscono *)
- match t1,t2 with
- ((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) -> (* controllo ridondante *)
- (List.nth applist1 (i-1)),(List.nth applist2 (i-1)),consno2
- | _ -> assert false
- in
- let tty',_ =
- CicTypeChecker.type_of_aux' metasenv context t1'
- CicUniv.empty_ugraph in
- let patterns,outtype =
- match
- fst (CicEnvironment.get_obj CicUniv.empty_ugraph turi)
- with
- C.InductiveDefinition (ind_type_list,_,paramsno,_)->
- let _,_,_,constructor_list =
- List.nth ind_type_list typeno in
- let i_constr_id,_ =
- List.nth constructor_list (consno - 1) in
- let seed = ref 0 in
- let patterns =
- List.map
- (function (id,cty) ->
- let reduced_cty = CicReduction.whd context cty in
- let rec aux t k =
- match t with
- C.Prod (_,_,target) when k <= paramsno ->
- aux target (k+1)
- | C.Prod (binder,source,target) when k > paramsno ->
- let binder' =
- match binder with
- C.Name _ -> binder
- | C.Anonymous ->
- C.Name
- (incr seed; "y" ^ string_of_int !seed)
- in
- C.Lambda (binder',source,(aux target (k+1)))
- | _ ->
- let nr_param_constr = k - 1 - paramsno in
- if id = i_constr_id
- then C.Rel (k - i)
- else S.lift (nr_param_constr + 1) t1' (* + 1 per liftare anche il lambda aggiunto esternamente al case *)
- in aux reduced_cty 1
- ) constructor_list in
- let outtype =
- let seed = ref 0 in
- let rec to_lambdas te head =
- match CicReduction.whd context te with
- | C.Prod (binder,so,ta) ->
- let binder' =
- match binder with
- C.Name _ -> binder
- | C.Anonymous ->
- C.Name (incr seed; "d" ^ string_of_int !seed)
- in
- C.Lambda (binder',so,to_lambdas ta head)
- | _ -> head in
- let rec skip_prods n te =
- match n, CicReduction.whd context te with
- 0, _ -> te
- | n, C.Prod (_,_,ta) -> skip_prods (n - 1) ta
- | _, _ -> assert false
+ (* precondizione: t1 e t2 hanno in testa lo stesso costruttore ma
+ * differiscono (o potrebbero differire?) nell'i-esimo parametro
+ * del costruttore *)
+ let term = CicSubstitution.lift liftno term in
+ let _,metasenv,_,_, _ = proof in
+ let _,context,_ = CicUtil.lookup_meta goal metasenv in
+ let termty,_ =
+ CicTypeChecker.type_of_aux' metasenv context term CicUniv.empty_ugraph
+ in
+ prerr_endline ("injection1 su : " ^ CicPp.ppterm 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 = CicReduction.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) (CicSubstitution.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 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 aux 1 reduced_cty)
+ constructor_list
+ in
+ let outtype =
+ let seed = ref 0 in
+ let rec to_lambdas te head =
+ match CicReduction.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, CicReduction.whd context te with
+ | [], _ -> te
+ | left::tl, C.Prod (_,_,ta) ->
+ skip_prods tl (CicSubstitution.subst left ta)
+ | _, _ -> assert false
+ in
+ let abstracted_tty =
+ match CicSubstitution.lift (paramsno(* + 1*)) tty with
+ | C.MutInd _ as tty' -> tty'
+ | C.Appl l ->
+ let keep,abstract = HExtlib.split_nth (paramsno +1) l in
+ C.Appl (keep@mk_rels (List.length abstract))
+ | _ -> assert false
+ in
+ match ind_type_list with
+ | [] -> assert false
+ | (_,_,ty,_)::_ ->
+ to_lambdas (skip_prods left_params ty)
+ (C.Lambda
+ (C.Name "x", abstracted_tty, S.lift 1 tty'))
+ in
+ patterns,outtype
+ | _ -> raise exn_discrnonind
+ in
+ let cutted = C.Appl [C.MutInd (equri,0,[]) ; tty' ; t1' ; t2'] in
+ prerr_endline ("CUT: " ^ CicPp.ppterm cutted);
+ PET.apply_tactic
+ (T.thens ~start: (P.cut_tac cutted)
+ ~continuations:
+ [injection_tac ~first_time:false ~liftno:0 ~term:(C.Rel 1)
+ ~continuation:
+ (fun ~liftno:x -> continuation ~liftno:(liftno+1+x))
+ (* here I need to lift all the continuations by 1;
+ since I am setting back liftno to 0, I actually
+ need to lift all the continuations by liftno + 1 *)
+ ;T.then_
+ ~start:(PET.mk_tactic
+ (fun status ->
+ prerr_endline "riempo il cut";
+ let (proof, goal) = status in
+ let _,metasenv,_,_, _ = 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