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