wenzelm@27389
|
1 |
(* Title: Pure/ML/ml_thms.ML
|
wenzelm@27389
|
2 |
Author: Makarius
|
wenzelm@27389
|
3 |
|
wenzelm@27389
|
4 |
Isar theorem values within ML.
|
wenzelm@27389
|
5 |
*)
|
wenzelm@27389
|
6 |
|
wenzelm@27389
|
7 |
signature ML_THMS =
|
wenzelm@27389
|
8 |
sig
|
wenzelm@27389
|
9 |
val the_thms: Proof.context -> int -> thm list
|
wenzelm@27389
|
10 |
val the_thm: Proof.context -> int -> thm
|
wenzelm@27389
|
11 |
end;
|
wenzelm@27389
|
12 |
|
wenzelm@27389
|
13 |
structure ML_Thms: ML_THMS =
|
wenzelm@27389
|
14 |
struct
|
wenzelm@27389
|
15 |
|
wenzelm@27389
|
16 |
(* auxiliary facts table *)
|
wenzelm@27389
|
17 |
|
wenzelm@27389
|
18 |
structure AuxFacts = ProofDataFun
|
wenzelm@27389
|
19 |
(
|
wenzelm@27389
|
20 |
type T = thm list Inttab.table;
|
wenzelm@27389
|
21 |
fun init _ = Inttab.empty;
|
wenzelm@27389
|
22 |
);
|
wenzelm@27389
|
23 |
|
wenzelm@27389
|
24 |
val put_thms = AuxFacts.map o Inttab.update;
|
wenzelm@27389
|
25 |
|
wenzelm@27389
|
26 |
fun the_thms ctxt name = the (Inttab.lookup (AuxFacts.get ctxt) name);
|
wenzelm@27389
|
27 |
fun the_thm ctxt name = the_single (the_thms ctxt name);
|
wenzelm@27389
|
28 |
|
wenzelm@27389
|
29 |
fun thm_bind kind a i =
|
wenzelm@27389
|
30 |
"val " ^ a ^ " = ML_Thms.the_" ^ kind ^
|
wenzelm@27389
|
31 |
" (ML_Context.the_local_context ()) " ^ string_of_int i ^ ";\n";
|
wenzelm@27389
|
32 |
|
wenzelm@27389
|
33 |
|
wenzelm@27389
|
34 |
(* fact references *)
|
wenzelm@27389
|
35 |
|
wenzelm@27389
|
36 |
fun thm_antiq kind scan = ML_Context.add_antiq kind
|
wenzelm@27869
|
37 |
(fn _ => scan >> (fn ths => fn {struct_name, background} =>
|
wenzelm@27389
|
38 |
let
|
wenzelm@27389
|
39 |
val i = serial ();
|
wenzelm@27389
|
40 |
val (a, background') = background
|
wenzelm@27389
|
41 |
|> ML_Antiquote.variant kind ||> put_thms (i, ths);
|
wenzelm@27389
|
42 |
val ml = (thm_bind kind a i, struct_name ^ "." ^ a);
|
wenzelm@27389
|
43 |
in (K ml, background') end));
|
wenzelm@27389
|
44 |
|
wenzelm@27389
|
45 |
val _ = thm_antiq "thm" (Attrib.thm >> single);
|
wenzelm@27389
|
46 |
val _ = thm_antiq "thms" Attrib.thms;
|
wenzelm@27389
|
47 |
|
wenzelm@27389
|
48 |
|
wenzelm@27389
|
49 |
(* ad-hoc goals *)
|
wenzelm@27389
|
50 |
|
wenzelm@27809
|
51 |
val by = Args.$$$ "by";
|
wenzelm@27809
|
52 |
val goal = Scan.unless (Scan.lift by) Args.prop;
|
wenzelm@27389
|
53 |
|
wenzelm@27389
|
54 |
val _ = ML_Context.add_antiq "lemma"
|
wenzelm@27869
|
55 |
(fn pos => Args.context -- Args.mode "open" -- Scan.repeat1 goal --
|
wenzelm@27809
|
56 |
Scan.lift (by |-- Method.parse -- Scan.option Method.parse) >>
|
wenzelm@27521
|
57 |
(fn (((ctxt, is_open), props), methods) => fn {struct_name, background} =>
|
wenzelm@27389
|
58 |
let
|
wenzelm@27389
|
59 |
val i = serial ();
|
wenzelm@27869
|
60 |
val prep_result =
|
wenzelm@27869
|
61 |
Goal.norm_result #> Thm.default_position pos #> not is_open ? Thm.close_derivation;
|
wenzelm@27389
|
62 |
fun after_qed [res] goal_ctxt =
|
wenzelm@27521
|
63 |
put_thms (i, map prep_result (ProofContext.export goal_ctxt ctxt res)) goal_ctxt;
|
wenzelm@27389
|
64 |
val ctxt' = ctxt
|
wenzelm@27389
|
65 |
|> Proof.theorem_i NONE after_qed [map (rpair []) props]
|
wenzelm@27521
|
66 |
|> Proof.global_terminal_proof methods;
|
wenzelm@27389
|
67 |
val (a, background') = background
|
wenzelm@27389
|
68 |
|> ML_Antiquote.variant "lemma" ||> put_thms (i, the_thms ctxt' i);
|
wenzelm@27389
|
69 |
val ml = (thm_bind (if length props = 1 then "thm" else "thms") a i, struct_name ^ "." ^ a);
|
wenzelm@27389
|
70 |
in (K ml, background') end));
|
wenzelm@27389
|
71 |
|
wenzelm@27389
|
72 |
end;
|
wenzelm@27389
|
73 |
|