neuper@42248
|
1 |
(* Title: interpreter for scripts
|
neuper@42248
|
2 |
Author: Walther Neuper 2000
|
neuper@42248
|
3 |
(c) due to copyright terms
|
neuper@42248
|
4 |
12345678901234567890123456789012345678901234567890123456789012345678901234567890
|
neuper@42248
|
5 |
10 20 30 40 50 60 70 80
|
neuper@42248
|
6 |
*)
|
neuper@37906
|
7 |
|
neuper@37906
|
8 |
signature INTERPRETER =
|
neuper@37906
|
9 |
sig
|
neuper@37906
|
10 |
(*type ets (list of executed tactics) see sequent.sml*)
|
neuper@37906
|
11 |
|
neuper@37906
|
12 |
datatype locate
|
neuper@37906
|
13 |
= NotLocatable
|
neuper@37906
|
14 |
| Steps of (tac_ * mout * ptree * pos' * cid * safe (* ets*)) list
|
neuper@37906
|
15 |
(* | ToDo of ets 28.4.02*)
|
neuper@37906
|
16 |
|
neuper@37906
|
17 |
(*diss: next-tactic-function*)
|
neuper@37906
|
18 |
val next_tac : theory' -> ptree * pos' -> metID -> scr -> ets -> tac_
|
neuper@37906
|
19 |
(*diss: locate-function*)
|
neuper@37906
|
20 |
val locate_gen : theory'
|
neuper@37906
|
21 |
-> tac_
|
neuper@37906
|
22 |
-> ptree * pos' -> scr * rls -> ets -> loc_ -> locate
|
neuper@37906
|
23 |
|
neuper@37906
|
24 |
val sel_rules : ptree -> pos' -> tac list
|
neuper@37906
|
25 |
val init_form : scr -> ets -> loc_ * term option (*FIXME not up to date*)
|
neuper@37906
|
26 |
val formal_args : term -> term list
|
neuper@37906
|
27 |
|
neuper@37906
|
28 |
(*shift to library ...*)
|
neuper@37906
|
29 |
val inst_abs : theory' -> term -> term
|
neuper@37906
|
30 |
val itms2args : metID -> itm list -> term list
|
neuper@37906
|
31 |
val user_interrupt : loc_ * (tac_ * env * env * term * term * safe)
|
neuper@37906
|
32 |
(*val empty : term*)
|
neuper@37906
|
33 |
end
|
neuper@37906
|
34 |
|
neuper@37906
|
35 |
|
neuper@37906
|
36 |
|
neuper@37906
|
37 |
|
neuper@37906
|
38 |
(*
|
neuper@37906
|
39 |
structure Interpreter : INTERPRETER =
|
neuper@37906
|
40 |
struct
|
neuper@37906
|
41 |
*)
|
neuper@37906
|
42 |
|
neuper@37906
|
43 |
(*.traces the leaves (ie. non-tactical nodes) of the script
|
neuper@37906
|
44 |
found by next_tac.
|
neuper@37906
|
45 |
a leaf is either a tactic or an 'exp' in 'let v = expr'
|
neuper@37906
|
46 |
where 'exp' does not contain a tactic.*)
|
neuper@38006
|
47 |
val trace_script = Unsynchronized.ref false;
|
neuper@37906
|
48 |
|
neuper@37906
|
49 |
type step = (*data for creating a new node in the ptree;
|
neuper@37906
|
50 |
designed for use:
|
neuper@37906
|
51 |
fun ass* scrstate steps =
|
neuper@37906
|
52 |
... case ass* scrstate steps of
|
neuper@37906
|
53 |
Assoc (scrstate, steps) => ... ass* scrstate steps*)
|
neuper@37906
|
54 |
tac_ (*transformed from associated tac*)
|
neuper@37906
|
55 |
* mout (*result with indentation etc.*)
|
neuper@37906
|
56 |
* ptree (*containing node created by tac_ + resp. scrstate*)
|
neuper@37906
|
57 |
* pos' (*position in ptree; ptree * pos' is the proofstate*)
|
neuper@37906
|
58 |
* pos' list; (*of ptree-nodes probably cut (by fst tac_)*)
|
neuper@37906
|
59 |
val e_step = (Empty_Tac_, EmptyMout, EmptyPtree, e_pos',[]:pos' list):step;
|
neuper@37906
|
60 |
|
neuper@37906
|
61 |
fun rule2thm' (Thm (id, thm)) = (id, string_of_thmI thm):thm'
|
neuper@38031
|
62 |
| rule2thm' r = error ("rule2thm': not defined for "^(rule2str r));
|
neuper@37906
|
63 |
fun rule2rls' (Rls_ rls) = id_rls rls
|
neuper@38031
|
64 |
| rule2rls' r = error ("rule2rls': not defined for "^(rule2str r));
|
neuper@37906
|
65 |
|
neuper@37906
|
66 |
(*.makes a (rule,term) list to a Step (m, mout, pt', p', cid) for solve;
|
neuper@37906
|
67 |
complicated with current t in rrlsstate.*)
|
neuper@37906
|
68 |
fun rts2steps steps ((pt,p),(f,f'',rss,rts),(thy',ro,er,pa)) [(r, (f', am))] =
|
neuper@41996
|
69 |
let
|
neuper@41996
|
70 |
val thy = assoc_thy thy'
|
neuper@41996
|
71 |
val ctxt = get_ctxt pt p |> insert_assumptions am
|
neuper@41996
|
72 |
val m = Rewrite' (thy', ro, er, pa, rule2thm' r, f, (f', am))
|
neuper@41996
|
73 |
val is = RrlsState (f', f'', rss, rts)
|
neuper@41996
|
74 |
val p = case p of (p',Frm) => p | (p',Res) => (lev_on p',Res)
|
neuper@41996
|
75 |
val (p', cid, mout, pt') = generate1 thy m (is, ctxt) p pt
|
neuper@41996
|
76 |
in (is, (m, mout, pt', p', cid) :: steps) end
|
neuper@41996
|
77 |
| rts2steps steps ((pt,p),(f,f'',rss,rts),(thy',ro,er,pa)) ((r, (f', am))::rts') =
|
neuper@41996
|
78 |
let
|
neuper@41996
|
79 |
val thy = assoc_thy thy'
|
neuper@41996
|
80 |
val ctxt = get_ctxt pt p |> insert_assumptions am
|
neuper@41996
|
81 |
val m = Rewrite' (thy',ro,er,pa, rule2thm' r, f, (f', am))
|
neuper@41996
|
82 |
val is = RrlsState (f',f'',rss,rts)
|
neuper@41996
|
83 |
val p = case p of (p',Frm) => p | (p',Res) => (lev_on p',Res)
|
neuper@41996
|
84 |
val (p', cid, mout, pt') = generate1 thy m (is, ctxt) p pt
|
neuper@41996
|
85 |
in rts2steps ((m, mout, pt', p', cid)::steps)
|
neuper@41996
|
86 |
((pt',p'),(f',f'',rss,rts),(thy',ro,er,pa)) rts' end;
|
neuper@37906
|
87 |
|
neuper@37906
|
88 |
(*. functions for the environment stack .*)
|
neuper@37906
|
89 |
fun accessenv id es = the (assoc((top es):env, id))
|
neuper@37906
|
90 |
handle _ => error ("accessenv: "^(free2str id)^" not in env");
|
neuper@37906
|
91 |
fun updateenv id vl (es:env stack) =
|
neuper@37906
|
92 |
(push (overwrite(top es, (id, vl))) (pop es)):env stack;
|
neuper@37906
|
93 |
fun pushenv id vl (es:env stack) =
|
neuper@37906
|
94 |
(push (overwrite(top es, (id, vl))) es):env stack;
|
neuper@37906
|
95 |
val popenv = pop:env stack -> env stack;
|
neuper@37906
|
96 |
|
neuper@37906
|
97 |
|
neuper@37906
|
98 |
|
neuper@37906
|
99 |
fun de_esc_underscore str =
|
neuper@37906
|
100 |
let fun scan [] = []
|
neuper@37906
|
101 |
| scan (s::ss) = if s = "'" then (scan ss)
|
neuper@37906
|
102 |
else (s::(scan ss))
|
neuper@40836
|
103 |
in (implode o scan o Symbol.explode) str end;
|
neuper@37906
|
104 |
(*
|
neuper@37906
|
105 |
> val str = "Rewrite_Set_Inst";
|
neuper@37906
|
106 |
> val esc = esc_underscore str;
|
neuper@37906
|
107 |
val it = "Rewrite'_Set'_Inst" : string
|
neuper@37906
|
108 |
> val des = de_esc_underscore esc;
|
neuper@37906
|
109 |
val des = de_esc_underscore esc;*)
|
neuper@37906
|
110 |
|
neuper@37906
|
111 |
(*go at a location in a script and fetch the contents*)
|
neuper@37906
|
112 |
fun go [] t = t
|
neuper@37906
|
113 |
| go (D::p) (Abs(s,ty,t0)) = go (p:loc_) t0
|
neuper@37906
|
114 |
| go (L::p) (t1 $ t2) = go p t1
|
neuper@37906
|
115 |
| go (R::p) (t1 $ t2) = go p t2
|
neuper@38031
|
116 |
| go l _ = error ("go: no "^(loc_2str l));
|
neuper@37906
|
117 |
(*
|
neuper@37906
|
118 |
> val t = (term_of o the o (parse thy)) "a+b";
|
neuper@37906
|
119 |
val it = Const (#,#) $ Free (#,#) $ Free ("b","RealDef.real") : term
|
neuper@37906
|
120 |
> val plus_a = go [L] t;
|
neuper@37906
|
121 |
> val b = go [R] t;
|
neuper@37906
|
122 |
> val plus = go [L,L] t;
|
neuper@37906
|
123 |
> val a = go [L,R] t;
|
neuper@37906
|
124 |
|
neuper@37906
|
125 |
> val t = (term_of o the o (parse thy)) "a+b+c";
|
neuper@37906
|
126 |
val t = Const (#,#) $ (# $ # $ Free #) $ Free ("c","RealDef.real") : term
|
neuper@37906
|
127 |
> val pl_pl_a_b = go [L] t;
|
neuper@37906
|
128 |
> val c = go [R] t;
|
neuper@37906
|
129 |
> val a = go [L,R,L,R] t;
|
neuper@37906
|
130 |
> val b = go [L,R,R] t;
|
neuper@37906
|
131 |
*)
|
neuper@37906
|
132 |
|
neuper@37906
|
133 |
|
neuper@37906
|
134 |
(* get a subterm t with test t, and record location *)
|
neuper@37906
|
135 |
fun get l test (t as Const (s,T)) =
|
neuper@37926
|
136 |
if test t then SOME (l,t) else NONE
|
neuper@37906
|
137 |
| get l test (t as Free (s,T)) =
|
neuper@37926
|
138 |
if test t then SOME (l,t) else NONE
|
neuper@37906
|
139 |
| get l test (t as Bound n) =
|
neuper@37926
|
140 |
if test t then SOME (l,t) else NONE
|
neuper@37906
|
141 |
| get l test (t as Var (s,T)) =
|
neuper@37926
|
142 |
if test t then SOME (l,t) else NONE
|
neuper@37906
|
143 |
| get l test (t as Abs (s,T,body)) =
|
neuper@37926
|
144 |
if test t then SOME (l:loc_,t) else get ((l@[D]):loc_) test body
|
neuper@37906
|
145 |
| get l test (t as t1 $ t2) =
|
neuper@37926
|
146 |
if test t then SOME (l,t)
|
neuper@37906
|
147 |
else case get (l@[L]) test t1 of
|
neuper@37926
|
148 |
NONE => get (l@[R]) test t2
|
neuper@37926
|
149 |
| SOME (l',t') => SOME (l',t');
|
neuper@37906
|
150 |
(*18.6.00
|
neuper@37906
|
151 |
> val sss = ((term_of o the o (parse thy))
|
neuper@37906
|
152 |
"Script Solve_root_equation (eq_::bool) (v_::real) (err_::bool) =\
|
neuper@37906
|
153 |
\ (let e_ = Try (Rewrite square_equation_left True eq_) \
|
neuper@37906
|
154 |
\ in [e_])");
|
neuper@37906
|
155 |
______ compares head_of !!
|
neuper@41968
|
156 |
> get [] (eq_str "HOL.Let") sss; [R]
|
neuper@37906
|
157 |
> get [] (eq_str "Script.Try") sss; [R,L,R]
|
neuper@37906
|
158 |
> get [] (eq_str "Script.Rewrite") sss; [R,L,R,R]
|
neuper@41928
|
159 |
> get [] (eq_str "HOL.True") sss; [R,L,R,R,L,R]
|
neuper@37906
|
160 |
> get [] (eq_str "e_") sss; [R,R]
|
neuper@37906
|
161 |
*)
|
neuper@37906
|
162 |
|
neuper@37930
|
163 |
fun test_negotiable t =
|
neuper@37937
|
164 |
member op = (!negotiable)
|
neuper@40836
|
165 |
((strip_thy o (term_str (Thy_Info.get_theory "Script")) o head_of) t);
|
neuper@37906
|
166 |
|
neuper@37906
|
167 |
(*.get argument of first stactic in a script for init_form.*)
|
neuper@37906
|
168 |
fun get_stac thy (h $ body) =
|
neuper@37906
|
169 |
let
|
neuper@37906
|
170 |
fun get_t y (Const ("Script.Seq",_) $ e1 $ e2) a =
|
neuper@37926
|
171 |
(case get_t y e1 a of NONE => get_t y e2 a | la => la)
|
neuper@37906
|
172 |
| get_t y (Const ("Script.Seq",_) $ e1 $ e2 $ a) _ =
|
neuper@37926
|
173 |
(case get_t y e1 a of NONE => get_t y e2 a | la => la)
|
neuper@37906
|
174 |
| get_t y (Const ("Script.Try",_) $ e) a = get_t y e a
|
neuper@37906
|
175 |
| get_t y (Const ("Script.Try",_) $ e $ a) _ = get_t y e a
|
neuper@37906
|
176 |
| get_t y (Const ("Script.Repeat",_) $ e) a = get_t y e a
|
neuper@37906
|
177 |
| get_t y (Const ("Script.Repeat",_) $ e $ a) _ = get_t y e a
|
neuper@37906
|
178 |
| get_t y (Const ("Script.Or",_) $e1 $ e2) a =
|
neuper@37926
|
179 |
(case get_t y e1 a of NONE => get_t y e2 a | la => la)
|
neuper@37906
|
180 |
| get_t y (Const ("Script.Or",_) $e1 $ e2 $ a) _ =
|
neuper@37926
|
181 |
(case get_t y e1 a of NONE => get_t y e2 a | la => la)
|
neuper@37906
|
182 |
| get_t y (Const ("Script.While",_) $ c $ e) a = get_t y e a
|
neuper@37906
|
183 |
| get_t y (Const ("Script.While",_) $ c $ e $ a) _ = get_t y e a
|
neuper@37906
|
184 |
| get_t y (Const ("Script.Letpar",_) $ e1 $ Abs (_,_,e2)) a =
|
neuper@37926
|
185 |
(case get_t y e1 a of NONE => get_t y e2 a | la => la)
|
neuper@41968
|
186 |
(*| get_t y (Const ("HOL.Let",_) $ e1 $ Abs (_,_,e2)) a =
|
neuper@41999
|
187 |
(case get_t y e1 a of NONE => get_t y e2 a | la => la)
|
neuper@37906
|
188 |
| get_t y (Abs (_,_,e)) a = get_t y e a*)
|
neuper@41968
|
189 |
| get_t y (Const ("HOL.Let",_) $ e1 $ Abs (_,_,e2)) a =
|
neuper@37906
|
190 |
get_t y e1 a (*don't go deeper without evaluation !*)
|
neuper@37926
|
191 |
| get_t y (Const ("If",_) $ c $ e1 $ e2) a = NONE
|
neuper@37926
|
192 |
(*(case get_t y e1 a of NONE => get_t y e2 a | la => la)*)
|
neuper@37906
|
193 |
|
neuper@37926
|
194 |
| get_t y (Const ("Script.Rewrite",_) $ _ $ _ $ a) _ = SOME a
|
neuper@37926
|
195 |
| get_t y (Const ("Script.Rewrite",_) $ _ $ _ ) a = SOME a
|
neuper@37926
|
196 |
| get_t y (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ $ a) _ = SOME a
|
neuper@37926
|
197 |
| get_t y (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ ) a = SOME a
|
neuper@37926
|
198 |
| get_t y (Const ("Script.Rewrite'_Set",_) $ _ $ _ $ a) _ = SOME a
|
neuper@37926
|
199 |
| get_t y (Const ("Script.Rewrite'_Set",_) $ _ $ _ ) a = SOME a
|
neuper@37926
|
200 |
| get_t y (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ $a)_ =SOME a
|
neuper@37926
|
201 |
| get_t y (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ ) a =SOME a
|
neuper@37926
|
202 |
| get_t y (Const ("Script.Calculate",_) $ _ $ a) _ = SOME a
|
neuper@37926
|
203 |
| get_t y (Const ("Script.Calculate",_) $ _ ) a = SOME a
|
neuper@37906
|
204 |
|
neuper@37926
|
205 |
| get_t y (Const ("Script.Substitute",_) $ _ $ a) _ = SOME a
|
neuper@37926
|
206 |
| get_t y (Const ("Script.Substitute",_) $ _ ) a = SOME a
|
neuper@37906
|
207 |
|
neuper@37926
|
208 |
| get_t y (Const ("Script.SubProblem",_) $ _ $ _) _ = NONE
|
neuper@37906
|
209 |
|
neuper@37906
|
210 |
| get_t y x _ =
|
neuper@38015
|
211 |
((*tracing ("### get_t yac: list-expr "^(term2str x));*)
|
neuper@37926
|
212 |
NONE)
|
neuper@37906
|
213 |
in get_t thy body e_term end;
|
neuper@37906
|
214 |
|
neuper@37906
|
215 |
(*FIXME: get 1st stac by next_stac [] instead of ... ?? 29.7.02*)
|
neuper@37906
|
216 |
(* val Script sc = scr;
|
neuper@37906
|
217 |
*)
|
neuper@37906
|
218 |
fun init_form thy (Script sc) env =
|
neuper@37906
|
219 |
(case get_stac thy sc of
|
neuper@38053
|
220 |
NONE => NONE
|
neuper@38053
|
221 |
(*error ("init_form: no 1st stac in "^
|
neuper@38053
|
222 |
(Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) sc))*)
|
neuper@37926
|
223 |
| SOME stac => SOME (subst_atomic env stac))
|
neuper@38031
|
224 |
| init_form _ _ _ = error "init_form: no match";
|
neuper@37906
|
225 |
|
neuper@37906
|
226 |
(* use"ME/script.sml";
|
neuper@37906
|
227 |
use"script.sml";
|
neuper@37906
|
228 |
*)
|
neuper@37906
|
229 |
|
neuper@37906
|
230 |
|
neuper@37906
|
231 |
|
neuper@37906
|
232 |
(*the 'iteration-argument' of a stac (args not eval)*)
|
neuper@37906
|
233 |
fun itr_arg _ (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ $ v) = v
|
neuper@37906
|
234 |
| itr_arg _ (Const ("Script.Rewrite",_) $ _ $ _ $ v) = v
|
neuper@37906
|
235 |
| itr_arg _ (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ $ v) = v
|
neuper@37906
|
236 |
| itr_arg _ (Const ("Script.Rewrite'_Set",_) $ _ $ _ $ v) = v
|
neuper@37906
|
237 |
| itr_arg _ (Const ("Script.Calculate",_) $ _ $ v) = v
|
neuper@37906
|
238 |
| itr_arg _ (Const ("Script.Check'_elementwise",_) $ consts $ _) = consts
|
neuper@37906
|
239 |
| itr_arg _ (Const ("Script.Or'_to'_List",_) $ _) = e_term
|
neuper@37906
|
240 |
| itr_arg _ (Const ("Script.Tac",_) $ _) = e_term
|
neuper@37906
|
241 |
| itr_arg _ (Const ("Script.SubProblem",_) $ _ $ _) = e_term
|
neuper@38031
|
242 |
| itr_arg thy t = error
|
neuper@38053
|
243 |
("itr_arg not impl. for " ^
|
neuper@38053
|
244 |
(Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt (assoc_thy thy))) t));
|
neuper@37906
|
245 |
(* val t = (term_of o the o (parse thy))"Rewrite rroot_square_inv False e_";
|
neuper@38058
|
246 |
> itr_arg "Script" t;
|
neuper@37906
|
247 |
val it = Free ("e_","RealDef.real") : term
|
neuper@37906
|
248 |
> val t = (term_of o the o (parse thy))"xxx";
|
neuper@38058
|
249 |
> itr_arg "Script" t;
|
neuper@37906
|
250 |
*** itr_arg not impl. for xxx
|
neuper@37906
|
251 |
uncaught exception ERROR
|
neuper@37906
|
252 |
raised at: library.ML:1114.35-1114.40*)
|
neuper@37906
|
253 |
|
neuper@37906
|
254 |
|
neuper@37906
|
255 |
(*.get the arguments of the script out of the scripts parsetree.*)
|
neuper@37906
|
256 |
fun formal_args scr = (fst o split_last o snd o strip_comb) scr;
|
neuper@37906
|
257 |
(*
|
neuper@37906
|
258 |
> formal_args scr;
|
neuper@37906
|
259 |
[Free ("f_","RealDef.real"),Free ("v_","RealDef.real"),
|
neuper@37906
|
260 |
Free ("eqs_","bool List.list")] : term list
|
neuper@37906
|
261 |
*)
|
neuper@37906
|
262 |
|
neuper@37906
|
263 |
(*.get the identifier of the script out of the scripts parsetree.*)
|
neuper@37906
|
264 |
fun id_of_scr sc = (id_of o fst o strip_comb) sc;
|
neuper@37906
|
265 |
|
neuper@37906
|
266 |
(*WN020526: not clear, when a is available in ass_up for eva-_true*)
|
neuper@37926
|
267 |
(*WN060906: in "fun handle_leaf" eg. uses "SOME M__"(from some PREVIOUS
|
neuper@37906
|
268 |
curried Rewrite) for CURRENT value (which may be different from PREVIOUS);
|
neuper@37926
|
269 |
thus "NONE" must be set at the end of currying (ill designed anyway)*)
|
neuper@37926
|
270 |
fun upd_env_opt env (SOME a, v) = upd_env env (a,v)
|
neuper@37926
|
271 |
| upd_env_opt env (NONE, v) =
|
neuper@41996
|
272 |
(tracing ("*** upd_env_opt: (NONE," ^ term2str v ^ ")"); env);
|
neuper@37906
|
273 |
|
neuper@37906
|
274 |
type dsc = typ; (*<-> nam..unknow in Descript.thy*)
|
neuper@37906
|
275 |
fun typ_str (Type (s,_)) = s
|
neuper@37906
|
276 |
| typ_str (TFree(s,_)) = s
|
neuper@41996
|
277 |
| typ_str (TVar ((s,i),_)) = s ^ (string_of_int i);
|
neuper@37906
|
278 |
|
neuper@37906
|
279 |
(*get the _result_-type of a description*)
|
neuper@37906
|
280 |
fun dsc_valT (Const (_,(Type (_,[_,T])))) = (strip_thy o typ_str) T;
|
neuper@37906
|
281 |
(*> val t = (term_of o the o (parse thy)) "equality";
|
neuper@37906
|
282 |
> val T = type_of t;
|
neuper@37906
|
283 |
val T = "bool => Tools.una" : typ
|
neuper@37906
|
284 |
> val dsc = dsc_valT t;
|
neuper@37906
|
285 |
val dsc = "una" : string
|
neuper@37906
|
286 |
|
neuper@37906
|
287 |
> val t = (term_of o the o (parse thy)) "fixedValues";
|
neuper@37906
|
288 |
> val T = type_of t;
|
neuper@37906
|
289 |
val T = "bool List.list => Tools.nam" : typ
|
neuper@37906
|
290 |
> val dsc = dsc_valT t;
|
neuper@37906
|
291 |
val dsc = "nam" : string*)
|
neuper@37906
|
292 |
|
neuper@37906
|
293 |
(*.from penv in itm_ make args for script depending on type of description.*)
|
neuper@37906
|
294 |
(*6.5.03 TODO: push penv into script -- and drop mk_arg here || drop penv
|
neuper@37906
|
295 |
9.5.03 penv postponed: penv = env for script at the moment, (*mk_arg*)*)
|
neuper@38053
|
296 |
fun mk_arg thy d [] =
|
neuper@38053
|
297 |
error ("mk_arg: no data for " ^
|
neuper@38053
|
298 |
(Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) d))
|
neuper@37906
|
299 |
| mk_arg thy d [t] =
|
neuper@37906
|
300 |
(case dsc_valT d of
|
neuper@37906
|
301 |
"una" => [t]
|
neuper@37906
|
302 |
| "nam" =>
|
neuper@37906
|
303 |
[case t of
|
neuper@41922
|
304 |
r as (Const ("HOL.eq",_) $ _ $ _) => r
|
neuper@38053
|
305 |
| _ => error ("mk_arg: dsc-typ 'nam' applied to non-equality "^
|
neuper@38053
|
306 |
(Print_Mode.setmp [] (Syntax.string_of_term
|
neuper@38053
|
307 |
(thy2ctxt thy)) t))]
|
neuper@38031
|
308 |
| s => error ("mk_arg: not impl. for "^s))
|
neuper@37906
|
309 |
|
neuper@37906
|
310 |
| mk_arg thy d (t::ts) = (mk_arg thy d [t]) @ (mk_arg thy d ts);
|
neuper@37906
|
311 |
(*
|
neuper@37906
|
312 |
val d = d_in itm_;
|
neuper@37906
|
313 |
val [t] = ts_in itm_;
|
neuper@37906
|
314 |
mk_arg thy
|
neuper@37906
|
315 |
*)
|
neuper@37906
|
316 |
|
neuper@37906
|
317 |
|
neuper@37906
|
318 |
|
neuper@37906
|
319 |
|
neuper@37906
|
320 |
(*.create the actual parameters (args) of script: their order
|
neuper@37906
|
321 |
is given by the order in met.pat .*)
|
neuper@37906
|
322 |
(*WN.5.5.03: ?: does this allow for different descriptions ???
|
neuper@37906
|
323 |
?: why not taken from formal args of script ???
|
neuper@37906
|
324 |
!: FIXXXME penv: push it here in itms2args into script-evaluation*)
|
neuper@37906
|
325 |
(* val (thy, mI, itms) = (thy, metID, itms);
|
neuper@37906
|
326 |
*)
|
neuper@37906
|
327 |
fun itms2args thy mI (itms:itm list) =
|
neuper@37906
|
328 |
let val mvat = max_vt itms
|
neuper@37935
|
329 |
fun okv mvat (_,vats,b,_,_) = member op = vats mvat andalso b
|
neuper@37906
|
330 |
val itms = filter (okv mvat) itms
|
neuper@37906
|
331 |
fun test_dsc d (_,_,_,_,itm_) = (d = d_in itm_)
|
neuper@37906
|
332 |
fun itm2arg itms (_,(d,_)) =
|
neuper@37906
|
333 |
case find_first (test_dsc d) itms of
|
neuper@37926
|
334 |
NONE =>
|
neuper@38031
|
335 |
error ("itms2args: '"^term2str d^"' not in itms")
|
neuper@37926
|
336 |
(*| SOME (_,_,_,_,itm_) => mk_arg thy (d_in itm_) (ts_in itm_);
|
neuper@37906
|
337 |
penv postponed; presently penv holds already env for script*)
|
neuper@37926
|
338 |
| SOME (_,_,_,_,itm_) => penvval_in itm_
|
neuper@37906
|
339 |
fun sel_given_find (s,_) = (s = "#Given") orelse (s = "#Find")
|
neuper@37906
|
340 |
val pats = (#ppc o get_met) mI
|
neuper@37906
|
341 |
in (flat o (map (itm2arg itms))) pats end;
|
neuper@37906
|
342 |
(*
|
neuper@37906
|
343 |
> val sc = ... Solve_root_equation ...
|
neuper@38058
|
344 |
> val mI = ("Script","sqrt-equ-test");
|
neuper@37906
|
345 |
> val PblObj{meth={ppc=itms,...},...} = get_obj I pt [];
|
neuper@37906
|
346 |
> val ts = itms2args thy mI itms;
|
neuper@38053
|
347 |
> map (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))) ts;
|
neuper@37906
|
348 |
["sqrt (#9 + #4 * x) = sqrt x + sqrt (#5 + x)","x","#0"] : string list
|
neuper@37906
|
349 |
*)
|
neuper@37906
|
350 |
|
neuper@37906
|
351 |
|
neuper@37906
|
352 |
(*detour necessary, because generate1 delivers a string-result*)
|
neuper@37906
|
353 |
fun mout2term thy (Form' (FormKF (_,_,_,_,res))) =
|
neuper@37906
|
354 |
(term_of o the o (parse (assoc_thy thy))) res
|
neuper@37906
|
355 |
| mout2term thy (Form' (PpcKF _)) = e_term;(*3.8.01: res of subpbl
|
neuper@37906
|
356 |
at time of detection in script*)
|
neuper@37906
|
357 |
|
neuper@37906
|
358 |
(*.convert a script-tac 'stac' to a tactic 'tac'; if stac is an initac,
|
neuper@37906
|
359 |
then convert to a 'tac_' (as required in appy).
|
neuper@37906
|
360 |
arg pt:ptree for pushing the thy specified in rootpbl into subpbls.*)
|
neuper@37906
|
361 |
fun stac2tac_ pt thy (Const ("Script.Rewrite",_) $ Free (thmID,_) $ _ $ f) =
|
neuper@41984
|
362 |
let
|
neuper@41984
|
363 |
val tid = (de_esc_underscore o strip_thy) thmID
|
neuper@41984
|
364 |
in (Rewrite (tid, (string_of_thmI o (assoc_thm' thy)) (tid,"")), Empty_Tac_)
|
neuper@41984
|
365 |
end
|
neuper@37906
|
366 |
|
neuper@41984
|
367 |
| stac2tac_ pt thy (Const ("Script.Rewrite'_Inst",_) $ sub $ Free (thmID,_) $ _ $ f) =
|
neuper@41984
|
368 |
let
|
neuper@41984
|
369 |
val subML = ((map isapair2pair) o isalist2list) sub
|
neuper@41984
|
370 |
val subStr = subst2subs subML
|
neuper@41984
|
371 |
val tid = (de_esc_underscore o strip_thy) thmID (*4.10.02 unnoetig*)
|
neuper@41984
|
372 |
in (Rewrite_Inst (subStr, (tid, (string_of_thmI o (assoc_thm' thy)) (tid,""))), Empty_Tac_)
|
neuper@41984
|
373 |
end
|
neuper@37906
|
374 |
|
neuper@41984
|
375 |
| stac2tac_ pt thy (Const ("Script.Rewrite'_Set",_) $ Free (rls,_) $ _ $ f) =
|
neuper@41984
|
376 |
(Rewrite_Set ((de_esc_underscore o strip_thy) rls), Empty_Tac_)
|
neuper@37906
|
377 |
|
neuper@41984
|
378 |
| stac2tac_ pt thy (Const ("Script.Rewrite'_Set'_Inst",_) $ sub $ Free (rls,_) $ _ $ f) =
|
neuper@41984
|
379 |
let
|
neuper@41984
|
380 |
val subML = ((map isapair2pair) o isalist2list) sub;
|
neuper@41984
|
381 |
val subStr = subst2subs subML;
|
neuper@41984
|
382 |
in (Rewrite_Set_Inst (subStr,rls), Empty_Tac_) end
|
neuper@37906
|
383 |
|
neuper@37906
|
384 |
| stac2tac_ pt thy (Const ("Script.Calculate",_) $ Free (op_,_) $ f) =
|
neuper@41984
|
385 |
(Calculate op_, Empty_Tac_)
|
neuper@37906
|
386 |
|
neuper@37906
|
387 |
| stac2tac_ pt thy (Const ("Script.Take",_) $ t) =
|
neuper@41984
|
388 |
(Take (term2str t), Empty_Tac_)
|
neuper@37906
|
389 |
|
neuper@37906
|
390 |
| stac2tac_ pt thy (Const ("Script.Substitute",_) $ isasub $ arg) =
|
neuper@41984
|
391 |
(Substitute ((subte2sube o isalist2list) isasub), Empty_Tac_)
|
neuper@37906
|
392 |
|
neuper@37906
|
393 |
| stac2tac_ pt thy (Const("Script.Check'_elementwise",_) $ _ $
|
neuper@42007
|
394 |
(set as Const ("Set.Collect",_) $ Abs (_,_,pred))) =
|
neuper@41984
|
395 |
(Check_elementwise (Print_Mode.setmp [] (Syntax.string_of_term
|
neuper@41984
|
396 |
(thy2ctxt thy)) pred), (*set*)Empty_Tac_)
|
neuper@37906
|
397 |
|
neuper@37906
|
398 |
| stac2tac_ pt thy (Const("Script.Or'_to'_List",_) $ _ ) =
|
neuper@41984
|
399 |
(Or_to_List, Empty_Tac_)
|
neuper@37906
|
400 |
|
neuper@41984
|
401 |
(*12.1.01.for subproblem_equation_dummy in root-equation *)
|
neuper@37906
|
402 |
| stac2tac_ pt thy (Const ("Script.Tac",_) $ Free (str,_)) =
|
neuper@41984
|
403 |
(Tac ((de_esc_underscore o strip_thy) str), Empty_Tac_)
|
neuper@37906
|
404 |
|
neuper@41990
|
405 |
(*compare "| assod _ (Subproblem'"*)
|
neuper@37906
|
406 |
| stac2tac_ pt thy (stac as Const ("Script.SubProblem",_) $
|
neuper@41983
|
407 |
(Const ("Product_Type.Pair",_) $Free (dI',_) $
|
neuper@41983
|
408 |
(Const ("Product_Type.Pair",_) $ pI' $ mI')) $ ags') =
|
neuper@41983
|
409 |
let
|
neuper@41983
|
410 |
val dI = ((implode o drop_last(*.."'"*) o Symbol.explode) dI')(*^""*);
|
neuper@37906
|
411 |
val thy = maxthy (assoc_thy dI) (rootthy pt);
|
neuper@41983
|
412 |
val pI = ((map (de_esc_underscore o free2str)) o isalist2list) pI';
|
neuper@41983
|
413 |
val mI = ((map (de_esc_underscore o free2str)) o isalist2list) mI';
|
neuper@41983
|
414 |
val ags = isalist2list ags';
|
neuper@41983
|
415 |
val (pI, pors, mI) =
|
neuper@41983
|
416 |
if mI = ["no_met"]
|
neuper@41983
|
417 |
then
|
neuper@41983
|
418 |
let
|
neuper@41983
|
419 |
val pors = (match_ags thy ((#ppc o get_pbt) pI) ags)
|
neuper@41983
|
420 |
handle ERROR "actual args do not match formal args"
|
neuper@41983
|
421 |
=> (match_ags_msg pI stac ags(*raise exn*); [])
|
neuper@41983
|
422 |
val pI' = refine_ori' pors pI;
|
neuper@41983
|
423 |
in (pI', pors (*refinement over models with diff.prec only*),
|
neuper@41983
|
424 |
(hd o #met o get_pbt) pI') end
|
neuper@41983
|
425 |
else (pI, (match_ags thy ((#ppc o get_pbt) pI) ags)
|
neuper@41983
|
426 |
handle ERROR "actual args do not match formal args"
|
neuper@41983
|
427 |
=> (match_ags_msg pI stac ags(*raise exn*); []), mI);
|
neuper@37906
|
428 |
val (fmz_, vals) = oris2fmz_vals pors;
|
neuper@41983
|
429 |
val {cas,ppc,thy,...} = get_pbt pI
|
neuper@41983
|
430 |
val dI = theory2theory' thy (*.take dI from _refined_ pbl.*)
|
neuper@41983
|
431 |
val dI = theory2theory' (maxthy (assoc_thy dI) (rootthy pt));
|
neuper@41992
|
432 |
val ctxt = ProofContext.init_global
|
neuper@41992
|
433 |
val ctxt = dI |> Thy_Info.get_theory |> ProofContext.init_global
|
neuper@41992
|
434 |
|> declare_constraints' vals
|
neuper@41983
|
435 |
val hdl =
|
neuper@41983
|
436 |
case cas of
|
neuper@41983
|
437 |
NONE => pblterm dI pI
|
neuper@41983
|
438 |
| SOME t => subst_atomic ((vars_of_pbl_' ppc) ~~~ vals) t
|
neuper@37906
|
439 |
val f = subpbl (strip_thy dI) pI
|
neuper@41990
|
440 |
in (Subproblem (dI, pI), Subproblem' ((dI, pI, mI), pors, hdl, fmz_, ctxt, f))
|
neuper@41983
|
441 |
end
|
neuper@37906
|
442 |
|
neuper@38031
|
443 |
| stac2tac_ pt thy t = error
|
neuper@38053
|
444 |
("stac2tac_ TODO: no match for " ^
|
neuper@38053
|
445 |
(Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) t));
|
neuper@37906
|
446 |
|
neuper@37906
|
447 |
fun stac2tac pt thy t = (fst o stac2tac_ pt thy) t;
|
neuper@37906
|
448 |
|
neuper@37906
|
449 |
(*test a term for being a _list_ (set ?) of constants; could be more rigorous*)
|
neuper@37906
|
450 |
fun list_of_consts (Const ("List.list.Cons",_) $ _ $ _) = true
|
neuper@37906
|
451 |
| list_of_consts (Const ("List.list.Nil",_)) = true
|
neuper@37906
|
452 |
| list_of_consts _ = false;
|
neuper@37906
|
453 |
(*val ttt = (term_of o the o (parse thy)) "[x=#1,x=#2,x=#3]";
|
neuper@37906
|
454 |
> list_of_consts ttt;
|
neuper@37906
|
455 |
val it = true : bool
|
neuper@37906
|
456 |
> val ttt = (term_of o the o (parse thy)) "[]";
|
neuper@37906
|
457 |
> list_of_consts ttt;
|
neuper@37906
|
458 |
val it = true : bool*)
|
neuper@37906
|
459 |
|
neuper@37906
|
460 |
|
neuper@37906
|
461 |
|
neuper@37906
|
462 |
datatype ass =
|
neuper@41983
|
463 |
Ass of
|
neuper@41983
|
464 |
tac_ * (* SubProblem gets args instantiated in assod *)
|
neuper@41983
|
465 |
term (* for itr_arg, result in ets *)
|
neuper@41983
|
466 |
| AssWeak of
|
neuper@41983
|
467 |
tac_ *
|
neuper@41983
|
468 |
term (*for itr_arg,result in ets*)
|
neuper@41983
|
469 |
| NotAss;
|
neuper@37906
|
470 |
|
neuper@37906
|
471 |
(*.assod: tac_ associated with stac w.r.t. d
|
neuper@37906
|
472 |
args
|
neuper@37906
|
473 |
pt:ptree for pushing the thy specified in rootpbl into subpbls
|
neuper@37906
|
474 |
returns
|
neuper@37906
|
475 |
Ass : associated: e.g. thmID in stac = thmID in m
|
neuper@37906
|
476 |
+++ arg in stac = arg in m
|
neuper@37906
|
477 |
AssWeak: weakly ass.:e.g. thmID in stac = thmID in m, //arg//
|
neuper@37906
|
478 |
NotAss : e.g. thmID in stac/=/thmID in m (not =)
|
neuper@37906
|
479 |
8.01:
|
neuper@37906
|
480 |
tac_ SubProblem with args completed from script
|
neuper@37906
|
481 |
.*)
|
neuper@37906
|
482 |
fun assod pt d (m as Rewrite_Inst' (thy',rod,rls,put,subs,(thmID,thm),f,(f',asm))) stac =
|
neuper@41983
|
483 |
(case stac of
|
neuper@41983
|
484 |
(Const ("Script.Rewrite'_Inst",_) $ subs_ $ Free (thmID_,idT) $b$f_) =>
|
neuper@41983
|
485 |
if thmID = thmID_
|
neuper@41983
|
486 |
then
|
neuper@41983
|
487 |
if f = f_
|
neuper@41983
|
488 |
then ((*tracing"3### assod ..Ass";*)Ass (m,f'))
|
neuper@41983
|
489 |
else ((*tracing"3### assod ..AssWeak";*)AssWeak(m, f'))
|
neuper@41983
|
490 |
else ((*tracing"3### assod ..NotAss";*)NotAss)
|
neuper@41983
|
491 |
| (Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free (rls_,_) $_$f_) =>
|
neuper@41983
|
492 |
if contains_rule (Thm (thmID, refl(*dummy*))) (assoc_rls rls_)
|
neuper@41983
|
493 |
then
|
neuper@41983
|
494 |
if f = f_ then Ass (m,f') else AssWeak (m,f')
|
neuper@41983
|
495 |
else NotAss
|
neuper@37906
|
496 |
| _ => NotAss)
|
neuper@37906
|
497 |
|
neuper@37906
|
498 |
| assod pt d (m as Rewrite' (thy,rod,rls,put,(thmID,thm),f,(f',asm))) stac =
|
neuper@41983
|
499 |
(case stac of
|
neuper@41983
|
500 |
(t as Const ("Script.Rewrite",_) $ Free (thmID_,idT) $ b $ f_) =>
|
neuper@41983
|
501 |
((*tracing ("3### assod: stac = " ^ ter2str t);
|
neuper@41983
|
502 |
tracing ("3### assod: f(m)= " ^ term2str f);*)
|
neuper@41983
|
503 |
if thmID = thmID_
|
neuper@41983
|
504 |
then
|
neuper@41983
|
505 |
if f = f_
|
neuper@41983
|
506 |
then ((*tracing"3### assod ..Ass";*)Ass (m,f'))
|
neuper@41983
|
507 |
else
|
neuper@41983
|
508 |
((*tracing"### assod ..AssWeak";
|
neuper@41983
|
509 |
tracing("### assod: f(m) = " ^ term2str f);
|
neuper@41983
|
510 |
tracing("### assod: f(stac)= " ^ term2str f_)*)
|
neuper@41983
|
511 |
AssWeak (m,f'))
|
neuper@41983
|
512 |
else ((*tracing"3### assod ..NotAss";*)NotAss))
|
neuper@37906
|
513 |
| (Const ("Script.Rewrite'_Set",_) $ Free (rls_,_) $ _ $ f_) =>
|
neuper@41983
|
514 |
if contains_rule (Thm (thmID, refl(*dummy*))) (assoc_rls rls_)
|
neuper@41983
|
515 |
then
|
neuper@41983
|
516 |
if f = f_ then Ass (m,f') else AssWeak (m,f')
|
neuper@41983
|
517 |
else NotAss
|
neuper@37906
|
518 |
| _ => NotAss)
|
neuper@37906
|
519 |
|
neuper@37906
|
520 |
| assod pt d (m as Rewrite_Set_Inst' (thy',put,sub,rls,f,(f',asm)))
|
neuper@41983
|
521 |
(Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free (rls_,_) $ _ $ f_) =
|
neuper@41983
|
522 |
if id_rls rls = rls_
|
neuper@41983
|
523 |
then
|
neuper@41983
|
524 |
if f = f_ then Ass (m,f') else AssWeak (m,f')
|
neuper@41983
|
525 |
else NotAss
|
neuper@37906
|
526 |
|
neuper@37906
|
527 |
| assod pt d (m as Detail_Set_Inst' (thy',put,sub,rls,f,(f',asm)))
|
neuper@41983
|
528 |
(Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free (rls_,_) $ _ $ f_) =
|
neuper@41983
|
529 |
if id_rls rls = rls_
|
neuper@41983
|
530 |
then
|
neuper@41983
|
531 |
if f = f_ then Ass (m,f') else AssWeak (m,f')
|
neuper@41983
|
532 |
else NotAss
|
neuper@37906
|
533 |
|
neuper@37906
|
534 |
| assod pt d (m as Rewrite_Set' (thy,put,rls,f,(f',asm)))
|
neuper@41983
|
535 |
(Const ("Script.Rewrite'_Set",_) $ Free (rls_,_) $ _ $ f_) =
|
neuper@41983
|
536 |
if id_rls rls = rls_
|
neuper@41983
|
537 |
then
|
neuper@41983
|
538 |
if f = f_ then Ass (m,f') else AssWeak (m,f')
|
neuper@41983
|
539 |
else NotAss
|
neuper@37906
|
540 |
|
neuper@37906
|
541 |
| assod pt d (m as Detail_Set' (thy,put,rls,f,(f',asm)))
|
neuper@41983
|
542 |
(Const ("Script.Rewrite'_Set",_) $ Free (rls_,_) $ _ $ f_) =
|
neuper@41983
|
543 |
if id_rls rls = rls_
|
neuper@41983
|
544 |
then
|
neuper@41983
|
545 |
if f = f_ then Ass (m,f') else AssWeak (m,f')
|
neuper@41983
|
546 |
else NotAss
|
neuper@37906
|
547 |
|
neuper@37906
|
548 |
| assod pt d (m as Calculate' (thy',op_,f,(f',thm'))) stac =
|
neuper@41983
|
549 |
(case stac of
|
neuper@41983
|
550 |
(Const ("Script.Calculate",_) $ Free (op__,_) $ f_) =>
|
neuper@41983
|
551 |
if op_ = op__
|
neuper@41983
|
552 |
then
|
neuper@41983
|
553 |
if f = f_ then Ass (m,f') else AssWeak (m,f')
|
neuper@41983
|
554 |
else NotAss
|
neuper@41983
|
555 |
| (Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free(rls_,_) $_$f_) =>
|
neuper@41983
|
556 |
if contains_rule (Calc (snd (assoc1 (!calclist', op_)))) (assoc_rls rls_)
|
neuper@41983
|
557 |
then
|
neuper@41983
|
558 |
if f = f_ then Ass (m,f') else AssWeak (m,f')
|
neuper@41983
|
559 |
else NotAss
|
neuper@37906
|
560 |
| (Const ("Script.Rewrite'_Set",_) $ Free (rls_, _) $ _ $ f_) =>
|
neuper@41983
|
561 |
if contains_rule (Calc (snd (assoc1 (!calclist', op_)))) (assoc_rls rls_)
|
neuper@41983
|
562 |
then
|
neuper@41983
|
563 |
if f = f_ then Ass (m,f') else AssWeak (m,f')
|
neuper@41983
|
564 |
else NotAss
|
neuper@37906
|
565 |
| _ => NotAss)
|
neuper@37906
|
566 |
|
neuper@37906
|
567 |
| assod pt _ (m as Check_elementwise' (consts,_,(consts_chkd,_)))
|
neuper@37906
|
568 |
(Const ("Script.Check'_elementwise",_) $ consts' $ _) =
|
neuper@42248
|
569 |
(tracing("### assod Check'_elementwise: consts= "^(term2str consts)^
|
neuper@37906
|
570 |
", consts'= "^(term2str consts'));
|
neuper@42248
|
571 |
atomty consts; atomty consts';
|
neuper@41983
|
572 |
if consts = consts'
|
neuper@42248
|
573 |
then (tracing"### assod Check'_elementwise: Ass"; Ass (m, consts_chkd))
|
neuper@42248
|
574 |
else (tracing"### assod Check'_elementwise: NotAss"; NotAss))
|
neuper@37906
|
575 |
|
neuper@41983
|
576 |
| assod pt _ (m as Or_to_List' (ors, list)) (Const ("Script.Or'_to'_List",_) $ _) =
|
neuper@41983
|
577 |
Ass (m, list)
|
neuper@37906
|
578 |
|
neuper@41983
|
579 |
| assod pt _ (m as Take' term) (Const ("Script.Take",_) $ _) =
|
neuper@41983
|
580 |
Ass (m, term)
|
neuper@37906
|
581 |
|
neuper@41983
|
582 |
| assod pt _ (m as Substitute' (_, _, res)) (Const ("Script.Substitute",_) $ _ $ _) =
|
neuper@41983
|
583 |
Ass (m, res)
|
neuper@37906
|
584 |
|
neuper@41983
|
585 |
| assod pt _ (m as Tac_ (thy,f,id,f')) (Const ("Script.Tac",_) $ Free (id',_)) =
|
neuper@41983
|
586 |
if id = id'
|
neuper@41983
|
587 |
then Ass (m, ((term_of o the o (parse thy)) f'))
|
neuper@41983
|
588 |
else NotAss
|
neuper@37906
|
589 |
|
neuper@41990
|
590 |
(*compare "| stac2tac_ thy (Const ("Script.SubProblem",_)"*)
|
neuper@41983
|
591 |
| assod pt _ (Subproblem' ((domID,pblID,metID),_,_,_,_,f))
|
neuper@41983
|
592 |
(stac as Const ("Script.SubProblem",_) $ (Const ("Product_Type.Pair",_) $
|
neuper@41983
|
593 |
Free (dI',_) $ (Const ("Product_Type.Pair",_) $ pI' $ mI')) $ ags') =
|
neuper@41983
|
594 |
let
|
neuper@41983
|
595 |
val dI = ((implode o drop_last(*.."'"*) o Symbol.explode) dI')(*^""*);
|
neuper@37906
|
596 |
val thy = maxthy (assoc_thy dI) (rootthy pt);
|
neuper@41983
|
597 |
val pI = ((map (de_esc_underscore o free2str)) o isalist2list) pI';
|
neuper@41983
|
598 |
val mI = ((map (de_esc_underscore o free2str)) o isalist2list) mI';
|
neuper@41983
|
599 |
val ags = isalist2list ags';
|
neuper@41983
|
600 |
val (pI, pors, mI) =
|
neuper@41983
|
601 |
if mI = ["no_met"]
|
neuper@41983
|
602 |
then
|
neuper@41983
|
603 |
let
|
neuper@41983
|
604 |
val pors = (match_ags thy ((#ppc o get_pbt) pI) ags)
|
neuper@41983
|
605 |
handle ERROR "actual args do not match formal args"
|
neuper@41983
|
606 |
=> (match_ags_msg pI stac ags(*raise exn*);[]);
|
neuper@41983
|
607 |
val pI' = refine_ori' pors pI;
|
neuper@41983
|
608 |
in (pI', pors (*refinement over models with diff.prec only*),
|
neuper@41983
|
609 |
(hd o #met o get_pbt) pI')
|
neuper@41983
|
610 |
end
|
neuper@41983
|
611 |
else (pI, (match_ags thy ((#ppc o get_pbt) pI) ags)
|
neuper@41983
|
612 |
handle ERROR "actual args do not match formal args"
|
neuper@41983
|
613 |
=> (match_ags_msg pI stac ags(*raise exn*);[]), mI);
|
neuper@37906
|
614 |
val (fmz_, vals) = oris2fmz_vals pors;
|
neuper@41983
|
615 |
val {cas, ppc, thy,...} = get_pbt pI
|
neuper@41983
|
616 |
val dI = theory2theory' thy (*take dI from _refined_ pbl*)
|
neuper@41983
|
617 |
val dI = theory2theory' (maxthy (assoc_thy dI) (rootthy pt))
|
neuper@41992
|
618 |
val ctxt = dI |> Thy_Info.get_theory |> ProofContext.init_global
|
neuper@41992
|
619 |
|> declare_constraints' vals
|
neuper@41983
|
620 |
val hdl =
|
neuper@41983
|
621 |
case cas of
|
neuper@41983
|
622 |
NONE => pblterm dI pI
|
neuper@41983
|
623 |
| SOME t => subst_atomic ((vars_of_pbl_' ppc) ~~~ vals) t
|
neuper@37906
|
624 |
val f = subpbl (strip_thy dI) pI
|
neuper@41983
|
625 |
in
|
neuper@41983
|
626 |
if domID = dI andalso pblID = pI
|
neuper@41990
|
627 |
then Ass (Subproblem' ((dI, pI, mI), pors, hdl, fmz_, ctxt, f), f)
|
neuper@41983
|
628 |
else NotAss
|
neuper@41983
|
629 |
end
|
neuper@37906
|
630 |
|
neuper@37906
|
631 |
| assod pt d m t =
|
neuper@41983
|
632 |
(if (!trace_script)
|
neuper@41983
|
633 |
then tracing("@@@ the 'tac_' proposed to apply does NOT match the leaf found in the script:\n"^
|
neuper@41983
|
634 |
"@@@ tac_ = "^(tac_2str m))
|
neuper@41983
|
635 |
else ();
|
neuper@41983
|
636 |
NotAss);
|
neuper@37906
|
637 |
|
neuper@37906
|
638 |
fun tac_2tac (Refine_Tacitly' (pI,_,_,_,_)) = Refine_Tacitly pI
|
neuper@37906
|
639 |
| tac_2tac (Model_Problem' (pI,_,_)) = Model_Problem
|
neuper@37906
|
640 |
| tac_2tac (Add_Given' (t,_)) = Add_Given t
|
neuper@37906
|
641 |
| tac_2tac (Add_Find' (t,_)) = Add_Find t
|
neuper@37906
|
642 |
| tac_2tac (Add_Relation' (t,_)) = Add_Relation t
|
neuper@37906
|
643 |
|
neuper@37906
|
644 |
| tac_2tac (Specify_Theory' dI) = Specify_Theory dI
|
neuper@37906
|
645 |
| tac_2tac (Specify_Problem' (dI,_)) = Specify_Problem dI
|
neuper@37906
|
646 |
| tac_2tac (Specify_Method' (dI,_,_)) = Specify_Method dI
|
neuper@37906
|
647 |
|
neuper@42018
|
648 |
| tac_2tac (Rewrite' (thy,rod,erls,put,(thmID,thm),f,(f',asm))) = Rewrite (thmID,thm)
|
neuper@37906
|
649 |
|
neuper@37906
|
650 |
| tac_2tac (Rewrite_Inst' (thy,rod,erls,put,sub,(thmID,thm),f,(f',asm)))=
|
neuper@42018
|
651 |
Rewrite_Inst (subst2subs sub,(thmID,thm))
|
neuper@37906
|
652 |
|
neuper@42018
|
653 |
| tac_2tac (Rewrite_Set' (thy,put,rls,f,(f',asm))) = Rewrite_Set (id_rls rls)
|
neuper@42018
|
654 |
| tac_2tac (Detail_Set' (thy,put,rls,f,(f',asm))) = Detail_Set (id_rls rls)
|
neuper@37906
|
655 |
|
neuper@37906
|
656 |
| tac_2tac (Rewrite_Set_Inst' (thy,put,sub,rls,f,(f',asm))) =
|
neuper@42018
|
657 |
Rewrite_Set_Inst (subst2subs sub,id_rls rls)
|
neuper@37906
|
658 |
| tac_2tac (Detail_Set_Inst' (thy,put,sub,rls,f,(f',asm))) =
|
neuper@42018
|
659 |
Detail_Set_Inst (subst2subs sub,id_rls rls)
|
neuper@37906
|
660 |
|
neuper@37906
|
661 |
| tac_2tac (Calculate' (thy,op_,t,(t',thm'))) = Calculate (op_)
|
neuper@37906
|
662 |
|
neuper@42018
|
663 |
| tac_2tac (Check_elementwise' (consts,pred,consts')) = Check_elementwise pred
|
neuper@37906
|
664 |
|
neuper@37906
|
665 |
| tac_2tac (Or_to_List' _) = Or_to_List
|
neuper@37906
|
666 |
| tac_2tac (Take' term) = Take (term2str term)
|
neuper@37906
|
667 |
| tac_2tac (Substitute' (subte, t, res)) = Substitute (subte2sube subte)
|
neuper@37906
|
668 |
|
neuper@37906
|
669 |
| tac_2tac (Tac_ (_,f,id,f')) = Tac id
|
neuper@37906
|
670 |
|
neuper@42018
|
671 |
| tac_2tac (Subproblem' ((domID, pblID, _), _, _, _,_ ,_)) = Subproblem (domID, pblID)
|
neuper@42018
|
672 |
| tac_2tac (Check_Postcond' (pblID, _)) = Check_Postcond pblID
|
neuper@37906
|
673 |
| tac_2tac Empty_Tac_ = Empty_Tac
|
neuper@37906
|
674 |
| tac_2tac m =
|
neuper@42018
|
675 |
error ("tac_2tac: not impl. for "^(tac_2str m));
|
neuper@37906
|
676 |
|
neuper@37906
|
677 |
|
neuper@37906
|
678 |
|
neuper@37906
|
679 |
|
neuper@37906
|
680 |
(** decompose tac_ to a rule and to (lhs,rhs)
|
neuper@41956
|
681 |
unly needed --- **)
|
neuper@37906
|
682 |
|
neuper@37906
|
683 |
val idT = Type ("Script.ID",[]);
|
neuper@37906
|
684 |
(*val tt = (term_of o the o (parse thy)) "square_equation_left::ID";
|
neuper@37906
|
685 |
type_of tt = idT;
|
neuper@37906
|
686 |
val it = true : bool
|
neuper@37906
|
687 |
*)
|
neuper@37938
|
688 |
|
neuper@37906
|
689 |
fun make_rule thy t =
|
neuper@37938
|
690 |
let val ct = cterm_of thy (Trueprop $ t)
|
neuper@38053
|
691 |
in Thm (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))
|
neuper@38053
|
692 |
(term_of ct), make_thm ct) end;
|
neuper@37906
|
693 |
|
neuper@37906
|
694 |
(* val (Rewrite_Inst'(thy',rod,rls,put,subs,(thmID,thm),f,(f',asm)))=m;
|
neuper@37906
|
695 |
*)
|
neuper@37906
|
696 |
(*decompose tac_ to a rule and to (lhs,rhs) for ets FIXME.12.03: obsolete!
|
neuper@37906
|
697 |
NOTE.12.03: also used for msg 'not locatable' ?!: 'Subproblem' missing !!!
|
neuper@37906
|
698 |
WN0508 only use in tac_2res, which uses only last return-value*)
|
neuper@37906
|
699 |
fun rep_tac_ (Rewrite_Inst'
|
neuper@37906
|
700 |
(thy',rod,rls,put,subs,(thmID,thm),f,(f',asm))) =
|
neuper@37906
|
701 |
let val fT = type_of f;
|
neuper@37906
|
702 |
val b = if put then HOLogic.true_const else HOLogic.false_const;
|
neuper@37906
|
703 |
val sT = (type_of o fst o hd) subs;
|
neuper@37906
|
704 |
val subs' = list2isalist (HOLogic.mk_prodT (sT, sT))
|
neuper@37906
|
705 |
(map HOLogic.mk_prod subs);
|
neuper@37906
|
706 |
val sT' = type_of subs';
|
neuper@37906
|
707 |
val lhs = Const ("Script.Rewrite'_Inst",[sT',idT,(*fT*)bool,fT] ---> fT)
|
neuper@37906
|
708 |
$ subs' $ Free (thmID,idT) $ b $ f;
|
neuper@37906
|
709 |
in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end
|
neuper@37906
|
710 |
(*Fehlersuche 25.4.01
|
neuper@37906
|
711 |
(a)----- als String zusammensetzen:
|
neuper@38053
|
712 |
ML> term2str f;
|
neuper@37906
|
713 |
val it = "d_d x #4 + d_d x (x ^^^ #2 + #3 * x)" : string
|
neuper@38053
|
714 |
ML> term2str f';
|
neuper@37906
|
715 |
val it = "#0 + d_d x (x ^^^ #2 + #3 * x)" : string
|
neuper@37906
|
716 |
ML> subs;
|
neuper@37906
|
717 |
val it = [(Free ("bdv","RealDef.real"),Free ("x","RealDef.real"))] : subst
|
neuper@37906
|
718 |
> val tt = (term_of o the o (parse thy))
|
neuper@37906
|
719 |
"(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))";
|
neuper@37906
|
720 |
> atomty tt;
|
neuper@38053
|
721 |
ML> tracing (term2str tt);
|
neuper@37906
|
722 |
(Rewrite_Inst [(bdv,x)] diff_const False d_d x #4 + d_d x (x ^^^ #2 + #3 * x)) =
|
neuper@37906
|
723 |
#0 + d_d x (x ^^^ #2 + #3 * x)
|
neuper@37906
|
724 |
|
neuper@37906
|
725 |
(b)----- laut rep_tac_:
|
neuper@37906
|
726 |
> val ttt=HOLogic.mk_eq (lhs,f');
|
neuper@37906
|
727 |
> atomty ttt;
|
neuper@37906
|
728 |
|
neuper@37906
|
729 |
|
neuper@37906
|
730 |
(*Fehlersuche 1-2Monate vor 4.01:*)
|
neuper@37906
|
731 |
> val tt = (term_of o the o (parse thy))
|
neuper@37906
|
732 |
"Rewrite_Inst[(bdv,x)]square_equation_left True(x=#1+#2)";
|
neuper@37906
|
733 |
> atomty tt;
|
neuper@37906
|
734 |
|
neuper@37906
|
735 |
> val f = (term_of o the o (parse thy)) "x=#1+#2";
|
neuper@37906
|
736 |
> val f' = (term_of o the o (parse thy)) "x=#3";
|
neuper@37906
|
737 |
> val subs = [((term_of o the o (parse thy)) "bdv",
|
neuper@37906
|
738 |
(term_of o the o (parse thy)) "x")];
|
neuper@37906
|
739 |
> val sT = (type_of o fst o hd) subs;
|
neuper@37906
|
740 |
> val subs' = list2isalist (HOLogic.mk_prodT (sT, sT))
|
neuper@37906
|
741 |
(map HOLogic.mk_prod subs);
|
neuper@37906
|
742 |
> val sT' = type_of subs';
|
neuper@37906
|
743 |
> val lhs = Const ("Script.Rewrite'_Inst",[sT',idT,fT,fT] ---> fT)
|
neuper@37906
|
744 |
$ subs' $ Free (thmID,idT) $ HOLogic.true_const $ f;
|
neuper@37906
|
745 |
> lhs = tt;
|
neuper@37906
|
746 |
val it = true : bool
|
neuper@37906
|
747 |
> rep_tac_ (Rewrite_Inst'
|
neuper@38058
|
748 |
("Script","tless_true","eval_rls",false,subs,
|
neuper@37906
|
749 |
("square_equation_left",""),f,(f',[])));
|
neuper@37906
|
750 |
*)
|
neuper@37906
|
751 |
| rep_tac_ (Rewrite' (thy',rod,rls,put,(thmID,thm),f,(f',asm)))=
|
neuper@37906
|
752 |
let
|
neuper@37906
|
753 |
val fT = type_of f;
|
neuper@37906
|
754 |
val b = if put then HOLogic.true_const else HOLogic.false_const;
|
neuper@37906
|
755 |
val lhs = Const ("Script.Rewrite",[idT,HOLogic.boolT,fT] ---> fT)
|
neuper@37906
|
756 |
$ Free (thmID,idT) $ b $ f;
|
neuper@37906
|
757 |
in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end
|
neuper@37906
|
758 |
(*
|
neuper@37906
|
759 |
> val tt = (term_of o the o (parse thy)) (*____ ____..test*)
|
neuper@37906
|
760 |
"Rewrite square_equation_left True (x=#1+#2) = (x=#3)";
|
neuper@37906
|
761 |
|
neuper@37906
|
762 |
> val f = (term_of o the o (parse thy)) "x=#1+#2";
|
neuper@37906
|
763 |
> val f' = (term_of o the o (parse thy)) "x=#3";
|
neuper@37906
|
764 |
> val Thm (id,thm) =
|
neuper@37906
|
765 |
rep_tac_ (Rewrite'
|
neuper@38058
|
766 |
("Script","tless_true","eval_rls",false,
|
neuper@37906
|
767 |
("square_equation_left",""),f,(f',[])));
|
neuper@37926
|
768 |
> val SOME ct = parse thy
|
neuper@37906
|
769 |
"Rewrite square_equation_left True (x=#1+#2)";
|
neuper@37906
|
770 |
> rewrite_ Script.thy tless_true eval_rls true thm ct;
|
neuper@37926
|
771 |
val it = SOME ("x = #3",[]) : (cterm * cterm list) option
|
neuper@37906
|
772 |
*)
|
neuper@37906
|
773 |
| rep_tac_ (Rewrite_Set_Inst'
|
neuper@37906
|
774 |
(thy',put,subs,rls,f,(f',asm))) =
|
neuper@37906
|
775 |
(e_rule, (e_term, f'))
|
neuper@37906
|
776 |
(*WN050824: type error ...
|
neuper@37906
|
777 |
let val fT = type_of f;
|
neuper@37906
|
778 |
val sT = (type_of o fst o hd) subs;
|
neuper@37906
|
779 |
val subs' = list2isalist (HOLogic.mk_prodT (sT, sT))
|
neuper@37906
|
780 |
(map HOLogic.mk_prod subs);
|
neuper@37906
|
781 |
val sT' = type_of subs';
|
neuper@37906
|
782 |
val b = if put then HOLogic.true_const else HOLogic.false_const
|
neuper@37906
|
783 |
val lhs = Const ("Script.Rewrite'_Set'_Inst",
|
neuper@37906
|
784 |
[sT',idT,fT,fT] ---> fT)
|
neuper@37906
|
785 |
$ subs' $ Free (id_rls rls,idT) $ b $ f;
|
neuper@37906
|
786 |
in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end*)
|
neuper@37906
|
787 |
(* ... vals from Rewrite_Inst' ...
|
neuper@37906
|
788 |
> rep_tac_ (Rewrite_Set_Inst'
|
neuper@38058
|
789 |
("Script",false,subs,
|
neuper@37906
|
790 |
"isolate_bdv",f,(f',[])));
|
neuper@37906
|
791 |
*)
|
neuper@37906
|
792 |
(* val (Rewrite_Set' (thy',put,rls,f,(f',asm)))=m;
|
neuper@37906
|
793 |
*)
|
neuper@37906
|
794 |
| rep_tac_ (Rewrite_Set' (thy',put,rls,f,(f',asm)))=
|
neuper@37906
|
795 |
let val fT = type_of f;
|
neuper@37906
|
796 |
val b = if put then HOLogic.true_const else HOLogic.false_const;
|
neuper@37906
|
797 |
val lhs = Const ("Script.Rewrite'_Set",[idT,bool,fT] ---> fT)
|
neuper@37906
|
798 |
$ Free (id_rls rls,idT) $ b $ f;
|
neuper@37906
|
799 |
in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end
|
neuper@37906
|
800 |
(* 13.3.01:
|
neuper@37906
|
801 |
val thy = assoc_thy thy';
|
neuper@37906
|
802 |
val t = HOLogic.mk_eq (lhs,f');
|
neuper@37906
|
803 |
make_rule thy t;
|
neuper@37906
|
804 |
--------------------------------------------------
|
neuper@37906
|
805 |
val lll = (term_of o the o (parse thy))
|
neuper@37906
|
806 |
"Rewrite_Set SqRoot_simplify False (d_d x (x ^^^ #2 + #3 * x) + d_d x #4)";
|
neuper@37906
|
807 |
|
neuper@37906
|
808 |
--------------------------------------------------
|
neuper@37906
|
809 |
> val f = (term_of o the o (parse thy)) "x=#1+#2";
|
neuper@37906
|
810 |
> val f' = (term_of o the o (parse thy)) "x=#3";
|
neuper@37906
|
811 |
> val Thm (id,thm) =
|
neuper@37906
|
812 |
rep_tac_ (Rewrite_Set'
|
neuper@38058
|
813 |
("Script",false,"SqRoot_simplify",f,(f',[])));
|
neuper@37906
|
814 |
val id = "(Rewrite_Set SqRoot_simplify True x = #1 + #2) = (x = #3)" : string
|
neuper@37906
|
815 |
val thm = "(Rewrite_Set SqRoot_simplify True x = #1 + #2) = (x = #3)" : thm
|
neuper@37906
|
816 |
*)
|
neuper@37906
|
817 |
| rep_tac_ (Calculate' (thy',op_,f,(f',thm')))=
|
neuper@37906
|
818 |
let val fT = type_of f;
|
neuper@37906
|
819 |
val lhs = Const ("Script.Calculate",[idT,fT] ---> fT)
|
neuper@37906
|
820 |
$ Free (op_,idT) $ f
|
neuper@37906
|
821 |
in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end
|
neuper@37906
|
822 |
(*
|
neuper@37906
|
823 |
> val lhs'=(term_of o the o (parse thy))"Calculate plus (#1+#2)";
|
neuper@37906
|
824 |
... test-root-equ.sml: calculate ...
|
neuper@37922
|
825 |
> val Appl m'=applicable_in p pt (Calculate "PLUS");
|
neuper@37906
|
826 |
> val (lhs,_)=tac_2etac m';
|
neuper@37906
|
827 |
> lhs'=lhs;
|
neuper@37906
|
828 |
val it = true : bool*)
|
neuper@37906
|
829 |
| rep_tac_ (Check_elementwise' (t,str,(t',asm))) = (Erule, (e_term, t'))
|
neuper@41983
|
830 |
| rep_tac_ (Subproblem' (_, _, _, _, _, t')) = (Erule, (e_term, t'))
|
neuper@37906
|
831 |
| rep_tac_ (Take' (t')) = (Erule, (e_term, t'))
|
neuper@37906
|
832 |
| rep_tac_ (Substitute' (subst,t,t')) = (Erule, (t, t'))
|
neuper@37906
|
833 |
| rep_tac_ (Or_to_List' (t, t')) = (Erule, (t, t'))
|
neuper@38031
|
834 |
| rep_tac_ m = error ("rep_tac_: not impl.for "^
|
neuper@37906
|
835 |
(tac_2str m));
|
neuper@37906
|
836 |
|
neuper@37906
|
837 |
(*"N.3.6.03------
|
neuper@37906
|
838 |
fun tac_2rule m = (fst o rep_tac_) m;
|
neuper@37906
|
839 |
fun tac_2etac m = (snd o rep_tac_) m;
|
neuper@37906
|
840 |
fun tac_2tac m = (fst o snd o rep_tac_) m;*)
|
neuper@37906
|
841 |
fun tac_2res m = (snd o snd o rep_tac_) m;(*ONLYuse of rep_tac_
|
neuper@37906
|
842 |
FIXXXXME: simplify rep_tac_*)
|
neuper@37906
|
843 |
|
neuper@37906
|
844 |
|
neuper@41996
|
845 |
(* handle a leaf at the end of recursive descent:
|
neuper@37906
|
846 |
a leaf is either a tactic or an 'exp' in 'let v = expr'
|
neuper@37906
|
847 |
where 'exp' does not contain a tactic.
|
neuper@37906
|
848 |
handling a leaf comprises
|
neuper@37906
|
849 |
(1) 'subst_stacexpr' substitute env and complete curried tactic
|
neuper@37906
|
850 |
(2) rewrite the leaf by 'srls'
|
neuper@41996
|
851 |
*)
|
neuper@37906
|
852 |
fun handle_leaf call thy srls E a v t =
|
neuper@41996
|
853 |
(*WN050916 'upd_env_opt' is a blind copy from previous version*)
|
neuper@41996
|
854 |
case subst_stacexpr E a v t of
|
neuper@41996
|
855 |
(a', STac stac) => (*script-tactic*)
|
neuper@41996
|
856 |
let val stac' =
|
neuper@41996
|
857 |
eval_listexpr_ (assoc_thy thy) srls (subst_atomic (upd_env_opt E (a,v)) stac)
|
neuper@41996
|
858 |
in
|
neuper@41996
|
859 |
(if (!trace_script)
|
neuper@41996
|
860 |
then tracing ("@@@ "^call^" leaf '"^term2str t^"' ---> STac '"^term2str stac'^"'")
|
neuper@41996
|
861 |
else ();
|
neuper@41996
|
862 |
(a', STac stac'))
|
neuper@41996
|
863 |
end
|
neuper@41996
|
864 |
| (a', Expr lexpr) => (*leaf-expression*)
|
neuper@41996
|
865 |
let val lexpr' =
|
neuper@41996
|
866 |
eval_listexpr_ (assoc_thy thy) srls (subst_atomic (upd_env_opt E (a,v)) lexpr)
|
neuper@41996
|
867 |
in
|
neuper@41996
|
868 |
(if (!trace_script)
|
neuper@41996
|
869 |
then tracing("@@@ "^call^" leaf '"^term2str t^"' ---> Expr '"^term2str lexpr'^"'")
|
neuper@41996
|
870 |
else ();
|
neuper@41996
|
871 |
(a', Expr lexpr'))
|
neuper@41996
|
872 |
end;
|
neuper@37906
|
873 |
|
neuper@37906
|
874 |
|
neuper@37906
|
875 |
(** locate an applicable stactic in a script **)
|
neuper@37906
|
876 |
|
neuper@37906
|
877 |
datatype assoc = (*ExprVal in the sense of denotational semantics*)
|
neuper@37906
|
878 |
Assoc of (*the stac is associated, strongly or weakly*)
|
neuper@37906
|
879 |
scrstate * (*the current; returned for next_tac etc. outside ass* *)
|
neuper@37906
|
880 |
(step list) (*list of steps done until associated stac found;
|
neuper@37906
|
881 |
initiated with the data for doing the 1st step,
|
neuper@37906
|
882 |
thus the head holds these data further on,
|
neuper@37906
|
883 |
while the tail holds steps finished (incl.scrstate in ptree)*)
|
neuper@37906
|
884 |
| NasApp of (*stac not associated, but applicable, ptree-node generated*)
|
neuper@37906
|
885 |
scrstate * (step list)
|
neuper@37906
|
886 |
| NasNap of (*stac not associated, not applicable, nothing generated;
|
neuper@37906
|
887 |
for distinction in Or, for leaving iterations, leaving Seq,
|
neuper@37906
|
888 |
evaluate scriptexpressions*)
|
neuper@37906
|
889 |
term * env;
|
neuper@37906
|
890 |
fun assoc2str (Assoc _) = "Assoc"
|
neuper@37906
|
891 |
| assoc2str (NasNap _) = "NasNap"
|
neuper@37906
|
892 |
| assoc2str (NasApp _) = "NasApp";
|
neuper@37906
|
893 |
|
neuper@37906
|
894 |
|
neuper@37906
|
895 |
datatype asap = (*arg. of assy _only_ for distinction w.r.t. Or*)
|
neuper@37906
|
896 |
Aundef (*undefined: set only by (topmost) Or*)
|
neuper@37906
|
897 |
| AssOnly (*do not execute appl stacs - there could be an associated
|
neuper@37906
|
898 |
in parallel Or-branch*)
|
neuper@37906
|
899 |
| AssGen; (*no Ass(Weak) found within Or, thus
|
neuper@37906
|
900 |
search for _applicable_ stacs, execute and generate pt*)
|
neuper@37906
|
901 |
(*this constructions doesnt allow arbitrary nesting of Or !!!*)
|
neuper@37906
|
902 |
|
neuper@37906
|
903 |
|
neuper@42092
|
904 |
(*assy, ass_up, astep_up scan for locate_gen in a script.
|
neuper@37906
|
905 |
search is clearly separated into (1)-(2):
|
neuper@37906
|
906 |
(1) assy is recursive descent;
|
neuper@37906
|
907 |
(2) ass_up resumes interpretation at a location somewhere in the script;
|
neuper@37906
|
908 |
astep_up does only get to the parentnode of the scriptexpr.
|
neuper@37906
|
909 |
consequence:
|
neuper@37906
|
910 |
* call of (2) means _always_ that in this branch below
|
neuper@41996
|
911 |
there was an appl.stac (Repeat, Or e1, ...) found by the previous step.
|
neuper@37906
|
912 |
*)
|
neuper@41996
|
913 |
fun assy ya (is as (E,l,a,v,S,b),ss) (Const ("HOL.Let",_) $ e $ (Abs (id,T,body))) =
|
neuper@41996
|
914 |
(case assy ya ((E , l@[L,R], a,v,S,b),ss) e of
|
neuper@41996
|
915 |
NasApp ((E',l,a,v,S,bb),ss) =>
|
neuper@41996
|
916 |
let
|
neuper@41996
|
917 |
val id' = mk_Free (id, T);
|
neuper@41996
|
918 |
val E' = upd_env E' (id', v);
|
neuper@41996
|
919 |
in assy ya ((E', l@[R,D], a,v,S,b),ss) body end
|
neuper@41996
|
920 |
| NasNap (v,E) =>
|
neuper@41996
|
921 |
let
|
neuper@41996
|
922 |
val id' = mk_Free (id, T);
|
neuper@41996
|
923 |
val E' = upd_env E (id', v);
|
neuper@41996
|
924 |
in assy ya ((E', l@[R,D], a,v,S,b),ss) body end
|
neuper@41996
|
925 |
| ay => ay)
|
neuper@37906
|
926 |
|
neuper@41996
|
927 |
| assy (ya as (((thy,srls),_),_)) ((E,l,_,v,S,b),ss) (Const ("Script.While",_) $ c $ e $ a) =
|
neuper@41996
|
928 |
(if eval_true_ thy srls (subst_atomic (upd_env E (a,v)) c)
|
neuper@41996
|
929 |
then assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e
|
neuper@41996
|
930 |
else NasNap (v, E))
|
neuper@41996
|
931 |
| assy (ya as (((thy,srls),_),_)) ((E,l,a,v,S,b),ss) (Const ("Script.While",_) $ c $ e) =
|
neuper@41996
|
932 |
(if eval_true_ thy srls (subst_atomic (upd_env_opt E (a,v)) c)
|
neuper@41996
|
933 |
then assy ya ((E, l@[R], a,v,S,b),ss) e
|
neuper@41996
|
934 |
else NasNap (v, E))
|
neuper@37906
|
935 |
|
neuper@41996
|
936 |
| assy (ya as (((thy,srls),_),_)) ((E,l,a,v,S,b),ss) (Const ("If",_) $ c $ e1 $ e2) =
|
neuper@41996
|
937 |
(if eval_true_ thy srls (subst_atomic (upd_env_opt E (a,v)) c)
|
neuper@41996
|
938 |
then assy ya ((E, l@[L,R], a,v,S,b),ss) e1
|
neuper@41996
|
939 |
else assy ya ((E, l@[ R], a,v,S,b),ss) e2)
|
neuper@37906
|
940 |
|
neuper@37906
|
941 |
| assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Try",_) $ e $ a) =
|
neuper@41996
|
942 |
(case assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e of
|
neuper@41996
|
943 |
ay => ay)
|
neuper@41996
|
944 |
| assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Try",_) $ e) =
|
neuper@41996
|
945 |
(case assy ya ((E, l@[R], a,v,S,b),ss) e of
|
neuper@41996
|
946 |
ay => ay)
|
neuper@37906
|
947 |
|
neuper@37906
|
948 |
| assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Seq",_) $e1 $ e2 $ a) =
|
neuper@41996
|
949 |
(case assy ya ((E, l@[L,L,R], SOME a,v,S,b),ss) e1 of
|
neuper@41996
|
950 |
NasNap (v, E) => assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e2
|
neuper@41996
|
951 |
| NasApp ((E,_,_,v,_,_),ss) => assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e2
|
neuper@37906
|
952 |
| ay => ay)
|
neuper@37906
|
953 |
| assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Seq",_) $e1 $ e2) =
|
neuper@41996
|
954 |
(case assy ya ((E, l@[L,R], a,v,S,b),ss) e1 of
|
neuper@41996
|
955 |
NasNap (v, E) => assy ya ((E, l@[R], a,v,S,b),ss) e2
|
neuper@41996
|
956 |
| NasApp ((E,_,_,v,_,_),ss) => assy ya ((E, l@[R], a,v,S,b),ss) e2
|
neuper@37906
|
957 |
| ay => ay)
|
neuper@37906
|
958 |
|
neuper@37906
|
959 |
| assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Repeat",_) $ e $ a) =
|
neuper@41996
|
960 |
assy ya ((E,(l@[L,R]),SOME a,v,S,b),ss) e
|
neuper@41996
|
961 |
| assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Repeat",_) $ e) =
|
neuper@41996
|
962 |
assy ya ((E,(l@[R]),a,v,S,b),ss) e
|
neuper@37906
|
963 |
|
neuper@37906
|
964 |
| assy (y, Aundef) ((E,l,_,v,S,b),ss) (Const ("Script.Or",_) $e1 $ e2 $ a) =
|
neuper@41996
|
965 |
(case assy (y, AssOnly) ((E,(l@[L,L,R]),SOME a,v,S,b),ss) e1 of
|
neuper@37906
|
966 |
NasNap (v, E) =>
|
neuper@41996
|
967 |
(case assy (y, AssOnly) ((E,(l@[L,R]),SOME a,v,S,b),ss) e2 of
|
neuper@41996
|
968 |
NasNap (v, E) =>
|
neuper@41996
|
969 |
(case assy (y, AssGen) ((E,(l@[L,L,R]),SOME a,v,S,b),ss) e1 of
|
neuper@41996
|
970 |
NasNap (v, E) =>
|
neuper@41996
|
971 |
assy (y, AssGen) ((E, (l@[L,R]), SOME a,v,S,b),ss) e2
|
neuper@41996
|
972 |
| ay => ay)
|
neuper@41996
|
973 |
| ay =>(ay))
|
neuper@38031
|
974 |
| NasApp _ => error ("assy: FIXXXME ///must not return NasApp///")
|
neuper@37906
|
975 |
| ay => (ay))
|
neuper@37906
|
976 |
| assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Or",_) $e1 $ e2) =
|
neuper@41996
|
977 |
(case assy ya ((E,(l@[L,R]),a,v,S,b),ss) e1 of
|
neuper@41996
|
978 |
NasNap (v, E) => assy ya ((E,(l@[R]),a,v,S,b),ss) e2
|
neuper@37906
|
979 |
| ay => (ay))
|
neuper@37906
|
980 |
|
neuper@37906
|
981 |
| assy (((thy',sr),d),ap) (is as (E,l,a,v,S,b), (m,_,pt,(p,p_),c)::ss) t =
|
neuper@41996
|
982 |
(case handle_leaf "locate" thy' sr E a v t of
|
neuper@41996
|
983 |
(a', Expr s) =>
|
neuper@41996
|
984 |
(NasNap (eval_listexpr_ (assoc_thy thy') sr
|
neuper@41996
|
985 |
(subst_atomic (upd_env_opt E (a',v)) t), E))
|
neuper@41996
|
986 |
| (a', STac stac) =>
|
neuper@41996
|
987 |
let
|
neuper@41996
|
988 |
val ctxt = get_ctxt pt (p,p_)
|
neuper@41996
|
989 |
val p' =
|
neuper@41996
|
990 |
case p_ of Frm => p
|
neuper@41996
|
991 |
| Res => lev_on p
|
neuper@41996
|
992 |
| _ => error ("assy: call by " ^ pos'2str (p,p_));
|
neuper@41996
|
993 |
in
|
neuper@41996
|
994 |
case assod pt d m stac of
|
neuper@41996
|
995 |
Ass (m,v') =>
|
neuper@41996
|
996 |
let val (p'',c',f',pt') =
|
neuper@41996
|
997 |
generate1 (assoc_thy thy') m (ScrState (E,l,a',v',S,true), ctxt) (p',p_) pt;
|
neuper@41996
|
998 |
in Assoc ((E,l,a',v',S,true), (m,f',pt',p'',c @ c')::ss) end
|
neuper@41996
|
999 |
| AssWeak (m,v') =>
|
neuper@41996
|
1000 |
let val (p'',c',f',pt') =
|
neuper@41996
|
1001 |
generate1 (assoc_thy thy') m (ScrState (E,l,a',v',S,false), ctxt) (p',p_) pt;
|
neuper@41996
|
1002 |
in Assoc ((E,l,a',v',S,false), (m,f',pt',p'',c @ c')::ss) end
|
neuper@41996
|
1003 |
| NotAss =>
|
neuper@41996
|
1004 |
(case ap of (*switch for Or: 1st AssOnly, 2nd AssGen*)
|
neuper@41996
|
1005 |
AssOnly => (NasNap (v, E))
|
neuper@41996
|
1006 |
| gen =>
|
neuper@41996
|
1007 |
(case applicable_in (p,p_) pt (stac2tac pt (assoc_thy thy') stac) of
|
neuper@41996
|
1008 |
Appl m' =>
|
neuper@41996
|
1009 |
let
|
neuper@41996
|
1010 |
val is = (E,l,a',tac_2res m',S,false(*FIXXXME.WN0?*))
|
neuper@41996
|
1011 |
val (p'',c',f',pt') =
|
neuper@41996
|
1012 |
generate1 (assoc_thy thy') m' (ScrState is, ctxt) (p',p_) pt;
|
neuper@41996
|
1013 |
in NasApp (is,(m,f',pt',p'',c @ c')::ss) end
|
neuper@41996
|
1014 |
| Notappl _ => (NasNap (v, E))
|
neuper@41996
|
1015 |
)
|
neuper@41996
|
1016 |
)
|
neuper@41996
|
1017 |
end);
|
neuper@37906
|
1018 |
|
neuper@42133
|
1019 |
fun ass_up (ys as (y,s,Script sc,d)) (is as (E,l,a,v,S,b),ss) (Const ("HOL.Let",_) $ _) =
|
neuper@42133
|
1020 |
let
|
neuper@42133
|
1021 |
(*val _= tracing("### ass_up1 Let$e: is=")
|
neuper@42133
|
1022 |
val _= tracing(istate2str (ScrState is))*)
|
neuper@42133
|
1023 |
val l = drop_last l; (*comes from e, goes to Abs*)
|
neuper@42133
|
1024 |
val (Const ("HOL.Let",_) $ e $ (Abs (i,T,body))) = go l sc;
|
neuper@42133
|
1025 |
val i = mk_Free (i, T);
|
neuper@42133
|
1026 |
val E = upd_env E (i, v);
|
neuper@42133
|
1027 |
(*val _=tracing("### ass_up2 Let$e: E="^(subst2str E));*)
|
neuper@42133
|
1028 |
in case assy (((y,s),d),Aundef) ((E, l@[R,D], a,v,S,b),ss) body of
|
neuper@42133
|
1029 |
Assoc iss => Assoc iss
|
neuper@42133
|
1030 |
| NasApp iss => astep_up ys iss
|
neuper@42133
|
1031 |
| NasNap (v, E) => astep_up ys ((E,l,a,v,S,b),ss) end
|
neuper@37906
|
1032 |
|
neuper@37906
|
1033 |
| ass_up ys (iss as (is,_)) (Abs (_,_,_)) =
|
neuper@42133
|
1034 |
((*tracing("### ass_up Abs: is=");
|
neuper@42133
|
1035 |
tracing(istate2str (ScrState is));*)
|
neuper@42133
|
1036 |
astep_up ys iss) (*TODO 5.9.00: env ?*)
|
neuper@37906
|
1037 |
|
neuper@41968
|
1038 |
| ass_up ys (iss as (is,_)) (Const ("HOL.Let",_) $ e $ (Abs (i,T,b)))=
|
neuper@42133
|
1039 |
((*tracing("### ass_up Let $ e $ Abs: is=");
|
neuper@42133
|
1040 |
tracing(istate2str (ScrState is));*)
|
neuper@42133
|
1041 |
astep_up ys iss) (*TODO 5.9.00: env ?*)
|
neuper@37906
|
1042 |
|
neuper@37906
|
1043 |
| ass_up ysa iss (Const ("Script.Seq",_) $ _ $ _ $ _) =
|
neuper@42133
|
1044 |
astep_up ysa iss (*all has been done in (*2*) below*)
|
neuper@37906
|
1045 |
|
neuper@37906
|
1046 |
| ass_up ysa iss (Const ("Script.Seq",_) $ _ $ _) =
|
neuper@42133
|
1047 |
astep_up ysa iss (*2*: comes from e2*)
|
neuper@37906
|
1048 |
|
neuper@37906
|
1049 |
| ass_up (ysa as (y,s,Script sc,d)) (is as (E,l,a,v,S,b),ss)
|
neuper@37906
|
1050 |
(Const ("Script.Seq",_) $ _ ) = (*2*: comes from e1, goes to e2*)
|
neuper@37906
|
1051 |
(* val ((ysa as (y,s,Script sc,d)), (is as (E,l,a,v,S,b),ss),
|
neuper@37906
|
1052 |
(Const ("Script.Seq",_) $ _ )) =
|
neuper@37906
|
1053 |
(ys, ((E,up,a,v,S,b),ss), (go up sc));
|
neuper@37906
|
1054 |
*)
|
neuper@37906
|
1055 |
let val up = drop_last l;
|
neuper@37906
|
1056 |
val Const ("Script.Seq",_) $ _ $ e2 = go up sc
|
neuper@38015
|
1057 |
(*val _= tracing("### ass_up Seq$e: is=")
|
neuper@38015
|
1058 |
val _= tracing(istate2str (ScrState is))*)
|
neuper@37906
|
1059 |
in case assy (((y,s),d),Aundef) ((E, up@[R], a,v,S,b),ss) e2 of
|
neuper@37906
|
1060 |
NasNap (v,E) => astep_up ysa ((E,up,a,v,S,b),ss)
|
neuper@37906
|
1061 |
| NasApp iss => astep_up ysa iss
|
neuper@37906
|
1062 |
| ay => ay end
|
neuper@37906
|
1063 |
|
neuper@37906
|
1064 |
(* val (ysa, iss, (Const ("Script.Try",_) $ e $ _)) =
|
neuper@37906
|
1065 |
(ys, ((E,up,a,v,S,b),ss), (go up sc));
|
neuper@37906
|
1066 |
*)
|
neuper@37906
|
1067 |
| ass_up ysa iss (Const ("Script.Try",_) $ e $ _) =
|
neuper@37906
|
1068 |
astep_up ysa iss
|
neuper@37906
|
1069 |
|
neuper@37906
|
1070 |
(* val (ysa, iss, (Const ("Script.Try",_) $ e)) =
|
neuper@37906
|
1071 |
(ys, ((E,up,a,v,S,b),ss), (go up sc));
|
neuper@37906
|
1072 |
*)
|
neuper@37906
|
1073 |
| ass_up ysa iss (Const ("Script.Try",_) $ e) =
|
neuper@38015
|
1074 |
((*tracing("### ass_up Try $ e");*)
|
neuper@37906
|
1075 |
astep_up ysa iss)
|
neuper@37906
|
1076 |
|
neuper@37906
|
1077 |
| ass_up (ys as (y,s,_,d)) ((E,l,_,v,S,b),ss)
|
neuper@37906
|
1078 |
(*(Const ("Script.While",_) $ c $ e $ a) = WN050930 blind fix*)
|
neuper@37906
|
1079 |
(t as Const ("Script.While",_) $ c $ e $ a) =
|
neuper@38015
|
1080 |
((*tracing("### ass_up: While c= "^
|
neuper@37906
|
1081 |
(term2str (subst_atomic (upd_env E (a,v)) c)));*)
|
neuper@37906
|
1082 |
if eval_true_ y s (subst_atomic (upd_env E (a,v)) c)
|
neuper@37926
|
1083 |
then (case assy (((y,s),d),Aundef) ((E, l@[L,R], SOME a,v,S,b),ss) e of
|
neuper@37926
|
1084 |
NasNap (v,E') => astep_up ys ((E',l, SOME a,v,S,b),ss)
|
neuper@37906
|
1085 |
| NasApp ((E',l,a,v,S,b),ss) =>
|
neuper@37906
|
1086 |
ass_up ys ((E',l,a,v,S,b),ss) t (*WN050930 't' was not assigned*)
|
neuper@37906
|
1087 |
| ay => ay)
|
neuper@37926
|
1088 |
else astep_up ys ((E,l, SOME a,v,S,b),ss)
|
neuper@37906
|
1089 |
)
|
neuper@37906
|
1090 |
|
neuper@37906
|
1091 |
| ass_up (ys as (y,s,_,d)) ((E,l,a,v,S,b),ss)
|
neuper@37906
|
1092 |
(*(Const ("Script.While",_) $ c $ e) = WN050930 blind fix*)
|
neuper@37906
|
1093 |
(t as Const ("Script.While",_) $ c $ e) =
|
neuper@37906
|
1094 |
if eval_true_ y s (subst_atomic (upd_env_opt E (a,v)) c)
|
neuper@37906
|
1095 |
then (case assy (((y,s),d),Aundef) ((E, l@[R], a,v,S,b),ss) e of
|
neuper@37906
|
1096 |
NasNap (v,E') => astep_up ys ((E',l, a,v,S,b),ss)
|
neuper@37906
|
1097 |
| NasApp ((E',l,a,v,S,b),ss) =>
|
neuper@37906
|
1098 |
ass_up ys ((E',l,a,v,S,b),ss) t (*WN050930 't' was not assigned*)
|
neuper@37906
|
1099 |
| ay => ay)
|
neuper@37906
|
1100 |
else astep_up ys ((E,l, a,v,S,b),ss)
|
neuper@37906
|
1101 |
|
neuper@37906
|
1102 |
| ass_up y iss (Const ("If",_) $ _ $ _ $ _) = astep_up y iss
|
neuper@37906
|
1103 |
|
neuper@37906
|
1104 |
| ass_up (ys as (y,s,_,d)) ((E,l,_,v,S,b),ss)
|
neuper@37906
|
1105 |
(t as Const ("Script.Repeat",_) $ e $ a) =
|
neuper@37926
|
1106 |
(case assy (((y,s),d), Aundef) ((E, (l@[L,R]), SOME a,v,S,b),ss) e of
|
neuper@37926
|
1107 |
NasNap (v,E') => astep_up ys ((E',l, SOME a,v,S,b),ss)
|
neuper@37906
|
1108 |
| NasApp ((E',l,a,v,S,b),ss) =>
|
neuper@37906
|
1109 |
ass_up ys ((E',l,a,v,S,b),ss) t
|
neuper@37906
|
1110 |
| ay => ay)
|
neuper@37906
|
1111 |
|
neuper@37906
|
1112 |
| ass_up (ys as (y,s,_,d)) (is as ((E,l,a,v,S,b),ss))
|
neuper@37906
|
1113 |
(t as Const ("Script.Repeat",_) $ e) =
|
neuper@37906
|
1114 |
(case assy (((y,s),d), Aundef) ((E, (l@[R]), a,v,S,b),ss) e of
|
neuper@37906
|
1115 |
NasNap (v', E') => astep_up ys ((E',l,a,v',S,b),ss)
|
neuper@37906
|
1116 |
| NasApp ((E',l,a,v',S,bb),ss) =>
|
neuper@37906
|
1117 |
ass_up ys ((E',l,a,v',S,b),ss) t
|
neuper@37906
|
1118 |
| ay => ay)
|
neuper@37906
|
1119 |
|
neuper@37906
|
1120 |
| ass_up y iss (Const ("Script.Or",_) $ _ $ _ $ _) = astep_up y iss
|
neuper@37906
|
1121 |
|
neuper@37906
|
1122 |
| ass_up y iss (Const ("Script.Or",_) $ _ $ _) = astep_up y iss
|
neuper@37906
|
1123 |
|
neuper@37906
|
1124 |
| ass_up y ((E,l,a,v,S,b),ss) (Const ("Script.Or",_) $ _ ) =
|
neuper@37906
|
1125 |
astep_up y ((E, (drop_last l), a,v,S,b),ss)
|
neuper@37906
|
1126 |
|
neuper@37906
|
1127 |
| ass_up y iss t =
|
neuper@38031
|
1128 |
error ("ass_up not impl for t= "^(term2str t))
|
neuper@37906
|
1129 |
(* 9.6.03
|
neuper@37906
|
1130 |
val (ys as (_,_,Script sc,_), ss) =
|
neuper@37906
|
1131 |
((thy',srls,scr,d), [(m,EmptyMout,pt,p,[])]:step list);
|
neuper@37906
|
1132 |
astep_up ys ((E,l,a,v,S,b),ss);
|
neuper@37906
|
1133 |
val ((ys as (_,_,Script sc,_)), ((E,l,a,v,S,b),ss)) =
|
neuper@37906
|
1134 |
(ysa, iss);
|
neuper@37906
|
1135 |
val ((ys as (_,_,Script sc,_)), ((E,l,a,v,S,b),ss)) =
|
neuper@37906
|
1136 |
((thy',srls,scr,d), ((E,l,a,v,S,b), [(m,EmptyMout,pt,p,[])]));
|
neuper@37906
|
1137 |
*)
|
neuper@37906
|
1138 |
and astep_up (ys as (_,_,Script sc,_)) ((E,l,a,v,S,b),ss) =
|
neuper@37906
|
1139 |
if 1 < length l
|
neuper@37906
|
1140 |
then
|
neuper@37906
|
1141 |
let val up = drop_last l;
|
neuper@38015
|
1142 |
(*val _= tracing("### astep_up: E= "^env2str E);*)
|
neuper@37906
|
1143 |
in ass_up ys ((E,up,a,v,S,b),ss) (go up sc) end
|
neuper@37906
|
1144 |
else (NasNap (v, E))
|
neuper@37906
|
1145 |
;
|
neuper@37906
|
1146 |
|
neuper@37906
|
1147 |
|
neuper@37906
|
1148 |
|
neuper@37906
|
1149 |
|
neuper@37906
|
1150 |
|
neuper@37906
|
1151 |
(* use"ME/script.sml";
|
neuper@37906
|
1152 |
use"script.sml";
|
neuper@37906
|
1153 |
term2str (go up sc);
|
neuper@37906
|
1154 |
|
neuper@37906
|
1155 |
*)
|
neuper@37906
|
1156 |
|
neuper@37906
|
1157 |
(*check if there are tacs for rewriting only*)
|
neuper@37906
|
1158 |
fun rew_only ([]:step list) = true
|
neuper@37906
|
1159 |
| rew_only (((Rewrite' _ ,_,_,_,_))::ss) = rew_only ss
|
neuper@37906
|
1160 |
| rew_only (((Rewrite_Inst' _ ,_,_,_,_))::ss) = rew_only ss
|
neuper@37906
|
1161 |
| rew_only (((Rewrite_Set' _ ,_,_,_,_))::ss) = rew_only ss
|
neuper@37906
|
1162 |
| rew_only (((Rewrite_Set_Inst' _ ,_,_,_,_))::ss) = rew_only ss
|
neuper@37906
|
1163 |
| rew_only (((Calculate' _ ,_,_,_,_))::ss) = rew_only ss
|
neuper@37906
|
1164 |
| rew_only (((Begin_Trans' _ ,_,_,_,_))::ss) = rew_only ss
|
neuper@37906
|
1165 |
| rew_only (((End_Trans' _ ,_,_,_,_))::ss) = rew_only ss
|
neuper@37906
|
1166 |
| rew_only _ = false;
|
neuper@37906
|
1167 |
|
neuper@37906
|
1168 |
|
neuper@37906
|
1169 |
datatype locate =
|
neuper@37906
|
1170 |
Steps of istate (*producing hd of step list (which was latest)
|
neuper@37906
|
1171 |
for next_tac, for reporting Safe|Unsafe to DG*)
|
neuper@37906
|
1172 |
* step (*(scrstate producing this step is in ptree !)*)
|
neuper@37906
|
1173 |
list (*locate_gen may produce intermediate steps*)
|
neuper@37906
|
1174 |
| NotLocatable; (*no (m Ass m') or (m AssWeak m') found*)
|
neuper@37906
|
1175 |
|
neuper@37906
|
1176 |
|
neuper@37906
|
1177 |
|
neuper@37906
|
1178 |
(* locate_gen tries to locate an input tac m in the script.
|
neuper@37906
|
1179 |
pursuing this goal the script is executed until an (m' equiv m) is found,
|
neuper@37906
|
1180 |
or the end of the script
|
neuper@37906
|
1181 |
args
|
neuper@37906
|
1182 |
m : input by the user, already checked by applicable_in,
|
neuper@37906
|
1183 |
(to be searched within Or; and _not_ an m doing the step on ptree !)
|
neuper@37906
|
1184 |
p,pt: (incl ets) at the time of input
|
neuper@37906
|
1185 |
scr : the script
|
neuper@37906
|
1186 |
d : canonical simplifier for locating Take, Substitute, Subproblems etc.
|
neuper@37906
|
1187 |
ets : ets at the time of input
|
neuper@37906
|
1188 |
l : the location (in scr) of the stac which generated the current formula
|
neuper@37906
|
1189 |
returns
|
neuper@37906
|
1190 |
Steps: pt,p (incl. ets) with m done
|
neuper@37906
|
1191 |
pos' list of proofobjs cut (from generate)
|
neuper@37906
|
1192 |
safe: implied from last proofobj
|
neuper@37906
|
1193 |
ets:
|
neuper@37906
|
1194 |
///ToDo : ets contains a list of tacs to be done before m can be done
|
neuper@37906
|
1195 |
NOT IMPL. -- "error: do other step before"
|
neuper@37906
|
1196 |
NotLocatable: thus generate_hard
|
neuper@37906
|
1197 |
*)
|
neuper@37906
|
1198 |
fun locate_gen (thy',_) (Rewrite'(_,ro,er,pa,(id,str),f,_)) (pt,p)
|
neuper@42006
|
1199 |
(Rfuns {locate_rule=lo,...}, d) (RrlsState (_,f'',rss,rts), ctxt) =
|
neuper@42006
|
1200 |
(case lo rss f (Thm (id, mk_thm (assoc_thy thy') str)) of
|
neuper@42006
|
1201 |
[] => NotLocatable
|
neuper@37906
|
1202 |
| rts' =>
|
neuper@42006
|
1203 |
Steps (rts2steps [] ((pt,p),(f,f'',rss,rts),(thy',ro,er,pa)) rts'))
|
neuper@37906
|
1204 |
|
neuper@37906
|
1205 |
| locate_gen (ts as (thy',srls)) (m:tac_) ((pt,p):ptree * pos')
|
neuper@42006
|
1206 |
(scr as Script (h $ body),d) (ScrState (E,l,a,v,S,b), ctxt) =
|
neuper@42006
|
1207 |
let val thy = assoc_thy thy';
|
neuper@42006
|
1208 |
in
|
neuper@42006
|
1209 |
case if l = [] orelse ((*init.in solve..Apply_Method...*)
|
neuper@42006
|
1210 |
(last_elem o fst) p = 0 andalso snd p = Res)
|
neuper@42006
|
1211 |
then (assy ((ts,d),Aundef) ((E,[R],a,v,S,b), [(m,EmptyMout,pt,p,[])]) body)
|
neuper@42006
|
1212 |
else (astep_up (thy',srls,scr,d) ((E,l,a,v,S,b), [(m,EmptyMout,pt,p,[])]) ) of
|
neuper@42006
|
1213 |
Assoc (iss as (is as (_,_,_,_,_,bb), ss as ((m',f',pt',p',c')::_))) =>
|
neuper@42006
|
1214 |
(if bb
|
neuper@42006
|
1215 |
then Steps (ScrState is, ss)
|
neuper@42006
|
1216 |
else
|
neuper@42006
|
1217 |
if rew_only ss (*andalso 'not bb'= associated weakly*)
|
neuper@42006
|
1218 |
then
|
neuper@42006
|
1219 |
let
|
neuper@42006
|
1220 |
val (po,p_) = p
|
neuper@37906
|
1221 |
val po' = case p_ of Frm => po | Res => lev_on po
|
neuper@42006
|
1222 |
val (p'',c'',f'',pt'') =
|
neuper@42006
|
1223 |
generate1 thy m (ScrState is, ctxt) (po',p_) pt;
|
neuper@42006
|
1224 |
in Steps (ScrState is, [(m, f'',pt'',p'',c'')]) end
|
neuper@42006
|
1225 |
else Steps (ScrState is, ss))
|
neuper@37906
|
1226 |
|
neuper@42006
|
1227 |
| NasApp _ => NotLocatable
|
neuper@42248
|
1228 |
| err => (writeln ("*** " ^ PolyML.makestring err); NotLocatable)
|
neuper@42006
|
1229 |
end
|
neuper@42006
|
1230 |
|
bonzai@41951
|
1231 |
| locate_gen _ m _ (sc,_) (is, _) =
|
neuper@42006
|
1232 |
error ("locate_gen: wrong arguments,\n tac= " ^ tac_2str m ^ ",\n " ^
|
neuper@42006
|
1233 |
"scr= " ^ scr2str sc ^ ",\n istate= " ^ istate2str is);
|
neuper@37906
|
1234 |
|
neuper@37906
|
1235 |
(** find the next stactic in a script **)
|
neuper@37906
|
1236 |
|
neuper@37906
|
1237 |
datatype appy = (*ExprVal in the sense of denotational semantics*)
|
neuper@37906
|
1238 |
Appy of (*applicable stac found, search stalled*)
|
neuper@37906
|
1239 |
tac_ * (*tac_ associated (fun assod) with stac*)
|
neuper@37906
|
1240 |
scrstate (*after determination of stac WN.18.8.03*)
|
neuper@37906
|
1241 |
| Napp of (*stac found was not applicable;
|
neuper@37906
|
1242 |
this mode may become Skip in Repeat, Try and Or*)
|
neuper@37906
|
1243 |
env (*stack*) (*popped while nxt_up*)
|
neuper@37906
|
1244 |
| Skip of (*for restart after Appy, for leaving iterations,
|
neuper@37906
|
1245 |
for passing the value of scriptexpressions,
|
neuper@37906
|
1246 |
and for finishing the script successfully*)
|
neuper@37906
|
1247 |
term * env (*stack*);
|
neuper@37906
|
1248 |
|
neuper@37906
|
1249 |
(*appy, nxt_up, nstep_up scanning for next_tac.
|
neuper@37906
|
1250 |
search is clearly separated into (1)-(2):
|
neuper@37906
|
1251 |
(1) appy is recursive descent;
|
neuper@37906
|
1252 |
(2) nxt_up resumes interpretation at a location somewhere in the script;
|
neuper@37906
|
1253 |
nstep_up does only get to the parentnode of the scriptexpr.
|
neuper@37906
|
1254 |
consequence:
|
neuper@37906
|
1255 |
* call of (2) means _always_ that in this branch below
|
neuper@37906
|
1256 |
there was an applicable stac (Repeat, Or e1, ...)
|
neuper@37906
|
1257 |
*)
|
neuper@37906
|
1258 |
|
neuper@37906
|
1259 |
|
neuper@37906
|
1260 |
datatype appy_ = (*as argument in nxt_up, nstep_up, from appy*)
|
neuper@42007
|
1261 |
(* Appy is only (final) returnvalue, not argument during search *)
|
neuper@42007
|
1262 |
Napp_ (*ev. detects 'script is not appropriate for this example'*)
|
neuper@42007
|
1263 |
| Skip_; (*detects 'script successfully finished'
|
neuper@42007
|
1264 |
also used as init-value for resuming; this works,
|
neuper@42007
|
1265 |
because 'nxt_up Or e1' treats as Appy*)
|
neuper@37906
|
1266 |
|
neuper@42007
|
1267 |
fun appy thy ptp E l (t as Const ("HOL.Let",_) $ e $ (Abs (i,T,b))) a v =
|
neuper@42007
|
1268 |
(case appy thy ptp E (l@[L,R]) e a v of
|
neuper@42007
|
1269 |
Skip (res, E) =>
|
neuper@42007
|
1270 |
let val E' = upd_env E (Free (i,T), res);
|
neuper@42007
|
1271 |
in appy thy ptp E' (l@[R,D]) b a v end
|
neuper@42007
|
1272 |
| ay => ay)
|
neuper@37906
|
1273 |
|
neuper@42007
|
1274 |
| appy (thy as (th,sr)) ptp E l (t as Const ("Script.While"(*1*),_) $ c $ e $ a) _ v =
|
neuper@42007
|
1275 |
(if eval_true_ th sr (subst_atomic (upd_env E (a,v)) c)
|
neuper@42007
|
1276 |
then appy thy ptp E (l@[L,R]) e (SOME a) v
|
neuper@42007
|
1277 |
else Skip (v, E))
|
neuper@37906
|
1278 |
|
neuper@42007
|
1279 |
| appy (thy as (th,sr)) ptp E l (t as Const ("Script.While"(*2*),_) $ c $ e) a v =
|
neuper@42007
|
1280 |
(if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)
|
neuper@42007
|
1281 |
then appy thy ptp E (l@[R]) e a v
|
neuper@42007
|
1282 |
else Skip (v, E))
|
neuper@37906
|
1283 |
|
neuper@37906
|
1284 |
| appy (thy as (th,sr)) ptp E l (t as Const ("If",_) $ c $ e1 $ e2) a v =
|
neuper@42007
|
1285 |
(if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)
|
neuper@42007
|
1286 |
then ((*tracing("### appy If: true");*)appy thy ptp E (l@[L,R]) e1 a v)
|
neuper@42007
|
1287 |
else ((*tracing("### appy If: false");*)appy thy ptp E (l@[ R]) e2 a v))
|
neuper@37906
|
1288 |
|
neuper@42007
|
1289 |
| appy thy ptp E l (Const ("Script.Repeat"(*1*),_) $ e $ a) _ v =
|
neuper@42007
|
1290 |
(appy thy ptp E (l@[L,R]) e (SOME a) v)
|
neuper@37906
|
1291 |
|
neuper@42007
|
1292 |
| appy thy ptp E l (Const ("Script.Repeat"(*2*),_) $ e) a v =
|
neuper@42007
|
1293 |
(appy thy ptp E (l@[R]) e a v)
|
neuper@42007
|
1294 |
|
neuper@42007
|
1295 |
| appy thy ptp E l (t as Const ("Script.Try",_) $ e $ a) _ v =
|
neuper@42007
|
1296 |
(case appy thy ptp E (l@[L,R]) e (SOME a) v of
|
neuper@42007
|
1297 |
Napp E => (Skip (v, E))
|
neuper@42007
|
1298 |
| ay => ay)
|
neuper@42007
|
1299 |
|
neuper@42007
|
1300 |
| appy thy ptp E l(t as Const ("Script.Try",_) $ e) a v =
|
neuper@42007
|
1301 |
(case appy thy ptp E (l@[R]) e a v of
|
neuper@42007
|
1302 |
Napp E => (Skip (v, E))
|
neuper@42007
|
1303 |
| ay => ay)
|
neuper@42007
|
1304 |
|
neuper@42007
|
1305 |
| appy thy ptp E l (Const ("Script.Or"(*1*),_) $e1 $ e2 $ a) _ v =
|
neuper@42007
|
1306 |
(case appy thy ptp E (l@[L,L,R]) e1 (SOME a) v of
|
neuper@42007
|
1307 |
Appy lme => Appy lme
|
neuper@42007
|
1308 |
| _ => appy thy ptp E (*env*) (l@[L,R]) e2 (SOME a) v)
|
neuper@37906
|
1309 |
|
neuper@42007
|
1310 |
| appy thy ptp E l (Const ("Script.Or"(*2*),_) $e1 $ e2) a v =
|
neuper@42007
|
1311 |
(case appy thy ptp E (l@[L,R]) e1 a v of
|
neuper@42007
|
1312 |
Appy lme => Appy lme
|
neuper@37906
|
1313 |
| _ => appy thy ptp E (l@[R]) e2 a v)
|
neuper@37906
|
1314 |
|
neuper@42007
|
1315 |
| appy thy ptp E l (Const ("Script.Seq"(*1*),_) $ e1 $ e2 $ a) _ v =
|
neuper@42007
|
1316 |
(case appy thy ptp E (l@[L,L,R]) e1 (SOME a) v of
|
neuper@42007
|
1317 |
Skip (v,E) => appy thy ptp E (l@[L,R]) e2 (SOME a) v
|
neuper@37906
|
1318 |
| ay => ay)
|
neuper@37906
|
1319 |
|
neuper@42007
|
1320 |
| appy thy ptp E l (Const ("Script.Seq",_) $ e1 $ e2) a v =
|
neuper@42007
|
1321 |
(case appy thy ptp E (l@[L,R]) e1 a v of
|
neuper@42007
|
1322 |
Skip (v,E) => appy thy ptp E (l@[R]) e2 a v
|
neuper@37906
|
1323 |
| ay => ay)
|
neuper@37906
|
1324 |
|
neuper@42007
|
1325 |
(* a leaf has been found *)
|
neuper@37906
|
1326 |
| appy (thy as (th,sr)) (pt, p) E l t a v =
|
neuper@42007
|
1327 |
(case handle_leaf "next " th sr E a v t of
|
neuper@42007
|
1328 |
(a', Expr s) => Skip (s, E)
|
neuper@42007
|
1329 |
| (a', STac stac) =>
|
neuper@42007
|
1330 |
let val (m,m') = stac2tac_ pt (assoc_thy th) stac
|
neuper@42007
|
1331 |
in
|
neuper@42007
|
1332 |
case m of
|
neuper@42007
|
1333 |
Subproblem _ => Appy (m', (E,l,a',tac_2res m',Sundef,false))
|
neuper@42007
|
1334 |
| _ =>
|
neuper@42007
|
1335 |
(case applicable_in p pt m of
|
neuper@42007
|
1336 |
Appl m' => (Appy (m', (E,l,a',tac_2res m',Sundef,false)))
|
neuper@42007
|
1337 |
| _ => ((*tracing("### appy: Napp");*)Napp E))
|
neuper@42007
|
1338 |
end);
|
neuper@37906
|
1339 |
|
neuper@37906
|
1340 |
fun nxt_up thy ptp (scr as (Script sc)) E l ay
|
neuper@41968
|
1341 |
(t as Const ("HOL.Let",_) $ _) a v = (*comes from let=...*)
|
neuper@42007
|
1342 |
(if ay = Napp_
|
neuper@42007
|
1343 |
then nstep_up thy ptp scr E (drop_last l) Napp_ a v
|
neuper@42007
|
1344 |
else (*Skip_*)
|
neuper@42007
|
1345 |
let
|
neuper@42007
|
1346 |
val up = drop_last l;
|
neuper@42007
|
1347 |
val (Const ("HOL.Let",_) $ e $ (Abs (i,T,body))) = go up sc;
|
neuper@37906
|
1348 |
val i = mk_Free (i, T);
|
neuper@37906
|
1349 |
val E = upd_env E (i, v);
|
neuper@42007
|
1350 |
in
|
neuper@42007
|
1351 |
case appy thy ptp E (up@[R,D]) body a v of
|
neuper@42007
|
1352 |
Appy lre => Appy lre
|
neuper@42007
|
1353 |
| Napp E => nstep_up thy ptp scr E up Napp_ a v
|
neuper@42007
|
1354 |
| Skip (v,E) => nstep_up thy ptp scr E up Skip_ a v end)
|
neuper@37906
|
1355 |
|
neuper@37906
|
1356 |
| nxt_up thy ptp scr E l ay
|
neuper@37906
|
1357 |
(t as Abs (_,_,_)) a v =
|
neuper@38053
|
1358 |
((*tracing("### nxt_up Abs: " ^ term2str t);*)
|
neuper@37906
|
1359 |
nstep_up thy ptp scr E (*enr*) l ay a v)
|
neuper@37906
|
1360 |
|
neuper@37906
|
1361 |
| nxt_up thy ptp scr E l ay
|
neuper@41968
|
1362 |
(t as Const ("HOL.Let",_) $ e $ (Abs (i,T,b))) a v =
|
neuper@38015
|
1363 |
((*tracing("### nxt_up Let$e$Abs: is=");
|
neuper@38015
|
1364 |
tracing(istate2str (ScrState (E,l,a,v,Sundef,false)));*)
|
neuper@38053
|
1365 |
(*tracing("### nxt_up Let e Abs: " ^ term2str t);*)
|
neuper@37906
|
1366 |
nstep_up thy ptp scr (*upd_env*) E (*a,v)*)
|
neuper@37906
|
1367 |
(*eno,upd_env env (iar,res),iar,res,saf*) l ay a v)
|
neuper@37906
|
1368 |
|
neuper@37906
|
1369 |
(*no appy_: never causes Napp -> Helpless*)
|
neuper@37906
|
1370 |
| nxt_up (thy as (th,sr)) ptp scr E l _
|
neuper@37906
|
1371 |
(Const ("Script.While"(*1*),_) $ c $ e $ _) a v =
|
neuper@37906
|
1372 |
if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)
|
neuper@37906
|
1373 |
then case appy thy ptp E (l@[L,R]) e a v of
|
neuper@37906
|
1374 |
Appy lr => Appy lr
|
neuper@37906
|
1375 |
| Napp E => nstep_up thy ptp scr E l Skip_ a v
|
neuper@37906
|
1376 |
| Skip (v,E) => nstep_up thy ptp scr E l Skip_ a v
|
neuper@37906
|
1377 |
else nstep_up thy ptp scr E l Skip_ a v
|
neuper@37906
|
1378 |
|
neuper@37906
|
1379 |
(*no appy_: never causes Napp - Helpless*)
|
neuper@37906
|
1380 |
| nxt_up (thy as (th,sr)) ptp scr E l _
|
neuper@37906
|
1381 |
(Const ("Script.While"(*2*),_) $ c $ e) a v =
|
neuper@37906
|
1382 |
if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)
|
neuper@37906
|
1383 |
then case appy thy ptp E (l@[R]) e a v of
|
neuper@37906
|
1384 |
Appy lr => Appy lr
|
neuper@37906
|
1385 |
| Napp E => nstep_up thy ptp scr E l Skip_ a v
|
neuper@37906
|
1386 |
| Skip (v,E) => nstep_up thy ptp scr E l Skip_ a v
|
neuper@37906
|
1387 |
else nstep_up thy ptp scr E l Skip_ a v
|
neuper@37906
|
1388 |
|
neuper@37906
|
1389 |
(* val (scr, l) = (Script sc, up);
|
neuper@37906
|
1390 |
*)
|
neuper@37906
|
1391 |
| nxt_up thy ptp scr E l ay (Const ("If",_) $ _ $ _ $ _) a v =
|
neuper@37906
|
1392 |
nstep_up thy ptp scr E l ay a v
|
neuper@37906
|
1393 |
|
neuper@37906
|
1394 |
| nxt_up thy ptp scr E l _ (*no appy_: there was already a stac below*)
|
neuper@37906
|
1395 |
(Const ("Script.Repeat"(*1*),T) $ e $ _) a v =
|
neuper@37906
|
1396 |
(case appy thy ptp (*upd_env*) E (*a,v)*) ((l@[L,R]):loc_) e a v of
|
neuper@37906
|
1397 |
Appy lr => Appy lr
|
neuper@38015
|
1398 |
| Napp E => ((*tracing("### nxt_up Repeat a: ");*)
|
neuper@37906
|
1399 |
nstep_up thy ptp scr E l Skip_ a v)
|
neuper@38015
|
1400 |
| Skip (v,E) => ((*tracing("### nxt_up Repeat: Skip res ="^
|
neuper@37906
|
1401 |
(Sign.string_of_term(sign_of (assoc_thy thy)) res'));*)
|
neuper@37906
|
1402 |
nstep_up thy ptp scr E l Skip_ a v))
|
neuper@37906
|
1403 |
|
neuper@37906
|
1404 |
| nxt_up thy ptp scr E l _ (*no appy_: there was already a stac below*)
|
neuper@37906
|
1405 |
(Const ("Script.Repeat"(*2*),T) $ e) a v =
|
neuper@37906
|
1406 |
(case appy thy ptp (*upd_env*) E (*a,v)*) ((l@[R]):loc_) e a v of
|
neuper@37906
|
1407 |
Appy lr => Appy lr
|
neuper@38015
|
1408 |
| Napp E => ((*tracing("### nxt_up Repeat a: ");*)
|
neuper@37906
|
1409 |
nstep_up thy ptp scr E l Skip_ a v)
|
neuper@38015
|
1410 |
| Skip (v,E) => ((*tracing("### nxt_up Repeat: Skip res ="^
|
neuper@37906
|
1411 |
(Sign.string_of_term(sign_of (assoc_thy thy)) res'));*)
|
neuper@37906
|
1412 |
nstep_up thy ptp scr E l Skip_ a v))
|
neuper@37906
|
1413 |
(* val (thy, ptp, scr, E, l, _,(t as Const ("Script.Try",_) $ e $ _), a, v) =
|
neuper@37906
|
1414 |
(thy, ptp, (Script sc),
|
neuper@37906
|
1415 |
E, up, ay,(go up sc), a, v);
|
neuper@37906
|
1416 |
*)
|
neuper@37906
|
1417 |
| nxt_up thy ptp scr E l _ (*makes Napp to Skip*)
|
neuper@37906
|
1418 |
(t as Const ("Script.Try",_) $ e $ _) a v =
|
neuper@38053
|
1419 |
((*tracing("### nxt_up Try " ^ term2str t);*)
|
neuper@37906
|
1420 |
nstep_up thy ptp scr E l Skip_ a v )
|
neuper@37906
|
1421 |
(* val (thy, ptp, scr, E, l, _,(t as Const ("Script.Try",_) $ e), a, v) =
|
neuper@37906
|
1422 |
(thy, ptp, (Script sc),
|
neuper@37906
|
1423 |
E, up, ay,(go up sc), a, v);
|
neuper@37906
|
1424 |
*)
|
neuper@37906
|
1425 |
| nxt_up thy ptp scr E l _ (*makes Napp to Skip*)
|
neuper@37906
|
1426 |
(t as Const ("Script.Try"(*2*),_) $ e) a v =
|
neuper@38053
|
1427 |
((*tracing("### nxt_up Try " ^ term2str t);*)
|
neuper@37906
|
1428 |
nstep_up thy ptp scr E l Skip_ a v)
|
neuper@37906
|
1429 |
|
neuper@37906
|
1430 |
|
neuper@37906
|
1431 |
| nxt_up thy ptp scr E l ay
|
neuper@37906
|
1432 |
(Const ("Script.Or",_) $ _ $ _ $ _) a v = nstep_up thy ptp scr E l ay a v
|
neuper@37906
|
1433 |
|
neuper@37906
|
1434 |
| nxt_up thy ptp scr E l ay
|
neuper@37906
|
1435 |
(Const ("Script.Or",_) $ _ $ _) a v = nstep_up thy ptp scr E l ay a v
|
neuper@37906
|
1436 |
|
neuper@37906
|
1437 |
| nxt_up thy ptp scr E l ay
|
neuper@37906
|
1438 |
(Const ("Script.Or",_) $ _ ) a v =
|
neuper@37906
|
1439 |
nstep_up thy ptp scr E (drop_last l) ay a v
|
neuper@37906
|
1440 |
(* val (thy, ptp, scr, E, l, ay, (Const ("Script.Seq",_) $ _ $ _ $ _), a, v) =
|
neuper@37906
|
1441 |
(thy, ptp, (Script sc),
|
neuper@37906
|
1442 |
E, up, ay,(go up sc), a, v);
|
neuper@37906
|
1443 |
*)
|
neuper@37906
|
1444 |
| nxt_up thy ptp scr E l ay (*all has been done in (*2*) below*)
|
neuper@37906
|
1445 |
(Const ("Script.Seq"(*1*),_) $ _ $ _ $ _) a v =
|
neuper@37906
|
1446 |
nstep_up thy ptp scr E l ay a v
|
neuper@37906
|
1447 |
(* val (thy, ptp, scr, E, l, ay, (Const ("Script.Seq",_) $ _ $ e2), a, v) =
|
neuper@37906
|
1448 |
(thy, ptp, (Script sc),
|
neuper@37906
|
1449 |
E, up, ay,(go up sc), a, v);
|
neuper@37906
|
1450 |
*)
|
neuper@37906
|
1451 |
| nxt_up thy ptp scr E l ay (*comes from e2*)
|
neuper@37906
|
1452 |
(Const ("Script.Seq"(*2*),_) $ _ $ e2) a v =
|
neuper@37906
|
1453 |
nstep_up thy ptp scr E l ay a v
|
neuper@37906
|
1454 |
(* val (thy, ptp, scr, E, l, ay, (Const ("Script.Seq",_) $ _), a, v) =
|
neuper@37906
|
1455 |
(thy, ptp, (Script sc),
|
neuper@37906
|
1456 |
E, up, ay,(go up sc), a, v);
|
neuper@37906
|
1457 |
*)
|
neuper@37906
|
1458 |
| nxt_up thy ptp (scr as Script sc) E l ay (*comes from e1*)
|
neuper@37906
|
1459 |
(Const ("Script.Seq",_) $ _) a v =
|
neuper@37906
|
1460 |
if ay = Napp_
|
neuper@37906
|
1461 |
then nstep_up thy ptp scr E (drop_last l) Napp_ a v
|
neuper@37906
|
1462 |
else (*Skip_*)
|
neuper@37906
|
1463 |
let val up = drop_last l;
|
neuper@37906
|
1464 |
val Const ("Script.Seq"(*2*),_) $ _ $ e2 = go up sc;
|
neuper@37906
|
1465 |
in case appy thy ptp E (up@[R]) e2 a v of
|
neuper@37906
|
1466 |
Appy lr => Appy lr
|
neuper@37906
|
1467 |
| Napp E => nstep_up thy ptp scr E up Napp_ a v
|
neuper@37906
|
1468 |
| Skip (v,E) => nstep_up thy ptp scr E up Skip_ a v end
|
neuper@37906
|
1469 |
|
neuper@37906
|
1470 |
| nxt_up (thy,_) ptp scr E l ay t a v =
|
neuper@38053
|
1471 |
error ("nxt_up not impl for " ^ term2str t)
|
neuper@37906
|
1472 |
|
neuper@37906
|
1473 |
(* val (thy, ptp, (Script sc), E, l, ay, a, v)=
|
neuper@37906
|
1474 |
(thy, ptp, scr, E, l, Skip_, a, v);
|
neuper@37906
|
1475 |
val (thy, ptp, (Script sc), E, l, ay, a, v)=
|
neuper@37906
|
1476 |
(thy, ptp, sc, E, l, Skip_, a, v);
|
neuper@37906
|
1477 |
*)
|
neuper@37906
|
1478 |
and nstep_up thy ptp (Script sc) E l ay a v =
|
neuper@42007
|
1479 |
(if 1 < length l
|
neuper@37906
|
1480 |
then
|
neuper@42007
|
1481 |
let val up = drop_last l;
|
neuper@42007
|
1482 |
in (nxt_up thy ptp (Script sc) E up ay (go up sc) a v ) end
|
neuper@37906
|
1483 |
else (*interpreted to end*)
|
neuper@42007
|
1484 |
if ay = Skip_ then Skip (v, E) else Napp E
|
neuper@37906
|
1485 |
);
|
neuper@37906
|
1486 |
|
neuper@37906
|
1487 |
(* decide for the next applicable stac in the script;
|
neuper@37906
|
1488 |
returns (stactic, value) - the value in case the script is finished
|
neuper@37906
|
1489 |
12.8.02: ~~~~~ and no assumptions ??? FIXME ???
|
neuper@37906
|
1490 |
20.8.02: must return p in case of finished, because the next script
|
neuper@37906
|
1491 |
consulted need not be the calling script:
|
neuper@37906
|
1492 |
in case of detail ie. _inserted_ PrfObjs, the next stac
|
neuper@37906
|
1493 |
has to searched in a script with PblObj.status<>Complete !
|
neuper@37906
|
1494 |
(.. not true for other details ..PrfObj ??????????????????
|
neuper@37906
|
1495 |
20.8.02: do NOT return safe (is only changed in locate !!!)
|
neuper@37906
|
1496 |
*)
|
neuper@41996
|
1497 |
fun next_tac (thy,_) (pt,p) (Rfuns {next_rule,...}) (RrlsState(f,f',rss,_), ctxt) =
|
neuper@41996
|
1498 |
let val ctxt = get_ctxt pt p
|
neuper@41996
|
1499 |
in
|
neuper@41996
|
1500 |
if f = f'
|
neuper@41996
|
1501 |
then (End_Detail' (f',[])(*8.6.03*), (Uistate, ctxt),
|
neuper@41996
|
1502 |
(f', Sundef(*FIXME is no value of next_tac! vor 8.6.03*))) (*finished*)
|
neuper@41996
|
1503 |
else
|
neuper@41996
|
1504 |
(case next_rule rss f of
|
neuper@41996
|
1505 |
NONE => (Empty_Tac_, (Uistate, ctxt), (e_term, Sundef)) (*helpless*)
|
neuper@41996
|
1506 |
| SOME (Thm (id,thm))(*8.6.03: muss auch f' liefern ?!!*) =>
|
neuper@41996
|
1507 |
(Rewrite' (thy, "e_rew_ord", e_rls,(*!?!8.6.03*) false,
|
neuper@41996
|
1508 |
(id, string_of_thmI thm), f,(e_term,[(*!?!8.6.03*)])),
|
neuper@41996
|
1509 |
(Uistate, ctxt), (e_term, Sundef))) (*next stac*)
|
neuper@41996
|
1510 |
end
|
neuper@41999
|
1511 |
|
neuper@42007
|
1512 |
| next_tac thy (ptp as (pt, pos as (p, _)):ptree * pos') (sc as Script (h $ body))
|
neuper@41996
|
1513 |
(ScrState (E,l,a,v,s,b), ctxt) =
|
neuper@42007
|
1514 |
let val ctxt = get_ctxt pt pos (*WN110518 we have ctxt twice -- redesign*)
|
neuper@41996
|
1515 |
in
|
neuper@41996
|
1516 |
(case if l = []
|
neuper@41996
|
1517 |
then appy thy ptp E [R] body NONE v
|
neuper@41996
|
1518 |
else nstep_up thy ptp sc E l Skip_ a v of
|
neuper@41996
|
1519 |
Skip (v, _) => (*finished*)
|
neuper@41996
|
1520 |
(case par_pbl_det pt p of
|
neuper@41996
|
1521 |
(true, p', _) =>
|
neuper@41996
|
1522 |
let val (_,pblID,_) = get_obj g_spec pt p';
|
neuper@42023
|
1523 |
in (Check_Postcond' (pblID, (v, [(*assigned in next step*)])),
|
neuper@41996
|
1524 |
(e_istate, ctxt), (v,s))
|
neuper@41996
|
1525 |
end
|
neuper@41996
|
1526 |
| (_, p', rls') =>
|
neuper@41996
|
1527 |
(End_Detail' (e_term,[])(*8.6.03*), (e_istate, ctxt), (v,s)))
|
neuper@41996
|
1528 |
| Napp _ => (Empty_Tac_, (e_istate, ctxt), (e_term, Sundef)) (*helpless*)
|
neuper@41996
|
1529 |
| Appy (m', scrst as (_,_,_,v,_,_)) =>
|
neuper@41996
|
1530 |
(m', (ScrState scrst, ctxt), (v, Sundef))) (*next stac*)
|
neuper@41996
|
1531 |
end
|
neuper@41999
|
1532 |
|
neuper@41972
|
1533 |
| next_tac _ _ _ (is, _) = error ("next_tac: not impl for " ^ (istate2str is));
|
neuper@37906
|
1534 |
|
neuper@37906
|
1535 |
|
neuper@37906
|
1536 |
(*.create the initial interpreter state from the items of the guard.*)
|
neuper@42011
|
1537 |
fun init_scrstate thy itms metID =
|
neuper@41996
|
1538 |
let
|
neuper@42011
|
1539 |
val actuals = itms2args thy metID itms
|
neuper@42011
|
1540 |
val scr as Script sc = (#scr o get_met) metID
|
neuper@42011
|
1541 |
val formals = formal_args sc
|
neuper@41996
|
1542 |
(*expects same sequence of (actual) args in itms and (formal) args in met*)
|
neuper@41996
|
1543 |
fun relate_args env [] [] = env
|
neuper@41996
|
1544 |
| relate_args env _ [] =
|
neuper@41996
|
1545 |
error ("ERROR in creating the environment for '" ^
|
neuper@41996
|
1546 |
id_of_scr sc ^ "' from \nthe items of the guard of " ^
|
neuper@41996
|
1547 |
metID2str metID ^ ",\n" ^
|
neuper@41996
|
1548 |
"formal arg(s), from the script, miss actual arg(s), from the guards env:\n" ^
|
neuper@41996
|
1549 |
(string_of_int o length) formals ^
|
neuper@41996
|
1550 |
" formals: " ^ terms2str formals ^ "\n" ^
|
neuper@41996
|
1551 |
(string_of_int o length) actuals ^
|
neuper@41996
|
1552 |
" actuals: " ^ terms2str actuals)
|
neuper@41996
|
1553 |
| relate_args env [] actual_finds = env (*may drop Find!*)
|
neuper@41996
|
1554 |
| relate_args env (a::aa) (f::ff) =
|
neuper@41996
|
1555 |
if type_of a = type_of f
|
neuper@41996
|
1556 |
then relate_args (env @ [(a, f)]) aa ff
|
neuper@41996
|
1557 |
else
|
neuper@41996
|
1558 |
error ("ERROR in creating the environment for '" ^
|
neuper@41996
|
1559 |
id_of_scr sc ^ "' from \nthe items of the guard of " ^
|
neuper@41996
|
1560 |
metID2str metID ^ ",\n" ^
|
neuper@41996
|
1561 |
"different types of formal arg, from the script, " ^
|
neuper@41996
|
1562 |
"and actual arg, from the guards env:'\n" ^
|
neuper@41996
|
1563 |
"formal: '" ^ term2str a ^ "::" ^ (type2str o type_of) a ^ "'\n" ^
|
neuper@41996
|
1564 |
"actual: '" ^ term2str f ^ "::" ^ (type2str o type_of) f ^ "'\n" ^
|
neuper@41996
|
1565 |
"in\n" ^
|
neuper@41996
|
1566 |
"formals: " ^ terms2str formals ^ "\n" ^
|
neuper@41996
|
1567 |
"actuals: " ^ terms2str actuals)
|
neuper@41996
|
1568 |
val env = relate_args [] formals actuals;
|
neuper@42011
|
1569 |
val ctxt = ProofContext.init_global thy |> declare_constraints' actuals
|
neuper@42015
|
1570 |
val {pre, prls, ...} = get_met metID;
|
neuper@42015
|
1571 |
val pres = check_preconds thy prls pre itms |> map snd;
|
neuper@42016
|
1572 |
val ctxt = ctxt |> insert_assumptions pres;
|
neuper@42011
|
1573 |
in (ScrState (env,[],NONE,e_term,Safe,true), ctxt, scr):istate * Proof.context * scr end;
|
neuper@37906
|
1574 |
|
neuper@41996
|
1575 |
(* decide, where to get script/istate from:
|
neuper@37906
|
1576 |
(*1*) from PblObj.env: at begin of script if no init_form
|
neuper@37906
|
1577 |
(*2*) from PblObj/PrfObj: if stac is in the middle of the script
|
neuper@41996
|
1578 |
(*3*) from rls/PrfObj: in case of detail a ruleset *)
|
neuper@37906
|
1579 |
fun from_pblobj_or_detail' thy' (p,p_) pt =
|
neuper@41996
|
1580 |
let val ctxt = get_ctxt pt (p,p_)
|
neuper@42082
|
1581 |
in
|
neuper@37935
|
1582 |
if member op = [Pbl,Met] p_
|
neuper@37906
|
1583 |
then case get_obj g_env pt p of
|
neuper@41996
|
1584 |
NONE => error "from_pblobj_or_detail': no istate"
|
neuper@41996
|
1585 |
| SOME is =>
|
neuper@41996
|
1586 |
let
|
neuper@41996
|
1587 |
val metID = get_obj g_metID pt p
|
neuper@41996
|
1588 |
val {srls,...} = get_met metID
|
neuper@41996
|
1589 |
in (srls, is, (#scr o get_met) metID) end
|
neuper@37906
|
1590 |
else
|
neuper@41996
|
1591 |
let val (pbl,p',rls') = par_pbl_det pt p
|
neuper@41996
|
1592 |
in if pbl
|
neuper@41996
|
1593 |
then (*2*)
|
neuper@41996
|
1594 |
let
|
neuper@41996
|
1595 |
val thy = assoc_thy thy'
|
neuper@41996
|
1596 |
val PblObj{meth=itms,...} = get_obj I pt p'
|
neuper@41996
|
1597 |
val metID = get_obj g_metID pt p'
|
neuper@41996
|
1598 |
val {srls,...} = get_met metID
|
neuper@41996
|
1599 |
in (*if last_elem p = 0 nothing written to pt yet*)
|
neuper@41996
|
1600 |
(srls, get_loc pt (p,p_), (#scr o get_met) metID)
|
neuper@41996
|
1601 |
end
|
neuper@41996
|
1602 |
else (*3*)
|
neuper@41996
|
1603 |
(e_rls, (*FIXME.WN0?: get from pbl or met !!! unused for Rrls in locate_gen, next_tac*)
|
neuper@41996
|
1604 |
get_loc pt (p,p_),
|
neuper@41996
|
1605 |
case rls' of
|
neuper@41996
|
1606 |
Rls {scr=scr,...} => scr
|
neuper@41996
|
1607 |
| Seq {scr=scr,...} => scr
|
neuper@41996
|
1608 |
| Rrls {scr=rfuns,...} => rfuns)
|
neuper@42082
|
1609 |
end
|
neuper@41996
|
1610 |
end;
|
neuper@37906
|
1611 |
|
neuper@41996
|
1612 |
(*.get script and istate from PblObj, see (*1*) above.*)
|
bonzai@41948
|
1613 |
fun from_pblobj' thy' (p,p_) pt =
|
neuper@42001
|
1614 |
let
|
neuper@42001
|
1615 |
val p' = par_pblobj pt p
|
neuper@42001
|
1616 |
val thy = assoc_thy thy'
|
neuper@42014
|
1617 |
val PblObj {meth=itms, ...} = get_obj I pt p'
|
neuper@42001
|
1618 |
val metID = get_obj g_metID pt p'
|
neuper@42001
|
1619 |
val {srls,scr,...} = get_met metID
|
neuper@42001
|
1620 |
in
|
neuper@42001
|
1621 |
if last_elem p = 0 (*nothing written to pt yet*)
|
neuper@42001
|
1622 |
then
|
neuper@42014
|
1623 |
let val (is, ctxt, scr) = init_scrstate thy itms metID
|
neuper@42001
|
1624 |
in (srls, (is, ctxt), scr) end
|
bonzai@41953
|
1625 |
else (srls, get_loc pt (p,p_), scr)
|
neuper@37906
|
1626 |
end;
|
neuper@37906
|
1627 |
|
neuper@37906
|
1628 |
(*.get the stactics and problems of a script as tacs
|
neuper@37906
|
1629 |
instantiated with the current environment;
|
neuper@37906
|
1630 |
l is the location which generated the given formula.*)
|
neuper@37906
|
1631 |
(*WN.12.5.03: quick-and-dirty repair for listexpressions*)
|
neuper@37906
|
1632 |
fun is_spec_pos Pbl = true
|
neuper@37906
|
1633 |
| is_spec_pos Met = true
|
neuper@37906
|
1634 |
| is_spec_pos _ = false;
|
neuper@37906
|
1635 |
|
neuper@37906
|
1636 |
(*. fetch _all_ tactics from script .*)
|
neuper@37906
|
1637 |
fun sel_rules _ (([],Res):pos') =
|
neuper@37906
|
1638 |
raise PTREE "no tactics applicable at the end of a calculation"
|
neuper@37906
|
1639 |
| sel_rules pt (p,p_) =
|
neuper@37906
|
1640 |
if is_spec_pos p_
|
neuper@37906
|
1641 |
then [get_obj g_tac pt p]
|
neuper@37906
|
1642 |
else
|
neuper@37906
|
1643 |
let val pp = par_pblobj pt p;
|
neuper@37906
|
1644 |
val thy' = (get_obj g_domID pt pp):theory';
|
neuper@37906
|
1645 |
val thy = assoc_thy thy';
|
neuper@37906
|
1646 |
val metID = get_obj g_metID pt pp;
|
neuper@37906
|
1647 |
val metID' =if metID =e_metID then(thd3 o snd3)(get_obj g_origin pt pp)
|
neuper@37906
|
1648 |
else metID
|
neuper@37906
|
1649 |
val {scr=Script sc,srls,...} = get_met metID'
|
bonzai@41953
|
1650 |
val ScrState (env,_,a,v,_,_) = get_istate pt (p,p_);
|
neuper@37906
|
1651 |
in map ((stac2tac pt thy) o rep_stacexpr o #2 o
|
neuper@37906
|
1652 |
(handle_leaf "selrul" thy' srls env a v)) (stacpbls sc) end;
|
neuper@37906
|
1653 |
(*
|
neuper@38058
|
1654 |
> val Script sc = (#scr o get_met) ("SqRoot","sqrt-equ-test");
|
neuper@40836
|
1655 |
> val env = [((term_of o the o (parse (Thy_Info.get_theory "Isac"))) "bdv",
|
neuper@40836
|
1656 |
(term_of o the o (parse (Thy_Info.get_theory "Isac"))) "x")];
|
neuper@37926
|
1657 |
> map ((stac2tac pt thy) o #2 o(subst_stacexpr env NONE e_term)) (stacpbls sc);
|
neuper@37906
|
1658 |
*)
|
neuper@37906
|
1659 |
|
neuper@37906
|
1660 |
|
neuper@37906
|
1661 |
(*. fetch tactics from script and filter _applicable_ tactics;
|
neuper@37906
|
1662 |
in case of Rewrite_Set* go down to _atomic_ rewrite-tactics .*)
|
neuper@37906
|
1663 |
fun sel_appl_atomic_tacs _ (([],Res):pos') =
|
neuper@37906
|
1664 |
raise PTREE "no tactics applicable at the end of a calculation"
|
neuper@37906
|
1665 |
| sel_appl_atomic_tacs pt (p,p_) =
|
neuper@37906
|
1666 |
if is_spec_pos p_
|
neuper@37906
|
1667 |
then [get_obj g_tac pt p]
|
neuper@37906
|
1668 |
else
|
neuper@37906
|
1669 |
let val pp = par_pblobj pt p
|
neuper@37906
|
1670 |
val thy' = (get_obj g_domID pt pp):theory'
|
neuper@37906
|
1671 |
val thy = assoc_thy thy'
|
neuper@37906
|
1672 |
val metID = get_obj g_metID pt pp
|
neuper@37906
|
1673 |
val metID' =if metID = e_metID
|
neuper@37906
|
1674 |
then (thd3 o snd3) (get_obj g_origin pt pp)
|
neuper@37906
|
1675 |
else metID
|
neuper@37906
|
1676 |
val {scr=Script sc,srls,erls,rew_ord'=ro,...} = get_met metID'
|
bonzai@41953
|
1677 |
val ScrState (env,_,a,v,_,_) = get_istate pt (p,p_)
|
neuper@37906
|
1678 |
val alltacs = (*we expect at least 1 stac in a script*)
|
neuper@37906
|
1679 |
map ((stac2tac pt thy) o rep_stacexpr o #2 o
|
neuper@37906
|
1680 |
(handle_leaf "selrul" thy' srls env a v)) (stacpbls sc)
|
neuper@37906
|
1681 |
val f = case p_ of
|
neuper@37906
|
1682 |
Frm => get_obj g_form pt p
|
neuper@37906
|
1683 |
| Res => (fst o (get_obj g_result pt)) p
|
neuper@37906
|
1684 |
(*WN071231 ? replace atomic_appl_tacs with applicable_in (ineff!) ?*)
|
neuper@37906
|
1685 |
in (distinct o flat o
|
neuper@37906
|
1686 |
(map (atomic_appl_tacs thy ro erls f))) alltacs end;
|
neuper@37906
|
1687 |
|
neuper@37906
|
1688 |
|
neuper@37906
|
1689 |
(*
|
neuper@37906
|
1690 |
end
|
neuper@37906
|
1691 |
open Interpreter;
|
neuper@37906
|
1692 |
*)
|
neuper@37906
|
1693 |
|
neuper@37906
|
1694 |
(* use"ME/script.sml";
|
neuper@37906
|
1695 |
use"script.sml";
|
neuper@37906
|
1696 |
*)
|