4 12345678901234567890123456789012345678901234567890123456789012345678901234567890
5 10 20 30 40 50 60 70 80
7 val e_cterm' = empty_cterm';
10 fun rew_info (Rls {erls,rew_ord=(rew_ord',_),calc=ca, ...}) =
11 (rew_ord':rew_ord',erls,ca)
12 | rew_info (Seq {erls,rew_ord=(rew_ord',_),calc=ca, ...}) =
14 | rew_info (Rrls {erls,rew_ord=(rew_ord',_),calc=ca, ...}) =
16 | rew_info rls = error ("rew_info called with '"^rls2str rls^"'");
18 (*FIXME.3.4.03:re-organize from_pblobj_or_detail_thm after rls' --> rls*)
19 fun from_pblobj_or_detail_thm thm' p pt =
20 let val (pbl,p',rls') = par_pbl_det pt p
22 then let (*val _= tracing("### from_pblobj_or_detail_thm: pbl=true")*)
23 val thy' = get_obj g_domID pt p'
24 val {rew_ord',erls,(*asm_thm,*)...} =
25 get_met (get_obj g_metID pt p')
26 (*val _= tracing("### from_pblobj_or_detail_thm: metID= "^
27 (metID2str(get_obj g_metID pt p')))
28 val _= tracing("### from_pblobj_or_detail_thm: erls= "^erls)*)
29 in ("OK",thy',rew_ord',erls,(*put_asm*)false)
31 else ((*tracing("### from_pblobj_or_detail_thm: pbl=false");*)
32 (*case assoc(!ruleset', rls') of !!!FIXME.3.4.03:re-organize !!!
33 NONE => ("unknown ruleset '"^rls'^"'","","",Erls,false)
35 let val thy' = get_obj g_domID pt (par_pblobj pt p)
36 val (rew_ord',erls,(*asm_thm,*)_) = rew_info rls'
37 in ("OK",thy',rew_ord',erls,false) end)
39 (*FIXME.3.4.03:re-organize from_pblobj_or_detail_calc after rls' --> rls*)
40 fun from_pblobj_or_detail_calc scrop p pt =
41 (* val (scrop, p, pt) = (op_, p, pt);
43 let val (pbl,p',rls') = par_pbl_det pt p
45 then let val thy' = get_obj g_domID pt p'
46 val {calc = scr_isa_fns,...} =
47 get_met (get_obj g_metID pt p')
48 val opt = assoc (scr_isa_fns, scrop)
50 SOME isa_fn => ("OK",thy',isa_fn)
51 | NONE => ("applicable_in Calculate: unknown '"^scrop^"'",
53 else (*case assoc(!ruleset', rls') of
54 NONE => ("unknown ruleset '"^rls'^"'","",("",e_evalfn))
55 | SOME rls => !!!FIXME.3.4.03:re-organize from_pblobj_or_detai*)
56 (* val SOME rls = assoc(!ruleset', rls');
58 let val thy' = get_obj g_domID pt (par_pblobj pt p);
59 val (_,_,(*_,*)scr_isa_fns) = rew_info rls'(*rls*)
60 in case assoc (scr_isa_fns, scrop) of
61 SOME isa_fn => ("OK",thy',isa_fn)
62 | NONE => ("applicable_in Calculate: unknown '"^scrop^"'",
65 (*------------------------------------------------------------------*)
67 val op_and = Const ("op &", [bool, bool] ---> bool);
68 (*> (cterm_of thy) (op_and $ Free("a",bool) $ Free("b",bool));
69 val it = "a & b" : cterm
71 fun mk_and a b = op_and $ a $ b;
73 (mk_and (Free("a",bool)) (Free("b",bool)));
74 val it = "a & b" : cterm*)
76 fun mk_and [] = HOLogic.true_const
79 let fun mk t' (t::[]) = op_and $ t' $ t
80 | mk t' (t::ts) = mk (op_and $ t' $ t) ts
82 (*> val pred = map (term_of o the o (parse thy))
83 ["#0 <= #9 + #4 * x","#0 <= sqrt x + sqrt (#-3 + x)"];
84 > (cterm_of thy) (mk_and pred);
85 val it = "#0 <= #9 + #4 * x & #0 <= sqrt x + sqrt (#-3 + x)" : cterm*)
90 (*for Check_elementwise in applicable_in: [x=1,..] Assumptions -> (x,0<=x&..)*)
91 fun mk_set thy pt p (Const ("List.list.Nil",_)) pred = (e_term, [])
93 | mk_set thy pt p (Const ("Tools.UniversalList",_)) pred =
94 (e_term, if pred <> Const ("Script.Assumptions",bool)
96 else (map fst) (get_assumptions_ pt (p,Res)))
98 (* val pred = (term_of o the o (parse thy)) pred;
99 val consts as Const ("List.list.Cons",_) $ eq $ _ = ft;
100 mk_set thy pt p consts pred;
102 | mk_set thy pt p (consts as Const ("List.list.Cons",_) $ eq $ _) pred =
103 let val (bdv,_) = HOLogic.dest_eq eq;
104 val pred = if pred <> Const ("Script.Assumptions",bool)
106 else (map fst) (get_assumptions_ pt (p,Res))
109 | mk_set thy _ _ l _ =
110 error ("check_elementwise: no set " ^ term2str l);
111 (*> val consts = str2term "[x=#4]";
112 > val pred = str2term "Assumptions";
113 > val pt = union_asm pt p
114 [("#0 <= sqrt x + sqrt (#5 + x)",[11]),("#0 <= #9 + #4 * x",[22]),
115 ("#0 <= x ^^^ #2 + #5 * x",[33]),("#0 <= #2 + x",[44])];
117 > val (sss,ttt) = mk_set thy pt p consts pred;
118 > (term2str sss, term2str ttt);
119 val it = ("x","((#0 <= sqrt x + sqrt (#5 + x) & #0 <= #9 + #4 * x) & ...
121 val consts = str2term "UniversalList";
122 val pred = str2term "Assumptions";
128 (*check a list (/set) of constants [c_1,..,c_n] for c_i:set (: in)*)
129 (* val (erls,consts,(bdv,pred)) = (erl,ft,vp);
130 val (consts,(bdv,pred)) = (ft,vp);
132 fun check_elementwise thy erls all_results (bdv, asm) =
133 let (*bdv extracted from ~~~~~~~~~~~ in mk_set already*)
135 let val inst_ = map (subst_atomic [sub]) asm
136 in case eval__true thy 1 inst_ [] erls of
137 (asm', true) => ([HOLogic.mk_eq sub], asm')
138 | (_, false) => ([],[])
140 (*val _= tracing("### check_elementwise: res= "^(term2str all_results)^
141 ", bdv= "^(term2str bdv)^", asm= "^(terms2str asm));*)
142 val c' = isalist2list all_results
143 val c'' = map (snd o HOLogic.dest_eq) c' (*assumes [x=1,x=2,..]*)
144 val subs = map (pair bdv) c''
145 in if asm = [] then (all_results, [])
146 else ((apfst ((list2isalist bool) o flat)) o
147 (apsnd flat) o split_list o (map check)) subs end;
149 > val all_results = str2term "[x=a+b,x=b,x=3]";
150 > val bdv = str2term "x";
151 > val asm = str2term "(x ~= a) & (x ~= b)";
153 > val (t, ts) = check_elementwise thy erls all_results (bdv, asm);
154 > term2str t; tracing(terms2str ts);
155 val it = "[x = a + b, x = b, x = c]" : string
156 ["a + b ~= a & a + b ~= b","b ~= a & b ~= b","c ~= a & c ~= b"]
157 ... with appropriate erls this should be:
158 val it = "[x = a + b, x = c]" : string
159 ["b ~= 0 & a ~= 0", "3 ~= a & 3 ~= b"]
160 ////// because b ~= b False*)
165 > val ct = "((#0 <= #18 & #0 <= sqrt (#5 + #3) + sqrt (#5 - #3)) &\
166 \ #0 <= #25 + #-1 * #3 ^^^ #2) & #0 <= #4";
167 > val SOME(ct',_) = rewrite_set "Isac" false "eval_rls" ct;
168 val ct' = "HOL.True" : cterm'
170 > val ct = "((#0 <= #18 & #0 <= sqrt (#5 + #-3) + sqrt (#5 - #-3)) &\
171 \ #0 <= #25 + #-1 * #-3 ^^^ #2) & #0 <= #4";
172 > val SOME(ct',_) = rewrite_set "Isac" false "eval_rls" ct;
173 val ct' = "HOL.True" : cterm'
176 > val const = (term_of o the o (parse thy)) "(#3::real)";
177 > val pred' = subst_atomic [(bdv,const)] pred;
180 > val consts = (term_of o the o (parse thy)) "[x = #-3, x = #3]";
181 > val bdv = (term_of o the o (parse thy)) "(x::real)";
182 > val pred = (term_of o the o (parse thy))
183 "((#0 <= #18 & #0 <= sqrt (#5 + x) + sqrt (#5 - x)) & #0 <= #25 + #-1 * x ^^^ #2) & #0 <= #4";
184 > val ttt = check_elementwise thy consts (bdv, pred);
185 > (cterm_of thy) ttt;
186 val it = "[x = #-3, x = #3]" : cterm
188 > val consts = (term_of o the o (parse thy)) "[x = #4]";
189 > val bdv = (term_of o the o (parse thy)) "(x::real)";
190 > val pred = (term_of o the o (parse thy))
191 "#0 <= sqrt x + sqrt (#5 + x) & #0 <= #9 + #4 * x & #0 <= x ^^^ #2 + #5 * x & #0 <= #2 + x";
192 > val ttt = check_elementwise thy consts (bdv,pred);
193 > (cterm_of thy) ttt;
194 val it = "[x = #4]" : cterm
196 > val consts = (term_of o the o (parse thy)) "[x = #-12 // #5]";
197 > val bdv = (term_of o the o (parse thy)) "(x::real)";
198 > val pred = (term_of o the o (parse thy))
199 " #0 <= sqrt x + sqrt (#-3 + x) & #0 <= #9 + #4 * x & #0 <= x ^^^ #2 + #-3 * x & #0 <= #6 + x";
200 > val ttt = check_elementwise thy consts (bdv,pred);
201 > (cterm_of thy) ttt;
202 val it = "[]" : cterm*)
205 (* 14.1.01: for Tac-dummies in root-equ only: skip str until "("*)
206 fun split_dummy str =
207 let fun scan s' [] = (implode s', "")
208 | scan s' (s::ss) = if s=" " then (implode s', implode ss)
209 else scan (s'@[s]) ss;
210 in ((scan []) o Symbol.explode) str end;
211 (* split_dummy "subproblem_equation_dummy (x=-#5//#12)";
212 val it = ("subproblem_equation_dummy","(x=-#5//#12)") : string * string
213 > split_dummy "x=-#5//#12";
214 val it = ("x=-#5//#12","") : string * string*)
219 (*.applicability of a tacic wrt. a calc-state (ptree,pos').
220 additionally used by next_tac in the script-interpreter for sequence-tacs.
221 tests for applicability are so expensive, that results (rewrites!)
222 are kept in the return-value of 'type tac_'.
224 fun applicable_in (_:pos') _ (Init_Proof (ct', spec)) =
225 Appl (Init_Proof' (ct', spec))
227 | applicable_in (p,p_) pt Model_Problem =
228 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
229 then Notappl ((tac2str Model_Problem)^
230 " not for pos "^(pos'2str (p,p_)))
231 else let val (PblObj{origin=(_,(_,pI',_),_),...}) = get_obj I pt p
232 val {ppc,...} = get_pbt pI'
233 val pbl = init_pbl ppc
234 in Appl (Model_Problem' (pI', pbl, [])) end
235 (* val Refine_Tacitly pI = m;
237 | applicable_in (p,p_) pt (Refine_Tacitly pI) =
238 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
239 then Notappl ((tac2str (Refine_Tacitly pI))^
240 " not for pos "^(pos'2str (p,p_)))
241 else (* val Refine_Tacitly pI = m;
243 let val (PblObj {origin = (oris, (dI',_,_),_), ...}) = get_obj I pt p;
244 val opt = refine_ori oris pI;
247 Appl (Refine_Tacitly' (pI, pblID,
248 e_domID, e_metID, [](*filled in specify*)))
249 | NONE => Notappl ((tac2str (Refine_Tacitly pI))^
250 " not applicable") end
252 val Refine_Problem pI = m;
254 | applicable_in (p,p_) pt (Refine_Problem pI) =
255 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
256 then Notappl ((tac2str (Refine_Problem pI))^
257 " not for pos "^(pos'2str (p,p_)))
259 let val (PblObj {origin=(_,(dI,_,_),_),spec=(dI',_,_),
260 probl=itms, ...}) = get_obj I pt p;
261 val thy = if dI' = e_domID then dI else dI';
262 val rfopt = refine_pbl (assoc_thy thy) pI itms;
264 NONE => Notappl ((tac2str (Refine_Problem pI))^" not applicable")
265 | SOME (rf as (pI',_)) =>
266 (* val SOME (rf as (pI',_)) = rfopt;
269 then Notappl ((tac2str (Refine_Problem pI))^" not applicable")
270 else Appl (Refine_Problem' rf)
273 (*the specify-tacs have cterm' instead term:
274 parse+error here!!!: see appl_add*)
275 | applicable_in (p,p_) pt (Add_Given ct') =
276 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
277 then Notappl ((tac2str (Add_Given ct'))^
278 " not for pos "^(pos'2str (p,p_)))
279 else Appl (Add_Given' (ct', [(*filled in specify_additem*)]))
280 (*Add_.. should reject (dsc //) (see fmz=[] in sqrt*)
282 | applicable_in (p,p_) pt (Del_Given ct') =
283 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
284 then Notappl ((tac2str (Del_Given ct'))^
285 " not for pos "^(pos'2str (p,p_)))
286 else Appl (Del_Given' ct')
288 | applicable_in (p,p_) pt (Add_Find ct') =
289 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
290 then Notappl ((tac2str (Add_Find ct'))^
291 " not for pos "^(pos'2str (p,p_)))
292 else Appl (Add_Find' (ct', [(*filled in specify_additem*)]))
294 | applicable_in (p,p_) pt (Del_Find ct') =
295 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
296 then Notappl ((tac2str (Del_Find ct'))^
297 " not for pos "^(pos'2str (p,p_)))
298 else Appl (Del_Find' ct')
300 | applicable_in (p,p_) pt (Add_Relation ct') =
301 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
302 then Notappl ((tac2str (Add_Relation ct'))^
303 " not for pos "^(pos'2str (p,p_)))
304 else Appl (Add_Relation' (ct', [(*filled in specify_additem*)]))
306 | applicable_in (p,p_) pt (Del_Relation ct') =
307 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
308 then Notappl ((tac2str (Del_Relation ct'))^
309 " not for pos "^(pos'2str (p,p_)))
310 else Appl (Del_Relation' ct')
312 | applicable_in (p,p_) pt (Specify_Theory dI) =
313 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
314 then Notappl ((tac2str (Specify_Theory dI))^
315 " not for pos "^(pos'2str (p,p_)))
316 else Appl (Specify_Theory' dI)
317 (* val (p,p_) = p; val Specify_Problem pID = m;
318 val Specify_Problem pID = m;
320 | applicable_in (p,p_) pt (Specify_Problem pID) =
321 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
322 then Notappl ((tac2str (Specify_Problem pID))^
323 " not for pos "^(pos'2str (p,p_)))
325 let val (PblObj {origin=(oris,(dI,pI,_),_),spec=(dI',pI',_),
326 probl=itms, ...}) = get_obj I pt p;
327 val thy = assoc_thy (if dI' = e_domID then dI else dI');
328 val {ppc,where_,prls,...} = get_pbt pID;
329 val pbl = if pI'=e_pblID andalso pI=e_pblID
330 then (false, (init_pbl ppc, []))
331 else match_itms_oris thy itms (ppc,where_,prls) oris;
332 in Appl (Specify_Problem' (pID, pbl)) end
333 (* val Specify_Method mID = nxt; val (p,p_) = p;
335 | applicable_in (p,p_) pt (Specify_Method mID) =
336 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
337 then Notappl ((tac2str (Specify_Method mID))^
338 " not for pos "^(pos'2str (p,p_)))
339 else Appl (Specify_Method' (mID,[(*filled in specify*)],
340 [(*filled in specify*)]))
342 | applicable_in (p,p_) pt (Apply_Method mI) =
343 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
344 then Notappl ((tac2str (Apply_Method mI))^
345 " not for pos "^(pos'2str (p,p_)))
346 else Appl (Apply_Method' (mI, NONE, e_istate (*filled in solve*)))
348 | applicable_in (p,p_) pt (Check_Postcond pI) =
349 if member op = [Pbl,Met] p_
350 then Notappl ((tac2str (Check_Postcond pI))^
351 " not for pos "^(pos'2str (p,p_)))
352 else Appl (Check_Postcond'
353 (pI,(e_term,[(*asm in solve*)])))
354 (* in solve -"- ^^^^^^ gets returnvalue of scr*)
356 (*these are always applicable*)
357 | applicable_in (p,p_) _ (Take str) = Appl (Take' (str2term str))
358 | applicable_in (p,p_) _ (Free_Solve) = Appl (Free_Solve')
360 (* val m as Rewrite_Inst (subs, thm') = m;
362 | applicable_in (p,p_) pt (m as Rewrite_Inst (subs, thm')) =
363 if member op = [Pbl,Met] p_
364 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
367 val pp = par_pblobj pt p;
368 val thy' = (get_obj g_domID pt pp):theory';
369 val thy = assoc_thy thy';
370 val {rew_ord'=ro',erls=erls,...} =
371 get_met (get_obj g_metID pt pp);
372 val (f,p) = case p_ of (*p 12.4.00 unnecessary*)
373 Frm => (get_obj g_form pt p, p)
374 | Res => ((fst o (get_obj g_result pt)) p, lev_on p)
375 | _ => error ("applicable_in: call by "^
378 let val subst = subs2subst thy subs;
379 val subs' = subst2subs' subst;
380 in case rewrite_inst_ thy (assoc_rew_ord ro') erls
381 (*put_asm*)false subst (assoc_thm' thy thm') f of
382 SOME (f',asm) => Appl (
383 Rewrite_Inst' (thy',ro',erls,(*put_asm*)false,subst,thm',
384 (*term_of o the o (parse (assoc_thy thy'))*) f,
385 (*(term_of o the o (parse (assoc_thy thy'))*) (f',
386 (*map (term_of o the o (parse (assoc_thy thy')))*) asm)))
387 | NONE => Notappl ((fst thm')^" not applicable") end
388 handle _ => Notappl ("syntax error in "^(subs2str subs)) end
390 (* val ((p,p_), pt, m as Rewrite thm') = (p, pt, m);
391 val ((p,p_), pt, m as Rewrite thm') = (pos, pt, tac);
393 | applicable_in (p,p_) pt (m as Rewrite thm') =
394 if member op = [Pbl,Met] p_
395 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
397 let val (msg,thy',ro,rls',(*put_asm*)_)= from_pblobj_or_detail_thm thm' p pt;
398 val thy = assoc_thy thy';
400 Frm => get_obj g_form pt p
401 | Res => (fst o (get_obj g_result pt)) p
402 | _ => error ("applicable_in Rewrite: call by "^
406 ((*tracing("### applicable_in rls'= "^rls');*)
407 (* val SOME (f',asm)=rewrite thy' ro (id_rls rls') put_asm thm' f;
409 case rewrite_ thy (assoc_rew_ord ro)
410 rls' false (assoc_thm' thy thm') f of
411 SOME (f',asm) => Appl (
412 Rewrite' (thy',ro,rls',(*put_asm*)false,thm', f, (f', asm)))
413 | NONE => Notappl ("'"^(fst thm')^"' not applicable") )
417 | applicable_in (p,p_) pt (m as Rewrite_Asm thm') =
418 if member op = [Pbl,Met] p_
419 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
422 val pp = par_pblobj pt p;
423 val thy' = (get_obj g_domID pt pp):theory';
424 val thy = assoc_thy thy';
425 val {rew_ord'=ro',erls=erls,...} =
426 get_met (get_obj g_metID pt pp);
427 (*val put_asm = true;*)
428 val (f,p) = case p_ of (*p 12.4.00 unnecessary*)
429 Frm => (get_obj g_form pt p, p)
430 | Res => ((fst o (get_obj g_result pt)) p, lev_on p)
431 | _ => error ("applicable_in: call by "^
433 in case rewrite_ thy (assoc_rew_ord ro') erls
434 (*put_asm*)false (assoc_thm' thy thm') f of
435 SOME (f',asm) => Appl (
436 Rewrite' (thy',ro',erls,(*put_asm*)false,thm', f, (f', asm)))
437 | NONE => Notappl ("'"^(fst thm')^"' not applicable") end
439 | applicable_in (p,p_) pt (m as Detail_Set_Inst (subs, rls)) =
440 if member op = [Pbl,Met] p_
441 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
444 val pp = par_pblobj pt p;
445 val thy' = (get_obj g_domID pt pp):theory';
446 val thy = assoc_thy thy';
447 val {rew_ord'=ro',...} = get_met (get_obj g_metID pt pp);
448 val f = case p_ of Frm => get_obj g_form pt p
449 | Res => (fst o (get_obj g_result pt)) p
450 | _ => error ("applicable_in: call by "^
453 let val subst = subs2subst thy subs
454 val subs' = subst2subs' subst
455 in case rewrite_set_inst_ thy false subst (assoc_rls rls) f of
456 SOME (f',asm) => Appl (
457 Detail_Set_Inst' (thy',false,subst,assoc_rls rls, f, (f', asm)))
458 | NONE => Notappl (rls^" not applicable") end
459 handle _ => Notappl ("syntax error in "^(subs2str subs)) end
461 | applicable_in (p,p_) pt (m as Rewrite_Set_Inst (subs, rls)) =
462 if member op = [Pbl,Met] p_
463 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
466 val pp = par_pblobj pt p;
467 val thy' = (get_obj g_domID pt pp):theory';
468 val thy = assoc_thy thy';
469 val {rew_ord'=ro',(*asm_rls=asm_rls,*)...} =
470 get_met (get_obj g_metID pt pp);
471 val (f,p) = case p_ of (*p 12.4.00 unnecessary*)
472 Frm => (get_obj g_form pt p, p)
473 | Res => ((fst o (get_obj g_result pt)) p, lev_on p)
474 | _ => error ("applicable_in: call by "^
477 let val subst = subs2subst thy subs;
478 val subs' = subst2subs' subst;
479 in case rewrite_set_inst_ thy (*put_asm*)false subst (assoc_rls rls) f of
480 SOME (f',asm) => Appl (
481 Rewrite_Set_Inst' (thy',(*put_asm*)false,subst,assoc_rls rls, f, (f', asm)))
482 | NONE => Notappl (rls^" not applicable") end
483 handle _ => Notappl ("syntax error in "^(subs2str subs)) end
485 | applicable_in (p,p_) pt (m as Rewrite_Set rls) =
486 if member op = [Pbl,Met] p_
487 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
490 val pp = par_pblobj pt p;
491 val thy' = (get_obj g_domID pt pp):theory';
492 val (f,p) = case p_ of (*p 12.4.00 unnecessary*)
493 Frm => (get_obj g_form pt p, p)
494 | Res => ((fst o (get_obj g_result pt)) p, lev_on p)
495 | _ => error ("applicable_in: call by "^
497 in case rewrite_set_ (assoc_thy thy') false (assoc_rls rls) f of
499 ((*tracing("#.# applicable_in Rewrite_Set,2f'= "^f');*)
500 Appl (Rewrite_Set' (thy',(*put_asm*)false,assoc_rls rls, f, (f', asm)))
502 | NONE => Notappl (rls^" not applicable") end
504 | applicable_in (p,p_) pt (m as Detail_Set rls) =
505 if member op = [Pbl,Met] p_
506 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
508 let val pp = par_pblobj pt p
509 val thy' = (get_obj g_domID pt pp):theory'
511 Frm => get_obj g_form pt p
512 | Res => (fst o (get_obj g_result pt)) p
513 | _ => error ("applicable_in: call by "^
515 in case rewrite_set_ (assoc_thy thy') false (assoc_rls rls) f of
517 Appl (Detail_Set' (thy',false,assoc_rls rls, f, (f',asm)))
518 | NONE => Notappl (rls^" not applicable") end
521 | applicable_in p pt (End_Ruleset) =
522 error ("applicable_in: not impl. for "^
523 (tac2str End_Ruleset))
525 (* val ((p,p_), pt, (m as Calculate op_)) = (p, pt, m);
527 | applicable_in (p,p_) pt (m as Calculate op_) =
528 if member op = [Pbl,Met] p_
529 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
532 val (msg,thy',isa_fn) = from_pblobj_or_detail_calc op_ p pt;
534 Frm => get_obj g_form pt p
535 | Res => (fst o (get_obj g_result pt)) p
536 in if msg = "OK" then
537 case calculate_ (assoc_thy thy') isa_fn f of
538 SOME (f', (id, thm)) =>
539 Appl (Calculate' (thy',op_, f, (f', (id, string_of_thmI thm))))
540 | NONE => Notappl ("'calculate "^op_^"' not applicable")
544 (*Substitute combines two different kind of "substitution":
545 (1) subst_atomic: for ?a..?z
546 (2) Pattern.match: for solving equational systems
547 (which raises exn for ?a..?z)*)
548 | applicable_in (p,p_) pt (m as Substitute sube) =
549 if member op = [Pbl,Met] p_
550 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
551 else let val pp = par_pblobj pt p
552 val thy = assoc_thy (get_obj g_domID pt pp)
554 Frm => get_obj g_form pt p
555 | Res => (fst o (get_obj g_result pt)) p
556 val {rew_ord',erls,...} = get_met (get_obj g_metID pt pp)
557 val subte = sube2subte sube
558 val subst = sube2subst thy sube
559 in if foldl and_ (true, map contains_Var subte)
561 then let val f' = subst_atomic subst f
562 in if f = f' then Notappl (sube2str sube^" not applicable")
563 else Appl (Substitute' (subte, f, f'))
566 else case rewrite_terms_ thy (assoc_rew_ord rew_ord')
568 SOME (f', _) => Appl (Substitute' (subte, f, f'))
569 | NONE => Notappl (sube2str sube^" not applicable")
571 (*-------WN08114 interrupted with error in polyminus.sml "11 = 11"
572 | applicable_in (p,p_) pt (m as Substitute sube) =
573 if member op = [Pbl,Met] p_
574 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
575 else let val pp = par_pblobj pt p
576 val thy = assoc_thy (get_obj g_domID pt pp)
578 Frm => get_obj g_form pt p
579 | Res => (fst o (get_obj g_result pt)) p
580 val {rew_ord',erls,...} = get_met (get_obj g_metID pt pp)
581 val subte = sube2subte sube
582 in case rewrite_terms_ thy (assoc_rew_ord rew_ord') erls subte f of
583 SOME (f', _) => Appl (Substitute' (subte, f, f'))
584 | NONE => Notappl (sube2str sube^" not applicable")
588 | applicable_in p pt (Apply_Assumption cts') =
589 (error ("applicable_in: not impl. for "^
590 (tac2str (Apply_Assumption cts'))))
592 (*'logical' applicability wrt. script in locate: Inconsistent?*)
593 | applicable_in (p,p_) pt (m as Take ct') =
594 if member op = [Pbl,Met] p_
595 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
597 let val thy' = get_obj g_domID pt (par_pblobj pt p);
598 in (case parse (assoc_thy thy') ct' of
599 SOME ct => Appl (Take' (term_of ct))
600 | NONE => Notappl ("syntax error in "^ct'))
603 | applicable_in p pt (Take_Inst ct') =
604 error ("applicable_in: not impl. for "^
605 (tac2str (Take_Inst ct')))
607 | applicable_in p pt (Group (con, ints)) =
608 error ("applicable_in: not impl. for "^
609 (tac2str (Group (con, ints))))
611 | applicable_in (p,p_) pt (m as Subproblem (domID, pblID)) =
612 if member op = [Pbl,Met] p_
613 then (*maybe Apply_Method has already been done*)
614 case get_obj g_env pt p of
615 SOME is => Appl (Subproblem' ((domID, pblID, e_metID), [],
616 e_term, [], subpbl domID pblID))
617 | NONE => Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
618 else (*somewhere later in the script*)
619 Appl (Subproblem' ((domID, pblID, e_metID), [],
620 e_term, [], subpbl domID pblID))
622 | applicable_in p pt (End_Subproblem) =
623 error ("applicable_in: not impl. for "^
624 (tac2str (End_Subproblem)))
626 | applicable_in p pt (CAScmd ct') =
627 error ("applicable_in: not impl. for "^
628 (tac2str (CAScmd ct')))
630 | applicable_in p pt (Split_And) =
631 error ("applicable_in: not impl. for "^
632 (tac2str (Split_And)))
633 | applicable_in p pt (Conclude_And) =
634 error ("applicable_in: not impl. for "^
635 (tac2str (Conclude_And)))
636 | applicable_in p pt (Split_Or) =
637 error ("applicable_in: not impl. for "^
638 (tac2str (Split_Or)))
639 | applicable_in p pt (Conclude_Or) =
640 error ("applicable_in: not impl. for "^
641 (tac2str (Conclude_Or)))
643 | applicable_in (p,p_) pt (Begin_Trans) =
645 val (f,p) = case p_ of (*p 12.4.00 unnecessary*)
646 (*_____ implizit Take in gen*)
647 Frm => (get_obj g_form pt p, (lev_on o lev_dn) p)
648 | Res => ((fst o (get_obj g_result pt)) p, (lev_on o lev_dn o lev_on) p)
649 | _ => error ("applicable_in: call by "^
651 val thy' = get_obj g_domID pt (par_pblobj pt p);
652 in (Appl (Begin_Trans' f))
653 handle _ => error ("applicable_in: Begin_Trans finds \
654 \syntaxerror in '"^(term2str f)^"'") end
656 (*TODO: check parent branches*)
657 | applicable_in (p,p_) pt (End_Trans) =
658 let val thy' = get_obj g_domID pt (par_pblobj pt p);
660 then Appl (End_Trans' (get_obj g_result pt p))
661 else Notappl "'End_Trans' is not applicable at \
662 \the beginning of a transitive sequence"
663 (*TODO: check parent branches*)
666 | applicable_in p pt (Begin_Sequ) =
667 error ("applicable_in: not impl. for "^
668 (tac2str (Begin_Sequ)))
669 | applicable_in p pt (End_Sequ) =
670 error ("applicable_in: not impl. for "^
671 (tac2str (End_Sequ)))
672 | applicable_in p pt (Split_Intersect) =
673 error ("applicable_in: not impl. for "^
674 (tac2str (Split_Intersect)))
675 | applicable_in p pt (End_Intersect) =
676 error ("applicable_in: not impl. for "^
677 (tac2str (End_Intersect)))
678 (* val Appl (Check_elementwse'(t1,"Assumptions",t2)) = it;
681 val Check_elementwise pred = m;
683 val ((p,p_), Check_elementwise pred) = (p, m);
685 | applicable_in (p,p_) pt (m as Check_elementwise pred) =
686 if member op = [Pbl,Met] p_
687 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
690 val pp = par_pblobj pt p;
691 val thy' = (get_obj g_domID pt pp):theory';
692 val thy = assoc_thy thy'
693 val metID = (get_obj g_metID pt pp)
694 val {crls,...} = get_met metID
695 (*val _=tracing("### applicable_in Check_elementwise: crls= "^crls)
696 val _=tracing("### applicable_in Check_elementwise: pred= "^pred)*)
697 (*val erl = the (assoc'(!ruleset',crls))*)
698 val (f,asm) = case p_ of
699 Frm => (get_obj g_form pt p , [])
700 | Res => get_obj g_result pt p;
701 (*val _= tracing("### applicable_in Check_elementwise: f= "^f);*)
702 val vp = mk_set thy pt p f ((term_of o the o (parse thy)) pred);
703 (*val (v,p)=vp;val _=tracing("### applicable_in Check_elementwise: vp= "^
704 pair2str(term2str v,term2str p))*)
706 Const ("List.list.Cons",_) $ _ $ _ =>
707 Appl (Check_elementwise'
709 ((*tracing("### applicable_in Check_elementwise: --> "^
710 (res2str (check_elementwise thy crls f vp)));*)
711 check_elementwise thy crls f vp)))
712 | Const ("Tools.UniversalList",_) =>
713 Appl (Check_elementwise' (f, pred, (f,asm)))
714 | Const ("List.list.Nil",_) =>
715 (*Notappl "not applicable to empty list" 3.6.03*)
716 Appl (Check_elementwise' (f, pred, (f,asm(*[] 11.6.03???*))))
717 | _ => Notappl ("not applicable: "^(term2str f)^" should be constants")
720 | applicable_in (p,p_) pt Or_to_List =
721 if member op = [Pbl,Met] p_
722 then Notappl ((tac2str Or_to_List)^" not for pos "^(pos'2str (p,p_)))
725 val pp = par_pblobj pt p;
726 val thy' = (get_obj g_domID pt pp):theory';
727 val thy = assoc_thy thy';
729 Frm => get_obj g_form pt p
730 | Res => (fst o (get_obj g_result pt)) p;
731 in (let val ls = or2list f
732 in Appl (Or_to_List' (f, ls)) end)
733 handle _ => Notappl ("'Or_to_List' not applicable to "^(term2str f))
736 | applicable_in p pt (Collect_Trues) =
737 error ("applicable_in: not impl. for "^
738 (tac2str (Collect_Trues)))
740 | applicable_in p pt (Empty_Tac) =
741 Notappl "Empty_Tac is not applicable"
743 | applicable_in (p,p_) pt (Tac id) =
745 val pp = par_pblobj pt p;
746 val thy' = (get_obj g_domID pt pp):theory';
747 val thy = assoc_thy thy';
749 Frm => get_obj g_form pt p
750 | Res => (fst o (get_obj g_result pt)) p;
752 "subproblem_equation_dummy" =>
754 then Appl (Tac_ (thy, term2str f, id,
755 "subproblem_equation_dummy ("^(term2str f)^")"))
756 else Notappl "applicable only to equations made explicit"
757 | "solve_equation_dummy" =>
758 let (*val _= tracing("### applicable_in: solve_equation_dummy: f= "
760 val (id',f') = split_dummy (term2str f);
761 (*val _= tracing("### applicable_in: f'= "^f');*)
762 (*val _= (term_of o the o (parse thy)) f';*)
763 (*val _= tracing"### applicable_in: solve_equation_dummy";*)
764 in if id' <> "subproblem_equation_dummy" then Notappl "no subproblem"
765 else if is_expliceq ((term_of o the o (parse thy)) f')
766 then Appl (Tac_ (thy, term2str f, id, "[" ^ f' ^ "]"))
767 else error ("applicable_in: f= " ^ f') end
768 | _ => Appl (Tac_ (thy, term2str f, id, term2str f)) end
770 | applicable_in p pt End_Proof' = Appl End_Proof''
772 | applicable_in _ _ m =
773 error ("applicable_in called for "^(tac2str m));
776 fun tac2tac_ pt p m =
777 case applicable_in p pt m of
779 | Notappl _ => error ("tac2mstp': fails with"^