neuper@37906
|
1 |
(* elements of calculations.
|
neuper@37906
|
2 |
they are partially held in association lists as ref's for
|
neuper@37906
|
3 |
switching language levels (meta-string, object-values).
|
neuper@37906
|
4 |
in order to keep these ref's during re-evaluation of code,
|
neuper@42399
|
5 |
they are defined here at the beginning of the code.
|
neuper@42399
|
6 |
Author: Walther Neuper 2003
|
neuper@42399
|
7 |
(c) copyright due to lincense terms
|
neuper@37906
|
8 |
*)
|
neuper@37906
|
9 |
|
neuper@38061
|
10 |
(*
|
neuper@38061
|
11 |
structure CalcElems =
|
neuper@38061
|
12 |
struct
|
neuper@38061
|
13 |
*)
|
neuper@37906
|
14 |
val linefeed = (curry op^) "\n";
|
neuper@37906
|
15 |
type authors = string list;
|
neuper@37906
|
16 |
|
neuper@37906
|
17 |
type cterm' = string;
|
neuper@37906
|
18 |
val empty_cterm' = "empty_cterm'";
|
neuper@42399
|
19 |
|
neuper@42399
|
20 |
type thmID = string; (* identifier for a thm (the shortest possible identifier) *)
|
neuper@42434
|
21 |
type thmDeriv = string; (* WN120524 deprecated
|
neuper@42434
|
22 |
thyID ^"."^ xxx ^"."^ thmID, see fun thmID_of_derivation_name
|
neuper@42434
|
23 |
WN120524: dont use Thm.derivation_name, this is destroyed by num_str;
|
neuper@42434
|
24 |
Thm.get_name_hint survives num_str and seems perfectly reliable *)
|
neuper@42399
|
25 |
|
neuper@37906
|
26 |
type thm' = thmID * cterm';(*WN060610 deprecated in favour of thm''*)
|
neuper@37906
|
27 |
type thm'' = thmID * term;
|
neuper@37906
|
28 |
type rls' = string;
|
neuper@42399
|
29 |
|
neuper@40836
|
30 |
(*.a 'guh'='globally unique handle' is a string unique for each element
|
neuper@37906
|
31 |
of isac's KEStore and persistent over time
|
neuper@37906
|
32 |
(in particular under shifts within the respective hierarchy);
|
neuper@40836
|
33 |
specialty for thys:
|
neuper@37906
|
34 |
# guh NOT resistant agains shifts from one thy to another
|
neuper@37906
|
35 |
(which is the price for Isabelle's design: thy's overwrite ids of subthy's)
|
neuper@37906
|
36 |
# requirement for matchTheory: induce guh from tac + current thy
|
neuper@37906
|
37 |
(see 'fun thy_containing_thm', 'fun thy_containing_rls' etc.)
|
neuper@40836
|
38 |
TODO: introduce to pbl, met.*)
|
neuper@37906
|
39 |
type guh = string;
|
neuper@37906
|
40 |
val e_guh = "e_guh":guh;
|
neuper@37906
|
41 |
|
neuper@37906
|
42 |
type xml = string;
|
neuper@37906
|
43 |
|
neuper@52154
|
44 |
(* eval function calling sml code during rewriting.
|
neuper@52154
|
45 |
Unifying "type cal" and "type calc" would make Lucas-Interpretation more efficient,
|
neuper@52154
|
46 |
see "fun rule2stac": instead of
|
neuper@52154
|
47 |
Calc: calID * eval_fn -> rule
|
neuper@52154
|
48 |
would be better
|
neuper@52154
|
49 |
Calc: prog_calcID * (calID * eval_fn)) -> rule*)
|
neuper@37906
|
50 |
type eval_fn = (string -> term -> theory -> (string * term) option);
|
neuper@37906
|
51 |
fun e_evalfn (_:'a) (_:term) (_:theory) = NONE:(string * term) option;
|
neuper@37906
|
52 |
(*. op in isa-term 'Const(op,_)' .*)
|
neuper@37906
|
53 |
type calID = string;
|
neuper@52154
|
54 |
|
neuper@52154
|
55 |
(* *)
|
neuper@37906
|
56 |
type cal = (calID * eval_fn);
|
neuper@37906
|
57 |
(*. fun calculate_ fetches the evaluation-function via this list. *)
|
neuper@52117
|
58 |
type prog_calcID = string;
|
neuper@52117
|
59 |
type calc = (prog_calcID * cal);
|
neuper@52141
|
60 |
type calc_elem =
|
neuper@52141
|
61 |
prog_calcID * (* a simple identifier used in programs *)
|
neuper@52141
|
62 |
(calID * (* a long identifier used in Const *)
|
neuper@52141
|
63 |
eval_fn) (* an ML function *)
|
neuper@52141
|
64 |
fun calc_eq ((pi1, (ci1, _)) : calc_elem, (pi2, (ci2, _)) : calc_elem) =
|
neuper@52141
|
65 |
if pi1 = pi2
|
neuper@52141
|
66 |
then if ci1 = ci2 then true else error ("calc_eq: " ^ ci1 ^ " <> " ^ ci2)
|
neuper@52141
|
67 |
else false
|
neuper@52141
|
68 |
|
neuper@37906
|
69 |
|
neuper@37906
|
70 |
type subs' = (cterm' * cterm') list; (*16.11.00 for FE-KE*)
|
neuper@37906
|
71 |
type subst = (term * term) list; (*here for ets2str*)
|
neuper@37906
|
72 |
val e_subst = []:(term * term) list;
|
neuper@37906
|
73 |
|
neuper@37906
|
74 |
(*TODO.WN060610 make use of "type rew_ord" total*)
|
neuper@37906
|
75 |
type rew_ord' = string;
|
neuper@37906
|
76 |
val e_rew_ord' = "e_rew_ord" : rew_ord';
|
neuper@37906
|
77 |
type rew_ord_ = subst -> Term.term * Term.term -> bool;
|
neuper@37906
|
78 |
fun dummy_ord (_:subst) (_:term,_:term) = true;
|
neuper@37906
|
79 |
val e_rew_ord_ = dummy_ord;
|
neuper@37906
|
80 |
type rew_ord = rew_ord' * rew_ord_;
|
neuper@37906
|
81 |
val e_rew_ord = dummy_ord; (* TODO.WN071231 clarify identifiers..e_rew_ordX*)
|
neuper@37906
|
82 |
val e_rew_ordX = (e_rew_ord', e_rew_ord_) : rew_ord;
|
neuper@37906
|
83 |
|
neuper@42451
|
84 |
(* error patterns and fill patterns *)
|
neuper@42451
|
85 |
type errpatID = string
|
neuper@42451
|
86 |
type errpat =
|
neuper@42451
|
87 |
errpatID (* one identifier for a list of patterns
|
neuper@42451
|
88 |
DESIGN ?TODO: errpatID list for hierarchy of errpats ? *)
|
neuper@42451
|
89 |
* term list (* error patterns *)
|
neuper@42451
|
90 |
* thm list (* thms related to error patterns; note that respective lhs
|
neuper@42451
|
91 |
do not match (which reflects student's error).
|
neuper@42451
|
92 |
fillpatterns are stored with these thms. *)
|
neuper@42451
|
93 |
|
neuper@42451
|
94 |
(* for (at least) 2 kinds of access:
|
neuper@42451
|
95 |
(1) given an errpatID, find the respective fillpats (e.g. in fun find_fill_pats)
|
neuper@42451
|
96 |
(2) given a thm, find respective fillpats *)
|
neuper@42451
|
97 |
type fillpatID = string
|
neuper@42451
|
98 |
type fillpat =
|
neuper@42451
|
99 |
fillpatID (* DESIGN ?TODO: give an order w.r.t difficulty ? *)
|
neuper@42451
|
100 |
* term (* the pattern with fill-in gaps *)
|
neuper@42451
|
101 |
* errpatID; (* which the fillpat would be a help for
|
neuper@42451
|
102 |
DESIGN ?TODO: list for several patterns ? *)
|
neuper@37906
|
103 |
|
neuper@40836
|
104 |
datatype rule =
|
neuper@37906
|
105 |
Erule (*.the empty rule .*)
|
neuper@40836
|
106 |
| Thm of (string * Basic_Thm.thm)(*.a theorem, ie (identifier, Thm.thm).*)
|
neuper@37906
|
107 |
| Calc of string * (*.sml-code manipulating a (sub)term .*)
|
neuper@37906
|
108 |
(string -> term -> theory -> (string * term) option)
|
neuper@37906
|
109 |
| Cal1 of string * (*.sml-code applied only to whole term
|
neuper@37906
|
110 |
or left/right-hand-side of eqality .*)
|
neuper@37906
|
111 |
(string -> term -> theory -> (string * term) option)
|
neuper@37906
|
112 |
| Rls_ of rls (*.ie. rule sets may be nested.*)
|
neuper@40836
|
113 |
and scr =
|
neuper@40836
|
114 |
EmptyScr
|
neuper@52084
|
115 |
| Prog of term (* for met *)
|
neuper@52101
|
116 |
| Rfuns of (* for Rrls, usage see rational.sml ----- reverse rewrite ----- *)
|
neuper@52084
|
117 |
{init_state : (* initialise for reverse rewriting by the Interpreter *)
|
neuper@52084
|
118 |
term -> (* for this the rrlsstate is initialised: *)
|
neuper@52084
|
119 |
term * (* the current formula: goes locate_gen -> next_tac via istate *)
|
neuper@52084
|
120 |
term * (* the final formula *)
|
neuper@52084
|
121 |
rule list (* of reverse rewrite set (#1#) *)
|
neuper@52084
|
122 |
list * (* may be serveral, eg. in norm_rational *)
|
neuper@52084
|
123 |
( rule * (* Thm (+ Thm generated from Calc) resulting in ... *)
|
neuper@52084
|
124 |
(term * (* ... rewrite with ... *)
|
neuper@52084
|
125 |
term list)) (* ... assumptions *)
|
neuper@52084
|
126 |
list, (* derivation from given term to normalform
|
neuper@52084
|
127 |
in reverse order with sym_thm;
|
neuper@52084
|
128 |
(#1#) could be extracted from here #1 *)
|
neuper@52084
|
129 |
normal_form: (* the function which drives the Rrls ##############################*)
|
neuper@52084
|
130 |
term -> (term * term list) option,
|
neuper@52084
|
131 |
locate_rule: (* checks a rule R for being a cancel-rule, and if it is,
|
neuper@52084
|
132 |
then return the list of rules (+ the terms they are rewriting to)
|
neuper@52084
|
133 |
which need to be applied before R should be applied.
|
neuper@52084
|
134 |
precondition: the rule is applicable to the argument-term. *)
|
neuper@52084
|
135 |
rule list list -> (* the reverse rule list *)
|
neuper@52084
|
136 |
term -> (* ... to which the rule shall be applied *)
|
neuper@52084
|
137 |
rule -> (* ... to be applied to term *)
|
neuper@52084
|
138 |
( rule * (* value: a rule rewriting to ... *)
|
neuper@52084
|
139 |
(term * (* ... the resulting term ... *)
|
neuper@52084
|
140 |
term list)) (* ... with the assumptions ( //#0) *)
|
neuper@52084
|
141 |
list, (* there may be several such rules; the list is empty,
|
neuper@52084
|
142 |
if the rule has nothing to do with e.g. cancelation *)
|
neuper@52084
|
143 |
next_rule: (* for a given term return the next rules to be done for cancelling *)
|
neuper@52084
|
144 |
rule list list->(* the reverse rule list *)
|
neuper@52084
|
145 |
term -> (* the term for which ... *)
|
neuper@52084
|
146 |
rule option, (* ... this rule is appropriate for cancellation;
|
neuper@52084
|
147 |
there may be no such rule (if the term is eg.canceled already*)
|
neuper@52084
|
148 |
attach_form: (* checks an input term TI, if it may belong to e.g. a current
|
neuper@52084
|
149 |
cancellation, by trying to derive it from the given term TG.
|
neuper@52084
|
150 |
NOT IMPLEMENTED *)
|
neuper@52084
|
151 |
rule list list->(**)
|
neuper@52084
|
152 |
term -> (* TG, the last one agreed upon by user + math-eng *)
|
neuper@52084
|
153 |
term -> (* TI, the next one input by the user *)
|
neuper@52084
|
154 |
( rule * (* the rule to be applied in order to reach TI *)
|
neuper@52084
|
155 |
(term * (* ... obtained by applying the rule ... *)
|
neuper@52084
|
156 |
term list)) (* ... and the respective assumptions *)
|
neuper@52084
|
157 |
list} (* there may be several such rules; the list is empty, if the
|
neuper@52084
|
158 |
users term does not belong to e.g. a cancellation of the term
|
neuper@52084
|
159 |
last agreed upon. *)
|
neuper@37906
|
160 |
and rls =
|
neuper@37906
|
161 |
Erls (*for init e_rls*)
|
neuper@40836
|
162 |
|
neuper@37906
|
163 |
| Rls of (*a confluent and terminating ruleset, in general *)
|
neuper@37906
|
164 |
{id : string, (*for trace_rewrite:=true *)
|
neuper@37906
|
165 |
preconds : term list, (*unused WN020820 *)
|
neuper@37906
|
166 |
(*WN060616 for efficiency...
|
s1210629013@55444
|
167 |
bdvs : false, (*set in prep_rls' for get_bdvs *)*)
|
neuper@37906
|
168 |
rew_ord : rew_ord, (*for rules*)
|
neuper@37906
|
169 |
erls : rls, (*for the conditions in rules *)
|
neuper@37906
|
170 |
srls : rls, (*for evaluation of list_fns in script *)
|
s1210629013@55444
|
171 |
calc : calc list, (*for Calculate in scr, set by prep_rls' *)
|
neuper@37906
|
172 |
rules : rule list,
|
neuper@42451
|
173 |
errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
|
neuper@48763
|
174 |
scr : scr} (*Prog term: generating intermed.steps *)
|
neuper@37906
|
175 |
| Seq of (*a sequence of rules to be tried only once *)
|
neuper@37906
|
176 |
{id : string, (*for trace_rewrite:=true *)
|
neuper@37906
|
177 |
preconds : term list, (*unused 20.8.02 *)
|
neuper@37906
|
178 |
(*WN060616 for efficiency...
|
s1210629013@55444
|
179 |
bdvs : false, (*set in prep_rls' for get_bdvs *)*)
|
neuper@37906
|
180 |
rew_ord : rew_ord, (*for rules *)
|
neuper@37906
|
181 |
erls : rls, (*for the conditions in rules *)
|
neuper@37906
|
182 |
srls : rls, (*for evaluation of list_fns in script *)
|
s1210629013@55444
|
183 |
calc : calc list, (*for Calculate in scr, set by prep_rls' *)
|
neuper@37906
|
184 |
rules : rule list,
|
neuper@42451
|
185 |
errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
|
neuper@48763
|
186 |
scr : scr} (*Prog term (how to restrict type ???)*)
|
neuper@52084
|
187 |
|
neuper@37906
|
188 |
(*Rrls call SML-code and simulate an rls
|
neuper@37906
|
189 |
difference: there is always _ONE_ redex rewritten in 1 call,
|
neuper@37906
|
190 |
thus wrap Rrls by: Rls (Rls_ ...)*)
|
neuper@52084
|
191 |
| Rrls of (* SML-functions within rewriting; step-wise execution provided;
|
neuper@52084
|
192 |
Rrls simulate an rls
|
neuper@52084
|
193 |
difference: there is always _ONE_ redex rewritten in 1 call,
|
neuper@52084
|
194 |
thus wrap Rrls by: Rls (Rls_ ...) *)
|
neuper@38036
|
195 |
{id : string, (* for trace_rewrite := true *)
|
neuper@40836
|
196 |
prepat : (term list *(* preconds, eval with subst from pattern;
|
neuper@52084
|
197 |
if [@{term True}], match decides alone *)
|
neuper@52084
|
198 |
term ) (* pattern matched with current (sub)term *)
|
neuper@52084
|
199 |
list, (* meta-conjunction is or *)
|
neuper@38036
|
200 |
rew_ord : rew_ord, (* for rules *)
|
neuper@38036
|
201 |
erls : rls, (* for the conditions in rules and preconds *)
|
s1210629013@55444
|
202 |
calc : calc list, (* for Calculate in scr, set automatic.in prep_rls' *)
|
neuper@42451
|
203 |
errpatts : errpatID list,(*dialog-authoring in Build_Thydata.thy*)
|
neuper@38036
|
204 |
scr : scr}; (* Rfuns {...} (how to restrict type ???) *)
|
neuper@37906
|
205 |
|
neuper@55477
|
206 |
(*ad thm':
|
neuper@55477
|
207 |
there are two kinds of theorems ...
|
neuper@55477
|
208 |
(1) known by isabelle
|
neuper@55477
|
209 |
(2) not known, eg. calc_thm, instantiated rls
|
neuper@55477
|
210 |
the latter have a thmid "#..."
|
neuper@55477
|
211 |
and thus outside isa we ALWAYS transport both (thmid,string_of_thmI)
|
neuper@55477
|
212 |
and have a special assoc_thm / assoc_rls in this interface *)
|
neuper@55477
|
213 |
type theory' = string; (* = domID ^".thy" WN.101011 ABOLISH !*)
|
neuper@55477
|
214 |
type domID = string; (* domID ^".thy" = theory' WN.101011 replace by thyID*)
|
neuper@55477
|
215 |
type thyID = string; (*WN.3.11.03 TODO: replace domID with thyID*)
|
neuper@55477
|
216 |
|
neuper@55477
|
217 |
fun term_to_string' ctxt t =
|
neuper@55477
|
218 |
let
|
neuper@55477
|
219 |
val ctxt' = Config.put show_markup false ctxt
|
neuper@55477
|
220 |
in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
|
neuper@55477
|
221 |
fun term_to_string'' (thyID : thyID) t =
|
neuper@55477
|
222 |
let
|
neuper@55477
|
223 |
val ctxt' = Config.put show_markup false (Proof_Context.init_global (Thy_Info.get_theory thyID))
|
neuper@55477
|
224 |
in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
|
neuper@55477
|
225 |
fun term_to_string''' thy t =
|
neuper@55477
|
226 |
let
|
neuper@55477
|
227 |
val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
|
neuper@55477
|
228 |
in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
|
neuper@55477
|
229 |
|
neuper@48760
|
230 |
fun thy2ctxt' thy' = Proof_Context.init_global (Thy_Info.get_theory thy');(*FIXXXME thy-ctxt*)
|
neuper@48760
|
231 |
fun thy2ctxt thy = Proof_Context.init_global thy;(*FIXXXME thy-ctxt*)
|
neuper@37906
|
232 |
|
neuper@55477
|
233 |
fun term2str t = term_to_string' (thy2ctxt' "Isac") t;
|
neuper@55477
|
234 |
fun terms2strs ts = map term2str ts;
|
neuper@55477
|
235 |
(*terms2strs [t1,t2] = ["1 + 2", "abc"];*)
|
neuper@55477
|
236 |
val terms2str = strs2str o terms2strs;
|
neuper@55477
|
237 |
(*terms2str [t1,t2] = "[\"1 + 2\",\"abc\"]";*)
|
neuper@55477
|
238 |
val terms2str' = strs2str' o terms2strs;
|
neuper@55477
|
239 |
(*terms2str' [t1,t2] = "[1 + 2,abc]";*)
|
neuper@55477
|
240 |
|
neuper@55477
|
241 |
fun termopt2str (SOME t) = "(SOME " ^ term2str t ^ ")"
|
neuper@55477
|
242 |
| termopt2str NONE = "NONE";
|
neuper@55477
|
243 |
|
neuper@55477
|
244 |
fun type_to_string' ctxt t =
|
neuper@55477
|
245 |
let
|
neuper@55477
|
246 |
val ctxt' = Config.put show_markup false ctxt
|
neuper@55477
|
247 |
in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
|
neuper@55477
|
248 |
fun type_to_string'' (thyID : thyID) t =
|
neuper@55477
|
249 |
let
|
neuper@55477
|
250 |
val ctxt' = Config.put show_markup false (Proof_Context.init_global (Thy_Info.get_theory thyID))
|
neuper@55477
|
251 |
in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
|
neuper@55477
|
252 |
fun type_to_string''' thy t =
|
neuper@55477
|
253 |
let
|
neuper@55477
|
254 |
val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
|
neuper@55477
|
255 |
in Print_Mode.setmp [] (Syntax.string_of_typ ctxt') t end;
|
neuper@55477
|
256 |
|
neuper@55477
|
257 |
fun type2str typ = type_to_string'' "Isac" typ; (*legacy*)
|
neuper@55477
|
258 |
val string_of_typ = type2str; (*legacy*)
|
neuper@55477
|
259 |
fun string_of_typ_thy thy typ = type_to_string'' thy typ; (*legacy*)
|
neuper@55477
|
260 |
|
neuper@48760
|
261 |
fun Isac _ = Proof_Context.theory_of (thy2ctxt' "Isac"); (*@{theory "Isac"}*)
|
neuper@48760
|
262 |
|
neuper@40836
|
263 |
val e_rule = Thm ("refl", @{thm refl});
|
neuper@37906
|
264 |
fun id_of_thm (Thm (id, _)) = id
|
neuper@52101
|
265 |
| id_of_thm _ = error "error id_of_thm";
|
neuper@37906
|
266 |
fun thm_of_thm (Thm (_, thm)) = thm
|
neuper@52101
|
267 |
| thm_of_thm _ = error "error thm_of_thm";
|
neuper@37906
|
268 |
fun rep_thm_G' (Thm (thmid, thm)) = (thmid, thm);
|
neuper@38061
|
269 |
|
neuper@38061
|
270 |
fun thmID_of_derivation_name dn = last_elem (space_explode "." dn);
|
neuper@38061
|
271 |
fun thyID_of_derivation_name dn = hd (space_explode "." dn);
|
neuper@38061
|
272 |
|
neuper@37906
|
273 |
fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _ : thm)) =
|
neuper@37906
|
274 |
(strip_thy thmid1) = (strip_thy thmid2);
|
neuper@42372
|
275 |
(*WN120201 weakened*)
|
neuper@42372
|
276 |
fun eq_thmI ((thmid1 : thmID, _ : thm), (thmid2 : thmID, _)) = thmid1 = thmid2;
|
neuper@38002
|
277 |
(*version typed weaker WN100910*)
|
neuper@38002
|
278 |
fun eq_thmI' ((thmid1, _), (thmid2, _)) =
|
neuper@38061
|
279 |
(thmID_of_derivation_name thmid1) = (thmID_of_derivation_name thmid2);
|
neuper@37906
|
280 |
|
neuper@42437
|
281 |
fun thm'_of_thm thm =
|
neuper@42437
|
282 |
((thmID_of_derivation_name o Thm.get_name_hint) thm, ""): thm'
|
neuper@37906
|
283 |
|
neuper@37906
|
284 |
(*check for [.] as caused by "fun assoc_thm'"*)
|
neuper@37906
|
285 |
fun string_of_thmI thm =
|
neuper@55479
|
286 |
let val ct' = (de_quote o Thm.get_name_hint) thm
|
neuper@40836
|
287 |
val (a, b) = split_nlast (5, Symbol.explode ct')
|
neuper@40836
|
288 |
in case b of
|
neuper@37906
|
289 |
[" ", " ","[", ".", "]"] => implode a
|
neuper@37906
|
290 |
| _ => ct'
|
neuper@37906
|
291 |
end;
|
neuper@37906
|
292 |
|
neuper@37906
|
293 |
(*.id requested for all, Rls,Seq,Rrls.*)
|
neuper@37906
|
294 |
fun id_rls Erls = "e_rls" (*WN060714 quick and dirty: recursive defs!*)
|
neuper@37906
|
295 |
| id_rls (Rls {id,...}) = id
|
neuper@37906
|
296 |
| id_rls (Seq {id,...}) = id
|
neuper@37906
|
297 |
| id_rls (Rrls {id,...}) = id;
|
neuper@37906
|
298 |
val rls2str = id_rls;
|
neuper@37906
|
299 |
fun id_rule (Thm (id, _)) = id
|
neuper@37906
|
300 |
| id_rule (Calc (id, _)) = id
|
neuper@37906
|
301 |
| id_rule (Rls_ rls) = id_rls rls;
|
neuper@37906
|
302 |
|
neuper@37906
|
303 |
fun get_rules (Rls {rules,...}) = rules
|
neuper@37906
|
304 |
| get_rules (Seq {rules,...}) = rules
|
neuper@37906
|
305 |
| get_rules (Rrls _) = [];
|
neuper@37906
|
306 |
|
neuper@37906
|
307 |
fun rule2str Erule = "Erule"
|
neuper@37906
|
308 |
| rule2str (Thm (str, thm)) = "Thm (\""^str^"\","^(string_of_thmI thm)^")"
|
neuper@37906
|
309 |
| rule2str (Calc (str,f)) = "Calc (\""^str^"\",fn)"
|
neuper@37906
|
310 |
| rule2str (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
|
neuper@37906
|
311 |
| rule2str (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
|
neuper@37906
|
312 |
fun rule2str' Erule = "Erule"
|
neuper@37906
|
313 |
| rule2str' (Thm (str, thm)) = "Thm (\""^str^"\",\"\")"
|
neuper@37906
|
314 |
| rule2str' (Calc (str,f)) = "Calc (\""^str^"\",fn)"
|
neuper@37906
|
315 |
| rule2str' (Cal1 (str,f)) = "Cal1 (\""^str^"\",fn)"
|
neuper@37906
|
316 |
| rule2str' (Rls_ rls) = "Rls_ (\""^id_rls rls^"\")";
|
neuper@37906
|
317 |
|
neuper@37906
|
318 |
(*WN080102 compare eq_rule ?!?*)
|
neuper@37906
|
319 |
fun eqrule (Thm (id1,_), Thm (id2,_)) = id1 = id2
|
neuper@37906
|
320 |
| eqrule (Calc (id1,_), Calc (id2,_)) = id1 = id2
|
neuper@37906
|
321 |
| eqrule (Cal1 (id1,_), Cal1 (id2,_)) = id1 = id2
|
neuper@37906
|
322 |
| eqrule (Rls_ _, Rls_ _) = false (*{id=id1}{id=id2} = id1 = id2 FIXXME*)
|
neuper@37906
|
323 |
| eqrule _ = false;
|
neuper@37906
|
324 |
|
neuper@52084
|
325 |
type rrlsstate = (* state for reverse rewriting, comments see type rule and scr | Rfuns *)
|
neuper@52084
|
326 |
(term * term * rule list list * (rule * (term * term list)) list);
|
neuper@37906
|
327 |
|
neuper@37906
|
328 |
val e_type = Type("empty",[]);
|
neuper@37906
|
329 |
val a_type = TFree("'a",[]);
|
neuper@37906
|
330 |
val e_term = Const("empty",e_type);
|
neuper@37906
|
331 |
val a_term = Free("empty",a_type);
|
neuper@37906
|
332 |
val e_rrlsstate = (e_term,e_term,[[e_rule]],[(e_rule,(e_term,[]))]):rrlsstate;
|
neuper@37906
|
333 |
|
neuper@37906
|
334 |
val e_term = Const("empty", Type("'a", []));
|
neuper@48763
|
335 |
val e_scr = Prog e_term;
|
neuper@37906
|
336 |
|
neuper@37906
|
337 |
fun string_of_thy thy = Context.theory_name thy: theory';
|
neuper@37906
|
338 |
val theory2domID = string_of_thy;
|
neuper@37906
|
339 |
val theory2thyID = (get_thy o string_of_thy) : theory -> thyID;
|
neuper@37906
|
340 |
val theory2theory' = string_of_thy;
|
neuper@37906
|
341 |
val theory2str = string_of_thy; (*WN050903 ..most consistent naming*)
|
neuper@40836
|
342 |
val theory2str' = implode o (drop_last_n 4) o Symbol.explode o string_of_thy;
|
neuper@48795
|
343 |
(* fun theory'2theory = fun thyID2thy ... see fun assoc_thy (...Thy_Info.get_theory string);
|
neuper@37906
|
344 |
al it = "Isac" : string
|
neuper@37906
|
345 |
*)
|
neuper@37906
|
346 |
|
neuper@38058
|
347 |
fun thyID2theory' (thyID:thyID) = thyID;
|
neuper@38058
|
348 |
(*
|
neuper@40836
|
349 |
let val ss = Symbol.explode thyID
|
neuper@37906
|
350 |
val ext = implode (takelast (4, ss))
|
neuper@37906
|
351 |
in if ext = ".thy" then thyID : theory' (*disarm abuse of thyID*)
|
neuper@37906
|
352 |
else thyID ^ ".thy"
|
neuper@37906
|
353 |
end;
|
neuper@38058
|
354 |
*)
|
neuper@37906
|
355 |
(* thyID2theory' "Isac" (*ok*);
|
neuper@38050
|
356 |
val it = "Isac" : theory'
|
neuper@38050
|
357 |
> thyID2theory' "Isac" (*abuse, goes ok...*);
|
neuper@38050
|
358 |
val it = "Isac" : theory'
|
neuper@37906
|
359 |
*)
|
neuper@48880
|
360 |
|
neuper@38058
|
361 |
fun theory'2thyID (theory':theory') = theory';
|
neuper@38058
|
362 |
(*
|
neuper@40836
|
363 |
let val ss = Symbol.explode theory'
|
neuper@37906
|
364 |
val ext = implode (takelast (4, ss))
|
neuper@37906
|
365 |
in if ext = ".thy" then ((implode o (drop_last_n 4)) ss) : thyID
|
neuper@37906
|
366 |
else theory' (*disarm abuse of theory'*)
|
neuper@37906
|
367 |
end;
|
neuper@38058
|
368 |
*)
|
neuper@38050
|
369 |
(* theory'2thyID "Isac";
|
neuper@37906
|
370 |
val it = "Isac" : thyID
|
neuper@37906
|
371 |
> theory'2thyID "Isac";
|
neuper@37906
|
372 |
val it = "Isac" : thyID*)
|
neuper@37906
|
373 |
|
neuper@37906
|
374 |
|
neuper@37906
|
375 |
(*. WN0509 discussion:
|
neuper@37906
|
376 |
#############################################################################
|
neuper@37906
|
377 |
# How to manage theorys in subproblems wrt. the requirement, #
|
neuper@37906
|
378 |
# that scripts should be re-usable ? #
|
neuper@37906
|
379 |
#############################################################################
|
neuper@37906
|
380 |
|
neuper@37988
|
381 |
eg. 'Script Solve_rat_equation' calls 'SubProblem (RatEq',..'
|
neuper@37906
|
382 |
which would not allow to 'solve (y'' = -M_b / EI, M_b)' by this script
|
neuper@40836
|
383 |
because Biegelinie.thy is subthy of RatEq.thy and thus Biegelinie.M_b
|
neuper@37906
|
384 |
is unknown in RatEq.thy and M_b cannot be parsed into the scripts guard
|
neuper@37906
|
385 |
(see match_ags).
|
neuper@37906
|
386 |
|
neuper@37906
|
387 |
Preliminary solution:
|
neuper@38011
|
388 |
# the thy in 'SubProblem (thy', pbl, arglist)' is not taken automatically,
|
neuper@38011
|
389 |
# instead the 'maxthy (rootthy pt) thy' is taken for each subpbl
|
neuper@40836
|
390 |
# however, a thy specified by the user in the rootpbl may lead to
|
neuper@40836
|
391 |
errors in far-off subpbls (which are not yet reported properly !!!)
|
neuper@37906
|
392 |
and interactively specifiying thys in subpbl is not very relevant.
|
neuper@37906
|
393 |
|
neuper@37906
|
394 |
Other solutions possible:
|
neuper@40836
|
395 |
# always parse and type-check with Thy_Info.get_theory "Isac"
|
neuper@37906
|
396 |
(rejected tue to the vague idea eg. to re-use equations for R in C etc.)
|
neuper@37906
|
397 |
# regard the subthy-relation in specifying thys of subpbls
|
neuper@38011
|
398 |
# specifically handle 'SubProblem (undefined, pbl, arglist)'
|
neuper@37906
|
399 |
# ???
|
neuper@37906
|
400 |
.*)
|
neuper@40836
|
401 |
(*WN0509 TODO "ProtoPure" ... would be more consistent
|
neuper@37906
|
402 |
with assoc_thy <--> theory2theory' +FIXME assoc_thy "e_domID" -> Script.thy*)
|
neuper@37906
|
403 |
val e_domID = "e_domID":domID;
|
neuper@37906
|
404 |
|
neuper@37906
|
405 |
(*the key into the hierarchy ob theory elements*)
|
neuper@37906
|
406 |
type theID = string list;
|
neuper@37906
|
407 |
val e_theID = ["e_theID"];
|
neuper@37906
|
408 |
val theID2str = strs2str;
|
neuper@37906
|
409 |
(*theID eg. is ["IsacKnowledge", "Test", "Rulesets", "ac_plus_times"]*)
|
neuper@37906
|
410 |
fun theID2thyID (theID:theID) =
|
neuper@37906
|
411 |
if length theID >= 3 then (last_elem o (drop_last_n 2)) theID : thyID
|
neuper@38031
|
412 |
else error ("theID2thyID called with "^ theID2str theID);
|
neuper@37906
|
413 |
|
neuper@37906
|
414 |
(*the key into the hierarchy ob problems*)
|
neuper@37906
|
415 |
type pblID = string list; (* domID::...*)
|
neuper@37906
|
416 |
val e_pblID = ["e_pblID"]:pblID;
|
neuper@37906
|
417 |
val pblID2str = strs2str;
|
neuper@37906
|
418 |
|
neuper@37906
|
419 |
(*the key into the hierarchy ob methods*)
|
neuper@37906
|
420 |
type metID = string list;
|
neuper@37906
|
421 |
val e_metID = ["e_metID"]:metID;
|
neuper@37906
|
422 |
val metID2str = strs2str;
|
neuper@37906
|
423 |
|
s1210629013@52166
|
424 |
type spec =
|
s1210629013@52166
|
425 |
domID * (*WN.12.03: is replaced by thy from get_met ?FIXME? in:
|
s1210629013@52166
|
426 |
specify (Init_Proof..), nxt_specify_init_calc,
|
s1210629013@52166
|
427 |
assod (.SubProblem...), stac2tac (.SubProblem...)*)
|
s1210629013@52166
|
428 |
pblID *
|
s1210629013@52166
|
429 |
metID;
|
s1210629013@52166
|
430 |
|
s1210629013@52171
|
431 |
fun spec2str ((dom,pbl,met)(*:spec*)) =
|
s1210629013@52171
|
432 |
"(" ^ (quote dom) ^ ", " ^ (strs2str pbl) ^
|
s1210629013@52171
|
433 |
", " ^ (strs2str met) ^ ")";
|
s1210629013@52171
|
434 |
(*> spec2str empty_spec;
|
s1210629013@52171
|
435 |
val it = "(\"\", [], (\"\", \"\"))" : string *)
|
s1210629013@52171
|
436 |
val empty_spec = (e_domID,e_pblID,e_metID):spec;
|
s1210629013@52171
|
437 |
val e_spec = empty_spec;
|
s1210629013@52171
|
438 |
|
s1210629013@52166
|
439 |
(*.association list with cas-commands, for generating a complete calc-head.*)
|
neuper@52169
|
440 |
type generate_fn =
|
neuper@52169
|
441 |
(term list -> (* the arguments of the cas-command, eg. (x+1=2, x) *)
|
neuper@52169
|
442 |
(term * (* description of an element *)
|
neuper@52169
|
443 |
term list) (* value of the element (always put into a list) *)
|
neuper@52169
|
444 |
list) (* of elements in the formalization *)
|
neuper@52169
|
445 |
type cas_elem =
|
neuper@52169
|
446 |
(term * (* cas-command, eg. 'solve' *)
|
neuper@52169
|
447 |
(spec * (* theory, problem, method *)
|
s1210629013@52174
|
448 |
generate_fn))
|
neuper@52169
|
449 |
fun cas_eq ((t1, (_, _)) : cas_elem, (t2, (_, _)) : cas_elem) = t1 = t2
|
s1210629013@52167
|
450 |
|
neuper@37906
|
451 |
(*either theID or pblID or metID*)
|
neuper@37906
|
452 |
type kestoreID = string list;
|
neuper@37906
|
453 |
val e_kestoreID = ["e_kestoreID"];
|
neuper@37906
|
454 |
val kestoreID2str = strs2str;
|
neuper@37906
|
455 |
|
neuper@48892
|
456 |
(*for distinction of contexts WN130621: disambiguate with Isabelle's Context !*)
|
neuper@37906
|
457 |
datatype ketype = Exp_ | Thy_ | Pbl_ | Met_;
|
neuper@37906
|
458 |
fun ketype2str Exp_ = "Exp_"
|
neuper@40836
|
459 |
| ketype2str Thy_ = "Thy_"
|
neuper@40836
|
460 |
| ketype2str Pbl_ = "Pbl_"
|
neuper@37906
|
461 |
| ketype2str Met_ = "Met_";
|
neuper@37906
|
462 |
fun ketype2str' Exp_ = "Example"
|
neuper@40836
|
463 |
| ketype2str' Thy_ = "Theory"
|
neuper@40836
|
464 |
| ketype2str' Pbl_ = "Problem"
|
neuper@37906
|
465 |
| ketype2str' Met_ = "Method";
|
neuper@37906
|
466 |
|
neuper@37906
|
467 |
(*rewrite orders, also stored in 'type met' and type 'and rls'
|
neuper@37906
|
468 |
The association list is required for 'rewrite.."rew_ord"..'
|
neuper@37947
|
469 |
WN0509 tests not well-organized: see smltest/Knowledge/termorder.sml*)
|
neuper@55432
|
470 |
val rew_ord' = Unsynchronized.ref
|
neuper@38007
|
471 |
([]:(rew_ord' * (*the key for the association list *)
|
neuper@37906
|
472 |
(subst (*the bound variables - they get high order*)
|
neuper@37906
|
473 |
-> (term * term) (*(t1, t2) to be compared *)
|
neuper@37906
|
474 |
-> bool)) (*if t1 <= t2 then true else false *)
|
neuper@37906
|
475 |
list); (*association list *)
|
neuper@38061
|
476 |
|
neuper@37906
|
477 |
rew_ord' := overwritel (!rew_ord', [("e_rew_ord", e_rew_ord),
|
neuper@37906
|
478 |
("dummy_ord", dummy_ord)]);
|
neuper@37906
|
479 |
|
neuper@37906
|
480 |
|
neuper@48887
|
481 |
(* A tree for storing data defined in different theories
|
neuper@48887
|
482 |
for access from the Interpreter and from dialogue authoring
|
neuper@48887
|
483 |
using a string list as key.
|
neuper@48887
|
484 |
'a is for pbt | met | thydata; after WN030424 naming became inappropriate *)
|
neuper@40836
|
485 |
datatype 'a ptyp =
|
neuper@48887
|
486 |
Ptyp of string * (* element of the key *)
|
neuper@48887
|
487 |
'a list * (* several pbts with different domIDs/thy TODO: select by subthy (isaref.p.69)
|
neuper@48887
|
488 |
presently only _ONE_ elem FOR ALL KINDS OF CONTENT pbt | met | thydata *)
|
neuper@48887
|
489 |
('a ptyp) list;(* the children nodes *)
|
neuper@37906
|
490 |
|
neuper@37906
|
491 |
(*.datatype for collecting thydata for hierarchy.*)
|
neuper@37906
|
492 |
(*WN060720 more consistent naming would be 'type thyelem' or 'thelem'*)
|
neuper@37906
|
493 |
(*WN0606 Htxt contains html which does not belong to the sml-kernel*)
|
neuper@37906
|
494 |
datatype thydata = Html of {guh: guh,
|
neuper@37906
|
495 |
coursedesign: authors,
|
neuper@37906
|
496 |
mathauthors: authors,
|
neuper@37906
|
497 |
html: string} (*html; for demos before database*)
|
neuper@37906
|
498 |
| Hthm of {guh: guh,
|
neuper@37906
|
499 |
coursedesign: authors,
|
neuper@37906
|
500 |
mathauthors: authors,
|
neuper@42429
|
501 |
fillpats: fillpat list,
|
neuper@38002
|
502 |
thm: term}
|
neuper@37906
|
503 |
| Hrls of {guh: guh,
|
neuper@37906
|
504 |
coursedesign: authors,
|
neuper@37906
|
505 |
mathauthors: authors,
|
neuper@37906
|
506 |
thy_rls: (thyID * rls)}
|
neuper@37906
|
507 |
| Hcal of {guh: guh,
|
neuper@37906
|
508 |
coursedesign: authors,
|
neuper@37906
|
509 |
mathauthors: authors,
|
neuper@37906
|
510 |
calc: calc}
|
neuper@37906
|
511 |
| Hord of {guh: guh,
|
neuper@37906
|
512 |
coursedesign: authors,
|
neuper@37906
|
513 |
mathauthors: authors,
|
neuper@37906
|
514 |
ord: (subst -> (term * term) -> bool)};
|
neuper@37906
|
515 |
val e_thydata = Html {guh="e_guh", coursedesign=[], mathauthors=[], html=""};
|
neuper@55435
|
516 |
fun the2str (Html {guh, coursedesign, mathauthors, html}) = guh : string
|
neuper@55435
|
517 |
| the2str (Hthm {guh, coursedesign, mathauthors, fillpats, thm}) = guh
|
neuper@55435
|
518 |
| the2str (Hrls {guh, coursedesign, mathauthors, thy_rls}) = guh
|
neuper@55435
|
519 |
| the2str (Hcal {guh, coursedesign, mathauthors, calc}) = guh
|
neuper@55435
|
520 |
| the2str (Hord {guh, coursedesign, mathauthors, ord}) = guh
|
neuper@55435
|
521 |
fun thes2str thes = map the2str thes |> list2str;
|
neuper@37906
|
522 |
|
neuper@37906
|
523 |
type thehier = (thydata ptyp) list;
|
neuper@55405
|
524 |
(* required to determine sequence of main nodes of thehier in KEStore.thy *)
|
neuper@55405
|
525 |
fun part2guh ([str]:theID) =
|
neuper@55405
|
526 |
(case str of
|
neuper@55405
|
527 |
"Isabelle" => "thy_isab_" ^ str ^ "-part" : guh
|
neuper@55405
|
528 |
| "IsacScripts" => "thy_scri_" ^ str ^ "-part"
|
neuper@55405
|
529 |
| "IsacKnowledge" => "thy_isac_" ^ str ^ "-part"
|
neuper@55405
|
530 |
| str => error ("thy2guh: called with '"^str^"'"))
|
neuper@55405
|
531 |
| part2guh theID = error ("part2guh called with theID = " ^ theID2str theID);
|
neuper@37906
|
532 |
|
neuper@55437
|
533 |
fun thy2guh ([part, thyID] : theID) = (case part of
|
neuper@55437
|
534 |
"Isabelle" => "thy_isab_" ^ thyID : guh
|
neuper@55437
|
535 |
| "IsacScripts" => "thy_scri_" ^ thyID
|
neuper@55437
|
536 |
| "IsacKnowledge" => "thy_isac_" ^ thyID
|
neuper@55437
|
537 |
| str => error ("thy2guh: called with '" ^ str ^ "'"))
|
neuper@55437
|
538 |
| thy2guh theID = error ("thy2guh called with '" ^ strs2str' theID ^ "'");
|
neuper@55437
|
539 |
|
neuper@55437
|
540 |
fun thypart2guh ([part, thyID, thypart] : theID) = case part of
|
neuper@55437
|
541 |
"Isabelle" => "thy_isab_" ^ thyID ^ "-" ^ thypart : guh
|
neuper@55437
|
542 |
| "IsacScripts" => "thy_scri_" ^ thyID ^ "-" ^ thypart
|
neuper@55437
|
543 |
| "IsacKnowledge" => "thy_isac_" ^ thyID ^ "-" ^ thypart
|
neuper@55437
|
544 |
| str => error ("thypart2guh: called with '" ^ str ^ "'");
|
neuper@55437
|
545 |
|
neuper@55437
|
546 |
(* convert the data got via contextToThy to a globally unique handle
|
neuper@55437
|
547 |
there is another way to get the guh out of the 'theID' in the hierarchy *)
|
neuper@55437
|
548 |
fun thm2guh (isa, thyID:thyID) (thmID:thmID) = case isa of
|
neuper@55437
|
549 |
"Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID : guh
|
neuper@55437
|
550 |
| "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID
|
neuper@55437
|
551 |
| "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-thm-" ^ strip_thy thmID
|
neuper@55437
|
552 |
| str => error ("thm2guh called with isa = '" ^ isa ^ "' for thm = " ^ thmID ^ "'");
|
neuper@55437
|
553 |
|
neuper@55437
|
554 |
fun rls2guh (isa, thyID:thyID) (rls':rls') = case isa of
|
neuper@55437
|
555 |
"Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-rls-" ^ rls' : guh
|
neuper@55437
|
556 |
| "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-rls-" ^ rls'
|
neuper@55437
|
557 |
| "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-rls-" ^ rls'
|
neuper@55437
|
558 |
| str => error ("rls2guh called with isa = '" ^ isa ^ "' for rls = '" ^ rls' ^ "'");
|
neuper@55437
|
559 |
|
neuper@55437
|
560 |
fun cal2guh (isa, thyID:thyID) calID = case isa of
|
neuper@55437
|
561 |
"Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-cal-" ^ calID : guh
|
neuper@55437
|
562 |
| "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-cal-" ^ calID
|
neuper@55437
|
563 |
| "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-cal-" ^ calID
|
neuper@55437
|
564 |
| str => error ("cal2guh called with isa = '" ^ isa ^ "' for cal = '" ^ calID ^ "'");
|
neuper@55437
|
565 |
|
neuper@55437
|
566 |
fun ord2guh (isa, thyID:thyID) (rew_ord':rew_ord') = case isa of
|
neuper@55437
|
567 |
"Isabelle" => "thy_isab_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord' : guh
|
neuper@55437
|
568 |
| "IsacKnowledge" => "thy_isac_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord'
|
neuper@55437
|
569 |
| "IsacScripts" => "thy_scri_" ^ theory'2thyID thyID ^ "-ord-" ^ rew_ord'
|
neuper@55437
|
570 |
| str => error ("ord2guh called with isa = '" ^ isa ^ "' for ord = '" ^ rew_ord' ^ "'");
|
neuper@55437
|
571 |
|
neuper@55437
|
572 |
(* not only for thydata, but also for thy's etc *)
|
neuper@55437
|
573 |
fun theID2guh (theID : theID) = case length theID of
|
neuper@55437
|
574 |
0 => error ("theID2guh: called with theID = " ^ strs2str' theID)
|
neuper@55437
|
575 |
| 1 => part2guh theID
|
neuper@55437
|
576 |
| 2 => thy2guh theID
|
neuper@55437
|
577 |
| 3 => thypart2guh theID
|
neuper@55437
|
578 |
| 4 =>
|
neuper@55437
|
579 |
let val [isa, thyID, typ, elemID] = theID
|
neuper@55437
|
580 |
in case typ of
|
neuper@55437
|
581 |
"Theorems" => thm2guh (isa, thyID) elemID
|
neuper@55437
|
582 |
| "Rulesets" => rls2guh (isa, thyID) elemID
|
neuper@55437
|
583 |
| "Calculations" => cal2guh (isa, thyID) elemID
|
neuper@55437
|
584 |
| "Orders" => ord2guh (isa, thyID) elemID
|
neuper@55437
|
585 |
| "Theorems" => thy2guh [isa, thyID]
|
neuper@55437
|
586 |
| str => error ("theID2guh: called with theID = " ^ strs2str' theID)
|
neuper@55437
|
587 |
end
|
neuper@55437
|
588 |
| n => error ("theID2guh called with theID = " ^ strs2str' theID);
|
neuper@55437
|
589 |
|
neuper@37906
|
590 |
type path = string;
|
neuper@37906
|
591 |
type filename = string;
|
neuper@37906
|
592 |
|
neuper@37906
|
593 |
(*val xxx = fn: a b => (a,b); ??? fun-definition ???*)
|
neuper@37906
|
594 |
local
|
neuper@37906
|
595 |
fun ii (_:term) = e_rrlsstate;
|
neuper@37906
|
596 |
fun no (_:term) = SOME (e_term,[e_term]);
|
neuper@37906
|
597 |
fun lo (_:rule list list) (_:term) (_:rule) = [(e_rule,(e_term,[e_term]))];
|
neuper@37906
|
598 |
fun ne (_:rule list list) (_:term) = SOME e_rule;
|
neuper@37906
|
599 |
fun fo (_:rule list list) (_:term) (_:term) = [(e_rule,(e_term,[e_term]))];
|
neuper@37906
|
600 |
in
|
neuper@37906
|
601 |
val e_rfuns = Rfuns {init_state=ii,normal_form=no,locate_rule=lo,
|
neuper@37906
|
602 |
next_rule=ne,attach_form=fo};
|
neuper@37906
|
603 |
end;
|
neuper@37906
|
604 |
|
neuper@42458
|
605 |
val e_rls =
|
neuper@42458
|
606 |
Rls {id = "e_rls", preconds = [], rew_ord = ("dummy_ord", dummy_ord), erls = Erls,
|
neuper@42458
|
607 |
srls = Erls, calc = [], rules = [], errpatts = [], scr = EmptyScr}: rls;
|
neuper@42458
|
608 |
val e_rrls =
|
neuper@42458
|
609 |
Rrls {id = "e_rrls", prepat = [], rew_ord = ("dummy_ord", dummy_ord), erls = Erls,
|
neuper@42458
|
610 |
calc = [], errpatts = [], scr=e_rfuns}:rls;
|
neuper@42451
|
611 |
|
neuper@42451
|
612 |
fun rep_rls (Rls {id,preconds,rew_ord,erls,srls,calc,errpatts,rules,scr}) =
|
neuper@37906
|
613 |
{id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
|
neuper@37906
|
614 |
(*asm_thm=asm_thm,*)rules=rules,scr=scr}
|
neuper@42451
|
615 |
| rep_rls (Seq {id,preconds,rew_ord,erls,srls,calc,errpatts,rules,scr}) =
|
neuper@37906
|
616 |
{id=id,preconds=preconds,rew_ord=rew_ord,erls=erls,srls=srls,calc=calc,
|
neuper@37906
|
617 |
(*asm_thm=asm_thm,*)rules=rules,scr=scr}
|
neuper@37906
|
618 |
| rep_rls Erls = rep_rls e_rls
|
neuper@37906
|
619 |
| rep_rls (Rrls {id,...}) = rep_rls e_rls
|
neuper@38031
|
620 |
(*error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id)*);
|
neuper@40836
|
621 |
(*| rep_rls (Seq {id,...}) =
|
neuper@38031
|
622 |
error("rep_rls doesn't take apart reverse-rewrite-rule-sets: "^id);
|
neuper@37906
|
623 |
--1.7.03*)
|
neuper@42451
|
624 |
fun rep_rrls (Rrls {id, calc, erls, prepat, rew_ord, errpatts,
|
neuper@42451
|
625 |
scr = Rfuns {attach_form, init_state, locate_rule, next_rule, normal_form}}) =
|
neuper@42451
|
626 |
{id=id, calc=calc, erls=erls, prepat=prepat,
|
neuper@42451
|
627 |
rew_ord=rew_ord, errpatts=errpatts, attach_form=attach_form, init_state=init_state,
|
neuper@37906
|
628 |
locate_rule=locate_rule, next_rule=next_rule, normal_form=normal_form}
|
neuper@40836
|
629 |
| rep_rrls (Rls {id,...}) =
|
neuper@38031
|
630 |
error ("rep_rrls doesn't take apart (normal) rule-sets: "^id)
|
neuper@40836
|
631 |
| rep_rrls (Seq {id,...}) =
|
neuper@38031
|
632 |
error ("rep_rrls doesn't take apart (normal) rule-sets: "^id);
|
neuper@37906
|
633 |
|
neuper@37906
|
634 |
fun append_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
|
neuper@42451
|
635 |
rules =rs, errpatts=errpatts, scr=sc}) r =
|
neuper@37906
|
636 |
(Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
|
neuper@42451
|
637 |
rules = rs @ r, errpatts=errpatts, scr=sc}:rls)
|
neuper@37906
|
638 |
| append_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
|
neuper@42451
|
639 |
rules =rs, errpatts=errpatts, scr=sc}) r =
|
neuper@37906
|
640 |
(Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
|
neuper@42451
|
641 |
rules = rs @ r, errpatts=errpatts, scr=sc}:rls)
|
neuper@40836
|
642 |
| append_rls id (Rrls _) _ =
|
neuper@38031
|
643 |
error ("append_rls: not for reverse-rewrite-rule-set "^id);
|
neuper@37906
|
644 |
|
neuper@37906
|
645 |
(*. are _atomic_ rules equal ?.*)
|
neuper@37906
|
646 |
(*WN080102 compare eqrule ?!?*)
|
neuper@37906
|
647 |
fun eq_rule (Thm (thm1,_), Thm (thm2,_)) = thm1 = thm2
|
neuper@37906
|
648 |
| eq_rule (Calc (id1,_), Calc (id2,_)) = id1 = id2
|
neuper@37906
|
649 |
| eq_rule (Rls_ rls1, Rls_ rls2) = id_rls rls1 = id_rls rls2
|
neuper@37906
|
650 |
(*id_rls checks for Rls, Seq, Rrls*)
|
neuper@37906
|
651 |
| eq_rule _ = false;
|
neuper@37906
|
652 |
|
neuper@52141
|
653 |
fun merge_ids rls1 rls2 =
|
neuper@52141
|
654 |
let
|
neuper@52141
|
655 |
val id1 = (#id o rep_rls) rls1
|
neuper@52141
|
656 |
val id2 = (#id o rep_rls) rls2
|
neuper@52141
|
657 |
in
|
neuper@52141
|
658 |
if id1 = id2 then id1
|
neuper@52141
|
659 |
else "merged_" ^ id1 ^ "_" ^ id2
|
neuper@52141
|
660 |
end
|
neuper@37906
|
661 |
fun merge_rls _ Erls rls = rls
|
neuper@37906
|
662 |
| merge_rls _ rls Erls = rls
|
neuper@52141
|
663 |
| merge_rls _ (Rrls x) _ = Rrls x (* required for merging Theory_Data *)
|
neuper@52141
|
664 |
| merge_rls _ _ (Rrls x) = Rrls x
|
neuper@37906
|
665 |
| merge_rls id
|
neuper@52141
|
666 |
(Rls {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
|
neuper@52141
|
667 |
rules = rs1, errpatts = eps1, scr = sc1, ...})
|
neuper@52141
|
668 |
(Rls {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
|
neuper@52141
|
669 |
rules = rs2, errpatts = eps2, ...})
|
neuper@52141
|
670 |
=
|
neuper@52141
|
671 |
(Rls {id = id, rew_ord = ro1, scr = sc1,
|
neuper@52141
|
672 |
preconds = union (op =) pc1 pc2,
|
neuper@52141
|
673 |
erls = merge_rls (merge_ids er1 er2) er1 er2,
|
neuper@52141
|
674 |
srls = merge_rls (merge_ids sr1 sr2) sr1 sr2,
|
neuper@52141
|
675 |
calc = union calc_eq ca1 ca2,
|
neuper@52141
|
676 |
rules = union eq_rule rs1 rs2,
|
neuper@52141
|
677 |
errpatts = union (op =) eps1 eps2} : rls)
|
neuper@37906
|
678 |
| merge_rls id
|
neuper@52141
|
679 |
(Seq {preconds = pc1, rew_ord = ro1, erls = er1, srls = sr1, calc = ca1,
|
neuper@52141
|
680 |
rules = rs1, errpatts = eps1, scr = sc1, ...})
|
neuper@52141
|
681 |
(Seq {preconds = pc2, erls = er2, srls = sr2, calc = ca2,
|
neuper@52141
|
682 |
rules = rs2, errpatts = eps2, ...})
|
neuper@52141
|
683 |
=
|
neuper@52141
|
684 |
(Seq {id = id, rew_ord = ro1, scr = sc1,
|
neuper@52141
|
685 |
preconds = union (op =) pc1 pc2,
|
neuper@52141
|
686 |
erls = merge_rls (merge_ids er1 er2) er1 er2,
|
neuper@52141
|
687 |
srls = merge_rls (merge_ids sr1 sr2) sr1 sr2,
|
neuper@52141
|
688 |
calc = union calc_eq ca1 ca2,
|
neuper@52141
|
689 |
rules = union eq_rule rs1 rs2,
|
neuper@52141
|
690 |
errpatts = union (op =) eps1 eps2} : rls)
|
neuper@52141
|
691 |
| merge_rls id _ _ = error ("merge_rls: \"" ^ id ^
|
neuper@52141
|
692 |
"\"; not for reverse-rewrite-rule-sets and not for mixed Rls -- Seq");
|
neuper@42451
|
693 |
|
neuper@37906
|
694 |
fun remove_rls id (Rls {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
|
neuper@42451
|
695 |
rules=rs, errpatts=eps, scr=sc}) r =
|
neuper@37906
|
696 |
(Rls{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
|
neuper@42451
|
697 |
rules = gen_rems eq_rule (rs, r),
|
neuper@42451
|
698 |
errpatts = eps(*gen_rems op= (eps, TODO)*),
|
neuper@37906
|
699 |
scr=sc}:rls)
|
neuper@37906
|
700 |
| remove_rls id (Seq {id=_,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
|
neuper@42451
|
701 |
rules =rs, errpatts=eps, scr=sc}) r =
|
neuper@37906
|
702 |
(Seq{id=id,preconds=pc,rew_ord=ro,erls=er,srls=sr,calc=ca,
|
neuper@42451
|
703 |
rules = gen_rems eq_rule (rs, r),
|
neuper@42451
|
704 |
errpatts = eps(*gen_rems op= (eps, TODO)*),
|
neuper@37906
|
705 |
scr=sc}:rls)
|
neuper@40836
|
706 |
| remove_rls id (Rrls _) _ = error
|
neuper@37906
|
707 |
("remove_rls: not for reverse-rewrite-rule-set "^id);
|
neuper@37906
|
708 |
|
neuper@52141
|
709 |
(* datastructure for KEStore_Elems, intermediate for thehier *)
|
neuper@52141
|
710 |
type rlss_elem =
|
neuper@52141
|
711 |
(rls' * (* identifier unique within Isac *)
|
neuper@52141
|
712 |
(theory' * (* just for assignment in thehier, not appropriate for parsing etc *)
|
neuper@52141
|
713 |
rls)) (* ((#id o rep_rls) rls) = rls' by coding discipline *)
|
neuper@52141
|
714 |
fun rls_eq ((id1, (_, _)), (id2, (_, _))) = id1 = id2
|
neuper@37906
|
715 |
|
neuper@52141
|
716 |
fun insert_merge_rls (re as (id, (thyID, r1)) : rlss_elem) ys =
|
neuper@52141
|
717 |
case get_index (fn y => if curry rls_eq re y then SOME y else NONE) ys of
|
neuper@52141
|
718 |
NONE => re :: ys
|
neuper@52141
|
719 |
| SOME (i, (_, (_, r2))) =>
|
neuper@52141
|
720 |
let
|
neuper@52141
|
721 |
val r12 = merge_rls id r1 r2
|
neuper@52141
|
722 |
in list_update ys i (id, (thyID, r12)) end
|
neuper@52141
|
723 |
|
neuper@52141
|
724 |
fun merge_rlss (s1, s2) = fold insert_merge_rls s1 s2;
|
neuper@52141
|
725 |
|
neuper@52141
|
726 |
|
neuper@37906
|
727 |
fun memrls r (Rls {rules,...}) = gen_mem eqrule (r, rules)
|
neuper@37906
|
728 |
| memrls r (Seq {rules,...}) = gen_mem eqrule (r, rules)
|
neuper@38031
|
729 |
| memrls r _ = error ("memrls: incomplete impl. r= "^(rule2str r));
|
neuper@37906
|
730 |
|
neuper@38031
|
731 |
fun assoc' ([], key) = error ("ME_Isa: '"^key^"' not known")
|
neuper@37906
|
732 |
| assoc' ((keyi, xi) :: pairs, key) =
|
neuper@37906
|
733 |
if key = keyi then SOME xi else assoc' (pairs, key);
|
neuper@37906
|
734 |
|
neuper@38056
|
735 |
fun assoc_thy (thy:theory') =
|
neuper@40836
|
736 |
if thy = "e_domID" then (Thy_Info.get_theory "Script") (*lower bound of Knowledge*)
|
neuper@40836
|
737 |
else (Thy_Info.get_theory thy)
|
neuper@38056
|
738 |
handle _ => error ("ME_Isa: thy '" ^ thy ^ "' not in system");
|
neuper@40836
|
739 |
|
neuper@37906
|
740 |
(*.overwrite an element in an association list and pair it with a thyID
|
neuper@37906
|
741 |
in order to create the thy_hierarchy;
|
neuper@37906
|
742 |
overwrites existing rls' even if they are defined in a different thy;
|
neuper@37906
|
743 |
this is related to assoc_rls, TODO.WN060120: assoc_rew_ord, assoc_calc;.*)
|
neuper@40836
|
744 |
(*WN060120 ...these are NOT compatible to "fun assoc_thm'" in that
|
neuper@37906
|
745 |
they do NOT handle overlays by re-using an identifier in different thys;
|
neuper@37906
|
746 |
"thyID.rlsID" would be a good solution, if the "." would be possible
|
neuper@37906
|
747 |
in scripts...
|
neuper@37906
|
748 |
actually a hack to get alltogether run again with minimal effort*)
|
neuper@37906
|
749 |
fun insthy thy' (rls', rls) = (rls', (thy', rls));
|
neuper@37906
|
750 |
fun overwritelthy thy (al, bl:(rls' * rls) list) =
|
neuper@37906
|
751 |
let val bl' = map (insthy ((get_thy o theory2theory') thy)) bl
|
neuper@37906
|
752 |
in overwritel (al, bl') end;
|
neuper@37906
|
753 |
|
neuper@37906
|
754 |
fun assoc_rew_ord ro = ((the o assoc') (!rew_ord',ro))
|
neuper@38031
|
755 |
handle _ => error ("ME_Isa: rew_ord '"^ro^"' not in system");
|
neuper@37906
|
756 |
(*get the string for stac from rule*)
|
neuper@37906
|
757 |
|
neuper@40836
|
758 |
fun subst2str (s:subst) =
|
neuper@40836
|
759 |
(strs2str o
|
neuper@37906
|
760 |
(map (linefeed o pair2str o
|
neuper@40836
|
761 |
(apsnd term2str) o
|
neuper@37906
|
762 |
(apfst term2str)))) s;
|
neuper@40836
|
763 |
fun subst2str' (s:subst) =
|
neuper@40836
|
764 |
(strs2str' o
|
neuper@37906
|
765 |
(map (pair2str o
|
neuper@40836
|
766 |
(apsnd term2str) o
|
neuper@37906
|
767 |
(apfst term2str)))) s;
|
neuper@37906
|
768 |
(*> subst2str' [(str2term "bdv", str2term "x"),
|
neuper@37906
|
769 |
(str2term "bdv_2", str2term "y")];
|
neuper@37906
|
770 |
val it = "[(bdv, x)]" : string
|
neuper@37906
|
771 |
*)
|
neuper@37906
|
772 |
val env2str = subst2str;
|
neuper@37906
|
773 |
|
neuper@37906
|
774 |
|
neuper@37906
|
775 |
(*recursive defs:*)
|
neuper@48763
|
776 |
fun scr2str (Prog s) = "Prog " ^ term2str s
|
neuper@37906
|
777 |
| scr2str (Rfuns _) = "Rfuns";
|
neuper@37906
|
778 |
|
neuper@37906
|
779 |
|
neuper@37906
|
780 |
fun maxthy thy1 thy2 = if Theory.subthy (thy1, thy2) then thy2 else thy1;
|
neuper@37906
|
781 |
|
neuper@37906
|
782 |
|
neuper@37906
|
783 |
(*.trace internal steps of isac's rewriter*)
|
neuper@38006
|
784 |
val trace_rewrite = Unsynchronized.ref false;
|
neuper@37906
|
785 |
(*.depth of recursion in traces of the rewriter, if trace_rewrite:=true.*)
|
neuper@38006
|
786 |
val depth = Unsynchronized.ref 99999;
|
neuper@37906
|
787 |
(*.no of rewrites exceeding this int -> NO rewrite.*)
|
neuper@37906
|
788 |
(*WN060829 still unused...*)
|
neuper@38006
|
789 |
val lim_rewrite = Unsynchronized.ref 99999;
|
neuper@37906
|
790 |
(*.no of derivation-elements exceeding this int -> SOME derivation-elements.*)
|
neuper@38006
|
791 |
val lim_deriv = Unsynchronized.ref 100;
|
neuper@37906
|
792 |
(*.switch for checking guhs unique before storing a pbl or met;
|
neuper@37906
|
793 |
set true at startup (done at begin of ROOT.ML)
|
neuper@37906
|
794 |
set false for editing IsacKnowledge (done at end of ROOT.ML).*)
|
neuper@41905
|
795 |
val check_guhs_unique = Unsynchronized.ref true;
|
neuper@37906
|
796 |
|
neuper@37906
|
797 |
|
neuper@37906
|
798 |
datatype lrd = (*elements of a path (=loc_) into an Isabelle term*)
|
neuper@40836
|
799 |
L (*go left at $*)
|
neuper@37906
|
800 |
| R (*go right at $*)
|
neuper@37906
|
801 |
| D; (*go down at Abs*)
|
neuper@37906
|
802 |
type loc_ = lrd list;
|
neuper@37906
|
803 |
fun ldr2str L = "L"
|
neuper@37906
|
804 |
| ldr2str R = "R"
|
neuper@37906
|
805 |
| ldr2str D = "D";
|
neuper@37906
|
806 |
fun loc_2str (k:loc_) = (strs2str' o (map ldr2str)) k;
|
neuper@37906
|
807 |
|
neuper@55335
|
808 |
|
neuper@55335
|
809 |
(* the pattern for an item of a problems model or a methods guard *)
|
neuper@55335
|
810 |
type pat =
|
neuper@55335
|
811 |
(string * (* field *)
|
neuper@55335
|
812 |
(term * (* description *)
|
neuper@55335
|
813 |
term)) (* id | arbitrary term *);
|
neuper@55335
|
814 |
fun pat2str ((field, (dsc, id)) : pat) =
|
neuper@55335
|
815 |
pair2str (field, pair2str (term2str dsc, term2str id))
|
neuper@55335
|
816 |
fun pats2str pats = (strs2str o (map pat2str)) pats
|
neuper@55335
|
817 |
|
neuper@55357
|
818 |
(* types for problems models (TODO rename to specification models) *)
|
neuper@55335
|
819 |
type pbt_ =
|
neuper@55335
|
820 |
(string * (* field "#Given",..*)(*deprecated due to 'type pat'*)
|
neuper@55335
|
821 |
(term * (* description *)
|
neuper@55335
|
822 |
term)); (* id | struct-var *)
|
neuper@55335
|
823 |
val e_pbt_ = ("#Undef", (e_term, e_term)) : pbt_
|
neuper@55335
|
824 |
type pbt =
|
neuper@55335
|
825 |
{guh : guh, (* unique within this isac-knowledge *)
|
neuper@55335
|
826 |
mathauthors : string list, (* copyright *)
|
neuper@55335
|
827 |
init : pblID, (* to start refinement with *)
|
neuper@55335
|
828 |
thy : theory, (* which allows to compile that pbt
|
neuper@55335
|
829 |
TODO: search generalized for subthy (ref.p.69*)
|
neuper@55335
|
830 |
(*^^^ WN050912 NOT used during application of the problem,
|
neuper@55335
|
831 |
because applied terms may be from 'subthy' as well as from super;
|
neuper@55335
|
832 |
thus we take 'maxthy'; see match_ags !*)
|
neuper@55335
|
833 |
cas : term option, (* 'CAS-command'*)
|
neuper@55335
|
834 |
prls : rls, (* for preds in where_*)
|
neuper@55335
|
835 |
where_ : term list, (* where - predicates*)
|
neuper@55335
|
836 |
ppc : pat list, (* this is the model-pattern;
|
neuper@55335
|
837 |
it contains "#Given","#Where","#Find","#Relate"-patterns
|
neuper@55335
|
838 |
for constraints on identifiers see "fun cpy_nam" *)
|
neuper@55335
|
839 |
met : metID list} (* methods solving the pbt*)
|
neuper@55335
|
840 |
|
neuper@55335
|
841 |
val e_pbt = {guh = "pbl_empty", mathauthors = [], init = e_pblID, thy = Thy_Info.get_theory "Pure",
|
neuper@55335
|
842 |
cas = NONE, prls = Erls, where_ = [], ppc = [], met = []} : pbt
|
s1210629013@55344
|
843 |
fun pbt2str
|
s1210629013@55344
|
844 |
({cas = cas', guh = guh', init = init', mathauthors = ma', met = met', ppc = ppc',
|
s1210629013@55345
|
845 |
prls = prls', thy = thy', where_ = w'} : pbt) =
|
s1210629013@55344
|
846 |
"{cas = " ^ (termopt2str cas') ^ ", guh = \"" ^ guh' ^ "\", init = "
|
s1210629013@55345
|
847 |
^ (strs2str init') ^ ", mathauthors = " ^ (strs2str ma' |> quote) ^ ", met = "
|
s1210629013@55345
|
848 |
^ (strslist2strs met') ^ ", ppc = " ^ pats2str ppc' ^ ", prls = "
|
s1210629013@55345
|
849 |
^ (rls2str prls' |> quote) ^ ", thy = {" ^ (theory2str thy') ^ "}, where_ = "
|
s1210629013@55345
|
850 |
^ (terms2str w') ^ "}" |> linefeed;
|
s1210629013@55345
|
851 |
fun pbts2str pbts = map pbt2str pbts |> list2str;
|
neuper@55335
|
852 |
|
neuper@55335
|
853 |
val e_Ptyp = Ptyp ("e_pblID",[e_pbt],[])
|
neuper@55335
|
854 |
type ptyps = (pbt ptyp) list
|
neuper@55335
|
855 |
|
neuper@55357
|
856 |
fun coll_pblguhs pbls =
|
neuper@55357
|
857 |
let fun node coll (Ptyp (_,[n],ns)) =
|
neuper@55357
|
858 |
[(#guh : pbt -> guh) n] @ (nodes coll ns)
|
neuper@55357
|
859 |
and nodes coll [] = coll
|
neuper@55357
|
860 |
| nodes coll (n::ns) = (node coll n) @ (nodes coll ns);
|
neuper@55357
|
861 |
in nodes [] pbls end;
|
neuper@55357
|
862 |
fun check_pblguh_unique (guh:guh) (pbls: (pbt ptyp) list) =
|
neuper@55357
|
863 |
if member op = (coll_pblguhs pbls) guh
|
neuper@55357
|
864 |
then error ("check_guh_unique failed with '"^guh^"';\n"^
|
neuper@55357
|
865 |
"use 'sort_pblguhs()' for a list of guhs;\n"^
|
neuper@55357
|
866 |
"consider setting 'check_guhs_unique := false'")
|
neuper@55357
|
867 |
else ();
|
s1210629013@55339
|
868 |
|
neuper@55453
|
869 |
fun insrt _ pbt [k] [] = [Ptyp (k, [pbt], [])]
|
neuper@55453
|
870 |
| insrt d pbt [k] ((Ptyp (k', [p], ps)) :: pys) =
|
neuper@55453
|
871 |
((*writeln ("### insert 1: ks = " ^ strs2str [k] ^ " k'= " ^ k');*)
|
neuper@55453
|
872 |
if k = k'
|
neuper@55453
|
873 |
then ((Ptyp (k', [pbt], ps)) :: pys)
|
neuper@55453
|
874 |
else ((Ptyp (k', [p], ps)) :: (insrt d pbt [k] pys))
|
neuper@55453
|
875 |
)
|
s1210629013@55339
|
876 |
| insrt d pbt (k::ks) ((Ptyp (k', [p], ps))::pys) =
|
neuper@55453
|
877 |
((*writeln ("### insert 2: ks = "^(strs2str (k::ks))^" k'= "^k');*)
|
neuper@55453
|
878 |
if k = k'
|
neuper@55453
|
879 |
then ((Ptyp (k', [p], insrt d pbt ks ps)) :: pys)
|
neuper@55453
|
880 |
else
|
neuper@55453
|
881 |
if length pys = 0
|
neuper@55453
|
882 |
then error ("insert: not found " ^ (strs2str (d : pblID)))
|
neuper@55453
|
883 |
else ((Ptyp (k', [p], ps)) :: (insrt d pbt (k :: ks) pys))
|
neuper@55453
|
884 |
);
|
s1210629013@55339
|
885 |
|
neuper@55448
|
886 |
fun update_ptyps ID _ _ [] =
|
neuper@55448
|
887 |
error ("update_ptyps: " ^ strs2str' ID ^ " does not exist")
|
neuper@55448
|
888 |
| update_ptyps ID [i] data ((py as Ptyp (key, _, pys)) :: pyss) =
|
neuper@55448
|
889 |
if i = key
|
neuper@55448
|
890 |
then
|
neuper@55448
|
891 |
if length pys = 0
|
neuper@55448
|
892 |
then ((Ptyp (key, [data], [])) :: pyss)
|
neuper@55448
|
893 |
else error ("update_ptyps: " ^ strs2str' ID ^ " has descendants")
|
neuper@55448
|
894 |
else py :: update_ptyps ID [i] data pyss
|
neuper@55448
|
895 |
| update_ptyps ID (i :: is) data ((py as Ptyp (key, d, pys)) :: pyss) =
|
neuper@55448
|
896 |
if i = key
|
neuper@55448
|
897 |
then ((Ptyp (key, d, update_ptyps ID is data pys)) :: pyss)
|
neuper@55448
|
898 |
else (py :: (update_ptyps ID (i :: is) data pyss))
|
neuper@55448
|
899 |
|
s1210629013@55339
|
900 |
(* this function only works wrt. the way Isabelle evaluates Theories and is not a general merge
|
s1210629013@55339
|
901 |
function for trees / ptyps *)
|
s1210629013@55339
|
902 |
fun merge_ptyps ([], pt) = pt
|
s1210629013@55339
|
903 |
| merge_ptyps (pt, []) = pt
|
s1210629013@55346
|
904 |
| merge_ptyps ((x' as Ptyp (k, x, ps)) :: xs, (xs' as Ptyp (k', y, ps') :: ys)) =
|
s1210629013@55346
|
905 |
if k = k'
|
s1210629013@55346
|
906 |
then Ptyp (k, y, merge_ptyps (ps, ps')) :: merge_ptyps (xs, ys)
|
s1210629013@55346
|
907 |
else x' :: merge_ptyps (xs, xs');
|
neuper@55448
|
908 |
fun merge_ptyps' pt1 pt2 = merge_ptyps (pt1, pt2)
|
s1210629013@55372
|
909 |
|
s1210629013@55372
|
910 |
(* data for methods stored in 'methods'-database*)
|
s1210629013@55372
|
911 |
type met =
|
s1210629013@55372
|
912 |
{guh : guh, (*unique within this isac-knowledge *)
|
s1210629013@55372
|
913 |
mathauthors: string list,(*copyright *)
|
s1210629013@55372
|
914 |
init : pblID, (*WN060721 introduced mistakenly--TODO.REMOVE!*)
|
s1210629013@55372
|
915 |
rew_ord' : rew_ord', (*for rules in Detail
|
s1210629013@55372
|
916 |
TODO.WN0509 store fun itself, see 'type pbt'*)
|
s1210629013@55372
|
917 |
erls : rls, (*the eval_rls for cond. in rules FIXME "rls'
|
s1210629013@55372
|
918 |
instead erls in "fun prep_met" *)
|
s1210629013@55372
|
919 |
srls : rls, (*for evaluating list expressions in scr *)
|
s1210629013@55372
|
920 |
prls : rls, (*for evaluating predicates in modelpattern *)
|
s1210629013@55372
|
921 |
crls : rls, (*for check_elementwise, ie. formulae in calc.*)
|
s1210629013@55372
|
922 |
nrls : rls, (*canonical simplifier specific for this met *)
|
s1210629013@55372
|
923 |
errpats : errpat list,(*error patterns expected in this method *)
|
s1210629013@55372
|
924 |
calc : calc list, (*Theory_Data in fun prep_met *)
|
s1210629013@55372
|
925 |
(*branch : TransitiveB set in append_problem at generation ob pblobj
|
s1210629013@55372
|
926 |
FIXXXME.0308: set branch from met in Apply_Method ? *)
|
s1210629013@55372
|
927 |
ppc : pat list, (*.items in given, find, relate;
|
s1210629013@55372
|
928 |
items (in "#Find") which need not occur in the arg-list of a SubProblem
|
s1210629013@55372
|
929 |
are 'copy-named' with an identifier "*'.'".
|
s1210629013@55372
|
930 |
copy-named items are 'generating' if they are NOT "*'''" ?WN120516??
|
s1210629013@55372
|
931 |
see ME/calchead.sml 'fun is_copy_named'. *)
|
s1210629013@55372
|
932 |
pre : term list, (*preconditions in where *)
|
s1210629013@55372
|
933 |
scr : scr (*prep_met gets progam or string "empty_script"*)
|
s1210629013@55372
|
934 |
};
|
s1210629013@55372
|
935 |
val e_met = {guh="met_empty",mathauthors=[],init=e_metID,
|
s1210629013@55372
|
936 |
rew_ord' = "e_rew_ord'": rew_ord',
|
s1210629013@55372
|
937 |
erls = e_rls, srls = e_rls, prls = e_rls,
|
s1210629013@55372
|
938 |
calc = [], crls = e_rls, errpats = [], nrls= e_rls,
|
s1210629013@55372
|
939 |
ppc = []: (string * (term * term)) list,
|
s1210629013@55372
|
940 |
pre = []: term list,
|
s1210629013@55372
|
941 |
scr = EmptyScr: scr}:met;
|
s1210629013@55372
|
942 |
|
s1210629013@55372
|
943 |
|
s1210629013@55372
|
944 |
val e_Mets = Ptyp ("e_metID",[e_met],[]);
|
s1210629013@55372
|
945 |
|
s1210629013@55372
|
946 |
type mets = (met ptyp) list;
|
neuper@55335
|
947 |
|
s1210629013@55373
|
948 |
fun coll_metguhs mets =
|
s1210629013@55373
|
949 |
let fun node coll (Ptyp (_,[n],ns)) =
|
neuper@55428
|
950 |
[(#guh : met -> guh) n] @ (nodes coll ns)
|
s1210629013@55373
|
951 |
and nodes coll [] = coll
|
s1210629013@55373
|
952 |
| nodes coll (n::ns) = (node coll n) @ (nodes coll ns);
|
s1210629013@55373
|
953 |
in nodes [] mets end;
|
s1210629013@55373
|
954 |
|
s1210629013@55373
|
955 |
fun check_metguh_unique (guh:guh) (mets: (met ptyp) list) =
|
s1210629013@55373
|
956 |
if member op = (coll_metguhs mets) guh
|
s1210629013@55373
|
957 |
then error ("check_guh_unique failed with '"^guh^"';\n"^
|
s1210629013@55373
|
958 |
"use 'sort_metguhs()' for a list of guhs;\n"^
|
s1210629013@55373
|
959 |
"consider setting 'check_guhs_unique := false'")
|
s1210629013@55373
|
960 |
else ();
|
s1210629013@55373
|
961 |
|
neuper@55450
|
962 |
fun Html_default exist = (Html {guh = theID2guh exist,
|
neuper@55450
|
963 |
coursedesign = ["isac team 2006"], mathauthors = [], html = ""})
|
neuper@55450
|
964 |
|
neuper@55450
|
965 |
fun fill_parents (exist, [i]) thydata = Ptyp (i, [thydata], [])
|
neuper@55450
|
966 |
| fill_parents (exist, i :: is) thydata =
|
neuper@55450
|
967 |
Ptyp (i, [Html_default (exist @ [i])], [fill_parents (exist @ [i], is) thydata])
|
neuper@55450
|
968 |
| fill_parents _ _ = error "Html_default: avoid ML warning: Matches are not exhaustive"
|
neuper@55450
|
969 |
|
neuper@55450
|
970 |
fun add_thydata (exist, is) thydata [] = [fill_parents (exist, is) thydata]
|
neuper@55450
|
971 |
| add_thydata (exist, [i]) data (pys as (py as Ptyp (key, _, _)) :: pyss) =
|
neuper@55450
|
972 |
if i = key
|
neuper@55450
|
973 |
then pys (* preserve existing thydata *)
|
neuper@55450
|
974 |
else py :: add_thydata (exist, [i]) data pyss
|
neuper@55450
|
975 |
| add_thydata (exist, iss as (i :: is)) data ((py as Ptyp (key, d, pys)) :: pyss) =
|
neuper@55450
|
976 |
if i = key
|
neuper@55450
|
977 |
then
|
neuper@55450
|
978 |
if length pys = 0
|
neuper@55450
|
979 |
then Ptyp (key, d, [fill_parents (exist @ [i], is) data]) :: pyss
|
neuper@55450
|
980 |
else Ptyp (key, d, add_thydata (exist @ [i], is) data pys) :: pyss
|
neuper@55450
|
981 |
else py :: add_thydata (exist, iss) data pyss
|
neuper@55450
|
982 |
| add_thydata _ _ _ = error "add_thydata: avoid ML warning: Matches are not exhaustive"
|
neuper@55448
|
983 |
|
neuper@55448
|
984 |
fun update_hthm (Hthm {guh, coursedesign, mathauthors, thm, ...}) fillpats' =
|
neuper@55448
|
985 |
Hthm {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,
|
neuper@55448
|
986 |
fillpats = fillpats', thm = thm}
|
neuper@55448
|
987 |
| update_hthm _ _ = raise ERROR "wrong data";
|
neuper@55448
|
988 |
|
neuper@55448
|
989 |
(* for interface for dialog-authoring *)
|
neuper@55448
|
990 |
fun update_hrls (Hrls {guh, coursedesign, mathauthors, thy_rls = (thyID, rls)}) errpatIDs =
|
neuper@55448
|
991 |
let
|
neuper@55448
|
992 |
val rls' =
|
neuper@55448
|
993 |
case rls of
|
neuper@55448
|
994 |
Rls {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...} =>
|
neuper@55448
|
995 |
Rls {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,
|
neuper@55448
|
996 |
calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}
|
neuper@55448
|
997 |
| Seq {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...} =>
|
neuper@55448
|
998 |
Seq {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,
|
neuper@55448
|
999 |
calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}
|
neuper@55448
|
1000 |
| Rrls {id, prepat, rew_ord, erls, calc, scr, ...} =>
|
neuper@55448
|
1001 |
Rrls {id = id, prepat = prepat, rew_ord = rew_ord, erls = erls, calc = calc,
|
neuper@55448
|
1002 |
scr = scr, errpatts = errpatIDs}
|
neuper@55448
|
1003 |
| Erls => Erls
|
neuper@55448
|
1004 |
in
|
neuper@55448
|
1005 |
Hrls {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,
|
neuper@55448
|
1006 |
thy_rls = (thyID, rls')}
|
neuper@55448
|
1007 |
end
|
neuper@55448
|
1008 |
| update_hrls _ _ = raise ERROR "wrong data";
|
neuper@55448
|
1009 |
|
neuper@55448
|
1010 |
fun app_py p f (d:pblID) (k(*:pblRD*)) = let
|
neuper@55448
|
1011 |
fun py_err _ =
|
neuper@55448
|
1012 |
error ("app_py: not found: " ^ (strs2str d));
|
neuper@55448
|
1013 |
fun app_py' _ [] = py_err ()
|
neuper@55448
|
1014 |
| app_py' [] _ = py_err ()
|
neuper@55448
|
1015 |
| app_py' [k0] ((p' as Ptyp (k', _, _ ))::ps) =
|
neuper@55448
|
1016 |
if k0 = k' then f p' else app_py' [k0] ps
|
neuper@55448
|
1017 |
| app_py' (k' as (k0::ks)) (Ptyp (k'', _, ps)::ps') =
|
neuper@55448
|
1018 |
if k0 = k'' then app_py' ks ps else app_py' k' ps';
|
neuper@55448
|
1019 |
in app_py' k p end;
|
neuper@55448
|
1020 |
|
neuper@55448
|
1021 |
fun get_py p = let
|
neuper@55448
|
1022 |
fun extract_py (Ptyp (_, [py], _)) = py
|
neuper@55448
|
1023 |
| extract_py _ = error ("extract_py: Ptyp has wrong format.");
|
neuper@55448
|
1024 |
in app_py p extract_py end;
|
neuper@55448
|
1025 |
|
neuper@55448
|
1026 |
fun (*KEStore_Elems.*)insert_fillpats th fis = (* for tests bypassing setup KEStore_Elems *)
|
neuper@55448
|
1027 |
let
|
neuper@55448
|
1028 |
fun update_elem th (theID, fillpats) =
|
neuper@55437
|
1029 |
let
|
neuper@55448
|
1030 |
val hthm = get_py th theID theID
|
neuper@55448
|
1031 |
val hthm' = update_hthm hthm fillpats
|
neuper@55448
|
1032 |
handle ERROR _ => error ("insert_fillpats: " ^ strs2str theID ^ "must address a theorem")
|
neuper@55448
|
1033 |
in update_ptyps theID theID hthm' end
|
neuper@55448
|
1034 |
in fold (update_elem th) fis end
|
neuper@55456
|
1035 |
|
neuper@55456
|
1036 |
(* group the theories defined in Isac, compare Build_Thydata:
|
neuper@55456
|
1037 |
section "Get and group the theories defined in Isac" *)
|
neuper@55456
|
1038 |
fun isabthys () = (*["Complex_Main", "Taylor", .., "Pure"]*)
|
neuper@55456
|
1039 |
let
|
neuper@55456
|
1040 |
val allthys = Theory.ancestors_of (Thy_Info.get_theory "Build_Thydata")
|
neuper@55456
|
1041 |
in
|
neuper@55456
|
1042 |
drop ((find_index (curry Theory.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys), allthys)
|
neuper@55456
|
1043 |
end
|
neuper@55456
|
1044 |
fun knowthys () = (*["Isac", .., "Descript", "Delete"]*)
|
neuper@55456
|
1045 |
let
|
neuper@55456
|
1046 |
fun isacthys () = (* ["Isac", .., "KEStore"] without Build_Isac thys: "Interpret" etc *)
|
neuper@55456
|
1047 |
let
|
neuper@55456
|
1048 |
val allthys = filter_out (member Theory.eq_thy
|
neuper@55456
|
1049 |
[(*Thy_Info.get_theory "ProgLang",*) Thy_Info.get_theory "Interpret",
|
neuper@55456
|
1050 |
Thy_Info.get_theory "xmlsrc", Thy_Info.get_theory "Frontend"])
|
neuper@55456
|
1051 |
(Theory.ancestors_of (Thy_Info.get_theory "Build_Thydata"))
|
neuper@55456
|
1052 |
in
|
neuper@55456
|
1053 |
take ((find_index (curry Theory.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys),
|
neuper@55456
|
1054 |
allthys)
|
neuper@55456
|
1055 |
end
|
neuper@55456
|
1056 |
val isacthys' = isacthys ()
|
neuper@55456
|
1057 |
val proglang_parent = Thy_Info.get_theory "ProgLang"
|
neuper@55456
|
1058 |
in
|
neuper@55456
|
1059 |
take ((find_index (curry Theory.eq_thy proglang_parent) isacthys'), isacthys')
|
neuper@55456
|
1060 |
end
|
neuper@55456
|
1061 |
fun progthys () = (*["Isac", .., "Descript", "Delete"]*)
|
neuper@55456
|
1062 |
let
|
neuper@55456
|
1063 |
fun isacthys () = (* ["Isac", .., "KEStore"] without Build_Isac thys: "Interpret" etc *)
|
neuper@55456
|
1064 |
let
|
neuper@55456
|
1065 |
val allthys = filter_out (member Theory.eq_thy
|
neuper@55456
|
1066 |
[(*Thy_Info.get_theory "ProgLang",*) Thy_Info.get_theory "Interpret",
|
neuper@55456
|
1067 |
Thy_Info.get_theory "xmlsrc", Thy_Info.get_theory "Frontend"])
|
neuper@55456
|
1068 |
(Theory.ancestors_of (Thy_Info.get_theory "Build_Thydata"))
|
neuper@55456
|
1069 |
in
|
neuper@55456
|
1070 |
take ((find_index (curry Theory.eq_thy (Thy_Info.get_theory "Complex_Main")) allthys),
|
neuper@55456
|
1071 |
allthys)
|
neuper@55456
|
1072 |
end
|
neuper@55456
|
1073 |
val isacthys' = isacthys ()
|
neuper@55456
|
1074 |
val proglang_parent = Thy_Info.get_theory "ProgLang"
|
neuper@55456
|
1075 |
in
|
neuper@55456
|
1076 |
drop ((find_index (curry Theory.eq_thy proglang_parent) isacthys') + 1(*ProgLang*), isacthys')
|
neuper@55456
|
1077 |
end
|
neuper@55456
|
1078 |
|
neuper@55456
|
1079 |
fun partID thy =
|
neuper@55456
|
1080 |
if member Theory.eq_thy (knowthys ()) thy then "IsacKnowledge"
|
neuper@55456
|
1081 |
else if member Theory.eq_thy (progthys ()) thy then "IsacScripts"
|
neuper@55456
|
1082 |
else if member Theory.eq_thy (isabthys ()) thy then "Isabelle"
|
neuper@55456
|
1083 |
else error ("closure of thys in Isac is broken by " ^ string_of_thy thy)
|
neuper@55456
|
1084 |
fun partID' (thy' : theory') = partID (Thy_Info.get_theory thy')
|
neuper@38061
|
1085 |
(*
|
neuper@38061
|
1086 |
end (*struct*)
|
neuper@38061
|
1087 |
*)
|