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.
12 val linefeed = (curry op^) "\n";
13 type authors = string list;
16 val empty_cterm' = "empty_cterm'";
18 type thm' = thmID * cterm';(*WN060610 deprecated in favour of thm''*)
19 type thm'' = thmID * term;
21 (*.a 'guh'='globally unique handle' is a string unique for each element
22 of isac's KEStore and persistent over time
23 (in particular under shifts within the respective hierarchy);
25 # guh NOT resistant agains shifts from one thy to another
26 (which is the price for Isabelle's design: thy's overwrite ids of subthy's)
27 # requirement for matchTheory: induce guh from tac + current thy
28 (see 'fun thy_containing_thm', 'fun thy_containing_rls' etc.)
29 TODO: introduce to pbl, met.*)
31 val e_guh = "e_guh":guh;
35 (*. eval function calling sml code during rewriting.*)
36 type eval_fn = (string -> term -> theory -> (string * term) option);
37 fun e_evalfn (_:'a) (_:term) (_:theory) = NONE:(string * term) option;
38 (*. op in isa-term 'Const(op,_)' .*)
40 type cal = (calID * eval_fn);
41 (*. fun calculate_ fetches the evaluation-function via this list. *)
43 type calc = (calcID * cal);
45 type subs' = (cterm' * cterm') list; (*16.11.00 for FE-KE*)
46 type subst = (term * term) list; (*here for ets2str*)
47 val e_subst = []:(term * term) list;
49 (*TODO.WN060610 make use of "type rew_ord" total*)
50 type rew_ord' = string;
51 val e_rew_ord' = "e_rew_ord" : rew_ord';
52 type rew_ord_ = subst -> Term.term * Term.term -> bool;
53 fun dummy_ord (_:subst) (_:term,_:term) = true;
54 val e_rew_ord_ = dummy_ord;
55 type rew_ord = rew_ord' * rew_ord_;
56 val e_rew_ord = dummy_ord; (* TODO.WN071231 clarify identifiers..e_rew_ordX*)
57 val e_rew_ordX = (e_rew_ord', e_rew_ord_) : rew_ord;
61 Erule (*.the empty rule .*)
62 | Thm of (string * thm)(*.a theorem, ie (identifier, Thm.thm).*)
63 | Calc of string * (*.sml-code manipulating a (sub)term .*)
64 (string -> term -> theory -> (string * term) option)
65 | Cal1 of string * (*.sml-code applied only to whole term
66 or left/right-hand-side of eqality .*)
67 (string -> term -> theory -> (string * term) option)
68 | Rls_ of rls (*.ie. rule sets may be nested.*)
71 | Script of term (*for met*)
72 | Rfuns of {init_state : term ->
73 (term * (*the current formula:
74 goes locate_gen -> next_tac via istate*)
75 term * (*the final formula*)
76 rule list (*of reverse rewrite set (#1#)*)
77 list * (*may be serveral, eg. in norm_rational*)
78 (rule * (*Thm (+ Thm generated from Calc) resulting in ...*)
79 (term * (*... rewrite with ...*)
80 term list)) (*... assumptions*)
81 list), (*derivation from given term to normalform
82 in reverse order with sym_thm;
83 (#1#) could be extracted from here #1*)
85 normal_form: term -> (term * term list) option,
86 locate_rule: rule list list -> term -> rule
87 -> (rule * (term * term list)) list,
88 next_rule : rule list list -> term -> rule option,
89 attach_form: rule list list -> term -> term
90 -> (rule * (term * term list)) list}
92 Erls (*for init e_rls*)
94 | Rls of (*a confluent and terminating ruleset, in general *)
95 {id : string, (*for trace_rewrite:=true *)
96 preconds : term list, (*unused WN020820 *)
97 (*WN060616 for efficiency...
98 bdvs : false, (*set in prep_rls for get_bdvs *)*)
99 rew_ord : rew_ord, (*for rules*)
100 erls : rls, (*for the conditions in rules *)
101 srls : rls, (*for evaluation of list_fns in script *)
102 calc : calc list, (*for Calculate in scr, set by prep_rls *)
104 scr : scr} (*Script term: generating intermed.steps *)
105 | Seq of (*a sequence of rules to be tried only once *)
106 {id : string, (*for trace_rewrite:=true *)
107 preconds : term list, (*unused 20.8.02 *)
108 (*WN060616 for efficiency...
109 bdvs : false, (*set in prep_rls for get_bdvs *)*)
110 rew_ord : rew_ord, (*for rules *)
111 erls : rls, (*for the conditions in rules *)
112 srls : rls, (*for evaluation of list_fns in script *)
113 calc : calc list, (*for Calculate in scr, set by prep_rls *)
115 scr : scr} (*Script term (how to restrict type ???)*)
116 (*Rrls call SML-code and simulate an rls
117 difference: there is always _ONE_ redex rewritten in 1 call,
118 thus wrap Rrls by: Rls (Rls_ ...)*)
120 | Rrls of (*for 'reverse rewriting' by SML-functions instead Script*)
121 {id : string, (*for trace_rewrite:=true *)
122 prepat : (term list *(*preconds, eval with subst from pattern *)
123 term ) (*pattern matched in subterms *)
124 list, (*meta-conjunction is or *)
125 rew_ord : rew_ord, (*for rules *)
126 erls : rls, (*for the conditions in rules and pat *)
127 (* '^ because of rewrite in applicable_in
129 calc : calc list, (*for Calculate in scr, set by prep_rls *)
130 scr : scr}; (*Rfuns {...} (how to restrict type ???)*)
131 (*1.8.02 ad (how to restrict type ???): scr should be usable indepentently
132 from rls, and then contain both Script _AND_ Rfuns !!!*)
134 fun thy2ctxt' thy' = ProofContext.init_global (theory thy');(*FIXXXME thy-ctxt*)
135 fun thy2ctxt thy = ProofContext.init_global thy;(*FIXXXME thy-ctxt*)
137 (*ctxt for retrieval of all thms in HOL; FIXME make this local?*)
138 (*val ctxt_HOL = ProofContext.init_global (theory "Complex_Main");*)
139 (*val ctxt_HOL = thy2ctxt' "Complex_Main";*)
140 (*lazy ctxt for retrieval of all thms used in isac; FIXME make this local?*)
141 (*fun ctxt_Isac _ = thy2ctxt' "Isac";*)
142 fun Isac _ = ProofContext.theory_of (thy2ctxt' "Isac");
145 Thm ("refl", ProofContext.get_thm (thy2ctxt' "Complex_Main") "refl" );
146 fun id_of_thm (Thm (id, _)) = id
147 | id_of_thm _ = raise error "id_of_thm";
148 fun thm_of_thm (Thm (_, thm)) = thm
149 | thm_of_thm _ = raise error "thm_of_thm";
150 fun rep_thm_G' (Thm (thmid, thm)) = (thmid, thm);
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 (strip_thy thmid1) = (strip_thy 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, 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" *)
236 type domID = string; (* domID ^".thy" = theory' TODO.11.03replace 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 explode o string_of_thy;
245 (*> theory2str' Isac.thy;
246 al it = "Isac" : string
249 fun thyID2theory' (thyID:thyID) =
250 let val ss = explode thyID
251 val ext = implode (takelast (4, ss))
252 in if ext = ".thy" then thyID : theory' (*disarm abuse of thyID*)
255 (* thyID2theory' "Isac" (*ok*);
256 val it = "Isac.thy" : theory'
257 > thyID2theory' "Isac.thy" (*abuse, goes ok...*);
258 val it = "Isac.thy" : theory'
261 fun theory'2thyID (theory':theory') =
262 let val ss = explode theory'
263 val ext = implode (takelast (4, ss))
264 in if ext = ".thy" then ((implode o (drop_last_n 4)) ss) : thyID
265 else theory' (*disarm abuse of theory'*)
267 (* theory'2thyID "Isac.thy";
268 val it = "Isac" : thyID
269 > theory'2thyID "Isac";
270 val it = "Isac" : thyID*)
273 (*. WN0509 discussion:
274 #############################################################################
275 # How to manage theorys in subproblems wrt. the requirement, #
276 # that scripts should be re-usable ? #
277 #############################################################################
279 eg. 'Script Solve_rat_equation' calls 'SubProblem (RatEq',..'
280 which would not allow to 'solve (y'' = -M_b / EI, M_b)' by this script
281 because Biegelinie.thy is subthy of RatEq.thy and thus Biegelinie.M_b
282 is unknown in RatEq.thy and M_b cannot be parsed into the scripts guard
285 Preliminary solution:
286 # the thy in 'SubProblem (thy_, pbl, arglist)' is not taken automatically,
287 # instead the 'maxthy (rootthy pt) thy_' is taken for each subpbl
288 # however, a thy specified by the user in the rootpbl may lead to
289 errors in far-off subpbls (which are not yet reported properly !!!)
290 and interactively specifiying thys in subpbl is not very relevant.
292 Other solutions possible:
293 # always parse and type-check with Isac.thy
294 (rejected tue to the vague idea eg. to re-use equations for R in C etc.)
295 # regard the subthy-relation in specifying thys of subpbls
296 # specifically handle 'SubProblem (undefined_, pbl, arglist)'
299 (*WN0509 TODO "ProtoPure" ... would be more consistent
300 with assoc_thy <--> theory2theory' +FIXME assoc_thy "e_domID" -> Script.thy*)
301 val e_domID = "e_domID":domID;
303 (*the key into the hierarchy ob theory elements*)
304 type theID = string list;
305 val e_theID = ["e_theID"];
306 val theID2str = strs2str;
307 (*theID eg. is ["IsacKnowledge", "Test", "Rulesets", "ac_plus_times"]*)
308 fun theID2thyID (theID:theID) =
309 if length theID >= 3 then (last_elem o (drop_last_n 2)) theID : thyID
310 else raise error ("theID2thyID called with "^ theID2str theID);
312 (*the key into the hierarchy ob problems*)
313 type pblID = string list; (* domID::...*)
314 val e_pblID = ["e_pblID"]:pblID;
315 val pblID2str = strs2str;
317 (*the key into the hierarchy ob methods*)
318 type metID = string list;
319 val e_metID = ["e_metID"]:metID;
320 val metID2str = strs2str;
322 (*either theID or pblID or metID*)
323 type kestoreID = string list;
324 val e_kestoreID = ["e_kestoreID"];
325 val kestoreID2str = strs2str;
327 (*for distinction of contexts*)
328 datatype ketype = Exp_ | Thy_ | Pbl_ | Met_;
329 fun ketype2str Exp_ = "Exp_"
330 | ketype2str Thy_ = "Thy_"
331 | ketype2str Pbl_ = "Pbl_"
332 | ketype2str Met_ = "Met_";
333 fun ketype2str' Exp_ = "Example"
334 | ketype2str' Thy_ = "Theory"
335 | ketype2str' Pbl_ = "Problem"
336 | ketype2str' Met_ = "Method";
338 (*see 'How to manage theorys in subproblems' at 'type thyID'*)
339 val theory' = Unsynchronized.ref ([]:(theory' * theory) list);
341 (*.all theories defined for Scripts, recorded in Scripts/Script.ML;
342 in order to distinguish them from general IsacKnowledge defined later on.*)
343 val script_thys = Unsynchronized.ref ([] : (theory' * theory) list);
346 (*rewrite orders, also stored in 'type met' and type 'and rls'
347 The association list is required for 'rewrite.."rew_ord"..'
348 WN0509 tests not well-organized: see smltest/Knowledge/termorder.sml*)
350 ref ([]:(rew_ord' * (*the key for the association list *)
351 (subst (*the bound variables - they get high order*)
352 -> (term * term) (*(t1, t2) to be compared *)
353 -> bool)) (*if t1 <= t2 then true else false *)
354 list); (*association list *)
355 rew_ord' := overwritel (!rew_ord', [("e_rew_ord", e_rew_ord),
356 ("dummy_ord", dummy_ord)]);
359 (*WN060120 a hack to get alltogether run again with minimal effort:
360 theory' is inserted for creating thy_hierarchy; calls for assoc_rls
362 val ruleset' = Unsynchronized.ref ([]:(rls' * (theory' * rls)) list);
364 (*FIXME.040207 calclist': used by prep_rls, NOT in met*)
365 val calclist'= Unsynchronized.ref ([]: calc list);
367 (*.the hierarchy of thydata.*)
369 (*.'a is for pbt | met.*)
370 (*WN.24.4.03 -"- ... type parameters; afterwards naming inconsistent*)
372 Ptyp of string * (*element within pblID*)
373 'a list * (*several pbts with different domIDs/thy
374 TODO: select by subthy (isaref.p.69)
375 presently only _ONE_ elem*)
376 ('a ptyp) list; (*the children nodes*)
378 (*.datatype for collecting thydata for hierarchy.*)
379 (*WN060720 more consistent naming would be 'type thyelem' or 'thelem'*)
380 (*WN0606 Htxt contains html which does not belong to the sml-kernel*)
381 datatype thydata = Html of {guh: guh,
382 coursedesign: authors,
383 mathauthors: authors,
384 html: string} (*html; for demos before database*)
386 coursedesign: authors,
387 mathauthors: authors,
390 coursedesign: authors,
391 mathauthors: authors,
392 (*like vvvvvvvvvvvvv val ruleset'
393 WN060711 redesign together !*)
394 thy_rls: (thyID * rls)}
396 coursedesign: authors,
397 mathauthors: authors,
400 coursedesign: authors,
401 mathauthors: authors,
402 ord: (subst -> (term * term) -> bool)};
403 val e_thydata = Html {guh="e_guh", coursedesign=[], mathauthors=[], html=""};
405 type thehier = (thydata ptyp) list;
406 val thehier = Unsynchronized.ref ([] : thehier);
408 (*.an association list, gets the value once in Isac.ML.*)
409 val isab_thm_thy = Unsynchronized.ref ([] : (thmID * (thyID * term)) list);
413 type filename = string;
415 (*val xxx = fn: a b => (a,b); ??? fun-definition ???*)
417 fun ii (_:term) = e_rrlsstate;
418 fun no (_:term) = SOME (e_term,[e_term]);
419 fun lo (_:rule list list) (_:term) (_:rule) = [(e_rule,(e_term,[e_term]))];
420 fun ne (_:rule list list) (_:term) = SOME e_rule;
421 fun fo (_:rule list list) (_:term) (_:term) = [(e_rule,(e_term,[e_term]))];
423 val e_rfuns = Rfuns {init_state=ii,normal_form=no,locate_rule=lo,
424 next_rule=ne,attach_form=fo};
430 rew_ord = ("dummy_ord", dummy_ord),
431 erls = Erls,srls = Erls,
433 rules = [], scr = EmptyScr}:rls;
434 val e_rrls = Rrls {id = "e_rrls",
436 rew_ord = ("dummy_ord", dummy_ord),
441 ruleset' := overwritel (!ruleset', [("e_rls",("Tools",e_rls)),
442 ("e_rrls",("Tools",e_rrls))
445 fun rep_rls (Rls {id,preconds,rew_ord,erls,srls,calc,(*asm_thm,*)rules,scr}) =
446 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
447 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
448 | rep_rls (Seq {id,preconds,rew_ord,erls,srls,calc,(*asm_thm,*)rules,scr}) =
449 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
450 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
451 | rep_rls Erls = rep_rls e_rls
452 | rep_rls (Rrls {id,...}) = rep_rls e_rls
453 (*raise error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id)*);
454 (*| rep_rls (Seq {id,...}) =
455 raise error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id);
458 (Rrls {id,(*asm_thm,*) calc, erls, prepat, rew_ord,
460 {attach_form,init_state,locate_rule,
461 next_rule,normal_form}}) =
462 {id=id,(*asm_thm=asm_thm,*) calc=calc, erls=erls, prepat=prepat,
463 rew_ord=rew_ord, attach_form=attach_form, init_state=init_state,
464 locate_rule=locate_rule, next_rule=next_rule, normal_form=normal_form}
465 | rep_rrls (Rls {id,...}) =
466 raise error ("rep_rrls doesn't take apart (normal) rule-sets: "^id)
467 | rep_rrls (Seq {id,...}) =
468 raise error ("rep_rrls doesn't take apart (normal) rule-sets: "^id);
470 fun append_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
471 rules =rs,scr=sc}) r =
472 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
473 rules = rs @ r,scr=sc}:rls)
474 | append_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
475 rules =rs,scr=sc}) r =
476 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
477 rules = rs @ r,scr=sc}:rls)
478 | append_rls id (Rrls _) _ =
479 raise error ("append_rls: not for reverse-rewrite-rule-set "^id);
481 (*. are _atomic_ rules equal ?.*)
482 (*WN080102 compare eqrule ?!?*)
483 fun eq_rule (Thm (thm1,_), Thm (thm2,_)) = thm1 = thm2
484 | eq_rule (Calc (id1,_), Calc (id2,_)) = id1 = id2
485 | eq_rule (Rls_ rls1, Rls_ rls2) = id_rls rls1 = id_rls rls2
486 (*id_rls checks for Rls, Seq, Rrls*)
489 fun merge_rls _ Erls rls = rls
490 | merge_rls _ rls Erls = rls
492 (Rls {id=id1,preconds=pc1,rew_ord=ro1,erls=er1,srls=sr1,calc=ca1,
493 (*asm_thm=at1,*)rules =rs1,scr=sc1})
494 (r2 as Rls {id=id2,preconds=pc2,rew_ord=ro2,erls=er2,srls=sr2,calc=ca2,
495 (*asm_thm=at2,*)rules =rs2,scr=sc2}) =
496 (Rls {id=id,preconds=pc1 @ ((#preconds o rep_rls) r2),
497 rew_ord=ro1,erls=merge_rls "" er1 er2(*er1*),
498 srls=merge_rls ("merged_"^id1^"_"^((#id o rep_rls) r2)) sr1
499 ((#srls o rep_rls) r2),
500 calc=ca1 @ ((#calc o rep_rls) r2),
501 (*asm_thm=at1 @ ((#asm_thm o rep_rls) r2),*)
502 rules = gen_union eq_rule rule2str (rs1, (#rules o rep_rls) r2),
505 (Seq {id=id1,preconds=pc1,rew_ord=ro1,erls=er1,srls=sr1,calc=ca1,
506 (*asm_thm=at1,*)rules =rs1,scr=sc1})
507 (r2 as Seq {id=id2,preconds=pc2,rew_ord=ro2,erls=er2,srls=sr2,calc=ca2,
508 (*asm_thm=at2,*)rules =rs2,scr=sc2}) =
509 (Seq {id=id,preconds=pc1 @ ((#preconds o rep_rls) r2),
510 rew_ord=ro1,erls=merge_rls "" er1 er2(*er1*),
511 srls=merge_rls ("merged_"^id1^"_"^((#id o rep_rls) r2)) sr1
512 ((#srls o rep_rls) r2),
513 calc=ca1 @ ((#calc o rep_rls) r2),
514 (*asm_thm=at1 @ ((#asm_thm o rep_rls) r2),*)
515 rules = gen_union eq_rule rule2str (rs1, (#rules o rep_rls) r2),
518 raise error "merge_rls: not for reverse-rewrite-rule-sets\
519 \and not for mixed Rls -- Seq";
520 fun remove_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
521 (*asm_thm=at,*)rules =rs,scr=sc}) r =
522 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
523 (*asm_thm=at,*)rules = gen_rems eq_rule (rs, r),
525 | remove_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
526 (*asm_thm=at,*)rules =rs,scr=sc}) r =
527 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
528 (*asm_thm=at,*)rules = gen_rems eq_rule (rs, r),
530 | remove_rls id (Rrls _) _ = raise error
531 ("remove_rls: not for reverse-rewrite-rule-set "^id);
533 (*!!!> gen_rems (op=) ([1,2,3,4], [3,4,5]);
534 val it = [1, 2] : int list*)
536 (*elder version: migrated 3 calls in smtest to memrls
538 case find_first ((curry op=) id) (map id_rule ((#rules o rep_rls) rls)) of
539 SOME _ => true | NONE => false;*)
540 fun memrls r (Rls {rules,...}) = gen_mem eqrule (r, rules)
541 | memrls r (Seq {rules,...}) = gen_mem eqrule (r, rules)
542 | memrls r _ = raise error ("memrls: incomplete impl. r= "^(rule2str r));
543 fun rls_get_thm rls (id: xstring) =
544 case find_first (curry eq_rule e_rule)
545 ((#rules o rep_rls) rls) of
546 SOME thm => SOME thm | NONE => NONE;
548 fun assoc' ([], key) = raise error ("ME_Isa: '"^key^"' not known")
549 | assoc' ((keyi, xi) :: pairs, key) =
550 if key = keyi then SOME xi else assoc' (pairs, key);
552 (*100818 fun assoc_thy (thy:theory') = ((the o assoc')(!theory',thy))
553 handle _ => raise error ("ME_Isa: thy '"^thy^"' not in system");*)
554 fun assoc_thy (thy:theory') = (*FIXME100818 abolish*)
555 (theory ((implode o (curry takelast 4) o explode) thy))
556 handle _ => raise error ("ME_Isa: thy '" ^ thy ^ "' not in system");
558 (*.associate an rls-identifier with an rls; related to 'fun assoc_rls';
559 these are NOT compatible to "fun assoc_thm'" in that they do NOT handle
560 overlays by re-using an identifier in different thys.*)
561 fun assoc_rls (rls:rls') = ((#2 o the o assoc')(!ruleset',rls))
562 handle _ => raise error ("ME_Isa: '"^rls^"' not in system");
563 (*fun assoc_rls (rls:rls') = ((the o assoc')(!ruleset',rls))
564 handle _ => raise error ("ME_Isa: '"^rls^"' not in system");*)
566 (*.overwrite an element in an association list and pair it with a thyID
567 in order to create the thy_hierarchy;
568 overwrites existing rls' even if they are defined in a different thy;
569 this is related to assoc_rls, TODO.WN060120: assoc_rew_ord, assoc_calc;.*)
570 (*WN060120 ...these are NOT compatible to "fun assoc_thm'" in that
571 they do NOT handle overlays by re-using an identifier in different thys;
572 "thyID.rlsID" would be a good solution, if the "." would be possible
574 actually a hack to get alltogether run again with minimal effort*)
575 fun insthy thy' (rls', rls) = (rls', (thy', rls));
576 fun overwritelthy thy (al, bl:(rls' * rls) list) =
577 let val bl' = map (insthy ((get_thy o theory2theory') thy)) bl
578 in overwritel (al, bl') end;
580 fun assoc_rew_ord ro = ((the o assoc') (!rew_ord',ro))
581 handle _ => raise error ("ME_Isa: rew_ord '"^ro^"' not in system");
582 (*get the string for stac from rule*)
583 fun assoc_calc ([], key) = raise error ("assoc_calc: '"^ key ^"' not found")
584 | assoc_calc ((calc, (keyi, xi)) :: pairs, key) =
585 if key = keyi then calc else assoc_calc (pairs, key);
586 (*only used for !calclist'...*)
587 fun assoc1 ([], key) = raise error ("assoc1 (for met.calc=): '"^ key
589 | assoc1 ((all as (keyi, _)) :: pairs, key) =
590 if key = keyi then all else assoc1 (pairs, key);
592 (*TODO.WN080102 clarify usage of type cal and type calc..*)
593 fun calID2calcID (calID : calID) =
594 let fun ass [] = raise error ("calID2calcID: "^calID^"not in calclist'")
595 | ass ((calci, (cali, eval_fn))::ids) =
596 if calID = cali then calci
598 in ass (!calclist') : calcID end;
600 fun termopt2str (SOME t) =
601 "SOME " ^ (Syntax.string_of_term (thy2ctxt' "Isac") t)
602 | termopt2str NONE = "NONE";
603 fun term2str t = Syntax.string_of_term (thy2ctxt' "Isac") t;
604 fun terms2str ts= (strs2str o (map (Syntax.string_of_term
605 (thy2ctxt' "Isac")))) ts;
606 fun type2str typ = Syntax.string_of_typ (thy2ctxt' "Isac") typ;
607 val string_of_typ = type2str;
609 fun subst2str (s:subst) =
611 (map (linefeed o pair2str o
613 (apfst term2str)))) s;
614 fun subst2str' (s:subst) =
618 (apfst term2str)))) s;
619 (*> subst2str' [(str2term "bdv", str2term "x"),
620 (str2term "bdv_2", str2term "y")];
621 val it = "[(bdv, x)]" : string
623 val env2str = subst2str;
627 fun scr2str (Script s) = "Script "^(term2str s)
628 | scr2str (Rfuns _) = "Rfuns";
631 fun maxthy thy1 thy2 = if Theory.subthy (thy1, thy2) then thy2 else thy1;
634 (*.trace internal steps of isac's rewriter*)
635 val trace_rewrite = Unsynchronized.ref false;
636 (*.depth of recursion in traces of the rewriter, if trace_rewrite:=true.*)
637 val depth = Unsynchronized.ref 99999;
638 (*.no of rewrites exceeding this int -> NO rewrite.*)
639 (*WN060829 still unused...*)
640 val lim_rewrite = Unsynchronized.ref 99999;
641 (*.no of derivation-elements exceeding this int -> SOME derivation-elements.*)
642 val lim_deriv = Unsynchronized.ref 100;
643 (*.switch for checking guhs unique before storing a pbl or met;
644 set true at startup (done at begin of ROOT.ML)
645 set false for editing IsacKnowledge (done at end of ROOT.ML).*)
646 val check_guhs_unique = Unsynchronized.ref false;
649 datatype lrd = (*elements of a path (=loc_) into an Isabelle term*)
651 | R (*go right at $*)
652 | D; (*go down at Abs*)
653 type loc_ = lrd list;
657 fun loc_2str (k:loc_) = (strs2str' o (map ldr2str)) k;