1 (* elements of calculations.
2 they are partially held in association lists as ref's for
3 switching language levels (meta-string, object-values).
4 in order to keep these ref's during re-evaluation of code,
5 they are defined here at the beginning of the code.
6 Author: Walther Neuper 2003
7 (c) copyright due to lincense terms
14 val linefeed = (curry op^) "\n";
15 type authors = string list;
18 val empty_cterm' = "empty_cterm'";
20 type thmID = string; (* identifier for a thm (the shortest possible identifier) *)
21 type thmDeriv = string; (* WN120524 deprecated
22 thyID ^"."^ xxx ^"."^ thmID, see fun thmID_of_derivation_name
23 WN120524: dont use Thm.derivation_name, this is destroyed by num_str;
24 Thm.get_name_hint survives num_str and seems perfectly reliable *)
26 type thm' = thmID * cterm';(*WN060610 deprecated in favour of thm''*)
27 type thm'' = thmID * term;
30 (*.a 'guh'='globally unique handle' is a string unique for each element
31 of isac's KEStore and persistent over time
32 (in particular under shifts within the respective hierarchy);
34 # guh NOT resistant agains shifts from one thy to another
35 (which is the price for Isabelle's design: thy's overwrite ids of subthy's)
36 # requirement for matchTheory: induce guh from tac + current thy
37 (see 'fun thy_containing_thm', 'fun thy_containing_rls' etc.)
38 TODO: introduce to pbl, met.*)
40 val e_guh = "e_guh":guh;
44 (* eval function calling sml code during rewriting.
45 Unifying "type cal" and "type calc" would make Lucas-Interpretation more efficient,
46 see "fun rule2stac": instead of
47 Calc: calID * eval_fn -> rule
49 Calc: prog_calcID * (calID * eval_fn)) -> rule*)
50 type eval_fn = (string -> term -> theory -> (string * term) option);
51 fun e_evalfn (_:'a) (_:term) (_:theory) = NONE:(string * term) option;
52 (*. op in isa-term 'Const(op,_)' .*)
56 type cal = (calID * eval_fn);
57 (*. fun calculate_ fetches the evaluation-function via this list. *)
58 type prog_calcID = string;
59 type calc = (prog_calcID * cal);
61 prog_calcID * (* a simple identifier used in programs *)
62 (calID * (* a long identifier used in Const *)
63 eval_fn) (* an ML function *)
64 fun calc_eq ((pi1, (ci1, _)) : calc_elem, (pi2, (ci2, _)) : calc_elem) =
66 then if ci1 = ci2 then true else error ("calc_eq: " ^ ci1 ^ " <> " ^ ci2)
70 type subs' = (cterm' * cterm') list; (*16.11.00 for FE-KE*)
71 type subst = (term * term) list; (*here for ets2str*)
72 val e_subst = []:(term * term) list;
74 (*TODO.WN060610 make use of "type rew_ord" total*)
75 type rew_ord' = string;
76 val e_rew_ord' = "e_rew_ord" : rew_ord';
77 type rew_ord_ = subst -> Term.term * Term.term -> bool;
78 fun dummy_ord (_:subst) (_:term,_:term) = true;
79 val e_rew_ord_ = dummy_ord;
80 type rew_ord = rew_ord' * rew_ord_;
81 val e_rew_ord = dummy_ord; (* TODO.WN071231 clarify identifiers..e_rew_ordX*)
82 val e_rew_ordX = (e_rew_ord', e_rew_ord_) : rew_ord;
84 (* error patterns and fill patterns *)
85 type errpatID = string
87 errpatID (* one identifier for a list of patterns
88 DESIGN ?TODO: errpatID list for hierarchy of errpats ? *)
89 * term list (* error patterns *)
90 * thm list (* thms related to error patterns; note that respective lhs
91 do not match (which reflects student's error).
92 fillpatterns are stored with these thms. *)
94 (* for (at least) 2 kinds of access:
95 (1) given an errpatID, find the respective fillpats (e.g. in fun find_fill_pats)
96 (2) given a thm, find respective fillpats *)
97 type fillpatID = string
99 fillpatID (* DESIGN ?TODO: give an order w.r.t difficulty ? *)
100 * term (* the pattern with fill-in gaps *)
101 * errpatID; (* which the fillpat would be a help for
102 DESIGN ?TODO: list for several patterns ? *)
105 Erule (*.the empty rule .*)
106 | Thm of (string * Basic_Thm.thm)(*.a theorem, ie (identifier, Thm.thm).*)
107 | Calc of string * (*.sml-code manipulating a (sub)term .*)
108 (string -> term -> theory -> (string * term) option)
109 | Cal1 of string * (*.sml-code applied only to whole term
110 or left/right-hand-side of eqality .*)
111 (string -> term -> theory -> (string * term) option)
112 | Rls_ of rls (*.ie. rule sets may be nested.*)
115 | Prog of term (* for met *)
116 | Rfuns of (* for Rrls, usage see rational.sml ----- reverse rewrite ----- *)
117 {init_state : (* initialise for reverse rewriting by the Interpreter *)
118 term -> (* for this the rrlsstate is initialised: *)
119 term * (* the current formula: goes locate_gen -> next_tac via istate *)
120 term * (* the final formula *)
121 rule list (* of reverse rewrite set (#1#) *)
122 list * (* may be serveral, eg. in norm_rational *)
123 ( rule * (* Thm (+ Thm generated from Calc) resulting in ... *)
124 (term * (* ... rewrite with ... *)
125 term list)) (* ... assumptions *)
126 list, (* derivation from given term to normalform
127 in reverse order with sym_thm;
128 (#1#) could be extracted from here #1 *)
129 normal_form: (* the function which drives the Rrls ##############################*)
130 term -> (term * term list) option,
131 locate_rule: (* checks a rule R for being a cancel-rule, and if it is,
132 then return the list of rules (+ the terms they are rewriting to)
133 which need to be applied before R should be applied.
134 precondition: the rule is applicable to the argument-term. *)
135 rule list list -> (* the reverse rule list *)
136 term -> (* ... to which the rule shall be applied *)
137 rule -> (* ... to be applied to term *)
138 ( rule * (* value: a rule rewriting to ... *)
139 (term * (* ... the resulting term ... *)
140 term list)) (* ... with the assumptions ( //#0) *)
141 list, (* there may be several such rules; the list is empty,
142 if the rule has nothing to do with e.g. cancelation *)
143 next_rule: (* for a given term return the next rules to be done for cancelling *)
144 rule list list->(* the reverse rule list *)
145 term -> (* the term for which ... *)
146 rule option, (* ... this rule is appropriate for cancellation;
147 there may be no such rule (if the term is eg.canceled already*)
148 attach_form: (* checks an input term TI, if it may belong to e.g. a current
149 cancellation, by trying to derive it from the given term TG.
152 term -> (* TG, the last one agreed upon by user + math-eng *)
153 term -> (* TI, the next one input by the user *)
154 ( rule * (* the rule to be applied in order to reach TI *)
155 (term * (* ... obtained by applying the rule ... *)
156 term list)) (* ... and the respective assumptions *)
157 list} (* there may be several such rules; the list is empty, if the
158 users term does not belong to e.g. a cancellation of the term
161 Erls (*for init e_rls*)
163 | Rls of (*a confluent and terminating ruleset, in general *)
164 {id : string, (*for trace_rewrite:=true *)
165 preconds : term list, (*unused WN020820 *)
166 (*WN060616 for efficiency...
167 bdvs : false, (*set in prep_rls' for get_bdvs *)*)
168 rew_ord : rew_ord, (*for rules*)
169 erls : rls, (*for the conditions in rules *)
170 srls : rls, (*for evaluation of list_fns in script *)
171 calc : calc list, (*for Calculate in scr, set by prep_rls' *)
173 errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
174 scr : scr} (*Prog term: generating intermed.steps *)
175 | Seq of (*a sequence of rules to be tried only once *)
176 {id : string, (*for trace_rewrite:=true *)
177 preconds : term list, (*unused 20.8.02 *)
178 (*WN060616 for efficiency...
179 bdvs : false, (*set in prep_rls' for get_bdvs *)*)
180 rew_ord : rew_ord, (*for rules *)
181 erls : rls, (*for the conditions in rules *)
182 srls : rls, (*for evaluation of list_fns in script *)
183 calc : calc list, (*for Calculate in scr, set by prep_rls' *)
185 errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
186 scr : scr} (*Prog term (how to restrict type ???)*)
188 (*Rrls call SML-code and simulate an rls
189 difference: there is always _ONE_ redex rewritten in 1 call,
190 thus wrap Rrls by: Rls (Rls_ ...)*)
191 | Rrls of (* SML-functions within rewriting; step-wise execution provided;
193 difference: there is always _ONE_ redex rewritten in 1 call,
194 thus wrap Rrls by: Rls (Rls_ ...) *)
195 {id : string, (* for trace_rewrite := true *)
196 prepat : (term list *(* preconds, eval with subst from pattern;
197 if [@{term True}], match decides alone *)
198 term ) (* pattern matched with current (sub)term *)
199 list, (* meta-conjunction is or *)
200 rew_ord : rew_ord, (* for rules *)
201 erls : rls, (* for the conditions in rules and preconds *)
202 calc : calc list, (* for Calculate in scr, set automatic.in prep_rls' *)
203 errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
204 scr : scr}; (* Rfuns {...} (how to restrict type ???) *)
206 fun thy2ctxt' thy' = Proof_Context.init_global (Thy_Info.get_theory thy');(*FIXXXME thy-ctxt*)
207 fun thy2ctxt thy = Proof_Context.init_global thy;(*FIXXXME thy-ctxt*)
209 fun Isac _ = Proof_Context.theory_of (thy2ctxt' "Isac"); (*@{theory "Isac"}*)
211 val e_rule = Thm ("refl", @{thm refl});
212 fun id_of_thm (Thm (id, _)) = id
213 | id_of_thm _ = error "error id_of_thm";
214 fun thm_of_thm (Thm (_, thm)) = thm
215 | thm_of_thm _ = error "error thm_of_thm";
216 fun rep_thm_G' (Thm (thmid, thm)) = (thmid, thm);
218 fun thmID_of_derivation_name dn = last_elem (space_explode "." dn);
219 fun thyID_of_derivation_name dn = hd (space_explode "." dn);
221 fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _ : thm)) =
222 (strip_thy thmid1) = (strip_thy thmid2);
223 (*WN120201 weakened*)
224 fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _)) = thmid1 = thmid2;
225 (*version typed weaker WN100910*)
226 fun eq_thmI' ((thmid1, _), (thmid2, _)) =
227 (thmID_of_derivation_name thmid1) = (thmID_of_derivation_name thmid2);
229 val string_of_thm = Thm.get_name_hint; (*FIXME.2009*)
230 fun thm'_of_thm thm =
231 ((thmID_of_derivation_name o Thm.get_name_hint) thm, ""): thm'
233 (*check for [.] as caused by "fun assoc_thm'"*)
234 fun string_of_thmI thm =
235 let val ct' = (de_quote o string_of_thm) thm
236 val (a, b) = split_nlast (5, Symbol.explode ct')
238 [" ", " ","[", ".", "]"] => implode a
242 (*.id requested for all, Rls,Seq,Rrls.*)
243 fun id_rls Erls = "e_rls" (*WN060714 quick and dirty: recursive defs!*)
244 | id_rls (Rls {id,...}) = id
245 | id_rls (Seq {id,...}) = id
246 | id_rls (Rrls {id,...}) = id;
247 val rls2str = id_rls;
248 fun id_rule (Thm (id, _)) = id
249 | id_rule (Calc (id, _)) = id
250 | id_rule (Rls_ rls) = id_rls rls;
252 fun get_rules (Rls {rules,...}) = rules
253 | get_rules (Seq {rules,...}) = rules
254 | get_rules (Rrls _) = [];
256 fun rule2str Erule = "Erule"
257 | rule2str (Thm (str, thm)) = "Thm (\""^str^"\","^(string_of_thmI thm)^")"
258 | rule2str (Calc (str,f)) = "Calc (\""^str^"\",fn)"
259 | rule2str (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
260 | rule2str (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
261 fun rule2str' Erule = "Erule"
262 | rule2str' (Thm (str, thm)) = "Thm (\""^str^"\",\"\")"
263 | rule2str' (Calc (str,f)) = "Calc (\""^str^"\",fn)"
264 | rule2str' (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
265 | rule2str' (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
267 (*WN080102 compare eq_rule ?!?*)
268 fun eqrule (Thm (id1,_), Thm (id2,_)) = id1 = id2
269 | eqrule (Calc (id1,_), Calc (id2,_)) = id1 = id2
270 | eqrule (Cal1 (id1,_), Cal1 (id2,_)) = id1 = id2
271 | eqrule (Rls_ _, Rls_ _) = false (*{id=id1}{id=id2} = id1 = id2 FIXXME*)
274 type rrlsstate = (* state for reverse rewriting, comments see type rule and scr | Rfuns *)
275 (term * term * rule list list * (rule * (term * term list)) list);
277 val e_type = Type("empty",[]);
278 val a_type = TFree("'a",[]);
279 val e_term = Const("empty",e_type);
280 val a_term = Free("empty",a_type);
281 val e_rrlsstate = (e_term,e_term,[[e_rule]],[(e_rule,(e_term,[]))]):rrlsstate;
283 val e_term = Const("empty", Type("'a", []));
284 val e_scr = Prog e_term;
287 there are two kinds of theorems ...
288 (1) known by isabelle
289 (2) not known, eg. calc_thm, instantiated rls
290 the latter have a thmid "#..."
291 and thus outside isa we ALWAYS transport both (thmid,string_of_thmI)
292 and have a special assoc_thm / assoc_rls in this interface *)
293 type theory' = string; (* = domID ^".thy" WN.101011 ABOLISH !*)
294 type domID = string; (* domID ^".thy" = theory' WN.101011 replace by thyID*)
295 type thyID = string; (*WN.3.11.03 TODO: replace domID with thyID*)
297 fun string_of_thy thy = Context.theory_name thy: theory';
298 val theory2domID = string_of_thy;
299 val theory2thyID = (get_thy o string_of_thy) : theory -> thyID;
300 val theory2theory' = string_of_thy;
301 val theory2str = string_of_thy; (*WN050903 ..most consistent naming*)
302 val theory2str' = implode o (drop_last_n 4) o Symbol.explode o string_of_thy;
303 (* fun theory'2theory = fun thyID2thy ... see fun assoc_thy (...Thy_Info.get_theory string);
304 al it = "Isac" : string
307 fun thyID2theory' (thyID:thyID) = thyID;
309 let val ss = Symbol.explode thyID
310 val ext = implode (takelast (4, ss))
311 in if ext = ".thy" then thyID : theory' (*disarm abuse of thyID*)
315 (* thyID2theory' "Isac" (*ok*);
316 val it = "Isac" : theory'
317 > thyID2theory' "Isac" (*abuse, goes ok...*);
318 val it = "Isac" : theory'
321 fun theory'2thyID (theory':theory') = theory';
323 let val ss = Symbol.explode theory'
324 val ext = implode (takelast (4, ss))
325 in if ext = ".thy" then ((implode o (drop_last_n 4)) ss) : thyID
326 else theory' (*disarm abuse of theory'*)
329 (* theory'2thyID "Isac";
330 val it = "Isac" : thyID
331 > theory'2thyID "Isac";
332 val it = "Isac" : thyID*)
335 (*. WN0509 discussion:
336 #############################################################################
337 # How to manage theorys in subproblems wrt. the requirement, #
338 # that scripts should be re-usable ? #
339 #############################################################################
341 eg. 'Script Solve_rat_equation' calls 'SubProblem (RatEq',..'
342 which would not allow to 'solve (y'' = -M_b / EI, M_b)' by this script
343 because Biegelinie.thy is subthy of RatEq.thy and thus Biegelinie.M_b
344 is unknown in RatEq.thy and M_b cannot be parsed into the scripts guard
347 Preliminary solution:
348 # the thy in 'SubProblem (thy', pbl, arglist)' is not taken automatically,
349 # instead the 'maxthy (rootthy pt) thy' is taken for each subpbl
350 # however, a thy specified by the user in the rootpbl may lead to
351 errors in far-off subpbls (which are not yet reported properly !!!)
352 and interactively specifiying thys in subpbl is not very relevant.
354 Other solutions possible:
355 # always parse and type-check with Thy_Info.get_theory "Isac"
356 (rejected tue to the vague idea eg. to re-use equations for R in C etc.)
357 # regard the subthy-relation in specifying thys of subpbls
358 # specifically handle 'SubProblem (undefined, pbl, arglist)'
361 (*WN0509 TODO "ProtoPure" ... would be more consistent
362 with assoc_thy <--> theory2theory' +FIXME assoc_thy "e_domID" -> Script.thy*)
363 val e_domID = "e_domID":domID;
365 (*the key into the hierarchy ob theory elements*)
366 type theID = string list;
367 val e_theID = ["e_theID"];
368 val theID2str = strs2str;
369 (*theID eg. is ["IsacKnowledge", "Test", "Rulesets", "ac_plus_times"]*)
370 fun theID2thyID (theID:theID) =
371 if length theID >= 3 then (last_elem o (drop_last_n 2)) theID : thyID
372 else error ("theID2thyID called with "^ theID2str theID);
374 (*the key into the hierarchy ob problems*)
375 type pblID = string list; (* domID::...*)
376 val e_pblID = ["e_pblID"]:pblID;
377 val pblID2str = strs2str;
379 (*the key into the hierarchy ob methods*)
380 type metID = string list;
381 val e_metID = ["e_metID"]:metID;
382 val metID2str = strs2str;
385 domID * (*WN.12.03: is replaced by thy from get_met ?FIXME? in:
386 specify (Init_Proof..), nxt_specify_init_calc,
387 assod (.SubProblem...), stac2tac (.SubProblem...)*)
391 fun spec2str ((dom,pbl,met)(*:spec*)) =
392 "(" ^ (quote dom) ^ ", " ^ (strs2str pbl) ^
393 ", " ^ (strs2str met) ^ ")";
394 (*> spec2str empty_spec;
395 val it = "(\"\", [], (\"\", \"\"))" : string *)
396 val empty_spec = (e_domID,e_pblID,e_metID):spec;
397 val e_spec = empty_spec;
399 (*.association list with cas-commands, for generating a complete calc-head.*)
401 (term list -> (* the arguments of the cas-command, eg. (x+1=2, x) *)
402 (term * (* description of an element *)
403 term list) (* value of the element (always put into a list) *)
404 list) (* of elements in the formalization *)
406 (term * (* cas-command, eg. 'solve' *)
407 (spec * (* theory, problem, method *)
409 fun cas_eq ((t1, (_, _)) : cas_elem, (t2, (_, _)) : cas_elem) = t1 = t2
411 (*either theID or pblID or metID*)
412 type kestoreID = string list;
413 val e_kestoreID = ["e_kestoreID"];
414 val kestoreID2str = strs2str;
416 (*for distinction of contexts WN130621: disambiguate with Isabelle's Context !*)
417 datatype ketype = Exp_ | Thy_ | Pbl_ | Met_;
418 fun ketype2str Exp_ = "Exp_"
419 | ketype2str Thy_ = "Thy_"
420 | ketype2str Pbl_ = "Pbl_"
421 | ketype2str Met_ = "Met_";
422 fun ketype2str' Exp_ = "Example"
423 | ketype2str' Thy_ = "Theory"
424 | ketype2str' Pbl_ = "Problem"
425 | ketype2str' Met_ = "Method";
427 (*rewrite orders, also stored in 'type met' and type 'and rls'
428 The association list is required for 'rewrite.."rew_ord"..'
429 WN0509 tests not well-organized: see smltest/Knowledge/termorder.sml*)
430 val rew_ord' = Unsynchronized.ref
431 ([]:(rew_ord' * (*the key for the association list *)
432 (subst (*the bound variables - they get high order*)
433 -> (term * term) (*(t1, t2) to be compared *)
434 -> bool)) (*if t1 <= t2 then true else false *)
435 list); (*association list *)
437 rew_ord' := overwritel (!rew_ord', [("e_rew_ord", e_rew_ord),
438 ("dummy_ord", dummy_ord)]);
441 (* A tree for storing data defined in different theories
442 for access from the Interpreter and from dialogue authoring
443 using a string list as key.
444 'a is for pbt | met | thydata; after WN030424 naming became inappropriate *)
446 Ptyp of string * (* element of the key *)
447 'a list * (* several pbts with different domIDs/thy TODO: select by subthy (isaref.p.69)
448 presently only _ONE_ elem FOR ALL KINDS OF CONTENT pbt | met | thydata *)
449 ('a ptyp) list;(* the children nodes *)
451 (*.datatype for collecting thydata for hierarchy.*)
452 (*WN060720 more consistent naming would be 'type thyelem' or 'thelem'*)
453 (*WN0606 Htxt contains html which does not belong to the sml-kernel*)
454 datatype thydata = Html of {guh: guh,
455 coursedesign: authors,
456 mathauthors: authors,
457 html: string} (*html; for demos before database*)
459 coursedesign: authors,
460 mathauthors: authors,
461 fillpats: fillpat list,
464 coursedesign: authors,
465 mathauthors: authors,
466 thy_rls: (thyID * rls)}
468 coursedesign: authors,
469 mathauthors: authors,
472 coursedesign: authors,
473 mathauthors: authors,
474 ord: (subst -> (term * term) -> bool)};
475 val e_thydata = Html {guh="e_guh", coursedesign=[], mathauthors=[], html=""};
476 fun the2str (Html {guh, coursedesign, mathauthors, html}) = guh : string
477 | the2str (Hthm {guh, coursedesign, mathauthors, fillpats, thm}) = guh
478 | the2str (Hrls {guh, coursedesign, mathauthors, thy_rls}) = guh
479 | the2str (Hcal {guh, coursedesign, mathauthors, calc}) = guh
480 | the2str (Hord {guh, coursedesign, mathauthors, ord}) = guh
481 fun thes2str thes = map the2str thes |> list2str;
483 type thehier = (thydata ptyp) list;
484 (* required to determine sequence of main nodes of thehier in KEStore.thy *)
485 fun part2guh ([str]:theID) =
487 "Isabelle" => "thy_isab_" ^ str ^ "-part" : guh
488 | "IsacScripts" => "thy_scri_" ^ str ^ "-part"
489 | "IsacKnowledge" => "thy_isac_" ^ str ^ "-part"
490 | str => error ("thy2guh: called with '"^str^"'"))
491 | part2guh theID = error ("part2guh called with theID = " ^ theID2str theID);
493 fun thy2guh ([part, thyID] : theID) = (case part of
494 "Isabelle" => "thy_isab_" ^ thyID : guh
495 | "IsacScripts" => "thy_scri_" ^ thyID
496 | "IsacKnowledge" => "thy_isac_" ^ thyID
497 | str => error ("thy2guh: called with '" ^ str ^ "'"))
498 | thy2guh theID = error ("thy2guh called with '" ^ strs2str' theID ^ "'");
500 fun thypart2guh ([part, thyID, thypart] : theID) = case part of
501 "Isabelle" => "thy_isab_" ^ thyID ^ "-" ^ thypart : guh
502 | "IsacScripts" => "thy_scri_" ^ thyID ^ "-" ^ thypart
503 | "IsacKnowledge" => "thy_isac_" ^ thyID ^ "-" ^ thypart
504 | str => error ("thypart2guh: called with '" ^ str ^ "'");
506 (* convert the data got via contextToThy to a globally unique handle
507 there is another way to get the guh out of the 'theID' in the hierarchy *)
508 fun thm2guh (isa, thyID:thyID) (thmID:thmID) = case isa of
509 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID : guh
510 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID
511 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID
512 | str => error ("thm2guh called with isa = '" ^ isa ^ "' for thm = " ^ thmID ^ "'");
514 fun rls2guh (isa, thyID:thyID) (rls':rls') = case isa of
515 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-rls-" ^ rls' : guh
516 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-rls-" ^ rls'
517 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-rls-" ^ rls'
518 | str => error ("rls2guh called with isa = '" ^ isa ^ "' for rls = '" ^ rls' ^ "'");
520 fun cal2guh (isa, thyID:thyID) calID = case isa of
521 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-cal-" ^ calID : guh
522 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-cal-" ^ calID
523 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-cal-" ^ calID
524 | str => error ("cal2guh called with isa = '" ^ isa ^ "' for cal = '" ^ calID ^ "'");
526 fun ord2guh (isa, thyID:thyID) (rew_ord':rew_ord') = case isa of
527 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord' : guh
528 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord'
529 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord'
530 | str => error ("ord2guh called with isa = '" ^ isa ^ "' for ord = '" ^ rew_ord' ^ "'");
532 (* not only for thydata, but also for thy's etc *)
533 fun theID2guh (theID : theID) = case length theID of
534 0 => error ("theID2guh: called with theID = " ^ strs2str' theID)
535 | 1 => part2guh theID
537 | 3 => thypart2guh theID
539 let val [isa, thyID, typ, elemID] = theID
541 "Theorems" => thm2guh (isa, thyID) elemID
542 | "Rulesets" => rls2guh (isa, thyID) elemID
543 | "Calculations" => cal2guh (isa, thyID) elemID
544 | "Orders" => ord2guh (isa, thyID) elemID
545 | "Theorems" => thy2guh [isa, thyID]
546 | str => error ("theID2guh: called with theID = " ^ strs2str' theID)
548 | n => error ("theID2guh called with theID = " ^ strs2str' theID);
551 type filename = string;
553 (*val xxx = fn: a b => (a,b); ??? fun-definition ???*)
555 fun ii (_:term) = e_rrlsstate;
556 fun no (_:term) = SOME (e_term,[e_term]);
557 fun lo (_:rule list list) (_:term) (_:rule) = [(e_rule,(e_term,[e_term]))];
558 fun ne (_:rule list list) (_:term) = SOME e_rule;
559 fun fo (_:rule list list) (_:term) (_:term) = [(e_rule,(e_term,[e_term]))];
561 val e_rfuns = Rfuns {init_state=ii,normal_form=no,locate_rule=lo,
562 next_rule=ne,attach_form=fo};
566 Rls {id = "e_rls", preconds = [], rew_ord = ("dummy_ord", dummy_ord), erls = Erls,
567 srls = Erls, calc = [], rules = [], errpatts = [], scr = EmptyScr}: rls;
569 Rrls {id = "e_rrls", prepat = [], rew_ord = ("dummy_ord", dummy_ord), erls = Erls,
570 calc = [], errpatts = [], scr=e_rfuns}:rls;
572 fun rep_rls (Rls {id,preconds,rew_ord,erls,srls,calc,errpatts,rules,scr}) =
573 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
574 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
575 | rep_rls (Seq {id,preconds,rew_ord,erls,srls,calc,errpatts,rules,scr}) =
576 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
577 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
578 | rep_rls Erls = rep_rls e_rls
579 | rep_rls (Rrls {id,...}) = rep_rls e_rls
580 (*error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id)*);
581 (*| rep_rls (Seq {id,...}) =
582 error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id);
584 fun rep_rrls (Rrls {id, calc, erls, prepat, rew_ord, errpatts,
585 scr = Rfuns {attach_form, init_state, locate_rule, next_rule, normal_form}}) =
586 {id=id, calc=calc, erls=erls, prepat=prepat,
587 rew_ord=rew_ord, errpatts=errpatts, attach_form=attach_form, init_state=init_state,
588 locate_rule=locate_rule, next_rule=next_rule, normal_form=normal_form}
589 | rep_rrls (Rls {id,...}) =
590 error ("rep_rrls doesn't take apart (normal) rule-sets: "^id)
591 | rep_rrls (Seq {id,...}) =
592 error ("rep_rrls doesn't take apart (normal) rule-sets: "^id);
594 fun append_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
595 rules =rs, errpatts=errpatts, scr=sc}) r =
596 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
597 rules = rs @ r, errpatts=errpatts, scr=sc}:rls)
598 | append_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
599 rules =rs, errpatts=errpatts, scr=sc}) r =
600 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
601 rules = rs @ r, errpatts=errpatts, scr=sc}:rls)
602 | append_rls id (Rrls _) _ =
603 error ("append_rls: not for reverse-rewrite-rule-set "^id);
605 (*. are _atomic_ rules equal ?.*)
606 (*WN080102 compare eqrule ?!?*)
607 fun eq_rule (Thm (thm1,_), Thm (thm2,_)) = thm1 = thm2
608 | eq_rule (Calc (id1,_), Calc (id2,_)) = id1 = id2
609 | eq_rule (Rls_ rls1, Rls_ rls2) = id_rls rls1 = id_rls rls2
610 (*id_rls checks for Rls, Seq, Rrls*)
613 fun merge_ids rls1 rls2 =
615 val id1 = (#id o rep_rls) rls1
616 val id2 = (#id o rep_rls) rls2
618 if id1 = id2 then id1
619 else "merged_" ^ id1 ^ "_" ^ id2
621 fun merge_rls _ Erls rls = rls
622 | merge_rls _ rls Erls = rls
623 | merge_rls _ (Rrls x) _ = Rrls x (* required for merging Theory_Data *)
624 | merge_rls _ _ (Rrls x) = Rrls x
626 (Rls {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
627 rules = rs1, errpatts = eps1, scr = sc1, ...})
628 (Rls {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
629 rules = rs2, errpatts = eps2, ...})
631 (Rls {id = id, rew_ord = ro1, scr = sc1,
632 preconds = union (op =) pc1 pc2,
633 erls = merge_rls (merge_ids er1 er2) er1 er2,
634 srls = merge_rls (merge_ids sr1 sr2) sr1 sr2,
635 calc = union calc_eq ca1 ca2,
636 rules = union eq_rule rs1 rs2,
637 errpatts = union (op =) eps1 eps2} : rls)
639 (Seq {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
640 rules = rs1, errpatts = eps1, scr = sc1, ...})
641 (Seq {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
642 rules = rs2, errpatts = eps2, ...})
644 (Seq {id = id, rew_ord = ro1, scr = sc1,
645 preconds = union (op =) pc1 pc2,
646 erls = merge_rls (merge_ids er1 er2) er1 er2,
647 srls = merge_rls (merge_ids sr1 sr2) sr1 sr2,
648 calc = union calc_eq ca1 ca2,
649 rules = union eq_rule rs1 rs2,
650 errpatts = union (op =) eps1 eps2} : rls)
651 | merge_rls id _ _ = error ("merge_rls: \"" ^ id ^
652 "\"; not for reverse-rewrite-rule-sets and not for mixed Rls -- Seq");
654 fun remove_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
655 rules=rs, errpatts=eps, scr=sc}) r =
656 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
657 rules = gen_rems eq_rule (rs, r),
658 errpatts = eps(*gen_rems op= (eps, TODO)*),
660 | remove_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
661 rules =rs, errpatts=eps, scr=sc}) r =
662 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
663 rules = gen_rems eq_rule (rs, r),
664 errpatts = eps(*gen_rems op= (eps, TODO)*),
666 | remove_rls id (Rrls _) _ = error
667 ("remove_rls: not for reverse-rewrite-rule-set "^id);
669 (* datastructure for KEStore_Elems, intermediate for thehier *)
671 (rls' * (* identifier unique within Isac *)
672 (theory' * (* just for assignment in thehier, not appropriate for parsing etc *)
673 rls)) (* ((#id o rep_rls) rls) = rls' by coding discipline *)
674 fun rls_eq ((id1, (_, _)), (id2, (_, _))) = id1 = id2
676 fun insert_merge_rls (re as (id, (thyID, r1)) : rlss_elem) ys =
677 case get_index (fn y => if curry rls_eq re y then SOME y else NONE) ys of
679 | SOME (i, (_, (_, r2))) =>
681 val r12 = merge_rls id r1 r2
682 in list_update ys i (id, (thyID, r12)) end
684 fun merge_rlss (s1, s2) = fold insert_merge_rls s1 s2;
687 fun memrls r (Rls {rules,...}) = gen_mem eqrule (r, rules)
688 | memrls r (Seq {rules,...}) = gen_mem eqrule (r, rules)
689 | memrls r _ = error ("memrls: incomplete impl. r= "^(rule2str r));
691 fun assoc' ([], key) = error ("ME_Isa: '"^key^"' not known")
692 | assoc' ((keyi, xi) :: pairs, key) =
693 if key = keyi then SOME xi else assoc' (pairs, key);
695 fun assoc_thy (thy:theory') =
696 if thy = "e_domID" then (Thy_Info.get_theory "Script") (*lower bound of Knowledge*)
697 else (Thy_Info.get_theory thy)
698 handle _ => error ("ME_Isa: thy '" ^ thy ^ "' not in system");
700 (*.overwrite an element in an association list and pair it with a thyID
701 in order to create the thy_hierarchy;
702 overwrites existing rls' even if they are defined in a different thy;
703 this is related to assoc_rls, TODO.WN060120: assoc_rew_ord, assoc_calc;.*)
704 (*WN060120 ...these are NOT compatible to "fun assoc_thm'" in that
705 they do NOT handle overlays by re-using an identifier in different thys;
706 "thyID.rlsID" would be a good solution, if the "." would be possible
708 actually a hack to get alltogether run again with minimal effort*)
709 fun insthy thy' (rls', rls) = (rls', (thy', rls));
710 fun overwritelthy thy (al, bl:(rls' * rls) list) =
711 let val bl' = map (insthy ((get_thy o theory2theory') thy)) bl
712 in overwritel (al, bl') end;
714 fun assoc_rew_ord ro = ((the o assoc') (!rew_ord',ro))
715 handle _ => error ("ME_Isa: rew_ord '"^ro^"' not in system");
716 (*get the string for stac from rule*)
718 fun term_to_string' ctxt t =
720 val ctxt' = Config.put show_markup false ctxt
721 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
722 fun term_to_string'' (thyID : thyID) t =
724 val ctxt' = Config.put show_markup false (Proof_Context.init_global (Thy_Info.get_theory thyID))
725 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
726 fun term_to_string''' thy t =
728 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
729 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
731 fun term2str t = term_to_string' (assoc_thy "Isac" |> thy2ctxt) t;
732 fun terms2strs ts = map term2str ts;
733 (*terms2strs [t1,t2] = ["1 + 2", "abc"];*)
734 val terms2str = strs2str o terms2strs;
735 (*terms2str [t1,t2] = "[\"1 + 2\",\"abc\"]";*)
736 val terms2str' = strs2str' o terms2strs;
737 (*terms2str' [t1,t2] = "[1 + 2,abc]";*)
739 fun termopt2str (SOME t) = "(SOME " ^ term2str t ^ ")"
740 | termopt2str NONE = "NONE";
742 fun type_to_string' ctxt t =
744 val ctxt' = Config.put show_markup false ctxt
745 in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
746 fun type_to_string'' (thyID : thyID) t =
748 val ctxt' = Config.put show_markup false (Proof_Context.init_global (Thy_Info.get_theory thyID))
749 in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
750 fun type_to_string''' thy t =
752 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
753 in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
755 fun type2str typ = type_to_string'' "Isac" typ; (*legacy*)
756 val string_of_typ = type2str; (*legacy*)
757 fun string_of_typ_thy thy typ = type_to_string'' thy typ; (*legacy*)
759 fun subst2str (s:subst) =
761 (map (linefeed o pair2str o
763 (apfst term2str)))) s;
764 fun subst2str' (s:subst) =
768 (apfst term2str)))) s;
769 (*> subst2str' [(str2term "bdv", str2term "x"),
770 (str2term "bdv_2", str2term "y")];
771 val it = "[(bdv, x)]" : string
773 val env2str = subst2str;
777 fun scr2str (Prog s) = "Prog " ^ term2str s
778 | scr2str (Rfuns _) = "Rfuns";
781 fun maxthy thy1 thy2 = if Theory.subthy (thy1, thy2) then thy2 else thy1;
784 (*.trace internal steps of isac's rewriter*)
785 val trace_rewrite = Unsynchronized.ref false;
786 (*.depth of recursion in traces of the rewriter, if trace_rewrite:=true.*)
787 val depth = Unsynchronized.ref 99999;
788 (*.no of rewrites exceeding this int -> NO rewrite.*)
789 (*WN060829 still unused...*)
790 val lim_rewrite = Unsynchronized.ref 99999;
791 (*.no of derivation-elements exceeding this int -> SOME derivation-elements.*)
792 val lim_deriv = Unsynchronized.ref 100;
793 (*.switch for checking guhs unique before storing a pbl or met;
794 set true at startup (done at begin of ROOT.ML)
795 set false for editing IsacKnowledge (done at end of ROOT.ML).*)
796 val check_guhs_unique = Unsynchronized.ref true;
799 datatype lrd = (*elements of a path (=loc_) into an Isabelle term*)
801 | R (*go right at $*)
802 | D; (*go down at Abs*)
803 type loc_ = lrd list;
807 fun loc_2str (k:loc_) = (strs2str' o (map ldr2str)) k;
810 (* the pattern for an item of a problems model or a methods guard *)
812 (string * (* field *)
813 (term * (* description *)
814 term)) (* id | arbitrary term *);
815 fun pat2str ((field, (dsc, id)) : pat) =
816 pair2str (field, pair2str (term2str dsc, term2str id))
817 fun pats2str pats = (strs2str o (map pat2str)) pats
819 (* types for problems models (TODO rename to specification models) *)
821 (string * (* field "#Given",..*)(*deprecated due to 'type pat'*)
822 (term * (* description *)
823 term)); (* id | struct-var *)
824 val e_pbt_ = ("#Undef", (e_term, e_term)) : pbt_
826 {guh : guh, (* unique within this isac-knowledge *)
827 mathauthors : string list, (* copyright *)
828 init : pblID, (* to start refinement with *)
829 thy : theory, (* which allows to compile that pbt
830 TODO: search generalized for subthy (ref.p.69*)
831 (*^^^ WN050912 NOT used during application of the problem,
832 because applied terms may be from 'subthy' as well as from super;
833 thus we take 'maxthy'; see match_ags !*)
834 cas : term option, (* 'CAS-command'*)
835 prls : rls, (* for preds in where_*)
836 where_ : term list, (* where - predicates*)
837 ppc : pat list, (* this is the model-pattern;
838 it contains "#Given","#Where","#Find","#Relate"-patterns
839 for constraints on identifiers see "fun cpy_nam" *)
840 met : metID list} (* methods solving the pbt*)
842 val e_pbt = {guh = "pbl_empty", mathauthors = [], init = e_pblID, thy = Thy_Info.get_theory "Pure",
843 cas = NONE, prls = Erls, where_ = [], ppc = [], met = []} : pbt
845 ({cas = cas', guh = guh', init = init', mathauthors = ma', met = met', ppc = ppc',
846 prls = prls', thy = thy', where_ = w'} : pbt) =
847 "{cas = " ^ (termopt2str cas') ^ ", guh = \"" ^ guh' ^ "\", init = "
848 ^ (strs2str init') ^ ", mathauthors = " ^ (strs2str ma' |> quote) ^ ", met = "
849 ^ (strslist2strs met') ^ ", ppc = " ^ pats2str ppc' ^ ", prls = "
850 ^ (rls2str prls' |> quote) ^ ", thy = {" ^ (theory2str thy') ^ "}, where_ = "
851 ^ (terms2str w') ^ "}" |> linefeed;
852 fun pbts2str pbts = map pbt2str pbts |> list2str;
854 val e_Ptyp = Ptyp ("e_pblID",[e_pbt],[])
855 type ptyps = (pbt ptyp) list
857 fun coll_pblguhs pbls =
858 let fun node coll (Ptyp (_,[n],ns)) =
859 [(#guh : pbt -> guh) n] @ (nodes coll ns)
860 and nodes coll [] = coll
861 | nodes coll (n::ns) = (node coll n) @ (nodes coll ns);
862 in nodes [] pbls end;
863 fun check_pblguh_unique (guh:guh) (pbls: (pbt ptyp) list) =
864 if member op = (coll_pblguhs pbls) guh
865 then error ("check_guh_unique failed with '"^guh^"';\n"^
866 "use 'sort_pblguhs()' for a list of guhs;\n"^
867 "consider setting 'check_guhs_unique := false'")
870 fun insrt _ pbt [k] [] = [Ptyp (k, [pbt], [])]
871 | insrt d pbt [k] ((Ptyp (k', [p], ps)) :: pys) =
872 ((*writeln ("### insert 1: ks = " ^ strs2str [k] ^ " k'= " ^ k');*)
874 then ((Ptyp (k', [pbt], ps)) :: pys)
875 else ((Ptyp (k', [p], ps)) :: (insrt d pbt [k] pys))
877 | insrt d pbt (k::ks) ((Ptyp (k', [p], ps))::pys) =
878 ((*writeln ("### insert 2: ks = "^(strs2str (k::ks))^" k'= "^k');*)
880 then ((Ptyp (k', [p], insrt d pbt ks ps)) :: pys)
883 then error ("insert: not found " ^ (strs2str (d : pblID)))
884 else ((Ptyp (k', [p], ps)) :: (insrt d pbt (k :: ks) pys))
887 fun update_ptyps ID _ _ [] =
888 error ("update_ptyps: " ^ strs2str' ID ^ " does not exist")
889 | update_ptyps ID [i] data ((py as Ptyp (key, _, pys)) :: pyss) =
893 then ((Ptyp (key, [data], [])) :: pyss)
894 else error ("update_ptyps: " ^ strs2str' ID ^ " has descendants")
895 else py :: update_ptyps ID [i] data pyss
896 | update_ptyps ID (i :: is) data ((py as Ptyp (key, d, pys)) :: pyss) =
898 then ((Ptyp (key, d, update_ptyps ID is data pys)) :: pyss)
899 else (py :: (update_ptyps ID (i :: is) data pyss))
901 (* this function only works wrt. the way Isabelle evaluates Theories and is not a general merge
902 function for trees / ptyps *)
903 fun merge_ptyps ([], pt) = pt
904 | merge_ptyps (pt, []) = pt
905 | merge_ptyps ((x' as Ptyp (k, x, ps)) :: xs, (xs' as Ptyp (k', y, ps') :: ys)) =
907 then Ptyp (k, y, merge_ptyps (ps, ps')) :: merge_ptyps (xs, ys)
908 else x' :: merge_ptyps (xs, xs');
909 fun merge_ptyps' pt1 pt2 = merge_ptyps (pt1, pt2)
911 (* data for methods stored in 'methods'-database*)
913 {guh : guh, (*unique within this isac-knowledge *)
914 mathauthors: string list,(*copyright *)
915 init : pblID, (*WN060721 introduced mistakenly--TODO.REMOVE!*)
916 rew_ord' : rew_ord', (*for rules in Detail
917 TODO.WN0509 store fun itself, see 'type pbt'*)
918 erls : rls, (*the eval_rls for cond. in rules FIXME "rls'
919 instead erls in "fun prep_met" *)
920 srls : rls, (*for evaluating list expressions in scr *)
921 prls : rls, (*for evaluating predicates in modelpattern *)
922 crls : rls, (*for check_elementwise, ie. formulae in calc.*)
923 nrls : rls, (*canonical simplifier specific for this met *)
924 errpats : errpat list,(*error patterns expected in this method *)
925 calc : calc list, (*Theory_Data in fun prep_met *)
926 (*branch : TransitiveB set in append_problem at generation ob pblobj
927 FIXXXME.0308: set branch from met in Apply_Method ? *)
928 ppc : pat list, (*.items in given, find, relate;
929 items (in "#Find") which need not occur in the arg-list of a SubProblem
930 are 'copy-named' with an identifier "*'.'".
931 copy-named items are 'generating' if they are NOT "*'''" ?WN120516??
932 see ME/calchead.sml 'fun is_copy_named'. *)
933 pre : term list, (*preconditions in where *)
934 scr : scr (*prep_met gets progam or string "empty_script"*)
936 val e_met = {guh="met_empty",mathauthors=[],init=e_metID,
937 rew_ord' = "e_rew_ord'": rew_ord',
938 erls = e_rls, srls = e_rls, prls = e_rls,
939 calc = [], crls = e_rls, errpats = [], nrls= e_rls,
940 ppc = []: (string * (term * term)) list,
942 scr = EmptyScr: scr}:met;
945 val e_Mets = Ptyp ("e_metID",[e_met],[]);
947 type mets = (met ptyp) list;
949 fun coll_metguhs mets =
950 let fun node coll (Ptyp (_,[n],ns)) =
951 [(#guh : met -> guh) n] @ (nodes coll ns)
952 and nodes coll [] = coll
953 | nodes coll (n::ns) = (node coll n) @ (nodes coll ns);
954 in nodes [] mets end;
956 fun check_metguh_unique (guh:guh) (mets: (met ptyp) list) =
957 if member op = (coll_metguhs mets) guh
958 then error ("check_guh_unique failed with '"^guh^"';\n"^
959 "use 'sort_metguhs()' for a list of guhs;\n"^
960 "consider setting 'check_guhs_unique := false'")
963 fun Html_default exist = (Html {guh = theID2guh exist,
964 coursedesign = ["isac team 2006"], mathauthors = [], html = ""})
966 fun fill_parents (exist, [i]) thydata = Ptyp (i, [thydata], [])
967 | fill_parents (exist, i :: is) thydata =
968 Ptyp (i, [Html_default (exist @ [i])], [fill_parents (exist @ [i], is) thydata])
969 | fill_parents _ _ = error "Html_default: avoid ML warning: Matches are not exhaustive"
971 fun add_thydata (exist, is) thydata [] = [fill_parents (exist, is) thydata]
972 | add_thydata (exist, [i]) data (pys as (py as Ptyp (key, _, _)) :: pyss) =
974 then pys (* preserve existing thydata *)
975 else py :: add_thydata (exist, [i]) data pyss
976 | add_thydata (exist, iss as (i :: is)) data ((py as Ptyp (key, d, pys)) :: pyss) =
980 then Ptyp (key, d, [fill_parents (exist @ [i], is) data]) :: pyss
981 else Ptyp (key, d, add_thydata (exist @ [i], is) data pys) :: pyss
982 else py :: add_thydata (exist, iss) data pyss
983 | add_thydata _ _ _ = error "add_thydata: avoid ML warning: Matches are not exhaustive"
985 fun update_hthm (Hthm {guh, coursedesign, mathauthors, thm, ...}) fillpats' =
986 Hthm {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,
987 fillpats = fillpats', thm = thm}
988 | update_hthm _ _ = raise ERROR "wrong data";
990 (* for interface for dialog-authoring *)
991 fun update_hrls (Hrls {guh, coursedesign, mathauthors, thy_rls = (thyID, rls)}) errpatIDs =
995 Rls {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...} =>
996 Rls {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,
997 calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}
998 | Seq {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...} =>
999 Seq {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,
1000 calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}
1001 | Rrls {id, prepat, rew_ord, erls, calc, scr, ...} =>
1002 Rrls {id = id, prepat = prepat, rew_ord = rew_ord, erls = erls, calc = calc,
1003 scr = scr, errpatts = errpatIDs}
1006 Hrls {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,
1007 thy_rls = (thyID, rls')}
1009 | update_hrls _ _ = raise ERROR "wrong data";
1011 fun app_py p f (d:pblID) (k(*:pblRD*)) = let
1013 error ("app_py: not found: " ^ (strs2str d));
1014 fun app_py' _ [] = py_err ()
1015 | app_py' [] _ = py_err ()
1016 | app_py' [k0] ((p' as Ptyp (k', _, _ ))::ps) =
1017 if k0 = k' then f p' else app_py' [k0] ps
1018 | app_py' (k' as (k0::ks)) (Ptyp (k'', _, ps)::ps') =
1019 if k0 = k'' then app_py' ks ps else app_py' k' ps';
1023 fun extract_py (Ptyp (_, [py], _)) = py
1024 | extract_py _ = error ("extract_py: Ptyp has wrong format.");
1025 in app_py p extract_py end;
1027 fun (*KEStore_Elems.*)insert_fillpats th fis = (* for tests bypassing setup KEStore_Elems *)
1029 fun update_elem th (theID, fillpats) =
1031 val hthm = get_py th theID theID
1032 val hthm' = update_hthm hthm fillpats
1033 handle ERROR _ => error ("insert_fillpats: " ^ strs2str theID ^ "must address a theorem")
1034 in update_ptyps theID theID hthm' end
1035 in fold (update_elem th) fis end
1037 (* group the theories defined in Isac, compare Build_Thydata:
1038 section "Get and group the theories defined in Isac" *)
1039 fun isabthys () = (*["Complex_Main", "Taylor", .., "Pure"]*)
1041 val allthys = Theory.ancestors_of (Thy_Info.get_theory "Build_Thydata")
1043 drop ((find_index (curry Theory.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys), allthys)
1045 fun knowthys () = (*["Isac", .., "Descript", "Delete"]*)
1047 fun isacthys () = (* ["Isac", .., "KEStore"] without Build_Isac thys: "Interpret" etc *)
1049 val allthys = filter_out (member Theory.eq_thy
1050 [(*Thy_Info.get_theory "ProgLang",*) Thy_Info.get_theory "Interpret",
1051 Thy_Info.get_theory "xmlsrc", Thy_Info.get_theory "Frontend"])
1052 (Theory.ancestors_of (Thy_Info.get_theory "Build_Thydata"))
1054 take ((find_index (curry Theory.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys),
1057 val isacthys' = isacthys ()
1058 val proglang_parent = Thy_Info.get_theory "ProgLang"
1060 take ((find_index (curry Theory.eq_thy proglang_parent) isacthys'), isacthys')
1062 fun progthys () = (*["Isac", .., "Descript", "Delete"]*)
1064 fun isacthys () = (* ["Isac", .., "KEStore"] without Build_Isac thys: "Interpret" etc *)
1066 val allthys = filter_out (member Theory.eq_thy
1067 [(*Thy_Info.get_theory "ProgLang",*) Thy_Info.get_theory "Interpret",
1068 Thy_Info.get_theory "xmlsrc", Thy_Info.get_theory "Frontend"])
1069 (Theory.ancestors_of (Thy_Info.get_theory "Build_Thydata"))
1071 take ((find_index (curry Theory.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys),
1074 val isacthys' = isacthys ()
1075 val proglang_parent = Thy_Info.get_theory "ProgLang"
1077 drop ((find_index (curry Theory.eq_thy proglang_parent) isacthys') + 1(*ProgLang*), isacthys')
1081 if member Theory.eq_thy (knowthys ()) thy then "IsacKnowledge"
1082 else if member Theory.eq_thy (progthys ()) thy then "IsacScripts"
1083 else if member Theory.eq_thy (isabthys ()) thy then "Isabelle"
1084 else error ("closure of thys in Isac is broken by " ^ string_of_thy thy)
1085 fun partID' (thy' : theory') = partID (Thy_Info.get_theory thy')