funpack: repair remaining test/../partial_fractions.sml, inverse_z_transform.sml
1 (* ~~/src/Tools/isac/calcelems.sml
2 elements of calculations.
3 they are partially held in association lists as ref's for
4 switching language levels (meta-string, object-values).
5 in order to keep these ref's during re-evaluation of code,
6 they are defined here at the beginning of the code.
7 Author: Walther Neuper 2003
8 (c) copyright due to lincense terms
11 signature CALC_ELEMENT =
20 datatype 'a ptyp = Ptyp of string * 'a list * 'a ptyp list
24 val env2str: Rule.subst -> string
25 val subst2str: Rule.subst -> string
26 val subst2str': Rule.subst -> string
30 = Hcal of {calc: Rule.calc, coursedesign: authors, guh: guh, mathauthors: authors}
31 | Hord of {coursedesign: authors, guh: guh, mathauthors: authors, ord: Rule.subst -> term * term -> bool}
32 | Hrls of {coursedesign: authors, guh: guh, mathauthors: authors, thy_rls: Rule.thyID * Rule.rls}
33 | Hthm of {coursedesign: authors, fillpats: fillpat list, guh: guh, mathauthors: authors, thm: thm}
34 | Html of {coursedesign: authors, guh: guh, html: string, mathauthors: authors}
37 val merge_rlss: rlss_elem list * rlss_elem list -> rlss_elem list
38 val rls_eq: (''a * ('b * 'c)) * (''a * ('d * 'e)) -> bool
40 val cas_eq: cas_elem * cas_elem -> bool
42 val merge_ptyps: 'a ptyp list * 'a ptyp list -> 'a ptyp list
43 val check_guhs_unique: bool Unsynchronized.ref
44 val check_pblguh_unique: guh -> pbt ptyp list -> unit
45 val insrt: pblID -> 'a -> string list -> 'a ptyp list -> 'a ptyp list
47 val check_metguh_unique: guh -> met ptyp list -> unit
48 val add_thydata: string list * string list -> thydata -> thydata ptyp list -> thydata ptyp list
49 val get_py: 'a ptyp list -> pblID -> string list -> 'a
50 val update_hthm: thydata -> fillpat list -> thydata
51 val update_ptyps: string list -> string list -> 'a -> 'a ptyp list -> 'a ptyp list
52 val part2guh: theID -> guh
53 val spec2str: string * string list * string list -> string
54 val linefeed: string -> string
55 val pbts2str: pbt list -> string
56 val thes2str: thydata list -> string
57 val theID2str: string list -> string
58 val the2str: thydata -> string
59 val trace_calc: bool Unsynchronized.ref
62 datatype lrd = D | L | R
63 val trace_rewrite: bool Unsynchronized.ref
64 val depth: int Unsynchronized.ref
65 val assoc_thy: Rule.theory' -> theory
67 val loc_2str: loc_ -> string
69 val metID2str: string list -> string
74 datatype ketype = Exp_ | Met_ | Pbl_ | Thy_
76 val app_py: 'a ptyp list -> ('a ptyp -> 'b) -> pblID -> string list -> 'b
77 val ketype2str: ketype -> string
78 val coll_pblguhs: pbt ptyp list -> guh list
79 val coll_metguhs: met ptyp list -> guh list
81 val pats2str: pat list -> string
82 val maxthy: theory -> theory -> theory
84 val lim_deriv: int Unsynchronized.ref
85 val id_of_thm: Rule.rule -> string
86 val isabthys: unit -> theory list
87 val thyID_of_derivation_name: string -> string
88 val partID': Rule.theory' -> string
89 val thm2guh: string * Rule.thyID -> thmID -> guh
90 val thmID_of_derivation_name: string -> string
91 val rls2guh: string * Rule.thyID -> Rule.rls' -> guh
92 val theID2guh: theID -> guh
94 type pbt_ = string * (term * term)
96 val cal2guh: string * Rule.thyID -> string -> guh
97 val ketype2str': ketype -> string
98 val str2ketype': string -> ketype
99 val thmID_of_derivation_name': thm -> string
101 val theID2thyID: theID -> Rule.thyID
102 val thy2guh: theID -> guh
103 val thypart2guh: theID -> guh
104 val ord2guh: string * Rule.theory' -> string -> string
105 val update_hrls: thydata -> Rule.errpatID list -> thydata
108 val thm''_of_thm: thm -> thm''
109 val thm_of_thm: Rule.rule -> thm
110 (* ---- for tests only: shifted from below to remove the Warning "unused" at fun.def. --------- *)
111 val thm2str: thm -> string
112 val pats2str' : pat list -> string
113 val insert_fillpats: thydata ptyp list -> (pblID * fillpat list) list -> thydata ptyp list ->
115 (*/-------------------------------------------------------- ! aktivate for Test_Isac BEGIN ---\* )
116 val knowthys: unit -> theory list
119 ( *\--- ! aktivate for Test_Isac END ----------------------------------------------------------/*)
121 (*----- unused code, kept as hints to design ideas ---------------------------------------------*)
122 val overwritelthy: theory -> (Rule.rls' * (string * Rule.rls)) list * (Rule.rls' * Rule.rls) list ->
123 (Rule.rls' * (string * Rule.rls)) list end
126 structure Celem(**): CALC_ELEMENT(**) =
129 val linefeed = (curry op^) "\n"; (* ?\<longrightarrow> libraryC ?*)
130 type authors = string list;
136 Thm (string, thm): (a) needs string to identify sym_thmID for handling in front-end;
137 (b) investigate if ""RS sym" attaches a [.]" still occurs: string_of_thmI
138 thmID : type for data from user input + program
139 thmDeriv : type for thy_hierarchy ONLY
140 obsolete types : thm' (SEE "ad thm'"), thm''.
141 revise funs : id_of_thm, thm_of_thm, rep_thm_G', eq_thmI, eq_thmI', thm''_of_thm thm.
142 activate : thmID_of_derivation_name'
144 type thmID = string; (* identifier for a thm (the shortest possible identifier) *)
145 type thmDeriv = string; (* WN120524 deprecated
146 thyID ^"."^ xxx ^"."^ thmID, see fun thmID_of_derivation_name
147 WN120524: dont use Thm.derivation_name, this is destroyed by num_str;
148 Thm.get_name_hint survives num_str and seems perfectly reliable *)
150 type thm' = thmID * Rule.cterm';(*WN060610 deprecated in favour of thm''; WN180324: used in TODO review:
151 val thm'2xml : int -> Celem.thm' -> Celem.xml
152 val assoc_thm': theory -> Celem.thm' -> thm
153 | Calculate' of Rule.theory' * string * term * (term * Celem.thm')
155 (* tricky combination of (string, term) for theorems in Isac:
156 * case 1 general: frontend + lucin, e.g. applicable_in..Rewrite: (thmID, _) --> (thmID, thm)
157 by Global_Theory.get_thm, special cases ("add_commute",..) see convert_metaview_to_thmid.
158 * case 2 "sym_..": Global_Theory.get_thm..RS sym
159 * case 3 ad-hoc thm "#..." mk_thm from ad-hoc term (numerals only) in calculate_:
160 from applicable_in..Calculate: opstr --calculate_/adhoc_thm--> (thmID, thm)
162 type thm'' = thmID * thm; (* only for transport via libisabelle isac-java <--- ME *)
164 (*.a 'guh'='globally unique handle' is a string unique for each element
165 of isac's KEStore and persistent over time
166 (in particular under shifts within the respective hierarchy);
168 # guh NOT resistant agains shifts from one thy to another
169 (which is the price for Isabelle's design: thy's overwrite ids of subthy's)
170 # requirement for matchTheory: induce guh from tac + current thy
171 (see 'fun thy_containing_thm', 'fun thy_containing_rls' etc.)
172 TODO: introduce to pbl, met.*)
175 type xml = string; (* rm together with old code replaced by XML.tree *)
178 (* for (at least) 2 kinds of access:
179 (1) given an errpatID, find the respective fillpats (e.g. in fun find_fill_pats)
180 (2) given a thm, find respective fillpats *)
181 type fillpatID = string
183 fillpatID (* DESIGN ?TODO: give an order w.r.t difficulty ? *)
184 * term (* the pattern with fill-in gaps *)
185 * Rule.errpatID; (* which the fillpat would be a help for
186 DESIGN ?TODO: list for several patterns ? *)
189 (* WN0509 discussion:
190 #############################################################################
191 # How to manage theorys in subproblems wrt. the requirement, #
192 # that scripts should be re-usable ? #
193 #############################################################################
195 eg. 'Script Solve_rat_equation' calls 'SubProblem (RatEq',..'
196 which would not allow to 'solve (y'' = -M_b / EI, M_b)' by this script
197 because Biegelinie.thy is subthy of RatEq.thy and thus Biegelinie.M_b
198 is unknown in RatEq.thy and M_b cannot be parsed into the scripts guard
201 Preliminary solution:
202 # the thy in 'SubProblem (thy', pbl, arglist)' is not taken automatically,
203 # instead the 'maxthy (rootthy pt) thy' is taken for each subpbl
204 # however, a thy specified by the user in the rootpbl may lead to
205 errors in far-off subpbls (which are not yet reported properly !!!)
206 and interactively specifiying thys in subpbl is not very relevant.
208 Other solutions possible:
209 # always parse and type-check with Thy_Info_get_theory "Isac"
210 (rejected due to the vague idea eg. to re-use equations for R in C etc.)
211 # regard the subthy-relation in specifying thys of subpbls
212 # specifically handle 'SubProblem (undefined, pbl, arglist)'
218 val t = Thm.prop_of thm
219 val ctxt = Proof_Context.init_global (Thy_Info.get_theory ("Isac.Isac"))
220 val ctxt' = Config.put show_markup false ctxt
221 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
223 fun id_of_thm (Rule.Thm (id, _)) = id (* TODO re-arrange code for rule2str *)
224 | id_of_thm _ = raise ERROR ("id_of_thm: uncovered case " (* ^ rule2str r *))
225 fun thm_of_thm (Rule.Thm (_, thm)) = thm (* TODO re-arrange code for rule2str *)
226 | thm_of_thm _ = raise ERROR ("thm_of_thm: uncovered case " (* ^ rule2str r *))
228 fun thmID_of_derivation_name dn = last_elem (space_explode "." dn);
229 fun thmID_of_derivation_name' thm = (thmID_of_derivation_name o Thm.get_name_hint) thm
230 fun thyID_of_derivation_name dn = hd (space_explode "." dn);
231 fun thm''_of_thm thm = (thmID_of_derivation_name' thm, thm) : thm''
235 (*the key into the hierarchy ob theory elements*)
236 type theID = string list;
237 val theID2str = strs2str; (*theID eg. is ["IsacKnowledge", "Test", "Rulesets", "ac_plus_times"]*)
238 fun theID2thyID theID =
239 if length theID >= 3 then (last_elem o (drop_last_n 2)) theID
240 else error ("theID2thyID called with " ^ theID2str theID);
242 (*the key into the hierarchy ob problems*)
243 type pblID = string list; (* domID :: ...*)
244 val e_pblID = ["e_pblID"];
246 (*the key into the hierarchy ob methods*)
247 type metID = string list;
248 type spec = Rule.domID * pblID * metID;
249 fun spec2str (dom, pbl, met) =
250 "(" ^ quote dom ^ ", " ^ strs2str pbl ^ ", " ^ strs2str met ^ ")";
251 val e_metID = ["e_metID"];
252 val metID2str = strs2str;
253 val empty_spec = (Rule.e_domID, e_pblID, e_metID);
254 val e_spec = empty_spec;
256 (* association list with cas-commands, for generating a complete calc-head *)
258 (term list -> (* the arguments of the cas-command, eg. (x+1=2, x) *)
259 (term * (* description of an element *)
260 term list) (* value of the element (always put into a list) *)
261 list) (* of elements in the formalization *)
263 (term * (* cas-command, eg. 'solve' *)
264 (spec * (* theory, problem, method *)
266 fun cas_eq ((t1, (_, _)) : cas_elem, (t2, (_, _)) : cas_elem) = t1 = t2
268 (*either theID or pblID or metID*)
269 type kestoreID = string list;
271 (* for distinction of contexts WN130621: disambiguate with Isabelle's Context *)
272 datatype ketype = Exp_ | Thy_ | Pbl_ | Met_;
273 fun ketype2str Exp_ = "Exp_"
274 | ketype2str Thy_ = "Thy_"
275 | ketype2str Pbl_ = "Pbl_"
276 | ketype2str Met_ = "Met_";
277 fun ketype2str' Exp_ = "Example"
278 | ketype2str' Thy_ = "Theory"
279 | ketype2str' Pbl_ = "Problem"
280 | ketype2str' Met_ = "Method";
281 (* for conversion from XML *)
282 fun str2ketype' "exp" = Exp_
283 | str2ketype' "thy" = Thy_
284 | str2ketype' "pbl" = Pbl_
285 | str2ketype' "met" = Met_
286 | str2ketype' str = raise ERROR ("str2ketype': WRONG arg = " ^ str)
288 (* A tree for storing data defined in different theories
289 for access from the Interpreter and from dialogue authoring
290 using a string list as key.
291 'a is for pbt | met | thydata; after WN030424 naming "pbt" became inappropriate *)
293 Ptyp of string * (* element of the key *)
294 'a list * (* several pbts with different domIDs/thy TODO: select by subthy (isaref.p.69)
295 presently only _ONE_ elem FOR ALL KINDS OF CONTENT pbt | met | thydata *)
296 ('a ptyp) list; (* the children nodes *)
298 (* datatype for collecting thydata for hierarchy *)
299 (*WN060720 more consistent naming would be 'type thyelem' or 'thelem'*)
301 Html of {guh: guh, coursedesign: authors, mathauthors: authors, html: string}
302 | Hthm of {guh: guh, coursedesign: authors, mathauthors: authors, fillpats: fillpat list,
303 thm: thm} (* here no sym_thm, thus no thmID required *)
304 | Hrls of {guh: guh, coursedesign: authors, mathauthors: authors, thy_rls: (Rule.thyID * Rule.rls)}
305 | Hcal of {guh: guh, coursedesign: authors, mathauthors: authors, calc: Rule.calc}
306 | Hord of {guh: guh, coursedesign: authors, mathauthors: authors,
307 ord: (Rule.subst -> (term * term) -> bool)};
308 fun the2str (Html {guh, ...}) = guh
309 | the2str (Hthm {guh, ...}) = guh
310 | the2str (Hrls {guh, ...}) = guh
311 | the2str (Hcal {guh, ...}) = guh
312 | the2str (Hord {guh, ...}) = guh
313 fun thes2str thes = map the2str thes |> list2str;
315 (* notes on thehier concerning sym_thmID theorems (created in derivations, reverse rewriting)
316 (a): thehier does not contain sym_thmID theorems
317 (b): lookup for sym_thmID directly from Isabelle using sym_thm
318 (within math-engine NO lookup in thehier -- within java in *.xml only!)
319 TODO (c): export from thehier to xml
320 TODO (c1) creates one entry for "thmID" (and NONE for "sym_thmID") in the hierarchy
321 TODO (c2) creates 2 files "thy_*-thm-thmID.xml" and "thy_*-thm-sym_thmID.xml"
322 TODO (d): 1 entry in the MiniBrowser's hierarchy (generated from xml)
323 stands for both, "thmID" and "sym_thmID"
324 TODO (d1) lookup from calctxt
325 TODO (d1) lookup from from rule set in MiniBrowser *)
326 type thehier = (thydata ptyp) list;
327 (* required to determine sequence of main nodes of thehier in KEStore.thy *)
328 fun part2guh [str] = (case str of
329 "Isabelle" => "thy_isab_" ^ str ^ "-part" : guh
330 | "IsacScripts" => "thy_scri_" ^ str ^ "-part"
331 | "IsacKnowledge" => "thy_isac_" ^ str ^ "-part"
332 | str => raise ERROR ("thy2guh: called with \""^ str ^"\""))
333 | part2guh theID = raise ERROR ("part2guh called with theID = \"" ^ theID2str theID ^ "'");
335 fun thy2guh [part, thyID] = (case part of
336 "Isabelle" => "thy_isab_" ^ thyID
337 | "IsacScripts" => "thy_scri_" ^ thyID
338 | "IsacKnowledge" => "thy_isac_" ^ thyID
339 | str => raise ERROR ("thy2guh: called with \"" ^ str ^ "\""))
340 | thy2guh theID = raise ERROR ("thy2guh called with \"" ^ strs2str' theID ^ "\"");
342 fun thypart2guh ([part, thyID, thypart] : theID) = (case part of
343 "Isabelle" => "thy_isab_" ^ thyID ^ "-" ^ thypart : guh
344 | "IsacScripts" => "thy_scri_" ^ thyID ^ "-" ^ thypart
345 | "IsacKnowledge" => "thy_isac_" ^ thyID ^ "-" ^ thypart
346 | str => raise ERROR ("thypart2guh: called with '" ^ str ^ "'"))
347 | thypart2guh strs = raise ERROR ("thypart2guh called with \"" ^ strs2str' strs ^ "\"");
350 (* convert the data got via contextToThy to a globally unique handle.
351 there is another way to get the guh: get out of the 'theID' in the hierarchy *)
352 fun thm2guh (isa, thyID) thmID = case isa of
353 "Isabelle" => "thy_isab_" ^ Rule.theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID : guh
354 | "IsacKnowledge" => "thy_isac_" ^ Rule.theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID
355 | "IsacScripts" => "thy_scri_" ^ Rule.theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID
357 ("thm2guh called with (isa, thyID) = (" ^ isa ^ ", " ^ thyID ^ ") for thm = \"" ^ thmID ^ "\"");
359 fun rls2guh (isa, thyID) rls' = case isa of
360 "Isabelle" => "thy_isab_" ^ Rule.theory'2thyID thyID ^ "-rls-" ^ rls' : guh
361 | "IsacKnowledge" => "thy_isac_" ^ Rule.theory'2thyID thyID ^ "-rls-" ^ rls'
362 | "IsacScripts" => "thy_scri_" ^ Rule.theory'2thyID thyID ^ "-rls-" ^ rls'
364 ("rls2guh called with (isa, thyID) = (" ^ isa ^ ", " ^ thyID ^ ") for rls = \"" ^ rls' ^ "\"");
366 fun cal2guh (isa, thyID) calID = case isa of
367 "Isabelle" => "thy_isab_" ^ Rule.theory'2thyID thyID ^ "-cal-" ^ calID : guh
368 | "IsacKnowledge" => "thy_isac_" ^ Rule.theory'2thyID thyID ^ "-cal-" ^ calID
369 | "IsacScripts" => "thy_scri_" ^ Rule.theory'2thyID thyID ^ "-cal-" ^ calID
371 ("cal2guh called with (isa, thyID) = (" ^ isa ^ ", " ^ thyID ^ ") for cal = \"" ^ calID ^ "\"");
373 fun ord2guh (isa, thyID) rew_ord' = case isa of
374 "Isabelle" => "thy_isab_" ^ Rule.theory'2thyID thyID ^ "-ord-" ^ rew_ord' : guh
375 | "IsacKnowledge" => "thy_isac_" ^ Rule.theory'2thyID thyID ^ "-ord-" ^ rew_ord'
376 | "IsacScripts" => "thy_scri_" ^ Rule.theory'2thyID thyID ^ "-ord-" ^ rew_ord'
378 ("ord2guh called with (isa, thyID) = (" ^ isa ^ ", " ^ thyID ^ ") for ord = \"" ^ rew_ord' ^ "\"");
380 (* not only for thydata, but also for thy's etc *)
382 fun theID2guh theID = case length theID of
383 0 => error ("theID2guh: called with theID = " ^ strs2str' theID)
384 | 1 => part2guh theID
386 | 3 => thypart2guh theID
388 let val [isa, thyID, typ, elemID] = theID
390 "Theorems" => thm2guh (isa, thyID) elemID
391 | "Rulesets" => rls2guh (isa, thyID) elemID
392 | "Calculations" => cal2guh (isa, thyID) elemID
393 | "Orders" => ord2guh (isa, thyID) elemID
394 | "Theorems" => thy2guh [isa, thyID]
395 | str => raise ERROR ("theID2guh: called with theID = " ^ strs2str' theID)
397 | n => raise ERROR ("theID2guh called with theID = " ^ strs2str' theID);
399 (* not only for thydata, but also for thy's etc *)
400 fun theID2guh [] = raise ERROR ("theID2guh: called with []")
401 | theID2guh [str] = part2guh [str]
402 | theID2guh [s1, s2] = thy2guh [s1, s2]
403 | theID2guh [s1, s2, s3] = thypart2guh [s1, s2, s3]
404 | theID2guh (strs as [isa, thyID, typ, elemID]) = (case typ of
405 "Theorems" => thm2guh (isa, thyID) elemID
406 | "Rulesets" => rls2guh (isa, thyID) elemID
407 | "Calculations" => cal2guh (isa, thyID) elemID
408 | "Orders" => ord2guh (isa, thyID) elemID
409 | _ => raise ERROR ("theID2guh: called with theID = " ^ strs2str' strs))
410 | theID2guh strs = raise ERROR ("theID2guh called with theID = " ^ strs2str' strs);
413 type filename = string;
417 (* datastructure for KEStore_Elems, intermediate for thehier *)
419 (Rule.rls' * (* identifier unique within Isac *)
420 (Rule.theory' * (* just for assignment in thehier, not appropriate for parsing etc *)
421 Rule.rls)) (* ((#id o rep_rls) rls) = rls' by coding discipline *)
422 fun rls_eq ((id1, (_, _)), (id2, (_, _))) = id1 = id2
424 fun insert_merge_rls (re as (id, (thyID, r1)) : rlss_elem) ys =
425 case get_index (fn y => if curry rls_eq re y then SOME y else NONE) ys of
427 | SOME (i, (_, (_, r2))) =>
429 val r12 = Rule.merge_rls id r1 r2
430 in list_update ys i (id, (thyID, r12)) end
431 fun merge_rlss (s1, s2) = fold insert_merge_rls s1 s2;
436 then (Rule.Thy_Info_get_theory "Script") (*lower bound of Knowledge*)
437 else (Rule.Thy_Info_get_theory thy) handle _ => error ("ME_Isa: thy \"" ^ thy ^ "\" not in system");
439 (* overwrite an element in an association list and pair it with a thyID
440 in order to create the thy_hierarchy;
441 overwrites existing rls' even if they are defined in a different thy;
442 this is related to assoc_rls, TODO.WN060120: assoc_rew_ord, assoc_calc *)
443 (* WN060120 ...these are NOT compatible to "fun assoc_thm'" in that
444 they do NOT handle overlays by re-using an identifier in different thys;
445 "thyID.rlsID" would be a good solution, if the "." would be possible
447 actually a hack to get alltogether run again with minimal effort *)
448 fun insthy thy' (rls', rls) = (rls', (thy', rls));
449 fun overwritelthy thy (al, bl: (Rule.rls' * Rule.rls) list) =
450 let val bl' = map (insthy ((get_thy o Rule.theory2theory') thy)) bl
451 in overwritel (al, bl') end;
456 linefeed o pair2str o (apsnd Rule.term2str) o (apfst Rule.term2str)))) s;
460 pair2str o (apsnd Rule.term2str) o (apfst Rule.term2str)))) s;
461 val env2str = subst2str;
463 fun maxthy thy1 thy2 = if Context.subthy (thy1, thy2) then thy2 else thy1;
466 (* trace internal steps of isac's numeral calculations *)
467 val trace_calc = Unsynchronized.ref false;
468 (* trace internal steps of isac's rewriter *)
469 val trace_rewrite = Unsynchronized.ref false;
470 (* depth of recursion in traces of the rewriter, if trace_rewrite:=true *)
471 val depth = Unsynchronized.ref 99999;
472 (* no of rewrites exceeding this int -> NO rewrite *)
473 val lim_deriv = Unsynchronized.ref 100;
474 (* switch for checking guhs unique before storing a pbl or met;
475 set true at startup (done at begin of ROOT.ML)
476 set false for editing IsacKnowledge (done at end of ROOT.ML) *)
477 val check_guhs_unique = Unsynchronized.ref true;
480 datatype lrd = (*elements of "type loc_" into an Isabelle term*)
482 | R (*go right at $*)
483 | D; (*go down at Abs*)
484 type loc_ = lrd list;
488 fun loc_2str k = (strs2str' o (map ldr2str)) k;
491 (* the pattern for an item of a problems model or a methods guard *)
493 (string * (* field *)
494 (term * (* description *)
495 term)) (* id | arbitrary term *);
496 fun pat2str ((field, (dsc, id)) : pat) =
497 pair2str (field, pair2str (Rule.term2str dsc, Rule.term2str id))
498 fun pats2str pats = (strs2str o (map pat2str)) pats
499 fun pat2str' ((field, (dsc, id)) : pat) =
500 pair2str (field, pair2str (Rule.term2str dsc, Rule.term2str id)) ^ "\n"
501 fun pats2str' pats = (strs2str o (map pat2str')) pats
503 (* types for problems models (TODO rename to specification models) *)
505 (string * (* field "#Given",..*)(*deprecated due to 'type pat'*)
506 (term * (* description *)
507 term)); (* id | struct-var *)
509 {guh : guh, (* unique within this isac-knowledge *)
510 mathauthors : string list, (* copyright *)
511 init : pblID, (* to start refinement with *)
512 thy : theory, (* which allows to compile that pbt
513 TODO: search generalized for subthy (ref.p.69*)
514 (*^^^ WN050912 NOT used during application of the problem,
515 because applied terms may be from 'subthy' as well as from super;
516 thus we take 'maxthy'; see match_ags ! *)
517 cas : term option, (* 'CAS-command' *)
518 prls : Rule.rls, (* for preds in where_ *)
519 where_ : term list, (* where - predicates *)
520 ppc : pat list, (* this is the model-pattern;
521 it contains "#Given","#Where","#Find","#Relate"-patterns
522 for constraints on identifiers see "fun cpy_nam" *)
523 met : metID list} (* methods solving the pbt *)
525 val e_pbt = {guh = "pbl_empty", mathauthors = [], init = e_pblID, thy = Thy_Info.get_theory "Pure",
526 cas = NONE, prls = Rule.Erls, where_ = [], ppc = [], met = []} : pbt
527 fun pbt2str ({cas = cas', guh = guh', init = init', mathauthors = ma', met = met', ppc = ppc',
528 prls = prls', thy = thy', where_ = w'} : pbt)
529 = "{cas = " ^ (Rule.termopt2str cas') ^ ", guh = \"" ^ guh' ^ "\", init = "
530 ^ (strs2str init') ^ ", mathauthors = " ^ (strs2str ma' |> quote) ^ ", met = "
531 ^ (strslist2strs met') ^ ", ppc = " ^ pats2str ppc' ^ ", prls = "
532 ^ (Rule.rls2str prls' |> quote) ^ ", thy = {" ^ (Rule.theory2str thy') ^ "}, where_ = "
533 ^ (Rule.terms2str w') ^ "}" |> linefeed;
534 fun pbts2str pbts = map pbt2str pbts |> list2str;
536 val e_Ptyp = Ptyp ("e_pblID", [e_pbt], [])
537 type ptyps = (pbt ptyp) list
539 fun coll_pblguhs pbls =
541 fun node coll (Ptyp (_, [n], ns)) = [(#guh : pbt -> guh) n] @ (nodes coll ns)
542 | node _ _ = raise ERROR "coll_pblguhs - node"
543 and nodes coll [] = coll
544 | nodes coll (n :: ns) = (node coll n) @ (nodes coll ns);
545 in nodes [] pbls end;
546 fun check_pblguh_unique guh pbls =
547 if member op = (coll_pblguhs pbls) guh
548 then error ("check_guh_unique failed with \""^ guh ^"\";\n"^
549 "use \"sort_pblguhs()\" for a list of guhs;\n"^
550 "consider setting \"check_guhs_unique := false\"")
553 fun insrt _ pbt [k] [] = [Ptyp (k, [pbt], [])]
554 | insrt d pbt [k] ((Ptyp (k', [p], ps)) :: pys) =
555 ((*writeln ("### insert 1: ks = " ^ strs2str [k] ^ " k'= " ^ k');*)
557 then ((Ptyp (k', [pbt], ps)) :: pys)
558 else ((Ptyp (k', [p], ps)) :: (insrt d pbt [k] pys))
560 | insrt d pbt (k::ks) ((Ptyp (k', [p], ps)) :: pys) =
561 ((*writeln ("### insert 2: ks = "^(strs2str (k::ks))^" k'= "^k');*)
563 then ((Ptyp (k', [p], insrt d pbt ks ps)) :: pys)
566 then error ("insert: not found " ^ (strs2str (d : pblID)))
567 else ((Ptyp (k', [p], ps)) :: (insrt d pbt (k :: ks) pys))
569 | insrt _ _ _ _ = raise ERROR "";
571 fun update_ptyps ID _ _ [] =
572 error ("update_ptyps: " ^ strs2str' ID ^ " does not exist")
573 | update_ptyps ID [i] data ((py as Ptyp (key, _, pys)) :: pyss) =
577 then ((Ptyp (key, [data], [])) :: pyss)
578 else error ("update_ptyps: " ^ strs2str' ID ^ " has descendants")
579 else py :: update_ptyps ID [i] data pyss
580 | update_ptyps ID (i :: is) data ((py as Ptyp (key, d, pys)) :: pyss) =
582 then ((Ptyp (key, d, update_ptyps ID is data pys)) :: pyss)
583 else (py :: (update_ptyps ID (i :: is) data pyss))
584 | update_ptyps _ _ _ _ = raise ERROR "update_ptyps called with undef pattern.";
586 (* this function only works wrt. the way Isabelle evaluates Theories and is not a general merge
587 function for trees / ptyps *)
588 fun merge_ptyps ([], pt) = pt
589 | merge_ptyps (pt, []) = pt
590 | merge_ptyps ((x' as Ptyp (k, _, ps)) :: xs, (xs' as Ptyp (k', y, ps') :: ys)) =
592 then Ptyp (k, y, merge_ptyps (ps, ps')) :: merge_ptyps (xs, ys)
593 else x' :: merge_ptyps (xs, xs');
595 (* data for methods stored in 'methods'-database*)
597 {guh : guh, (* unique within this isac-knowledge *)
598 mathauthors: string list, (* copyright *)
599 init : pblID, (* WN060721 introduced mistakenly--TODO.REMOVE! *)
600 rew_ord' : Rule.rew_ord', (* for rules in Detail
601 TODO.WN0509 store fun itself, see 'type pbt' *)
602 erls : Rule.rls, (* the eval_rls for cond. in rules FIXME "rls'
603 instead erls in "fun prep_met" *)
604 srls : Rule.rls, (* for evaluating list expressions in scr *)
605 prls : Rule.rls, (* for evaluating predicates in modelpattern *)
606 crls : Rule.rls, (* for check_elementwise, ie. formulae in calc. *)
607 nrls : Rule.rls, (* canonical simplifier specific for this met *)
608 errpats : Rule.errpat list,(* error patterns expected in this method *)
609 calc : Rule.calc list, (* Theory_Data in fun prep_met *)
610 (*branch : TransitiveB set in append_problem at generation ob pblobj *)
611 ppc : pat list, (* items in given, find, relate;
612 items (in "#Find") which need not occur in the arg-list of a SubProblem
613 are 'copy-named' with an identifier "*'.'".
614 copy-named items are 'generating' if they are NOT "*'''" ?WN120516??
615 see ME/calchead.sml 'fun is_copy_named'. *)
616 pre : term list, (* preconditions in where *)
617 scr : Rule.scr (* progam, empty as @{thm refl} or Rfuns *)
619 val e_met = {guh = "met_empty", mathauthors = [], init = e_metID, rew_ord' = "e_rew_ord'",
620 erls = Rule.e_rls, srls = Rule.e_rls, prls = Rule.e_rls, calc = [], crls = Rule.e_rls,
621 errpats = [], nrls = Rule.e_rls, ppc = [], pre = [], scr = Rule.EmptyScr};
622 val e_Mets = Ptyp ("e_metID", [e_met],[]);
624 type mets = (met ptyp) list;
625 fun coll_metguhs mets =
627 fun node coll (Ptyp (_, [n], ns)) = [(#guh : met -> guh) n] @ (nodes coll ns)
628 | node _ _ = raise ERROR "coll_pblguhs - node"
629 and nodes coll [] = coll
630 | nodes coll (n :: ns) = (node coll n) @ (nodes coll ns);
631 in nodes [] mets end;
632 fun check_metguh_unique (guh:guh) (mets: (met ptyp) list) =
633 if member op = (coll_metguhs mets) guh
634 then raise ERROR ("check_guh_unique failed with \"" ^ guh ^"\";\n"^
635 (*"use \"sort_metguhs()\" for a list of guhs;\n" ^ ...evaluates to [] ?!?*)
636 "consider setting \"check_guhs_unique := false\"")
639 fun Html_default exist = (Html {guh = theID2guh exist,
640 coursedesign = ["isac team 2006"], mathauthors = [], html = ""})
642 fun fill_parents (_, [i]) thydata = Ptyp (i, [thydata], [])
643 | fill_parents (exist, i :: is) thydata =
644 Ptyp (i, [Html_default (exist @ [i])], [fill_parents (exist @ [i], is) thydata])
645 | fill_parents _ _ = raise ERROR "Html_default: avoid ML warning: Matches are not exhaustive"
647 fun add_thydata (exist, is) thydata [] = [fill_parents (exist, is) thydata]
648 | add_thydata (exist, [i]) data (pys as (py as Ptyp (key, _, _)) :: pyss) =
650 then pys (* preserve existing thydata *)
651 else py :: add_thydata (exist, [i]) data pyss
652 | add_thydata (exist, iss as (i :: is)) data ((py as Ptyp (key, d, pys)) :: pyss) =
656 then Ptyp (key, d, [fill_parents (exist @ [i], is) data]) :: pyss
657 else Ptyp (key, d, add_thydata (exist @ [i], is) data pys) :: pyss
658 else py :: add_thydata (exist, iss) data pyss
659 | add_thydata _ _ _ = raise ERROR "add_thydata: avoid ML warning: Matches are not exhaustive"
661 fun update_hthm (Hthm {guh, coursedesign, mathauthors, thm, ...}) fillpats' =
662 Hthm {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,
663 fillpats = fillpats', thm = thm}
664 | update_hthm _ _ = raise ERROR "update_hthm: wrong arguments";
666 (* for dialog-authoring *)
667 fun update_hrls (Hrls {guh, coursedesign, mathauthors, thy_rls = (thyID, rls)}) errpatIDs =
671 Rule.Rls {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...}
672 => Rule.Rls {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,
673 calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}
674 | Rule.Seq {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...}
675 => Rule.Seq {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,
676 calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}
677 | Rule.Rrls {id, prepat, rew_ord, erls, calc, scr, ...}
678 => Rule.Rrls {id = id, prepat = prepat, rew_ord = rew_ord, erls = erls, calc = calc,
679 scr = scr, errpatts = errpatIDs}
682 Hrls {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,
683 thy_rls = (thyID, rls')}
685 | update_hrls _ _ = raise ERROR "update_hrls: wrong arguments";
687 fun app_py p f (d:pblID) (k(*:pblRD*)) =
689 fun py_err _ = raise ERROR ("app_py: not found: " ^ strs2str d);
690 fun app_py' _ [] = py_err ()
691 | app_py' [] _ = py_err ()
692 | app_py' [k0] ((p' as Ptyp (k', _, _ )) :: ps) =
693 if k0 = k' then f p' else app_py' [k0] ps
694 | app_py' (k' as (k0 :: ks)) (Ptyp (k'', _, ps) :: ps') =
695 if k0 = k'' then app_py' ks ps else app_py' k' ps';
699 fun extract_py (Ptyp (_, [py], _)) = py
700 | extract_py _ = raise ERROR ("extract_py: Ptyp has wrong format.");
701 in app_py p extract_py end;
703 fun (*KEStore_Elems.*)insert_fillpats th fis = (* for tests bypassing setup KEStore_Elems *)
705 fun update_elem th (theID, fillpats) =
707 val hthm = get_py th theID theID
708 val hthm' = update_hthm hthm fillpats
709 handle ERROR _ => error ("insert_fillpats: " ^ strs2str theID ^ "must address a theorem")
710 in update_ptyps theID theID hthm' end
711 in fold (update_elem th) fis end
713 (* group the theories defined in Isac, compare Build_Thydata:
714 section "Get and group the theories defined in Isac" *)
715 fun isabthys () = (*["Complex_Main", "Taylor", .., "Pure"]*)
717 val allthys = Theory.ancestors_of (Rule.Thy_Info_get_theory "Build_Thydata")
719 drop ((find_index (curry Context.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys), allthys)
721 fun knowthys () = (*["Isac", .., "Descript", "Delete"]*)
723 fun isacthys () = (* ["Isac", .., "KEStore"] without Build_Isac thys: "Interpret" etc *)
725 val allthys = filter_out (member Context.eq_thy
726 [(*Thy_Info_get_theory "ProgLang",*) Rule.Thy_Info_get_theory "Interpret",
727 Rule.Thy_Info_get_theory "xmlsrc", Rule.Thy_Info_get_theory "Frontend"])
728 (Theory.ancestors_of (Rule.Thy_Info_get_theory "Build_Thydata"))
730 take ((find_index (curry Context.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys),
733 val isacthys' = isacthys ()
734 val proglang_parent = Rule.Thy_Info_get_theory "ProgLang"
736 take ((find_index (curry Context.eq_thy proglang_parent) isacthys'), isacthys')
739 fun progthys () = (*["Isac", .., "Descript", "Delete"]*)
741 fun isacthys () = (* ["Isac", .., "KEStore"] without Build_Isac thys: "Interpret" etc *)
743 val allthys = filter_out (member Context.eq_thy
744 [(*Thy_Info_get_theory "ProgLang",*) Rule.Thy_Info_get_theory "Interpret",
745 Rule.Thy_Info_get_theory "xmlsrc", Rule.Thy_Info_get_theory "Frontend"])
746 (Theory.ancestors_of (Rule.Thy_Info_get_theory "Build_Thydata"))
748 take ((find_index (curry Context.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys),
751 val isacthys' = isacthys ()
752 val proglang_parent = Rule.Thy_Info_get_theory "ProgLang"
754 drop ((find_index (curry Context.eq_thy proglang_parent) isacthys') + 1(*ProgLang*), isacthys')
758 if member Context.eq_thy (knowthys ()) thy then "IsacKnowledge"
759 else if member Context.eq_thy (progthys ()) thy then "IsacScripts"
760 else if member Context.eq_thy (isabthys ()) thy then "Isabelle"
761 else error ("closure of thys in Isac is broken by " ^ Rule.string_of_thy thy)
762 fun partID' thy' = partID (Rule.Thy_Info_get_theory thy')