1 (* Title: src/Tools/isac/Know_Store.thy
2 Author: Mathias Lehnfeld
4 Calc work on Problem employing MethodC; both are collected in a respective Store;
5 The collections' structure is independent from the dependency graph of Isabelle's theories
7 Store is also used by Thy_Write, required for Isac's Java front end, irrelevant for PIDE.
9 The files (in "xxxxx-def.sml") contain definitions required for Know_Store;
10 they also include minimal code required for other "xxxxx-def.sml" files.
11 These files have companion files "xxxxx.sml" with all further code,
12 located at appropriate positions in the file structure.
14 The separation of "xxxxx-def.sml" from "xxxxx.sml" should be overcome by
15 appropriate use of polymorphic high order functions.
20 keywords "setup_rule" :: thy_decl
24 ML_Antiquotation.conditional \<^binding>\<open>isac_test\<close>
25 (fn _ => Options.default_bool \<^system_option>\<open>isac_test\<close>)
31 ML_file "rule-def.sml"
32 ML_file "thmC-def.sml"
33 ML_file "eval-def.sml" (*rename identifiers by use of struct.id*)
34 ML_file "rewrite-order.sml" (*rename identifiers by use of struct.id*)
36 ML_file "error-pattern-def.sml"
37 ML_file "rule-set.sml"
40 ML_file "check-unique.sml"
41 ML_file "references-def.sml"
42 ML_file "model-pattern.sml"
43 ML_file "problem-def.sml"
44 ML_file "method-def.sml"
46 ML_file "thy-write.sml"
52 section \<open>Knowledge elements for problems and methods\<close>
54 (* Knowledge (and Exercises) are held by "Know_Store" in Isac's Java front-end.
55 In the front-end Knowledge comprises theories, problems and methods.
56 Elements of problems and methods are defined in theories alongside
57 the development of respective language elements.
58 However, the structure of methods and problems is independent from theories'
59 deductive structure. Thus respective structures are built in Build_Thydata.thy.
61 Most elements of problems and methods are implemented in "Knowledge/", but some
62 of them are implemented in "ProgLang/" already; thus "Know_Store.thy" got this
63 location in the directory structure.
65 get_* retrieves all * of the respective theory PLUS of all ancestor theories.
67 signature KESTORE_ELEMS =
69 val get_rlss: theory -> (Rule_Set.id * (ThyC.id * Rule_Set.T)) list
70 val add_rlss: (Rule_Set.id * (ThyC.id * Rule_Set.T)) list -> theory -> theory
71 val get_calcs: theory -> (Eval_Def.prog_calcID * (Eval_Def.calID * Eval_Def.eval_fn)) list
72 val add_calcs: (Eval_Def.prog_calcID * (Eval_Def.calID * Eval_Def.eval_fn)) list -> theory -> theory
73 val get_cas: theory -> CAS_Def.T list
74 val add_cas: CAS_Def.T list -> theory -> theory
75 val get_ptyps: theory -> Probl_Def.store
76 val add_pbts: (Probl_Def.T * References_Def.id) list -> theory -> theory
77 val get_mets: theory -> Meth_Def.store
78 val add_mets: (Meth_Def.T * References_Def.id) list -> theory -> theory
79 val get_thes: theory -> (Thy_Write.thydata Store.node) list
80 val add_thes: (Thy_Write.thydata * Thy_Write.theID) list -> theory -> theory (* thydata dropped at existing elems *)
81 val insert_fillpats: (Thy_Write.theID * Error_Pattern_Def.fill_in list) list -> theory -> theory
82 val get_ref_thy: unit -> theory
83 val set_ref_thy: theory -> unit
86 structure KEStore_Elems: KESTORE_ELEMS =
88 fun union_overwrite eq l1 l2 = fold (insert eq) l2 (*..swapped..*) l1;
90 structure Data = Theory_Data (
91 type T = (Rule_Set.id * (ThyC.id * Rule_Set.T)) list;
94 val merge = Rule_Set.to_kestore;
96 fun get_rlss thy = Data.get thy
97 fun add_rlss rlss = Data.map (union_overwrite Rule_Set.equal rlss)
99 structure Data = Theory_Data (
100 type T = (Eval_Def.prog_calcID * (Eval_Def.calID * Eval_Def.eval_fn)) list;
103 val merge = merge Eval_Def.calc_eq;
105 fun get_calcs thy = Data.get thy
106 fun add_calcs calcs = Data.map (union_overwrite Eval_Def.calc_eq calcs)
108 structure Data = Theory_Data (
109 type T = (term * (References_Def.T * (term list -> (term * term list) list))) list;
112 val merge = merge CAS_Def.equal;
114 fun get_cas thy = Data.get thy
115 fun add_cas cas = Data.map (union_overwrite CAS_Def.equal cas)
117 structure Data = Theory_Data (
118 type T = Probl_Def.store;
119 val empty = [Probl_Def.empty_store];
121 val merge = Store.merge;
123 fun get_ptyps thy = Data.get thy;
124 fun add_pbts pbts thy = let
125 fun add_pbt (pbt as {guh,...}, pblID) =
126 (* the pblID has the leaf-element as first; better readability achieved *)
127 (if (!Check_Unique.on) then Probl_Def.check_unique guh (Data.get thy) else ();
128 rev pblID |> Store.insert pblID pbt);
129 in Data.map (fold add_pbt pbts) thy end;
131 structure Data = Theory_Data (
132 type T = Meth_Def.store;
133 val empty = [Meth_Def.empty_store];
135 val merge = Store.merge;
137 val get_mets = Data.get;
138 fun add_mets mets thy = let
139 fun add_met (met as {guh,...}, metID) =
140 (if (!Check_Unique.on) then Meth_Def.check_unique guh (Data.get thy) else ();
141 Store.insert metID met metID);
142 in Data.map (fold add_met mets) thy end;
144 structure Data = Theory_Data (
145 type T = (Thy_Write.thydata Store.node) list;
148 val merge = Store.merge; (* relevant for store_thm, store_rls *)
150 fun get_thes thy = Data.get thy
151 fun add_thes thes thy = let
152 fun add_the (thydata, theID) = Thy_Write.add_thydata ([], theID) thydata
153 in Data.map (fold add_the thes) thy end;
154 fun insert_fillpats fis thy =
156 fun update_elem (theID, fillpats) =
158 val hthm = Store.get (Data.get thy) theID theID
159 val hthm' = Thy_Write.update_hthm hthm fillpats
161 raise ERROR ("insert_fillpats: " ^ strs2str theID ^ "must address a theorem")
162 in Store.update theID theID hthm' end
163 in Data.map (fold update_elem fis) thy end
165 val cur_thy = Synchronized.var "finally_knowledge_complete" @{theory};
166 fun set_ref_thy thy = Synchronized.change cur_thy (fn _ => thy); (* never RE-set ! *)
167 fun get_ref_thy () = Synchronized.value cur_thy;
172 subsection \<open>Isar command syntax\<close>
177 val parse_rule = Parse.name -- Parse.!!! (\<^keyword>\<open>=\<close> |-- Parse.ML_source);
179 val ml = ML_Lex.read;
181 fun ml_rule thy (name, source) =
182 ml "(" @ ml (ML_Syntax.print_string name) @ ml ", " @
183 ml "(" @ ml (ML_Syntax.print_string (Context.theory_name thy)) @ ml ", " @
184 ML_Lex.read_source source @ ml "))";
186 fun ml_rules thy args =
187 ml "Theory.setup (KEStore_Elems.add_rlss [" @
188 flat (separate (ml ",") (map (ml_rule thy) args)) @ ml "])";
191 Outer_Syntax.command \<^command_keyword>\<open>setup_rule\<close> "setup ISAC rules"
192 (Parse.and_list1 parse_rule >> (fn args => Toplevel.theory (fn thy =>
193 thy |> Context.theory_map
194 (ML_Context.expression (Position.thread_data ()) (ml_rules thy args)))));
200 section \<open>Re-use existing access functions for knowledge elements\<close>
202 The independence of problems' and methods' structure enforces the accesse
203 functions to use "Isac_Knowledge", the final theory which comprises all knowledge defined.
206 val get_ref_thy = KEStore_Elems.get_ref_thy;
208 fun assoc_rls (rls' : Rule_Set.id) =
209 case AList.lookup (op =) (KEStore_Elems.get_rlss (ThyC.get_theory "Isac_Knowledge")) rls' of
211 | NONE => raise ERROR ("rls \""^ rls' ^ "\" missing in Know_Store.\n" ^
212 "TODO exception hierarchy needs to be established.")
214 fun assoc_rls' thy (rls' : Rule_Set.id) =
215 case AList.lookup (op =) (KEStore_Elems.get_rlss thy) rls' of
217 | NONE => raise ERROR ("rls \""^ rls' ^ "\" missing in Know_Store.\n" ^
218 "TODO exception hierarchy needs to be established.")
220 fun assoc_calc thy calID = let
222 raise ERROR ("assoc_calc: '" ^ key ^ "' not found in theory " ^ (Context.theory_name thy))
223 | ass ((calc, (keyi, _)) :: pairs, key) =
224 if key = keyi then calc else ass (pairs, key);
225 in ass (thy |> KEStore_Elems.get_calcs, calID) end;
227 fun assoc_calc' thy key = let
229 raise ERROR ("assoc_calc': '" ^ key' ^ "' not found in theory " ^ (Context.theory_name thy))
230 | ass ((all as (keyi, _)) :: pairs, key') =
231 if key' = keyi then all else ass (pairs, key');
232 in ass (KEStore_Elems.get_calcs thy, key) end;
234 fun assoc_cas thy key = assoc (KEStore_Elems.get_cas thy, key);
236 fun get_ptyps () = get_ref_thy () |> KEStore_Elems.get_ptyps;
237 fun get_mets () = get_ref_thy () |> KEStore_Elems.get_mets;
238 fun get_thes () = get_ref_thy () |> KEStore_Elems.get_thes;
242 empty = \<open>Rule_Set.empty\<close> and
243 e_rrls = \<open>Rule_Set.e_rrls\<close>
245 section \<open>determine sequence of main parts in thehier\<close>
247 KEStore_Elems.add_thes
248 [(Thy_Write.Html {guh = Thy_Write.part2guh ["IsacKnowledge"], html = "",
249 mathauthors = ["Isac team"], coursedesign = []}, ["IsacKnowledge"]),
250 (Thy_Write.Html {guh = Thy_Write.part2guh ["Isabelle"], html = "",
251 mathauthors = ["Isabelle team, TU Munich"], coursedesign = []}, ["Isabelle"]),
252 (Thy_Write.Html {guh = Thy_Write.part2guh ["IsacScripts"], html = "",
253 mathauthors = ["Isac team"], coursedesign = []}, ["IsacScripts"])]
256 section \<open>Functions for checking KEStore_Elems\<close>
258 fun short_string_of_rls Rule_Set.Empty = "Erls"
259 | short_string_of_rls (Rule_Def.Repeat {calc, rules, ...}) =
260 "Rls {#calc = " ^ string_of_int (length calc) ^
261 ", #rules = " ^ string_of_int (length rules) ^ ", ..."
262 | short_string_of_rls (Rule_Set.Sequence {calc, rules, ...}) =
263 "Seq {#calc = " ^ string_of_int (length calc) ^
264 ", #rules = " ^ string_of_int (length rules) ^ ", ..."
265 | short_string_of_rls (Rule_Set.Rrls _) = "Rrls {...}";
266 fun check_kestore_rls (rls', (thyID, rls)) =
267 "(" ^ rls' ^ ", (" ^ thyID ^ ", " ^ short_string_of_rls rls ^ "))";
269 fun check_kestore_calc ((id, (c, _)) : Rule_Def.calc) = "(" ^ id ^ ", (" ^ c ^ ", fn))";
271 (* we avoid term_to_string''' defined later *)
272 fun check_kestore_cas ((t, (s, _)) : CAS_Def.T) =
273 "(" ^ (Print_Mode.setmp [] (Syntax.string_of_term (Config.put show_markup false
274 (Proof_Context.init_global @{theory})))) t ^ ", " ^ References_Def.to_string s ^ ")";
276 fun count_kestore_ptyps [] = 0
277 | count_kestore_ptyps ((Store.Node (_, _, ps)) :: ps') =
278 1 + count_kestore_ptyps ps + count_kestore_ptyps ps';
279 fun check_kestore_ptyp' strfun (Store.Node (key, pbts, pts)) = "Ptyp (" ^ (quote key) ^ ", " ^
280 (strfun pbts) ^ ", " ^ (map (check_kestore_ptyp' strfun) pts |> list2str) ^ ")" |> linefeed;
281 val check_kestore_ptyp = check_kestore_ptyp' Probl_Def.s_to_string;
282 fun ptyp_ord ((Store.Node (s1, _, _)), (Store.Node (s2, _, _))) = string_ord (s1, s2);
283 fun pbt_ord ({guh = guh'1, ...} : Probl_Def.T, {guh = guh'2, ...} : Probl_Def.T) = string_ord (guh'1, guh'2);
284 fun sort_kestore_ptyp' _ [] = []
285 | sort_kestore_ptyp' ordfun ((Store.Node (key, pbts, ps)) :: ps') =
286 ((Store.Node (key, sort ordfun pbts, sort_kestore_ptyp' ordfun ps |> sort ptyp_ord))
287 :: sort_kestore_ptyp' ordfun ps');
288 val sort_kestore_ptyp = sort_kestore_ptyp' pbt_ord;
290 fun metguh2str ({guh,...} : Meth_Def.T) = guh : string;
291 fun check_kestore_met (mp: Meth_Def.T Store.node) =
292 check_kestore_ptyp' (fn xs => map metguh2str xs |> strs2str) mp;
293 fun met_ord ({guh = guh'1, ...} : Meth_Def.T, {guh = guh'2, ...} : Meth_Def.T) = string_ord (guh'1, guh'2);
294 val sort_kestore_met = sort_kestore_ptyp' met_ord;
296 fun check_kestore_thes thes = ((map writeln) o (map (check_kestore_ptyp' Thy_Write.thes2str))) thes
297 fun write_thes thydata_list =
299 |> map (fn (id, the) => (Thy_Write.theID2str id, Thy_Write.the2str the))