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'
33 type thmID = string; (* identifier for a thm (the shortest possible identifier) *)
34 type thmDeriv = string; (* WN120524 deprecated
35 thyID ^"."^ xxx ^"."^ thmID, see fun thmID_of_derivation_name
36 WN120524: dont use Thm.derivation_name, this is destroyed by num_str;
37 Thm.get_name_hint survives num_str and seems perfectly reliable *)
39 type thm' = thmID * cterm';(*WN060610 deprecated in favour of thm''*)
40 (* tricky combination of (string, term) for theorems in Isac:
41 * case 1 general: frontend + lucin, e.g. applicable_in..Rewrite: (thmID, _) --> (thmID, thm)
42 by Global_Theory.get_thm, special cases ("add_commute",..) see convert_metaview_to_thmid.
43 * case 2 "sym_..": Global_Theory.get_thm..RS sym
44 * case 3 ad-hoc thm "#..." mk_thm from ad-hoc term (numerals only) in calculate_:
45 from applicable_in..Calculate: opstr --calculate_/adhoc_thm--> (thmID, thm)
47 type thm'' = thmID * thm; (* only for transport via libisabelle isac-java <--- ME *)
50 (*.a 'guh'='globally unique handle' is a string unique for each element
51 of isac's KEStore and persistent over time
52 (in particular under shifts within the respective hierarchy);
54 # guh NOT resistant agains shifts from one thy to another
55 (which is the price for Isabelle's design: thy's overwrite ids of subthy's)
56 # requirement for matchTheory: induce guh from tac + current thy
57 (see 'fun thy_containing_thm', 'fun thy_containing_rls' etc.)
58 TODO: introduce to pbl, met.*)
60 val e_guh = "e_guh":guh;
62 type xml = string; (* rm together with old code replaced by XML.tree *)
63 fun string_to_bool "true" = true
64 | string_to_bool "false" = false
65 | string_to_bool str = error ("string_to_bool: arg = " ^ str)
67 (* eval function calling sml code during rewriting.
68 Unifying "type cal" and "type calc" would make Lucas-Interpretation more efficient,
69 see "fun rule2stac": instead of
70 Calc: calID * eval_fn -> rule
72 Calc: prog_calcID * (calID * eval_fn)) -> rule*)
73 type eval_fn = (string -> term -> theory -> (string * term) option);
74 fun e_evalfn (_:'a) (_:term) (_:theory) = NONE:(string * term) option;
75 (*. op in isa-term 'Const(op,_)' .*)
79 type cal = (calID * eval_fn);
80 (*. fun calculate_ fetches the evaluation-function via this list. *)
81 type prog_calcID = string;
82 type calc = (prog_calcID * cal);
84 prog_calcID * (* a simple identifier used in programs *)
85 (calID * (* a long identifier used in Const *)
86 eval_fn) (* an ML function *)
87 fun calc_eq ((pi1, (ci1, _)) : calc_elem, (pi2, (ci2, _)) : calc_elem) =
89 then if ci1 = ci2 then true else error ("calc_eq: " ^ ci1 ^ " <> " ^ ci2)
93 type subs' = (cterm' * cterm') list; (*16.11.00 for FE-KE*)
94 type subst = (term * term) list; (*here for ets2str*)
95 val e_subst = []:(term * term) list;
97 (*TODO.WN060610 make use of "type rew_ord" total*)
98 type rew_ord' = string;
99 val e_rew_ord' = "e_rew_ord" : rew_ord';
100 type rew_ord_ = subst -> Term.term * Term.term -> bool;
101 fun dummy_ord (_:subst) (_:term,_:term) = true;
102 val e_rew_ord_ = dummy_ord;
103 type rew_ord = rew_ord' * rew_ord_;
104 val e_rew_ord = dummy_ord; (* TODO.WN071231 clarify identifiers..e_rew_ordX*)
105 val e_rew_ordX = (e_rew_ord', e_rew_ord_) : rew_ord;
107 (* error patterns and fill patterns *)
108 type errpatID = string
110 errpatID (* one identifier for a list of patterns
111 DESIGN ?TODO: errpatID list for hierarchy of errpats ? *)
112 * term list (* error patterns *)
113 * thm list (* thms related to error patterns; note that respective lhs
114 do not match (which reflects student's error).
115 fillpatterns are stored with these thms. *)
117 (* for (at least) 2 kinds of access:
118 (1) given an errpatID, find the respective fillpats (e.g. in fun find_fill_pats)
119 (2) given a thm, find respective fillpats *)
120 type fillpatID = string
122 fillpatID (* DESIGN ?TODO: give an order w.r.t difficulty ? *)
123 * term (* the pattern with fill-in gaps *)
124 * errpatID; (* which the fillpat would be a help for
125 DESIGN ?TODO: list for several patterns ? *)
128 Erule (*.the empty rule .*)
129 | Thm of (string * Basic_Thm.thm) (* see TODO CLEANUP Thm *)
130 | Calc of string * (*.sml-code manipulating a (sub)term .*)
132 | Cal1 of string * (*.sml-code applied only to whole term
133 or left/right-hand-side of eqality .*)
135 | Rls_ of rls (*.ie. rule sets may be nested.*)
138 | Prog of term (* a leaf is either a tactic or an 'exp' in 'let v = expr'
139 where 'exp' does not contain a tactic. *)
140 | Rfuns of (* for Rrls, usage see rational.sml ----- reverse rewrite ----- *)
141 {init_state : (* initialise for reverse rewriting by the Interpreter *)
142 term -> (* for this the rrlsstate is initialised: *)
143 term * (* the current formula: goes locate_gen -> next_tac via istate *)
144 term * (* the final formula *)
145 rule list (* of reverse rewrite set (#1#) *)
146 list * (* may be serveral, eg. in norm_rational *)
147 ( rule * (* Thm (+ Thm generated from Calc) resulting in ... *)
148 (term * (* ... rewrite with ... *)
149 term list)) (* ... assumptions *)
150 list, (* derivation from given term to normalform
151 in reverse order with sym_thm;
152 (#1#) could be extracted from here #1 *)
153 normal_form: (* the function which drives the Rrls ##############################*)
154 term -> (term * term list) option,
155 locate_rule: (* checks a rule R for being a cancel-rule, and if it is,
156 then return the list of rules (+ the terms they are rewriting to)
157 which need to be applied before R should be applied.
158 precondition: the rule is applicable to the argument-term. *)
159 rule list list -> (* the reverse rule list *)
160 term -> (* ... to which the rule shall be applied *)
161 rule -> (* ... to be applied to term *)
162 ( rule * (* value: a rule rewriting to ... *)
163 (term * (* ... the resulting term ... *)
164 term list)) (* ... with the assumptions ( //#0) *)
165 list, (* there may be several such rules; the list is empty,
166 if the rule has nothing to do with e.g. cancelation *)
167 next_rule: (* for a given term return the next rules to be done for cancelling *)
168 rule list list->(* the reverse rule list *)
169 term -> (* the term for which ... *)
170 rule option, (* ... this rule is appropriate for cancellation;
171 there may be no such rule (if the term is eg.canceled already*)
172 attach_form: (* checks an input term TI, if it may belong to e.g. a current
173 cancellation, by trying to derive it from the given term TG.
176 term -> (* TG, the last one agreed upon by user + math-eng *)
177 term -> (* TI, the next one input by the user *)
178 ( rule * (* the rule to be applied in order to reach TI *)
179 (term * (* ... obtained by applying the rule ... *)
180 term list)) (* ... and the respective assumptions *)
181 list} (* there may be several such rules; the list is empty, if the
182 users term does not belong to e.g. a cancellation of the term
185 Erls (*for init e_rls*)
187 | Rls of (*a confluent and terminating ruleset, in general *)
188 {id : string, (*for trace_rewrite:=true *)
189 preconds : term list, (*unused WN020820 *)
190 (*WN060616 for efficiency...
191 bdvs : false, (*set in prep_rls' for get_bdvs *)*)
192 rew_ord : rew_ord, (*for rules*)
193 erls : rls, (*for the conditions in rules *)
194 srls : rls, (*for evaluation of list_fns in script *)
195 calc : calc list, (*for Calculate in scr, set by prep_rls' *)
197 errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
198 scr : scr} (*Prog term: generating intermed.steps *)
199 | Seq of (*a sequence of rules to be tried only once *)
200 {id : string, (*for trace_rewrite:=true *)
201 preconds : term list, (*unused 20.8.02 *)
202 (*WN060616 for efficiency...
203 bdvs : false, (*set in prep_rls' for get_bdvs *)*)
204 rew_ord : rew_ord, (*for rules *)
205 erls : rls, (*for the conditions in rules *)
206 srls : rls, (*for evaluation of list_fns in script *)
207 calc : calc list, (*for Calculate in scr, set by prep_rls' *)
209 errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
210 scr : scr} (*Prog term (how to restrict type ???)*)
212 (*Rrls call SML-code and simulate an rls
213 difference: there is always _ONE_ redex rewritten in 1 call,
214 thus wrap Rrls by: Rls (Rls_ ...)*)
215 | Rrls of (* SML-functions within rewriting; step-wise execution provided;
217 difference: there is always _ONE_ redex rewritten in 1 call,
218 thus wrap Rrls by: Rls (Rls_ ...) *)
219 {id : string, (* for trace_rewrite := true *)
220 prepat : (term list *(* preconds, eval with subst from pattern;
221 if [@{term True}], match decides alone *)
222 term ) (* pattern matched with current (sub)term *)
223 list, (* meta-conjunction is or *)
224 rew_ord : rew_ord, (* for rules *)
225 erls : rls, (* for the conditions in rules and preconds *)
226 calc : calc list, (* for Calculate in scr, set automatic.in prep_rls' *)
227 errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
228 scr : scr}; (* Rfuns {...} (how to restrict type ???) *)
231 there are two kinds of theorems ...
232 (1) known by isabelle
233 (2) not known, eg. calc_thm, instantiated rls
234 the latter have a thmid "#..."
235 and thus outside isa we ALWAYS transport both (thmID, string_of_thmI)
236 and have a special assoc_thm / assoc_rls in this interface *)
237 type theory' = string; (* = domID ^".thy" WN.101011 ABOLISH !*)
238 type domID = string; (* domID ^".thy" = theory' WN.101011 replace by thyID*)
239 type thyID = string; (*WN.3.11.03 TODO: replace domID with thyID*)
241 (* Since Isabelle2017 sessions in theory identifiers are enforced.
242 However, we leave theory identifiers short, in particular in use as keys into KEStore. *)
243 fun Thy_Info_get_theory thyID = Thy_Info.get_theory ("Isac." ^ thyID)
247 val t = Thm.prop_of thm
248 val ctxt = Proof_Context.init_global (Thy_Info.get_theory ("Isac.Isac"))
249 val ctxt' = Config.put show_markup false ctxt
250 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
252 fun term_to_string' ctxt t =
254 val ctxt' = Config.put show_markup false ctxt
255 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
256 fun term_to_string'' (thyID : thyID) t =
258 val ctxt' = Config.put show_markup false (Proof_Context.init_global (Thy_Info_get_theory thyID))
259 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
260 fun term_to_string''' thy t =
262 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
263 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
265 fun thy2ctxt' thy' = Proof_Context.init_global (Thy_Info_get_theory thy');(*FIXXXME thy-ctxt*)
266 fun thy2ctxt thy = Proof_Context.init_global thy;(*FIXXXME thy-ctxt*)
268 fun term2str t = term_to_string' (thy2ctxt' "Isac") t;
269 fun t2str thy t = term_to_string' (thy2ctxt thy) t;
270 fun ts2str thy ts = ts |> map (t2str thy) |> strs2str';
271 fun terms2strs ts = map term2str ts;
272 (*terms2strs [t1,t2] = ["1 + 2", "abc"];*)
273 val terms2str = strs2str o terms2strs;
274 (*terms2str [t1,t2] = "[\"1 + 2\",\"abc\"]";*)
275 val terms2str' = strs2str' o terms2strs;
276 (*terms2str' [t1,t2] = "[1 + 2,abc]";*)
279 fun termopt2str (SOME t) = "(SOME " ^ term2str t ^ ")"
280 | termopt2str NONE = "NONE";
282 fun type_to_string' ctxt t =
284 val ctxt' = Config.put show_markup false ctxt
285 in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
286 fun type_to_string'' (thyID : thyID) t =
288 val ctxt' = Config.put show_markup false (Proof_Context.init_global (Thy_Info_get_theory thyID))
289 in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
290 fun type_to_string''' thy t =
292 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
293 in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
295 fun type2str typ = type_to_string'' "Isac" typ; (*legacy*)
296 val string_of_typ = type2str; (*legacy*)
297 fun string_of_typ_thy thy typ = type_to_string'' thy typ; (*legacy*)
299 fun Isac _ = Proof_Context.theory_of (thy2ctxt' "Isac"); (*@{theory "Isac"}*)
301 val e_rule = Thm ("refl", @{thm refl});
302 fun id_of_thm (Thm (id, _)) = id (* TODO re-arrange code for rule2str *)
303 | id_of_thm _ = raise ERROR ("id_of_thm: uncovered case " (* ^ rule2str r *))
304 fun thm_of_thm (Thm (_, thm)) = thm (* TODO re-arrange code for rule2str *)
305 | thm_of_thm _ = raise ERROR ("thm_of_thm: uncovered case " (* ^ rule2str r *))
306 fun rep_thm_G' (Thm (thmid, thm)) = (thmid, thm) (* TODO re-arrange code for rule2str *)
307 | rep_thm_G' _ = raise ERROR ("rep_thm_G': uncovered case " (* ^ rule2str r *))
309 fun thmID_of_derivation_name dn = last_elem (space_explode "." dn);
310 fun thmID_of_derivation_name' thm = (thmID_of_derivation_name o Thm.get_name_hint) thm
311 fun thyID_of_derivation_name dn = hd (space_explode "." dn);
312 fun thm''_of_thm thm = (thmID_of_derivation_name' thm, thm) : thm''
314 fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _ : thm)) =
315 (strip_thy thmid1) = (strip_thy thmid2);
316 (*WN120201 weakened*)
317 fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _)) = thmid1 = thmid2;
318 (*version typed weaker WN100910*)
319 fun eq_thmI' ((thmid1, _), (thmid2, _)) =
320 (thmID_of_derivation_name thmid1) = (thmID_of_derivation_name thmid2);
323 (*check for [.] as caused by "fun assoc_thm'"*)
324 fun string_of_thm thm = term_to_string' (thy2ctxt' "Isac") (Thm.prop_of thm)
325 fun string_of_thm' thy thm = term_to_string' (thy2ctxt thy) (Thm.prop_of thm)
326 fun string_of_thmI thm =
328 val str = (de_quote o string_of_thm) thm
329 val (a, b) = split_nlast (5, Symbol.explode str)
332 [" ", " ","[", ".", "]"] => implode a
336 (*.id requested for all, Rls,Seq,Rrls.*)
337 fun id_rls Erls = "e_rls" (*WN060714 quick and dirty: recursive defs!*)
338 | id_rls (Rls {id,...}) = id
339 | id_rls (Seq {id,...}) = id
340 | id_rls (Rrls {id,...}) = id;
341 val rls2str = id_rls;
342 fun id_rule (Thm (id, _)) = id
343 | id_rule (Calc (id, _)) = id
344 | id_rule (Rls_ rls) = id_rls rls;
346 fun get_rules (Rls {rules,...}) = rules
347 | get_rules (Seq {rules,...}) = rules
348 | get_rules (Rrls _) = [];
350 fun rule2str Erule = "Erule"
351 | rule2str (Thm (str, thm)) = "Thm (\""^str^"\","^(string_of_thmI thm)^")"
352 | rule2str (Calc (str,f)) = "Calc (\""^str^"\",fn)"
353 | rule2str (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
354 | rule2str (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
355 fun rule2str' Erule = "Erule"
356 | rule2str' (Thm (str, thm)) = "Thm (\""^str^"\",\"\")"
357 | rule2str' (Calc (str,f)) = "Calc (\""^str^"\",fn)"
358 | rule2str' (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
359 | rule2str' (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
361 (*WN080102 compare eq_rule ?!?*)
362 fun eqrule (Thm (id1,_), Thm (id2,_)) = id1 = id2
363 | eqrule (Calc (id1,_), Calc (id2,_)) = id1 = id2
364 | eqrule (Cal1 (id1,_), Cal1 (id2,_)) = id1 = id2
365 | eqrule (Rls_ _, Rls_ _) = false (*{id=id1}{id=id2} = id1 = id2 FIXXME*)
368 type rrlsstate = (* state for reverse rewriting, comments see type rule and scr | Rfuns *)
369 (term * term * rule list list * (rule * (term * term list)) list);
371 val e_type = Type("empty",[]);
372 val a_type = TFree("'a",[]);
373 val e_term = Const("empty",e_type);
374 val a_term = Free("empty",a_type);
375 val e_rrlsstate = (e_term,e_term,[[e_rule]],[(e_rule,(e_term,[]))]):rrlsstate;
377 val e_term = Const("empty", Type("'a", []));
378 val e_scr = Prog e_term;
380 fun string_of_thy thy = Context.theory_name thy: theory';
381 val theory2domID = string_of_thy;
382 val theory2thyID = (get_thy o string_of_thy) : theory -> thyID;
383 val theory2theory' = string_of_thy;
384 val theory2str = string_of_thy; (*WN050903 ..most consistent naming*)
385 val theory2str' = implode o (drop_last_n 4) o Symbol.explode o string_of_thy;
386 (* fun theory'2theory = fun thyID2thy ... see fun assoc_thy (...Thy_Info_get_theory string);
387 al it = "Isac" : string
390 fun thyID2theory' (thyID:thyID) = thyID;
392 let val ss = Symbol.explode thyID
393 val ext = implode (takelast (4, ss))
394 in if ext = ".thy" then thyID : theory' (*disarm abuse of thyID*)
398 (* thyID2theory' "Isac" (*ok*);
399 val it = "Isac" : theory'
400 > thyID2theory' "Isac" (*abuse, goes ok...*);
401 val it = "Isac" : theory'
404 fun theory'2thyID (theory':theory') = theory';
406 let val ss = Symbol.explode theory'
407 val ext = implode (takelast (4, ss))
408 in if ext = ".thy" then ((implode o (drop_last_n 4)) ss) : thyID
409 else theory' (*disarm abuse of theory'*)
412 (* theory'2thyID "Isac";
413 val it = "Isac" : thyID
414 > theory'2thyID "Isac";
415 val it = "Isac" : thyID*)
418 (*. WN0509 discussion:
419 #############################################################################
420 # How to manage theorys in subproblems wrt. the requirement, #
421 # that scripts should be re-usable ? #
422 #############################################################################
424 eg. 'Script Solve_rat_equation' calls 'SubProblem (RatEq',..'
425 which would not allow to 'solve (y'' = -M_b / EI, M_b)' by this script
426 because Biegelinie.thy is subthy of RatEq.thy and thus Biegelinie.M_b
427 is unknown in RatEq.thy and M_b cannot be parsed into the scripts guard
430 Preliminary solution:
431 # the thy in 'SubProblem (thy', pbl, arglist)' is not taken automatically,
432 # instead the 'maxthy (rootthy pt) thy' is taken for each subpbl
433 # however, a thy specified by the user in the rootpbl may lead to
434 errors in far-off subpbls (which are not yet reported properly !!!)
435 and interactively specifiying thys in subpbl is not very relevant.
437 Other solutions possible:
438 # always parse and type-check with Thy_Info_get_theory "Isac"
439 (rejected tue to the vague idea eg. to re-use equations for R in C etc.)
440 # regard the subthy-relation in specifying thys of subpbls
441 # specifically handle 'SubProblem (undefined, pbl, arglist)'
444 (*WN0509 TODO "ProtoPure" ... would be more consistent
445 with assoc_thy <--> theory2theory' +FIXME assoc_thy "e_domID" -> Script.thy*)
446 val e_domID = "e_domID":domID;
448 (*the key into the hierarchy ob theory elements*)
449 type theID = string list;
450 val e_theID = ["e_theID"];
451 val theID2str = strs2str;
452 (*theID eg. is ["IsacKnowledge", "Test", "Rulesets", "ac_plus_times"]*)
453 fun theID2thyID (theID:theID) =
454 if length theID >= 3 then (last_elem o (drop_last_n 2)) theID : thyID
455 else error ("theID2thyID called with "^ theID2str theID);
457 (*the key into the hierarchy ob problems*)
458 type pblID = string list; (* domID::...*)
459 val e_pblID = ["e_pblID"]:pblID;
460 val pblID2str = strs2str;
462 (*the key into the hierarchy ob methods*)
463 type metID = string list;
464 val e_metID = ["e_metID"]:metID;
465 val metID2str = strs2str;
468 domID * (*WN.12.03: is replaced by thy from get_met ?FIXME? in:
469 specify (Init_Proof..), nxt_specify_init_calc,
470 assod (.SubProblem...), stac2tac (.SubProblem...)*)
474 fun spec2str ((dom,pbl,met)(*:spec*)) =
475 "(" ^ (quote dom) ^ ", " ^ (strs2str pbl) ^
476 ", " ^ (strs2str met) ^ ")";
477 (*> spec2str empty_spec;
478 val it = "(\"\", [], (\"\", \"\"))" : string *)
479 val empty_spec = (e_domID,e_pblID,e_metID):spec;
480 val e_spec = empty_spec;
482 (*.association list with cas-commands, for generating a complete calc-head.*)
484 (term list -> (* the arguments of the cas-command, eg. (x+1=2, x) *)
485 (term * (* description of an element *)
486 term list) (* value of the element (always put into a list) *)
487 list) (* of elements in the formalization *)
489 (term * (* cas-command, eg. 'solve' *)
490 (spec * (* theory, problem, method *)
492 fun cas_eq ((t1, (_, _)) : cas_elem, (t2, (_, _)) : cas_elem) = t1 = t2
494 (*either theID or pblID or metID*)
495 type kestoreID = string list;
496 val e_kestoreID = ["e_kestoreID"];
497 val kestoreID2str = strs2str;
499 (*for distinction of contexts WN130621: disambiguate with Isabelle's Context !*)
500 datatype ketype = Exp_ | Thy_ | Pbl_ | Met_;
501 fun ketype2str Exp_ = "Exp_"
502 | ketype2str Thy_ = "Thy_"
503 | ketype2str Pbl_ = "Pbl_"
504 | ketype2str Met_ = "Met_";
505 fun ketype2str' Exp_ = "Example"
506 | ketype2str' Thy_ = "Theory"
507 | ketype2str' Pbl_ = "Problem"
508 | ketype2str' Met_ = "Method";
509 fun str2ketype "Exp_" = Exp_
510 | str2ketype "Thy_" = Thy_
511 | str2ketype "Pbl_" = Pbl_
512 | str2ketype "Met_" = Met_
513 | str2ketype str = raise ERROR ("str2ketype: WRONG arg = " ^ str)
514 (* for conversion from XML *)
515 fun str2ketype' "exp" = Exp_
516 | str2ketype' "thy" = Thy_
517 | str2ketype' "pbl" = Pbl_
518 | str2ketype' "met" = Met_
519 | str2ketype' str = raise ERROR ("str2ketype': WRONG arg = " ^ str)
521 (*rewrite orders, also stored in 'type met' and type 'and rls'
522 The association list is required for 'rewrite.."rew_ord"..'
523 WN0509 tests not well-organized: see smltest/Knowledge/termorder.sml*)
524 val rew_ord' = Unsynchronized.ref
525 ([]:(rew_ord' * (*the key for the association list *)
526 (subst (*the bound variables - they get high order*)
527 -> (term * term) (*(t1, t2) to be compared *)
528 -> bool)) (*if t1 <= t2 then true else false *)
529 list); (*association list *)
531 rew_ord' := overwritel (!rew_ord', [("e_rew_ord", e_rew_ord),
532 ("dummy_ord", dummy_ord)]);
535 (* A tree for storing data defined in different theories
536 for access from the Interpreter and from dialogue authoring
537 using a string list as key.
538 'a is for pbt | met | thydata; after WN030424 naming became inappropriate *)
540 Ptyp of string * (* element of the key *)
541 'a list * (* several pbts with different domIDs/thy TODO: select by subthy (isaref.p.69)
542 presently only _ONE_ elem FOR ALL KINDS OF CONTENT pbt | met | thydata *)
543 ('a ptyp) list;(* the children nodes *)
545 (*.datatype for collecting thydata for hierarchy.*)
546 (*WN060720 more consistent naming would be 'type thyelem' or 'thelem'*)
547 (*WN0606 Htxt contains html which does not belong to the sml-kernel*)
548 datatype thydata = Html of {guh: guh,
549 coursedesign: authors,
550 mathauthors: authors,
551 html: string} (*html; for demos before database*)
553 coursedesign: authors,
554 mathauthors: authors,
555 fillpats: fillpat list,
556 thm: thm} (* here no sym_thm, thus no thmID required *)
558 coursedesign: authors,
559 mathauthors: authors,
560 thy_rls: (thyID * rls)}
562 coursedesign: authors,
563 mathauthors: authors,
566 coursedesign: authors,
567 mathauthors: authors,
568 ord: (subst -> (term * term) -> bool)};
569 val e_thydata = Html {guh="e_guh", coursedesign=[], mathauthors=[], html=""};
570 fun the2str (Html {guh, coursedesign, mathauthors, html}) = guh : string
571 | the2str (Hthm {guh, coursedesign, mathauthors, fillpats, thm}) = guh
572 | the2str (Hrls {guh, coursedesign, mathauthors, thy_rls}) = guh
573 | the2str (Hcal {guh, coursedesign, mathauthors, calc}) = guh
574 | the2str (Hord {guh, coursedesign, mathauthors, ord}) = guh
575 fun thes2str thes = map the2str thes |> list2str;
577 (* notes on thehier concerning sym_thmID theorems (created in derivations, reverse rewriting)
578 (a): thehier does not contain sym_thmID theorems
579 (b): lookup for sym_thmID directly from Isabelle using sym_thm
580 (within math-engine NO lookup in thehier -- within java in *.xml only!)
581 TODO (c): export from thehier to xml
582 TODO (c1) creates one entry for "thmID" (and NONE for "sym_thmID") in the hierarchy
583 TODO (c2) creates 2 files "thy_*-thm-thmID.xml" and "thy_*-thm-sym_thmID.xml"
584 TODO (d): 1 entry in the MiniBrowser's hierarchy (generated from xml)
585 stands for both, "thmID" and "sym_thmID"
586 TODO (d1) lookup from calctxt
587 TODO (d1) lookup from from rule set in MiniBrowser *)
588 type thehier = (thydata ptyp) list;
589 (* required to determine sequence of main nodes of thehier in KEStore.thy *)
590 fun part2guh ([str]:theID) =
592 "Isabelle" => "thy_isab_" ^ str ^ "-part" : guh
593 | "IsacScripts" => "thy_scri_" ^ str ^ "-part"
594 | "IsacKnowledge" => "thy_isac_" ^ str ^ "-part"
595 | str => error ("thy2guh: called with '"^str^"'"))
596 | part2guh theID = error ("part2guh called with theID = " ^ theID2str theID);
598 fun thy2guh ([part, thyID] : theID) = (case part of
599 "Isabelle" => "thy_isab_" ^ thyID : guh
600 | "IsacScripts" => "thy_scri_" ^ thyID
601 | "IsacKnowledge" => "thy_isac_" ^ thyID
602 | str => error ("thy2guh: called with '" ^ str ^ "'"))
603 | thy2guh theID = error ("thy2guh called with '" ^ strs2str' theID ^ "'");
605 fun thypart2guh ([part, thyID, thypart] : theID) = case part of
606 "Isabelle" => "thy_isab_" ^ thyID ^ "-" ^ thypart : guh
607 | "IsacScripts" => "thy_scri_" ^ thyID ^ "-" ^ thypart
608 | "IsacKnowledge" => "thy_isac_" ^ thyID ^ "-" ^ thypart
609 | str => error ("thypart2guh: called with '" ^ str ^ "'");
611 (* convert the data got via contextToThy to a globally unique handle
612 there is another way to get the guh out of the 'theID' in the hierarchy *)
613 fun thm2guh (isa, thyID:thyID) (thmID:thmID) = case isa of
614 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID : guh
615 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID
616 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID
617 | str => error ("thm2guh called with isa = '" ^ isa ^ "' for thm = " ^ thmID ^ "'");
619 fun rls2guh (isa, thyID:thyID) (rls':rls') = case isa of
620 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-rls-" ^ rls' : guh
621 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-rls-" ^ rls'
622 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-rls-" ^ rls'
623 | str => error ("rls2guh called with isa = '" ^ isa ^ "' for rls = '" ^ rls' ^ "'");
625 fun cal2guh (isa, thyID:thyID) calID = case isa of
626 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-cal-" ^ calID : guh
627 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-cal-" ^ calID
628 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-cal-" ^ calID
629 | str => error ("cal2guh called with isa = '" ^ isa ^ "' for cal = '" ^ calID ^ "'");
631 fun ord2guh (isa, thyID:thyID) (rew_ord':rew_ord') = case isa of
632 "Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord' : guh
633 | "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord'
634 | "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord'
635 | str => error ("ord2guh called with isa = '" ^ isa ^ "' for ord = '" ^ rew_ord' ^ "'");
637 (* not only for thydata, but also for thy's etc *)
638 fun theID2guh (theID : theID) = case length theID of
639 0 => error ("theID2guh: called with theID = " ^ strs2str' theID)
640 | 1 => part2guh theID
642 | 3 => thypart2guh theID
644 let val [isa, thyID, typ, elemID] = theID
646 "Theorems" => thm2guh (isa, thyID) elemID
647 | "Rulesets" => rls2guh (isa, thyID) elemID
648 | "Calculations" => cal2guh (isa, thyID) elemID
649 | "Orders" => ord2guh (isa, thyID) elemID
650 | "Theorems" => thy2guh [isa, thyID]
651 | str => error ("theID2guh: called with theID = " ^ strs2str' theID)
653 | n => error ("theID2guh called with theID = " ^ strs2str' theID);
656 type filename = string;
658 (*val xxx = fn: a b => (a,b); ??? fun-definition ???*)
660 fun ii (_:term) = e_rrlsstate;
661 fun no (_:term) = SOME (e_term,[e_term]);
662 fun lo (_:rule list list) (_:term) (_:rule) = [(e_rule,(e_term,[e_term]))];
663 fun ne (_:rule list list) (_:term) = SOME e_rule;
664 fun fo (_:rule list list) (_:term) (_:term) = [(e_rule,(e_term,[e_term]))];
666 val e_rfuns = Rfuns {init_state=ii,normal_form=no,locate_rule=lo,
667 next_rule=ne,attach_form=fo};
671 Rls {id = "e_rls", preconds = [], rew_ord = ("dummy_ord", dummy_ord), erls = Erls,
672 srls = Erls, calc = [], rules = [], errpatts = [], scr = EmptyScr}: rls;
674 Rrls {id = "e_rrls", prepat = [], rew_ord = ("dummy_ord", dummy_ord), erls = Erls,
675 calc = [], errpatts = [], scr=e_rfuns}:rls;
677 fun rep_rls (Rls {id,preconds,rew_ord,erls,srls,calc,errpatts,rules,scr}) =
678 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
679 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
680 | rep_rls (Seq {id,preconds,rew_ord,erls,srls,calc,errpatts,rules,scr}) =
681 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
682 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
683 | rep_rls Erls = rep_rls e_rls
684 | rep_rls (Rrls {id,...}) = rep_rls e_rls
685 (*error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id)*);
686 (*| rep_rls (Seq {id,...}) =
687 error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id);
689 fun rep_rrls (Rrls {id, calc, erls, prepat, rew_ord, errpatts,
690 scr = Rfuns {attach_form, init_state, locate_rule, next_rule, normal_form}}) =
691 {id=id, calc=calc, erls=erls, prepat=prepat,
692 rew_ord=rew_ord, errpatts=errpatts, attach_form=attach_form, init_state=init_state,
693 locate_rule=locate_rule, next_rule=next_rule, normal_form=normal_form}
694 | rep_rrls (Rls {id,...}) =
695 error ("rep_rrls doesn't take apart (normal) rule-sets: "^id)
696 | rep_rrls (Seq {id,...}) =
697 error ("rep_rrls doesn't take apart (normal) rule-sets: "^id);
699 fun append_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
700 rules =rs, errpatts=errpatts, scr=sc}) r =
701 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
702 rules = rs @ r, errpatts=errpatts, scr=sc}:rls)
703 | append_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
704 rules =rs, errpatts=errpatts, scr=sc}) r =
705 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
706 rules = rs @ r, errpatts=errpatts, scr=sc}:rls)
707 | append_rls id (Rrls _) _ =
708 error ("append_rls: not for reverse-rewrite-rule-set "^id);
710 (*. are _atomic_ rules equal ?.*)
711 (*WN080102 compare eqrule ?!?*)
712 fun eq_rule (Thm (thm1,_), Thm (thm2,_)) = thm1 = thm2
713 | eq_rule (Calc (id1,_), Calc (id2,_)) = id1 = id2
714 | eq_rule (Rls_ rls1, Rls_ rls2) = id_rls rls1 = id_rls rls2
715 (*id_rls checks for Rls, Seq, Rrls*)
718 fun merge_ids rls1 rls2 =
720 val id1 = (#id o rep_rls) rls1
721 val id2 = (#id o rep_rls) rls2
723 if id1 = id2 then id1
724 else "merged_" ^ id1 ^ "_" ^ id2
726 fun merge_rls _ Erls rls = rls
727 | merge_rls _ rls Erls = rls
728 | merge_rls _ (Rrls x) _ = Rrls x (* required for merging Theory_Data *)
729 | merge_rls _ _ (Rrls x) = Rrls x
731 (Rls {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
732 rules = rs1, errpatts = eps1, scr = sc1, ...})
733 (Rls {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
734 rules = rs2, errpatts = eps2, ...})
736 (Rls {id = id, rew_ord = ro1, scr = sc1,
737 preconds = union (op =) pc1 pc2,
738 erls = merge_rls (merge_ids er1 er2) er1 er2,
739 srls = merge_rls (merge_ids sr1 sr2) sr1 sr2,
740 calc = union calc_eq ca1 ca2,
741 rules = union eq_rule rs1 rs2,
742 errpatts = union (op =) eps1 eps2} : rls)
744 (Seq {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
745 rules = rs1, errpatts = eps1, scr = sc1, ...})
746 (Seq {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
747 rules = rs2, errpatts = eps2, ...})
749 (Seq {id = id, rew_ord = ro1, scr = sc1,
750 preconds = union (op =) pc1 pc2,
751 erls = merge_rls (merge_ids er1 er2) er1 er2,
752 srls = merge_rls (merge_ids sr1 sr2) sr1 sr2,
753 calc = union calc_eq ca1 ca2,
754 rules = union eq_rule rs1 rs2,
755 errpatts = union (op =) eps1 eps2} : rls)
756 | merge_rls id _ _ = error ("merge_rls: \"" ^ id ^
757 "\"; not for reverse-rewrite-rule-sets and not for mixed Rls -- Seq");
759 fun remove_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
760 rules=rs, errpatts=eps, scr=sc}) r =
761 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
762 rules = gen_rems eq_rule (rs, r),
763 errpatts = eps(*gen_rems op= (eps, TODO)*),
765 | remove_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
766 rules =rs, errpatts=eps, scr=sc}) r =
767 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
768 rules = gen_rems eq_rule (rs, r),
769 errpatts = eps(*gen_rems op= (eps, TODO)*),
771 | remove_rls id (Rrls _) _ = error
772 ("remove_rls: not for reverse-rewrite-rule-set "^id);
774 (* datastructure for KEStore_Elems, intermediate for thehier *)
776 (rls' * (* identifier unique within Isac *)
777 (theory' * (* just for assignment in thehier, not appropriate for parsing etc *)
778 rls)) (* ((#id o rep_rls) rls) = rls' by coding discipline *)
779 fun rls_eq ((id1, (_, _)), (id2, (_, _))) = id1 = id2
781 fun insert_merge_rls (re as (id, (thyID, r1)) : rlss_elem) ys =
782 case get_index (fn y => if curry rls_eq re y then SOME y else NONE) ys of
784 | SOME (i, (_, (_, r2))) =>
786 val r12 = merge_rls id r1 r2
787 in list_update ys i (id, (thyID, r12)) end
789 fun merge_rlss (s1, s2) = fold insert_merge_rls s1 s2;
792 fun memrls r (Rls {rules,...}) = gen_mem eqrule (r, rules)
793 | memrls r (Seq {rules,...}) = gen_mem eqrule (r, rules)
794 | memrls r _ = error ("memrls: incomplete impl. r= "^(rule2str r));
796 fun assoc' ([], key) = error ("ME_Isa: '"^key^"' not known")
797 | assoc' ((keyi, xi) :: pairs, key) =
798 if key = keyi then SOME xi else assoc' (pairs, key);
800 fun assoc_thy (thy:theory') =
801 if thy = "e_domID" then (Thy_Info_get_theory "Script") (*lower bound of Knowledge*)
802 else (Thy_Info_get_theory thy)
803 handle _ => error ("ME_Isa: thy '" ^ thy ^ "' not in system");
805 (*.overwrite an element in an association list and pair it with a thyID
806 in order to create the thy_hierarchy;
807 overwrites existing rls' even if they are defined in a different thy;
808 this is related to assoc_rls, TODO.WN060120: assoc_rew_ord, assoc_calc;.*)
809 (*WN060120 ...these are NOT compatible to "fun assoc_thm'" in that
810 they do NOT handle overlays by re-using an identifier in different thys;
811 "thyID.rlsID" would be a good solution, if the "." would be possible
813 actually a hack to get alltogether run again with minimal effort*)
814 fun insthy thy' (rls', rls) = (rls', (thy', rls));
815 fun overwritelthy thy (al, bl:(rls' * rls) list) =
816 let val bl' = map (insthy ((get_thy o theory2theory') thy)) bl
817 in overwritel (al, bl') end;
819 fun assoc_rew_ord ro = ((the o assoc') (!rew_ord',ro))
820 handle _ => error ("ME_Isa: rew_ord '"^ro^"' not in system");
821 (*get the string for stac from rule*)
823 fun subst2str (s:subst) =
825 (map (linefeed o pair2str o
827 (apfst term2str)))) s;
828 fun subst2str' (s:subst) =
832 (apfst term2str)))) s;
833 (*> subst2str' [(str2term "bdv", str2term "x"),
834 (str2term "bdv_2", str2term "y")];
835 val it = "[(bdv, x)]" : string
837 val env2str = subst2str;
841 fun scr2str (Prog s) = "Prog " ^ term2str s
842 | scr2str (Rfuns _) = "Rfuns";
845 fun maxthy thy1 thy2 = if Context.subthy (thy1, thy2) then thy2 else thy1;
848 (* trace internal steps of isac's numeral calculations *)
849 val trace_calc = Unsynchronized.ref false;
850 (*.trace internal steps of isac's rewriter*)
851 val trace_rewrite = Unsynchronized.ref false;
852 (*.depth of recursion in traces of the rewriter, if trace_rewrite:=true.*)
853 val depth = Unsynchronized.ref 99999;
854 (*.no of rewrites exceeding this int -> NO rewrite.*)
855 (*WN060829 still unused...*)
856 val lim_rewrite = Unsynchronized.ref 99999;
857 (*.no of derivation-elements exceeding this int -> SOME derivation-elements.*)
858 val lim_deriv = Unsynchronized.ref 100;
859 (*.switch for checking guhs unique before storing a pbl or met;
860 set true at startup (done at begin of ROOT.ML)
861 set false for editing IsacKnowledge (done at end of ROOT.ML).*)
862 val check_guhs_unique = Unsynchronized.ref true;
865 datatype lrd = (*elements of a path (=loc_) into an Isabelle term*)
867 | R (*go right at $*)
868 | D; (*go down at Abs*)
869 type loc_ = lrd list;
873 fun loc_2str (k:loc_) = (strs2str' o (map ldr2str)) k;
876 (* the pattern for an item of a problems model or a methods guard *)
878 (string * (* field *)
879 (term * (* description *)
880 term)) (* id | arbitrary term *);
881 fun pat2str ((field, (dsc, id)) : pat) =
882 pair2str (field, pair2str (term2str dsc, term2str id))
883 fun pats2str pats = (strs2str o (map pat2str)) pats
885 (* types for problems models (TODO rename to specification models) *)
887 (string * (* field "#Given",..*)(*deprecated due to 'type pat'*)
888 (term * (* description *)
889 term)); (* id | struct-var *)
890 val e_pbt_ = ("#Undef", (e_term, e_term)) : pbt_
892 {guh : guh, (* unique within this isac-knowledge *)
893 mathauthors : string list, (* copyright *)
894 init : pblID, (* to start refinement with *)
895 thy : theory, (* which allows to compile that pbt
896 TODO: search generalized for subthy (ref.p.69*)
897 (*^^^ WN050912 NOT used during application of the problem,
898 because applied terms may be from 'subthy' as well as from super;
899 thus we take 'maxthy'; see match_ags !*)
900 cas : term option, (* 'CAS-command'*)
901 prls : rls, (* for preds in where_*)
902 where_ : term list, (* where - predicates*)
903 ppc : pat list, (* this is the model-pattern;
904 it contains "#Given","#Where","#Find","#Relate"-patterns
905 for constraints on identifiers see "fun cpy_nam" *)
906 met : metID list} (* methods solving the pbt*)
908 val e_pbt = {guh = "pbl_empty", mathauthors = [], init = e_pblID, thy = Thy_Info.get_theory "Pure",
909 cas = NONE, prls = Erls, where_ = [], ppc = [], met = []} : pbt
911 ({cas = cas', guh = guh', init = init', mathauthors = ma', met = met', ppc = ppc',
912 prls = prls', thy = thy', where_ = w'} : pbt) =
913 "{cas = " ^ (termopt2str cas') ^ ", guh = \"" ^ guh' ^ "\", init = "
914 ^ (strs2str init') ^ ", mathauthors = " ^ (strs2str ma' |> quote) ^ ", met = "
915 ^ (strslist2strs met') ^ ", ppc = " ^ pats2str ppc' ^ ", prls = "
916 ^ (rls2str prls' |> quote) ^ ", thy = {" ^ (theory2str thy') ^ "}, where_ = "
917 ^ (terms2str w') ^ "}" |> linefeed;
918 fun pbts2str pbts = map pbt2str pbts |> list2str;
920 val e_Ptyp = Ptyp ("e_pblID",[e_pbt],[])
921 type ptyps = (pbt ptyp) list
923 fun coll_pblguhs pbls =
924 let fun node coll (Ptyp (_,[n],ns)) =
925 [(#guh : pbt -> guh) n] @ (nodes coll ns)
926 and nodes coll [] = coll
927 | nodes coll (n::ns) = (node coll n) @ (nodes coll ns);
928 in nodes [] pbls end;
929 fun check_pblguh_unique (guh:guh) (pbls: (pbt ptyp) list) =
930 if member op = (coll_pblguhs pbls) guh
931 then error ("check_guh_unique failed with '"^guh^"';\n"^
932 "use 'sort_pblguhs()' for a list of guhs;\n"^
933 "consider setting 'check_guhs_unique := false'")
936 fun insrt _ pbt [k] [] = [Ptyp (k, [pbt], [])]
937 | insrt d pbt [k] ((Ptyp (k', [p], ps)) :: pys) =
938 ((*writeln ("### insert 1: ks = " ^ strs2str [k] ^ " k'= " ^ k');*)
940 then ((Ptyp (k', [pbt], ps)) :: pys)
941 else ((Ptyp (k', [p], ps)) :: (insrt d pbt [k] pys))
943 | insrt d pbt (k::ks) ((Ptyp (k', [p], ps))::pys) =
944 ((*writeln ("### insert 2: ks = "^(strs2str (k::ks))^" k'= "^k');*)
946 then ((Ptyp (k', [p], insrt d pbt ks ps)) :: pys)
949 then error ("insert: not found " ^ (strs2str (d : pblID)))
950 else ((Ptyp (k', [p], ps)) :: (insrt d pbt (k :: ks) pys))
953 fun update_ptyps ID _ _ [] =
954 error ("update_ptyps: " ^ strs2str' ID ^ " does not exist")
955 | update_ptyps ID [i] data ((py as Ptyp (key, _, pys)) :: pyss) =
959 then ((Ptyp (key, [data], [])) :: pyss)
960 else error ("update_ptyps: " ^ strs2str' ID ^ " has descendants")
961 else py :: update_ptyps ID [i] data pyss
962 | update_ptyps ID (i :: is) data ((py as Ptyp (key, d, pys)) :: pyss) =
964 then ((Ptyp (key, d, update_ptyps ID is data pys)) :: pyss)
965 else (py :: (update_ptyps ID (i :: is) data pyss))
967 (* this function only works wrt. the way Isabelle evaluates Theories and is not a general merge
968 function for trees / ptyps *)
969 fun merge_ptyps ([], pt) = pt
970 | merge_ptyps (pt, []) = pt
971 | merge_ptyps ((x' as Ptyp (k, x, ps)) :: xs, (xs' as Ptyp (k', y, ps') :: ys)) =
973 then Ptyp (k, y, merge_ptyps (ps, ps')) :: merge_ptyps (xs, ys)
974 else x' :: merge_ptyps (xs, xs');
975 fun merge_ptyps' pt1 pt2 = merge_ptyps (pt1, pt2)
977 (* data for methods stored in 'methods'-database*)
979 {guh : guh, (*unique within this isac-knowledge *)
980 mathauthors: string list,(*copyright *)
981 init : pblID, (*WN060721 introduced mistakenly--TODO.REMOVE!*)
982 rew_ord' : rew_ord', (*for rules in Detail
983 TODO.WN0509 store fun itself, see 'type pbt'*)
984 erls : rls, (*the eval_rls for cond. in rules FIXME "rls'
985 instead erls in "fun prep_met" *)
986 srls : rls, (*for evaluating list expressions in scr *)
987 prls : rls, (*for evaluating predicates in modelpattern *)
988 crls : rls, (*for check_elementwise, ie. formulae in calc.*)
989 nrls : rls, (*canonical simplifier specific for this met *)
990 errpats : errpat list,(*error patterns expected in this method *)
991 calc : calc list, (*Theory_Data in fun prep_met *)
992 (*branch : TransitiveB set in append_problem at generation ob pblobj
993 FIXXXME.0308: set branch from met in Apply_Method ? *)
994 ppc : pat list, (*.items in given, find, relate;
995 items (in "#Find") which need not occur in the arg-list of a SubProblem
996 are 'copy-named' with an identifier "*'.'".
997 copy-named items are 'generating' if they are NOT "*'''" ?WN120516??
998 see ME/calchead.sml 'fun is_copy_named'. *)
999 pre : term list, (*preconditions in where *)
1000 scr : scr (*prep_met gets progam or string "empty_script"*)
1002 val e_met = {guh="met_empty",mathauthors=[],init=e_metID,
1003 rew_ord' = "e_rew_ord'": rew_ord',
1004 erls = e_rls, srls = e_rls, prls = e_rls,
1005 calc = [], crls = e_rls, errpats = [], nrls= e_rls,
1006 ppc = []: (string * (term * term)) list,
1007 pre = []: term list,
1008 scr = EmptyScr: scr}:met;
1011 val e_Mets = Ptyp ("e_metID",[e_met],[]);
1013 type mets = (met ptyp) list;
1015 fun coll_metguhs mets =
1016 let fun node coll (Ptyp (_,[n],ns)) =
1017 [(#guh : met -> guh) n] @ (nodes coll ns)
1018 and nodes coll [] = coll
1019 | nodes coll (n::ns) = (node coll n) @ (nodes coll ns);
1020 in nodes [] mets end;
1022 fun check_metguh_unique (guh:guh) (mets: (met ptyp) list) =
1023 if member op = (coll_metguhs mets) guh
1024 then error ("check_guh_unique failed with '"^guh^"';\n"^
1025 "use 'sort_metguhs()' for a list of guhs;\n"^
1026 "consider setting 'check_guhs_unique := false'")
1029 fun Html_default exist = (Html {guh = theID2guh exist,
1030 coursedesign = ["isac team 2006"], mathauthors = [], html = ""})
1032 fun fill_parents (exist, [i]) thydata = Ptyp (i, [thydata], [])
1033 | fill_parents (exist, i :: is) thydata =
1034 Ptyp (i, [Html_default (exist @ [i])], [fill_parents (exist @ [i], is) thydata])
1035 | fill_parents _ _ = error "Html_default: avoid ML warning: Matches are not exhaustive"
1037 fun add_thydata (exist, is) thydata [] = [fill_parents (exist, is) thydata]
1038 | add_thydata (exist, [i]) data (pys as (py as Ptyp (key, _, _)) :: pyss) =
1040 then pys (* preserve existing thydata *)
1041 else py :: add_thydata (exist, [i]) data pyss
1042 | add_thydata (exist, iss as (i :: is)) data ((py as Ptyp (key, d, pys)) :: pyss) =
1046 then Ptyp (key, d, [fill_parents (exist @ [i], is) data]) :: pyss
1047 else Ptyp (key, d, add_thydata (exist @ [i], is) data pys) :: pyss
1048 else py :: add_thydata (exist, iss) data pyss
1049 | add_thydata _ _ _ = error "add_thydata: avoid ML warning: Matches are not exhaustive"
1051 fun update_hthm (Hthm {guh, coursedesign, mathauthors, thm, ...}) fillpats' =
1052 Hthm {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,
1053 fillpats = fillpats', thm = thm}
1054 | update_hthm _ _ = raise ERROR "wrong data";
1056 (* for interface for dialog-authoring *)
1057 fun update_hrls (Hrls {guh, coursedesign, mathauthors, thy_rls = (thyID, rls)}) errpatIDs =
1061 Rls {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...} =>
1062 Rls {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,
1063 calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}
1064 | Seq {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...} =>
1065 Seq {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,
1066 calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}
1067 | Rrls {id, prepat, rew_ord, erls, calc, scr, ...} =>
1068 Rrls {id = id, prepat = prepat, rew_ord = rew_ord, erls = erls, calc = calc,
1069 scr = scr, errpatts = errpatIDs}
1072 Hrls {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,
1073 thy_rls = (thyID, rls')}
1075 | update_hrls _ _ = raise ERROR "wrong data";
1077 fun app_py p f (d:pblID) (k(*:pblRD*)) = let
1079 error ("app_py: not found: " ^ (strs2str d));
1080 fun app_py' _ [] = py_err ()
1081 | app_py' [] _ = py_err ()
1082 | app_py' [k0] ((p' as Ptyp (k', _, _ ))::ps) =
1083 if k0 = k' then f p' else app_py' [k0] ps
1084 | app_py' (k' as (k0::ks)) (Ptyp (k'', _, ps)::ps') =
1085 if k0 = k'' then app_py' ks ps else app_py' k' ps';
1089 fun extract_py (Ptyp (_, [py], _)) = py
1090 | extract_py _ = error ("extract_py: Ptyp has wrong format.");
1091 in app_py p extract_py end;
1093 fun (*KEStore_Elems.*)insert_fillpats th fis = (* for tests bypassing setup KEStore_Elems *)
1095 fun update_elem th (theID, fillpats) =
1097 val hthm = get_py th theID theID
1098 val hthm' = update_hthm hthm fillpats
1099 handle ERROR _ => error ("insert_fillpats: " ^ strs2str theID ^ "must address a theorem")
1100 in update_ptyps theID theID hthm' end
1101 in fold (update_elem th) fis end
1103 (* group the theories defined in Isac, compare Build_Thydata:
1104 section "Get and group the theories defined in Isac" *)
1105 fun isabthys () = (*["Complex_Main", "Taylor", .., "Pure"]*)
1107 val allthys = Theory.ancestors_of (Thy_Info_get_theory "Build_Thydata")
1109 drop ((find_index (curry Context.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys), allthys)
1111 fun knowthys () = (*["Isac", .., "Descript", "Delete"]*)
1113 fun isacthys () = (* ["Isac", .., "KEStore"] without Build_Isac thys: "Interpret" etc *)
1115 val allthys = filter_out (member Context.eq_thy
1116 [(*Thy_Info_get_theory "ProgLang",*) Thy_Info_get_theory "Interpret",
1117 Thy_Info_get_theory "xmlsrc", Thy_Info_get_theory "Frontend"])
1118 (Theory.ancestors_of (Thy_Info_get_theory "Build_Thydata"))
1120 take ((find_index (curry Context.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys),
1123 val isacthys' = isacthys ()
1124 val proglang_parent = Thy_Info_get_theory "ProgLang"
1126 take ((find_index (curry Context.eq_thy proglang_parent) isacthys'), isacthys')
1128 fun progthys () = (*["Isac", .., "Descript", "Delete"]*)
1130 fun isacthys () = (* ["Isac", .., "KEStore"] without Build_Isac thys: "Interpret" etc *)
1132 val allthys = filter_out (member Context.eq_thy
1133 [(*Thy_Info_get_theory "ProgLang",*) Thy_Info_get_theory "Interpret",
1134 Thy_Info_get_theory "xmlsrc", Thy_Info_get_theory "Frontend"])
1135 (Theory.ancestors_of (Thy_Info_get_theory "Build_Thydata"))
1137 take ((find_index (curry Context.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys),
1140 val isacthys' = isacthys ()
1141 val proglang_parent = Thy_Info_get_theory "ProgLang"
1143 drop ((find_index (curry Context.eq_thy proglang_parent) isacthys') + 1(*ProgLang*), isacthys')
1147 if member Context.eq_thy (knowthys ()) thy then "IsacKnowledge"
1148 else if member Context.eq_thy (progthys ()) thy then "IsacScripts"
1149 else if member Context.eq_thy (isabthys ()) thy then "Isabelle"
1150 else error ("closure of thys in Isac is broken by " ^ string_of_thy thy)
1151 fun partID' (thy' : theory') = partID (Thy_Info_get_theory thy')