1 (* Title: interpreter for scripts
2 Author: Walther Neuper 2000
3 (c) due to copyright terms
4 12345678901234567890123456789012345678901234567890123456789012345678901234567890
5 10 20 30 40 50 60 70 80
8 signature INTERPRETER =
10 (*type ets (list of executed tactics) see sequent.sml*)
14 | Steps of (tac_ * mout * ptree * pos' * cid * safe (* ets*)) list
15 (* | ToDo of ets 28.4.02*)
17 (*diss: next-tactic-function*)
18 val next_tac : theory' -> ptree * pos' -> metID -> scr -> ets -> tac_
19 (*diss: locate-function*)
20 val locate_gen : theory'
22 -> ptree * pos' -> scr * rls -> ets -> loc_ -> locate
24 val sel_rules : ptree -> pos' -> tac list
25 val init_form : scr -> ets -> loc_ * term option (*FIXME not up to date*)
26 val formal_args : term -> term list
28 (*shift to library ...*)
29 val inst_abs : theory' -> term -> term
30 val itms2args : metID -> itm list -> term list
31 val user_interrupt : loc_ * (tac_ * env * env * term * term * safe)
39 structure Interpreter : INTERPRETER =
43 (*.traces the leaves (ie. non-tactical nodes) of the script
45 a leaf is either a tactic or an 'exp' in 'let v = expr'
46 where 'exp' does not contain a tactic.*)
47 val trace_script = Unsynchronized.ref false;
49 type step = (*data for creating a new node in the ptree;
51 fun ass* scrstate steps =
52 ... case ass* scrstate steps of
53 Assoc (scrstate, steps) => ... ass* scrstate steps*)
54 tac_ (*transformed from associated tac*)
55 * mout (*result with indentation etc.*)
56 * ptree (*containing node created by tac_ + resp. scrstate*)
57 * pos' (*position in ptree; ptree * pos' is the proofstate*)
58 * pos' list; (*of ptree-nodes probably cut (by fst tac_)*)
59 val e_step = (Empty_Tac_, EmptyMout, EmptyPtree, e_pos',[]:pos' list):step;
61 fun rule2thm' (Thm (id, thm)) = (id, string_of_thmI thm):thm'
62 | rule2thm' r = error ("rule2thm': not defined for "^(rule2str r));
63 fun rule2rls' (Rls_ rls) = id_rls rls
64 | rule2rls' r = error ("rule2rls': not defined for "^(rule2str r));
66 (*.makes a (rule,term) list to a Step (m, mout, pt', p', cid) for solve;
67 complicated with current t in rrlsstate.*)
68 fun rts2steps steps ((pt,p),(f,f'',rss,rts),(thy',ro,er,pa)) [(r, (f', am))] =
70 val thy = assoc_thy thy'
71 val ctxt = get_ctxt pt p |> insert_assumptions am
72 val m = Rewrite' (thy', ro, er, pa, rule2thm' r, f, (f', am))
73 val is = RrlsState (f', f'', rss, rts)
74 val p = case p of (p',Frm) => p | (p',Res) => (lev_on p',Res)
75 val (p', cid, mout, pt') = generate1 thy m (is, ctxt) p pt
76 in (is, (m, mout, pt', p', cid) :: steps) end
77 | rts2steps steps ((pt,p),(f,f'',rss,rts),(thy',ro,er,pa)) ((r, (f', am))::rts') =
79 val thy = assoc_thy thy'
80 val ctxt = get_ctxt pt p |> insert_assumptions am
81 val m = Rewrite' (thy',ro,er,pa, rule2thm' r, f, (f', am))
82 val is = RrlsState (f',f'',rss,rts)
83 val p = case p of (p',Frm) => p | (p',Res) => (lev_on p',Res)
84 val (p', cid, mout, pt') = generate1 thy m (is, ctxt) p pt
85 in rts2steps ((m, mout, pt', p', cid)::steps)
86 ((pt',p'),(f',f'',rss,rts),(thy',ro,er,pa)) rts' end;
88 (*. functions for the environment stack .*)
89 fun accessenv id es = the (assoc((top es):env, id))
90 handle _ => error ("accessenv: "^(free2str id)^" not in env");
91 fun updateenv id vl (es:env stack) =
92 (push (overwrite(top es, (id, vl))) (pop es)):env stack;
93 fun pushenv id vl (es:env stack) =
94 (push (overwrite(top es, (id, vl))) es):env stack;
95 val popenv = pop:env stack -> env stack;
99 fun de_esc_underscore str =
101 | scan (s::ss) = if s = "'" then (scan ss)
103 in (implode o scan o Symbol.explode) str end;
105 > val str = "Rewrite_Set_Inst";
106 > val esc = esc_underscore str;
107 val it = "Rewrite'_Set'_Inst" : string
108 > val des = de_esc_underscore esc;
109 val des = de_esc_underscore esc;*)
111 (*go at a location in a script and fetch the contents*)
113 | go (D::p) (Abs(s,ty,t0)) = go (p:loc_) t0
114 | go (L::p) (t1 $ t2) = go p t1
115 | go (R::p) (t1 $ t2) = go p t2
116 | go l _ = error ("go: no "^(loc_2str l));
118 > val t = (term_of o the o (parse thy)) "a+b";
119 val it = Const (#,#) $ Free (#,#) $ Free ("b","RealDef.real") : term
120 > val plus_a = go [L] t;
122 > val plus = go [L,L] t;
123 > val a = go [L,R] t;
125 > val t = (term_of o the o (parse thy)) "a+b+c";
126 val t = Const (#,#) $ (# $ # $ Free #) $ Free ("c","RealDef.real") : term
127 > val pl_pl_a_b = go [L] t;
129 > val a = go [L,R,L,R] t;
130 > val b = go [L,R,R] t;
134 (* get a subterm t with test t, and record location *)
135 fun get l test (t as Const (s,T)) =
136 if test t then SOME (l,t) else NONE
137 | get l test (t as Free (s,T)) =
138 if test t then SOME (l,t) else NONE
139 | get l test (t as Bound n) =
140 if test t then SOME (l,t) else NONE
141 | get l test (t as Var (s,T)) =
142 if test t then SOME (l,t) else NONE
143 | get l test (t as Abs (s,T,body)) =
144 if test t then SOME (l:loc_,t) else get ((l@[D]):loc_) test body
145 | get l test (t as t1 $ t2) =
146 if test t then SOME (l,t)
147 else case get (l@[L]) test t1 of
148 NONE => get (l@[R]) test t2
149 | SOME (l',t') => SOME (l',t');
151 > val sss = ((term_of o the o (parse thy))
152 "Script Solve_root_equation (eq_::bool) (v_::real) (err_::bool) =\
153 \ (let e_ = Try (Rewrite square_equation_left True eq_) \
155 ______ compares head_of !!
156 > get [] (eq_str "HOL.Let") sss; [R]
157 > get [] (eq_str "Script.Try") sss; [R,L,R]
158 > get [] (eq_str "Script.Rewrite") sss; [R,L,R,R]
159 > get [] (eq_str "HOL.True") sss; [R,L,R,R,L,R]
160 > get [] (eq_str "e_") sss; [R,R]
163 fun test_negotiable t =
164 member op = (!negotiable)
165 ((strip_thy o (term_str (Thy_Info.get_theory "Script")) o head_of) t);
167 (*.get argument of first stactic in a script for init_form.*)
168 fun get_stac thy (h $ body) =
170 fun get_t y (Const ("Script.Seq",_) $ e1 $ e2) a =
171 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
172 | get_t y (Const ("Script.Seq",_) $ e1 $ e2 $ a) _ =
173 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
174 | get_t y (Const ("Script.Try",_) $ e) a = get_t y e a
175 | get_t y (Const ("Script.Try",_) $ e $ a) _ = get_t y e a
176 | get_t y (Const ("Script.Repeat",_) $ e) a = get_t y e a
177 | get_t y (Const ("Script.Repeat",_) $ e $ a) _ = get_t y e a
178 | get_t y (Const ("Script.Or",_) $e1 $ e2) a =
179 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
180 | get_t y (Const ("Script.Or",_) $e1 $ e2 $ a) _ =
181 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
182 | get_t y (Const ("Script.While",_) $ c $ e) a = get_t y e a
183 | get_t y (Const ("Script.While",_) $ c $ e $ a) _ = get_t y e a
184 | get_t y (Const ("Script.Letpar",_) $ e1 $ Abs (_,_,e2)) a =
185 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
186 (*| get_t y (Const ("HOL.Let",_) $ e1 $ Abs (_,_,e2)) a =
187 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
188 | get_t y (Abs (_,_,e)) a = get_t y e a*)
189 | get_t y (Const ("HOL.Let",_) $ e1 $ Abs (_,_,e2)) a =
190 get_t y e1 a (*don't go deeper without evaluation !*)
191 | get_t y (Const ("If",_) $ c $ e1 $ e2) a = NONE
192 (*(case get_t y e1 a of NONE => get_t y e2 a | la => la)*)
194 | get_t y (Const ("Script.Rewrite",_) $ _ $ _ $ a) _ = SOME a
195 | get_t y (Const ("Script.Rewrite",_) $ _ $ _ ) a = SOME a
196 | get_t y (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ $ a) _ = SOME a
197 | get_t y (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ ) a = SOME a
198 | get_t y (Const ("Script.Rewrite'_Set",_) $ _ $ _ $ a) _ = SOME a
199 | get_t y (Const ("Script.Rewrite'_Set",_) $ _ $ _ ) a = SOME a
200 | get_t y (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ $a)_ =SOME a
201 | get_t y (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ ) a =SOME a
202 | get_t y (Const ("Script.Calculate",_) $ _ $ a) _ = SOME a
203 | get_t y (Const ("Script.Calculate",_) $ _ ) a = SOME a
205 | get_t y (Const ("Script.Substitute",_) $ _ $ a) _ = SOME a
206 | get_t y (Const ("Script.Substitute",_) $ _ ) a = SOME a
208 | get_t y (Const ("Script.SubProblem",_) $ _ $ _) _ = NONE
211 ((*tracing ("### get_t yac: list-expr "^(term2str x));*)
213 in get_t thy body e_term end;
215 (*FIXME: get 1st stac by next_stac [] instead of ... ?? 29.7.02*)
216 (* val Script sc = scr;
218 fun init_form thy (Script sc) env =
219 (case get_stac thy sc of
221 (*error ("init_form: no 1st stac in "^
222 (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) sc))*)
223 | SOME stac => SOME (subst_atomic env stac))
224 | init_form _ _ _ = error "init_form: no match";
226 (* use"ME/script.sml";
232 (*the 'iteration-argument' of a stac (args not eval)*)
233 fun itr_arg _ (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ $ v) = v
234 | itr_arg _ (Const ("Script.Rewrite",_) $ _ $ _ $ v) = v
235 | itr_arg _ (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ $ v) = v
236 | itr_arg _ (Const ("Script.Rewrite'_Set",_) $ _ $ _ $ v) = v
237 | itr_arg _ (Const ("Script.Calculate",_) $ _ $ v) = v
238 | itr_arg _ (Const ("Script.Check'_elementwise",_) $ consts $ _) = consts
239 | itr_arg _ (Const ("Script.Or'_to'_List",_) $ _) = e_term
240 | itr_arg _ (Const ("Script.Tac",_) $ _) = e_term
241 | itr_arg _ (Const ("Script.SubProblem",_) $ _ $ _) = e_term
242 | itr_arg thy t = error
243 ("itr_arg not impl. for " ^
244 (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt (assoc_thy thy))) t));
245 (* val t = (term_of o the o (parse thy))"Rewrite rroot_square_inv False e_";
246 > itr_arg "Script" t;
247 val it = Free ("e_","RealDef.real") : term
248 > val t = (term_of o the o (parse thy))"xxx";
249 > itr_arg "Script" t;
250 *** itr_arg not impl. for xxx
251 uncaught exception ERROR
252 raised at: library.ML:1114.35-1114.40*)
255 (*.get the arguments of the script out of the scripts parsetree.*)
256 fun formal_args scr = (fst o split_last o snd o strip_comb) scr;
259 [Free ("f_","RealDef.real"),Free ("v_","RealDef.real"),
260 Free ("eqs_","bool List.list")] : term list
263 (*.get the identifier of the script out of the scripts parsetree.*)
264 fun id_of_scr sc = (id_of o fst o strip_comb) sc;
266 (*WN020526: not clear, when a is available in ass_up for eva-_true*)
267 (*WN060906: in "fun handle_leaf" eg. uses "SOME M__"(from some PREVIOUS
268 curried Rewrite) for CURRENT value (which may be different from PREVIOUS);
269 thus "NONE" must be set at the end of currying (ill designed anyway)*)
270 fun upd_env_opt env (SOME a, v) = upd_env env (a,v)
271 | upd_env_opt env (NONE, v) =
272 (tracing ("*** upd_env_opt: (NONE," ^ term2str v ^ ")"); env);
274 type dsc = typ; (*<-> nam..unknow in Descript.thy*)
275 fun typ_str (Type (s,_)) = s
276 | typ_str (TFree(s,_)) = s
277 | typ_str (TVar ((s,i),_)) = s ^ (string_of_int i);
279 (*get the _result_-type of a description*)
280 fun dsc_valT (Const (_,(Type (_,[_,T])))) = (strip_thy o typ_str) T;
281 (*> val t = (term_of o the o (parse thy)) "equality";
283 val T = "bool => Tools.una" : typ
284 > val dsc = dsc_valT t;
285 val dsc = "una" : string
287 > val t = (term_of o the o (parse thy)) "fixedValues";
289 val T = "bool List.list => Tools.nam" : typ
290 > val dsc = dsc_valT t;
291 val dsc = "nam" : string*)
293 (*.from penv in itm_ make args for script depending on type of description.*)
294 (*6.5.03 TODO: push penv into script -- and drop mk_arg here || drop penv
295 9.5.03 penv postponed: penv = env for script at the moment, (*mk_arg*)*)
296 fun mk_arg thy d [] =
297 error ("mk_arg: no data for " ^
298 (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) d))
304 r as (Const ("HOL.eq",_) $ _ $ _) => r
305 | _ => error ("mk_arg: dsc-typ 'nam' applied to non-equality "^
306 (Print_Mode.setmp [] (Syntax.string_of_term
308 | s => error ("mk_arg: not impl. for "^s))
310 | mk_arg thy d (t::ts) = (mk_arg thy d [t]) @ (mk_arg thy d ts);
313 val [t] = ts_in itm_;
320 (*.create the actual parameters (args) of script: their order
321 is given by the order in met.pat .*)
322 (*WN.5.5.03: ?: does this allow for different descriptions ???
323 ?: why not taken from formal args of script ???
324 !: FIXXXME penv: push it here in itms2args into script-evaluation*)
325 (* val (thy, mI, itms) = (thy, metID, itms);
327 fun itms2args thy mI (itms:itm list) =
328 let val mvat = max_vt itms
329 fun okv mvat (_,vats,b,_,_) = member op = vats mvat andalso b
330 val itms = filter (okv mvat) itms
331 fun test_dsc d (_,_,_,_,itm_) = (d = d_in itm_)
332 fun itm2arg itms (_,(d,_)) =
333 case find_first (test_dsc d) itms of
335 error ("itms2args: '"^term2str d^"' not in itms")
336 (*| SOME (_,_,_,_,itm_) => mk_arg thy (d_in itm_) (ts_in itm_);
337 penv postponed; presently penv holds already env for script*)
338 | SOME (_,_,_,_,itm_) => penvval_in itm_
339 fun sel_given_find (s,_) = (s = "#Given") orelse (s = "#Find")
340 val pats = (#ppc o get_met) mI
341 in (flat o (map (itm2arg itms))) pats end;
343 > val sc = ... Solve_root_equation ...
344 > val mI = ("Script","sqrt-equ-test");
345 > val PblObj{meth={ppc=itms,...},...} = get_obj I pt [];
346 > val ts = itms2args thy mI itms;
347 > map (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))) ts;
348 ["sqrt (#9 + #4 * x) = sqrt x + sqrt (#5 + x)","x","#0"] : string list
352 (*detour necessary, because generate1 delivers a string-result*)
353 fun mout2term thy (Form' (FormKF (_,_,_,_,res))) =
354 (term_of o the o (parse (assoc_thy thy))) res
355 | mout2term thy (Form' (PpcKF _)) = e_term;(*3.8.01: res of subpbl
356 at time of detection in script*)
358 (*.convert a script-tac 'stac' to a tactic 'tac'; if stac is an initac,
359 then convert to a 'tac_' (as required in appy).
360 arg pt:ptree for pushing the thy specified in rootpbl into subpbls.*)
361 fun stac2tac_ pt thy (Const ("Script.Rewrite",_) $ Free (thmID,_) $ _ $ f) =
363 val tid = (de_esc_underscore o strip_thy) thmID
364 in (Rewrite (tid, (string_of_thmI o (assoc_thm' thy)) (tid,"")), Empty_Tac_)
367 | stac2tac_ pt thy (Const ("Script.Rewrite'_Inst",_) $ sub $ Free (thmID,_) $ _ $ f) =
369 val subML = ((map isapair2pair) o isalist2list) sub
370 val subStr = subst2subs subML
371 val tid = (de_esc_underscore o strip_thy) thmID (*4.10.02 unnoetig*)
372 in (Rewrite_Inst (subStr, (tid, (string_of_thmI o (assoc_thm' thy)) (tid,""))), Empty_Tac_)
375 | stac2tac_ pt thy (Const ("Script.Rewrite'_Set",_) $ Free (rls,_) $ _ $ f) =
376 (Rewrite_Set ((de_esc_underscore o strip_thy) rls), Empty_Tac_)
378 | stac2tac_ pt thy (Const ("Script.Rewrite'_Set'_Inst",_) $ sub $ Free (rls,_) $ _ $ f) =
380 val subML = ((map isapair2pair) o isalist2list) sub;
381 val subStr = subst2subs subML;
382 in (Rewrite_Set_Inst (subStr,rls), Empty_Tac_) end
384 | stac2tac_ pt thy (Const ("Script.Calculate",_) $ Free (op_,_) $ f) =
385 (Calculate op_, Empty_Tac_)
387 | stac2tac_ pt thy (Const ("Script.Take",_) $ t) =
388 (Take (term2str t), Empty_Tac_)
390 | stac2tac_ pt thy (Const ("Script.Substitute",_) $ isasub $ arg) =
391 (Substitute ((subte2sube o isalist2list) isasub), Empty_Tac_)
393 | stac2tac_ pt thy (Const("Script.Check'_elementwise",_) $ _ $
394 (set as Const ("Set.Collect",_) $ Abs (_,_,pred))) =
395 (Check_elementwise (Print_Mode.setmp [] (Syntax.string_of_term
396 (thy2ctxt thy)) pred), (*set*)Empty_Tac_)
398 | stac2tac_ pt thy (Const("Script.Or'_to'_List",_) $ _ ) =
399 (Or_to_List, Empty_Tac_)
401 (*12.1.01.for subproblem_equation_dummy in root-equation *)
402 | stac2tac_ pt thy (Const ("Script.Tac",_) $ Free (str,_)) =
403 (Tac ((de_esc_underscore o strip_thy) str), Empty_Tac_)
405 (*compare "| assod _ (Subproblem'"*)
406 | stac2tac_ pt thy (stac as Const ("Script.SubProblem",_) $
407 (Const ("Product_Type.Pair",_) $Free (dI',_) $
408 (Const ("Product_Type.Pair",_) $ pI' $ mI')) $ ags') =
410 val dI = ((implode o drop_last(*.."'"*) o Symbol.explode) dI')(*^""*);
411 val thy = maxthy (assoc_thy dI) (rootthy pt);
412 val pI = ((map (de_esc_underscore o free2str)) o isalist2list) pI';
413 val mI = ((map (de_esc_underscore o free2str)) o isalist2list) mI';
414 val ags = isalist2list ags';
419 val pors = (match_ags thy ((#ppc o get_pbt) pI) ags)
420 handle ERROR "actual args do not match formal args"
421 => (match_ags_msg pI stac ags(*raise exn*); [])
422 val pI' = refine_ori' pors pI;
423 in (pI', pors (*refinement over models with diff.prec only*),
424 (hd o #met o get_pbt) pI') end
425 else (pI, (match_ags thy ((#ppc o get_pbt) pI) ags)
426 handle ERROR "actual args do not match formal args"
427 => (match_ags_msg pI stac ags(*raise exn*); []), mI);
428 val (fmz_, vals) = oris2fmz_vals pors;
429 val {cas,ppc,thy,...} = get_pbt pI
430 val dI = theory2theory' thy (*.take dI from _refined_ pbl.*)
431 val dI = theory2theory' (maxthy (assoc_thy dI) (rootthy pt));
432 val ctxt = ProofContext.init_global
433 val ctxt = dI |> Thy_Info.get_theory |> ProofContext.init_global
434 |> declare_constraints' vals
437 NONE => pblterm dI pI
438 | SOME t => subst_atomic ((vars_of_pbl_' ppc) ~~~ vals) t
439 val f = subpbl (strip_thy dI) pI
440 in (Subproblem (dI, pI), Subproblem' ((dI, pI, mI), pors, hdl, fmz_, ctxt, f))
443 | stac2tac_ pt thy t = error
444 ("stac2tac_ TODO: no match for " ^
445 (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) t));
447 fun stac2tac pt thy t = (fst o stac2tac_ pt thy) t;
449 (*test a term for being a _list_ (set ?) of constants; could be more rigorous*)
450 fun list_of_consts (Const ("List.list.Cons",_) $ _ $ _) = true
451 | list_of_consts (Const ("List.list.Nil",_)) = true
452 | list_of_consts _ = false;
453 (*val ttt = (term_of o the o (parse thy)) "[x=#1,x=#2,x=#3]";
454 > list_of_consts ttt;
456 > val ttt = (term_of o the o (parse thy)) "[]";
457 > list_of_consts ttt;
458 val it = true : bool*)
464 tac_ * (* SubProblem gets args instantiated in assod *)
465 term (* for itr_arg, result in ets *)
468 term (*for itr_arg,result in ets*)
471 (* check if tac_ is associated with stac.
472 Additional task: check if term t (the result has been calculated from) in tac_
473 has been changed (see "datatype tac_"); if yes, recalculate result
474 TODO.WN120106 recalculate impl.only for Substitute'
476 pt : ptree for pushing the thy specified in rootpbl into subpbls
477 d : unused (planned for data for comparison)
478 tac_ : from user (via applicable_in); to be compared with ...
479 stac : found in Script
481 Ass : associated: e.g. thmID in stac = thmID in m
482 +++ arg in stac = arg in m
483 AssWeak: weakly ass.:e.g. thmID in stac = thmID in m, //arg//
484 NotAss : e.g. thmID in stac/=/thmID in m (not =)
486 fun assod pt d (m as Rewrite_Inst' (thy',rod,rls,put,subs,(thmID,thm),f,(f',asm))) stac =
488 (Const ("Script.Rewrite'_Inst",_) $ subs_ $ Free (thmID_,idT) $b$f_) =>
492 then ((*tracing"3### assod ..Ass";*)Ass (m,f'))
493 else ((*tracing"3### assod ..AssWeak";*)AssWeak(m, f'))
494 else ((*tracing"3### assod ..NotAss";*)NotAss)
495 | (Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free (rls_,_) $_$f_) =>
496 if contains_rule (Thm (thmID, refl(*dummy*))) (assoc_rls rls_)
498 if f = f_ then Ass (m,f') else AssWeak (m,f')
502 | assod pt d (m as Rewrite' (thy,rod,rls,put,(thmID,thm),f,(f',asm))) stac =
504 (t as Const ("Script.Rewrite",_) $ Free (thmID_,idT) $ b $ f_) =>
505 ((*tracing ("3### assod: stac = " ^ ter2str t);
506 tracing ("3### assod: f(m)= " ^ term2str f);*)
510 then ((*tracing"3### assod ..Ass";*)Ass (m,f'))
512 ((*tracing"### assod ..AssWeak";
513 tracing("### assod: f(m) = " ^ term2str f);
514 tracing("### assod: f(stac)= " ^ term2str f_)*)
516 else ((*tracing"3### assod ..NotAss";*)NotAss))
517 | (Const ("Script.Rewrite'_Set",_) $ Free (rls_,_) $ _ $ f_) =>
518 if contains_rule (Thm (thmID, refl(*dummy*))) (assoc_rls rls_)
520 if f = f_ then Ass (m,f') else AssWeak (m,f')
524 | assod pt d (m as Rewrite_Set_Inst' (thy',put,sub,rls,f,(f',asm)))
525 (Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free (rls_,_) $ _ $ f_) =
528 if f = f_ then Ass (m,f') else AssWeak (m,f')
531 | assod pt d (m as Detail_Set_Inst' (thy',put,sub,rls,f,(f',asm)))
532 (Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free (rls_,_) $ _ $ f_) =
535 if f = f_ then Ass (m,f') else AssWeak (m,f')
538 | assod pt d (m as Rewrite_Set' (thy,put,rls,f,(f',asm)))
539 (Const ("Script.Rewrite'_Set",_) $ Free (rls_,_) $ _ $ f_) =
542 if f = f_ then Ass (m,f') else AssWeak (m,f')
545 | assod pt d (m as Detail_Set' (thy,put,rls,f,(f',asm)))
546 (Const ("Script.Rewrite'_Set",_) $ Free (rls_,_) $ _ $ f_) =
549 if f = f_ then Ass (m,f') else AssWeak (m,f')
552 | assod pt d (m as Calculate' (thy',op_,f,(f',thm'))) stac =
554 (Const ("Script.Calculate",_) $ Free (op__,_) $ f_) =>
557 if f = f_ then Ass (m,f') else AssWeak (m,f')
559 | (Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free(rls_,_) $_$f_) =>
560 if contains_rule (Calc (snd (assoc1 (!calclist', op_)))) (assoc_rls rls_)
562 if f = f_ then Ass (m,f') else AssWeak (m,f')
564 | (Const ("Script.Rewrite'_Set",_) $ Free (rls_, _) $ _ $ f_) =>
565 if contains_rule (Calc (snd (assoc1 (!calclist', op_)))) (assoc_rls rls_)
567 if f = f_ then Ass (m,f') else AssWeak (m,f')
571 | assod pt _ (m as Check_elementwise' (consts,_,(consts_chkd,_)))
572 (Const ("Script.Check'_elementwise",_) $ consts' $ _) =
574 then Ass (m, consts_chkd)
577 | assod pt _ (m as Or_to_List' (ors, list)) (Const ("Script.Or'_to'_List",_) $ _) =
580 | assod pt _ (m as Take' term) (Const ("Script.Take",_) $ _) =
583 | assod pt _ (m as Substitute' (ro, erls, subte, f, f')) (Const ("Script.Substitute",_) $ _ $ t) =
584 if f = t then Ass (m, f')
585 else (*compare | applicable_in (p,p_) pt (m as Substitute sube)*)
586 if foldl and_ (true, map contains_Var subte)
588 let val t' = subst_atomic (map HOLogic.dest_eq subte (*TODO subte2subst*)) t
589 in if t = t' then error "assod: Substitute' not applicable to val of Expr"
590 else Ass (Substitute' (ro, erls, subte, t, t'), t')
592 else (case rewrite_terms_ (Isac()) ro erls subte t of
593 SOME (t', _) => Ass (Substitute' (ro, erls, subte, t, t'), t')
594 | NONE => error "assod: Substitute' not applicable to val of Expr")
596 | assod pt _ (m as Tac_ (thy,f,id,f')) (Const ("Script.Tac",_) $ Free (id',_)) =
598 then Ass (m, ((term_of o the o (parse thy)) f'))
601 (*compare "| stac2tac_ thy (Const ("Script.SubProblem",_)"*)
602 | assod pt _ (Subproblem' ((domID,pblID,metID),_,_,_,_,f))
603 (stac as Const ("Script.SubProblem",_) $ (Const ("Product_Type.Pair",_) $
604 Free (dI',_) $ (Const ("Product_Type.Pair",_) $ pI' $ mI')) $ ags') =
606 val dI = ((implode o drop_last(*.."'"*) o Symbol.explode) dI')(*^""*);
607 val thy = maxthy (assoc_thy dI) (rootthy pt);
608 val pI = ((map (de_esc_underscore o free2str)) o isalist2list) pI';
609 val mI = ((map (de_esc_underscore o free2str)) o isalist2list) mI';
610 val ags = isalist2list ags';
615 val pors = (match_ags thy ((#ppc o get_pbt) pI) ags)
616 handle ERROR "actual args do not match formal args"
617 => (match_ags_msg pI stac ags(*raise exn*);[]);
618 val pI' = refine_ori' pors pI;
619 in (pI', pors (*refinement over models with diff.prec only*),
620 (hd o #met o get_pbt) pI')
622 else (pI, (match_ags thy ((#ppc o get_pbt) pI) ags)
623 handle ERROR "actual args do not match formal args"
624 => (match_ags_msg pI stac ags(*raise exn*);[]), mI);
625 val (fmz_, vals) = oris2fmz_vals pors;
626 val {cas, ppc, thy,...} = get_pbt pI
627 val dI = theory2theory' thy (*take dI from _refined_ pbl*)
628 val dI = theory2theory' (maxthy (assoc_thy dI) (rootthy pt))
629 val ctxt = dI |> Thy_Info.get_theory |> ProofContext.init_global
630 |> declare_constraints' vals
633 NONE => pblterm dI pI
634 | SOME t => subst_atomic ((vars_of_pbl_' ppc) ~~~ vals) t
635 val f = subpbl (strip_thy dI) pI
637 if domID = dI andalso pblID = pI
638 then Ass (Subproblem' ((dI, pI, mI), pors, hdl, fmz_, ctxt, f), f)
644 then tracing("@@@ the 'tac_' proposed to apply does NOT match the leaf found in the script:\n"^
645 "@@@ tac_ = "^(tac_2str m))
649 fun tac_2tac (Refine_Tacitly' (pI,_,_,_,_)) = Refine_Tacitly pI
650 | tac_2tac (Model_Problem' (pI,_,_)) = Model_Problem
651 | tac_2tac (Add_Given' (t,_)) = Add_Given t
652 | tac_2tac (Add_Find' (t,_)) = Add_Find t
653 | tac_2tac (Add_Relation' (t,_)) = Add_Relation t
655 | tac_2tac (Specify_Theory' dI) = Specify_Theory dI
656 | tac_2tac (Specify_Problem' (dI,_)) = Specify_Problem dI
657 | tac_2tac (Specify_Method' (dI,_,_)) = Specify_Method dI
659 | tac_2tac (Rewrite' (thy,rod,erls,put,(thmID,thm),f,(f',asm))) = Rewrite (thmID,thm)
661 | tac_2tac (Rewrite_Inst' (thy,rod,erls,put,sub,(thmID,thm),f,(f',asm)))=
662 Rewrite_Inst (subst2subs sub,(thmID,thm))
664 | tac_2tac (Rewrite_Set' (thy,put,rls,f,(f',asm))) = Rewrite_Set (id_rls rls)
665 | tac_2tac (Detail_Set' (thy,put,rls,f,(f',asm))) = Detail_Set (id_rls rls)
667 | tac_2tac (Rewrite_Set_Inst' (thy,put,sub,rls,f,(f',asm))) =
668 Rewrite_Set_Inst (subst2subs sub,id_rls rls)
669 | tac_2tac (Detail_Set_Inst' (thy,put,sub,rls,f,(f',asm))) =
670 Detail_Set_Inst (subst2subs sub,id_rls rls)
672 | tac_2tac (Calculate' (thy,op_,t,(t',thm'))) = Calculate (op_)
674 | tac_2tac (Check_elementwise' (consts,pred,consts')) = Check_elementwise pred
676 | tac_2tac (Or_to_List' _) = Or_to_List
677 | tac_2tac (Take' term) = Take (term2str term)
678 | tac_2tac (Substitute' (_, _, subte, t, res)) = Substitute (subte2sube subte)
680 | tac_2tac (Tac_ (_,f,id,f')) = Tac id
682 | tac_2tac (Subproblem' ((domID, pblID, _), _, _, _,_ ,_)) = Subproblem (domID, pblID)
683 | tac_2tac (Check_Postcond' (pblID, _)) = Check_Postcond pblID
684 | tac_2tac Empty_Tac_ = Empty_Tac
686 error ("tac_2tac: not impl. for "^(tac_2str m));
691 (** decompose tac_ to a rule and to (lhs,rhs)
694 val idT = Type ("Script.ID",[]);
695 (*val tt = (term_of o the o (parse thy)) "square_equation_left::ID";
700 fun make_rule thy t =
701 let val ct = cterm_of thy (Trueprop $ t)
702 in Thm (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))
703 (term_of ct), make_thm ct) end;
705 (* val (Rewrite_Inst'(thy',rod,rls,put,subs,(thmID,thm),f,(f',asm)))=m;
707 (*decompose tac_ to a rule and to (lhs,rhs) for ets FIXME.12.03: obsolete!
708 NOTE.12.03: also used for msg 'not locatable' ?!: 'Subproblem' missing !!!
709 WN0508 only use in tac_2res, which uses only last return-value*)
710 fun rep_tac_ (Rewrite_Inst'
711 (thy',rod,rls,put,subs,(thmID,thm),f,(f',asm))) =
712 let val fT = type_of f;
713 val b = if put then HOLogic.true_const else HOLogic.false_const;
714 val sT = (type_of o fst o hd) subs;
715 val subs' = list2isalist (HOLogic.mk_prodT (sT, sT))
716 (map HOLogic.mk_prod subs);
717 val sT' = type_of subs';
718 val lhs = Const ("Script.Rewrite'_Inst",[sT',idT,(*fT*)bool,fT] ---> fT)
719 $ subs' $ Free (thmID,idT) $ b $ f;
720 in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end
721 (*Fehlersuche 25.4.01
722 (a)----- als String zusammensetzen:
724 val it = "d_d x #4 + d_d x (x ^^^ #2 + #3 * x)" : string
726 val it = "#0 + d_d x (x ^^^ #2 + #3 * x)" : string
728 val it = [(Free ("bdv","RealDef.real"),Free ("x","RealDef.real"))] : subst
729 > val tt = (term_of o the o (parse thy))
730 "(Rewrite_Inst[(bdv,x)]diff_const False(d_d x #4 + d_d x (x ^^^ #2 + #3 * x)))=(#0 + d_d x (x ^^^ #2 + #3 * x))";
732 ML> tracing (term2str tt);
733 (Rewrite_Inst [(bdv,x)] diff_const False d_d x #4 + d_d x (x ^^^ #2 + #3 * x)) =
734 #0 + d_d x (x ^^^ #2 + #3 * x)
736 (b)----- laut rep_tac_:
737 > val ttt=HOLogic.mk_eq (lhs,f');
741 (*Fehlersuche 1-2Monate vor 4.01:*)
742 > val tt = (term_of o the o (parse thy))
743 "Rewrite_Inst[(bdv,x)]square_equation_left True(x=#1+#2)";
746 > val f = (term_of o the o (parse thy)) "x=#1+#2";
747 > val f' = (term_of o the o (parse thy)) "x=#3";
748 > val subs = [((term_of o the o (parse thy)) "bdv",
749 (term_of o the o (parse thy)) "x")];
750 > val sT = (type_of o fst o hd) subs;
751 > val subs' = list2isalist (HOLogic.mk_prodT (sT, sT))
752 (map HOLogic.mk_prod subs);
753 > val sT' = type_of subs';
754 > val lhs = Const ("Script.Rewrite'_Inst",[sT',idT,fT,fT] ---> fT)
755 $ subs' $ Free (thmID,idT) $ HOLogic.true_const $ f;
758 > rep_tac_ (Rewrite_Inst'
759 ("Script","tless_true","eval_rls",false,subs,
760 ("square_equation_left",""),f,(f',[])));
762 | rep_tac_ (Rewrite' (thy',rod,rls,put,(thmID,thm),f,(f',asm)))=
765 val b = if put then HOLogic.true_const else HOLogic.false_const;
766 val lhs = Const ("Script.Rewrite",[idT,HOLogic.boolT,fT] ---> fT)
767 $ Free (thmID,idT) $ b $ f;
768 in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end
770 > val tt = (term_of o the o (parse thy)) (*____ ____..test*)
771 "Rewrite square_equation_left True (x=#1+#2) = (x=#3)";
773 > val f = (term_of o the o (parse thy)) "x=#1+#2";
774 > val f' = (term_of o the o (parse thy)) "x=#3";
777 ("Script","tless_true","eval_rls",false,
778 ("square_equation_left",""),f,(f',[])));
779 > val SOME ct = parse thy
780 "Rewrite square_equation_left True (x=#1+#2)";
781 > rewrite_ Script.thy tless_true eval_rls true thm ct;
782 val it = SOME ("x = #3",[]) : (cterm * cterm list) option
784 | rep_tac_ (Rewrite_Set_Inst'
785 (thy',put,subs,rls,f,(f',asm))) =
786 (e_rule, (e_term, f'))
787 (*WN050824: type error ...
788 let val fT = type_of f;
789 val sT = (type_of o fst o hd) subs;
790 val subs' = list2isalist (HOLogic.mk_prodT (sT, sT))
791 (map HOLogic.mk_prod subs);
792 val sT' = type_of subs';
793 val b = if put then HOLogic.true_const else HOLogic.false_const
794 val lhs = Const ("Script.Rewrite'_Set'_Inst",
795 [sT',idT,fT,fT] ---> fT)
796 $ subs' $ Free (id_rls rls,idT) $ b $ f;
797 in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end*)
798 (* ... vals from Rewrite_Inst' ...
799 > rep_tac_ (Rewrite_Set_Inst'
800 ("Script",false,subs,
801 "isolate_bdv",f,(f',[])));
803 (* val (Rewrite_Set' (thy',put,rls,f,(f',asm)))=m;
805 | rep_tac_ (Rewrite_Set' (thy',put,rls,f,(f',asm)))=
806 let val fT = type_of f;
807 val b = if put then HOLogic.true_const else HOLogic.false_const;
808 val lhs = Const ("Script.Rewrite'_Set",[idT,bool,fT] ---> fT)
809 $ Free (id_rls rls,idT) $ b $ f;
810 in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end
812 val thy = assoc_thy thy';
813 val t = HOLogic.mk_eq (lhs,f');
815 --------------------------------------------------
816 val lll = (term_of o the o (parse thy))
817 "Rewrite_Set SqRoot_simplify False (d_d x (x ^^^ #2 + #3 * x) + d_d x #4)";
819 --------------------------------------------------
820 > val f = (term_of o the o (parse thy)) "x=#1+#2";
821 > val f' = (term_of o the o (parse thy)) "x=#3";
823 rep_tac_ (Rewrite_Set'
824 ("Script",false,"SqRoot_simplify",f,(f',[])));
825 val id = "(Rewrite_Set SqRoot_simplify True x = #1 + #2) = (x = #3)" : string
826 val thm = "(Rewrite_Set SqRoot_simplify True x = #1 + #2) = (x = #3)" : thm
828 | rep_tac_ (Calculate' (thy',op_,f,(f',thm')))=
829 let val fT = type_of f;
830 val lhs = Const ("Script.Calculate",[idT,fT] ---> fT)
832 in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end
834 > val lhs'=(term_of o the o (parse thy))"Calculate plus (#1+#2)";
835 ... test-root-equ.sml: calculate ...
836 > val Appl m'=applicable_in p pt (Calculate "PLUS");
837 > val (lhs,_)=tac_2etac m';
839 val it = true : bool*)
840 | rep_tac_ (Check_elementwise' (t,str,(t',asm))) = (Erule, (e_term, t'))
841 | rep_tac_ (Subproblem' (_, _, _, _, _, t')) = (Erule, (e_term, t'))
842 | rep_tac_ (Take' (t')) = (Erule, (e_term, t'))
843 | rep_tac_ (Substitute' (_, _, subst,t,t')) = (Erule, (t, t'))
844 | rep_tac_ (Or_to_List' (t, t')) = (Erule, (t, t'))
845 | rep_tac_ m = error ("rep_tac_: not impl.for "^
849 fun tac_2rule m = (fst o rep_tac_) m;
850 fun tac_2etac m = (snd o rep_tac_) m;
851 fun tac_2tac m = (fst o snd o rep_tac_) m;*)
852 fun tac_2res m = (snd o snd o rep_tac_) m;(*ONLYuse of rep_tac_
853 FIXXXXME: simplify rep_tac_*)
856 (* handle a leaf at the end of recursive descent:
857 a leaf is either a tactic or an 'expr' in "let v = expr"
858 where "expr" does not contain a tactic.
859 Handling a leaf comprises
860 (1) 'subst_stacexpr' substitute env and complete curried tactic
861 (2) rewrite the leaf by 'srls'
863 fun handle_leaf call thy srls E a v t =
864 (*WN050916 'upd_env_opt' is a blind copy from previous version*)
865 case subst_stacexpr E a v t of
866 (a', STac stac) => (*script-tactic*)
868 eval_listexpr_ (assoc_thy thy) srls (subst_atomic (upd_env_opt E (a,v)) stac)
871 then tracing ("@@@ "^call^" leaf '"^term2str t^"' ---> STac '"^term2str stac'^"'")
875 | (a', Expr lexpr) => (*leaf-expression*)
877 eval_listexpr_ (assoc_thy thy) srls (subst_atomic (upd_env_opt E (a,v)) lexpr)
880 then tracing("@@@ "^call^" leaf '"^term2str t^"' ---> Expr '"^term2str lexpr'^"'")
882 (a', Expr lexpr')) (*lexpr' is the value of the Expr*)
886 (** locate an applicable stactic in a script **)
888 datatype assoc = (*ExprVal in the sense of denotational semantics*)
889 Assoc of (*the stac is associated, strongly or weakly*)
890 scrstate * (*the current; returned for next_tac etc. outside ass* *)
891 (step list) (*list of steps done until associated stac found;
892 initiated with the data for doing the 1st step,
893 thus the head holds these data further on,
894 while the tail holds steps finished (incl.scrstate in ptree)*)
895 | NasApp of (*stac not associated, but applicable, ptree-node generated*)
896 scrstate * (step list)
897 | NasNap of (*stac not associated, not applicable, nothing generated;
898 for distinction in Or, for leaving iterations, leaving Seq,
899 evaluate scriptexpressions*)
901 fun assoc2str (Assoc _) = "Assoc"
902 | assoc2str (NasNap _) = "NasNap"
903 | assoc2str (NasApp _) = "NasApp";
906 datatype asap = (*arg. of assy _only_ for distinction w.r.t. Or*)
907 Aundef (*undefined: set only by (topmost) Or*)
908 | AssOnly (*do not execute appl stacs - there could be an associated
909 in parallel Or-branch*)
910 | AssGen; (*no Ass(Weak) found within Or, thus
911 search for _applicable_ stacs, execute and generate pt*)
912 (*this constructions doesnt allow arbitrary nesting of Or !!!*)
915 (*assy, ass_up, astep_up scan for locate_gen in a script.
916 search is clearly separated into (1)-(2):
917 (1) assy is recursive descent;
918 (2) ass_up resumes interpretation at a location somewhere in the script;
919 astep_up does only get to the parentnode of the scriptexpr.
921 * call of (2) means _always_ that in this branch below
922 there was an appl.stac (Repeat, Or e1, ...) found by the previous step.
924 fun assy ya (is as (E,l,a,v,S,b),ss) (Const ("HOL.Let",_) $ e $ (Abs (id,T,body))) =
925 (case assy ya ((E , l@[L,R], a,v,S,b),ss) e of
926 NasApp ((E',l,a,v,S,bb),ss) =>
928 val id' = mk_Free (id, T);
929 val E' = upd_env E' (id', v);
930 in assy ya ((E', l@[R,D], a,v,S,b),ss) body end
933 val id' = mk_Free (id, T);
934 val E' = upd_env E (id', v);
935 in assy ya ((E', l@[R,D], a,v,S,b),ss) body end
938 | assy (ya as (thy,ctxt,srls,_,_)) ((E,l,_,v,S,b),ss) (Const ("Script.While",_) $ c $ e $ a) =
939 (if eval_true_ thy srls (subst_atomic (upd_env E (a,v)) c)
940 then assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e
942 | assy (ya as (thy,ctxt,srls,_,_)) ((E,l,a,v,S,b),ss) (Const ("Script.While",_) $ c $ e) =
943 (if eval_true_ thy srls (subst_atomic (upd_env_opt E (a,v)) c)
944 then assy ya ((E, l@[R], a,v,S,b),ss) e
947 | assy (ya as (thy,ctxt,srls,_,_)) ((E,l,a,v,S,b),ss) (Const ("If",_) $ c $ e1 $ e2) =
948 (if eval_true_ thy srls (subst_atomic (upd_env_opt E (a,v)) c)
949 then assy ya ((E, l@[L,R], a,v,S,b),ss) e1
950 else assy ya ((E, l@[ R], a,v,S,b),ss) e2)
952 | assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Try",_) $ e $ a) =
953 (case assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e of
955 | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Try",_) $ e) =
956 (case assy ya ((E, l@[R], a,v,S,b),ss) e of
959 | assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Seq",_) $e1 $ e2 $ a) =
960 (case assy ya ((E, l@[L,L,R], SOME a,v,S,b),ss) e1 of
961 NasNap (v, E) => assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e2
962 | NasApp ((E,_,_,v,_,_),ss) => assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e2
964 | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Seq",_) $e1 $ e2) =
965 (case assy ya ((E, l@[L,R], a,v,S,b),ss) e1 of
966 NasNap (v, E) => assy ya ((E, l@[R], a,v,S,b),ss) e2
967 | NasApp ((E,_,_,v,_,_),ss) => assy ya ((E, l@[R], a,v,S,b),ss) e2
970 | assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Repeat",_) $ e $ a) =
971 assy ya ((E,(l@[L,R]),SOME a,v,S,b),ss) e
972 | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Repeat",_) $ e) =
973 assy ya ((E,(l@[R]),a,v,S,b),ss) e
975 | assy (y,x,s,sc,Aundef) ((E,l,_,v,S,b),ss) (Const ("Script.Or",_) $e1 $ e2 $ a) =
976 (case assy (y,x,s,sc,AssOnly) ((E,(l@[L,L,R]),SOME a,v,S,b),ss) e1 of
978 (case assy (y,x,s,sc,AssOnly) ((E,(l@[L,R]),SOME a,v,S,b),ss) e2 of
980 (case assy (y,x,s,sc,AssGen) ((E,(l@[L,L,R]),SOME a,v,S,b),ss) e1 of
982 assy (y,x,s,sc,AssGen) ((E, (l@[L,R]), SOME a,v,S,b),ss) e2
985 | NasApp _ => error ("assy: FIXXXME ///must not return NasApp///")
987 | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Or",_) $e1 $ e2) =
988 (case assy ya ((E,(l@[L,R]),a,v,S,b),ss) e1 of
989 NasNap (v, E) => assy ya ((E,(l@[R]),a,v,S,b),ss) e2
992 (*here is not a tactical like TRY etc, but a tactic creating a step in calculation*)
993 | assy (thy',ctxt,sr,d,ap) (is as (E,l,a,v,S,b), (m,_,pt,(p,p_),c)::ss) t =
994 (case handle_leaf "locate" thy' sr E a v t of
996 (NasNap (eval_listexpr_ (assoc_thy thy') sr
997 (subst_atomic (upd_env_opt E (a',v)) t), E))
1003 | _ => error ("assy: call by " ^ pos'2str (p,p_));
1005 case assod pt d m stac of
1007 let val (p'',c',f',pt') =
1008 generate1 (assoc_thy thy') m (ScrState (E,l,a',v',S,true), ctxt) (p',p_) pt;
1009 in Assoc ((E,l,a',v',S,true), (m,f',pt',p'',c @ c')::ss) end
1011 let val (p'',c',f',pt') =
1012 generate1 (assoc_thy thy') m (ScrState (E,l,a',v',S,false), ctxt) (p',p_) pt;
1013 in Assoc ((E,l,a',v',S,false), (m,f',pt',p'',c @ c')::ss) end
1015 (case ap of (*switch for Or: 1st AssOnly, 2nd AssGen*)
1016 AssOnly => (NasNap (v, E))
1018 (case applicable_in (p,p_) pt (stac2tac pt (assoc_thy thy') stac) of
1021 val is = (E,l,a',tac_2res m',S,false(*FIXXXME.WN0?*))
1022 val (p'',c',f',pt') =
1023 generate1 (assoc_thy thy') m' (ScrState is, ctxt) (p',p_) pt;
1024 in NasApp (is,(m,f',pt',p'',c @ c')::ss) end
1025 | Notappl _ => (NasNap (v, E))
1030 fun ass_up (ys as (y,ctxt,s,Script sc,d)) (is as (E,l,a,v,S,b),ss) (Const ("HOL.Let",_) $ _) =
1032 (*val _= tracing("### ass_up1 Let$e: is=")
1033 val _= tracing(istate2str (ScrState is))*)
1034 val l = drop_last l; (*comes from e, goes to Abs*)
1035 val (Const ("HOL.Let",_) $ e $ (Abs (i,T,body))) = go l sc;
1036 val i = mk_Free (i, T);
1037 val E = upd_env E (i, v);
1038 (*val _=tracing("### ass_up2 Let$e: E="^(subst2str E));*)
1039 in case assy (y,ctxt,s,d,Aundef) ((E, l@[R,D], a,v,S,b),ss) body of
1040 Assoc iss => Assoc iss
1041 | NasApp iss => astep_up ys iss
1042 | NasNap (v, E) => astep_up ys ((E,l,a,v,S,b),ss) end
1044 | ass_up ys (iss as (is,_)) (Abs (_,_,_)) =
1045 ((*tracing("### ass_up Abs: is=");
1046 tracing(istate2str (ScrState is));*)
1047 astep_up ys iss) (*TODO 5.9.00: env ?*)
1049 | ass_up ys (iss as (is,_)) (Const ("HOL.Let",_) $ e $ (Abs (i,T,b)))=
1050 ((*tracing("### ass_up Let $ e $ Abs: is=");
1051 tracing(istate2str (ScrState is));*)
1052 astep_up ys iss) (*TODO 5.9.00: env ?*)
1054 | ass_up ysa iss (Const ("Script.Seq",_) $ _ $ _ $ _) =
1055 astep_up ysa iss (*all has been done in (*2*) below*)
1057 | ass_up ysa iss (Const ("Script.Seq",_) $ _ $ _) =
1058 astep_up ysa iss (*2*: comes from e2*)
1060 | ass_up (ysa as (y,ctxt,s,Script sc,d)) (is as (E,l,a,v,S,b),ss)
1061 (Const ("Script.Seq",_) $ _ ) = (*2*: comes from e1, goes to e2*)
1063 val up = drop_last l;
1064 val Const ("Script.Seq",_) $ _ $ e2 = go up sc
1065 (*val _= tracing("### ass_up Seq$e: is=")
1066 val _= tracing(istate2str (ScrState is))*)
1068 case assy (y,ctxt,s,d,Aundef) ((E, up@[R], a,v,S,b),ss) e2 of
1069 NasNap (v,E) => astep_up ysa ((E,up,a,v,S,b),ss)
1070 | NasApp iss => astep_up ysa iss
1073 | ass_up ysa iss (Const ("Script.Try",_) $ e $ _) =
1076 (* val (ysa, iss, (Const ("Script.Try",_) $ e)) =
1077 (ys, ((E,up,a,v,S,b),ss), (go up sc));
1079 | ass_up ysa iss (Const ("Script.Try",_) $ e) =
1080 ((*tracing("### ass_up Try $ e");*)
1083 | ass_up (ys as (y,ctxt,s,_,d)) ((E,l,_,v,S,b),ss)
1084 (*(Const ("Script.While",_) $ c $ e $ a) = WN050930 blind fix*)
1085 (t as Const ("Script.While",_) $ c $ e $ a) =
1086 ((*tracing("### ass_up: While c= "^
1087 (term2str (subst_atomic (upd_env E (a,v)) c)));*)
1088 if eval_true_ y s (subst_atomic (upd_env E (a,v)) c)
1089 then (case assy (y,ctxt,s,d,Aundef) ((E, l@[L,R], SOME a,v,S,b),ss) e of
1090 NasNap (v,E') => astep_up ys ((E',l, SOME a,v,S,b),ss)
1091 | NasApp ((E',l,a,v,S,b),ss) =>
1092 ass_up ys ((E',l,a,v,S,b),ss) t (*WN050930 't' was not assigned*)
1094 else astep_up ys ((E,l, SOME a,v,S,b),ss)
1097 | ass_up (ys as (y,ctxt,s,_,d)) ((E,l,a,v,S,b),ss)
1098 (*(Const ("Script.While",_) $ c $ e) = WN050930 blind fix*)
1099 (t as Const ("Script.While",_) $ c $ e) =
1100 if eval_true_ y s (subst_atomic (upd_env_opt E (a,v)) c)
1101 then (case assy (y,ctxt,s,d,Aundef) ((E, l@[R], a,v,S,b),ss) e of
1102 NasNap (v,E') => astep_up ys ((E',l, a,v,S,b),ss)
1103 | NasApp ((E',l,a,v,S,b),ss) =>
1104 ass_up ys ((E',l,a,v,S,b),ss) t (*WN050930 't' was not assigned*)
1106 else astep_up ys ((E,l, a,v,S,b),ss)
1108 | ass_up y iss (Const ("If",_) $ _ $ _ $ _) = astep_up y iss
1110 | ass_up (ys as (y,ctxt,s,_,d)) ((E,l,_,v,S,b),ss)
1111 (t as Const ("Script.Repeat",_) $ e $ a) =
1112 (case assy (y,ctxt,s,d, Aundef) ((E, (l@[L,R]), SOME a,v,S,b),ss) e of
1113 NasNap (v,E') => astep_up ys ((E',l, SOME a,v,S,b),ss)
1114 | NasApp ((E',l,a,v,S,b),ss) =>
1115 ass_up ys ((E',l,a,v,S,b),ss) t
1118 | ass_up (ys as (y,ctxt,s,_,d)) (is as ((E,l,a,v,S,b),ss))
1119 (t as Const ("Script.Repeat",_) $ e) =
1120 (case assy (y,ctxt,s,d,Aundef) ((E, (l@[R]), a,v,S,b),ss) e of
1121 NasNap (v', E') => astep_up ys ((E',l,a,v',S,b),ss)
1122 | NasApp ((E',l,a,v',S,bb),ss) =>
1123 ass_up ys ((E',l,a,v',S,b),ss) t
1126 | ass_up y iss (Const ("Script.Or",_) $ _ $ _ $ _) = astep_up y iss
1128 | ass_up y iss (Const ("Script.Or",_) $ _ $ _) = astep_up y iss
1130 | ass_up y ((E,l,a,v,S,b),ss) (Const ("Script.Or",_) $ _ ) =
1131 astep_up y ((E, (drop_last l), a,v,S,b),ss)
1134 error ("ass_up not impl for t= "^(term2str t))
1136 val (ys as (_,_,Script sc,_), ss) =
1137 ((thy',srls,scr,d), [(m,EmptyMout,pt,p,[])]:step list);
1138 astep_up ys ((E,l,a,v,S,b),ss);
1139 val ((ys as (_,_,Script sc,_)), ((E,l,a,v,S,b),ss)) =
1141 val ((ys as (_,_,Script sc,_)), ((E,l,a,v,S,b),ss)) =
1142 ((thy',srls,scr,d), ((E,l,a,v,S,b), [(m,EmptyMout,pt,p,[])]));
1144 and astep_up (ys as (_,_,_,Script sc,_)) ((E,l,a,v,S,b),ss) =
1147 let val up = drop_last l;
1148 (*val _= tracing("### astep_up: E= "^env2str E);*)
1149 in ass_up ys ((E,up,a,v,S,b),ss) (go up sc) end
1150 else (NasNap (v, E))
1157 (* use"ME/script.sml";
1159 term2str (go up sc);
1163 (*check if there are tacs for rewriting only*)
1164 fun rew_only ([]:step list) = true
1165 | rew_only (((Rewrite' _ ,_,_,_,_))::ss) = rew_only ss
1166 | rew_only (((Rewrite_Inst' _ ,_,_,_,_))::ss) = rew_only ss
1167 | rew_only (((Rewrite_Set' _ ,_,_,_,_))::ss) = rew_only ss
1168 | rew_only (((Rewrite_Set_Inst' _ ,_,_,_,_))::ss) = rew_only ss
1169 | rew_only (((Calculate' _ ,_,_,_,_))::ss) = rew_only ss
1170 | rew_only (((Begin_Trans' _ ,_,_,_,_))::ss) = rew_only ss
1171 | rew_only (((End_Trans' _ ,_,_,_,_))::ss) = rew_only ss
1172 | rew_only _ = false;
1176 Steps of istate (*producing hd of step list (which was latest)
1177 for next_tac, for reporting Safe|Unsafe to DG*)
1178 * step (*(scrstate producing this step is in ptree !)*)
1179 list (*locate_gen may produce intermediate steps*)
1180 | NotLocatable; (*no (m Ass m') or (m AssWeak m') found*)
1184 (* locate_gen tries to locate an input tac m in the script.
1185 pursuing this goal the script is executed until an (m' equiv m) is found,
1186 or the end of the script
1188 m : input by the user, already checked by applicable_in,
1189 (to be searched within Or; and _not_ an m doing the step on ptree !)
1190 p,pt: (incl ets) at the time of input
1192 d : canonical simplifier for locating Take, Substitute, Subproblems etc.
1193 ets : ets at the time of input
1194 l : the location (in scr) of the stac which generated the current formula
1196 Steps: pt,p (incl. ets) with m done
1197 pos' list of proofobjs cut (from generate)
1198 safe: implied from last proofobj
1200 ///ToDo : ets contains a list of tacs to be done before m can be done
1201 NOT IMPL. -- "error: do other step before"
1202 NotLocatable: thus generate_hard
1204 fun locate_gen (thy',g_) (Rewrite'(_,ro,er,pa,(id,str),f,_)) (pt,p)
1205 (Rfuns {locate_rule=lo,...}, d) (RrlsState (_,f'',rss,rts), ctxt) =
1206 (case lo rss f (Thm (id, mk_thm (assoc_thy thy') str)) of
1209 Steps (rts2steps [] ((pt,p),(f,f'',rss,rts),(thy',ro,er,pa)) rts'))
1211 | locate_gen (thy',srls) (m:tac_) ((pt,p):ptree * pos')
1212 (scr as Script (h $ body),d) (ScrState (E,l,a,v,S,b), ctxt) =
1213 let val thy = assoc_thy thy';
1215 case if l = [] orelse ((*init.in solve..Apply_Method...*)
1216 (last_elem o fst) p = 0 andalso snd p = Res)
1217 then (assy (thy',ctxt,srls,d,Aundef) ((E,[R],a,v,S,b), [(m,EmptyMout,pt,p,[])]) body)
1218 else (astep_up (thy',ctxt,srls,scr,d) ((E,l,a,v,S,b), [(m,EmptyMout,pt,p,[])]) ) of
1219 Assoc (iss as (is as (_,_,_,_,_,strong_ass), ss as ((m',f',pt',p',c')::_))) =>
1222 (Steps (ScrState is, ss))
1224 if rew_only ss (*andalso 'not strong_ass'= associated weakly*)
1228 val po' = case p_ of Frm => po | Res => lev_on po
1229 val (p'',c'',f'',pt'') =
1230 generate1 thy m (ScrState is, ctxt) (po',p_) pt;
1231 in Steps (ScrState is, [(m, f'',pt'',p'',c'')]) end
1232 else Steps (ScrState is, ss))
1234 | NasApp _ => NotLocatable
1235 | err => error ("not-found-in-script: NotLocatable from " ^ PolyML.makestring err) end
1237 | locate_gen _ m _ (sc,_) (is, _) =
1238 error ("locate_gen: wrong arguments,\n tac= " ^ tac_2str m ^ ",\n " ^
1239 "scr= " ^ scr2str sc ^ ",\n istate= " ^ istate2str is);
1241 (** find the next stactic in a script **)
1243 datatype appy = (*ExprVal in the sense of denotational semantics*)
1244 Appy of (*applicable stac found, search stalled*)
1245 tac_ * (*tac_ associated (fun assod) with stac*)
1246 scrstate (*after determination of stac WN.18.8.03*)
1247 | Napp of (*stac found was not applicable;
1248 this mode may become Skip in Repeat, Try and Or*)
1249 env (*stack*) (*popped while nxt_up*)
1250 | Skip of (*for restart after Appy, for leaving iterations,
1251 for passing the value of scriptexpressions,
1252 and for finishing the script successfully*)
1253 term * env (*stack*);
1255 (*appy, nxt_up, nstep_up scanning for next_tac.
1256 search is clearly separated into (1)-(2):
1257 (1) appy is recursive descent;
1258 (2) nxt_up resumes interpretation at a location somewhere in the script;
1259 nstep_up does only get to the parentnode of the scriptexpr.
1261 * call of (2) means _always_ that in this branch below
1262 there was an applicable stac (Repeat, Or e1, ...)
1266 datatype appy_ = (*as argument in nxt_up, nstep_up, from appy*)
1267 (* Appy is only (final) returnvalue, not argument during search *)
1268 Napp_ (*ev. detects 'script is not appropriate for this example'*)
1269 | Skip_; (*detects 'script successfully finished'
1270 also used as init-value for resuming; this works,
1271 because 'nxt_up Or e1' treats as Appy*)
1273 fun appy thy ptp E l (t as Const ("HOL.Let",_) $ e $ (Abs (i,T,b))) a v =
1274 (case appy thy ptp E (l@[L,R]) e a v of
1276 let val E' = upd_env E (Free (i,T), res);
1277 in appy thy ptp E' (l@[R,D]) b a v end
1280 | appy (thy as (th,sr)) ptp E l (t as Const ("Script.While"(*1*),_) $ c $ e $ a) _ v =
1281 (if eval_true_ th sr (subst_atomic (upd_env E (a,v)) c)
1282 then appy thy ptp E (l@[L,R]) e (SOME a) v
1285 | appy (thy as (th,sr)) ptp E l (t as Const ("Script.While"(*2*),_) $ c $ e) a v =
1286 (if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)
1287 then appy thy ptp E (l@[R]) e a v
1290 | appy (thy as (th,sr)) ptp E l (t as Const ("If",_) $ c $ e1 $ e2) a v =
1291 (if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)
1292 then ((*tracing("### appy If: true");*)appy thy ptp E (l@[L,R]) e1 a v)
1293 else ((*tracing("### appy If: false");*)appy thy ptp E (l@[ R]) e2 a v))
1295 | appy thy ptp E l (Const ("Script.Repeat"(*1*),_) $ e $ a) _ v =
1296 (appy thy ptp E (l@[L,R]) e (SOME a) v)
1298 | appy thy ptp E l (Const ("Script.Repeat"(*2*),_) $ e) a v =
1299 (appy thy ptp E (l@[R]) e a v)
1301 | appy thy ptp E l (t as Const ("Script.Try",_) $ e $ a) _ v =
1302 (case appy thy ptp E (l@[L,R]) e (SOME a) v of
1303 Napp E => (Skip (v, E))
1306 | appy thy ptp E l(t as Const ("Script.Try",_) $ e) a v =
1307 (case appy thy ptp E (l@[R]) e a v of
1308 Napp E => (Skip (v, E))
1311 | appy thy ptp E l (Const ("Script.Or"(*1*),_) $e1 $ e2 $ a) _ v =
1312 (case appy thy ptp E (l@[L,L,R]) e1 (SOME a) v of
1313 Appy lme => Appy lme
1314 | _ => appy thy ptp E (*env*) (l@[L,R]) e2 (SOME a) v)
1316 | appy thy ptp E l (Const ("Script.Or"(*2*),_) $e1 $ e2) a v =
1317 (case appy thy ptp E (l@[L,R]) e1 a v of
1318 Appy lme => Appy lme
1319 | _ => appy thy ptp E (l@[R]) e2 a v)
1321 | appy thy ptp E l (Const ("Script.Seq"(*1*),_) $ e1 $ e2 $ a) _ v =
1322 (case appy thy ptp E (l@[L,L,R]) e1 (SOME a) v of
1323 Skip (v,E) => appy thy ptp E (l@[L,R]) e2 (SOME a) v
1326 | appy thy ptp E l (Const ("Script.Seq",_) $ e1 $ e2) a v =
1327 (case appy thy ptp E (l@[L,R]) e1 a v of
1328 Skip (v,E) => appy thy ptp E (l@[R]) e2 a v
1331 (* a leaf has been found *)
1332 | appy (thy as (th,sr)) (pt, p) E l t a v =
1333 (case handle_leaf "next " th sr E a v t of
1334 (a', Expr s) => Skip (s, E)
1335 | (a', STac stac) =>
1336 let val (m,m') = stac2tac_ pt (assoc_thy th) stac
1339 Subproblem _ => Appy (m', (E,l,a',tac_2res m',Sundef,false))
1341 (case applicable_in p pt m of
1342 Appl m' => (Appy (m', (E,l,a',tac_2res m',Sundef,false)))
1343 | _ => ((*tracing("### appy: Napp");*)Napp E))
1346 fun nxt_up thy ptp (scr as (Script sc)) E l ay
1347 (t as Const ("HOL.Let",_) $ _) a v = (*comes from let=...*)
1349 then nstep_up thy ptp scr E (drop_last l) Napp_ a v
1352 val up = drop_last l;
1353 val (Const ("HOL.Let",_) $ e $ (Abs (i,T,body))) = go up sc;
1354 val i = mk_Free (i, T);
1355 val E = upd_env E (i, v);
1357 case appy thy ptp E (up@[R,D]) body a v of
1358 Appy lre => Appy lre
1359 | Napp E => nstep_up thy ptp scr E up Napp_ a v
1360 | Skip (v,E) => nstep_up thy ptp scr E up Skip_ a v end)
1362 | nxt_up thy ptp scr E l ay
1363 (t as Abs (_,_,_)) a v =
1364 ((*tracing("### nxt_up Abs: " ^ term2str t);*)
1365 nstep_up thy ptp scr E l ay a v)
1367 | nxt_up thy ptp scr E l ay
1368 (t as Const ("HOL.Let",_) $ e $ (Abs (i,T,b))) a v =
1369 ((*tracing("### nxt_up Let$e$Abs: is=");
1370 tracing(istate2str (ScrState (E,l,a,v,Sundef,false)));*)
1371 (*tracing("### nxt_up Let e Abs: " ^ term2str t);*)
1372 nstep_up thy ptp scr E l ay a v)
1374 (*no appy_: never causes Napp -> Helpless*)
1375 | nxt_up (thy as (th,sr)) ptp scr E l _
1376 (Const ("Script.While"(*1*),_) $ c $ e $ _) a v =
1377 if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)
1378 then case appy thy ptp E (l@[L,R]) e a v of
1380 | Napp E => nstep_up thy ptp scr E l Skip_ a v
1381 | Skip (v,E) => nstep_up thy ptp scr E l Skip_ a v
1382 else nstep_up thy ptp scr E l Skip_ a v
1384 (*no appy_: never causes Napp - Helpless*)
1385 | nxt_up (thy as (th,sr)) ptp scr E l _
1386 (Const ("Script.While"(*2*),_) $ c $ e) a v =
1387 if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)
1388 then case appy thy ptp E (l@[R]) e a v of
1390 | Napp E => nstep_up thy ptp scr E l Skip_ a v
1391 | Skip (v,E) => nstep_up thy ptp scr E l Skip_ a v
1392 else nstep_up thy ptp scr E l Skip_ a v
1394 (* val (scr, l) = (Script sc, up);
1396 | nxt_up thy ptp scr E l ay (Const ("If",_) $ _ $ _ $ _) a v =
1397 nstep_up thy ptp scr E l ay a v
1399 | nxt_up thy ptp scr E l _ (*no appy_: there was already a stac below*)
1400 (Const ("Script.Repeat"(*1*),T) $ e $ _) a v =
1401 (case appy thy ptp (*upd_env*) E (*a,v)*) ((l@[L,R]):loc_) e a v of
1403 | Napp E => ((*tracing("### nxt_up Repeat a: ");*)
1404 nstep_up thy ptp scr E l Skip_ a v)
1405 | Skip (v,E) => ((*tracing("### nxt_up Repeat: Skip res ="^
1406 (Sign.string_of_term(sign_of (assoc_thy thy)) res'));*)
1407 nstep_up thy ptp scr E l Skip_ a v))
1409 | nxt_up thy ptp scr E l _ (*no appy_: there was already a stac below*)
1410 (Const ("Script.Repeat"(*2*),T) $ e) a v =
1411 (case appy thy ptp (*upd_env*) E (*a,v)*) ((l@[R]):loc_) e a v of
1413 | Napp E => ((*tracing("### nxt_up Repeat a: ");*)
1414 nstep_up thy ptp scr E l Skip_ a v)
1415 | Skip (v,E) => ((*tracing("### nxt_up Repeat: Skip res ="^
1416 (Sign.string_of_term(sign_of (assoc_thy thy)) res'));*)
1417 nstep_up thy ptp scr E l Skip_ a v))
1418 (* val (thy, ptp, scr, E, l, _,(t as Const ("Script.Try",_) $ e $ _), a, v) =
1419 (thy, ptp, (Script sc),
1420 E, up, ay,(go up sc), a, v);
1422 | nxt_up thy ptp scr E l _ (*makes Napp to Skip*)
1423 (t as Const ("Script.Try",_) $ e $ _) a v =
1424 ((*tracing("### nxt_up Try " ^ term2str t);*)
1425 nstep_up thy ptp scr E l Skip_ a v )
1426 (* val (thy, ptp, scr, E, l, _,(t as Const ("Script.Try",_) $ e), a, v) =
1427 (thy, ptp, (Script sc),
1428 E, up, ay,(go up sc), a, v);
1430 | nxt_up thy ptp scr E l _ (*makes Napp to Skip*)
1431 (t as Const ("Script.Try"(*2*),_) $ e) a v =
1432 ((*tracing("### nxt_up Try " ^ term2str t);*)
1433 nstep_up thy ptp scr E l Skip_ a v)
1436 | nxt_up thy ptp scr E l ay
1437 (Const ("Script.Or",_) $ _ $ _ $ _) a v = nstep_up thy ptp scr E l ay a v
1439 | nxt_up thy ptp scr E l ay
1440 (Const ("Script.Or",_) $ _ $ _) a v = nstep_up thy ptp scr E l ay a v
1442 | nxt_up thy ptp scr E l ay
1443 (Const ("Script.Or",_) $ _ ) a v =
1444 nstep_up thy ptp scr E (drop_last l) ay a v
1445 (* val (thy, ptp, scr, E, l, ay, (Const ("Script.Seq",_) $ _ $ _ $ _), a, v) =
1446 (thy, ptp, (Script sc),
1447 E, up, ay,(go up sc), a, v);
1449 | nxt_up thy ptp scr E l ay (*all has been done in (*2*) below*)
1450 (Const ("Script.Seq"(*1*),_) $ _ $ _ $ _) a v =
1451 nstep_up thy ptp scr E l ay a v
1452 (* val (thy, ptp, scr, E, l, ay, (Const ("Script.Seq",_) $ _ $ e2), a, v) =
1453 (thy, ptp, (Script sc),
1454 E, up, ay,(go up sc), a, v);
1456 | nxt_up thy ptp scr E l ay (*comes from e2*)
1457 (Const ("Script.Seq"(*2*),_) $ _ $ e2) a v =
1458 nstep_up thy ptp scr E l ay a v
1459 (* val (thy, ptp, scr, E, l, ay, (Const ("Script.Seq",_) $ _), a, v) =
1460 (thy, ptp, (Script sc),
1461 E, up, ay,(go up sc), a, v);
1463 | nxt_up thy ptp (scr as Script sc) E l ay (*comes from e1*)
1464 (Const ("Script.Seq",_) $ _) a v =
1466 then nstep_up thy ptp scr E (drop_last l) Napp_ a v
1468 let val up = drop_last l;
1469 val Const ("Script.Seq"(*2*),_) $ _ $ e2 = go up sc;
1470 in case appy thy ptp E (up@[R]) e2 a v of
1472 | Napp E => nstep_up thy ptp scr E up Napp_ a v
1473 | Skip (v,E) => nstep_up thy ptp scr E up Skip_ a v end
1475 | nxt_up (thy,_) ptp scr E l ay t a v = error ("nxt_up not impl for " ^ term2str t)
1477 and nstep_up thy ptp (Script sc) E l ay a v =
1480 let val up = drop_last l;
1481 in (nxt_up thy ptp (Script sc) E up ay (go up sc) a v ) end
1482 else (*interpreted to end*)
1483 if ay = Skip_ then Skip (v, E) else Napp E
1486 (* decide for the next applicable stac in the script;
1487 returns (stactic, value) - the value in case the script is finished
1488 12.8.02: ~~~~~ and no assumptions ??? FIXME ???
1489 20.8.02: must return p in case of finished, because the next script
1490 consulted need not be the calling script:
1491 in case of detail ie. _inserted_ PrfObjs, the next stac
1492 has to searched in a script with PblObj.status<>Complete !
1493 (.. not true for other details ..PrfObj ??????????????????
1494 20.8.02: do NOT return safe (is only changed in locate !!!)
1496 fun next_tac (thy,_) (pt,p) (Rfuns {next_rule,...}) (RrlsState(f,f',rss,_), ctxt) =
1498 then (End_Detail' (f',[])(*8.6.03*), (Uistate, ctxt),
1499 (f', Sundef(*FIXME is no value of next_tac! vor 8.6.03*))) (*finished*)
1501 (case next_rule rss f of
1502 NONE => (Empty_Tac_, (Uistate, ctxt), (e_term, Sundef)) (*helpless*)
1503 | SOME (Thm (id,thm))(*8.6.03: muss auch f' liefern ?!!*) =>
1504 (Rewrite' (thy, "e_rew_ord", e_rls,(*!?!8.6.03*) false,
1505 (id, string_of_thmI thm), f,(e_term,[(*!?!8.6.03*)])),
1506 (Uistate, ctxt), (e_term, Sundef))) (*next stac*)
1508 | next_tac thy (ptp as (pt, pos as (p, _)):ptree * pos') (sc as Script (h $ body))
1509 (ScrState (E,l,a,v,s,b), ctxt) =
1510 (case if l = [] then appy thy ptp E [R] body NONE v
1511 else nstep_up thy ptp sc E l Skip_ a v of
1512 Skip (v, _) => (*finished*)
1513 (case par_pbl_det pt p of
1516 val (_,pblID,_) = get_obj g_spec pt p';
1517 in (Check_Postcond' (pblID, (v, [(*assigned in next step*)])),
1518 (e_istate, ctxt), (v,s))
1520 | (_, p', rls') => (End_Detail' (e_term,[])(*8.6.03*), (e_istate, ctxt), (v,s)))
1521 | Napp _ => (Empty_Tac_, (e_istate, ctxt), (e_term, Sundef)) (*helpless*)
1522 | Appy (m', scrst as (_,_,_,v,_,_)) => (m', (ScrState scrst, ctxt), (v, Sundef))) (*next stac*)
1524 | next_tac _ _ _ (is, _) = error ("next_tac: not impl for " ^ (istate2str is));
1527 (*.create the initial interpreter state from the items of the guard.*)
1528 fun init_scrstate thy itms metID =
1530 val actuals = itms2args thy metID itms
1531 val scr as Script sc = (#scr o get_met) metID
1532 val formals = formal_args sc
1533 (*expects same sequence of (actual) args in itms and (formal) args in met*)
1534 fun relate_args env [] [] = env
1535 | relate_args env _ [] =
1536 error ("ERROR in creating the environment for '" ^
1537 id_of_scr sc ^ "' from \nthe items of the guard of " ^
1538 metID2str metID ^ ",\n" ^
1539 "formal arg(s), from the script, miss actual arg(s), from the guards env:\n" ^
1540 (string_of_int o length) formals ^
1541 " formals: " ^ terms2str formals ^ "\n" ^
1542 (string_of_int o length) actuals ^
1543 " actuals: " ^ terms2str actuals)
1544 | relate_args env [] actual_finds = env (*may drop Find!*)
1545 | relate_args env (a::aa) (f::ff) =
1546 if type_of a = type_of f
1547 then relate_args (env @ [(a, f)]) aa ff
1549 error ("ERROR in creating the environment for '" ^
1550 id_of_scr sc ^ "' from \nthe items of the guard of " ^
1551 metID2str metID ^ ",\n" ^
1552 "different types of formal arg, from the script, " ^
1553 "and actual arg, from the guards env:'\n" ^
1554 "formal: '" ^ term2str a ^ "::" ^ (type2str o type_of) a ^ "'\n" ^
1555 "actual: '" ^ term2str f ^ "::" ^ (type2str o type_of) f ^ "'\n" ^
1557 "formals: " ^ terms2str formals ^ "\n" ^
1558 "actuals: " ^ terms2str actuals)
1559 val env = relate_args [] formals actuals;
1560 val ctxt = ProofContext.init_global thy |> declare_constraints' actuals
1561 val {pre, prls, ...} = get_met metID;
1562 val pres = check_preconds thy prls pre itms |> map snd;
1563 val ctxt = ctxt |> insert_assumptions pres;
1564 in (ScrState (env,[],NONE,e_term,Safe,true), ctxt, scr):istate * Proof.context * scr end;
1566 (* decide, where to get script/istate from:
1567 (*1*) from PblObj.env: at begin of script if no init_form
1568 (*2*) from PblObj/PrfObj: if stac is in the middle of the script
1569 (*3*) from rls/PrfObj: in case of detail a ruleset *)
1570 fun from_pblobj_or_detail' thy' (p,p_) pt =
1571 let val ctxt = get_ctxt pt (p,p_)
1573 if member op = [Pbl,Met] p_
1574 then case get_obj g_env pt p of
1575 NONE => error "from_pblobj_or_detail': no istate"
1578 val metID = get_obj g_metID pt p
1579 val {srls,...} = get_met metID
1580 in (srls, is, (#scr o get_met) metID) end
1582 let val (pbl,p',rls') = par_pbl_det pt p
1586 val thy = assoc_thy thy'
1587 val PblObj{meth=itms,...} = get_obj I pt p'
1588 val metID = get_obj g_metID pt p'
1589 val {srls,...} = get_met metID
1590 in (*if last_elem p = 0 nothing written to pt yet*)
1591 (srls, get_loc pt (p,p_), (#scr o get_met) metID)
1594 (e_rls, (*FIXME.WN0?: get from pbl or met !!! unused for Rrls in locate_gen, next_tac*)
1597 Rls {scr=scr,...} => scr
1598 | Seq {scr=scr,...} => scr
1599 | Rrls {scr=rfuns,...} => rfuns)
1603 (*.get script and istate from PblObj, see (*1*) above.*)
1604 fun from_pblobj' thy' (p,p_) pt =
1606 val p' = par_pblobj pt p
1607 val thy = assoc_thy thy'
1608 val PblObj {meth=itms, ...} = get_obj I pt p'
1609 val metID = get_obj g_metID pt p'
1610 val {srls,scr,...} = get_met metID
1612 if last_elem p = 0 (*nothing written to pt yet*)
1614 let val (is, ctxt, scr) = init_scrstate thy itms metID
1615 in (srls, (is, ctxt), scr) end
1616 else (srls, get_loc pt (p,p_), scr)
1619 (*.get the stactics and problems of a script as tacs
1620 instantiated with the current environment;
1621 l is the location which generated the given formula.*)
1622 (*WN.12.5.03: quick-and-dirty repair for listexpressions*)
1623 fun is_spec_pos Pbl = true
1624 | is_spec_pos Met = true
1625 | is_spec_pos _ = false;
1627 (*. fetch _all_ tactics from script .*)
1628 fun sel_rules _ (([],Res):pos') =
1629 raise PTREE "no tactics applicable at the end of a calculation"
1630 | sel_rules pt (p,p_) =
1632 then [get_obj g_tac pt p]
1634 let val pp = par_pblobj pt p;
1635 val thy' = (get_obj g_domID pt pp):theory';
1636 val thy = assoc_thy thy';
1637 val metID = get_obj g_metID pt pp;
1638 val metID' =if metID =e_metID then(thd3 o snd3)(get_obj g_origin pt pp)
1640 val {scr=Script sc,srls,...} = get_met metID'
1641 val ScrState (env,_,a,v,_,_) = get_istate pt (p,p_);
1642 in map ((stac2tac pt thy) o rep_stacexpr o #2 o
1643 (handle_leaf "selrul" thy' srls env a v)) (stacpbls sc) end;
1645 > val Script sc = (#scr o get_met) ("SqRoot","sqrt-equ-test");
1646 > val env = [((term_of o the o (parse (Thy_Info.get_theory "Isac"))) "bdv",
1647 (term_of o the o (parse (Thy_Info.get_theory "Isac"))) "x")];
1648 > map ((stac2tac pt thy) o #2 o(subst_stacexpr env NONE e_term)) (stacpbls sc);
1652 (*. fetch tactics from script and filter _applicable_ tactics;
1653 in case of Rewrite_Set* go down to _atomic_ rewrite-tactics .*)
1654 fun sel_appl_atomic_tacs _ (([],Res):pos') =
1655 raise PTREE "no tactics applicable at the end of a calculation"
1656 | sel_appl_atomic_tacs pt (p,p_) =
1658 then [get_obj g_tac pt p]
1660 let val pp = par_pblobj pt p
1661 val thy' = (get_obj g_domID pt pp):theory'
1662 val thy = assoc_thy thy'
1663 val metID = get_obj g_metID pt pp
1664 val metID' =if metID = e_metID
1665 then (thd3 o snd3) (get_obj g_origin pt pp)
1667 val {scr=Script sc,srls,erls,rew_ord'=ro,...} = get_met metID'
1668 val ScrState (env,_,a,v,_,_) = get_istate pt (p,p_)
1669 val alltacs = (*we expect at least 1 stac in a script*)
1670 map ((stac2tac pt thy) o rep_stacexpr o #2 o
1671 (handle_leaf "selrul" thy' srls env a v)) (stacpbls sc)
1673 Frm => get_obj g_form pt p
1674 | Res => (fst o (get_obj g_result pt)) p
1675 (*WN071231 ? replace atomic_appl_tacs with applicable_in (ineff!) ?*)
1676 in (distinct o flat o
1677 (map (atomic_appl_tacs thy ro erls f))) alltacs end;
1685 (* use"ME/script.sml";