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.
14 val linefeed = (curry op^) "\n";
15 type authors = string list;
18 val empty_cterm' = "empty_cterm'";
20 type thm' = thmID * cterm';(*WN060610 deprecated in favour of thm''*)
21 type thm'' = thmID * term;
23 (*.a 'guh'='globally unique handle' is a string unique for each element
24 of isac's KEStore and persistent over time
25 (in particular under shifts within the respective hierarchy);
27 # guh NOT resistant agains shifts from one thy to another
28 (which is the price for Isabelle's design: thy's overwrite ids of subthy's)
29 # requirement for matchTheory: induce guh from tac + current thy
30 (see 'fun thy_containing_thm', 'fun thy_containing_rls' etc.)
31 TODO: introduce to pbl, met.*)
33 val e_guh = "e_guh":guh;
37 (*. eval function calling sml code during rewriting.*)
38 type eval_fn = (string -> term -> theory -> (string * term) option);
39 fun e_evalfn (_:'a) (_:term) (_:theory) = NONE:(string * term) option;
40 (*. op in isa-term 'Const(op,_)' .*)
42 type cal = (calID * eval_fn);
43 (*. fun calculate_ fetches the evaluation-function via this list. *)
45 type calc = (calcID * cal);
47 type subs' = (cterm' * cterm') list; (*16.11.00 for FE-KE*)
48 type subst = (term * term) list; (*here for ets2str*)
49 val e_subst = []:(term * term) list;
51 (*TODO.WN060610 make use of "type rew_ord" total*)
52 type rew_ord' = string;
53 val e_rew_ord' = "e_rew_ord" : rew_ord';
54 type rew_ord_ = subst -> Term.term * Term.term -> bool;
55 fun dummy_ord (_:subst) (_:term,_:term) = true;
56 val e_rew_ord_ = dummy_ord;
57 type rew_ord = rew_ord' * rew_ord_;
58 val e_rew_ord = dummy_ord; (* TODO.WN071231 clarify identifiers..e_rew_ordX*)
59 val e_rew_ordX = (e_rew_ord', e_rew_ord_) : rew_ord;
63 Erule (*.the empty rule .*)
64 | Thm of (string * Basic_Thm.thm)(*.a theorem, ie (identifier, Thm.thm).*)
65 | Calc of string * (*.sml-code manipulating a (sub)term .*)
66 (string -> term -> theory -> (string * term) option)
67 | Cal1 of string * (*.sml-code applied only to whole term
68 or left/right-hand-side of eqality .*)
69 (string -> term -> theory -> (string * term) option)
70 | Rls_ of rls (*.ie. rule sets may be nested.*)
73 | Script of term (*for met*)
74 | Rfuns of {init_state : term ->
75 (term * (*the current formula:
76 goes locate_gen -> next_tac via istate*)
77 term * (*the final formula*)
78 rule list (*of reverse rewrite set (#1#)*)
79 list * (*may be serveral, eg. in norm_rational*)
80 (rule * (*Thm (+ Thm generated from Calc) resulting in ...*)
81 (term * (*... rewrite with ...*)
82 term list)) (*... assumptions*)
83 list), (*derivation from given term to normalform
84 in reverse order with sym_thm;
85 (#1#) could be extracted from here #1*)
87 normal_form: term -> (term * term list) option,
88 locate_rule: rule list list -> term -> rule
89 -> (rule * (term * term list)) list,
90 next_rule : rule list list -> term -> rule option,
91 attach_form: rule list list -> term -> term
92 -> (rule * (term * term list)) list}
95 Erls (*for init e_rls*)
97 | Rls of (*a confluent and terminating ruleset, in general *)
98 {id : string, (*for trace_rewrite:=true *)
99 preconds : term list, (*unused WN020820 *)
100 (*WN060616 for efficiency...
101 bdvs : false, (*set in prep_rls for get_bdvs *)*)
102 rew_ord : rew_ord, (*for rules*)
103 erls : rls, (*for the conditions in rules *)
104 srls : rls, (*for evaluation of list_fns in script *)
105 calc : calc list, (*for Calculate in scr, set by prep_rls *)
107 scr : scr} (*Script term: generating intermed.steps *)
108 | Seq of (*a sequence of rules to be tried only once *)
109 {id : string, (*for trace_rewrite:=true *)
110 preconds : term list, (*unused 20.8.02 *)
111 (*WN060616 for efficiency...
112 bdvs : false, (*set in prep_rls for get_bdvs *)*)
113 rew_ord : rew_ord, (*for rules *)
114 erls : rls, (*for the conditions in rules *)
115 srls : rls, (*for evaluation of list_fns in script *)
116 calc : calc list, (*for Calculate in scr, set by prep_rls *)
118 scr : scr} (*Script term (how to restrict type ???)*)
119 (*Rrls call SML-code and simulate an rls
120 difference: there is always _ONE_ redex rewritten in 1 call,
121 thus wrap Rrls by: Rls (Rls_ ...)*)
123 | Rrls of (* for 'reverse rewriting' by SML-functions instead Script *)
124 {id : string, (* for trace_rewrite := true *)
125 prepat : (term list *(* preconds, eval with subst from pattern;
126 if [HOLogic.true_const], match decides alone *)
127 term ) (* pattern matched with current (sub)term *)
128 list, (* meta-conjunction is or *)
129 rew_ord : rew_ord, (* for rules *)
130 erls : rls, (* for the conditions in rules and preconds *)
131 calc : calc list, (* for Calculate in scr, set automatic.in prep_rls *)
132 scr : scr}; (* Rfuns {...} (how to restrict type ???) *)
133 (*1.8.02 ad (how to restrict type ???): scr should be usable indepentently
134 from rls, and then contain both Script _AND_ Rfuns !!!*)
136 fun thy2ctxt' thy' = ProofContext.init_global (Thy_Info.get_theory thy');(*FIXXXME thy-ctxt*)
137 fun thy2ctxt thy = ProofContext.init_global thy;(*FIXXXME thy-ctxt*)
139 fun Isac _ = ProofContext.theory_of (thy2ctxt' "Isac"); (*@{theory "Isac"}*)
141 val e_rule = Thm ("refl", @{thm refl});
142 fun id_of_thm (Thm (id, _)) = id
143 | id_of_thm _ = error "id_of_thm";
144 fun thm_of_thm (Thm (_, thm)) = thm
145 | thm_of_thm _ = error "thm_of_thm";
146 fun rep_thm_G' (Thm (thmid, thm)) = (thmid, thm);
148 fun thmID_of_derivation_name dn = last_elem (space_explode "." dn);
149 fun thyID_of_derivation_name dn = hd (space_explode "." dn);
151 fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _ : thm)) =
152 (strip_thy thmid1) = (strip_thy thmid2);
153 (*version typed weaker WN100910*)
154 fun eq_thmI' ((thmid1, _), (thmid2, _)) =
155 (thmID_of_derivation_name thmid1) = (thmID_of_derivation_name thmid2);
158 val string_of_thm = Thm.get_name_hint; (*FIXME.2009*)
159 (*check for [.] as caused by "fun assoc_thm'"*)
160 fun string_of_thmI thm =
161 let val ct' = (de_quote o string_of_thm) thm
162 val (a, b) = split_nlast (5, Symbol.explode ct')
164 [" ", " ","[", ".", "]"] => implode a
168 (*.id requested for all, Rls,Seq,Rrls.*)
169 fun id_rls Erls = "e_rls" (*WN060714 quick and dirty: recursive defs!*)
170 | id_rls (Rls {id,...}) = id
171 | id_rls (Seq {id,...}) = id
172 | id_rls (Rrls {id,...}) = id;
173 val rls2str = id_rls;
174 fun id_rule (Thm (id, _)) = id
175 | id_rule (Calc (id, _)) = id
176 | id_rule (Rls_ rls) = id_rls rls;
178 fun get_rules (Rls {rules,...}) = rules
179 | get_rules (Seq {rules,...}) = rules
180 | get_rules (Rrls _) = [];
182 fun rule2str Erule = "Erule"
183 | rule2str (Thm (str, thm)) = "Thm (\""^str^"\","^(string_of_thmI thm)^")"
184 | rule2str (Calc (str,f)) = "Calc (\""^str^"\",fn)"
185 | rule2str (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
186 | rule2str (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
187 fun rule2str' Erule = "Erule"
188 | rule2str' (Thm (str, thm)) = "Thm (\""^str^"\",\"\")"
189 | rule2str' (Calc (str,f)) = "Calc (\""^str^"\",fn)"
190 | rule2str' (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
191 | rule2str' (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
193 (*WN080102 compare eq_rule ?!?*)
194 fun eqrule (Thm (id1,_), Thm (id2,_)) = id1 = id2
195 | eqrule (Calc (id1,_), Calc (id2,_)) = id1 = id2
196 | eqrule (Cal1 (id1,_), Cal1 (id2,_)) = id1 = id2
197 | eqrule (Rls_ _, Rls_ _) = false (*{id=id1}{id=id2} = id1 = id2 FIXXME*)
201 type rrlsstate = (*state for reverse rewriting*)
202 (term * (*the current formula:
203 goes locate_gen -> next_tac via istate*)
204 term * (*the final formula*)
205 rule list (*of reverse rewrite set (#1#)*)
206 list * (*may be serveral, eg. in norm_rational*)
207 (rule * (*Thm (+ Thm generated from Calc) resulting in ...*)
208 (term * (*... rewrite with ...*)
209 term list)) (*... assumptions*)
210 list); (*derivation from given term to normalform
211 in reverse order with sym_thm;
212 (#1#) could be extracted from here #1*)
213 val e_type = Type("empty",[]);
214 val a_type = TFree("'a",[]);
215 val e_term = Const("empty",e_type);
216 val a_term = Free("empty",a_type);
217 val e_rrlsstate = (e_term,e_term,[[e_rule]],[(e_rule,(e_term,[]))]):rrlsstate;
222 (*22.2.02: ging auf Linux nicht (Stefan)
223 val e_scr = Script ((term_of o the o (parse thy)) "e_script");*)
224 val e_term = Const("empty", Type("'a", []));
225 val e_scr = Script e_term;
229 there are two kinds of theorems ...
230 (1) known by isabelle
231 (2) not known, eg. calc_thm, instantiated rls
232 the latter have a thmid "#..."
233 and thus outside isa we ALWAYS transport both (thmid,string_of_thmI)
234 and have a special assoc_thm / assoc_rls in this interface *)
235 type theory' = string; (* = domID ^".thy" WN.101011 ABOLISH !*)
236 type domID = string; (* domID ^".thy" = theory' WN.101011 replace by thyID*)
237 type thyID = string; (*WN.3.11.03 TODO: replace domID with thyID*)
239 fun string_of_thy thy = Context.theory_name thy: theory';
240 val theory2domID = string_of_thy;
241 val theory2thyID = (get_thy o string_of_thy) : theory -> thyID;
242 val theory2theory' = string_of_thy;
243 val theory2str = string_of_thy; (*WN050903 ..most consistent naming*)
244 val theory2str' = implode o (drop_last_n 4) o Symbol.explode o string_of_thy;
245 (*> theory2str' (Thy_Info.get_theory "Isac");
246 al it = "Isac" : string
249 fun thyID2theory' (thyID:thyID) = thyID;
251 let val ss = Symbol.explode thyID
252 val ext = implode (takelast (4, ss))
253 in if ext = ".thy" then thyID : theory' (*disarm abuse of thyID*)
257 (* thyID2theory' "Isac" (*ok*);
258 val it = "Isac" : theory'
259 > thyID2theory' "Isac" (*abuse, goes ok...*);
260 val it = "Isac" : theory'
263 fun theory'2thyID (theory':theory') = theory';
265 let val ss = Symbol.explode theory'
266 val ext = implode (takelast (4, ss))
267 in if ext = ".thy" then ((implode o (drop_last_n 4)) ss) : thyID
268 else theory' (*disarm abuse of theory'*)
271 (* theory'2thyID "Isac";
272 val it = "Isac" : thyID
273 > theory'2thyID "Isac";
274 val it = "Isac" : thyID*)
277 (*. WN0509 discussion:
278 #############################################################################
279 # How to manage theorys in subproblems wrt. the requirement, #
280 # that scripts should be re-usable ? #
281 #############################################################################
283 eg. 'Script Solve_rat_equation' calls 'SubProblem (RatEq',..'
284 which would not allow to 'solve (y'' = -M_b / EI, M_b)' by this script
285 because Biegelinie.thy is subthy of RatEq.thy and thus Biegelinie.M_b
286 is unknown in RatEq.thy and M_b cannot be parsed into the scripts guard
289 Preliminary solution:
290 # the thy in 'SubProblem (thy', pbl, arglist)' is not taken automatically,
291 # instead the 'maxthy (rootthy pt) thy' is taken for each subpbl
292 # however, a thy specified by the user in the rootpbl may lead to
293 errors in far-off subpbls (which are not yet reported properly !!!)
294 and interactively specifiying thys in subpbl is not very relevant.
296 Other solutions possible:
297 # always parse and type-check with Thy_Info.get_theory "Isac"
298 (rejected tue to the vague idea eg. to re-use equations for R in C etc.)
299 # regard the subthy-relation in specifying thys of subpbls
300 # specifically handle 'SubProblem (undefined, pbl, arglist)'
303 (*WN0509 TODO "ProtoPure" ... would be more consistent
304 with assoc_thy <--> theory2theory' +FIXME assoc_thy "e_domID" -> Script.thy*)
305 val e_domID = "e_domID":domID;
307 (*the key into the hierarchy ob theory elements*)
308 type theID = string list;
309 val e_theID = ["e_theID"];
310 val theID2str = strs2str;
311 (*theID eg. is ["IsacKnowledge", "Test", "Rulesets", "ac_plus_times"]*)
312 fun theID2thyID (theID:theID) =
313 if length theID >= 3 then (last_elem o (drop_last_n 2)) theID : thyID
314 else error ("theID2thyID called with "^ theID2str theID);
316 (*the key into the hierarchy ob problems*)
317 type pblID = string list; (* domID::...*)
318 val e_pblID = ["e_pblID"]:pblID;
319 val pblID2str = strs2str;
321 (*the key into the hierarchy ob methods*)
322 type metID = string list;
323 val e_metID = ["e_metID"]:metID;
324 val metID2str = strs2str;
326 (*either theID or pblID or metID*)
327 type kestoreID = string list;
328 val e_kestoreID = ["e_kestoreID"];
329 val kestoreID2str = strs2str;
331 (*for distinction of contexts*)
332 datatype ketype = Exp_ | Thy_ | Pbl_ | Met_;
333 fun ketype2str Exp_ = "Exp_"
334 | ketype2str Thy_ = "Thy_"
335 | ketype2str Pbl_ = "Pbl_"
336 | ketype2str Met_ = "Met_";
337 fun ketype2str' Exp_ = "Example"
338 | ketype2str' Thy_ = "Theory"
339 | ketype2str' Pbl_ = "Problem"
340 | ketype2str' Met_ = "Method";
342 (*see 'How to manage theorys in subproblems' at 'type thyID'*)
343 val theory' = Unsynchronized.ref ([]:(theory' * theory) list);
345 (*.all theories defined for Scripts, recorded in Scripts/Script.ML;
346 in order to distinguish them from general IsacKnowledge defined later on.*)
347 val script_thys = Unsynchronized.ref ([] : (theory' * theory) list);
350 (*rewrite orders, also stored in 'type met' and type 'and rls'
351 The association list is required for 'rewrite.."rew_ord"..'
352 WN0509 tests not well-organized: see smltest/Knowledge/termorder.sml*)
355 ([]:(rew_ord' * (*the key for the association list *)
356 (subst (*the bound variables - they get high order*)
357 -> (term * term) (*(t1, t2) to be compared *)
358 -> bool)) (*if t1 <= t2 then true else false *)
359 list); (*association list *)
361 rew_ord' := overwritel (!rew_ord', [("e_rew_ord", e_rew_ord),
362 ("dummy_ord", dummy_ord)]);
365 (*WN060120 a hack to get alltogether run again with minimal effort:
366 theory' is inserted for creating thy_hierarchy; calls for assoc_rls
368 val ruleset' = Unsynchronized.ref ([]:(rls' * (theory' * rls)) list);
370 (*FIXME.040207 calclist': used by prep_rls, NOT in met*)
371 val calclist'= Unsynchronized.ref ([]: calc list);
373 (*.the hierarchy of thydata.*)
375 (*.'a is for pbt | met.*)
376 (*WN.24.4.03 -"- ... type parameters; afterwards naming inconsistent*)
378 Ptyp of string * (*element within pblID*)
379 'a list * (*several pbts with different domIDs/thy
380 TODO: select by subthy (isaref.p.69)
381 presently only _ONE_ elem*)
382 ('a ptyp) list; (*the children nodes*)
384 (*.datatype for collecting thydata for hierarchy.*)
385 (*WN060720 more consistent naming would be 'type thyelem' or 'thelem'*)
386 (*WN0606 Htxt contains html which does not belong to the sml-kernel*)
387 datatype thydata = Html of {guh: guh,
388 coursedesign: authors,
389 mathauthors: authors,
390 html: string} (*html; for demos before database*)
392 coursedesign: authors,
393 mathauthors: authors,
396 coursedesign: authors,
397 mathauthors: authors,
398 (*like vvvvvvvvvvvvv val ruleset'
399 WN060711 redesign together !*)
400 thy_rls: (thyID * rls)}
402 coursedesign: authors,
403 mathauthors: authors,
406 coursedesign: authors,
407 mathauthors: authors,
408 ord: (subst -> (term * term) -> bool)};
409 val e_thydata = Html {guh="e_guh", coursedesign=[], mathauthors=[], html=""};
411 type thehier = (thydata ptyp) list;
412 val thehier = Unsynchronized.ref ([] : thehier); (*WN101011 make argument, del*)
414 (* an association list, gets the value once in Isac.ML.
415 stores Isabelle's thms as terms for compatibility with Theory.axioms_of.
416 WN1-1-28 make this data arguments and del ref ?*)
417 val isab_thm_thy = Unsynchronized.ref ([] : (thmID * (thyID * term)) list);
421 type filename = string;
423 (*val xxx = fn: a b => (a,b); ??? fun-definition ???*)
425 fun ii (_:term) = e_rrlsstate;
426 fun no (_:term) = SOME (e_term,[e_term]);
427 fun lo (_:rule list list) (_:term) (_:rule) = [(e_rule,(e_term,[e_term]))];
428 fun ne (_:rule list list) (_:term) = SOME e_rule;
429 fun fo (_:rule list list) (_:term) (_:term) = [(e_rule,(e_term,[e_term]))];
431 val e_rfuns = Rfuns {init_state=ii,normal_form=no,locate_rule=lo,
432 next_rule=ne,attach_form=fo};
438 rew_ord = ("dummy_ord", dummy_ord),
439 erls = Erls,srls = Erls,
441 rules = [], scr = EmptyScr}:rls;
442 val e_rrls = Rrls {id = "e_rrls",
444 rew_ord = ("dummy_ord", dummy_ord),
449 ruleset' := overwritel (!ruleset', [("e_rls",("Tools",e_rls)),
450 ("e_rrls",("Tools",e_rrls))
453 fun rep_rls (Rls {id,preconds,rew_ord,erls,srls,calc,(*asm_thm,*)rules,scr}) =
454 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
455 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
456 | rep_rls (Seq {id,preconds,rew_ord,erls,srls,calc,(*asm_thm,*)rules,scr}) =
457 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
458 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
459 | rep_rls Erls = rep_rls e_rls
460 | rep_rls (Rrls {id,...}) = rep_rls e_rls
461 (*error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id)*);
462 (*| rep_rls (Seq {id,...}) =
463 error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id);
466 (Rrls {id,(*asm_thm,*) calc, erls, prepat, rew_ord,
468 {attach_form,init_state,locate_rule,
469 next_rule,normal_form}}) =
470 {id=id,(*asm_thm=asm_thm,*) calc=calc, erls=erls, prepat=prepat,
471 rew_ord=rew_ord, attach_form=attach_form, init_state=init_state,
472 locate_rule=locate_rule, next_rule=next_rule, normal_form=normal_form}
473 | rep_rrls (Rls {id,...}) =
474 error ("rep_rrls doesn't take apart (normal) rule-sets: "^id)
475 | rep_rrls (Seq {id,...}) =
476 error ("rep_rrls doesn't take apart (normal) rule-sets: "^id);
478 fun append_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
479 rules =rs,scr=sc}) r =
480 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
481 rules = rs @ r,scr=sc}:rls)
482 | append_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
483 rules =rs,scr=sc}) r =
484 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
485 rules = rs @ r,scr=sc}:rls)
486 | append_rls id (Rrls _) _ =
487 error ("append_rls: not for reverse-rewrite-rule-set "^id);
489 (*. are _atomic_ rules equal ?.*)
490 (*WN080102 compare eqrule ?!?*)
491 fun eq_rule (Thm (thm1,_), Thm (thm2,_)) = thm1 = thm2
492 | eq_rule (Calc (id1,_), Calc (id2,_)) = id1 = id2
493 | eq_rule (Rls_ rls1, Rls_ rls2) = id_rls rls1 = id_rls rls2
494 (*id_rls checks for Rls, Seq, Rrls*)
497 fun merge_rls _ Erls rls = rls
498 | merge_rls _ rls Erls = rls
500 (Rls {id=id1,preconds=pc1,rew_ord=ro1,erls=er1,srls=sr1,calc=ca1,
501 (*asm_thm=at1,*)rules =rs1,scr=sc1})
502 (r2 as Rls {id=id2,preconds=pc2,rew_ord=ro2,erls=er2,srls=sr2,calc=ca2,
503 (*asm_thm=at2,*)rules =rs2,scr=sc2}) =
504 (Rls {id=id,preconds=pc1 @ ((#preconds o rep_rls) r2),
505 rew_ord=ro1,erls=merge_rls "" er1 er2(*er1*),
506 srls=merge_rls ("merged_"^id1^"_"^((#id o rep_rls) r2)) sr1
507 ((#srls o rep_rls) r2),
508 calc=ca1 @ ((#calc o rep_rls) r2),
509 (*asm_thm=at1 @ ((#asm_thm o rep_rls) r2),*)
510 rules = gen_union eq_rule rule2str (rs1, (#rules o rep_rls) r2),
513 (Seq {id=id1,preconds=pc1,rew_ord=ro1,erls=er1,srls=sr1,calc=ca1,
514 (*asm_thm=at1,*)rules =rs1,scr=sc1})
515 (r2 as Seq {id=id2,preconds=pc2,rew_ord=ro2,erls=er2,srls=sr2,calc=ca2,
516 (*asm_thm=at2,*)rules =rs2,scr=sc2}) =
517 (Seq {id=id,preconds=pc1 @ ((#preconds o rep_rls) r2),
518 rew_ord=ro1,erls=merge_rls "" er1 er2(*er1*),
519 srls=merge_rls ("merged_"^id1^"_"^((#id o rep_rls) r2)) sr1
520 ((#srls o rep_rls) r2),
521 calc=ca1 @ ((#calc o rep_rls) r2),
522 (*asm_thm=at1 @ ((#asm_thm o rep_rls) r2),*)
523 rules = gen_union eq_rule rule2str (rs1, (#rules o rep_rls) r2),
526 error "merge_rls: not for reverse-rewrite-rule-sets\
527 \and not for mixed Rls -- Seq";
528 fun remove_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
529 (*asm_thm=at,*)rules =rs,scr=sc}) r =
530 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
531 (*asm_thm=at,*)rules = gen_rems eq_rule (rs, r),
533 | remove_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
534 (*asm_thm=at,*)rules =rs,scr=sc}) r =
535 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
536 (*asm_thm=at,*)rules = gen_rems eq_rule (rs, r),
538 | remove_rls id (Rrls _) _ = error
539 ("remove_rls: not for reverse-rewrite-rule-set "^id);
541 (*!!!> gen_rems (op=) ([1,2,3,4], [3,4,5]);
542 val it = [1, 2] : int list*)
544 (*elder version: migrated 3 calls in smtest to memrls
546 case find_first ((curry op=) id) (map id_rule ((#rules o rep_rls) rls)) of
547 SOME _ => true | NONE => false;*)
548 fun memrls r (Rls {rules,...}) = gen_mem eqrule (r, rules)
549 | memrls r (Seq {rules,...}) = gen_mem eqrule (r, rules)
550 | memrls r _ = error ("memrls: incomplete impl. r= "^(rule2str r));
551 fun rls_get_thm rls (id: xstring) =
552 case find_first (curry eq_rule e_rule)
553 ((#rules o rep_rls) rls) of
554 SOME thm => SOME thm | NONE => NONE;
556 fun assoc' ([], key) = error ("ME_Isa: '"^key^"' not known")
557 | assoc' ((keyi, xi) :: pairs, key) =
558 if key = keyi then SOME xi else assoc' (pairs, key);
560 (*100818 fun assoc_thy (thy:theory') = ((the o assoc')(!theory',thy))
561 handle _ => error ("ME_Isa: thy '"^thy^"' not in system");*)
562 fun assoc_thy (thy:theory') =
563 if thy = "e_domID" then (Thy_Info.get_theory "Script") (*lower bound of Knowledge*)
564 else (Thy_Info.get_theory thy)
565 handle _ => error ("ME_Isa: thy '" ^ thy ^ "' not in system");
567 (*.associate an rls-identifier with an rls; related to 'fun assoc_rls'; WN111014?fun get_rls ?
568 these are NOT compatible to "fun assoc_thm'" in that they do NOT handle
569 overlays by re-using an identifier in different thys.*)
570 fun assoc_rls (rls:rls') = ((#2 o the o assoc')(!ruleset',rls))
571 handle _ => error ("ME_Isa: '"^rls^"' not in system");
572 (*fun assoc_rls (rls:rls') = ((the o assoc')(!ruleset',rls))
573 handle _ => error ("ME_Isa: '"^rls^"' not in system");*)
575 (*.overwrite an element in an association list and pair it with a thyID
576 in order to create the thy_hierarchy;
577 overwrites existing rls' even if they are defined in a different thy;
578 this is related to assoc_rls, TODO.WN060120: assoc_rew_ord, assoc_calc;.*)
579 (*WN060120 ...these are NOT compatible to "fun assoc_thm'" in that
580 they do NOT handle overlays by re-using an identifier in different thys;
581 "thyID.rlsID" would be a good solution, if the "." would be possible
583 actually a hack to get alltogether run again with minimal effort*)
584 fun insthy thy' (rls', rls) = (rls', (thy', rls));
585 fun overwritelthy thy (al, bl:(rls' * rls) list) =
586 let val bl' = map (insthy ((get_thy o theory2theory') thy)) bl
587 in overwritel (al, bl') end;
589 fun assoc_rew_ord ro = ((the o assoc') (!rew_ord',ro))
590 handle _ => error ("ME_Isa: rew_ord '"^ro^"' not in system");
591 (*get the string for stac from rule*)
592 fun assoc_calc ([], key) = error ("assoc_calc: '"^ key ^"' not found")
593 | assoc_calc ((calc, (keyi, xi)) :: pairs, key) =
594 if key = keyi then calc else assoc_calc (pairs, key);
595 (*only used for !calclist'...*)
596 fun assoc1 ([], key) = error ("assoc1 (for met.calc=): '"^ key
598 | assoc1 ((all as (keyi, _)) :: pairs, key) =
599 if key = keyi then all else assoc1 (pairs, key);
601 (*TODO.WN080102 clarify usage of type cal and type calc..*)
602 fun calID2calcID (calID : calID) =
603 let fun ass [] = error ("calID2calcID: "^calID^"not in calclist'")
604 | ass ((calci, (cali, eval_fn))::ids) =
605 if calID = cali then calci
607 in ass (!calclist') : calcID end;
609 fun term2str t = Print_Mode.setmp [] (Syntax.string_of_term
610 (ProofContext.init_global (Thy_Info.get_theory "Isac"))) t;
612 fun terms2str ts = (strs2str o (map term2str )) ts;
613 (*terms2str [t1,t2] = "[\"1 + 2\",\"abc\"]";*)
614 fun terms2str' ts = (strs2str' o (map term2str )) ts;
615 (*terms2str' [t1,t2] = "[1 + 2,abc]";*)
616 fun terms2strs ts = (map term2str) ts;
617 (*terms2strs [t1,t2] = ["1 + 2", "abc"];*)
619 fun termopt2str (SOME t) = "SOME " ^ term2str t
620 | termopt2str NONE = "NONE";
623 Print_Mode.setmp [] (Syntax.string_of_typ (thy2ctxt' "Isac")) typ;
624 val string_of_typ = type2str;
626 fun subst2str (s:subst) =
628 (map (linefeed o pair2str o
630 (apfst term2str)))) s;
631 fun subst2str' (s:subst) =
635 (apfst term2str)))) s;
636 (*> subst2str' [(str2term "bdv", str2term "x"),
637 (str2term "bdv_2", str2term "y")];
638 val it = "[(bdv, x)]" : string
640 val env2str = subst2str;
644 fun scr2str (Script s) = "Script "^(term2str s)
645 | scr2str (Rfuns _) = "Rfuns";
648 fun maxthy thy1 thy2 = if Theory.subthy (thy1, thy2) then thy2 else thy1;
651 (*.trace internal steps of isac's rewriter*)
652 val trace_rewrite = Unsynchronized.ref false;
653 (*.depth of recursion in traces of the rewriter, if trace_rewrite:=true.*)
654 val depth = Unsynchronized.ref 99999;
655 (*.no of rewrites exceeding this int -> NO rewrite.*)
656 (*WN060829 still unused...*)
657 val lim_rewrite = Unsynchronized.ref 99999;
658 (*.no of derivation-elements exceeding this int -> SOME derivation-elements.*)
659 val lim_deriv = Unsynchronized.ref 100;
660 (*.switch for checking guhs unique before storing a pbl or met;
661 set true at startup (done at begin of ROOT.ML)
662 set false for editing IsacKnowledge (done at end of ROOT.ML).*)
663 val check_guhs_unique = Unsynchronized.ref true;
666 datatype lrd = (*elements of a path (=loc_) into an Isabelle term*)
668 | R (*go right at $*)
669 | D; (*go down at Abs*)
670 type loc_ = lrd list;
674 fun loc_2str (k:loc_) = (strs2str' o (map ldr2str)) k;