X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fcomponents%2Fng_tactics%2FnInversion.ml;h=7c58ae87e5fca689fd807990ab6a45cdc0395055;hb=806ecbdd749ecf2a1cabff52b41cf748fe022401;hp=a93e7f5131ad6d23bbda4735e16967ab1af4cbf3;hpb=da5dd88bbcc43d9f4342e47c922b820abf91c92f;p=helm.git diff --git a/helm/software/components/ng_tactics/nInversion.ml b/helm/software/components/ng_tactics/nInversion.ml index a93e7f513..7c58ae87e 100644 --- a/helm/software/components/ng_tactics/nInversion.ml +++ b/helm/software/components/ng_tactics/nInversion.ml @@ -82,85 +82,89 @@ let mk_inverter name it leftno ?selection outsort status baseuri = prerr_endline ("lunghezza args = " ^ string_of_int (List.length args));*) let nparams = List.length args in prerr_endline ("nparams = " ^ string_of_int nparams); - - let xs = List.map (fun n -> "x" ^ (string_of_int n)) (HExtlib.list_seq 1 (nparams+1)) in - prerr_endline ("lunghezza xs = " ^ string_of_int (List.length xs)); - let ls, rs = HExtlib.split_nth leftno xs in - prerr_endline ("lunghezza ls = " ^ string_of_int (List.length ls)); - prerr_endline ("lunghezza rs = " ^ string_of_int (List.length rs)); - let ys = List.map (fun n -> "y" ^ (string_of_int n)) (HExtlib.list_seq (leftno+1) (nparams+1)) in - - let id_xs = List.map mk_id xs in - let id_ls = List.map mk_id ls in - let id_rs = List.map mk_id rs in - let id_ys = List.map mk_id ys in - - (* pseudocode let t = Lambda y1 ... yr. xs_ = ys_ -> pred *) - - (* check: assuming we have more than one right parameter *) - (* pred := P yr- *) - let pred = mk_appl ((mk_id "P")::id_ys) in - - let selection = match selection with - None -> HExtlib.mk_list true (List.length ys) - | Some s -> s - in - let prods = mk_arrows id_rs id_ys selection pred in - - let lambdas = mk_lambdas (ys@["p"]) prods in - - let hyplist = - let rec hypaux k = function - 0 -> [] - | n -> ("H" ^ string_of_int k) :: hypaux (k+1) (n-1) - in (hypaux 1 ncons) - in - prerr_endline ("lunghezza ys = " ^ string_of_int (List.length ys)); - - let outsort, suffix = NCicElim.ast_of_sort outsort in - let theorem = mk_prods xs - (CicNotationPt.Binder (`Forall, (mk_id "P", Some (mk_prods (HExtlib.mk_list "_" (List.length ys)) (CicNotationPt.Sort outsort))), - mk_prods hyplist (CicNotationPt.Binder (`Forall, (mk_id "Hterm", (*Some (mk_appl (List.map mk_id (ind_name::xs)))) *) - Some (CicNotationPt.Implicit `JustOne)), - mk_appl (mk_id "P"::id_rs))))) - in - let t = mk_appl ( [mk_id (ind_name ^ "_" ^ suffix); lambdas] @ - List.map mk_id hyplist @ - CicNotationPt.Implicit `Vector::[mk_id "Hterm"] ) in - - let status, theorem = GrafiteDisambiguate.disambiguate_nobj status ~baseuri - (baseuri ^ name ^ ".def", - 0,CicNotationPt.Theorem (`Theorem,name,theorem,Some (CicNotationPt.Implicit (`Tagged "inv")))) in - let uri,height,nmenv,nsubst,nobj = theorem in - let ninitial_stack = Continuationals.Stack.of_nmetasenv nmenv in - let status = status#set_obj theorem in - let status = status#set_stack ninitial_stack in - let status = subst_metasenv_and_fix_names status in - - let cut_theorem = - let rs = List.map (fun x -> mk_id x) rs in - mk_arrows rs rs selection (mk_appl (mk_id "P"::rs)) in - - let cut = mk_appl [CicNotationPt.Binder (`Lambda, (mk_id "Hcut", Some cut_theorem), - CicNotationPt.Implicit (`Tagged "end")); - CicNotationPt.Implicit (`Tagged "cut")] in - - let intros = List.map (fun x -> NTactics.intro_tac x) (xs@["P"]@hyplist@["Hterm"]) in - - let status = NTactics.block_tac - (NTactics.branch_tac:: - NTactics.case_tac "inv":: - (intros @ - [NTactics.apply_tac ("",0,cut); - NTactics.branch_tac; - NTactics.case_tac "end"; - NTactics.apply_tac ("",0,mk_id "Hcut"); - NTactics.apply_tac ("",0,mk_id "refl_eq"); - NTactics.shift_tac; - NTactics.case_tac "cut"; - NTactics.apply_tac ("",0,t); - NTactics.merge_tac; - NTactics.merge_tac; - NTactics.skip_tac])) status in - status,status#obj + if nparams <= leftno + then raise (Failure "inverter: the type must have at least one right parameter") + else + let xs = List.map (fun n -> "x" ^ (string_of_int n)) (HExtlib.list_seq 1 (nparams+1)) in + prerr_endline ("lunghezza xs = " ^ string_of_int (List.length xs)); + let ls, rs = HExtlib.split_nth leftno xs in + prerr_endline ("lunghezza ls = " ^ string_of_int (List.length ls)); + prerr_endline ("lunghezza rs = " ^ string_of_int (List.length rs)); + let ys = List.map (fun n -> "y" ^ (string_of_int n)) (HExtlib.list_seq (leftno+1) (nparams+1)) in + + let id_xs = List.map mk_id xs in + let id_ls = List.map mk_id ls in + let id_rs = List.map mk_id rs in + let id_ys = List.map mk_id ys in + + (* pseudocode let t = Lambda y1 ... yr. xs_ = ys_ -> pred *) + + (* check: assuming we have more than one right parameter *) + (* pred := P yr- *) + let pred = mk_appl ((mk_id "P")::id_ys) in + + let selection = match selection with + None -> HExtlib.mk_list true (List.length ys) + | Some s -> s + in + let prods = mk_arrows id_rs id_ys selection pred in + + let lambdas = mk_lambdas (ys@["p"]) prods in + + let hyplist = + let rec hypaux k = function + 0 -> [] + | n -> ("H" ^ string_of_int k) :: hypaux (k+1) (n-1) + in (hypaux 1 ncons) + in + prerr_endline ("lunghezza ys = " ^ string_of_int (List.length ys)); + + let outsort, suffix = NCicElim.ast_of_sort outsort in + let theorem = mk_prods xs + (CicNotationPt.Binder (`Forall, (mk_id "P", Some (mk_prods (HExtlib.mk_list "_" (List.length ys)) (CicNotationPt.Sort outsort))), + mk_prods hyplist (CicNotationPt.Binder (`Forall, (mk_id "Hterm", (*Some (mk_appl (List.map mk_id (ind_name::xs)))) *) + Some (CicNotationPt.Implicit `JustOne)), + mk_appl (mk_id "P"::id_rs))))) + in + let t = mk_appl ( [mk_id (ind_name ^ "_" ^ suffix)]@ id_ls @ [lambdas] @ + List.map mk_id hyplist @ + CicNotationPt.Implicit `Vector::[mk_id "Hterm"] ) in + + let status, theorem = GrafiteDisambiguate.disambiguate_nobj status ~baseuri + (baseuri ^ name ^ ".def", + 0,CicNotationPt.Theorem (`Theorem,name,theorem,Some + (CicNotationPt.Implicit (`Tagged "inv")),`InversionPrinciple)) in + let uri,height,nmenv,nsubst,nobj = theorem in + let ninitial_stack = Continuationals.Stack.of_nmetasenv nmenv in + let status = status#set_obj theorem in + let status = status#set_stack ninitial_stack in + let status = subst_metasenv_and_fix_names status in + + let cut_theorem = + let rs = List.map (fun x -> mk_id x) rs in + mk_arrows rs rs selection (mk_appl (mk_id "P"::rs)) in + + let cut = mk_appl [CicNotationPt.Binder (`Lambda, (mk_id "Hcut", Some cut_theorem), + CicNotationPt.Implicit (`Tagged "end")); + CicNotationPt.Implicit (`Tagged "cut")] in + let intros = List.map (fun x -> NTactics.intro_tac x) (xs@["P"]@hyplist@["Hterm"]) in + + let status = NTactics.block_tac + (NTactics.branch_tac:: + NTactics.case_tac "inv":: + (intros @ + [NTactics.apply_tac ("",0,cut); + NTactics.branch_tac; + NTactics.case_tac "end"; + NTactics.apply_tac ("",0,mk_id "Hcut"); + NTactics.apply_tac ("",0,mk_id "refl_eq"); + NTactics.shift_tac; + NTactics.case_tac "cut"; + NTactics.apply_tac ("",0,t) + (* ; + NTactics.merge_tac; + NTactics.merge_tac; + NTactics.skip_tac*)])) status in + status,status#obj ;; +