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*)
136 (*ctxt for retrieval of all thms in HOL; FIXME make this local?*)
137 (*val ctxt_HOL = ProofContext.init_global (theory "Complex_Main");*)
138 val ctxt_HOL = thy2ctxt "Complex_Main";
139 (*lazy ctxt for retrieval of all thms used in isac; FIXME make this local?*)
140 fun ctxt_Isac _ = thy2ctxt "Isac";
141 fun Isac _ = ProofContext.theory_of (ctxt_Isac"");
143 val e_rule = Thm ("refl", ProofContext.get_thm ctxt_HOL "refl" );
144 fun id_of_thm (Thm (id, _)) = id
145 | id_of_thm _ = raise error "id_of_thm";
146 fun thm_of_thm (Thm (_, thm)) = thm
147 | thm_of_thm _ = raise error "thm_of_thm";
148 fun rep_thm_G' (Thm (thmid, thm)) = (thmid, thm);
149 fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _ : thm)) =
150 (strip_thy thmid1) = (strip_thy thmid2);
153 val string_of_thm = Thm.get_name_hint; (*FIXME.2009*)
154 (*check for [.] as caused by "fun assoc_thm'"*)
155 fun string_of_thmI thm =
156 let val ct' = (de_quote o string_of_thm) thm
157 val (a, b) = split_nlast (5, explode ct')
159 [" ", " ","[", ".", "]"] => implode a
163 (*.id requested for all, Rls,Seq,Rrls.*)
164 fun id_rls Erls = "e_rls" (*WN060714 quick and dirty: recursive defs!*)
165 | id_rls (Rls {id,...}) = id
166 | id_rls (Seq {id,...}) = id
167 | id_rls (Rrls {id,...}) = id;
168 val rls2str = id_rls;
169 fun id_rule (Thm (id, _)) = id
170 | id_rule (Calc (id, _)) = id
171 | id_rule (Rls_ rls) = id_rls rls;
173 fun get_rules (Rls {rules,...}) = rules
174 | get_rules (Seq {rules,...}) = rules
175 | get_rules (Rrls _) = [];
177 fun rule2str Erule = "Erule"
178 | rule2str (Thm (str, thm)) = "Thm (\""^str^"\","^(string_of_thmI thm)^")"
179 | rule2str (Calc (str,f)) = "Calc (\""^str^"\",fn)"
180 | rule2str (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
181 | rule2str (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
182 fun rule2str' Erule = "Erule"
183 | rule2str' (Thm (str, thm)) = "Thm (\""^str^"\",\"\")"
184 | rule2str' (Calc (str,f)) = "Calc (\""^str^"\",fn)"
185 | rule2str' (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
186 | rule2str' (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
188 (*WN080102 compare eq_rule ?!?*)
189 fun eqrule (Thm (id1,_), Thm (id2,_)) = id1 = id2
190 | eqrule (Calc (id1,_), Calc (id2,_)) = id1 = id2
191 | eqrule (Cal1 (id1,_), Cal1 (id2,_)) = id1 = id2
192 | eqrule (Rls_ _, Rls_ _) = false (*{id=id1}{id=id2} = id1 = id2 FIXXME*)
196 type rrlsstate = (*state for reverse rewriting*)
197 (term * (*the current formula:
198 goes locate_gen -> next_tac via istate*)
199 term * (*the final formula*)
200 rule list (*of reverse rewrite set (#1#)*)
201 list * (*may be serveral, eg. in norm_rational*)
202 (rule * (*Thm (+ Thm generated from Calc) resulting in ...*)
203 (term * (*... rewrite with ...*)
204 term list)) (*... assumptions*)
205 list); (*derivation from given term to normalform
206 in reverse order with sym_thm;
207 (#1#) could be extracted from here #1*)
208 val e_type = Type("empty",[]);
209 val a_type = TFree("'a",[]);
210 val e_term = Const("empty",e_type);
211 val a_term = Free("empty",a_type);
212 val e_rrlsstate = (e_term,e_term,[[e_rule]],[(e_rule,(e_term,[]))]):rrlsstate;
217 (*22.2.02: ging auf Linux nicht (Stefan)
218 val e_scr = Script ((term_of o the o (parse thy)) "e_script");*)
219 val e_term = Const("empty", Type("'a", []));
220 val e_scr = Script e_term;
224 there are two kinds of theorems ...
225 (1) known by isabelle
226 (2) not known, eg. calc_thm, instantiated rls
227 the latter have a thmid "#..."
228 and thus outside isa we ALWAYS transport both (thmid,string_of_thmI)
229 and have a special assoc_thm / assoc_rls in this interface *)
230 type theory' = string; (* = domID ^".thy" *)
231 type domID = string; (* domID ^".thy" = theory' TODO.11.03replace by thyID*)
232 type thyID = string; (*WN.3.11.03 TODO: replace domID with thyID*)
234 (*2002 fun string_of_thy thy =
235 ((last_elem (Sign.stamp_names_of (sign_of thy)))^".thy"):theory';*)
236 fun string_of_thy thy = Context.theory_name thy: theory';
237 val theory2domID = string_of_thy;
238 val theory2thyID = (get_thy o string_of_thy) : theory -> thyID;
239 val theory2theory' = string_of_thy;
240 val theory2str = string_of_thy; (*WN050903 ..most consistent naming*)
241 val theory2str' = implode o (drop_last_n 4) o explode o string_of_thy;
242 (*> theory2str' Isac.thy;
243 al it = "Isac" : string
246 fun thyID2theory' (thyID:thyID) =
247 let val ss = explode thyID
248 val ext = implode (takelast (4, ss))
249 in if ext = ".thy" then thyID : theory' (*disarm abuse of thyID*)
252 (* thyID2theory' "Isac" (*ok*);
253 val it = "Isac.thy" : theory'
254 > thyID2theory' "Isac.thy" (*abuse, goes ok...*);
255 val it = "Isac.thy" : theory'
258 fun theory'2thyID (theory':theory') =
259 let val ss = explode theory'
260 val ext = implode (takelast (4, ss))
261 in if ext = ".thy" then ((implode o (drop_last_n 4)) ss) : thyID
262 else theory' (*disarm abuse of theory'*)
264 (* theory'2thyID "Isac.thy";
265 val it = "Isac" : thyID
266 > theory'2thyID "Isac";
267 val it = "Isac" : thyID*)
270 (*. WN0509 discussion:
271 #############################################################################
272 # How to manage theorys in subproblems wrt. the requirement, #
273 # that scripts should be re-usable ? #
274 #############################################################################
276 eg. 'Script Solve_rat_equation' calls 'SubProblem (RatEq_,..'
277 which would not allow to 'solve (y'' = -M_b / EI, M_b)' by this script
278 because Biegelinie.thy is subthy of RatEq.thy and thus Biegelinie.M_b
279 is unknown in RatEq.thy and M_b cannot be parsed into the scripts guard
282 Preliminary solution:
283 # the thy in 'SubProblem (thy_, pbl, arglist)' is not taken automatically,
284 # instead the 'maxthy (rootthy pt) thy_' is taken for each subpbl
285 # however, a thy specified by the user in the rootpbl may lead to
286 errors in far-off subpbls (which are not yet reported properly !!!)
287 and interactively specifiying thys in subpbl is not very relevant.
289 Other solutions possible:
290 # always parse and type-check with Isac.thy
291 (rejected tue to the vague idea eg. to re-use equations for R in C etc.)
292 # regard the subthy-relation in specifying thys of subpbls
293 # specifically handle 'SubProblem (undefined_, pbl, arglist)'
296 (*WN0509 TODO "ProtoPure" ... would be more consistent
297 with assoc_thy <--> theory2theory' +FIXME assoc_thy "e_domID" -> Script.thy*)
298 val e_domID = "e_domID":domID;
300 (*the key into the hierarchy ob theory elements*)
301 type theID = string list;
302 val e_theID = ["e_theID"];
303 val theID2str = strs2str;
304 (*theID eg. is ["IsacKnowledge", "Test", "Rulesets", "ac_plus_times"]*)
305 fun theID2thyID (theID:theID) =
306 if length theID >= 3 then (last_elem o (drop_last_n 2)) theID : thyID
307 else raise error ("theID2thyID called with "^ theID2str theID);
309 (*the key into the hierarchy ob problems*)
310 type pblID = string list; (* domID::...*)
311 val e_pblID = ["e_pblID"]:pblID;
312 val pblID2str = strs2str;
314 (*the key into the hierarchy ob methods*)
315 type metID = string list;
316 val e_metID = ["e_metID"]:metID;
317 val metID2str = strs2str;
319 (*either theID or pblID or metID*)
320 type kestoreID = string list;
321 val e_kestoreID = ["e_kestoreID"];
322 val kestoreID2str = strs2str;
324 (*for distinction of contexts*)
325 datatype ketype = Exp_ | Thy_ | Pbl_ | Met_;
326 fun ketype2str Exp_ = "Exp_"
327 | ketype2str Thy_ = "Thy_"
328 | ketype2str Pbl_ = "Pbl_"
329 | ketype2str Met_ = "Met_";
330 fun ketype2str' Exp_ = "Example"
331 | ketype2str' Thy_ = "Theory"
332 | ketype2str' Pbl_ = "Problem"
333 | ketype2str' Met_ = "Method";
335 (*see 'How to manage theorys in subproblems' at 'type thyID'*)
336 val theory' = ref ([]:(theory' * theory) list);
338 (*.all theories defined for Scripts, recorded in Scripts/Script.ML;
339 in order to distinguish them from general IsacKnowledge defined later on.*)
340 val script_thys = ref ([] : (theory' * theory) list);
343 (*rewrite orders, also stored in 'type met' and type 'and rls'
344 The association list is required for 'rewrite.."rew_ord"..'
345 WN0509 tests not well-organized: see smltest/IsacKnowledge/termorder.sml*)
347 ref ([]:(rew_ord' * (*the key for the association list *)
348 (subst (*the bound variables - they get high order*)
349 -> (term * term) (*(t1, t2) to be compared *)
350 -> bool)) (*if t1 <= t2 then true else false *)
351 list); (*association list *)
352 rew_ord' := overwritel (!rew_ord', [("e_rew_ord", e_rew_ord),
353 ("dummy_ord", dummy_ord)]);
356 (*WN060120 a hack to get alltogether run again with minimal effort:
357 theory' is inserted for creating thy_hierarchy; calls for assoc_rls
359 val ruleset' = ref ([]:(rls' * (theory' * rls)) list);
361 (*FIXME.040207 calclist': used by prep_rls, NOT in met*)
362 val calclist'= ref ([]: calc list);
364 (*.the hierarchy of thydata.*)
366 (*.'a is for pbt | met.*)
367 (*WN.24.4.03 -"- ... type parameters; afterwards naming inconsistent*)
369 Ptyp of string * (*element within pblID*)
370 'a list * (*several pbts with different domIDs/thy
371 TODO: select by subthy (isaref.p.69)
372 presently only _ONE_ elem*)
373 ('a ptyp) list; (*the children nodes*)
375 (*.datatype for collecting thydata for hierarchy.*)
376 (*WN060720 more consistent naming would be 'type thyelem' or 'thelem'*)
377 (*WN0606 Htxt contains html which does not belong to the sml-kernel*)
378 datatype thydata = Html of {guh: guh,
379 coursedesign: authors,
380 mathauthors: authors,
381 html: string} (*html; for demos before database*)
383 coursedesign: authors,
384 mathauthors: authors,
387 coursedesign: authors,
388 mathauthors: authors,
389 (*like vvvvvvvvvvvvv val ruleset'
390 WN060711 redesign together !*)
391 thy_rls: (thyID * rls)}
393 coursedesign: authors,
394 mathauthors: authors,
397 coursedesign: authors,
398 mathauthors: authors,
399 ord: (subst -> (term * term) -> bool)};
400 val e_thydata = Html {guh="e_guh", coursedesign=[], mathauthors=[], html=""};
402 type thehier = (thydata ptyp) list;
403 val thehier = ref ([] : thehier);
405 (*.an association list, gets the value once in Isac.ML.*)
406 val isab_thm_thy = ref ([] : (thmID * (thyID * thm)) list);
410 type filename = string;
412 (*val xxx = fn: a b => (a,b); ??? fun-definition ???*)
414 fun ii (_:term) = e_rrlsstate;
415 fun no (_:term) = SOME (e_term,[e_term]);
416 fun lo (_:rule list list) (_:term) (_:rule) = [(e_rule,(e_term,[e_term]))];
417 fun ne (_:rule list list) (_:term) = SOME e_rule;
418 fun fo (_:rule list list) (_:term) (_:term) = [(e_rule,(e_term,[e_term]))];
420 val e_rfuns = Rfuns {init_state=ii,normal_form=no,locate_rule=lo,
421 next_rule=ne,attach_form=fo};
427 rew_ord = ("dummy_ord", dummy_ord),
428 erls = Erls,srls = Erls,
430 rules = [], scr = EmptyScr}:rls;
431 val e_rrls = Rrls {id = "e_rrls",
433 rew_ord = ("dummy_ord", dummy_ord),
438 ruleset' := overwritel (!ruleset', [("e_rls",("Tools",e_rls)),
439 ("e_rrls",("Tools",e_rrls))
442 fun rep_rls (Rls {id,preconds,rew_ord,erls,srls,calc,(*asm_thm,*)rules,scr}) =
443 {id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
444 (*asm_thm=asm_thm,*)rules=rules,scr=scr}
445 | rep_rls (Seq {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 Erls = rep_rls e_rls
449 | rep_rls (Rrls {id,...}) = rep_rls e_rls
450 (*raise error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id)*);
451 (*| rep_rls (Seq {id,...}) =
452 raise error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id);
455 (Rrls {id,(*asm_thm,*) calc, erls, prepat, rew_ord,
457 {attach_form,init_state,locate_rule,
458 next_rule,normal_form}}) =
459 {id=id,(*asm_thm=asm_thm,*) calc=calc, erls=erls, prepat=prepat,
460 rew_ord=rew_ord, attach_form=attach_form, init_state=init_state,
461 locate_rule=locate_rule, next_rule=next_rule, normal_form=normal_form}
462 | rep_rrls (Rls {id,...}) =
463 raise error ("rep_rrls doesn't take apart (normal) rule-sets: "^id)
464 | rep_rrls (Seq {id,...}) =
465 raise error ("rep_rrls doesn't take apart (normal) rule-sets: "^id);
467 fun append_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
468 rules =rs,scr=sc}) r =
469 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
470 rules = rs @ r,scr=sc}:rls)
471 | append_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
472 rules =rs,scr=sc}) r =
473 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
474 rules = rs @ r,scr=sc}:rls)
475 | append_rls id (Rrls _) _ =
476 raise error ("append_rls: not for reverse-rewrite-rule-set "^id);
478 (*. are _atomic_ rules equal ?.*)
479 (*WN080102 compare eqrule ?!?*)
480 fun eq_rule (Thm (thm1,_), Thm (thm2,_)) = thm1 = thm2
481 | eq_rule (Calc (id1,_), Calc (id2,_)) = id1 = id2
482 | eq_rule (Rls_ rls1, Rls_ rls2) = id_rls rls1 = id_rls rls2
483 (*id_rls checks for Rls, Seq, Rrls*)
486 fun merge_rls _ Erls rls = rls
487 | merge_rls _ rls Erls = rls
489 (Rls {id=id1,preconds=pc1,rew_ord=ro1,erls=er1,srls=sr1,calc=ca1,
490 (*asm_thm=at1,*)rules =rs1,scr=sc1})
491 (r2 as Rls {id=id2,preconds=pc2,rew_ord=ro2,erls=er2,srls=sr2,calc=ca2,
492 (*asm_thm=at2,*)rules =rs2,scr=sc2}) =
493 (Rls {id=id,preconds=pc1 @ ((#preconds o rep_rls) r2),
494 rew_ord=ro1,erls=merge_rls "" er1 er2(*er1*),
495 srls=merge_rls ("merged_"^id1^"_"^((#id o rep_rls) r2)) sr1
496 ((#srls o rep_rls) r2),
497 calc=ca1 @ ((#calc o rep_rls) r2),
498 (*asm_thm=at1 @ ((#asm_thm o rep_rls) r2),*)
499 rules = gen_union eq_rule rule2str (rs1, (#rules o rep_rls) r2),
502 (Seq {id=id1,preconds=pc1,rew_ord=ro1,erls=er1,srls=sr1,calc=ca1,
503 (*asm_thm=at1,*)rules =rs1,scr=sc1})
504 (r2 as Seq {id=id2,preconds=pc2,rew_ord=ro2,erls=er2,srls=sr2,calc=ca2,
505 (*asm_thm=at2,*)rules =rs2,scr=sc2}) =
506 (Seq {id=id,preconds=pc1 @ ((#preconds o rep_rls) r2),
507 rew_ord=ro1,erls=merge_rls "" er1 er2(*er1*),
508 srls=merge_rls ("merged_"^id1^"_"^((#id o rep_rls) r2)) sr1
509 ((#srls o rep_rls) r2),
510 calc=ca1 @ ((#calc o rep_rls) r2),
511 (*asm_thm=at1 @ ((#asm_thm o rep_rls) r2),*)
512 rules = gen_union eq_rule rule2str (rs1, (#rules o rep_rls) r2),
515 raise error "merge_rls: not for reverse-rewrite-rule-sets\
516 \and not for mixed Rls -- Seq";
517 fun remove_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
518 (*asm_thm=at,*)rules =rs,scr=sc}) r =
519 (Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
520 (*asm_thm=at,*)rules = gen_rems eq_rule (rs, r),
522 | remove_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
523 (*asm_thm=at,*)rules =rs,scr=sc}) r =
524 (Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
525 (*asm_thm=at,*)rules = gen_rems eq_rule (rs, r),
527 | remove_rls id (Rrls _) _ = raise error
528 ("remove_rls: not for reverse-rewrite-rule-set "^id);
530 (*!!!> gen_rems (op=) ([1,2,3,4], [3,4,5]);
531 val it = [1, 2] : int list*)
533 (*elder version: migrated 3 calls in smtest to memrls
535 case find_first ((curry op=) id) (map id_rule ((#rules o rep_rls) rls)) of
536 SOME _ => true | NONE => false;*)
537 fun memrls r (Rls {rules,...}) = gen_mem eqrule (r, rules)
538 | memrls r (Seq {rules,...}) = gen_mem eqrule (r, rules)
539 | memrls r _ = raise error ("memrls: incomplete impl. r= "^(rule2str r));
540 fun rls_get_thm rls (id: xstring) =
541 case find_first (curry eq_rule e_rule)
542 ((#rules o rep_rls) rls) of
543 SOME thm => SOME thm | NONE => NONE;
545 fun assoc' ([], key) = raise error ("ME_Isa: '"^key^"' not known")
546 | assoc' ((keyi, xi) :: pairs, key) =
547 if key = keyi then SOME xi else assoc' (pairs, key);
549 (*100818 fun assoc_thy (thy:theory') = ((the o assoc')(!theory',thy))
550 handle _ => raise error ("ME_Isa: thy '"^thy^"' not in system");*)
551 fun assoc_thy (thy:theory') = theory
552 ((implode o (curry takelast 4) o explode) thy);
554 (*.associate an rls-identifier with an rls; related to 'fun assoc_rls';
555 these are NOT compatible to "fun assoc_thm'" in that they do NOT handle
556 overlays by re-using an identifier in different thys.*)
557 fun assoc_rls (rls:rls') = ((#2 o the o assoc')(!ruleset',rls))
558 handle _ => raise error ("ME_Isa: '"^rls^"' not in system");
559 (*fun assoc_rls (rls:rls') = ((the o assoc')(!ruleset',rls))
560 handle _ => raise error ("ME_Isa: '"^rls^"' not in system");*)
562 (*.overwrite an element in an association list and pair it with a thyID
563 in order to create the thy_hierarchy;
564 overwrites existing rls' even if they are defined in a different thy;
565 this is related to assoc_rls, TODO.WN060120: assoc_rew_ord, assoc_calc;.*)
566 (*WN060120 ...these are NOT compatible to "fun assoc_thm'" in that
567 they do NOT handle overlays by re-using an identifier in different thys;
568 "thyID.rlsID" would be a good solution, if the "." would be possible
570 actually a hack to get alltogether run again with minimal effort*)
571 fun insthy thy' (rls', rls) = (rls', (thy', rls));
572 fun overwritelthy thy (al, bl:(rls' * rls) list) =
573 let val bl' = map (insthy ((get_thy o theory2theory') thy)) bl
574 in overwritel (al, bl') end;
576 fun assoc_rew_ord ro = ((the o assoc') (!rew_ord',ro))
577 handle _ => raise error ("ME_Isa: rew_ord '"^ro^"' not in system");
578 (*get the string for stac from rule*)
579 fun assoc_calc ([], key) = raise error ("assoc_calc: '"^ key ^"' not found")
580 | assoc_calc ((calc, (keyi, xi)) :: pairs, key) =
581 if key = keyi then calc else assoc_calc (pairs, key);
582 (*only used for !calclist'...*)
583 fun assoc1 ([], key) = raise error ("assoc1 (for met.calc=): '"^ key
585 | assoc1 ((all as (keyi, _)) :: pairs, key) =
586 if key = keyi then all else assoc1 (pairs, key);
588 (*TODO.WN080102 clarify usage of type cal and type calc..*)
589 fun calID2calcID (calID : calID) =
590 let fun ass [] = raise error ("calID2calcID: "^calID^"not in calclist'")
591 | ass ((calci, (cali, eval_fn))::ids) =
592 if calID = cali then calci
594 in ass (!calclist') : calcID end;
596 (*fun termopt2str (SOME t) =
597 "SOME " ^ (Sign.string_of_term (sign_of(assoc_thy "Isac.thy")) t)
598 | termopt2str NONE = "NONE";*)
599 fun termopt2str (SOME t) =
600 "SOME " ^ (Syntax.string_of_term (ctxt_Isac"") t)
601 | termopt2str NONE = "NONE";
602 fun term2str t = Syntax.string_of_term (ctxt_Isac"") t;
603 fun terms2str ts= (strs2str o (map (Syntax.string_of_term
605 (*fun type2str typ = Sign.string_of_typ (sign_of (assoc_thy "Isac.thy")) typ;*)
606 fun type2str typ = Syntax.string_of_typ (ctxt_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 = ref false;
636 (*.depth of recursion in traces of the rewriter, if trace_rewrite:=true.*)
637 val depth = ref 99999;
638 (*.no of rewrites exceeding this int -> NO rewrite.*)
639 (*WN060829 still unused...*)
640 val lim_rewrite = ref 99999;
641 (*.no of derivation-elements exceeding this int -> SOME derivation-elements.*)
642 val lim_deriv = 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 = 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;