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 (ctxt_Isac"");
144 val e_rule = Thm ("refl", ProofContext.get_thm ctxt_HOL "refl" );
145 fun id_of_thm (Thm (id, _)) = id
146 | id_of_thm _ = raise error "id_of_thm";
147 fun thm_of_thm (Thm (_, thm)) = thm
148 | thm_of_thm _ = raise error "thm_of_thm";
149 fun rep_thm_G' (Thm (thmid, thm)) = (thmid, thm);
150 fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _ : thm)) =
151 (strip_thy thmid1) = (strip_thy thmid2);
154 val string_of_thm = Thm.get_name_hint; (*FIXME.2009*)
155 (*check for [.] as caused by "fun assoc_thm'"*)
156 fun string_of_thmI thm =
157 let val ct' = (de_quote o string_of_thm) thm
158 val (a, b) = split_nlast (5, explode ct')
160 [" ", " ","[", ".", "]"] => implode a
164 (*.id requested for all, Rls,Seq,Rrls.*)
165 fun id_rls Erls = "e_rls" (*WN060714 quick and dirty: recursive defs!*)
166 | id_rls (Rls {id,...}) = id
167 | id_rls (Seq {id,...}) = id
168 | id_rls (Rrls {id,...}) = id;
169 val rls2str = id_rls;
170 fun id_rule (Thm (id, _)) = id
171 | id_rule (Calc (id, _)) = id
172 | id_rule (Rls_ rls) = id_rls rls;
174 fun get_rules (Rls {rules,...}) = rules
175 | get_rules (Seq {rules,...}) = rules
176 | get_rules (Rrls _) = [];
178 fun rule2str Erule = "Erule"
179 | rule2str (Thm (str, thm)) = "Thm (\""^str^"\","^(string_of_thmI thm)^")"
180 | rule2str (Calc (str,f)) = "Calc (\""^str^"\",fn)"
181 | rule2str (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
182 | rule2str (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
183 fun rule2str' Erule = "Erule"
184 | rule2str' (Thm (str, thm)) = "Thm (\""^str^"\",\"\")"
185 | rule2str' (Calc (str,f)) = "Calc (\""^str^"\",fn)"
186 | rule2str' (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
187 | rule2str' (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
189 (*WN080102 compare eq_rule ?!?*)
190 fun eqrule (Thm (id1,_), Thm (id2,_)) = id1 = id2
191 | eqrule (Calc (id1,_), Calc (id2,_)) = id1 = id2
192 | eqrule (Cal1 (id1,_), Cal1 (id2,_)) = id1 = id2
193 | eqrule (Rls_ _, Rls_ _) = false (*{id=id1}{id=id2} = id1 = id2 FIXXME*)
197 type rrlsstate = (*state for reverse rewriting*)
198 (term * (*the current formula:
199 goes locate_gen -> next_tac via istate*)
200 term * (*the final formula*)
201 rule list (*of reverse rewrite set (#1#)*)
202 list * (*may be serveral, eg. in norm_rational*)
203 (rule * (*Thm (+ Thm generated from Calc) resulting in ...*)
204 (term * (*... rewrite with ...*)
205 term list)) (*... assumptions*)
206 list); (*derivation from given term to normalform
207 in reverse order with sym_thm;
208 (#1#) could be extracted from here #1*)
209 val e_type = Type("empty",[]);
210 val a_type = TFree("'a",[]);
211 val e_term = Const("empty",e_type);
212 val a_term = Free("empty",a_type);
213 val e_rrlsstate = (e_term,e_term,[[e_rule]],[(e_rule,(e_term,[]))]):rrlsstate;
218 (*22.2.02: ging auf Linux nicht (Stefan)
219 val e_scr = Script ((term_of o the o (parse thy)) "e_script");*)
220 val e_term = Const("empty", Type("'a", []));
221 val e_scr = Script e_term;
225 there are two kinds of theorems ...
226 (1) known by isabelle
227 (2) not known, eg. calc_thm, instantiated rls
228 the latter have a thmid "#..."
229 and thus outside isa we ALWAYS transport both (thmid,string_of_thmI)
230 and have a special assoc_thm / assoc_rls in this interface *)
231 type theory' = string; (* = domID ^".thy" *)
232 type domID = string; (* domID ^".thy" = theory' TODO.11.03replace by thyID*)
233 type thyID = string; (*WN.3.11.03 TODO: replace domID with thyID*)
235 (*2002 fun string_of_thy thy =
236 ((last_elem (Sign.stamp_names_of (sign_of thy)))^".thy"):theory';*)
237 fun string_of_thy thy = Context.theory_name thy: theory';
238 val theory2domID = string_of_thy;
239 val theory2thyID = (get_thy o string_of_thy) : theory -> thyID;
240 val theory2theory' = string_of_thy;
241 val theory2str = string_of_thy; (*WN050903 ..most consistent naming*)
242 val theory2str' = implode o (drop_last_n 4) o explode o string_of_thy;
243 (*> theory2str' Isac.thy;
244 al it = "Isac" : string
247 fun thyID2theory' (thyID:thyID) =
248 let val ss = explode thyID
249 val ext = implode (takelast (4, ss))
250 in if ext = ".thy" then thyID : theory' (*disarm abuse of thyID*)
253 (* thyID2theory' "Isac" (*ok*);
254 val it = "Isac.thy" : theory'
255 > thyID2theory' "Isac.thy" (*abuse, goes ok...*);
256 val it = "Isac.thy" : theory'
259 fun theory'2thyID (theory':theory') =
260 let val ss = explode theory'
261 val ext = implode (takelast (4, ss))
262 in if ext = ".thy" then ((implode o (drop_last_n 4)) ss) : thyID
263 else theory' (*disarm abuse of theory'*)
265 (* theory'2thyID "Isac.thy";
266 val it = "Isac" : thyID
267 > theory'2thyID "Isac";
268 val it = "Isac" : thyID*)
271 (*. WN0509 discussion:
272 #############################################################################
273 # How to manage theorys in subproblems wrt. the requirement, #
274 # that scripts should be re-usable ? #
275 #############################################################################
277 eg. 'Script Solve_rat_equation' calls 'SubProblem (RatEq_,..'
278 which would not allow to 'solve (y'' = -M_b / EI, M_b)' by this script
279 because Biegelinie.thy is subthy of RatEq.thy and thus Biegelinie.M_b
280 is unknown in RatEq.thy and M_b cannot be parsed into the scripts guard
283 Preliminary solution:
284 # the thy in 'SubProblem (thy_, pbl, arglist)' is not taken automatically,
285 # instead the 'maxthy (rootthy pt) thy_' is taken for each subpbl
286 # however, a thy specified by the user in the rootpbl may lead to
287 errors in far-off subpbls (which are not yet reported properly !!!)
288 and interactively specifiying thys in subpbl is not very relevant.
290 Other solutions possible:
291 # always parse and type-check with Isac.thy
292 (rejected tue to the vague idea eg. to re-use equations for R in C etc.)
293 # regard the subthy-relation in specifying thys of subpbls
294 # specifically handle 'SubProblem (undefined_, pbl, arglist)'
297 (*WN0509 TODO "ProtoPure" ... would be more consistent
298 with assoc_thy <--> theory2theory' +FIXME assoc_thy "e_domID" -> Script.thy*)
299 val e_domID = "e_domID":domID;
301 (*the key into the hierarchy ob theory elements*)
302 type theID = string list;
303 val e_theID = ["e_theID"];
304 val theID2str = strs2str;
305 (*theID eg. is ["IsacKnowledge", "Test", "Rulesets", "ac_plus_times"]*)
306 fun theID2thyID (theID:theID) =
307 if length theID >= 3 then (last_elem o (drop_last_n 2)) theID : thyID
308 else raise error ("theID2thyID called with "^ theID2str theID);
310 (*the key into the hierarchy ob problems*)
311 type pblID = string list; (* domID::...*)
312 val e_pblID = ["e_pblID"]:pblID;
313 val pblID2str = strs2str;
315 (*the key into the hierarchy ob methods*)
316 type metID = string list;
317 val e_metID = ["e_metID"]:metID;
318 val metID2str = strs2str;
320 (*either theID or pblID or metID*)
321 type kestoreID = string list;
322 val e_kestoreID = ["e_kestoreID"];
323 val kestoreID2str = strs2str;
325 (*for distinction of contexts*)
326 datatype ketype = Exp_ | Thy_ | Pbl_ | Met_;
327 fun ketype2str Exp_ = "Exp_"
328 | ketype2str Thy_ = "Thy_"
329 | ketype2str Pbl_ = "Pbl_"
330 | ketype2str Met_ = "Met_";
331 fun ketype2str' Exp_ = "Example"
332 | ketype2str' Thy_ = "Theory"
333 | ketype2str' Pbl_ = "Problem"
334 | ketype2str' Met_ = "Method";
336 (*see 'How to manage theorys in subproblems' at 'type thyID'*)
337 val theory' = ref ([]:(theory' * theory) list);
339 (*.all theories defined for Scripts, recorded in Scripts/Script.ML;
340 in order to distinguish them from general IsacKnowledge defined later on.*)
341 val script_thys = ref ([] : (theory' * theory) list);
344 (*rewrite orders, also stored in 'type met' and type 'and rls'
345 The association list is required for 'rewrite.."rew_ord"..'
346 WN0509 tests not well-organized: see smltest/IsacKnowledge/termorder.sml*)
348 ref ([]:(rew_ord' * (*the key for the association list *)
349 (subst (*the bound variables - they get high order*)
350 -> (term * term) (*(t1, t2) to be compared *)
351 -> bool)) (*if t1 <= t2 then true else false *)
352 list); (*association list *)
353 rew_ord' := overwritel (!rew_ord', [("e_rew_ord", e_rew_ord),
354 ("dummy_ord", dummy_ord)]);
357 (*WN060120 a hack to get alltogether run again with minimal effort:
358 theory' is inserted for creating thy_hierarchy; calls for assoc_rls
360 val ruleset' = ref ([]:(rls' * (theory' * rls)) list);
362 (*FIXME.040207 calclist': used by prep_rls, NOT in met*)
363 val calclist'= ref ([]: calc list);
365 (*.the hierarchy of thydata.*)
367 (*.'a is for pbt | met.*)
368 (*WN.24.4.03 -"- ... type parameters; afterwards naming inconsistent*)
370 Ptyp of string * (*element within pblID*)
371 'a list * (*several pbts with different domIDs/thy
372 TODO: select by subthy (isaref.p.69)
373 presently only _ONE_ elem*)
374 ('a ptyp) list; (*the children nodes*)
376 (*.datatype for collecting thydata for hierarchy.*)
377 (*WN060720 more consistent naming would be 'type thyelem' or 'thelem'*)
378 (*WN0606 Htxt contains html which does not belong to the sml-kernel*)
379 datatype thydata = Html of {guh: guh,
380 coursedesign: authors,
381 mathauthors: authors,
382 html: string} (*html; for demos before database*)
384 coursedesign: authors,
385 mathauthors: authors,
388 coursedesign: authors,
389 mathauthors: authors,
390 (*like vvvvvvvvvvvvv val ruleset'
391 WN060711 redesign together !*)
392 thy_rls: (thyID * rls)}
394 coursedesign: authors,
395 mathauthors: authors,
398 coursedesign: authors,
399 mathauthors: authors,
400 ord: (subst -> (term * term) -> bool)};
401 val e_thydata = Html {guh="e_guh", coursedesign=[], mathauthors=[], html=""};
403 type thehier = (thydata ptyp) list;
404 val thehier = ref ([] : thehier);
406 (*.an association list, gets the value once in Isac.ML.*)
407 val isab_thm_thy = ref ([] : (thmID * (thyID * thm)) list);
411 type filename = string;
413 (*val xxx = fn: a b => (a,b); ??? fun-definition ???*)
415 fun ii (_:term) = e_rrlsstate;
416 fun no (_:term) = SOME (e_term,[e_term]);
417 fun lo (_:rule list list) (_:term) (_:rule) = [(e_rule,(e_term,[e_term]))];
418 fun ne (_:rule list list) (_:term) = SOME e_rule;
419 fun fo (_:rule list list) (_:term) (_:term) = [(e_rule,(e_term,[e_term]))];
421 val e_rfuns = Rfuns {init_state=ii,normal_form=no,locate_rule=lo,
422 next_rule=ne,attach_form=fo};
428 rew_ord = ("dummy_ord", dummy_ord),
429 erls = Erls,srls = Erls,
431 rules = [], scr = EmptyScr}:rls;
432 val e_rrls = Rrls {id = "e_rrls",
434 rew_ord = ("dummy_ord", dummy_ord),
439 ruleset' := overwritel (!ruleset', [("e_rls",("Tools",e_rls)),
440 ("e_rrls",("Tools",e_rrls))
443 fun rep_rls (Rls {id,preconds,rew_ord,erls,srls,calc,(*asm_thm,*)rules,scr}) =
444 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
445 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
446 | rep_rls (Seq {id,preconds,rew_ord,erls,srls,calc,(*asm_thm,*)rules,scr}) =
447 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
448 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
449 | rep_rls Erls = rep_rls e_rls
450 | rep_rls (Rrls {id,...}) = rep_rls e_rls
451 (*raise error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id)*);
452 (*| rep_rls (Seq {id,...}) =
453 raise error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id);
456 (Rrls {id,(*asm_thm,*) calc, erls, prepat, rew_ord,
458 {attach_form,init_state,locate_rule,
459 next_rule,normal_form}}) =
460 {id=id,(*asm_thm=asm_thm,*) calc=calc, erls=erls, prepat=prepat,
461 rew_ord=rew_ord, attach_form=attach_form, init_state=init_state,
462 locate_rule=locate_rule, next_rule=next_rule, normal_form=normal_form}
463 | rep_rrls (Rls {id,...}) =
464 raise error ("rep_rrls doesn't take apart (normal) rule-sets: "^id)
465 | rep_rrls (Seq {id,...}) =
466 raise error ("rep_rrls doesn't take apart (normal) rule-sets: "^id);
468 fun append_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
469 rules =rs,scr=sc}) r =
470 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
471 rules = rs @ r,scr=sc}:rls)
472 | append_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
473 rules =rs,scr=sc}) r =
474 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
475 rules = rs @ r,scr=sc}:rls)
476 | append_rls id (Rrls _) _ =
477 raise error ("append_rls: not for reverse-rewrite-rule-set "^id);
479 (*. are _atomic_ rules equal ?.*)
480 (*WN080102 compare eqrule ?!?*)
481 fun eq_rule (Thm (thm1,_), Thm (thm2,_)) = thm1 = thm2
482 | eq_rule (Calc (id1,_), Calc (id2,_)) = id1 = id2
483 | eq_rule (Rls_ rls1, Rls_ rls2) = id_rls rls1 = id_rls rls2
484 (*id_rls checks for Rls, Seq, Rrls*)
487 fun merge_rls _ Erls rls = rls
488 | merge_rls _ rls Erls = rls
490 (Rls {id=id1,preconds=pc1,rew_ord=ro1,erls=er1,srls=sr1,calc=ca1,
491 (*asm_thm=at1,*)rules =rs1,scr=sc1})
492 (r2 as Rls {id=id2,preconds=pc2,rew_ord=ro2,erls=er2,srls=sr2,calc=ca2,
493 (*asm_thm=at2,*)rules =rs2,scr=sc2}) =
494 (Rls {id=id,preconds=pc1 @ ((#preconds o rep_rls) r2),
495 rew_ord=ro1,erls=merge_rls "" er1 er2(*er1*),
496 srls=merge_rls ("merged_"^id1^"_"^((#id o rep_rls) r2)) sr1
497 ((#srls o rep_rls) r2),
498 calc=ca1 @ ((#calc o rep_rls) r2),
499 (*asm_thm=at1 @ ((#asm_thm o rep_rls) r2),*)
500 rules = gen_union eq_rule rule2str (rs1, (#rules o rep_rls) r2),
503 (Seq {id=id1,preconds=pc1,rew_ord=ro1,erls=er1,srls=sr1,calc=ca1,
504 (*asm_thm=at1,*)rules =rs1,scr=sc1})
505 (r2 as Seq {id=id2,preconds=pc2,rew_ord=ro2,erls=er2,srls=sr2,calc=ca2,
506 (*asm_thm=at2,*)rules =rs2,scr=sc2}) =
507 (Seq {id=id,preconds=pc1 @ ((#preconds o rep_rls) r2),
508 rew_ord=ro1,erls=merge_rls "" er1 er2(*er1*),
509 srls=merge_rls ("merged_"^id1^"_"^((#id o rep_rls) r2)) sr1
510 ((#srls o rep_rls) r2),
511 calc=ca1 @ ((#calc o rep_rls) r2),
512 (*asm_thm=at1 @ ((#asm_thm o rep_rls) r2),*)
513 rules = gen_union eq_rule rule2str (rs1, (#rules o rep_rls) r2),
516 raise error "merge_rls: not for reverse-rewrite-rule-sets\
517 \and not for mixed Rls -- Seq";
518 fun remove_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
519 (*asm_thm=at,*)rules =rs,scr=sc}) r =
520 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
521 (*asm_thm=at,*)rules = gen_rems eq_rule (rs, r),
523 | remove_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
524 (*asm_thm=at,*)rules =rs,scr=sc}) r =
525 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
526 (*asm_thm=at,*)rules = gen_rems eq_rule (rs, r),
528 | remove_rls id (Rrls _) _ = raise error
529 ("remove_rls: not for reverse-rewrite-rule-set "^id);
531 (*!!!> gen_rems (op=) ([1,2,3,4], [3,4,5]);
532 val it = [1, 2] : int list*)
534 (*elder version: migrated 3 calls in smtest to memrls
536 case find_first ((curry op=) id) (map id_rule ((#rules o rep_rls) rls)) of
537 SOME _ => true | NONE => false;*)
538 fun memrls r (Rls {rules,...}) = gen_mem eqrule (r, rules)
539 | memrls r (Seq {rules,...}) = gen_mem eqrule (r, rules)
540 | memrls r _ = raise error ("memrls: incomplete impl. r= "^(rule2str r));
541 fun rls_get_thm rls (id: xstring) =
542 case find_first (curry eq_rule e_rule)
543 ((#rules o rep_rls) rls) of
544 SOME thm => SOME thm | NONE => NONE;
546 fun assoc' ([], key) = raise error ("ME_Isa: '"^key^"' not known")
547 | assoc' ((keyi, xi) :: pairs, key) =
548 if key = keyi then SOME xi else assoc' (pairs, key);
550 (*100818 fun assoc_thy (thy:theory') = ((the o assoc')(!theory',thy))
551 handle _ => raise error ("ME_Isa: thy '"^thy^"' not in system");*)
552 fun assoc_thy (thy:theory') = (*FIXME100818 abolish*)
553 (theory ((implode o (curry takelast 4) o explode) thy))
554 handle _ => raise error ("ME_Isa: thy '" ^ thy ^ "' not in system");
556 (*.associate an rls-identifier with an rls; related to 'fun assoc_rls';
557 these are NOT compatible to "fun assoc_thm'" in that they do NOT handle
558 overlays by re-using an identifier in different thys.*)
559 fun assoc_rls (rls:rls') = ((#2 o the o assoc')(!ruleset',rls))
560 handle _ => raise error ("ME_Isa: '"^rls^"' not in system");
561 (*fun assoc_rls (rls:rls') = ((the o assoc')(!ruleset',rls))
562 handle _ => raise error ("ME_Isa: '"^rls^"' not in system");*)
564 (*.overwrite an element in an association list and pair it with a thyID
565 in order to create the thy_hierarchy;
566 overwrites existing rls' even if they are defined in a different thy;
567 this is related to assoc_rls, TODO.WN060120: assoc_rew_ord, assoc_calc;.*)
568 (*WN060120 ...these are NOT compatible to "fun assoc_thm'" in that
569 they do NOT handle overlays by re-using an identifier in different thys;
570 "thyID.rlsID" would be a good solution, if the "." would be possible
572 actually a hack to get alltogether run again with minimal effort*)
573 fun insthy thy' (rls', rls) = (rls', (thy', rls));
574 fun overwritelthy thy (al, bl:(rls' * rls) list) =
575 let val bl' = map (insthy ((get_thy o theory2theory') thy)) bl
576 in overwritel (al, bl') end;
578 fun assoc_rew_ord ro = ((the o assoc') (!rew_ord',ro))
579 handle _ => raise error ("ME_Isa: rew_ord '"^ro^"' not in system");
580 (*get the string for stac from rule*)
581 fun assoc_calc ([], key) = raise error ("assoc_calc: '"^ key ^"' not found")
582 | assoc_calc ((calc, (keyi, xi)) :: pairs, key) =
583 if key = keyi then calc else assoc_calc (pairs, key);
584 (*only used for !calclist'...*)
585 fun assoc1 ([], key) = raise error ("assoc1 (for met.calc=): '"^ key
587 | assoc1 ((all as (keyi, _)) :: pairs, key) =
588 if key = keyi then all else assoc1 (pairs, key);
590 (*TODO.WN080102 clarify usage of type cal and type calc..*)
591 fun calID2calcID (calID : calID) =
592 let fun ass [] = raise error ("calID2calcID: "^calID^"not in calclist'")
593 | ass ((calci, (cali, eval_fn))::ids) =
594 if calID = cali then calci
596 in ass (!calclist') : calcID end;
598 (*fun termopt2str (SOME t) =
599 "SOME " ^ (Sign.string_of_term (sign_of(assoc_thy "Isac.thy")) t)
600 | termopt2str NONE = "NONE";*)
601 fun termopt2str (SOME t) =
602 "SOME " ^ (Syntax.string_of_term (ctxt_Isac"") t)
603 | termopt2str NONE = "NONE";
604 fun term2str t = Syntax.string_of_term (ctxt_Isac"") t;
605 fun terms2str ts= (strs2str o (map (Syntax.string_of_term
607 (*fun type2str typ = Sign.string_of_typ (sign_of (assoc_thy "Isac.thy")) typ;*)
608 fun type2str typ = Syntax.string_of_typ (ctxt_Isac"") typ;
609 val string_of_typ = type2str;
611 fun subst2str (s:subst) =
613 (map (linefeed o pair2str o
615 (apfst term2str)))) s;
616 fun subst2str' (s:subst) =
620 (apfst term2str)))) s;
621 (*> subst2str' [(str2term "bdv", str2term "x"),
622 (str2term "bdv_2", str2term "y")];
623 val it = "[(bdv, x)]" : string
625 val env2str = subst2str;
629 fun scr2str (Script s) = "Script "^(term2str s)
630 | scr2str (Rfuns _) = "Rfuns";
633 fun maxthy thy1 thy2 = if Theory.subthy (thy1, thy2) then thy2 else thy1;
636 (*.trace internal steps of isac's rewriter*)
637 val trace_rewrite = ref false;
638 (*.depth of recursion in traces of the rewriter, if trace_rewrite:=true.*)
639 val depth = ref 99999;
640 (*.no of rewrites exceeding this int -> NO rewrite.*)
641 (*WN060829 still unused...*)
642 val lim_rewrite = ref 99999;
643 (*.no of derivation-elements exceeding this int -> SOME derivation-elements.*)
644 val lim_deriv = ref 100;
645 (*.switch for checking guhs unique before storing a pbl or met;
646 set true at startup (done at begin of ROOT.ML)
647 set false for editing IsacKnowledge (done at end of ROOT.ML).*)
648 val check_guhs_unique = ref false;
651 datatype lrd = (*elements of a path (=loc_) into an Isabelle term*)
653 | R (*go right at $*)
654 | D; (*go down at Abs*)
655 type loc_ = lrd list;
659 fun loc_2str (k:loc_) = (strs2str' o (map ldr2str)) k;