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