X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fcomponents%2Fng_tactics%2FnDestructTac.ml;h=fd745ccf6af77330023e55aa00703b16a0d1b4ab;hb=8dbc4dcef7328f3ac84f847255e9be8d47c1de6d;hp=776d5dace0be53f410266bcf2fb776da1515d6c7;hpb=2b98af47f4359ca20b42e52285c7ff4a3bd12f02;p=helm.git diff --git a/helm/software/components/ng_tactics/nDestructTac.ml b/helm/software/components/ng_tactics/nDestructTac.ml index 776d5dace..fd745ccf6 100644 --- a/helm/software/components/ng_tactics/nDestructTac.ml +++ b/helm/software/components/ng_tactics/nDestructTac.ml @@ -26,6 +26,7 @@ (* $Id: destructTactic.ml 9774 2009-05-15 19:37:08Z sacerdot $ *) open NTacStatus +open Continuationals.Stack let debug = true let pp = @@ -43,6 +44,12 @@ let mk_id id = CicNotationPt.Ident (id,None) ;; +let rec mk_prods l t = + match l with + [] -> t + | hd::tl -> CicNotationPt.Binder (`Forall, (mk_id hd, None), mk_prods tl t) +;; + let mk_appl = function [] -> assert false @@ -67,7 +74,6 @@ let subst_metasenv_and_fix_names status = (* input: nome della variabile riscritta * output: lista dei nomi delle variabili il cui tipo dipende dall'input *) let cascade_select_in_ctx ~subst ctx iname = - prerr_endline "C"; let lctx, rctx = HExtlib.split_nth (iname - 1) ctx in let lctx = List.rev lctx in let rec rm_last = function @@ -77,24 +83,18 @@ let cascade_select_in_ctx ~subst ctx iname = let indices,_ = List.fold_left (fun (acc,context) item -> - prerr_endline "C2"; match item with | n,(NCic.Decl s | NCic.Def (s,_)) when not (List.for_all (fun x -> NCicTypeChecker.does_not_occur ~subst context (x-1) x s) acc) -> - List.iter (fun m -> prerr_endline ("acc has " ^ (string_of_int m))) acc; - prerr_endline ("acc occurs in the type of " ^ n); + List.iter (fun m -> pp (lazy ("acc has " ^ (string_of_int m)))) acc; + pp (lazy ("acc occurs in the type of " ^ n)); (1::List.map ((+) 1) acc, item::context) | _ -> (List.map ((+) 1) acc, item::context)) ([1], rctx) lctx in - prerr_endline "C3:"; - List.iter (fun n -> prerr_endline (string_of_int n)) indices; - let indices = match rm_last indices with - | [] -> [] - | _::tl -> tl in + let indices = rm_last indices in let res = List.map (fun n -> let s,_ = List.nth ctx (n-1) in s) indices in - prerr_endline "C4:"; - List.iter (fun n -> prerr_endline n) res; - prerr_endline (NCicPp.ppcontext ~metasenv:[] ~subst ctx); + List.iter (fun n -> pp (lazy n)) res; + pp (lazy (NCicPp.ppcontext ~metasenv:[] ~subst ctx)); res, indices ;; @@ -118,7 +118,7 @@ let arg_list nleft t = ;; let nargs it nleft consno = - prerr_endline (Printf.sprintf "nargs %d %d" nleft consno); + pp (lazy (Printf.sprintf "nargs %d %d" nleft consno)); let _,indname,_,cl = it in let _,_,t_k = List.nth cl consno in List.length (arg_list nleft t_k) ;; @@ -126,14 +126,17 @@ let nargs it nleft consno = let default_pattern = "",0,(None,[],Some CicNotationPt.UserInput);; (* returns the discrimination = injection+contradiction principle *) -(* FIXME: mi riservo di considerare tipi con parametri sx alla fine *) -let mk_discriminator it status = - let nleft = 0 in +let mk_discriminator it ~use_jmeq nleft xyty status = let _,indname,_,cl = it in let mk_eq tys ts us es n = + if use_jmeq then + mk_appl [mk_id "jmeq"; + CicNotationPt.Implicit `JustOne; List.nth ts n; + CicNotationPt.Implicit `JustOne; List.nth us n] + else (* eqty = Tn u0 e0...un-1 en-1 *) let eqty = mk_appl (List.nth tys n :: iter (fun i acc -> @@ -150,7 +153,8 @@ let mk_discriminator it status = List.nth es i:: acc) (n-1) []) in mk_appl [mk_id "eq"; eqty; mk_appl (mk_id ("R" ^ string_of_int n) :: params); - List.nth us n] + List.nth us n] + in let kname it j = @@ -163,8 +167,13 @@ let mk_discriminator it status = let nargs = nargs it nleft i in let es = List.map (fun x -> mk_id ("e" ^ string_of_int x)) (HExtlib.list_seq 0 nargs) in let tys = List.map - (fun x -> CicNotationPt.Implicit (`Tagged ("T" ^ (string_of_int x)))) - (HExtlib.list_seq 0 nargs) in + (fun x -> iter + (fun i acc -> + CicNotationPt.Binder (`Lambda, (mk_id ("x" ^ string_of_int i), None), + CicNotationPt.Binder (`Lambda, (mk_id ("p" ^ string_of_int i), None), + acc))) (x-1) + (CicNotationPt.Implicit (`Tagged ("T" ^ (string_of_int x))))) + (HExtlib.list_seq 0 nargs) in let tys = tys @ [iter (fun i acc -> CicNotationPt.Binder (`Lambda, (mk_id ("x" ^ string_of_int i), None), @@ -176,37 +185,39 @@ let mk_discriminator it status = (HExtlib.list_seq 0 (List.length ts))); mk_appl (mk_id (kname it j)::us)])] in - CicNotationPt.Binder (`Lambda, (mk_id "e", + (** CicNotationPt.Binder (`Lambda, (mk_id "e", Some (mk_appl [mk_id "eq"; CicNotationPt.Implicit `JustOne; mk_appl (mk_id (kname it i)::ts); mk_appl (mk_id (kname it j)::us)])), - let ts = ts @ [mk_id "e"] in + let ts = ts @ [mk_id "e"] in let refl2 = mk_appl [mk_id "refl"; CicNotationPt.Implicit `JustOne; mk_appl (mk_id (kname it j)::us)] in - let us = us @ [refl2] in + let us = us @ [refl2] in *) CicNotationPt.Binder (`Forall, (mk_id "P", Some (CicNotationPt.Sort (`NType "1") )), if i = j then CicNotationPt.Binder (`Forall, (mk_id "_", Some (iter (fun i acc -> CicNotationPt.Binder (`Forall, (List.nth es i, Some (mk_eq tys ts us es i)), acc)) (nargs-1) - (CicNotationPt.Binder (`Forall, (mk_id "_", - Some (mk_eq tys ts us es nargs)), - mk_id "P")))), mk_id "P") - else mk_id "P")) + (** (CicNotationPt.Binder (`Forall, (mk_id "_", + Some (mk_eq tys ts us es nargs)),*) + (mk_id "P"))), mk_id "P") + else mk_id "P") in let inner i ts = CicNotationPt.Case (mk_id "y",None, - Some (CicNotationPt.Binder (`Lambda, (mk_id "y",None), + (*Some (CicNotationPt.Binder (`Lambda, (mk_id "y",None), CicNotationPt.Binder (`Forall, (mk_id "_", Some (mk_appl [mk_id "eq";CicNotationPt.Implicit - `JustOne;CicNotationPt.Implicit `JustOne;mk_id "y"])), - CicNotationPt.Implicit `JustOne ))), + `JustOne;(*CicNotationPt.Implicit `JustOne*) + mk_appl (mk_id (kname it i)::ts);mk_id "y"])), + CicNotationPt.Implicit `JustOne )))*) + None, List.map (fun j -> let nargs_kty = nargs it nleft j in @@ -222,9 +233,7 @@ let mk_discriminator it status = in let outer = CicNotationPt.Case (mk_id "x",None, - Some (CicNotationPt.Binder (`Lambda, (mk_id "_",None), - (*CicNotationPt.Sort (`NType "2")*) CicNotationPt.Implicit - `JustOne)) , + None , List.map (fun i -> let nargs_kty = nargs it nleft i in @@ -237,8 +246,8 @@ let mk_discriminator it status = List.combine ts nones), inner i ts) (HExtlib.list_seq 0 (List.length cl))) in - let principle = CicNotationPt.Binder (`Lambda, (mk_id "x", Some (mk_id indname)), - CicNotationPt.Binder (`Lambda, (mk_id "y", Some (mk_id indname)), outer)) + let principle = CicNotationPt.Binder (`Lambda, (mk_id "x", Some xyty), + CicNotationPt.Binder (`Lambda, (mk_id "y", Some xyty), outer)) in pp (lazy ("discriminator = " ^ (CicNotationPp.pp_term principle))); @@ -261,83 +270,96 @@ let name_of_rel ~context rel = let discriminate_tac ~context cur_eq status = pp (lazy (Printf.sprintf "discriminate: equation %s" (name_of_rel ~context cur_eq))); - let dbranch it leftno consno = - prerr_endline (Printf.sprintf "dbranch %d %d" leftno consno); + let dbranch it ~use_jmeq leftno consno = + let refl_id = mk_id (if use_jmeq then "refl_jmeq" else "refl") in + pp (lazy (Printf.sprintf "dbranch %d %d" leftno consno)); let nlist = HExtlib.list_seq 0 (nargs it leftno consno) in (* (\forall ...\forall P.\forall DH : ( ... = ... -> P). P) *) - let params = List.map (fun x -> prerr_endline (Printf.sprintf "dbranch param a%d" x); NTactics.intro_tac ("a" ^ string_of_int x)) nlist in + let params = List.map (fun x -> NTactics.intro_tac ("a" ^ string_of_int x)) nlist in NTactics.reduce_tac ~reduction:(`Normalize true) ~where:default_pattern:: params @ [ NTactics.intro_tac "P"; NTactics.intro_tac "DH"; NTactics.apply_tac ("",0,mk_id "DH"); - NTactics.apply_tac ("",0,mk_id "refl"); + NTactics.apply_tac ("",0,refl_id); (* well, it works even if no goal is selected after applying DH... *) ] in - let dbranches it leftno = - prerr_endline (Printf.sprintf "dbranches %d" leftno); + let dbranches it ~use_jmeq leftno = + pp (lazy (Printf.sprintf "dbranches %d" leftno)); let _,_,_,cl = it in let nbranches = List.length cl in let branches = iter (fun n acc -> let m = nbranches - n - 1 in - if m = 0 then (prerr_endline "no shift"; acc @ (dbranch it leftno m)) - else (prerr_endline "sì shift"; acc @ NTactics.shift_tac :: (dbranch it - leftno m))) + if m = 0 then acc @ (dbranch it ~use_jmeq leftno m) + else acc @ NTactics.shift_tac :: (dbranch it ~use_jmeq + leftno m)) (nbranches-1) [] in if nbranches > 1 then - (prerr_endline "sì branch"; - NTactics.branch_tac:: branches @ [NTactics.merge_tac]) - else - (prerr_endline "no branch"; - branches) + NTactics.branch_tac ~force:false:: branches @ [NTactics.merge_tac] + else branches in let eq_name,(NCic.Decl s | NCic.Def (s,_)) = List.nth context (cur_eq-1) in let _,ctx' = HExtlib.split_nth cur_eq context in let status, s = NTacStatus.whd status ctx' (mk_cic_term ctx' s) in let status, s = term_of_cic_term status s ctx' in - let status, leftno, it = - let it, t1, t2 = match s with - | NCic.Appl [_;it;t1;t2] -> it,t1,t2 + let status, leftno, it, use_jmeq = + let it, t1, t2, use_jmeq = match s with + | NCic.Appl [_;it;t1;t2] -> it,t1,t2,false + | NCic.Appl [_;it;t1;_;t2] -> it,t1,t2,true | _ -> assert false in (* XXX: serve? ho già fatto whd *) let status, it = whd status ctx' (mk_cic_term ctx' it) in let status, it = term_of_cic_term status it ctx' in let _uri,indtyno,its = match it with - NCic.Const (NReference.Ref (uri, NReference.Ind (_,indtyno,_)) as r) -> + | NCic.Const (NReference.Ref (uri, NReference.Ind (_,indtyno,_)) as r) + | NCic.Appl (NCic.Const + (NReference.Ref (uri, NReference.Ind (_,indtyno,_)) as r)::_) -> uri, indtyno, NCicEnvironment.get_checked_indtys r - | _ -> prerr_endline ("discriminate: indty =" ^ NCicPp.ppterm - ~metasenv:[] ~subst:[] ~context:[] it) ; assert false in + | _ -> pp (lazy ("discriminate: indty =" ^ NCicPp.ppterm + ~metasenv:[] ~subst:[] ~context:[] it)) ; assert false in let _,leftno,its,_,_ = its in - status, leftno, List.nth its indtyno + status, leftno, List.nth its indtyno, use_jmeq in - + + let itnargs = + let _,_,arity,_ = it in + List.length (arg_list 0 arity) in + let _,itname,_,_ = it in + let params = List.map (fun x -> "a" ^ string_of_int x) (HExtlib.list_seq 1 (itnargs+1)) in + let xyty = mk_appl (List.map mk_id (itname::params)) in + let print_tac s status = pp s ; status in NTactics.block_tac ( [(fun status -> - let status, discr = mk_discriminator it status in - NTactics.cut_tac ("",0, CicNotationPt.Binder (`Forall, (mk_id "x", None), - CicNotationPt.Binder (`Forall, (mk_id "y", None), - CicNotationPt.Binder (`Forall, (mk_id "e", + let status, discr = mk_discriminator it ~use_jmeq leftno xyty status in + let cut_term = mk_prods params (CicNotationPt.Binder (`Forall, (mk_id "x", + Some xyty), + CicNotationPt.Binder (`Forall, (mk_id "y", Some xyty), + CicNotationPt.Binder (`Forall, (mk_id "e", Some (mk_appl [mk_id "eq";CicNotationPt.Implicit `JustOne; mk_id "x"; mk_id "y"])), - mk_appl [discr; mk_id "x"; mk_id "y"; - mk_id "e"])))) + mk_appl [discr; mk_id "x"; mk_id "y"(*;mk_id "e"*)])))) in + let status = print_tac (lazy ("cut_term = "^ CicNotationPp.pp_term cut_term)) status in + NTactics.cut_tac ("",0, cut_term) status); NTactics.branch_tac; - NTactics.reduce_tac ~reduction:(`Normalize true) ~where:default_pattern; - NTactics.intro_tac "x"; + print_tac (lazy "ci sono"); + NTactics.reduce_tac ~reduction:(`Normalize true) ~where:default_pattern] + @ List.map (fun x -> NTactics.intro_tac x) params @ + [NTactics.intro_tac "x"; NTactics.intro_tac "y"; NTactics.intro_tac "Deq"; + print_tac (lazy "ci sono 2"); NTactics.rewrite_tac ~dir:`RightToLeft ~what:("",0,mk_id "Deq") ~where:default_pattern; NTactics.cases_tac ~what:("",0,mk_id "x") ~where:default_pattern] - @ dbranches it leftno @ + @ dbranches it ~use_jmeq leftno @ [NTactics.shift_tac; - NTactics.intro_tac "discriminate"; - NTactics.apply_tac ("",0,mk_appl [mk_id "discriminate"; - CicNotationPt.Implicit `JustOne; - CicNotationPt.Implicit `JustOne; mk_id eq_name ]); - NTactics.reduce_tac ~reduction:(`Normalize true) - ~where:default_pattern; - NTactics.clear_tac ["discriminate"]; - NTactics.merge_tac] + print_tac (lazy "ci sono 3"); + NTactics.intro_tac "#discriminate"; + NTactics.apply_tac ("",0,mk_appl ([mk_id "#discriminate"]@ + HExtlib.mk_list (CicNotationPt.Implicit `JustOne) (List.length params + 2) @ + [mk_id eq_name ])); + NTactics.reduce_tac ~reduction:(`Normalize true) ~where:default_pattern; + NTactics.clear_tac ["#discriminate"]; + NTactics.merge_tac; print_tac (lazy "the end of discriminate")] ) status ;; @@ -349,18 +371,20 @@ let subst_tac ~context ~dir cur_eq = let status, s = term_of_cic_term status s ctx' in pp (lazy (Printf.sprintf "subst: equation %s" eq_name)); let l, r = match s with - | NCic.Appl [_;_;t1;t2] -> t1,t2 + | NCic.Appl [_;_;t1;t2] | NCic.Appl [_;_;t1;_;t2] -> t1,t2 | _ -> assert false in let var = match dir with | `LeftToRight -> l | `RightToLeft -> r in - let var = match var with + (* let var = match var with | NCic.Rel i -> i - | _ -> assert false in - let names_to_gen, indices_to_gen = - cascade_select_in_ctx ~subst:(get_subst status) context (var+cur_eq) in - let moved_indices = List.fold_left - (fun acc x -> if x > cur_eq then acc+1 else acc) 0 indices_to_gen in + | _ -> assert false in *) + let names_to_gen, _ = + match var with + | NCic.Rel var -> + cascade_select_in_ctx ~subst:(get_subst status) context (var+cur_eq) + | _ -> cascade_select_in_ctx ~subst:(get_subst status) context cur_eq in + let names_to_gen = List.filter (fun n -> n <> eq_name) names_to_gen in let gen_tac x = NTactics.generalize_tac ~where:("",0,(Some (mk_id x),[], Some CicNotationPt.UserInput)) in @@ -369,97 +393,149 @@ let subst_tac ~context ~dir cur_eq = NTactics.rewrite_tac ~dir ~what:("",0,mk_id eq_name) ~where:default_pattern; NTactics.reduce_tac ~reduction:(`Normalize true) - ~where:default_pattern]@ - (List.map NTactics.intro_tac (List.rev names_to_gen))) status, - (List.length context - cur_eq + 1 - moved_indices) + ~where:default_pattern; + NTactics.clear_tac [eq_name]]@ + (List.map NTactics.intro_tac (List.rev names_to_gen))) status ;; -let get_ctx status = - let ref_ctx = ref [] in - let status = NTactics.distribute_tac - (fun st goal -> - let ctx = ctx_of (get_goalty st goal) in - ref_ctx := ctx; st) status in - !ref_ctx +let clearid_tac ~context cur_eq = + fun status -> + let eq_name,(NCic.Decl s | NCic.Def (s,_)) = List.nth context (cur_eq-1) in + let _,ctx' = HExtlib.split_nth cur_eq context in + let status, s = NTacStatus.whd status ctx' (mk_cic_term ctx' s) in + let status, s = term_of_cic_term status s ctx' in + let streicher_id = + match s with + | NCic.Appl [_;_;_;_] -> mk_id "streicherK" + | NCic.Appl [_;_;_;_;_] -> mk_id "streicherKjmeq" + | _ -> assert false + in + pp (lazy (Printf.sprintf "clearid: equation %s" eq_name)); + let names_to_gen, _ = + cascade_select_in_ctx ~subst:(get_subst status) context cur_eq in + let names_to_gen = names_to_gen @ [eq_name] in + let gen_tac x = + NTactics.generalize_tac + ~where:("",0,(Some (mk_id x),[], Some CicNotationPt.UserInput)) in + NTactics.block_tac ((List.map gen_tac names_to_gen)@ + [NTactics.clear_tac names_to_gen; + NTactics.apply_tac ("",0, mk_appl [streicher_id; + CicNotationPt.Implicit `JustOne; + CicNotationPt.Implicit `JustOne; + CicNotationPt.Implicit `JustOne; + CicNotationPt.Implicit `JustOne]); + NTactics.reduce_tac ~reduction:(`Normalize true) + ~where:default_pattern] @ + (let names_to_intro = + match List.rev names_to_gen with + | [] -> [] + | _::tl -> tl in + List.map NTactics.intro_tac names_to_intro)) status ;; -let rec select_eq ctx i status acc = - try - match (List.nth ctx (List.length ctx - i - 1)) with - | n, (NCic.Decl s | NCic.Def (s,_)) -> - (let _,ctx_s = HExtlib.split_nth (List.length ctx - i) ctx in - let status, s = NTacStatus.whd status ctx_s (mk_cic_term ctx_s s) in - let status, s = term_of_cic_term status s ctx_s in - pp (lazy (Printf.sprintf "select_eq tries %s" (NCicPp.ppterm ~context:ctx_s ~subst:[] ~metasenv:[] s))); - if (List.for_all (fun x -> x <> n) acc) then - match s with - | NCic.Appl [NCic.Const (NReference.Ref (u,_)) ;_;_;_] -> - if NUri.name_of_uri u = "eq" then status, Some (List.length ctx - i) - else select_eq ctx (i+1) status acc - | _ -> select_eq ctx (i+1) status acc - else select_eq ctx (i+1) status acc) - with Failure _ | Invalid_argument _ -> status, None +let get_ctx st goal = + ctx_of (get_goalty st goal) ;; -let classify ~subst ctx i status = - let _, (NCic.Decl s | NCic.Def (s,_)) = List.nth ctx (i-1) in - let _,ctx' = HExtlib.split_nth i ctx in - let status, s = NTacStatus.whd status ctx' (mk_cic_term ctx' s) in - let status, s = term_of_cic_term status s ctx' in - match s with - | NCic.Appl [_;_;l;r] -> - (* FIXME: metasenv *) - if NCicReduction.are_convertible ~metasenv:[] ~subst ctx' l r - then status, `Identity - else status, (match hd_of_term l, hd_of_term r with - | NCic.Const (NReference.Ref (_,NReference.Con (_,ki,nleft)) as kref), - NCic.Const (NReference.Ref (_,NReference.Con (_,kj,_))) -> - if ki != kj then `Discriminate (0,true) - else - let rit = NReference.mk_indty true kref in - let _,_,its,_,itno = NCicEnvironment.get_checked_indtys rit in - let it = List.nth its itno in - let newprods = (nargs it nleft (ki-1)) + 1 in - `Discriminate (newprods, false) - | NCic.Rel j, _ - when NCicTypeChecker.does_not_occur ~subst ctx' (j-1) j r -> - `Subst `LeftToRight - | _, NCic.Rel j - when NCicTypeChecker.does_not_occur ~subst ctx' (j-1) j l -> - `Subst `RightToLeft - | (NCic.Rel _, _ | _, NCic.Rel _ ) -> `Cycle - | _ -> `Blob) - | _ -> raise (Failure "classify") +(* = select + classify *) +let select_eq ctx acc status goal = + let classify ~subst ctx' l r = + (* FIXME: metasenv *) + if NCicReduction.are_convertible ~metasenv:[] ~subst ctx' l r + then status, `Identity + else status, (match hd_of_term l, hd_of_term r with + | NCic.Const (NReference.Ref (_,NReference.Con (_,ki,nleft)) as kref), + NCic.Const (NReference.Ref (_,NReference.Con (_,kj,_))) -> + if ki != kj then `Discriminate (0,true) + else + let rit = NReference.mk_indty true kref in + let _,_,its,_,itno = NCicEnvironment.get_checked_indtys rit in + let it = List.nth its itno in + let newprods = nargs it nleft (ki-1) in + `Discriminate (newprods, false) + | NCic.Rel j, _ + when NCicTypeChecker.does_not_occur ~subst ctx' (j-1) j r + && l = NCic.Rel j -> `Subst `LeftToRight + | _, NCic.Rel j + when NCicTypeChecker.does_not_occur ~subst ctx' (j-1) j l + && r = NCic.Rel j -> `Subst `RightToLeft + | (NCic.Rel _, _ | _, NCic.Rel _ ) -> `Cycle (* could be a blob too... *) + | _ -> `Blob) in + let rec aux i = + try + let index = List.length ctx - i in + pp (lazy ("provo classify di index = " ^string_of_int index)); + match (List.nth ctx (index - 1)) with + | n, (NCic.Decl ty | NCic.Def (ty,_)) -> + (let _,ctx_ty = HExtlib.split_nth index ctx in + let status, ty = NTacStatus.whd status ctx_ty (mk_cic_term ctx_ty ty) in + let status, ty = term_of_cic_term status ty ctx_ty in + pp (lazy (Printf.sprintf "select_eq tries %s" (NCicPp.ppterm ~context:ctx_ty ~subst:[] ~metasenv:[] ty))); + let status, kind = match ty with + | NCic.Appl [NCic.Const (NReference.Ref (u,_)) ;_;l;r] + when NUri.name_of_uri u = "eq" -> + classify ~subst:(get_subst status) ctx_ty l r + | NCic.Appl [NCic.Const (NReference.Ref (u,_)) ;lty;l;rty;r] + when NUri.name_of_uri u = "jmeq" && + NCicReduction.are_convertible ~metasenv:[] + ~subst:(get_subst status) ctx_ty lty rty + -> classify ~subst:(get_subst status) ctx_ty l r + | _ -> status, `NonEq + in match kind with + | `Identity -> + let status, goalty = term_of_cic_term status (get_goalty status goal) ctx in + status, Some (List.length ctx - i), kind + | `Cycle | `Blob | `NonEq -> aux (i+1) (* XXX: skip cyclic/blob equations for now *) + | _ -> + if (List.for_all (fun x -> x <> n) acc) then + status, Some (List.length ctx - i), kind + else aux (i+1)) + with Failure _ | Invalid_argument _ -> status, None, `Blob + in aux 0 ;; -let rec destruct_tac0 nprods i status acc = - let ctx = get_ctx status in +let rec destruct_tac0 nprods acc status goal = + let ctx = get_ctx status goal in let subst = get_subst status in - let status, selection = select_eq ctx i status acc in - match selection with - | None -> - pp (lazy (Printf.sprintf "destruct: nprods is %d, i is %d, no selection, context is %s" nprods i (NCicPp.ppcontext ~metasenv:[] ~subst ctx))); + let get_newgoal os ns ogoal = + let go, gc = NTactics.compare_statuses ~past:os ~present:ns in + let go' = ([ogoal] @- gc) @+ go in + match go' with [] -> assert false | g::_ -> g + in + let status, selection, kind = select_eq ctx acc status goal in + pp (lazy ("destruct: acc is " ^ String.concat "," acc )); + match selection, kind with + | None, _ -> + pp (lazy (Printf.sprintf "destruct: nprods is %d, no selection, context is %s" nprods (NCicPp.ppcontext ~metasenv:[] ~subst ctx))); if nprods > 0 then - let status' = NTactics.intro_tac (mk_fresh_name ctx 'e' 0) status in - destruct_tac0 (nprods-1) (List.length ctx) status' acc + let status' = NTactics.exec (NTactics.intro_tac (mk_fresh_name ctx 'e' 0)) status goal in + destruct_tac0 (nprods-1) acc status' (get_newgoal status status' goal) else status - | Some cur_eq -> pp (lazy (Printf.sprintf - "destruct: nprods is %d, i is %d, selection is %s, context is %s" - nprods i (name_of_rel ~context:ctx cur_eq) (NCicPp.ppcontext ~metasenv:[] ~subst ctx))); - match classify ~subst ctx cur_eq status with - | status,`Discriminate (newprods,conflict) -> - let status' = discriminate_tac ~context:ctx cur_eq status in - if conflict then status' - else destruct_tac0 (nprods+newprods) (List.length ctx - cur_eq + 1) - status' (name_of_rel ~context:ctx cur_eq::acc) - | status, `Subst dir -> - let status', next_i = subst_tac ~context:ctx ~dir cur_eq status in - destruct_tac0 nprods next_i status' acc - | status, `Identity - | status, `Cycle (* TODO *) - | status, `Blob -> - destruct_tac0 nprods (cur_eq+1) status acc + | Some cur_eq, `Discriminate (newprods,conflict) -> + pp (lazy (Printf.sprintf "destruct: discriminate - nprods is %d, selection is %d, context is %s" nprods cur_eq (NCicPp.ppcontext ~metasenv:[] ~subst ctx))); + let status' = NTactics.exec (discriminate_tac ~context:ctx cur_eq) status goal in + if conflict then status' + else destruct_tac0 (nprods+newprods) + (name_of_rel ~context:ctx cur_eq::acc) status' (get_newgoal status status' goal) + | Some cur_eq, `Subst dir -> + pp (lazy (Printf.sprintf "destruct: subst - nprods is %d, selection is %d, context is %s" nprods cur_eq (NCicPp.ppcontext ~metasenv:[] ~subst ctx))); + let status' = NTactics.exec (subst_tac ~context:ctx ~dir cur_eq) status goal in + pp (lazy (Printf.sprintf " ctx after subst = %s" (NCicPp.ppcontext ~metasenv:[] ~subst (get_ctx status' (get_newgoal status status' goal))))); + let eq_name,_ = List.nth ctx (cur_eq-1) in + destruct_tac0 nprods (List.filter (fun x -> x <> eq_name) acc) status' (get_newgoal status status' goal) + | Some cur_eq, `Identity -> + pp (lazy (Printf.sprintf "destruct: identity - nprods is %d, selection is %d, context is %s" nprods cur_eq (NCicPp.ppcontext ~metasenv:[] ~subst ctx))); + let eq_name,_ = List.nth ctx (cur_eq-1) in + let status' = NTactics.exec (clearid_tac ~context:ctx cur_eq) status goal in + destruct_tac0 nprods (List.filter (fun x -> x <> eq_name) acc) status' (get_newgoal status status' goal) + | Some cur_eq, `Cycle -> (* TODO, should never happen *) + pp (lazy (Printf.sprintf "destruct: cycle - nprods is %d, selection is %d, context is %s" nprods cur_eq (NCicPp.ppcontext ~metasenv:[] ~subst ctx))); + assert false + | Some cur_eq, `Blob -> + pp (lazy (Printf.sprintf "destruct: blob - nprods is %d, selection is %d, context is %s" nprods cur_eq (NCicPp.ppcontext ~metasenv:[] ~subst ctx))); + assert false + | _ -> assert false ;; -let destruct_tac status = destruct_tac0 0 0 status [];; +let destruct_tac s = NTactics.distribute_tac (destruct_tac0 0 []) s;;