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'";
22 Thm (string, thm): (a) needs string to identify sym_thmID for handling in front-end;
23 (b) investigate if ""RS sym" attaches a [.]" still occurs: string_of_thmI
24 thmID : type for data from user input + program
25 thmDeriv : type for thy_hierarchy ONLY
26 obsolete types : thm' (SEE "ad thm'"), thm''.
27 revise funs : id_of_thm, thm_of_thm, rep_thm_G', eq_thmI, eq_thmI', thm'_of_thm thm.
28 activate : thmID_of_derivation_name'
30 type thmID = string; (* identifier for a thm (the shortest possible identifier) *)
31 type thmDeriv = string; (* WN120524 deprecated
32 thyID ^"."^ xxx ^"."^ thmID, see fun thmID_of_derivation_name
33 WN120524: dont use Thm.derivation_name, this is destroyed by num_str;
34 Thm.get_name_hint survives num_str and seems perfectly reliable *)
36 type thm' = thmID * cterm';(*WN060610 deprecated in favour of thm''*)
37 type thm'' = thmID * term;
40 (*.a 'guh'='globally unique handle' is a string unique for each element
41 of isac's KEStore and persistent over time
42 (in particular under shifts within the respective hierarchy);
44 # guh NOT resistant agains shifts from one thy to another
45 (which is the price for Isabelle's design: thy's overwrite ids of subthy's)
46 # requirement for matchTheory: induce guh from tac + current thy
47 (see 'fun thy_containing_thm', 'fun thy_containing_rls' etc.)
48 TODO: introduce to pbl, met.*)
50 val e_guh = "e_guh":guh;
52 type xml = string; (* rm together with old code replaced by XML.tree *)
53 fun string_to_bool "true" = true
54 | string_to_bool "false" = false
55 | string_to_bool str = error ("string_to_bool: arg = " ^ str)
57 (* eval function calling sml code during rewriting.
58 Unifying "type cal" and "type calc" would make Lucas-Interpretation more efficient,
59 see "fun rule2stac": instead of
60 Calc: calID * eval_fn -> rule
62 Calc: prog_calcID * (calID * eval_fn)) -> rule*)
63 type eval_fn = (string -> term -> theory -> (string * term) option);
64 fun e_evalfn (_:'a) (_:term) (_:theory) = NONE:(string * term) option;
65 (*. op in isa-term 'Const(op,_)' .*)
69 type cal = (calID * eval_fn);
70 (*. fun calculate_ fetches the evaluation-function via this list. *)
71 type prog_calcID = string;
72 type calc = (prog_calcID * cal);
74 prog_calcID * (* a simple identifier used in programs *)
75 (calID * (* a long identifier used in Const *)
76 eval_fn) (* an ML function *)
77 fun calc_eq ((pi1, (ci1, _)) : calc_elem, (pi2, (ci2, _)) : calc_elem) =
79 then if ci1 = ci2 then true else error ("calc_eq: " ^ ci1 ^ " <> " ^ ci2)
83 type subs' = (cterm' * cterm') list; (*16.11.00 for FE-KE*)
84 type subst = (term * term) list; (*here for ets2str*)
85 val e_subst = []:(term * term) list;
87 (*TODO.WN060610 make use of "type rew_ord" total*)
88 type rew_ord' = string;
89 val e_rew_ord' = "e_rew_ord" : rew_ord';
90 type rew_ord_ = subst -> Term.term * Term.term -> bool;
91 fun dummy_ord (_:subst) (_:term,_:term) = true;
92 val e_rew_ord_ = dummy_ord;
93 type rew_ord = rew_ord' * rew_ord_;
94 val e_rew_ord = dummy_ord; (* TODO.WN071231 clarify identifiers..e_rew_ordX*)
95 val e_rew_ordX = (e_rew_ord', e_rew_ord_) : rew_ord;
97 (* error patterns and fill patterns *)
98 type errpatID = string
100 errpatID (* one identifier for a list of patterns
101 DESIGN ?TODO: errpatID list for hierarchy of errpats ? *)
102 * term list (* error patterns *)
103 * thm list (* thms related to error patterns; note that respective lhs
104 do not match (which reflects student's error).
105 fillpatterns are stored with these thms. *)
107 (* for (at least) 2 kinds of access:
108 (1) given an errpatID, find the respective fillpats (e.g. in fun find_fill_pats)
109 (2) given a thm, find respective fillpats *)
110 type fillpatID = string
112 fillpatID (* DESIGN ?TODO: give an order w.r.t difficulty ? *)
113 * term (* the pattern with fill-in gaps *)
114 * errpatID; (* which the fillpat would be a help for
115 DESIGN ?TODO: list for several patterns ? *)
118 Erule (*.the empty rule .*)
119 | Thm of (string * Basic_Thm.thm) (* see TODO CLEANUP Thm *)
120 | Calc of string * (*.sml-code manipulating a (sub)term .*)
122 | Cal1 of string * (*.sml-code applied only to whole term
123 or left/right-hand-side of eqality .*)
125 | Rls_ of rls (*.ie. rule sets may be nested.*)
128 | Prog of term (* for met *)
129 | Rfuns of (* for Rrls, usage see rational.sml ----- reverse rewrite ----- *)
130 {init_state : (* initialise for reverse rewriting by the Interpreter *)
131 term -> (* for this the rrlsstate is initialised: *)
132 term * (* the current formula: goes locate_gen -> next_tac via istate *)
133 term * (* the final formula *)
134 rule list (* of reverse rewrite set (#1#) *)
135 list * (* may be serveral, eg. in norm_rational *)
136 ( rule * (* Thm (+ Thm generated from Calc) resulting in ... *)
137 (term * (* ... rewrite with ... *)
138 term list)) (* ... assumptions *)
139 list, (* derivation from given term to normalform
140 in reverse order with sym_thm;
141 (#1#) could be extracted from here #1 *)
142 normal_form: (* the function which drives the Rrls ##############################*)
143 term -> (term * term list) option,
144 locate_rule: (* checks a rule R for being a cancel-rule, and if it is,
145 then return the list of rules (+ the terms they are rewriting to)
146 which need to be applied before R should be applied.
147 precondition: the rule is applicable to the argument-term. *)
148 rule list list -> (* the reverse rule list *)
149 term -> (* ... to which the rule shall be applied *)
150 rule -> (* ... to be applied to term *)
151 ( rule * (* value: a rule rewriting to ... *)
152 (term * (* ... the resulting term ... *)
153 term list)) (* ... with the assumptions ( //#0) *)
154 list, (* there may be several such rules; the list is empty,
155 if the rule has nothing to do with e.g. cancelation *)
156 next_rule: (* for a given term return the next rules to be done for cancelling *)
157 rule list list->(* the reverse rule list *)
158 term -> (* the term for which ... *)
159 rule option, (* ... this rule is appropriate for cancellation;
160 there may be no such rule (if the term is eg.canceled already*)
161 attach_form: (* checks an input term TI, if it may belong to e.g. a current
162 cancellation, by trying to derive it from the given term TG.
165 term -> (* TG, the last one agreed upon by user + math-eng *)
166 term -> (* TI, the next one input by the user *)
167 ( rule * (* the rule to be applied in order to reach TI *)
168 (term * (* ... obtained by applying the rule ... *)
169 term list)) (* ... and the respective assumptions *)
170 list} (* there may be several such rules; the list is empty, if the
171 users term does not belong to e.g. a cancellation of the term
174 Erls (*for init e_rls*)
176 | Rls of (*a confluent and terminating ruleset, in general *)
177 {id : string, (*for trace_rewrite:=true *)
178 preconds : term list, (*unused WN020820 *)
179 (*WN060616 for efficiency...
180 bdvs : false, (*set in prep_rls' for get_bdvs *)*)
181 rew_ord : rew_ord, (*for rules*)
182 erls : rls, (*for the conditions in rules *)
183 srls : rls, (*for evaluation of list_fns in script *)
184 calc : calc list, (*for Calculate in scr, set by prep_rls' *)
186 errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
187 scr : scr} (*Prog term: generating intermed.steps *)
188 | Seq of (*a sequence of rules to be tried only once *)
189 {id : string, (*for trace_rewrite:=true *)
190 preconds : term list, (*unused 20.8.02 *)
191 (*WN060616 for efficiency...
192 bdvs : false, (*set in prep_rls' for get_bdvs *)*)
193 rew_ord : rew_ord, (*for rules *)
194 erls : rls, (*for the conditions in rules *)
195 srls : rls, (*for evaluation of list_fns in script *)
196 calc : calc list, (*for Calculate in scr, set by prep_rls' *)
198 errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
199 scr : scr} (*Prog term (how to restrict type ???)*)
201 (*Rrls call SML-code and simulate an rls
202 difference: there is always _ONE_ redex rewritten in 1 call,
203 thus wrap Rrls by: Rls (Rls_ ...)*)
204 | Rrls of (* SML-functions within rewriting; step-wise execution provided;
206 difference: there is always _ONE_ redex rewritten in 1 call,
207 thus wrap Rrls by: Rls (Rls_ ...) *)
208 {id : string, (* for trace_rewrite := true *)
209 prepat : (term list *(* preconds, eval with subst from pattern;
210 if [@{term True}], match decides alone *)
211 term ) (* pattern matched with current (sub)term *)
212 list, (* meta-conjunction is or *)
213 rew_ord : rew_ord, (* for rules *)
214 erls : rls, (* for the conditions in rules and preconds *)
215 calc : calc list, (* for Calculate in scr, set automatic.in prep_rls' *)
216 errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
217 scr : scr}; (* Rfuns {...} (how to restrict type ???) *)
220 there are two kinds of theorems ...
221 (1) known by isabelle
222 (2) not known, eg. calc_thm, instantiated rls
223 the latter have a thmid "#..."
224 and thus outside isa we ALWAYS transport both (thmID, string_of_thmI)
225 and have a special assoc_thm / assoc_rls in this interface *)
226 type theory' = string; (* = domID ^".thy" WN.101011 ABOLISH !*)
227 type domID = string; (* domID ^".thy" = theory' WN.101011 replace by thyID*)
228 type thyID = string; (*WN.3.11.03 TODO: replace domID with thyID*)
230 fun term_to_string' ctxt t =
232 val ctxt' = Config.put show_markup false ctxt
233 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
234 fun term_to_string'' (thyID : thyID) t =
236 val ctxt' = Config.put show_markup false (Proof_Context.init_global (Thy_Info.get_theory thyID))
237 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
238 fun term_to_string''' thy t =
240 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
241 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
243 fun thy2ctxt' thy' = Proof_Context.init_global (Thy_Info.get_theory thy');(*FIXXXME thy-ctxt*)
244 fun thy2ctxt thy = Proof_Context.init_global thy;(*FIXXXME thy-ctxt*)
246 fun term2str t = term_to_string' (thy2ctxt' "Isac") t;
247 fun terms2strs ts = map term2str ts;
248 (*terms2strs [t1,t2] = ["1 + 2", "abc"];*)
249 val terms2str = strs2str o terms2strs;
250 (*terms2str [t1,t2] = "[\"1 + 2\",\"abc\"]";*)
251 val terms2str' = strs2str' o terms2strs;
252 (*terms2str' [t1,t2] = "[1 + 2,abc]";*)
254 fun termopt2str (SOME t) = "(SOME " ^ term2str t ^ ")"
255 | termopt2str NONE = "NONE";
257 fun type_to_string' ctxt t =
259 val ctxt' = Config.put show_markup false ctxt
260 in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
261 fun type_to_string'' (thyID : thyID) t =
263 val ctxt' = Config.put show_markup false (Proof_Context.init_global (Thy_Info.get_theory thyID))
264 in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
265 fun type_to_string''' thy t =
267 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
268 in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
270 fun type2str typ = type_to_string'' "Isac" typ; (*legacy*)
271 val string_of_typ = type2str; (*legacy*)
272 fun string_of_typ_thy thy typ = type_to_string'' thy typ; (*legacy*)
274 fun Isac _ = Proof_Context.theory_of (thy2ctxt' "Isac"); (*@{theory "Isac"}*)
276 val e_rule = Thm ("refl", @{thm refl});
277 fun id_of_thm (Thm (id, _)) = id
278 | id_of_thm _ = error "error id_of_thm";
279 fun thm_of_thm (Thm (_, thm)) = thm
280 | thm_of_thm _ = error "error thm_of_thm";
281 fun rep_thm_G' (Thm (thmid, thm)) = (thmid, thm);
283 fun thmID_of_derivation_name dn = last_elem (space_explode "." dn);
284 fun thmID_of_derivation_name' thm = (thmID_of_derivation_name o Thm.get_name_hint) thm
285 fun thyID_of_derivation_name dn = hd (space_explode "." dn);
287 fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _ : thm)) =
288 (strip_thy thmid1) = (strip_thy thmid2);
289 (*WN120201 weakened*)
290 fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _)) = thmid1 = thmid2;
291 (*version typed weaker WN100910*)
292 fun eq_thmI' ((thmid1, _), (thmid2, _)) =
293 (thmID_of_derivation_name thmid1) = (thmID_of_derivation_name thmid2);
296 (*check for [.] as caused by "fun assoc_thm'"*)
297 fun string_of_thm thm = term_to_string' (thy2ctxt' "Isac") (prop_of thm)
298 fun string_of_thm' thy thm = term_to_string' (thy2ctxt thy) (prop_of thm)
299 fun string_of_thmI thm =
301 val str = (de_quote o string_of_thm) thm
302 val (a, b) = split_nlast (5, Symbol.explode str)
305 [" ", " ","[", ".", "]"] => implode a
309 fun thm'_of_thm thm =
310 ((thmID_of_derivation_name o Thm.get_name_hint) thm, string_of_thmI thm): thm'
312 (*.id requested for all, Rls,Seq,Rrls.*)
313 fun id_rls Erls = "e_rls" (*WN060714 quick and dirty: recursive defs!*)
314 | id_rls (Rls {id,...}) = id
315 | id_rls (Seq {id,...}) = id
316 | id_rls (Rrls {id,...}) = id;
317 val rls2str = id_rls;
318 fun id_rule (Thm (id, _)) = id
319 | id_rule (Calc (id, _)) = id
320 | id_rule (Rls_ rls) = id_rls rls;
322 fun get_rules (Rls {rules,...}) = rules
323 | get_rules (Seq {rules,...}) = rules
324 | get_rules (Rrls _) = [];
326 fun rule2str Erule = "Erule"
327 | rule2str (Thm (str, thm)) = "Thm (\""^str^"\","^(string_of_thmI thm)^")"
328 | rule2str (Calc (str,f)) = "Calc (\""^str^"\",fn)"
329 | rule2str (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
330 | rule2str (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
331 fun rule2str' Erule = "Erule"
332 | rule2str' (Thm (str, thm)) = "Thm (\""^str^"\",\"\")"
333 | rule2str' (Calc (str,f)) = "Calc (\""^str^"\",fn)"
334 | rule2str' (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
335 | rule2str' (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
337 (*WN080102 compare eq_rule ?!?*)
338 fun eqrule (Thm (id1,_), Thm (id2,_)) = id1 = id2
339 | eqrule (Calc (id1,_), Calc (id2,_)) = id1 = id2
340 | eqrule (Cal1 (id1,_), Cal1 (id2,_)) = id1 = id2
341 | eqrule (Rls_ _, Rls_ _) = false (*{id=id1}{id=id2} = id1 = id2 FIXXME*)
344 type rrlsstate = (* state for reverse rewriting, comments see type rule and scr | Rfuns *)
345 (term * term * rule list list * (rule * (term * term list)) list);
347 val e_type = Type("empty",[]);
348 val a_type = TFree("'a",[]);
349 val e_term = Const("empty",e_type);
350 val a_term = Free("empty",a_type);
351 val e_rrlsstate = (e_term,e_term,[[e_rule]],[(e_rule,(e_term,[]))]):rrlsstate;
353 val e_term = Const("empty", Type("'a", []));
354 val e_scr = Prog e_term;
356 fun string_of_thy thy = Context.theory_name thy: theory';
357 val theory2domID = string_of_thy;
358 val theory2thyID = (get_thy o string_of_thy) : theory -> thyID;
359 val theory2theory' = string_of_thy;
360 val theory2str = string_of_thy; (*WN050903 ..most consistent naming*)
361 val theory2str' = implode o (drop_last_n 4) o Symbol.explode o string_of_thy;
362 (* fun theory'2theory = fun thyID2thy ... see fun assoc_thy (...Thy_Info.get_theory string);
363 al it = "Isac" : string
366 fun thyID2theory' (thyID:thyID) = thyID;
368 let val ss = Symbol.explode thyID
369 val ext = implode (takelast (4, ss))
370 in if ext = ".thy" then thyID : theory' (*disarm abuse of thyID*)
374 (* thyID2theory' "Isac" (*ok*);
375 val it = "Isac" : theory'
376 > thyID2theory' "Isac" (*abuse, goes ok...*);
377 val it = "Isac" : theory'
380 fun theory'2thyID (theory':theory') = theory';
382 let val ss = Symbol.explode theory'
383 val ext = implode (takelast (4, ss))
384 in if ext = ".thy" then ((implode o (drop_last_n 4)) ss) : thyID
385 else theory' (*disarm abuse of theory'*)
388 (* theory'2thyID "Isac";
389 val it = "Isac" : thyID
390 > theory'2thyID "Isac";
391 val it = "Isac" : thyID*)
394 (*. WN0509 discussion:
395 #############################################################################
396 # How to manage theorys in subproblems wrt. the requirement, #
397 # that scripts should be re-usable ? #
398 #############################################################################
400 eg. 'Script Solve_rat_equation' calls 'SubProblem (RatEq',..'
401 which would not allow to 'solve (y'' = -M_b / EI, M_b)' by this script
402 because Biegelinie.thy is subthy of RatEq.thy and thus Biegelinie.M_b
403 is unknown in RatEq.thy and M_b cannot be parsed into the scripts guard
406 Preliminary solution:
407 # the thy in 'SubProblem (thy', pbl, arglist)' is not taken automatically,
408 # instead the 'maxthy (rootthy pt) thy' is taken for each subpbl
409 # however, a thy specified by the user in the rootpbl may lead to
410 errors in far-off subpbls (which are not yet reported properly !!!)
411 and interactively specifiying thys in subpbl is not very relevant.
413 Other solutions possible:
414 # always parse and type-check with Thy_Info.get_theory "Isac"
415 (rejected tue to the vague idea eg. to re-use equations for R in C etc.)
416 # regard the subthy-relation in specifying thys of subpbls
417 # specifically handle 'SubProblem (undefined, pbl, arglist)'
420 (*WN0509 TODO "ProtoPure" ... would be more consistent
421 with assoc_thy <--> theory2theory' +FIXME assoc_thy "e_domID" -> Script.thy*)
422 val e_domID = "e_domID":domID;
424 (*the key into the hierarchy ob theory elements*)
425 type theID = string list;
426 val e_theID = ["e_theID"];
427 val theID2str = strs2str;
428 (*theID eg. is ["IsacKnowledge", "Test", "Rulesets", "ac_plus_times"]*)
429 fun theID2thyID (theID:theID) =
430 if length theID >= 3 then (last_elem o (drop_last_n 2)) theID : thyID
431 else error ("theID2thyID called with "^ theID2str theID);
433 (*the key into the hierarchy ob problems*)
434 type pblID = string list; (* domID::...*)
435 val e_pblID = ["e_pblID"]:pblID;
436 val pblID2str = strs2str;
438 (*the key into the hierarchy ob methods*)
439 type metID = string list;
440 val e_metID = ["e_metID"]:metID;
441 val metID2str = strs2str;
444 domID * (*WN.12.03: is replaced by thy from get_met ?FIXME? in:
445 specify (Init_Proof..), nxt_specify_init_calc,
446 assod (.SubProblem...), stac2tac (.SubProblem...)*)
450 fun spec2str ((dom,pbl,met)(*:spec*)) =
451 "(" ^ (quote dom) ^ ", " ^ (strs2str pbl) ^
452 ", " ^ (strs2str met) ^ ")";
453 (*> spec2str empty_spec;
454 val it = "(\"\", [], (\"\", \"\"))" : string *)
455 val empty_spec = (e_domID,e_pblID,e_metID):spec;
456 val e_spec = empty_spec;
458 (*.association list with cas-commands, for generating a complete calc-head.*)
460 (term list -> (* the arguments of the cas-command, eg. (x+1=2, x) *)
461 (term * (* description of an element *)
462 term list) (* value of the element (always put into a list) *)
463 list) (* of elements in the formalization *)
465 (term * (* cas-command, eg. 'solve' *)
466 (spec * (* theory, problem, method *)
468 fun cas_eq ((t1, (_, _)) : cas_elem, (t2, (_, _)) : cas_elem) = t1 = t2
470 (*either theID or pblID or metID*)
471 type kestoreID = string list;
472 val e_kestoreID = ["e_kestoreID"];
473 val kestoreID2str = strs2str;
475 (*for distinction of contexts WN130621: disambiguate with Isabelle's Context !*)
476 datatype ketype = Exp_ | Thy_ | Pbl_ | Met_;
477 fun ketype2str Exp_ = "Exp_"
478 | ketype2str Thy_ = "Thy_"
479 | ketype2str Pbl_ = "Pbl_"
480 | ketype2str Met_ = "Met_";
481 fun ketype2str' Exp_ = "Example"
482 | ketype2str' Thy_ = "Theory"
483 | ketype2str' Pbl_ = "Problem"
484 | ketype2str' Met_ = "Method";
486 (*rewrite orders, also stored in 'type met' and type 'and rls'
487 The association list is required for 'rewrite.."rew_ord"..'
488 WN0509 tests not well-organized: see smltest/Knowledge/termorder.sml*)
489 val rew_ord' = Unsynchronized.ref
490 ([]:(rew_ord' * (*the key for the association list *)
491 (subst (*the bound variables - they get high order*)
492 -> (term * term) (*(t1, t2) to be compared *)
493 -> bool)) (*if t1 <= t2 then true else false *)
494 list); (*association list *)
496 rew_ord' := overwritel (!rew_ord', [("e_rew_ord", e_rew_ord),
497 ("dummy_ord", dummy_ord)]);
500 (* A tree for storing data defined in different theories
501 for access from the Interpreter and from dialogue authoring
502 using a string list as key.
503 'a is for pbt | met | thydata; after WN030424 naming became inappropriate *)
505 Ptyp of string * (* element of the key *)
506 'a list * (* several pbts with different domIDs/thy TODO: select by subthy (isaref.p.69)
507 presently only _ONE_ elem FOR ALL KINDS OF CONTENT pbt | met | thydata *)
508 ('a ptyp) list;(* the children nodes *)
510 (*.datatype for collecting thydata for hierarchy.*)
511 (*WN060720 more consistent naming would be 'type thyelem' or 'thelem'*)
512 (*WN0606 Htxt contains html which does not belong to the sml-kernel*)
513 datatype thydata = Html of {guh: guh,
514 coursedesign: authors,
515 mathauthors: authors,
516 html: string} (*html; for demos before database*)
518 coursedesign: authors,
519 mathauthors: authors,
520 fillpats: fillpat list,
521 thm: thm} (* here no sym_thm, thus no thmID required *)
523 coursedesign: authors,
524 mathauthors: authors,
525 thy_rls: (thyID * rls)}
527 coursedesign: authors,
528 mathauthors: authors,
531 coursedesign: authors,
532 mathauthors: authors,
533 ord: (subst -> (term * term) -> bool)};
534 val e_thydata = Html {guh="e_guh", coursedesign=[], mathauthors=[], html=""};
535 fun the2str (Html {guh, coursedesign, mathauthors, html}) = guh : string
536 | the2str (Hthm {guh, coursedesign, mathauthors, fillpats, thm}) = guh
537 | the2str (Hrls {guh, coursedesign, mathauthors, thy_rls}) = guh
538 | the2str (Hcal {guh, coursedesign, mathauthors, calc}) = guh
539 | the2str (Hord {guh, coursedesign, mathauthors, ord}) = guh
540 fun thes2str thes = map the2str thes |> list2str;
542 (* notes on thehier concerning sym_thmID theorems (created in derivations, reverse rewriting)
543 (a): thehier does not contain sym_thmID theorems
544 (b): lookup for sym_thmID directly from Isabelle using sym_thm
545 (within math-engine NO lookup in thehier -- within java in *.xml only!)
546 TODO (c): export from thehier to xml
547 TODO (c1) creates one entry for "thmID" (and NONE for "sym_thmID") in the hierarchy
548 TODO (c2) creates 2 files "thy_*-thm-thmID.xml" and "thy_*-thm-sym_thmID.xml"
549 TODO (d): 1 entry in the MiniBrowser's hierarchy (generated from xml)
550 stands for both, "thmID" and "sym_thmID"
551 TODO (d1) lookup from calctxt
552 TODO (d1) lookup from from rule set in MiniBrowser *)
553 type thehier = (thydata ptyp) list;
554 (* required to determine sequence of main nodes of thehier in KEStore.thy *)
555 fun part2guh ([str]:theID) =
557 "Isabelle" => "thy_isab_" ^ str ^ "-part" : guh
558 | "IsacScripts" => "thy_scri_" ^ str ^ "-part"
559 | "IsacKnowledge" => "thy_isac_" ^ str ^ "-part"
560 | str => error ("thy2guh: called with '"^str^"'"))
561 | part2guh theID = error ("part2guh called with theID = " ^ theID2str theID);
563 fun thy2guh ([part, thyID] : theID) = (case part of
564 "Isabelle" => "thy_isab_" ^ thyID : guh
565 | "IsacScripts" => "thy_scri_" ^ thyID
566 | "IsacKnowledge" => "thy_isac_" ^ thyID
567 | str => error ("thy2guh: called with '" ^ str ^ "'"))
568 | thy2guh theID = error ("thy2guh called with '" ^ strs2str' theID ^ "'");
570 fun thypart2guh ([part, thyID, thypart] : theID) = case part of
571 "Isabelle" => "thy_isab_" ^ thyID ^ "-" ^ thypart : guh
572 | "IsacScripts" => "thy_scri_" ^ thyID ^ "-" ^ thypart
573 | "IsacKnowledge" => "thy_isac_" ^ thyID ^ "-" ^ thypart
574 | str => error ("thypart2guh: called with '" ^ str ^ "'");
576 (* convert the data got via contextToThy to a globally unique handle
577 there is another way to get the guh out of the 'theID' in the hierarchy *)
578 fun thm2guh (isa, thyID:thyID) (thmID:thmID) = case isa of
579 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID : guh
580 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID
581 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID
582 | str => error ("thm2guh called with isa = '" ^ isa ^ "' for thm = " ^ thmID ^ "'");
584 fun rls2guh (isa, thyID:thyID) (rls':rls') = case isa of
585 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-rls-" ^ rls' : guh
586 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-rls-" ^ rls'
587 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-rls-" ^ rls'
588 | str => error ("rls2guh called with isa = '" ^ isa ^ "' for rls = '" ^ rls' ^ "'");
590 fun cal2guh (isa, thyID:thyID) calID = case isa of
591 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-cal-" ^ calID : guh
592 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-cal-" ^ calID
593 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-cal-" ^ calID
594 | str => error ("cal2guh called with isa = '" ^ isa ^ "' for cal = '" ^ calID ^ "'");
596 fun ord2guh (isa, thyID:thyID) (rew_ord':rew_ord') = case isa of
597 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord' : guh
598 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord'
599 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord'
600 | str => error ("ord2guh called with isa = '" ^ isa ^ "' for ord = '" ^ rew_ord' ^ "'");
602 (* not only for thydata, but also for thy's etc *)
603 fun theID2guh (theID : theID) = case length theID of
604 0 => error ("theID2guh: called with theID = " ^ strs2str' theID)
605 | 1 => part2guh theID
607 | 3 => thypart2guh theID
609 let val [isa, thyID, typ, elemID] = theID
611 "Theorems" => thm2guh (isa, thyID) elemID
612 | "Rulesets" => rls2guh (isa, thyID) elemID
613 | "Calculations" => cal2guh (isa, thyID) elemID
614 | "Orders" => ord2guh (isa, thyID) elemID
615 | "Theorems" => thy2guh [isa, thyID]
616 | str => error ("theID2guh: called with theID = " ^ strs2str' theID)
618 | n => error ("theID2guh called with theID = " ^ strs2str' theID);
621 type filename = string;
623 (*val xxx = fn: a b => (a,b); ??? fun-definition ???*)
625 fun ii (_:term) = e_rrlsstate;
626 fun no (_:term) = SOME (e_term,[e_term]);
627 fun lo (_:rule list list) (_:term) (_:rule) = [(e_rule,(e_term,[e_term]))];
628 fun ne (_:rule list list) (_:term) = SOME e_rule;
629 fun fo (_:rule list list) (_:term) (_:term) = [(e_rule,(e_term,[e_term]))];
631 val e_rfuns = Rfuns {init_state=ii,normal_form=no,locate_rule=lo,
632 next_rule=ne,attach_form=fo};
636 Rls {id = "e_rls", preconds = [], rew_ord = ("dummy_ord", dummy_ord), erls = Erls,
637 srls = Erls, calc = [], rules = [], errpatts = [], scr = EmptyScr}: rls;
639 Rrls {id = "e_rrls", prepat = [], rew_ord = ("dummy_ord", dummy_ord), erls = Erls,
640 calc = [], errpatts = [], scr=e_rfuns}:rls;
642 fun rep_rls (Rls {id,preconds,rew_ord,erls,srls,calc,errpatts,rules,scr}) =
643 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
644 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
645 | rep_rls (Seq {id,preconds,rew_ord,erls,srls,calc,errpatts,rules,scr}) =
646 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
647 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
648 | rep_rls Erls = rep_rls e_rls
649 | rep_rls (Rrls {id,...}) = rep_rls e_rls
650 (*error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id)*);
651 (*| rep_rls (Seq {id,...}) =
652 error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id);
654 fun rep_rrls (Rrls {id, calc, erls, prepat, rew_ord, errpatts,
655 scr = Rfuns {attach_form, init_state, locate_rule, next_rule, normal_form}}) =
656 {id=id, calc=calc, erls=erls, prepat=prepat,
657 rew_ord=rew_ord, errpatts=errpatts, attach_form=attach_form, init_state=init_state,
658 locate_rule=locate_rule, next_rule=next_rule, normal_form=normal_form}
659 | rep_rrls (Rls {id,...}) =
660 error ("rep_rrls doesn't take apart (normal) rule-sets: "^id)
661 | rep_rrls (Seq {id,...}) =
662 error ("rep_rrls doesn't take apart (normal) rule-sets: "^id);
664 fun append_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
665 rules =rs, errpatts=errpatts, scr=sc}) r =
666 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
667 rules = rs @ r, errpatts=errpatts, scr=sc}:rls)
668 | append_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
669 rules =rs, errpatts=errpatts, scr=sc}) r =
670 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
671 rules = rs @ r, errpatts=errpatts, scr=sc}:rls)
672 | append_rls id (Rrls _) _ =
673 error ("append_rls: not for reverse-rewrite-rule-set "^id);
675 (*. are _atomic_ rules equal ?.*)
676 (*WN080102 compare eqrule ?!?*)
677 fun eq_rule (Thm (thm1,_), Thm (thm2,_)) = thm1 = thm2
678 | eq_rule (Calc (id1,_), Calc (id2,_)) = id1 = id2
679 | eq_rule (Rls_ rls1, Rls_ rls2) = id_rls rls1 = id_rls rls2
680 (*id_rls checks for Rls, Seq, Rrls*)
683 fun merge_ids rls1 rls2 =
685 val id1 = (#id o rep_rls) rls1
686 val id2 = (#id o rep_rls) rls2
688 if id1 = id2 then id1
689 else "merged_" ^ id1 ^ "_" ^ id2
691 fun merge_rls _ Erls rls = rls
692 | merge_rls _ rls Erls = rls
693 | merge_rls _ (Rrls x) _ = Rrls x (* required for merging Theory_Data *)
694 | merge_rls _ _ (Rrls x) = Rrls x
696 (Rls {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
697 rules = rs1, errpatts = eps1, scr = sc1, ...})
698 (Rls {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
699 rules = rs2, errpatts = eps2, ...})
701 (Rls {id = id, rew_ord = ro1, scr = sc1,
702 preconds = union (op =) pc1 pc2,
703 erls = merge_rls (merge_ids er1 er2) er1 er2,
704 srls = merge_rls (merge_ids sr1 sr2) sr1 sr2,
705 calc = union calc_eq ca1 ca2,
706 rules = union eq_rule rs1 rs2,
707 errpatts = union (op =) eps1 eps2} : rls)
709 (Seq {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
710 rules = rs1, errpatts = eps1, scr = sc1, ...})
711 (Seq {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
712 rules = rs2, errpatts = eps2, ...})
714 (Seq {id = id, rew_ord = ro1, scr = sc1,
715 preconds = union (op =) pc1 pc2,
716 erls = merge_rls (merge_ids er1 er2) er1 er2,
717 srls = merge_rls (merge_ids sr1 sr2) sr1 sr2,
718 calc = union calc_eq ca1 ca2,
719 rules = union eq_rule rs1 rs2,
720 errpatts = union (op =) eps1 eps2} : rls)
721 | merge_rls id _ _ = error ("merge_rls: \"" ^ id ^
722 "\"; not for reverse-rewrite-rule-sets and not for mixed Rls -- Seq");
724 fun remove_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
725 rules=rs, errpatts=eps, scr=sc}) r =
726 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
727 rules = gen_rems eq_rule (rs, r),
728 errpatts = eps(*gen_rems op= (eps, TODO)*),
730 | remove_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
731 rules =rs, errpatts=eps, scr=sc}) r =
732 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
733 rules = gen_rems eq_rule (rs, r),
734 errpatts = eps(*gen_rems op= (eps, TODO)*),
736 | remove_rls id (Rrls _) _ = error
737 ("remove_rls: not for reverse-rewrite-rule-set "^id);
739 (* datastructure for KEStore_Elems, intermediate for thehier *)
741 (rls' * (* identifier unique within Isac *)
742 (theory' * (* just for assignment in thehier, not appropriate for parsing etc *)
743 rls)) (* ((#id o rep_rls) rls) = rls' by coding discipline *)
744 fun rls_eq ((id1, (_, _)), (id2, (_, _))) = id1 = id2
746 fun insert_merge_rls (re as (id, (thyID, r1)) : rlss_elem) ys =
747 case get_index (fn y => if curry rls_eq re y then SOME y else NONE) ys of
749 | SOME (i, (_, (_, r2))) =>
751 val r12 = merge_rls id r1 r2
752 in list_update ys i (id, (thyID, r12)) end
754 fun merge_rlss (s1, s2) = fold insert_merge_rls s1 s2;
757 fun memrls r (Rls {rules,...}) = gen_mem eqrule (r, rules)
758 | memrls r (Seq {rules,...}) = gen_mem eqrule (r, rules)
759 | memrls r _ = error ("memrls: incomplete impl. r= "^(rule2str r));
761 fun assoc' ([], key) = error ("ME_Isa: '"^key^"' not known")
762 | assoc' ((keyi, xi) :: pairs, key) =
763 if key = keyi then SOME xi else assoc' (pairs, key);
765 fun assoc_thy (thy:theory') =
766 if thy = "e_domID" then (Thy_Info.get_theory "Script") (*lower bound of Knowledge*)
767 else (Thy_Info.get_theory thy)
768 handle _ => error ("ME_Isa: thy '" ^ thy ^ "' not in system");
770 (*.overwrite an element in an association list and pair it with a thyID
771 in order to create the thy_hierarchy;
772 overwrites existing rls' even if they are defined in a different thy;
773 this is related to assoc_rls, TODO.WN060120: assoc_rew_ord, assoc_calc;.*)
774 (*WN060120 ...these are NOT compatible to "fun assoc_thm'" in that
775 they do NOT handle overlays by re-using an identifier in different thys;
776 "thyID.rlsID" would be a good solution, if the "." would be possible
778 actually a hack to get alltogether run again with minimal effort*)
779 fun insthy thy' (rls', rls) = (rls', (thy', rls));
780 fun overwritelthy thy (al, bl:(rls' * rls) list) =
781 let val bl' = map (insthy ((get_thy o theory2theory') thy)) bl
782 in overwritel (al, bl') end;
784 fun assoc_rew_ord ro = ((the o assoc') (!rew_ord',ro))
785 handle _ => error ("ME_Isa: rew_ord '"^ro^"' not in system");
786 (*get the string for stac from rule*)
788 fun subst2str (s:subst) =
790 (map (linefeed o pair2str o
792 (apfst term2str)))) s;
793 fun subst2str' (s:subst) =
797 (apfst term2str)))) s;
798 (*> subst2str' [(str2term "bdv", str2term "x"),
799 (str2term "bdv_2", str2term "y")];
800 val it = "[(bdv, x)]" : string
802 val env2str = subst2str;
806 fun scr2str (Prog s) = "Prog " ^ term2str s
807 | scr2str (Rfuns _) = "Rfuns";
810 fun maxthy thy1 thy2 = if Theory.subthy (thy1, thy2) then thy2 else thy1;
813 (*.trace internal steps of isac's rewriter*)
814 val trace_rewrite = Unsynchronized.ref false;
815 (*.depth of recursion in traces of the rewriter, if trace_rewrite:=true.*)
816 val depth = Unsynchronized.ref 99999;
817 (*.no of rewrites exceeding this int -> NO rewrite.*)
818 (*WN060829 still unused...*)
819 val lim_rewrite = Unsynchronized.ref 99999;
820 (*.no of derivation-elements exceeding this int -> SOME derivation-elements.*)
821 val lim_deriv = Unsynchronized.ref 100;
822 (*.switch for checking guhs unique before storing a pbl or met;
823 set true at startup (done at begin of ROOT.ML)
824 set false for editing IsacKnowledge (done at end of ROOT.ML).*)
825 val check_guhs_unique = Unsynchronized.ref true;
828 datatype lrd = (*elements of a path (=loc_) into an Isabelle term*)
830 | R (*go right at $*)
831 | D; (*go down at Abs*)
832 type loc_ = lrd list;
836 fun loc_2str (k:loc_) = (strs2str' o (map ldr2str)) k;
839 (* the pattern for an item of a problems model or a methods guard *)
841 (string * (* field *)
842 (term * (* description *)
843 term)) (* id | arbitrary term *);
844 fun pat2str ((field, (dsc, id)) : pat) =
845 pair2str (field, pair2str (term2str dsc, term2str id))
846 fun pats2str pats = (strs2str o (map pat2str)) pats
848 (* types for problems models (TODO rename to specification models) *)
850 (string * (* field "#Given",..*)(*deprecated due to 'type pat'*)
851 (term * (* description *)
852 term)); (* id | struct-var *)
853 val e_pbt_ = ("#Undef", (e_term, e_term)) : pbt_
855 {guh : guh, (* unique within this isac-knowledge *)
856 mathauthors : string list, (* copyright *)
857 init : pblID, (* to start refinement with *)
858 thy : theory, (* which allows to compile that pbt
859 TODO: search generalized for subthy (ref.p.69*)
860 (*^^^ WN050912 NOT used during application of the problem,
861 because applied terms may be from 'subthy' as well as from super;
862 thus we take 'maxthy'; see match_ags !*)
863 cas : term option, (* 'CAS-command'*)
864 prls : rls, (* for preds in where_*)
865 where_ : term list, (* where - predicates*)
866 ppc : pat list, (* this is the model-pattern;
867 it contains "#Given","#Where","#Find","#Relate"-patterns
868 for constraints on identifiers see "fun cpy_nam" *)
869 met : metID list} (* methods solving the pbt*)
871 val e_pbt = {guh = "pbl_empty", mathauthors = [], init = e_pblID, thy = Thy_Info.get_theory "Pure",
872 cas = NONE, prls = Erls, where_ = [], ppc = [], met = []} : pbt
874 ({cas = cas', guh = guh', init = init', mathauthors = ma', met = met', ppc = ppc',
875 prls = prls', thy = thy', where_ = w'} : pbt) =
876 "{cas = " ^ (termopt2str cas') ^ ", guh = \"" ^ guh' ^ "\", init = "
877 ^ (strs2str init') ^ ", mathauthors = " ^ (strs2str ma' |> quote) ^ ", met = "
878 ^ (strslist2strs met') ^ ", ppc = " ^ pats2str ppc' ^ ", prls = "
879 ^ (rls2str prls' |> quote) ^ ", thy = {" ^ (theory2str thy') ^ "}, where_ = "
880 ^ (terms2str w') ^ "}" |> linefeed;
881 fun pbts2str pbts = map pbt2str pbts |> list2str;
883 val e_Ptyp = Ptyp ("e_pblID",[e_pbt],[])
884 type ptyps = (pbt ptyp) list
886 fun coll_pblguhs pbls =
887 let fun node coll (Ptyp (_,[n],ns)) =
888 [(#guh : pbt -> guh) n] @ (nodes coll ns)
889 and nodes coll [] = coll
890 | nodes coll (n::ns) = (node coll n) @ (nodes coll ns);
891 in nodes [] pbls end;
892 fun check_pblguh_unique (guh:guh) (pbls: (pbt ptyp) list) =
893 if member op = (coll_pblguhs pbls) guh
894 then error ("check_guh_unique failed with '"^guh^"';\n"^
895 "use 'sort_pblguhs()' for a list of guhs;\n"^
896 "consider setting 'check_guhs_unique := false'")
899 fun insrt _ pbt [k] [] = [Ptyp (k, [pbt], [])]
900 | insrt d pbt [k] ((Ptyp (k', [p], ps)) :: pys) =
901 ((*writeln ("### insert 1: ks = " ^ strs2str [k] ^ " k'= " ^ k');*)
903 then ((Ptyp (k', [pbt], ps)) :: pys)
904 else ((Ptyp (k', [p], ps)) :: (insrt d pbt [k] pys))
906 | insrt d pbt (k::ks) ((Ptyp (k', [p], ps))::pys) =
907 ((*writeln ("### insert 2: ks = "^(strs2str (k::ks))^" k'= "^k');*)
909 then ((Ptyp (k', [p], insrt d pbt ks ps)) :: pys)
912 then error ("insert: not found " ^ (strs2str (d : pblID)))
913 else ((Ptyp (k', [p], ps)) :: (insrt d pbt (k :: ks) pys))
916 fun update_ptyps ID _ _ [] =
917 error ("update_ptyps: " ^ strs2str' ID ^ " does not exist")
918 | update_ptyps ID [i] data ((py as Ptyp (key, _, pys)) :: pyss) =
922 then ((Ptyp (key, [data], [])) :: pyss)
923 else error ("update_ptyps: " ^ strs2str' ID ^ " has descendants")
924 else py :: update_ptyps ID [i] data pyss
925 | update_ptyps ID (i :: is) data ((py as Ptyp (key, d, pys)) :: pyss) =
927 then ((Ptyp (key, d, update_ptyps ID is data pys)) :: pyss)
928 else (py :: (update_ptyps ID (i :: is) data pyss))
930 (* this function only works wrt. the way Isabelle evaluates Theories and is not a general merge
931 function for trees / ptyps *)
932 fun merge_ptyps ([], pt) = pt
933 | merge_ptyps (pt, []) = pt
934 | merge_ptyps ((x' as Ptyp (k, x, ps)) :: xs, (xs' as Ptyp (k', y, ps') :: ys)) =
936 then Ptyp (k, y, merge_ptyps (ps, ps')) :: merge_ptyps (xs, ys)
937 else x' :: merge_ptyps (xs, xs');
938 fun merge_ptyps' pt1 pt2 = merge_ptyps (pt1, pt2)
940 (* data for methods stored in 'methods'-database*)
942 {guh : guh, (*unique within this isac-knowledge *)
943 mathauthors: string list,(*copyright *)
944 init : pblID, (*WN060721 introduced mistakenly--TODO.REMOVE!*)
945 rew_ord' : rew_ord', (*for rules in Detail
946 TODO.WN0509 store fun itself, see 'type pbt'*)
947 erls : rls, (*the eval_rls for cond. in rules FIXME "rls'
948 instead erls in "fun prep_met" *)
949 srls : rls, (*for evaluating list expressions in scr *)
950 prls : rls, (*for evaluating predicates in modelpattern *)
951 crls : rls, (*for check_elementwise, ie. formulae in calc.*)
952 nrls : rls, (*canonical simplifier specific for this met *)
953 errpats : errpat list,(*error patterns expected in this method *)
954 calc : calc list, (*Theory_Data in fun prep_met *)
955 (*branch : TransitiveB set in append_problem at generation ob pblobj
956 FIXXXME.0308: set branch from met in Apply_Method ? *)
957 ppc : pat list, (*.items in given, find, relate;
958 items (in "#Find") which need not occur in the arg-list of a SubProblem
959 are 'copy-named' with an identifier "*'.'".
960 copy-named items are 'generating' if they are NOT "*'''" ?WN120516??
961 see ME/calchead.sml 'fun is_copy_named'. *)
962 pre : term list, (*preconditions in where *)
963 scr : scr (*prep_met gets progam or string "empty_script"*)
965 val e_met = {guh="met_empty",mathauthors=[],init=e_metID,
966 rew_ord' = "e_rew_ord'": rew_ord',
967 erls = e_rls, srls = e_rls, prls = e_rls,
968 calc = [], crls = e_rls, errpats = [], nrls= e_rls,
969 ppc = []: (string * (term * term)) list,
971 scr = EmptyScr: scr}:met;
974 val e_Mets = Ptyp ("e_metID",[e_met],[]);
976 type mets = (met ptyp) list;
978 fun coll_metguhs mets =
979 let fun node coll (Ptyp (_,[n],ns)) =
980 [(#guh : met -> guh) n] @ (nodes coll ns)
981 and nodes coll [] = coll
982 | nodes coll (n::ns) = (node coll n) @ (nodes coll ns);
983 in nodes [] mets end;
985 fun check_metguh_unique (guh:guh) (mets: (met ptyp) list) =
986 if member op = (coll_metguhs mets) guh
987 then error ("check_guh_unique failed with '"^guh^"';\n"^
988 "use 'sort_metguhs()' for a list of guhs;\n"^
989 "consider setting 'check_guhs_unique := false'")
992 fun Html_default exist = (Html {guh = theID2guh exist,
993 coursedesign = ["isac team 2006"], mathauthors = [], html = ""})
995 fun fill_parents (exist, [i]) thydata = Ptyp (i, [thydata], [])
996 | fill_parents (exist, i :: is) thydata =
997 Ptyp (i, [Html_default (exist @ [i])], [fill_parents (exist @ [i], is) thydata])
998 | fill_parents _ _ = error "Html_default: avoid ML warning: Matches are not exhaustive"
1000 fun add_thydata (exist, is) thydata [] = [fill_parents (exist, is) thydata]
1001 | add_thydata (exist, [i]) data (pys as (py as Ptyp (key, _, _)) :: pyss) =
1003 then pys (* preserve existing thydata *)
1004 else py :: add_thydata (exist, [i]) data pyss
1005 | add_thydata (exist, iss as (i :: is)) data ((py as Ptyp (key, d, pys)) :: pyss) =
1009 then Ptyp (key, d, [fill_parents (exist @ [i], is) data]) :: pyss
1010 else Ptyp (key, d, add_thydata (exist @ [i], is) data pys) :: pyss
1011 else py :: add_thydata (exist, iss) data pyss
1012 | add_thydata _ _ _ = error "add_thydata: avoid ML warning: Matches are not exhaustive"
1014 fun update_hthm (Hthm {guh, coursedesign, mathauthors, thm, ...}) fillpats' =
1015 Hthm {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,
1016 fillpats = fillpats', thm = thm}
1017 | update_hthm _ _ = raise ERROR "wrong data";
1019 (* for interface for dialog-authoring *)
1020 fun update_hrls (Hrls {guh, coursedesign, mathauthors, thy_rls = (thyID, rls)}) errpatIDs =
1024 Rls {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...} =>
1025 Rls {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,
1026 calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}
1027 | Seq {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...} =>
1028 Seq {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,
1029 calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}
1030 | Rrls {id, prepat, rew_ord, erls, calc, scr, ...} =>
1031 Rrls {id = id, prepat = prepat, rew_ord = rew_ord, erls = erls, calc = calc,
1032 scr = scr, errpatts = errpatIDs}
1035 Hrls {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,
1036 thy_rls = (thyID, rls')}
1038 | update_hrls _ _ = raise ERROR "wrong data";
1040 fun app_py p f (d:pblID) (k(*:pblRD*)) = let
1042 error ("app_py: not found: " ^ (strs2str d));
1043 fun app_py' _ [] = py_err ()
1044 | app_py' [] _ = py_err ()
1045 | app_py' [k0] ((p' as Ptyp (k', _, _ ))::ps) =
1046 if k0 = k' then f p' else app_py' [k0] ps
1047 | app_py' (k' as (k0::ks)) (Ptyp (k'', _, ps)::ps') =
1048 if k0 = k'' then app_py' ks ps else app_py' k' ps';
1052 fun extract_py (Ptyp (_, [py], _)) = py
1053 | extract_py _ = error ("extract_py: Ptyp has wrong format.");
1054 in app_py p extract_py end;
1056 fun (*KEStore_Elems.*)insert_fillpats th fis = (* for tests bypassing setup KEStore_Elems *)
1058 fun update_elem th (theID, fillpats) =
1060 val hthm = get_py th theID theID
1061 val hthm' = update_hthm hthm fillpats
1062 handle ERROR _ => error ("insert_fillpats: " ^ strs2str theID ^ "must address a theorem")
1063 in update_ptyps theID theID hthm' end
1064 in fold (update_elem th) fis end
1066 (* group the theories defined in Isac, compare Build_Thydata:
1067 section "Get and group the theories defined in Isac" *)
1068 fun isabthys () = (*["Complex_Main", "Taylor", .., "Pure"]*)
1070 val allthys = Theory.ancestors_of (Thy_Info.get_theory "Build_Thydata")
1072 drop ((find_index (curry Theory.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys), allthys)
1074 fun knowthys () = (*["Isac", .., "Descript", "Delete"]*)
1076 fun isacthys () = (* ["Isac", .., "KEStore"] without Build_Isac thys: "Interpret" etc *)
1078 val allthys = filter_out (member Theory.eq_thy
1079 [(*Thy_Info.get_theory "ProgLang",*) Thy_Info.get_theory "Interpret",
1080 Thy_Info.get_theory "xmlsrc", Thy_Info.get_theory "Frontend"])
1081 (Theory.ancestors_of (Thy_Info.get_theory "Build_Thydata"))
1083 take ((find_index (curry Theory.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys),
1086 val isacthys' = isacthys ()
1087 val proglang_parent = Thy_Info.get_theory "ProgLang"
1089 take ((find_index (curry Theory.eq_thy proglang_parent) isacthys'), isacthys')
1091 fun progthys () = (*["Isac", .., "Descript", "Delete"]*)
1093 fun isacthys () = (* ["Isac", .., "KEStore"] without Build_Isac thys: "Interpret" etc *)
1095 val allthys = filter_out (member Theory.eq_thy
1096 [(*Thy_Info.get_theory "ProgLang",*) Thy_Info.get_theory "Interpret",
1097 Thy_Info.get_theory "xmlsrc", Thy_Info.get_theory "Frontend"])
1098 (Theory.ancestors_of (Thy_Info.get_theory "Build_Thydata"))
1100 take ((find_index (curry Theory.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys),
1103 val isacthys' = isacthys ()
1104 val proglang_parent = Thy_Info.get_theory "ProgLang"
1106 drop ((find_index (curry Theory.eq_thy proglang_parent) isacthys') + 1(*ProgLang*), isacthys')
1110 if member Theory.eq_thy (knowthys ()) thy then "IsacKnowledge"
1111 else if member Theory.eq_thy (progthys ()) thy then "IsacScripts"
1112 else if member Theory.eq_thy (isabthys ()) thy then "Isabelle"
1113 else error ("closure of thys in Isac is broken by " ^ string_of_thy thy)
1114 fun partID' (thy' : theory') = partID (Thy_Info.get_theory thy')