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 LUCAS_INTERPRETER =
11 type step = Ctree.tac_ * Generate.mout * Ctree.ctree * Ctree.pos' * Ctree.pos' list
12 datatype locate = NotLocatable | Steps of Ctree.istate * step list
14 val next_tac : (*diss: next-tactic-function*)
15 theory' * rls -> Ctree.ctree * Ctree.pos' -> scr -> Ctree.istate * 'a -> Ctree.tac_ * (Ctree.istate * 'a) * (term * Ctree.safe)
16 val locate_gen : (*diss: locate-function*)
17 theory' * rls -> Ctree.tac_ -> Ctree.ctree * Ctree.pos' -> scr * 'a -> Ctree.istate * Proof.context -> locate
19 (* can these functions be local to Lucin or part of LItools ? *)
20 val sel_rules : Ctree.ctree -> Ctree.pos' -> Ctree.tac list
21 val init_form : 'a -> scr -> (term * term) list -> term option
22 val tac_2tac : Ctree.tac_ -> Ctree.tac
23 val init_scrstate : theory -> itm list -> metID -> Ctree.istate * Proof.context * scr
24 val from_pblobj' : theory' -> Ctree.pos' -> Ctree.ctree -> rls * (Ctree.istate * Proof.context) * scr
25 val from_pblobj_or_detail' : theory' -> Ctree.pos' -> Ctree.ctree ->
26 rls * (Ctree.istate * Proof.context) * scr
27 val rule2thm'' : rule -> thm''
28 val rule2rls' : rule -> string
30 (*/-------------------------------------------------------- ! aktivate for Test_Isac BEGIN ---\* )
31 datatype asap = Aundef | AssOnly | AssGen
32 datatype appy = Appy of Ctree.tac_ * Ctree.scrstate | Napp of env | Skip of term * env
33 datatype appy_ = Napp_ | Skip_
34 val appy : theory' * rls -> Ctree.ctree * Ctree.pos' -> env -> lrd list -> term -> term option -> term -> appy
35 val formal_args : term -> term list
36 val get_stac : 'a -> term -> term option
37 val go : loc_ -> term -> term
38 val handle_leaf : string -> theory' -> rls -> env -> term option -> term -> term ->
39 term option * stacexpr
40 val id_of_scr : term -> string
41 val is_spec_pos : Ctree.pos_ -> bool
42 val itms2args : 'a -> metID -> itm list -> term list
43 val nstep_up : theory' * rls -> Ctree.ctree * Ctree.pos' -> scr -> env -> lrd list -> appy_ ->
44 term option -> term -> appy
45 val sel_appl_atomic_tacs : Ctree.ctree -> Ctree.pos' -> Ctree.tac list
46 val stac2tac : Ctree.ctree -> theory -> term -> Ctree.tac
47 val stac2tac_ : Ctree.ctree -> theory -> term -> Ctree.tac * Ctree.tac_
48 val upd_env_opt : env -> term option * term -> env
49 ( *\--- ! aktivate for Test_Isac END ----------------------------------------------------------/*)
52 (* traces the leaves (ie. non-tactical nodes) of Prog found by next_tac, see "and scr" *)
53 val trace_script = Unsynchronized.ref false; (* TODO: how are traces done in Isabelle? *)
56 structure Lucin(**): LUCAS_INTERPRETER(**) =
61 (* data for creating a new node in ctree; designed for use as:
62 fun ass* scrstate steps = / ... case ass* scrstate steps of /
63 Assoc (scrstate, steps) => ... ass* scrstate steps *)
65 tac_ (*transformed from associated tac *)
66 * Generate.mout (*result with indentation etc. *)
67 * ctree (*containing node created by tac_ + resp. scrstate *)
68 * pos' (*position in ctree; ctree * pos' is the proofstate *)
69 * pos' list; (*of ctree-nodes probably cut (by fst tac_) *)
71 fun rule2thm'' (Thm (id, thm)) = (id, thm) : thm''
72 | rule2thm'' r = error ("rule2thm': not defined for " ^ rule2str r);
73 fun rule2rls' (Rls_ rls) = id_rls rls
74 | rule2rls' r = error ("rule2rls': not defined for " ^ rule2str r);
76 (*.makes a (rule,term) list to a Step (m, mout, pt', p', cid) for solve;
77 complicated with current t in rrlsstate.*)
78 fun rts2steps steps ((pt, p), (f, f'', rss, rts), (thy', ro, er, pa)) [(r, (f', am))] =
80 val thy = assoc_thy thy'
81 val ctxt = get_ctxt pt p |> insert_assumptions am
82 val m = Rewrite' (thy', ro, er, pa, rule2thm'' r, f, (f', am))
83 val is = RrlsState (f', f'', rss, rts)
84 val p = case p of (_, Frm) => p | (p', Res) => (lev_on p', Res) | _ => error "rts2steps: p1"
85 val (p', cid, mout, pt') = Generate.generate1 thy m (is, ctxt) p pt
86 in (is, (m, mout, pt', p', cid) :: steps) end
87 | rts2steps steps ((pt, p) ,(f, f'', rss, rts), (thy', ro, er, pa)) ((r, (f', am)) :: rts') =
89 val thy = assoc_thy thy'
90 val ctxt = get_ctxt pt p |> insert_assumptions am
91 val m = Rewrite' (thy', ro, er, pa, rule2thm'' r, f, (f', am))
92 val is = RrlsState (f', f'', rss, rts)
93 val p = case p of (_, Frm) => p | (p', Res) => (lev_on p', Res) | _ => error "rts2steps: p1"
94 val (p', cid, mout, pt') = Generate.generate1 thy m (is, ctxt) p pt
95 in rts2steps ((m, mout, pt', p', cid)::steps)
96 ((pt', p'), (f', f'', rss, rts), (thy', ro, er, pa)) rts'
98 | rts2steps _ _ _ = error "rts2steps: uncovered fun-def"
100 (* functions for the environment stack: NOT YET IMPLEMENTED
101 fun accessenv id es = the (assoc ((top es) : env, id))
102 handle _ => error ("accessenv: " ^ free2str id ^ " not in env");
103 fun updateenv id vl (es : env stack) =
104 (push (overwrite(top es, (id, vl))) (pop es)) : env stack;
105 fun pushenv id vl (es : env stack) =
106 (push (overwrite(top es, (id, vl))) es) : env stack;
107 val popenv = pop : env stack -> env stack;
110 fun de_esc_underscore str =
113 | scan (s :: ss) = if s = "'" then (scan ss) else (s :: (scan ss))
114 in (implode o scan o Symbol.explode) str end;
116 (*go at a location in a script and fetch the contents*)
118 | go (D::p) (Abs(_, _, t0)) = go (p : loc_) t0
119 | go (L::p) (t1 $ _) = go p t1
120 | go (R::p) (_ $ t2) = go p t2
121 | go l _ = error ("go: no " ^ loc_2str l);
123 (*.get argument of first stactic in a script for init_form.*)
124 fun get_stac thy (_ $ body) =
126 fun get_t y (Const ("Script.Seq",_) $ e1 $ e2) a =
127 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
128 | get_t y (Const ("Script.Seq",_) $ e1 $ e2 $ a) _ =
129 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
130 | get_t y (Const ("Script.Try",_) $ e) a = get_t y e a
131 | get_t y (Const ("Script.Try",_) $ e $ a) _ = get_t y e a
132 | get_t y (Const ("Script.Repeat",_) $ e) a = get_t y e a
133 | get_t y (Const ("Script.Repeat",_) $ e $ a) _ = get_t y e a
134 | get_t y (Const ("Script.Or",_) $e1 $ e2) a =
135 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
136 | get_t y (Const ("Script.Or",_) $e1 $ e2 $ a) _ =
137 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
138 | get_t y (Const ("Script.While",_) $ _ $ e) a = get_t y e a
139 | get_t y (Const ("Script.While",_) $ _ $ e $ a) _ = get_t y e a
140 | get_t y (Const ("Script.Letpar",_) $ e1 $ Abs (_, _, e2)) a =
141 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
142 (*| get_t y (Const ("HOL.Let",_) $ e1 $ Abs (_,_,e2)) a =
143 (case get_t y e1 a of NONE => get_t y e2 a | la => la)
144 | get_t y (Abs (_,_,e)) a = get_t y e a*)
145 | get_t y (Const ("HOL.Let",_) $ e1 $ Abs (_, _, _)) a =
146 get_t y e1 a (*don't go deeper without evaluation !*)
147 | get_t _ (Const ("If", _) $ _ $ _ $ _) _ = NONE
148 (*(case get_t y e1 a of NONE => get_t y e2 a | la => la)*)
150 | get_t _ (Const ("Script.Rewrite",_) $ _ $ _ $ a) _ = SOME a
151 | get_t _ (Const ("Script.Rewrite",_) $ _ $ _ ) a = SOME a
152 | get_t _ (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ $ a) _ = SOME a
153 | get_t _ (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ ) a = SOME a
154 | get_t _ (Const ("Script.Rewrite'_Set",_) $ _ $ _ $ a) _ = SOME a
155 | get_t _ (Const ("Script.Rewrite'_Set",_) $ _ $ _ ) a = SOME a
156 | get_t _ (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ $a)_ =SOME a
157 | get_t _ (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ ) a =SOME a
158 | get_t _ (Const ("Script.Calculate",_) $ _ $ a) _ = SOME a
159 | get_t _ (Const ("Script.Calculate",_) $ _ ) a = SOME a
161 | get_t _ (Const ("Script.Substitute",_) $ _ $ a) _ = SOME a
162 | get_t _ (Const ("Script.Substitute",_) $ _ ) a = SOME a
164 | get_t _ (Const ("Script.SubProblem",_) $ _ $ _) _ = NONE
166 | get_t _ _ _ = ((*tracing ("### get_t yac: list-expr "^(term2str x));*) NONE)
167 in get_t thy body e_term end
168 | get_stac _ t = error ("get_stac: no fun-def. for " ^ term2str t);
170 fun init_form thy (Prog sc) env =
171 (case get_stac thy sc of NONE => NONE | SOME stac => SOME (subst_atomic env stac))
172 | init_form _ _ _ = error "init_form: no match";
174 (* get the arguments of the script out of the scripts parsetree *)
175 fun formal_args scr = (fst o split_last o snd o strip_comb) scr;
177 (* get the identifier of the script out of the scripts parsetree *)
178 fun id_of_scr sc = (id_of o fst o strip_comb) sc;
180 (*WN020526: not clear, when a is available in ass_up for eval_true*)
181 (*WN060906: in "fun handle_leaf" eg. uses "SOME M__"(from some PREVIOUS
182 curried Rewrite) for CURRENT value (which may be different from PREVIOUS);
183 thus "NONE" must be set at the end of currying (ill designed anyway)*)
184 fun upd_env_opt env (SOME a, v) = upd_env env (a, v)
185 | upd_env_opt env (NONE, _) =
186 ((*tracing ("*** upd_env_opt: (NONE," ^ term2str v ^ ")");*) env);
188 type dsc = typ; (* <-> nam..unknow in Descript.thy *)
190 (*.create the actual parameters (args) of script: their order
191 is given by the order in met.pat .*)
192 (*WN.5.5.03: ?: does this allow for different descriptions ???
193 ?: why not taken from formal args of script ???
194 !: FIXXXME penv: push it here in itms2args into script-evaluation*)
195 (* val (thy, mI, itms) = (thy, metID, itms);
197 val errmsg = "ERROR: the guard is missing (#ppc in 'type met' added in prep_met)."
198 fun itms2args _ mI (itms : itm list) =
200 val mvat = max_vt itms
201 fun okv mvat (_, vats, b, _, _) = member op = vats mvat andalso b
202 val itms = filter (okv mvat) itms
203 fun test_dsc d (_, _, _, _, itm_) = (d = d_in itm_)
204 fun itm2arg itms (_,(d,_)) =
205 case find_first (test_dsc d) itms of
206 NONE => error ("itms2args: '" ^ term2str d ^ "' not in itms")
207 | SOME (_, _, _, _, itm_) => penvval_in itm_
208 (*| SOME (_,_,_,_,itm_) => mk_arg thy (d_in itm_) (ts_in itm_);
209 penv postponed; presently penv holds already env for script*)
210 val pats = (#ppc o Specify.get_met) mI
211 val _ = if pats = [] then raise ERROR errmsg else ()
212 in (flat o (map (itm2arg itms))) pats end;
214 (* convert a script-tac 'stac' to a tactic 'tac';
215 if stac is an initac, then convert to a 'tac_' (as required in appy).
216 arg ctree for pushing the thy specified in rootpbl into subpbls *)
217 fun stac2tac_ _ thy (Const ("Script.Rewrite", _) $ Free (thmID, _) $ _ $ _) =
219 val tid = (de_esc_underscore o strip_thy) thmID
220 in (Rewrite (tid, assoc_thm'' thy tid), Empty_Tac_) end
221 | stac2tac_ _ thy (Const ("Script.Rewrite'_Inst", _) $ sub $ Free (thmID, _) $ _ $ _) =
223 val subML = ((map isapair2pair) o isalist2list) sub
224 val subStr = subst2subs subML
225 val tid = (de_esc_underscore o strip_thy) thmID (*4.10.02 unnoetig*)
226 in (Rewrite_Inst (subStr, (tid, assoc_thm'' thy tid)), Empty_Tac_) end
227 | stac2tac_ _ _ (Const ("Script.Rewrite'_Set",_) $ Free (rls, _) $ _ $ _) =
228 (Rewrite_Set ((de_esc_underscore o strip_thy) rls), Empty_Tac_)
229 | stac2tac_ _ _ (Const ("Script.Rewrite'_Set'_Inst", _) $ sub $ Free (rls, _) $ _ $ _) =
231 val subML = ((map isapair2pair) o isalist2list) sub;
232 val subStr = subst2subs subML;
233 in (Rewrite_Set_Inst (subStr, rls), Empty_Tac_) end
234 | stac2tac_ _ _ (Const ("Script.Calculate", _) $ Free (op_, _) $ _) = (Calculate op_, Empty_Tac_)
235 | stac2tac_ _ _ (Const ("Script.Take", _) $ t) = (Take (term2str t), Empty_Tac_)
236 | stac2tac_ _ _ (Const ("Script.Substitute", _) $ isasub $ _) =
237 (Substitute ((subte2sube o isalist2list) isasub), Empty_Tac_)
238 | stac2tac_ _ thy (Const("Script.Check'_elementwise", _) $ _ $
239 (Const ("Set.Collect", _) $ Abs (_, _, pred))) =
240 (Check_elementwise (term_to_string''' thy pred), Empty_Tac_)
241 | stac2tac_ _ _ (Const("Script.Or'_to'_List", _) $ _ ) = (Or_to_List, Empty_Tac_)
242 | stac2tac_ _ _ (Const ("Script.Tac", _) $ Free (str, _)) =
243 (Tac ((de_esc_underscore o strip_thy) str), Empty_Tac_)
245 (*compare "| assod _ (Subproblem'"*)
246 | stac2tac_ pt _ (stac as Const ("Script.SubProblem",_) $
247 (Const ("Product_Type.Pair",_) $Free (dI', _) $ (Const ("Product_Type.Pair", _) $ pI' $ mI')) $
250 val dI = ((implode o drop_last(*.."'"*) o Symbol.explode) dI')(*^""*);
251 val thy = maxthy (assoc_thy dI) (rootthy pt);
252 val pI = ((map (de_esc_underscore o free2str)) o isalist2list) pI';
253 val mI = ((map (de_esc_underscore o free2str)) o isalist2list) mI';
254 val ags = isalist2list ags';
259 val pors = (Chead.match_ags thy ((#ppc o Specify.get_pbt) pI) ags)
260 handle ERROR "actual args do not match formal args"
261 => (Chead.match_ags_msg pI stac ags(*raise exn*); [])
262 val pI' = Specify.refine_ori' pors pI;
263 in (pI', pors (* refinement over models with diff.prec only *),
264 (hd o #met o Specify.get_pbt) pI') end
265 else (pI, (Chead.match_ags thy ((#ppc o Specify.get_pbt) pI) ags)
266 handle ERROR "actual args do not match formal args"
267 => (Chead.match_ags_msg pI stac ags(*raise exn*); []), mI);
268 val (fmz_, vals) = Chead.oris2fmz_vals pors;
269 val {cas,ppc,thy,...} = Specify.get_pbt pI
270 val dI = theory2theory' thy (*.take dI from _refined_ pbl.*)
271 val dI = theory2theory' (maxthy (assoc_thy dI) (rootthy pt));
272 val ctxt = dI |> Thy_Info.get_theory |> Proof_Context.init_global |> declare_constraints' vals
275 NONE => pblterm dI pI
276 | SOME t => subst_atomic ((Chead.vars_of_pbl_' ppc) ~~~ vals) t
277 val f = subpbl (strip_thy dI) pI
278 in (Subproblem (dI, pI), Subproblem' ((dI, pI, mI), pors, hdl, fmz_, ctxt, f))
280 | stac2tac_ _ thy t = error ("stac2tac_ TODO: no match for " ^ term_to_string''' thy t);
282 fun stac2tac pt thy t = (fst o stac2tac_ pt thy) t;
286 tac_ * (* SubProblem gets args instantiated in assod *)
287 term (* for itr_arg, result in ets *)
290 term (*for itr_arg,result in ets*)
293 (* check if tac_ is associated with stac.
294 Additional task: check if term t (the result has been calculated from) in tac_
295 has been changed (see "datatype tac_"); if yes, recalculate result
296 TODO.WN120106 recalculate impl.only for Substitute'
298 pt : ctree for pushing the thy specified in rootpbl into subpbls
299 d : unused (planned for data for comparison)
300 tac_ : from user (via applicable_in); to be compared with ...
301 stac : found in Script
303 Ass : associated: e.g. thmID in stac = thmID in m
304 +++ arg in stac = arg in m
305 AssWeak: weakly ass.:e.g. thmID in stac = thmID in m, //arg//
306 NotAss : e.g. thmID in stac/=/thmID in m (not =)
308 fun assod _ _ (m as Rewrite_Inst' (_, _, _, _, _, thm'' as (thmID, _), f, (f', _))) stac =
310 (Const ("Script.Rewrite'_Inst", _) $ _ $ Free (thmID_, _) $ _ $ f_) =>
314 then ((*tracing"3### assod ..Ass";*) Ass (m,f'))
315 else ((*tracing"3### assod ..AssWeak";*) AssWeak(m, f'))
316 else ((*tracing"3### assod ..NotAss";*) NotAss)
317 | (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ Free (rls_, _) $ _ $ f_) =>
318 if Rtools.contains_rule (Thm thm'') (assoc_rls rls_)
319 then if f = f_ then Ass (m,f') else AssWeak (m,f')
322 | assod _ _ (m as Rewrite' (_, _, _, _, thm'' as (thmID, _), f, (f', _))) stac =
324 (Const ("Script.Rewrite", _) $ Free (thmID_, _) $ _ $ f_) =>
325 ((*tracing ("3### assod: stac = " ^ ter2str t);
326 tracing ("3### assod: f(m)= " ^ term2str f);*)
330 then ((*tracing"3### assod ..Ass";*) Ass (m,f'))
332 ((*tracing"### assod ..AssWeak";
333 tracing("### assod: f(m) = " ^ term2str f);
334 tracing("### assod: f(stac)= " ^ term2str f_)*)
336 else ((*tracing"3### assod ..NotAss";*) NotAss))
337 | (Const ("Script.Rewrite'_Set", _) $ Free (rls_, _) $ _ $ f_) =>
338 if Rtools.contains_rule (Thm thm'') (assoc_rls rls_)
339 then if f = f_ then Ass (m, f') else AssWeak (m, f')
342 | assod _ _ (m as Rewrite_Set_Inst' (_, _, _, rls, f, (f', _)))
343 (Const ("Script.Rewrite'_Set'_Inst", _) $ _ $ Free (rls_, _) $ _ $ f_) =
345 then if f = f_ then Ass (m, f') else AssWeak (m ,f')
347 | assod _ _ (m as Detail_Set_Inst' (_, _, _, rls, f, (f',_)))
348 (Const ("Script.Rewrite'_Set'_Inst", _) $ _ $ Free (rls_, _) $ _ $ f_) =
350 then if f = f_ then Ass (m, f') else AssWeak (m, f')
352 | assod _ _ (m as Rewrite_Set' (_, _, rls, f, (f', _)))
353 (Const ("Script.Rewrite'_Set", _) $ Free (rls_, _) $ _ $ f_) =
355 then if f = f_ then Ass (m, f') else AssWeak (m, f')
357 | assod _ _ (m as Detail_Set' (_, _, rls, f, (f', _)))
358 (Const ("Script.Rewrite'_Set", _) $ Free (rls_, _) $ _ $ f_) =
360 then if f = f_ then Ass (m, f') else AssWeak (m, f')
362 | assod _ _ (m as Calculate' (_, op_, f, (f', _))) stac =
364 (Const ("Script.Calculate",_) $ Free (op__,_) $ f_) =>
366 then if f = f_ then Ass (m, f') else AssWeak (m, f')
368 | (Const ("Script.Rewrite'_Set'_Inst", _) $ _ $ Free(rls_,_) $_$f_) =>
369 let val thy = assoc_thy "Isac";
371 if Rtools.contains_rule (Calc (assoc_calc' thy op_ |> snd)) (assoc_rls rls_)
372 then if f = f_ then Ass (m, f') else AssWeak (m, f')
375 | (Const ("Script.Rewrite'_Set",_) $ Free (rls_, _) $ _ $ f_) =>
376 let val thy = assoc_thy "Isac";
378 if Rtools.contains_rule (Calc (assoc_calc' thy op_ |> snd)) (assoc_rls rls_)
379 then if f = f_ then Ass (m,f') else AssWeak (m,f')
383 | assod _ _ (m as Check_elementwise' (consts, _, (consts_chkd, _)))
384 (Const ("Script.Check'_elementwise",_) $ consts' $ _) =
386 then Ass (m, consts_chkd)
388 | assod _ _ (m as Or_to_List' (_, list)) (Const ("Script.Or'_to'_List", _) $ _) = Ass (m, list)
389 | assod _ _ (m as Take' term) (Const ("Script.Take", _) $ _) = Ass (m, term)
390 | assod _ _ (m as Substitute' (ro, erls, subte, f, f')) (Const ("Script.Substitute", _) $ _ $ t) =
391 if f = t then Ass (m, f')
392 else (*compare | applicable_in (p,p_) pt (m as Substitute sube)*)
393 if foldl and_ (true, map contains_Var subte)
395 let val t' = subst_atomic (map HOLogic.dest_eq subte (*TODO subte2subst*)) t
396 in if t = t' then error "assod: Substitute' not applicable to val of Expr"
397 else Ass (Substitute' (ro, erls, subte, t, t'), t')
399 else (case rewrite_terms_ (Isac()) ro erls subte t of
400 SOME (t', _) => Ass (Substitute' (ro, erls, subte, t, t'), t')
401 | NONE => error "assod: Substitute' not applicable to val of Expr")
402 | assod _ _ (m as Tac_ (thy, _, id, f')) (Const ("Script.Tac",_) $ Free (id', _)) =
404 then Ass (m, ((Thm.term_of o the o (parse thy)) f'))
407 (*compare "| stac2tac_ thy (Const ("Script.SubProblem",_)"*)
408 | assod pt _ (Subproblem' ((domID, pblID, _), _, _, _, _, _))
409 (stac as Const ("Script.SubProblem",_) $ (Const ("Product_Type.Pair",_) $
410 Free (dI',_) $ (Const ("Product_Type.Pair",_) $ pI' $ mI')) $ ags') =
412 val dI = ((implode o drop_last(*.."'"*) o Symbol.explode) dI')(*^""*);
413 val thy = maxthy (assoc_thy dI) (rootthy pt);
414 val pI = ((map (de_esc_underscore o free2str)) o isalist2list) pI';
415 val mI = ((map (de_esc_underscore o free2str)) o isalist2list) mI';
416 val ags = isalist2list ags';
421 val pors = (Chead.match_ags thy ((#ppc o Specify.get_pbt) pI) ags)
422 handle ERROR "actual args do not match formal args"
423 => (Chead.match_ags_msg pI stac ags(*raise exn*);[]);
424 val pI' = Specify.refine_ori' pors pI;
425 in (pI', pors (*refinement over models with diff.prec only*), (hd o #met o Specify.get_pbt) pI')
427 else (pI, (Chead.match_ags thy ((#ppc o Specify.get_pbt) pI) ags)
428 handle ERROR "actual args do not match formal args"
429 => (Chead.match_ags_msg pI stac ags(*raise exn*); []), mI);
430 val (fmz_, vals) = Chead.oris2fmz_vals pors;
431 val {cas, ppc, thy, ...} = Specify.get_pbt pI
432 val dI = theory2theory' thy (*take dI from _refined_ pbl*)
433 val dI = theory2theory' (maxthy (assoc_thy dI) (rootthy pt))
434 val ctxt = dI |> Thy_Info.get_theory |> Proof_Context.init_global |> declare_constraints' vals
437 NONE => pblterm dI pI
438 | SOME t => subst_atomic ((Chead.vars_of_pbl_' ppc) ~~~ vals) t
439 val f = subpbl (strip_thy dI) pI
441 if domID = dI andalso pblID = pI
442 then Ass (Subproblem' ((dI, pI, mI), pors, hdl, fmz_, ctxt, f), f)
447 then tracing("@@@ the 'tac_' proposed to apply does NOT match the leaf found in the script:\n"
448 ^ "@@@ tac_ = " ^ tac_2str m)
452 fun tac_2tac (Refine_Tacitly' (pI, _, _, _, _)) = Refine_Tacitly pI
453 | tac_2tac (Model_Problem' (_, _, _)) = Model_Problem
454 | tac_2tac (Add_Given' (t, _)) = Add_Given t
455 | tac_2tac (Add_Find' (t, _)) = Add_Find t
456 | tac_2tac (Add_Relation' (t, _)) = Add_Relation t
458 | tac_2tac (Specify_Theory' dI) = Specify_Theory dI
459 | tac_2tac (Specify_Problem' (dI, _)) = Specify_Problem dI
460 | tac_2tac (Specify_Method' (dI, _, _)) = Specify_Method dI
462 | tac_2tac (Rewrite' (_, _, _, _, thm, _, _)) = Rewrite thm
463 | tac_2tac (Rewrite_Inst' (_, _, _, _, sub, thm, _, _)) = Rewrite_Inst (subst2subs sub, thm)
465 | tac_2tac (Rewrite_Set' (_, _, rls, _, _)) = Rewrite_Set (id_rls rls)
466 | tac_2tac (Detail_Set' (_, _, rls, _, _)) = Detail_Set (id_rls rls)
468 | tac_2tac (Rewrite_Set_Inst' (_, _, sub, rls, _, _)) =
469 Rewrite_Set_Inst (subst2subs sub,id_rls rls)
470 | tac_2tac (Detail_Set_Inst' (_, _, sub, rls, _, _)) =
471 Detail_Set_Inst (subst2subs sub,id_rls rls)
473 | tac_2tac (Calculate' (_, op_, _, _)) = Calculate (op_)
474 | tac_2tac (Check_elementwise' (_, pred, _)) = Check_elementwise pred
476 | tac_2tac (Or_to_List' _) = Or_to_List
477 | tac_2tac (Take' term) = Take (term2str term)
478 | tac_2tac (Substitute' (_, _, subte, _, _)) = Substitute (subte2sube subte)
479 | tac_2tac (Tac_ (_, _, id, _)) = Tac id
481 | tac_2tac (Subproblem' ((domID, pblID, _), _, _, _,_ ,_)) = Subproblem (domID, pblID)
482 | tac_2tac (Check_Postcond' (pblID, _)) = Check_Postcond pblID
483 | tac_2tac Empty_Tac_ = Empty_Tac
484 | tac_2tac m = error ("tac_2tac: not impl. for "^(tac_2str m));
486 val idT = Type ("Script.ID", []);
488 fun make_rule thy t =
489 let val ct = Thm.global_cterm_of thy (Trueprop $ t)
490 in Thm (term_to_string''' thy (Thm.term_of ct), Thm.make_thm ct) end;
492 fun rep_tac_ (Rewrite_Inst' (thy', _, _, put, subs, (thmID, _), f, (f', _))) =
493 let val fT = type_of f;
494 val b = if put then @{term True} else @{term False};
495 val sT = (type_of o fst o hd) subs;
496 val subs' = list2isalist (HOLogic.mk_prodT (sT, sT)) (map HOLogic.mk_prod subs);
497 val sT' = type_of subs';
498 val lhs = Const ("Script.Rewrite'_Inst", [sT', idT, bool, fT] ---> fT)
499 $ subs' $ Free (thmID, idT) $ b $ f;
500 in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs, f'), (lhs, f')) end
501 | rep_tac_ (Rewrite' (thy', _, _, put, (thmID, _), f, (f', _)))=
504 val b = if put then @{term True} else @{term False};
505 val lhs = Const ("Script.Rewrite", [idT, HOLogic.boolT, fT] ---> fT)
506 $ Free (thmID, idT) $ b $ f;
507 in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs, f'), (lhs, f')) end
508 | rep_tac_ (Rewrite_Set_Inst' (_, _, _, _, _, (f', _))) = (e_rule, (e_term, f'))
509 | rep_tac_ (Rewrite_Set' (thy', put, rls, f, (f', _))) =
512 val b = if put then @{term True} else @{term False};
513 val lhs = Const ("Script.Rewrite'_Set", [idT, bool, fT] ---> fT)
514 $ Free (id_rls rls, idT) $ b $ f;
515 in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end
516 | rep_tac_ (Calculate' (thy', op_, f, (f', _)))=
519 val lhs = Const ("Script.Calculate",[idT,fT] ---> fT) $ Free (op_,idT) $ f
520 in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end
521 | rep_tac_ (Check_elementwise' (_, _, (t', _))) = (Erule, (e_term, t'))
522 | rep_tac_ (Subproblem' (_, _, _, _, _, t')) = (Erule, (e_term, t'))
523 | rep_tac_ (Take' t') = (Erule, (e_term, t'))
524 | rep_tac_ (Substitute' (_, _, _, t, t')) = (Erule, (t, t'))
525 | rep_tac_ (Or_to_List' (t, t')) = (Erule, (t, t'))
526 | rep_tac_ m = error ("rep_tac_: not impl.for " ^ tac_2str m)
528 fun tac_2res m = (snd o snd o rep_tac_) m;
530 (* handle a leaf at the end of recursive descent:
531 a leaf is either a tactic or an 'expr' in "let v = expr"
532 where "expr" does not contain a tactic.
533 Handling a leaf comprises
534 (1) 'subst_stacexpr' substitute env and complete curried tactic
535 (2) rewrite the leaf by 'srls'
537 fun handle_leaf call thy srls E a v t =
538 (*WN050916 'upd_env_opt' is a blind copy from previous version*)
539 case subst_stacexpr E a v t of
540 (a', STac stac) => (*script-tactic*)
542 eval_listexpr_ (assoc_thy thy) srls (subst_atomic (upd_env_opt E (a,v)) stac)
545 then tracing ("@@@ "^call^" leaf '"^term2str t^"' ---> STac '"^term2str stac ^"'")
549 | (a', Expr lexpr) => (*leaf-expression*)
551 eval_listexpr_ (assoc_thy thy) srls (subst_atomic (upd_env_opt E (a,v)) lexpr)
554 then tracing("@@@ "^call^" leaf '"^term2str t^"' ---> Expr '"^term2str lexpr'^"'")
556 (a', Expr lexpr')) (*lexpr' is the value of the Expr*)
559 (** locate an applicable stac in a script **)
560 datatype assoc = (* ExprVal in the sense of denotational semantics *)
561 Assoc of (* the stac is associated, strongly or weakly *)
562 scrstate * (* the current; returned for next_tac etc. outside ass* *)
563 (step list) (* list of steps done until associated stac found;
564 initiated with the data for doing the 1st step,
565 thus the head holds these data further on,
566 while the tail holds steps finished (incl.scrstate in ctree) *)
567 | NasApp of (* stac not associated, but applicable, ctree-node generated *)
568 scrstate * (step list)
569 | NasNap of (* stac not associated, not applicable, nothing generated;
570 for distinction in Or, for leaving iterations, leaving Seq,
571 evaluate scriptexpressions *)
573 fun assoc2str (Assoc _) = "Assoc"
574 | assoc2str (NasNap _) = "NasNap"
575 | assoc2str (NasApp _) = "NasApp";
577 datatype asap = (* arg. of assy _only_ for distinction w.r.t. Or *)
578 Aundef (* undefined: set only by (topmost) Or *)
579 | AssOnly (* do not execute appl stacs - there could be an associated
580 in parallel Or-branch *)
581 | AssGen; (* no Ass(Weak) found within Or, thus
582 search for _applicable_ stacs, execute and generate pt *)
583 (*this constructions doesnt allow arbitrary nesting of Or !!! *)
585 (* assy, ass_up, astep_up scan for locate_gen in a script.
586 search is clearly separated into (1)-(2):
587 (1) assy is recursive descent;
588 (2) ass_up resumes interpretation at a location somewhere in the script;
589 astep_up does only get to the parentnode of the scriptexpr.
591 * call of (2) means _always_ that in this branch below
592 there was an appl.stac (Repeat, Or e1, ...) found by the previous step.
594 (*WN161112 blanks between list elements left as is until istate is introduced here*)
595 fun assy ya ((E,l,a,v,S,b),ss) (Const ("HOL.Let",_) $ e $ (Abs (id,T,body))) =
596 (case assy ya ((E , l @ [L, R], a,v,S,b),ss) e of
597 NasApp ((E',l,a,v,S,_),ss) =>
599 val id' = mk_Free (id, T);
600 val E' = upd_env E' (id', v);
601 in assy ya ((E', l @ [R, D], a,v,S,b),ss) body end
604 val id' = mk_Free (id, T);
605 val E' = upd_env E (id', v);
606 in assy ya ((E', l @ [R, D], a,v,S,b),ss) body end
608 | assy (ya as (thy,_,srls,_,_)) ((E,l,_,v,S,b),ss) (Const ("Script.While",_) $ c $ e $ a) =
609 if eval_true_ thy srls (subst_atomic (upd_env E (a,v)) c)
610 then assy ya ((E, l @ [L, R], SOME a,v,S,b),ss) e
612 | assy (ya as (thy,_,srls,_,_)) ((E,l,a,v,S,b),ss) (Const ("Script.While",_) $ c $ e) =
613 if eval_true_ thy srls (subst_atomic (upd_env_opt E (a,v)) c)
614 then assy ya ((E, l @ [R], a,v,S,b),ss) e
616 | assy (ya as (thy,_,srls,_,_)) ((E,l,a,v,S,b),ss) (Const ("If",_) $ c $ e1 $ e2) =
617 if eval_true_ thy srls (subst_atomic (upd_env_opt E (a,v)) c)
618 then assy ya ((E, l @ [L, R], a,v,S,b),ss) e1
619 else assy ya ((E, l @ [R], a,v,S,b),ss) e2
620 | assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Try",_) $ e $ a) =
621 (case assy ya ((E, l @ [L, R], SOME a,v,S,b),ss) e of ay => ay)
622 | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Try",_) $ e) =
623 (case assy ya ((E, l @ [R], a,v,S,b),ss) e of ay => ay)
624 | assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Seq",_) $e1 $ e2 $ a) =
625 (case assy ya ((E, l @ [L, L, R], SOME a,v,S,b),ss) e1 of
626 NasNap (v, E) => assy ya ((E, l @ [L, R], SOME a,v,S,b),ss) e2
627 | NasApp ((E,_,_,v,_,_),ss) => assy ya ((E, l @ [L, R], SOME a,v,S,b),ss) e2
629 | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Seq",_) $e1 $ e2) =
630 (case assy ya ((E, l @ [L, R], a,v,S,b),ss) e1 of
631 NasNap (v, E) => assy ya ((E, l @ [R], a,v,S,b),ss) e2
632 | NasApp ((E,_,_,v,_,_),ss) => assy ya ((E, l @ [R], a,v,S,b),ss) e2
634 | assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Repeat",_) $ e $ a) =
635 assy ya ((E,(l @ [L, R]),SOME a,v,S,b),ss) e
636 | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Repeat",_) $ e) =
637 assy ya ((E,(l @ [R]),a,v,S,b),ss) e
638 | assy (y,x,s,sc,Aundef) ((E,l,_,v,S,b),ss) (Const ("Script.Or",_) $e1 $ e2 $ a) =
639 (case assy (y,x,s,sc,AssOnly) ((E,(l @ [L, L, R]),SOME a,v,S,b),ss) e1 of
641 (case assy (y,x,s,sc,AssOnly) ((E,(l @ [L, R]),SOME a,v,S,b),ss) e2 of
643 (case assy (y,x,s,sc,AssGen) ((E,(l @ [L, L, R]),SOME a,v,S,b),ss) e1 of
645 assy (y,x,s,sc,AssGen) ((E, (l @ [L, R]), SOME a,v,S,b),ss) e2
648 | NasApp _ => error ("assy: FIXXXME ///must not return NasApp///")
650 | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Or",_) $e1 $ e2) =
651 (case assy ya ((E,(l @ [L, R]),a,v,S,b),ss) e1 of
652 NasNap (v, E) => assy ya ((E,(l @ [R]),a,v,S,b),ss) e2
654 (*here is not a tactical like TRY etc, but a tactic creating a step in calculation*)
655 | assy (thy',ctxt,sr,d,ap) ((E,l,a,v,S,_), (m,_,pt,(p,p_),c)::ss) t =
656 (case handle_leaf "locate" thy' sr E a v t of
658 (NasNap (eval_listexpr_ (assoc_thy thy') sr
659 (subst_atomic (upd_env_opt E (a',v)) t), E))
665 | _ => error ("assy: call by " ^ pos'2str (p,p_));
667 case assod pt d m stac of
669 let val (p'',c',f',pt') =
670 Generate.generate1 (assoc_thy thy') m (ScrState (E,l,a',v',S,true), ctxt) (p',p_) pt;
671 in Assoc ((E,l,a',v',S,true), (m,f',pt',p'',c @ c')::ss) end
673 let val (p'',c',f',pt') =
674 Generate.generate1 (assoc_thy thy') m (ScrState (E,l,a',v',S,false), ctxt) (p',p_) pt;
675 in Assoc ((E,l,a',v',S,false), (m,f',pt',p'',c @ c')::ss) end
677 (case ap of (*switch for Or: 1st AssOnly, 2nd AssGen*)
678 AssOnly => (NasNap (v, E))
680 (case Applicable.applicable_in (p,p_) pt (stac2tac pt (assoc_thy thy') stac) of
683 val is = (E,l,a',tac_2res m',S,false(*FIXXXME.WN0?*))
684 val (p'',c',f',pt') =
685 Generate.generate1 (assoc_thy thy') m' (ScrState is, ctxt) (p', p_) pt;
686 in NasApp (is,(m,f',pt',p'',c @ c')::ss) end
687 | Chead.Notappl _ => (NasNap (v, E))
691 | assy _ (_, []) t = error ("assy: uncovered fun-def with " ^ term2str t);
693 (*WN161112 blanks between list elements left as is until istate is introduced here*)
694 fun ass_up (ys as (y,ctxt,s,Prog sc,d)) ((E,l,a,v,S,b),ss) (Const ("HOL.Let",_) $ _) =
696 val l = drop_last l; (*comes from e, goes to Abs*)
699 Const ("HOL.Let",_) $ _ $ (Abs (i, T, body)) => (i, T, body)
700 | t => error ("ass_up..HOL.Let $ _ with " ^ term2str t))
701 val i = mk_Free (i, T);
702 val E = upd_env E (i, v);
703 in case assy (y,ctxt,s,d,Aundef) ((E, l @ [R, D], a,v,S,b),ss) body of
704 Assoc iss => Assoc iss
705 | NasApp iss => astep_up ys iss
706 | NasNap (v, E) => astep_up ys ((E,l,a,v,S,b),ss)
708 | ass_up ys iss (Abs (_,_,_)) = astep_up ys iss (*TODO 5.9.00: env ?*)
709 | ass_up ys iss (Const ("HOL.Let",_) $ _ $ (Abs _)) = astep_up ys iss (*TODO 5.9.00: env ?*)
710 | ass_up ysa iss (Const ("Script.Seq",_) $ _ $ _ $ _) =
711 astep_up ysa iss (*all has been done in (*2*) below*)
712 | ass_up ysa iss (Const ("Script.Seq",_) $ _ $ _) =
713 astep_up ysa iss (*2*: comes from e2*)
715 | ass_up (ysa as (y,ctxt,s,Prog sc,d)) ((E,l,a,v,S,b),ss)
716 (Const ("Script.Seq",_) $ _ ) = (*2*: comes from e1, goes to e2*)
718 val up = drop_last l;
721 Const ("Script.Seq",_) $ _ $ e2 => e2
722 | t => error ("ass_up..Script.Seq $ _ with " ^ term2str t))
723 in case assy (y,ctxt,s,d,Aundef) ((E, up @ [R], a,v,S,b),ss) e2 of
724 NasNap (v,E) => astep_up ysa ((E,up,a,v,S,b),ss)
725 | NasApp iss => astep_up ysa iss
728 | ass_up ysa iss (Const ("Script.Try",_) $ _ $ _) = astep_up ysa iss
729 | ass_up ysa iss (Const ("Script.Try",_) $ _) = astep_up ysa iss
730 | ass_up (ys as (y,ctxt,s,_,d)) ((E,l,_,v,S,b),ss)
731 (*(Const ("Script.While",_) $ c $ e $ a) = WN050930 blind fix*)
732 (t as Const ("Script.While",_) $ c $ e $ a) =
733 if eval_true_ y s (subst_atomic (upd_env E (a,v)) c)
734 then case assy (y,ctxt,s,d,Aundef) ((E, l @ [L, R], SOME a,v,S,b),ss) e of
735 NasNap (v,E') => astep_up ys ((E',l, SOME a,v,S,b),ss)
736 | NasApp ((E',l,a,v,S,b),ss) =>
737 ass_up ys ((E',l,a,v,S,b),ss) t (*WN050930 't' was not assigned*)
739 else astep_up ys ((E,l, SOME a,v,S,b),ss)
740 | ass_up (ys as (y,ctxt,s,_,d)) ((E,l,a,v,S,b),ss)
741 (*(Const ("Script.While",_) $ c $ e) = WN050930 blind fix*)
742 (t as Const ("Script.While",_) $ c $ e) =
743 if eval_true_ y s (subst_atomic (upd_env_opt E (a,v)) c)
744 then case assy (y,ctxt,s,d,Aundef) ((E, l @ [R], a,v,S,b),ss) e of
745 NasNap (v,E') => astep_up ys ((E',l, a,v,S,b),ss)
746 | NasApp ((E',l,a,v,S,b),ss) =>
747 ass_up ys ((E',l,a,v,S,b),ss) t (*WN050930 't' was not assigned*)
749 else astep_up ys ((E,l, a,v,S,b),ss)
750 | ass_up y iss (Const ("If",_) $ _ $ _ $ _) = astep_up y iss
751 | ass_up (ys as (y,ctxt,s,_,d)) ((E,l,_,v,S,b),ss)
752 (t as Const ("Script.Repeat",_) $ e $ a) =
753 (case assy (y,ctxt,s,d, Aundef) ((E, (l @ [L, R]), SOME a,v,S,b),ss) e of
754 NasNap (v,E') => astep_up ys ((E',l, SOME a,v,S,b),ss)
755 | NasApp ((E',l,a,v,S,b),ss) =>
756 ass_up ys ((E',l,a,v,S,b),ss) t
758 | ass_up (ys as (y,ctxt,s,_,d)) ((E,l,a,v,S,b),ss)
759 (t as Const ("Script.Repeat",_) $ e) =
760 (case assy (y,ctxt,s,d,Aundef) ((E, (l @ [R]), a,v,S,b),ss) e of
761 NasNap (v', E') => astep_up ys ((E',l,a,v',S,b),ss)
762 | NasApp ((E',l,a,v',S,_),ss) => ass_up ys ((E',l,a,v',S,b),ss) t
764 | ass_up y iss (Const ("Script.Or",_) $ _ $ _ $ _) = astep_up y iss
765 | ass_up y iss (Const ("Script.Or",_) $ _ $ _) = astep_up y iss
766 | ass_up y ((E,l,a,v,S,b),ss) (Const ("Script.Or",_) $ _ ) =
767 astep_up y ((E, (drop_last l), a,v,S,b),ss)
769 error ("ass_up not impl for t= " ^ term2str t)
770 and astep_up (ys as (_,_,_,Prog sc,_)) ((E,l,a,v,S,b),ss) =
773 let val up = drop_last l;
774 in ass_up ys ((E,up,a,v,S,b),ss) (go up sc) end
776 | astep_up _ ((_,l,_,_,_,_),_) = error ("astep_up: uncovered fun-def with " ^ loc_2str l)
778 (*check if there are tacs for rewriting only*)
779 fun rew_only ([]:step list) = true
780 | rew_only (((Rewrite' _ ,_,_,_,_))::ss) = rew_only ss
781 | rew_only (((Rewrite_Inst' _ ,_,_,_,_))::ss) = rew_only ss
782 | rew_only (((Rewrite_Set' _ ,_,_,_,_))::ss) = rew_only ss
783 | rew_only (((Rewrite_Set_Inst' _ ,_,_,_,_))::ss) = rew_only ss
784 | rew_only (((Calculate' _ ,_,_,_,_))::ss) = rew_only ss
785 | rew_only (((Begin_Trans' _ ,_,_,_,_))::ss) = rew_only ss
786 | rew_only (((End_Trans' _ ,_,_,_,_))::ss) = rew_only ss
787 | rew_only _ = false;
790 Steps of istate (* producing hd of step list (which was latest)
791 for next_tac, for reporting Safe|Unsafe to DG *)
792 * step (* (scrstate producing this step is in ctree !) *)
793 list (* locate_gen may produce intermediate steps *)
794 | NotLocatable; (* no (m Ass m') or (m AssWeak m') found *)
796 (* locate_gen tries to locate an input tac m in the script.
797 pursuing this goal the script is executed until an (m' equiv m) is found,
798 or the end of the script
800 m : input by the user, already checked by applicable_in,
801 (to be searched within Or; and _not_ an m doing the step on ctree !)
802 p,pt: (incl ets) at the time of input
804 d : canonical simplifier for locating Take, Substitute, Subproblems etc.
805 ets : ets at the time of input
806 l : the location (in scr) of the stac which generated the current formula
808 Steps: pt,p (incl. ets) with m done
809 pos' list of proofobjs cut (from generate)
810 safe: implied from last proofobj
812 ///ToDo : ets contains a list of tacs to be done before m can be done
813 NOT IMPL. -- "error: do other step before"
814 NotLocatable: thus generate_hard
816 (*WN161112 blanks between list elements left as is until istate is introduced here*)
817 fun locate_gen (thy', _) (Rewrite' (_, ro, er, pa, thm, f, _)) (pt, p)
818 (Rfuns {locate_rule=lo,...}, _) (RrlsState (_,f'',rss,rts), _) =
819 (case lo rss f (Thm thm) of
821 | rts' => Steps (rts2steps [] ((pt,p),(f,f'',rss,rts),(thy',ro,er,pa)) rts'))
822 | locate_gen (thy',srls) (m:tac_) ((pt,p):ctree * pos')
823 (scr as Prog (_ $ body),d) (ScrState (E,l,a,v,S,b), ctxt) =
824 let val thy = assoc_thy thy';
825 in case if l = [] orelse (
826 (*init.in solve..Apply_Method...*)(last_elem o fst) p = 0 andalso snd p = Res)
827 then (assy (thy',ctxt,srls,d,Aundef) ((E,[R],a,v,S,b), [(m,Generate.EmptyMout,pt,p,[])]) body)
828 else (astep_up (thy',ctxt,srls,scr,d) ((E,l,a,v,S,b), [(m,Generate.EmptyMout,pt,p,[])]) ) of
829 Assoc ((is as (_,_,_,_,_,strong_ass), ss as (_ :: _))) =>
831 then (Steps (ScrState is, ss))
833 if rew_only ss (*andalso 'not strong_ass'= associated weakly*)
837 val po' = case p_ of Frm => po | Res => lev_on po | _ => error ("locate_gen " ^ pos_2str p_)
838 val (p'',c'',f'',pt'') = Generate.generate1 thy m (ScrState is, ctxt) (po',p_) pt
839 in Steps (ScrState is, [(m, f'',pt'',p'',c'')]) end
840 else Steps (ScrState is, ss))
842 | NasApp _ => NotLocatable
843 | err => error ("not-found-in-script: NotLocatable from " ^ PolyML.makestring err)
845 | locate_gen _ m _ (sc,_) (is, _) =
846 error ("locate_gen: wrong arguments,\n tac= " ^ tac_2str m ^ ",\n " ^
847 "scr= " ^ scr2str sc ^ ",\n istate= " ^ istate2str is);
849 (** find the next stactic in a script **)
851 (*appy, nxt_up, nstep_up scanning for next_tac.
852 search is clearly separated into (1)-(2):
853 (1) appy is recursive descent;
854 (2) nxt_up resumes interpretation at a location somewhere in the script;
855 nstep_up does only get to the parentnode of the scriptexpr.
857 * call of (2) means _always_ that in this branch below
858 there was an applicable stac (Repeat, Or e1, ...)
860 datatype appy = (* ExprVal in the sense of denotational semantics *)
861 Appy of (* applicable stac found, search stalled *)
862 tac_ * (* tac_ associated (fun assod) with stac *)
863 scrstate (* after determination of stac WN.18.8.03 *)
864 | Napp of (* stac found was not applicable;
865 this mode may become Skip in Repeat, Try and Or *)
866 env (*stack*)(* popped while nxt_up *)
867 | Skip of (* for restart after Appy, for leaving iterations,
868 for passing the value of scriptexpressions,
869 and for finishing the script successfully *)
870 term * env (*stack*);
872 datatype appy_ = (* as argument in nxt_up, nstep_up, from appy *)
873 (*Appy is only (final) returnvalue, not argument during search *)
874 Napp_ (* ev. detects 'script is not appropriate for this example' *)
875 | Skip_; (* detects 'script successfully finished'
876 also used as init-value for resuming; this works,
877 because 'nxt_up Or e1' treats as Appy *)
879 fun appy thy ptp E l (Const ("HOL.Let",_) $ e $ (Abs (i,T,b))) a v =
880 (case appy thy ptp E (l @ [L, R]) e a v of
882 let val E' = upd_env E (Free (i,T), res);
883 in appy thy ptp E' (l @ [R, D]) b a v end
885 | appy (thy as (th,sr)) ptp E l (Const ("Script.While"(*1*),_) $ c $ e $ a) _ v =
886 (if eval_true_ th sr (subst_atomic (upd_env E (a,v)) c)
887 then appy thy ptp E (l @ [L, R]) e (SOME a) v
889 | appy (thy as (th,sr)) ptp E l (Const ("Script.While"(*2*),_) $ c $ e) a v =
890 (if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)
891 then appy thy ptp E (l @ [R]) e a v
893 | appy (thy as (th,sr)) ptp E l (Const ("If",_) $ c $ e1 $ e2) a v =
894 (if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)
895 then appy thy ptp E (l @ [L, R]) e1 a v
896 else appy thy ptp E (l @ [R]) e2 a v)
897 | appy thy ptp E l (Const ("Script.Repeat"(*1*),_) $ e $ a) _ v =
898 appy thy ptp E (l @ [L, R]) e (SOME a) v
899 | appy thy ptp E l (Const ("Script.Repeat"(*2*),_) $ e) a v = appy thy ptp E (l @ [R]) e a v
900 | appy thy ptp E l (Const ("Script.Try",_) $ e $ a) _ v =
901 (case appy thy ptp E (l @ [L, R]) e (SOME a) v of
902 Napp E => (Skip (v, E))
904 | appy thy ptp E l(Const ("Script.Try",_) $ e) a v =
905 (case appy thy ptp E (l @ [R]) e a v of
906 Napp E => (Skip (v, E))
908 | appy thy ptp E l (Const ("Script.Or"(*1*),_) $e1 $ e2 $ a) _ v =
909 (case appy thy ptp E (l @ [L, L, R]) e1 (SOME a) v of
911 | _ => appy thy ptp E (*env*) (l @ [L, R]) e2 (SOME a) v)
912 | appy thy ptp E l (Const ("Script.Or"(*2*),_) $e1 $ e2) a v =
913 (case appy thy ptp E (l @ [L, R]) e1 a v of
915 | _ => appy thy ptp E (l @ [R]) e2 a v)
916 | appy thy ptp E l (Const ("Script.Seq"(*1*),_) $ e1 $ e2 $ a) _ v =
917 (case appy thy ptp E (l @ [L, L, R]) e1 (SOME a) v of
918 Skip (v,E) => appy thy ptp E (l @ [L, R]) e2 (SOME a) v
920 | appy thy ptp E l (Const ("Script.Seq",_) $ e1 $ e2) a v =
921 (case appy thy ptp E (l @ [L,R]) e1 a v of
922 Skip (v,E) => appy thy ptp E (l @ [R]) e2 a v
924 (* a leaf has been found *)
925 | appy ((th,sr)) (pt, p) E l t a v =
926 case handle_leaf "next " th sr E a v t of
927 (_, Expr s) => Skip (s, E)
929 let val (m,m') = stac2tac_ pt (assoc_thy th) stac
931 Subproblem _ => Appy (m', (E,l,a',tac_2res m',Sundef,false))
933 (case Applicable.applicable_in p pt m of
934 Chead.Appl m' => (Appy (m', (E,l,a',tac_2res m',Sundef,false)))
938 fun nxt_up thy ptp (scr as (Prog sc)) E l ay (Const ("HOL.Let", _) $ _) a v = (*comes from let=...*)
940 then nstep_up thy ptp scr E (drop_last l) Napp_ a v
946 Const ("HOL.Let",_) $ _ $ (Abs aa) => aa
947 | t => error ("nxt_up..HOL.Let $ _ with " ^ term2str t))
948 val i = mk_Free (i, T)
949 val E = upd_env E (i, v)
951 case appy thy ptp E (up @ [R,D]) body a v of
953 | Napp E => nstep_up thy ptp scr E up Napp_ a v
954 | Skip (v,E) => nstep_up thy ptp scr E up Skip_ a v
956 | nxt_up thy ptp scr E l ay (Abs _) a v = nstep_up thy ptp scr E l ay a v
957 | nxt_up thy ptp scr E l ay (Const ("HOL.Let",_) $ _ $ (Abs _)) a v =
958 nstep_up thy ptp scr E l ay a v
959 (*no appy_: never causes Napp -> Helpless*)
960 | nxt_up (thy as (th, sr)) ptp scr E l _ (Const ("Script.While"(*1*), _) $ c $ e $ _) a v =
961 if eval_true_ th sr (subst_atomic (upd_env_opt E (a, v)) c)
962 then case appy thy ptp E (l @ [L,R]) e a v of
964 | Napp E => nstep_up thy ptp scr E l Skip_ a v
965 | Skip (v,E) => nstep_up thy ptp scr E l Skip_ a v
966 else nstep_up thy ptp scr E l Skip_ a v
967 (*no appy_: never causes Napp - Helpless*)
968 | nxt_up (thy as (th, sr)) ptp scr E l _ (Const ("Script.While"(*2*), _) $ c $ e) a v =
969 if eval_true_ th sr (subst_atomic (upd_env_opt E (a, v)) c)
970 then case appy thy ptp E (l @ [R]) e a v of
972 | Napp E => nstep_up thy ptp scr E l Skip_ a v
973 | Skip (v,E) => nstep_up thy ptp scr E l Skip_ a v
974 else nstep_up thy ptp scr E l Skip_ a v
975 | nxt_up thy ptp scr E l ay (Const ("If", _) $ _ $ _ $ _) a v = nstep_up thy ptp scr E l ay a v
976 | nxt_up thy ptp scr E l _ (*no appy_: there was already a stac below*)
977 (Const ("Script.Repeat"(*1*), _) $ e $ _) a v =
978 (case appy thy ptp (*upd_env*) E (*a,v)*) ((l @ [L, R]):loc_) e a v of
980 | Napp E => nstep_up thy ptp scr E l Skip_ a v
981 | Skip (v,E) => nstep_up thy ptp scr E l Skip_ a v)
982 | nxt_up thy ptp scr E l _ (*no appy_: there was already a stac below*)
983 (Const ("Script.Repeat"(*2*), _) $ e) a v =
984 (case appy thy ptp (*upd_env*) E (*a,v)*) (l @ [R]) e a v of
986 | Napp E => nstep_up thy ptp scr E l Skip_ a v
987 | Skip (v,E) => nstep_up thy ptp scr E l Skip_ a v)
988 | nxt_up thy ptp scr E l _ (Const ("Script.Try",_) $ _ $ _) a v = (*makes Napp to Skip*)
989 nstep_up thy ptp scr E l Skip_ a v
991 | nxt_up thy ptp scr E l _ (Const ("Script.Try"(*2*), _) $ _) a v = (*makes Napp to Skip*)
992 nstep_up thy ptp scr E l Skip_ a v
993 | nxt_up thy ptp scr E l ay (Const ("Script.Or",_) $ _ $ _ $ _) a v =
994 nstep_up thy ptp scr E l ay a v
995 | nxt_up thy ptp scr E l ay (Const ("Script.Or",_) $ _ $ _) a v = nstep_up thy ptp scr E l ay a v
996 | nxt_up thy ptp scr E l ay (Const ("Script.Or",_) $ _ ) a v =
997 nstep_up thy ptp scr E (drop_last l) ay a v
998 | nxt_up thy ptp scr E l ay (Const ("Script.Seq"(*1*),_) $ _ $ _ $ _) a v =
999 (*all has been done in (*2*) below*) nstep_up thy ptp scr E l ay a v
1000 | nxt_up thy ptp scr E l ay (Const ("Script.Seq"(*2*),_) $ _ $ _) a v = (*comes from e2*)
1001 nstep_up thy ptp scr E l ay a v
1002 | nxt_up thy ptp (scr as Prog sc) E l ay (Const ("Script.Seq",_) $ _) a v = (*comes from e1*)
1004 then nstep_up thy ptp scr E (drop_last l) Napp_ a v
1006 let val up = drop_last l;
1009 Const ("Script.Seq"(*2*), _) $ _ $ e2 => e2
1010 | t => error ("nxt_up..Script.Seq $ _ with " ^ term2str t))
1011 in case appy thy ptp E (up @ [R]) e2 a v of
1013 | Napp E => nstep_up thy ptp scr E up Napp_ a v
1014 | Skip (v,E) => nstep_up thy ptp scr E up Skip_ a v end
1015 | nxt_up _ _ _ _ _ _ t _ _ = error ("nxt_up not impl for " ^ term2str t)
1016 and nstep_up thy ptp (Prog sc) E l ay a v =
1019 let val up = drop_last l;
1020 in (nxt_up thy ptp (Prog sc) E up ay (go up sc) a v ) end
1021 else (*interpreted to end*)
1022 if ay = Skip_ then Skip (v, E) else Napp E
1023 | nstep_up _ _ _ _ l _ _ _ = error ("nstep_up: uncovered fun-def at " ^ loc_2str l)
1025 (* decide for the next applicable stac in the script;
1026 returns (stactic, value) - the value in case the script is finished
1027 12.8.02: ~~~~~ and no assumptions ??? FIXME ???
1028 20.8.02: must return p in case of finished, because the next script
1029 consulted need not be the calling script:
1030 in case of detail ie. _inserted_ PrfObjs, the next stac
1031 has to searched in a script with PblObj.status<>Complete !
1032 (.. not true for other details ..PrfObj ??????????????????
1033 20.8.02: do NOT return safe (is only changed in locate !!!)
1035 fun next_tac (thy,_) _ (Rfuns {next_rule, ...}) (RrlsState(f, f', rss, _), ctxt) =
1037 then (End_Detail' (f',[])(*8.6.03*), (Uistate, ctxt),
1038 (f', Sundef(*FIXME is no value of next_tac! vor 8.6.03*))) (*finished*)
1040 (case next_rule rss f of
1041 NONE => (Empty_Tac_, (Uistate, ctxt), (e_term, Sundef)) (*helpless*)
1042 | SOME (Thm thm'')(*8.6.03: muss auch f' liefern ?!!*) =>
1043 (Rewrite' (thy, "e_rew_ord", e_rls, false, thm'', f, (e_term, [(*!?!8.6.03*)])),
1044 (Uistate, ctxt), (e_term, Sundef))) (*next stac*)
1045 | next_tac thy (ptp as (pt, (p, _)):ctree * pos') (sc as Prog (_ $ body))
1046 (ScrState (E,l,a,v,s,_), ctxt) =
1047 (case if l = [] then appy thy ptp E [R] body NONE v
1048 else nstep_up thy ptp sc E l Skip_ a v of
1049 Skip (v, _) => (*finished*)
1050 (case par_pbl_det pt p of
1053 val (_,pblID,_) = get_obj g_spec pt p';
1054 in (Check_Postcond' (pblID, (v, [(*assigned in next step*)])),
1055 (e_istate, ctxt), (v,s))
1057 | _ => (End_Detail' (e_term,[])(*8.6.03*), (e_istate, ctxt), (v,s)))
1058 | Napp _ => (Empty_Tac_, (e_istate, ctxt), (e_term, Sundef)) (*helpless*)
1059 | Appy (m', scrst as (_,_,_,v,_,_)) => (m', (ScrState scrst, ctxt), (v, Sundef))) (*next stac*)
1060 | next_tac _ _ _ (is, _) = error ("next_tac: not impl for " ^ (istate2str is));
1062 (*.create the initial interpreter state from the items of the guard.*)
1064 val errmsg = "ERROR: found no actual arguments for prog. of "
1065 fun msg_miss (sc, metID, formals, actuals) =
1066 "ERROR in creating the environment for '" ^ id_of_scr sc ^
1067 "' from \nthe items of the guard of " ^ metID2str metID ^ ",\n" ^
1068 "formal arg(s), from the script, miss actual arg(s), from the guards env:\n" ^
1069 (string_of_int o length) formals ^ " formals: " ^ terms2str formals ^ "\n" ^
1070 (string_of_int o length) actuals ^ " actuals: " ^ terms2str actuals
1071 fun msg_type (sc, metID, a, f, formals, actuals) =
1072 "ERROR in creating the environment for '" ^
1073 id_of_scr sc ^ "' from \nthe items of the guard of " ^
1074 metID2str metID ^ ",\n" ^
1075 "different types of formal arg, from the script, " ^
1076 "and actual arg, from the guards env:'\n" ^
1077 "formal: '" ^ term2str a ^ "::" ^ (type2str o type_of) a ^ "'\n" ^
1078 "actual: '" ^ term2str f ^ "::" ^ (type2str o type_of) f ^ "'\n" ^
1080 "formals: " ^ terms2str formals ^ "\n" ^
1081 "actuals: " ^ terms2str actuals
1083 fun init_scrstate thy itms metID =
1085 val actuals = itms2args thy metID itms
1086 val _ = if actuals <> [] then () else raise ERROR (errmsg ^ strs2str' metID)
1087 val (scr, sc) = (case (#scr o Specify.get_met) metID of
1088 scr as Prog sc => (scr, sc) | _ => raise ERROR ("init_scrstate with " ^ metID2str metID))
1089 val formals = formal_args sc
1090 (*expects same sequence of (actual) args in itms and (formal) args in met*)
1091 fun relate_args env [] [] = env
1092 | relate_args _ _ [] = error (msg_miss (sc, metID, formals, actuals))
1093 | relate_args env [] _ = env (*may drop Find!*)
1094 | relate_args env (a::aa) (f::ff) =
1095 if type_of a = type_of f
1096 then relate_args (env @ [(a, f)]) aa ff
1097 else error (msg_type (sc, metID, a, f, formals, actuals))
1098 val env = relate_args [] formals actuals;
1099 val ctxt = Proof_Context.init_global thy |> declare_constraints' actuals
1100 val {pre, prls, ...} = Specify.get_met metID;
1101 val pres = check_preconds thy prls pre itms |> map snd;
1102 val ctxt = ctxt |> insert_assumptions pres;
1103 in (ScrState (env, [], NONE, e_term, Safe, true), ctxt, scr) : istate * Proof.context * scr end;
1106 (* decide, where to get script/istate from:
1107 (* 1 *) from PblObj.env: at begin of script if no init_form
1108 (* 2 *) from PblObj/PrfObj: if stac is in the middle of the script
1109 (* 3 *) from rls/PrfObj: in case of detail a ruleset *)
1110 fun from_pblobj_or_detail' _ (p, p_) pt =
1111 if member op = [Pbl, Met] p_
1112 then case get_obj g_env pt p of
1113 NONE => error "from_pblobj_or_detail': no istate"
1116 val metID = get_obj g_metID pt p
1117 val {srls, ...} = Specify.get_met metID
1118 in (srls, is, (#scr o Specify.get_met) metID) end
1120 let val (pbl, p', rls') = par_pbl_det pt p
1122 then (*if last_elem p = 0 nothing written to pt yet*) (* 2 *)
1124 val metID = get_obj g_metID pt p'
1125 val {srls,...} = Specify.get_met metID
1126 in (srls, get_loc pt (p,p_), (#scr o Specify.get_met) metID) end
1127 else (*FIXME.WN0?: get from pbl or met !!! unused for Rrls in locate_gen, next_tac*) (* 3 *)
1128 (e_rls, get_loc pt (p,p_),
1130 Rls {scr = scr,...} => scr
1131 | Seq {scr = scr,...} => scr
1132 | Rrls {scr=rfuns,...} => rfuns
1133 | Erls => error "from_pblobj_or_detail' with Erls")
1136 (*.get script and istate from PblObj, see ( * 1 *)
1137 fun from_pblobj' thy' (p,p_) pt =
1139 val p' = par_pblobj pt p
1140 val thy = assoc_thy thy'
1142 (case get_obj I pt p' of
1143 PblObj {meth = itms, ...} => itms
1144 | PrfObj _ => error "from_pblobj' NOT with PrfObj")
1145 val metID = get_obj g_metID pt p'
1146 val {srls, scr, ...} = Specify.get_met metID
1148 if last_elem p = 0 (*nothing written to pt yet*)
1150 let val (is, ctxt, scr) = init_scrstate thy itms metID
1151 in (srls, (is, ctxt), scr) end
1152 else (srls, get_loc pt (p,p_), scr)
1155 (*.get the stactics and problems of a script as tacs
1156 instantiated with the current environment;
1157 l is the location which generated the given formula.*)
1158 (*WN.12.5.03: quick-and-dirty repair for listexpressions*)
1159 fun is_spec_pos Pbl = true
1160 | is_spec_pos Met = true
1161 | is_spec_pos _ = false;
1163 (*. fetch _all_ tactics from script .*)
1164 fun sel_rules _ (([],Res):pos') =
1165 raise PTREE "no tactics applicable at the end of a calculation"
1166 | sel_rules pt (p,p_) =
1168 then [get_obj g_tac pt p]
1171 val pp = par_pblobj pt p;
1172 val thy' = (get_obj g_domID pt pp):theory';
1173 val thy = assoc_thy thy';
1174 val metID = get_obj g_metID pt pp;
1175 val metID' = if metID =e_metID then (thd3 o snd3) (get_obj g_origin pt pp) else metID
1176 val (sc, srls) = (case Specify.get_met metID' of
1177 {scr = Prog sc, srls, ...} => (sc, srls) | _ => error "sel_rules 1")
1178 val (env, a, v) = (case get_istate pt (p, p_) of
1179 ScrState (env, _, a, v, _, _) => (env, a, v) | _ => error "sel_rules 2")
1180 in map ((stac2tac pt thy) o rep_stacexpr o #2 o
1181 (handle_leaf "selrul" thy' srls env a v)) (stacpbls sc)
1184 (*. fetch tactics from script and filter _applicable_ tactics;
1185 in case of Rewrite_Set* go down to _atomic_ rewrite-tactics .*)
1186 fun sel_appl_atomic_tacs _ (([], Res) : pos') =
1187 raise PTREE "no tactics applicable at the end of a calculation"
1188 | sel_appl_atomic_tacs pt (p, p_) =
1190 then [get_obj g_tac pt p]
1193 val pp = par_pblobj pt p
1194 val thy' = (get_obj g_domID pt pp):theory'
1195 val thy = assoc_thy thy'
1196 val metID = get_obj g_metID pt pp
1199 then (thd3 o snd3) (get_obj g_origin pt pp)
1201 val (sc, srls, erls, ro) = (case Specify.get_met metID' of
1202 {scr = Prog sc, srls, erls, rew_ord' = ro, ...} => (sc, srls, erls, ro)
1203 | _ => error "sel_appl_atomic_tacs 1")
1204 val (env, a, v) = (case get_istate pt (p, p_) of
1205 ScrState (env, _, a, v, _, _) => (env, a, v) | _ => error "sel_appl_atomic_tacs 2")
1206 val alltacs = (*we expect at least 1 stac in a script*)
1207 map ((stac2tac pt thy) o rep_stacexpr o #2 o
1208 (handle_leaf "selrul" thy' srls env a v)) (stacpbls sc)
1210 (case p_ of Frm => get_obj g_form pt p | Res => (fst o (get_obj g_result pt)) p
1212 (*WN071231 ? replace atomic_appl_tacs with applicable_in (ineff!) ?*)
1213 in ((gen_distinct eq_tac) o flat o (map (Rtools.atomic_appl_tacs thy ro erls f))) alltacs end;