wenzelm@5824: (* Title: Pure/Isar/method.ML wenzelm@5824: ID: $Id$ wenzelm@5824: Author: Markus Wenzel, TU Muenchen wenzelm@5824: wenzelm@17110: Isar proof methods. wenzelm@5824: *) wenzelm@5824: wenzelm@5824: signature BASIC_METHOD = wenzelm@5824: sig wenzelm@17110: val FINDGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq wenzelm@17110: val HEADGOAL: (int -> thm -> 'a Seq.seq) -> thm -> 'a Seq.seq wenzelm@17110: type method wenzelm@11731: val trace_rules: bool ref wenzelm@5824: val print_methods: theory -> unit wenzelm@5824: end; wenzelm@5824: wenzelm@5824: signature METHOD = wenzelm@5824: sig wenzelm@5824: include BASIC_METHOD wenzelm@25957: val apply: Position.T -> (Proof.context -> method) -> Proof.context -> thm list -> cases_tactic wenzelm@18227: val RAW_METHOD_CASES: (thm list -> cases_tactic) -> method wenzelm@17110: val RAW_METHOD: (thm list -> tactic) -> method wenzelm@18227: val METHOD_CASES: (thm list -> cases_tactic) -> method wenzelm@17110: val METHOD: (thm list -> tactic) -> method wenzelm@17110: val fail: method wenzelm@17110: val succeed: method wenzelm@17110: val insert_tac: thm list -> int -> tactic wenzelm@17110: val insert: thm list -> method wenzelm@17110: val insert_facts: method wenzelm@17110: val SIMPLE_METHOD: tactic -> method wenzelm@21592: val SIMPLE_METHOD': (int -> tactic) -> method wenzelm@21592: val SIMPLE_METHOD'': ((int -> tactic) -> tactic) -> (int -> tactic) -> method wenzelm@17110: val defer: int option -> method wenzelm@17110: val prefer: int -> method wenzelm@20289: val cheating: bool -> Proof.context -> method wenzelm@17110: val intro: thm list -> method wenzelm@17110: val elim: thm list -> method wenzelm@20289: val unfold: thm list -> Proof.context -> method wenzelm@20289: val fold: thm list -> Proof.context -> method wenzelm@17110: val atomize: bool -> method wenzelm@17110: val this: method wenzelm@20289: val fact: thm list -> Proof.context -> method wenzelm@20289: val assumption: Proof.context -> method wenzelm@20289: val close: bool -> Proof.context -> method wenzelm@20289: val trace: Proof.context -> thm list -> unit wenzelm@6091: val rule_tac: thm list -> thm list -> int -> tactic wenzelm@20289: val some_rule_tac: thm list -> Proof.context -> thm list -> int -> tactic haftmann@25270: val intros_tac: thm list -> thm list -> tactic wenzelm@17110: val rule: thm list -> method wenzelm@17110: val erule: int -> thm list -> method wenzelm@17110: val drule: int -> thm list -> method wenzelm@17110: val frule: int -> thm list -> method wenzelm@20289: val iprover_tac: Proof.context -> int option -> int -> tactic wenzelm@20289: val set_tactic: (Proof.context -> thm list -> tactic) -> unit wenzelm@26385: val tactic: string * Position.T -> Proof.context -> method wenzelm@17110: type src wenzelm@5824: datatype text = wenzelm@23349: Basic of (Proof.context -> method) * Position.T | wenzelm@15703: Source of src | wenzelm@20030: Source_i of src | wenzelm@5824: Then of text list | wenzelm@5824: Orelse of text list | wenzelm@5824: Try of text | wenzelm@19186: Repeat1 of text | wenzelm@19186: SelectGoals of int * text wenzelm@17857: val primitive_text: (thm -> thm) -> text wenzelm@17857: val succeed_text: text wenzelm@17110: val default_text: text wenzelm@17110: val this_text: text wenzelm@17110: val done_text: text wenzelm@17356: val sorry_text: bool -> text wenzelm@23349: val finish_text: text option * bool -> Position.T -> text wenzelm@20289: val method: theory -> src -> Proof.context -> method wenzelm@20289: val method_i: theory -> src -> Proof.context -> method wenzelm@20289: val add_methods: (bstring * (src -> Proof.context -> method) * string) list wenzelm@17110: -> theory -> theory wenzelm@20289: val add_method: bstring * (src -> Proof.context -> method) * string wenzelm@17110: -> theory -> theory wenzelm@26385: val method_setup: bstring -> string * Position.T -> string -> theory -> theory wenzelm@18999: val syntax: (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) haftmann@21879: -> src -> Proof.context -> 'a * Proof.context wenzelm@17110: val simple_args: (Args.T list -> 'a * Args.T list) wenzelm@20289: -> ('a -> Proof.context -> method) -> src -> Proof.context -> method wenzelm@20289: val ctxt_args: (Proof.context -> method) -> src -> Proof.context -> method wenzelm@20289: val no_args: method -> src -> Proof.context -> method wenzelm@17110: type modifier wenzelm@18999: val sectioned_args: (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) -> wenzelm@17110: (Args.T list -> modifier * Args.T list) list -> wenzelm@20289: ('a -> Proof.context -> 'b) -> src -> Proof.context -> 'b wenzelm@17110: val bang_sectioned_args: wenzelm@17110: (Args.T list -> modifier * Args.T list) list -> wenzelm@20289: (thm list -> Proof.context -> 'a) -> src -> Proof.context -> 'a wenzelm@17110: val bang_sectioned_args': wenzelm@17110: (Args.T list -> modifier * Args.T list) list -> wenzelm@18999: (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) -> wenzelm@20289: ('a -> thm list -> Proof.context -> 'b) -> src -> Proof.context -> 'b wenzelm@17110: val only_sectioned_args: wenzelm@17110: (Args.T list -> modifier * Args.T list) list -> wenzelm@20289: (Proof.context -> 'a) -> src -> Proof.context -> 'a wenzelm@20289: val thms_ctxt_args: (thm list -> Proof.context -> 'a) -> src -> wenzelm@20289: Proof.context -> 'a wenzelm@20289: val thms_args: (thm list -> 'a) -> src -> Proof.context -> 'a wenzelm@20289: val thm_args: (thm -> 'a) -> src -> Proof.context -> 'a wenzelm@9539: val goal_args: (Args.T list -> 'a * Args.T list) -> ('a -> int -> tactic) wenzelm@20289: -> src -> Proof.context -> method wenzelm@18999: val goal_args': (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) wenzelm@20289: -> ('a -> int -> tactic) -> src -> Proof.context -> method wenzelm@17110: val goal_args_ctxt: (Args.T list -> 'a * Args.T list) -> wenzelm@20289: (Proof.context -> 'a -> int -> tactic) -> src -> Proof.context -> method wenzelm@18999: val goal_args_ctxt': (Context.generic * Args.T list -> 'a * (Context.generic * Args.T list)) -> wenzelm@20289: (Proof.context -> 'a -> int -> tactic) -> src -> Proof.context -> method wenzelm@22118: val parse: OuterLex.token list -> text * OuterLex.token list wenzelm@5824: end; wenzelm@5824: wenzelm@5824: structure Method: METHOD = wenzelm@5824: struct wenzelm@5824: wenzelm@17110: (** generic tools **) wenzelm@17110: wenzelm@17110: (* goal addressing *) wenzelm@17110: wenzelm@17110: fun FINDGOAL tac st = wenzelm@17110: let fun find i n = if i > n then Seq.fail else Seq.APPEND (tac i, find (i + 1) n) wenzelm@17110: in find 1 (Thm.nprems_of st) st end; wenzelm@17110: wenzelm@17110: fun HEADGOAL tac = tac 1; wenzelm@17110: wenzelm@17110: wenzelm@5824: wenzelm@12324: (** proof methods **) wenzelm@12324: wenzelm@17110: (* datatype method *) wenzelm@11731: wenzelm@18227: datatype method = Meth of thm list -> cases_tactic; wenzelm@11731: wenzelm@25957: fun apply pos meth_fun ctxt facts goal = Position.setmp_thread_data_seq pos wenzelm@25957: (fn () => let val Meth meth = meth_fun ctxt in meth facts goal end) (); wenzelm@11731: wenzelm@17756: val RAW_METHOD_CASES = Meth; wenzelm@11731: wenzelm@17110: fun RAW_METHOD tac = RAW_METHOD_CASES (NO_CASES o tac); wenzelm@12144: wenzelm@17110: fun METHOD_CASES tac = RAW_METHOD_CASES (fn facts => wenzelm@21687: Seq.THEN (ALLGOALS Goal.conjunction_tac, tac facts)); wenzelm@8372: wenzelm@21687: fun METHOD tac = RAW_METHOD (fn facts => ALLGOALS Goal.conjunction_tac THEN tac facts); wenzelm@5824: wenzelm@5824: val fail = METHOD (K no_tac); wenzelm@5824: val succeed = METHOD (K all_tac); wenzelm@5824: wenzelm@5824: wenzelm@17110: (* insert facts *) wenzelm@7419: wenzelm@7419: local wenzelm@5824: wenzelm@21579: fun cut_rule_tac rule = wenzelm@21579: Tactic.rtac (Drule.forall_intr_vars rule COMP_INCR revcut_rl); wenzelm@6981: wenzelm@7419: in wenzelm@5824: wenzelm@7419: fun insert_tac [] i = all_tac wenzelm@7419: | insert_tac facts i = EVERY (map (fn th => cut_rule_tac th i) facts); wenzelm@6981: wenzelm@7555: val insert_facts = METHOD (ALLGOALS o insert_tac); wenzelm@7664: fun insert thms = METHOD (fn _ => ALLGOALS (insert_tac thms)); wenzelm@7419: wenzelm@9706: fun SIMPLE_METHOD tac = METHOD (fn facts => ALLGOALS (insert_tac facts) THEN tac); wenzelm@21592: fun SIMPLE_METHOD'' quant tac = METHOD (fn facts => quant (insert_tac facts THEN' tac)); wenzelm@21592: val SIMPLE_METHOD' = SIMPLE_METHOD'' HEADGOAL; wenzelm@9706: wenzelm@12324: end; wenzelm@12324: wenzelm@9706: wenzelm@17110: (* shuffle subgoals *) wenzelm@17110: wenzelm@17110: fun prefer i = METHOD (K (Tactic.defer_tac i THEN PRIMITIVE (Thm.permute_prems 0 ~1))); wenzelm@18939: fun defer opt_i = METHOD (K (Tactic.defer_tac (the_default 1 opt_i))); wenzelm@17110: wenzelm@17110: wenzelm@17356: (* cheating *) wenzelm@17356: wenzelm@17356: fun cheating int ctxt = METHOD (K (setmp quick_and_dirty (int orelse ! quick_and_dirty) wenzelm@17356: (SkipProof.cheat_tac (ProofContext.theory_of ctxt)))); wenzelm@17356: wenzelm@17356: wenzelm@17110: (* unfold intro/elim rules *) wenzelm@17110: wenzelm@21592: fun intro ths = SIMPLE_METHOD' (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.match_tac ths)); wenzelm@21592: fun elim ths = SIMPLE_METHOD' (CHANGED_PROP o REPEAT_ALL_NEW (Tactic.ematch_tac ths)); wenzelm@17110: wenzelm@17110: wenzelm@12384: (* unfold/fold definitions *) wenzelm@12384: wenzelm@18877: fun unfold_meth ths ctxt = SIMPLE_METHOD (CHANGED_PROP (LocalDefs.unfold_tac ctxt ths)); wenzelm@18877: fun fold_meth ths ctxt = SIMPLE_METHOD (CHANGED_PROP (LocalDefs.fold_tac ctxt ths)); wenzelm@6532: wenzelm@12384: wenzelm@12829: (* atomize rule statements *) wenzelm@12829: wenzelm@23590: fun atomize false = SIMPLE_METHOD' (CHANGED_PROP o ObjectLogic.atomize_prems_tac) wenzelm@12829: | atomize true = RAW_METHOD (K (HEADGOAL (CHANGED_PROP o ObjectLogic.full_atomize_tac))); wenzelm@12829: wenzelm@12829: wenzelm@18039: (* this -- resolve facts directly *) wenzelm@12384: wenzelm@17110: val this = METHOD (EVERY o map (HEADGOAL o Tactic.rtac)); wenzelm@9484: wenzelm@9484: wenzelm@18039: (* fact -- composition by facts from context *) wenzelm@18039: wenzelm@21592: fun fact [] ctxt = SIMPLE_METHOD' (ProofContext.some_fact_tac ctxt) wenzelm@21592: | fact rules _ = SIMPLE_METHOD' (ProofContext.fact_tac rules); wenzelm@18039: wenzelm@18039: wenzelm@17110: (* assumption *) wenzelm@7419: wenzelm@7419: local wenzelm@7419: wenzelm@19778: fun cond_rtac cond rule = SUBGOAL (fn (prop, i) => wenzelm@19778: if cond (Logic.strip_assums_concl prop) wenzelm@19778: then Tactic.rtac rule i else no_tac); wenzelm@7419: wenzelm@25957: fun legacy_tac st = wenzelm@25957: (legacy_feature wenzelm@26291: ("Implicit use of prems in assumption proof" ^ Position.str_of (Position.thread_data ())); wenzelm@23395: all_tac st); wenzelm@23395: wenzelm@23395: fun assm_tac ctxt = wenzelm@17110: assume_tac APPEND' wenzelm@23349: Goal.assume_rule_tac ctxt APPEND' wenzelm@25957: (CHANGED o solve_tac (Assumption.prems_of ctxt) THEN' K legacy_tac) APPEND' wenzelm@19778: cond_rtac (can Logic.dest_equals) Drule.reflexive_thm APPEND' wenzelm@19778: cond_rtac (can Logic.dest_term) Drule.termI; wenzelm@17110: wenzelm@7419: in wenzelm@7419: wenzelm@23349: fun assumption ctxt = METHOD (HEADGOAL o wenzelm@23395: (fn [] => assm_tac ctxt wenzelm@23349: | [fact] => solve_tac [fact] wenzelm@23349: | _ => K no_tac)); wenzelm@23349: wenzelm@17356: fun close immed ctxt = METHOD (K wenzelm@23349: (FILTER Thm.no_prems wenzelm@23395: ((if immed then ALLGOALS (assm_tac ctxt) else all_tac) THEN flexflex_tac))); wenzelm@7419: wenzelm@7419: end; wenzelm@7419: wenzelm@7419: wenzelm@17110: (* rule etc. -- single-step refinements *) wenzelm@12347: wenzelm@17110: val trace_rules = ref false; wenzelm@12347: wenzelm@17110: fun trace ctxt rules = wenzelm@21962: if ! trace_rules andalso not (null rules) then wenzelm@17110: Pretty.big_list "rules:" (map (ProofContext.pretty_thm ctxt) rules) wenzelm@21962: |> Pretty.string_of |> tracing wenzelm@21962: else (); wenzelm@12347: wenzelm@12347: local wenzelm@12347: wenzelm@18841: fun gen_rule_tac tac rules facts = wenzelm@18841: (fn i => fn st => wenzelm@18841: if null facts then tac rules i st wenzelm@18841: else Seq.maps (fn rule => (tac o single) rule i st) (Drule.multi_resolves facts rules)) wenzelm@21687: THEN_ALL_NEW Goal.norm_hhf_tac; wenzelm@7130: wenzelm@10744: fun gen_arule_tac tac j rules facts = wenzelm@10744: EVERY' (gen_rule_tac tac rules facts :: replicate j Tactic.assume_tac); wenzelm@10744: wenzelm@11785: fun gen_some_rule_tac tac arg_rules ctxt facts = SUBGOAL (fn (goal, i) => wenzelm@11785: let wenzelm@11785: val rules = wenzelm@11785: if not (null arg_rules) then arg_rules wenzelm@19482: else flat (ContextRules.find_rules false facts goal ctxt) wenzelm@12055: in trace ctxt rules; tac rules facts i end); wenzelm@10309: wenzelm@10744: fun meth tac x = METHOD (HEADGOAL o tac x); wenzelm@10744: fun meth' tac x y = METHOD (HEADGOAL o tac x y); wenzelm@8220: wenzelm@7419: in wenzelm@7419: wenzelm@10744: val rule_tac = gen_rule_tac Tactic.resolve_tac; wenzelm@10744: val rule = meth rule_tac; wenzelm@10744: val some_rule_tac = gen_some_rule_tac rule_tac; wenzelm@10744: val some_rule = meth' some_rule_tac; wenzelm@10744: wenzelm@10744: val erule = meth' (gen_arule_tac Tactic.eresolve_tac); wenzelm@10744: val drule = meth' (gen_arule_tac Tactic.dresolve_tac); wenzelm@10744: val frule = meth' (gen_arule_tac Tactic.forward_tac); wenzelm@5824: wenzelm@7419: end; wenzelm@7419: wenzelm@7419: haftmann@25270: (* intros_tac -- pervasive search spanned by intro rules *) haftmann@25270: haftmann@25270: fun intros_tac intros facts = haftmann@25270: ALLGOALS (insert_tac facts THEN' haftmann@25270: REPEAT_ALL_NEW (resolve_tac intros)) haftmann@25270: THEN Tactic.distinct_subgoals_tac; haftmann@25270: haftmann@25270: nipkow@17587: (* iprover -- intuitionistic proof search *) wenzelm@17110: wenzelm@17110: local wenzelm@17110: wenzelm@17110: val remdups_tac = SUBGOAL (fn (g, i) => wenzelm@17110: let val prems = Logic.strip_assums_hyp g in wenzelm@19046: REPEAT_DETERM_N (length prems - length (distinct op aconv prems)) wenzelm@17110: (Tactic.ematch_tac [Drule.remdups_rl] i THEN Tactic.eq_assume_tac i) wenzelm@17110: end); wenzelm@17110: wenzelm@17110: fun REMDUPS tac = tac THEN_ALL_NEW remdups_tac; wenzelm@17110: wenzelm@17110: val bires_tac = Tactic.biresolution_from_nets_tac ContextRules.orderlist; wenzelm@17110: wenzelm@17110: fun safe_step_tac ctxt = wenzelm@17110: ContextRules.Swrap ctxt wenzelm@17110: (eq_assume_tac ORELSE' wenzelm@17110: bires_tac true (ContextRules.netpair_bang ctxt)); wenzelm@8195: wenzelm@17110: fun unsafe_step_tac ctxt = wenzelm@17110: ContextRules.wrap ctxt wenzelm@17110: (assume_tac APPEND' wenzelm@17110: bires_tac false (ContextRules.netpair_bang ctxt) APPEND' wenzelm@17110: bires_tac false (ContextRules.netpair ctxt)); wenzelm@17110: wenzelm@17110: fun step_tac ctxt i = wenzelm@17110: REPEAT_DETERM1 (REMDUPS (safe_step_tac ctxt) i) ORELSE wenzelm@17110: REMDUPS (unsafe_step_tac ctxt) i; wenzelm@17110: wenzelm@17110: fun intprover_tac ctxt gs d lim = SUBGOAL (fn (g, i) => if d > lim then no_tac else wenzelm@17110: let wenzelm@17110: val ps = Logic.strip_assums_hyp g; wenzelm@17110: val c = Logic.strip_assums_concl g; wenzelm@17110: in wenzelm@18921: if member (fn ((ps1, c1), (ps2, c2)) => wenzelm@19307: c1 aconv c2 andalso wenzelm@19307: length ps1 = length ps2 andalso wenzelm@19307: gen_eq_set (op aconv) (ps1, ps2)) gs (ps, c) then no_tac wenzelm@17110: else (step_tac ctxt THEN_ALL_NEW intprover_tac ctxt ((ps, c) :: gs) (d + 1) lim) i wenzelm@17110: end); wenzelm@17110: wenzelm@17110: in wenzelm@17110: nipkow@17587: fun iprover_tac ctxt opt_lim = wenzelm@18939: SELECT_GOAL (DEEPEN (2, the_default 20 opt_lim) (intprover_tac ctxt [] 0) 4 1); wenzelm@17110: wenzelm@17110: end; wenzelm@8195: wenzelm@8195: wenzelm@8351: (* ML tactics *) wenzelm@8351: wenzelm@20289: val tactic_ref = ref ((fn _ => raise Match): Proof.context -> thm list -> tactic); wenzelm@8351: fun set_tactic f = tactic_ref := f; wenzelm@8351: wenzelm@26385: fun ml_tactic (txt, pos) ctxt = NAMED_CRITICAL "ML" (fn () => wenzelm@26455: (ML_Context.eval_in (SOME (Context.Proof ctxt)) false pos wenzelm@23425: ("let fun tactic (ctxt: Proof.context) (facts: thm list) : tactic =\n" wenzelm@26455: ^ txt ^ "\nin Method.set_tactic tactic end"); wenzelm@26415: Context.setmp_thread_data (SOME (Context.Proof ctxt)) (! tactic_ref ctxt))); wenzelm@23425: wenzelm@23425: fun tactic txt ctxt = METHOD (ml_tactic txt ctxt); wenzelm@23425: fun raw_tactic txt ctxt = RAW_METHOD (ml_tactic txt ctxt); wenzelm@8351: wenzelm@8351: wenzelm@5824: wenzelm@17110: (** method syntax **) wenzelm@17110: wenzelm@17110: (* method text *) wenzelm@17110: wenzelm@17110: type src = Args.src; wenzelm@5824: wenzelm@17110: datatype text = wenzelm@23349: Basic of (Proof.context -> method) * Position.T | wenzelm@17110: Source of src | wenzelm@20030: Source_i of src | wenzelm@17110: Then of text list | wenzelm@17110: Orelse of text list | wenzelm@17110: Try of text | wenzelm@19186: Repeat1 of text | wenzelm@19186: SelectGoals of int * text; wenzelm@17110: wenzelm@23349: fun primitive_text r = Basic (K (SIMPLE_METHOD (PRIMITIVE r)), Position.none); wenzelm@23349: val succeed_text = Basic (K succeed, Position.none); wenzelm@17110: val default_text = Source (Args.src (("default", []), Position.none)); wenzelm@23349: val this_text = Basic (K this, Position.none); wenzelm@23349: val done_text = Basic (K (SIMPLE_METHOD all_tac), Position.none); wenzelm@23349: fun sorry_text int = Basic (cheating int, Position.none); wenzelm@17110: wenzelm@23349: fun finish_text (NONE, immed) pos = Basic (close immed, pos) wenzelm@23349: | finish_text (SOME txt, immed) pos = Then [txt, Basic (close immed, pos)]; wenzelm@17110: wenzelm@17110: wenzelm@17110: (* method definitions *) wenzelm@5824: wenzelm@24116: structure Methods = TheoryDataFun wenzelm@22846: ( wenzelm@20289: type T = (((src -> Proof.context -> method) * string) * stamp) NameSpace.table; wenzelm@16347: val empty = NameSpace.empty_table; wenzelm@6546: val copy = I; wenzelm@16448: val extend = I; wenzelm@23655: fun merge _ tables : T = NameSpace.merge_tables (eq_snd (op =)) tables handle Symtab.DUP dup => wenzelm@23655: error ("Attempt to merge different versions of method " ^ quote dup); wenzelm@22846: ); wenzelm@5824: wenzelm@22846: fun print_methods thy = wenzelm@22846: let wenzelm@24116: val meths = Methods.get thy; wenzelm@22846: fun prt_meth (name, ((_, comment), _)) = Pretty.block wenzelm@22846: [Pretty.str (name ^ ":"), Pretty.brk 2, Pretty.str comment]; wenzelm@22846: in wenzelm@22846: [Pretty.big_list "methods:" (map prt_meth (NameSpace.extern_table meths))] wenzelm@22846: |> Pretty.chunks |> Pretty.writeln wenzelm@22846: end; wenzelm@7611: wenzelm@5824: wenzelm@5824: (* get methods *) wenzelm@5824: wenzelm@20030: fun method_i thy = wenzelm@5824: let wenzelm@24116: val meths = #2 (Methods.get thy); wenzelm@5884: fun meth src = wenzelm@20030: let val ((name, _), pos) = Args.dest_src src in wenzelm@17412: (case Symtab.lookup meths name of skalberg@15531: NONE => error ("Unknown proof method: " ^ quote name ^ Position.str_of pos) wenzelm@23937: | SOME ((mth, _), _) => mth src) wenzelm@5824: end; wenzelm@5824: in meth end; wenzelm@5824: wenzelm@24116: fun method thy = method_i thy o Args.map_name (NameSpace.intern (#1 (Methods.get thy))); wenzelm@20030: wenzelm@5824: wenzelm@17110: (* add method *) wenzelm@5824: wenzelm@5824: fun add_methods raw_meths thy = wenzelm@5824: let wenzelm@16145: val new_meths = raw_meths |> map (fn (name, f, comment) => wenzelm@16347: (name, ((f, comment), stamp ()))); wenzelm@5824: haftmann@23086: fun add meths = NameSpace.extend_table (Sign.naming_of thy) new_meths meths wenzelm@23655: handle Symtab.DUP dup => error ("Duplicate declaration of method " ^ quote dup); wenzelm@24116: in Methods.map add thy end; wenzelm@5824: wenzelm@9194: val add_method = add_methods o Library.single; wenzelm@9194: wenzelm@5824: wenzelm@17356: (* method_setup *) wenzelm@17356: wenzelm@26385: fun method_setup name (txt, pos) cmt = wenzelm@26455: ML_Context.expression pos wenzelm@22118: "val method: bstring * (Method.src -> Proof.context -> Proof.method) * string" wenzelm@22086: "Context.map_theory (Method.add_method method)" wenzelm@22086: ("(" ^ quote name ^ ", " ^ txt ^ ", " ^ quote cmt ^ ")") wenzelm@22086: |> Context.theory_map; wenzelm@17356: wenzelm@17356: wenzelm@5884: wenzelm@17110: (** concrete syntax **) wenzelm@5824: wenzelm@5884: (* basic *) wenzelm@5884: wenzelm@18999: fun syntax scan = Args.context_syntax "method" scan; wenzelm@5824: wenzelm@17110: fun simple_args scan f src ctxt : method = haftmann@21879: fst (syntax (Scan.lift (scan >> (fn x => f x ctxt))) src ctxt); wenzelm@8351: wenzelm@20289: fun ctxt_args (f: Proof.context -> method) src ctxt = haftmann@21879: fst (syntax (Scan.succeed (f ctxt)) src ctxt); wenzelm@7555: wenzelm@7555: fun no_args m = ctxt_args (K m); wenzelm@5884: wenzelm@5884: wenzelm@5884: (* sections *) wenzelm@5824: wenzelm@20289: type modifier = (Proof.context -> Proof.context) * attribute; wenzelm@7268: wenzelm@7268: local wenzelm@7268: wenzelm@24010: fun thms ss = Scan.repeat (Scan.unless (Scan.lift (Scan.first ss)) Attrib.multi_thm) >> flat; wenzelm@19186: fun app (f, att) (context, ths) = foldl_map att (Context.map_proof f context, ths); wenzelm@5824: wenzelm@24022: fun section ss = Scan.depend (fn context => (Scan.first ss -- Scan.pass context (thms ss)) :|-- wenzelm@24022: (fn (m, ths) => Scan.succeed (app m (context, ths)))); wenzelm@5884: wenzelm@7601: fun sectioned args ss = args -- Scan.repeat (section ss); wenzelm@5884: wenzelm@7268: in wenzelm@5824: wenzelm@5884: fun sectioned_args args ss f src ctxt = haftmann@21879: let val ((x, _), ctxt') = syntax (sectioned args ss) src ctxt wenzelm@5921: in f x ctxt' end; wenzelm@5884: wenzelm@7601: fun bang_sectioned_args ss f = sectioned_args Args.bang_facts ss f; wenzelm@9777: fun bang_sectioned_args' ss scan f = wenzelm@9777: sectioned_args (Args.bang_facts -- scan >> swap) ss (uncurry f); wenzelm@7601: fun only_sectioned_args ss f = sectioned_args (Scan.succeed ()) ss (fn () => f); wenzelm@7268: wenzelm@18999: fun thms_ctxt_args f = sectioned_args (thms []) [] f; wenzelm@8093: fun thms_args f = thms_ctxt_args (K o f); wenzelm@9706: fun thm_args f = thms_args (fn [thm] => f thm | _ => error "Single theorem expected"); wenzelm@5824: wenzelm@7268: end; wenzelm@7268: wenzelm@5824: nipkow@17587: (* iprover syntax *) wenzelm@12347: wenzelm@12347: local wenzelm@12347: wenzelm@12347: val introN = "intro"; wenzelm@12347: val elimN = "elim"; wenzelm@12347: val destN = "dest"; wenzelm@12347: val ruleN = "rule"; wenzelm@12347: wenzelm@12347: fun modifier name kind kind' att = skalberg@15531: Args.$$$ name |-- (kind >> K NONE || kind' |-- Args.nat --| Args.colon >> SOME) wenzelm@20289: >> (pair (I: Proof.context -> Proof.context) o att); wenzelm@12347: nipkow@17587: val iprover_modifiers = wenzelm@18728: [modifier destN Args.bang_colon Args.bang ContextRules.dest_bang, wenzelm@18728: modifier destN Args.colon (Scan.succeed ()) ContextRules.dest, wenzelm@18728: modifier elimN Args.bang_colon Args.bang ContextRules.elim_bang, wenzelm@18728: modifier elimN Args.colon (Scan.succeed ()) ContextRules.elim, wenzelm@18728: modifier introN Args.bang_colon Args.bang ContextRules.intro_bang, wenzelm@18728: modifier introN Args.colon (Scan.succeed ()) ContextRules.intro, wenzelm@18728: Args.del -- Args.colon >> K (I, ContextRules.rule_del)]; wenzelm@12347: wenzelm@12347: in wenzelm@12347: wenzelm@18640: val iprover_meth = wenzelm@18640: bang_sectioned_args' iprover_modifiers (Scan.lift (Scan.option Args.nat)) wenzelm@18640: (fn n => fn prems => fn ctxt => METHOD (fn facts => wenzelm@18640: HEADGOAL (insert_tac (prems @ facts) THEN' wenzelm@23590: ObjectLogic.atomize_prems_tac THEN' iprover_tac ctxt n))); wenzelm@12347: wenzelm@12347: end; wenzelm@12347: wenzelm@12347: wenzelm@9539: (* tactic syntax *) wenzelm@8238: wenzelm@10744: fun nat_thms_args f = uncurry f oo haftmann@21879: (fst oo syntax (Scan.lift (Scan.optional (Args.parens Args.nat) 0) -- Attrib.thms)); wenzelm@10744: haftmann@21879: fun goal_args' args tac src ctxt = fst (syntax (Args.goal_spec HEADGOAL -- args >> wenzelm@21592: (fn (quant, s) => SIMPLE_METHOD'' quant (tac s))) src ctxt); wenzelm@8537: wenzelm@9539: fun goal_args args tac = goal_args' (Scan.lift args) tac; wenzelm@8238: ballarin@14174: fun goal_args_ctxt' args tac src ctxt = haftmann@21879: fst (syntax (Args.goal_spec HEADGOAL -- args >> wenzelm@21592: (fn (quant, s) => SIMPLE_METHOD'' quant (tac ctxt s))) src ctxt); wenzelm@8238: ballarin@14174: fun goal_args_ctxt args tac = goal_args_ctxt' (Scan.lift args) tac; wenzelm@5824: wenzelm@14718: wenzelm@18708: (* theory setup *) wenzelm@5824: wenzelm@26463: val _ = Context.>> (Context.map_theory wenzelm@26463: (add_methods wenzelm@26463: [("fail", no_args fail, "force failure"), wenzelm@26463: ("succeed", no_args succeed, "succeed"), wenzelm@26463: ("-", no_args insert_facts, "do nothing (insert current facts only)"), wenzelm@26463: ("insert", thms_args insert, "insert theorems, ignoring facts (improper)"), wenzelm@26463: ("intro", thms_args intro, "repeatedly apply introduction rules"), wenzelm@26463: ("elim", thms_args elim, "repeatedly apply elimination rules"), wenzelm@26463: ("unfold", thms_ctxt_args unfold_meth, "unfold definitions"), wenzelm@26463: ("fold", thms_ctxt_args fold_meth, "fold definitions"), wenzelm@26463: ("atomize", (atomize o fst) oo syntax (Args.mode "full"), wenzelm@26463: "present local premises as object-level statements"), wenzelm@26463: ("iprover", iprover_meth, "intuitionistic proof search"), wenzelm@26463: ("rule", thms_ctxt_args some_rule, "apply some intro/elim rule"), wenzelm@26463: ("erule", nat_thms_args erule, "apply rule in elimination manner (improper)"), wenzelm@26463: ("drule", nat_thms_args drule, "apply rule in destruct manner (improper)"), wenzelm@26463: ("frule", nat_thms_args frule, "apply rule in forward manner (improper)"), wenzelm@26463: ("this", no_args this, "apply current facts as rules"), wenzelm@26463: ("fact", thms_ctxt_args fact, "composition by facts from context"), wenzelm@26463: ("assumption", ctxt_args assumption, "proof by assumption, preferring facts"), wenzelm@26463: ("rename_tac", goal_args (Scan.repeat1 Args.name) Tactic.rename_params_tac, wenzelm@26463: "rename parameters of goal"), wenzelm@26463: ("rotate_tac", goal_args (Scan.optional Args.int 1) Tactic.rotate_tac, wenzelm@26463: "rotate assumptions of goal"), wenzelm@26463: ("tactic", simple_args (Args.position Args.name) tactic, "ML tactic as proof method"), wenzelm@26463: ("raw_tactic", simple_args (Args.position Args.name) raw_tactic, wenzelm@26463: "ML tactic as raw proof method")])); wenzelm@5824: wenzelm@5824: wenzelm@22118: (* outer parser *) wenzelm@22118: wenzelm@22118: local wenzelm@22118: wenzelm@22118: structure T = OuterLex; wenzelm@22118: structure P = OuterParse; wenzelm@22118: wenzelm@22118: fun is_symid_meth s = wenzelm@22118: s <> "|" andalso s <> "?" andalso s <> "+" andalso T.is_sid s; wenzelm@22118: wenzelm@22118: fun meth4 x = wenzelm@22118: (P.position (P.xname >> rpair []) >> (Source o Args.src) || wenzelm@22118: P.$$$ "(" |-- P.!!! (meth0 --| P.$$$ ")")) x wenzelm@22118: and meth3 x = wenzelm@22118: (meth4 --| P.$$$ "?" >> Try || wenzelm@22118: meth4 --| P.$$$ "+" >> Repeat1 || wenzelm@22118: meth4 -- (P.$$$ "[" |-- Scan.optional P.nat 1 --| P.$$$ "]") >> (SelectGoals o swap) || wenzelm@22118: meth4) x wenzelm@22118: and meth2 x = wenzelm@22118: (P.position (P.xname -- P.args1 is_symid_meth false) >> (Source o Args.src) || wenzelm@22118: meth3) x wenzelm@22118: and meth1 x = (P.enum1 "," meth2 >> (fn [m] => m | ms => Then ms)) x wenzelm@22118: and meth0 x = (P.enum1 "|" meth1 >> (fn [m] => m | ms => Orelse ms)) x; wenzelm@22118: wenzelm@22118: in val parse = meth3 end; wenzelm@22118: wenzelm@22118: wenzelm@16145: (*final declarations of this structure!*) wenzelm@16145: val unfold = unfold_meth; wenzelm@16145: val fold = fold_meth; wenzelm@16145: wenzelm@5824: end; wenzelm@5824: wenzelm@5824: structure BasicMethod: BASIC_METHOD = Method; wenzelm@5824: open BasicMethod;