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 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 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 script-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)) = Appl (Init_Proof' (ct', spec))
226 | applicable_in (p,p_) pt Model_Problem =
227 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
228 then Notappl ((tac2str Model_Problem) ^ " not for pos " ^ (pos'2str (p,p_)))
231 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
236 | applicable_in (p,p_) pt (Refine_Tacitly pI) =
237 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
238 then Notappl ((tac2str (Refine_Tacitly pI)) ^ " not for pos " ^ (pos'2str (p,p_)))
241 val (PblObj {origin = (oris, (dI',_,_),_), ...}) = get_obj I pt p;
242 val opt = refine_ori oris pI;
245 Appl (Refine_Tacitly' (pI, pblID,
246 e_domID, e_metID, [](*filled in specify*)))
247 | NONE => Notappl ((tac2str (Refine_Tacitly pI)) ^ " not applicable")
250 | applicable_in (p,p_) pt (Refine_Problem pI) =
251 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
252 then Notappl ((tac2str (Refine_Problem pI))^
253 " not for pos "^(pos'2str (p,p_)))
255 let val (PblObj {origin=(_,(dI,_,_),_),spec=(dI',_,_),
256 probl=itms, ...}) = get_obj I pt p;
257 val thy = if dI' = e_domID then dI else dI';
258 val rfopt = refine_pbl (assoc_thy thy) pI itms;
260 NONE => Notappl ((tac2str (Refine_Problem pI))^" not applicable")
261 | SOME (rf as (pI',_)) =>
262 (* val SOME (rf as (pI',_)) = rfopt;
265 then Notappl ((tac2str (Refine_Problem pI))^" not applicable")
266 else Appl (Refine_Problem' rf)
269 (*the specify-tacs have cterm' instead term:
270 parse+error here!!!: see appl_add*)
271 | applicable_in (p,p_) pt (Add_Given ct') =
272 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
273 then Notappl ((tac2str (Add_Given ct'))^
274 " not for pos "^(pos'2str (p,p_)))
275 else Appl (Add_Given' (ct', [(*filled in specify_additem*)]))
276 (*Add_.. should reject (dsc //) (see fmz=[] in sqrt*)
278 | applicable_in (p,p_) pt (Del_Given ct') =
279 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
280 then Notappl ((tac2str (Del_Given ct'))^
281 " not for pos "^(pos'2str (p,p_)))
282 else Appl (Del_Given' ct')
284 | applicable_in (p,p_) pt (Add_Find ct') =
285 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
286 then Notappl ((tac2str (Add_Find ct'))^
287 " not for pos "^(pos'2str (p,p_)))
288 else Appl (Add_Find' (ct', [(*filled in specify_additem*)]))
290 | applicable_in (p,p_) pt (Del_Find ct') =
291 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
292 then Notappl ((tac2str (Del_Find ct'))^
293 " not for pos "^(pos'2str (p,p_)))
294 else Appl (Del_Find' ct')
296 | applicable_in (p,p_) pt (Add_Relation ct') =
297 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
298 then Notappl ((tac2str (Add_Relation ct'))^
299 " not for pos "^(pos'2str (p,p_)))
300 else Appl (Add_Relation' (ct', [(*filled in specify_additem*)]))
302 | applicable_in (p,p_) pt (Del_Relation ct') =
303 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
304 then Notappl ((tac2str (Del_Relation ct'))^
305 " not for pos "^(pos'2str (p,p_)))
306 else Appl (Del_Relation' ct')
308 | applicable_in (p,p_) pt (Specify_Theory dI) =
309 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
310 then Notappl ((tac2str (Specify_Theory dI))^
311 " not for pos "^(pos'2str (p,p_)))
312 else Appl (Specify_Theory' dI)
313 (* val (p,p_) = p; val Specify_Problem pID = m;
314 val Specify_Problem pID = m;
316 | applicable_in (p,p_) pt (Specify_Problem pID) =
317 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
318 then Notappl ((tac2str (Specify_Problem pID))^
319 " not for pos "^(pos'2str (p,p_)))
321 let val (PblObj {origin=(oris,(dI,pI,_),_),spec=(dI',pI',_),
322 probl=itms, ...}) = get_obj I pt p;
323 val thy = assoc_thy (if dI' = e_domID then dI else dI');
324 val {ppc,where_,prls,...} = get_pbt pID;
325 val pbl = if pI'=e_pblID andalso pI=e_pblID
326 then (false, (init_pbl ppc, []))
327 else match_itms_oris thy itms (ppc,where_,prls) oris;
328 in Appl (Specify_Problem' (pID, pbl)) end
329 (* val Specify_Method mID = nxt; val (p,p_) = p;
331 | applicable_in (p,p_) pt (Specify_Method mID) =
332 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
333 then Notappl ((tac2str (Specify_Method mID))^
334 " not for pos "^(pos'2str (p,p_)))
335 else Appl (Specify_Method' (mID,[(*filled in specify*)],
336 [(*filled in specify*)]))
338 | applicable_in (p,p_) pt (Apply_Method mI) =
339 if not (is_pblobj (get_obj I pt p)) orelse p_ = Res
340 then Notappl ((tac2str (Apply_Method mI)) ^ " not for pos " ^ (pos'2str (p,p_)))
343 val (PblObj{origin = (_, (dI, pI, _), _), probl, ctxt, ...}) = get_obj I pt p;
344 val {where_, ...} = get_pbt pI
345 val pres = map (mk_env probl |> subst_atomic) where_
348 then assoc_thy dI |> ProofContext.init_global |> insert_assumptions pres
350 (*TODO.WN110416 here do evalprecond according to fun check_preconds'
351 and then decide on Notappl/Appl accordingly once more.
352 Implement after all tests are running, since this changes
353 overall system behavior*)
354 in Appl (Apply_Method' (mI, NONE, e_istate (*filled in solve*), ctxt)) end
356 | applicable_in (p,p_) pt (Check_Postcond pI) =
357 if member op = [Pbl,Met] p_
358 then Notappl ((tac2str (Check_Postcond pI)) ^ " not for pos "^(pos'2str (p,p_)))
359 else Appl (Check_Postcond' (pI, (e_term, [(*in solve assigned the returnvalue of scr*)])))
361 (*these are always applicable*)
362 | applicable_in (p,p_) _ (Take str) = Appl (Take' (str2term str))
363 | applicable_in (p,p_) _ (Free_Solve) = Appl (Free_Solve')
365 | applicable_in (p,p_) pt (m as Rewrite_Inst (subs, thm')) =
366 if member op = [Pbl,Met] p_
367 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
370 val pp = par_pblobj pt p;
371 val thy' = (get_obj g_domID pt pp):theory';
372 val thy = assoc_thy thy';
373 val {rew_ord'=ro',erls=erls,...} =
374 get_met (get_obj g_metID pt pp);
375 val (f,p) = case p_ of (*p 12.4.00 unnecessary*)
376 Frm => (get_obj g_form pt p, p)
377 | Res => ((fst o (get_obj g_result pt)) p, lev_on p)
378 | _ => error ("applicable_in: call by "^
381 let val subst = subs2subst thy subs;
382 val subs' = subst2subs' subst;
383 in case rewrite_inst_ thy (assoc_rew_ord ro') erls
384 (*put_asm*)false subst (assoc_thm' thy thm') f of
385 SOME (f',asm) => Appl (
386 Rewrite_Inst' (thy',ro',erls,(*put_asm*)false,subst,thm',
387 (*term_of o the o (parse (assoc_thy thy'))*) f,
388 (*(term_of o the o (parse (assoc_thy thy'))*) (f',
389 (*map (term_of o the o (parse (assoc_thy thy')))*) asm)))
390 | NONE => Notappl ((fst thm')^" not applicable") end
391 handle _ => Notappl ("syntax error in "^(subs2str subs)) end
393 (* val ((p,p_), pt, m as Rewrite thm') = (p, pt, m);
394 val ((p,p_), pt, m as Rewrite thm') = (pos, pt, tac);
396 | applicable_in (p,p_) pt (m as Rewrite thm') =
397 if member op = [Pbl,Met] p_
398 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
400 let val (msg,thy',ro,rls',(*put_asm*)_)= from_pblobj_or_detail_thm thm' p pt;
401 val thy = assoc_thy thy';
403 Frm => get_obj g_form pt p
404 | Res => (fst o (get_obj g_result pt)) p
405 | _ => error ("applicable_in Rewrite: call by "^
409 ((*tracing("### applicable_in rls'= "^rls');*)
410 (* val SOME (f',asm)=rewrite thy' ro (id_rls rls') put_asm thm' f;
412 case rewrite_ thy (assoc_rew_ord ro)
413 rls' false (assoc_thm' thy thm') f of
414 SOME (f',asm) => Appl (
415 Rewrite' (thy',ro,rls',(*put_asm*)false,thm', f, (f', asm)))
416 | NONE => Notappl ("'"^(fst thm')^"' not applicable") )
420 | applicable_in (p,p_) pt (m as Rewrite_Asm thm') =
421 if member op = [Pbl,Met] p_
422 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
425 val pp = par_pblobj pt p;
426 val thy' = (get_obj g_domID pt pp):theory';
427 val thy = assoc_thy thy';
428 val {rew_ord'=ro',erls=erls,...} =
429 get_met (get_obj g_metID pt pp);
430 (*val put_asm = true;*)
431 val (f,p) = case p_ of (*p 12.4.00 unnecessary*)
432 Frm => (get_obj g_form pt p, p)
433 | Res => ((fst o (get_obj g_result pt)) p, lev_on p)
434 | _ => error ("applicable_in: call by "^
436 in case rewrite_ thy (assoc_rew_ord ro') erls
437 (*put_asm*)false (assoc_thm' thy thm') f of
438 SOME (f',asm) => Appl (
439 Rewrite' (thy',ro',erls,(*put_asm*)false,thm', f, (f', asm)))
440 | NONE => Notappl ("'"^(fst thm')^"' not applicable") end
442 | applicable_in (p,p_) pt (m as Detail_Set_Inst (subs, rls)) =
443 if member op = [Pbl,Met] p_
444 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
447 val pp = par_pblobj pt p;
448 val thy' = (get_obj g_domID pt pp):theory';
449 val thy = assoc_thy thy';
450 val {rew_ord'=ro',...} = get_met (get_obj g_metID pt pp);
451 val f = case p_ of Frm => get_obj g_form pt p
452 | Res => (fst o (get_obj g_result pt)) p
453 | _ => error ("applicable_in: call by "^
456 let val subst = subs2subst thy subs
457 val subs' = subst2subs' subst
458 in case rewrite_set_inst_ thy false subst (assoc_rls rls) f of
459 SOME (f',asm) => Appl (
460 Detail_Set_Inst' (thy',false,subst,assoc_rls rls, f, (f', asm)))
461 | NONE => Notappl (rls^" not applicable") end
462 handle _ => Notappl ("syntax error in "^(subs2str subs)) end
464 | applicable_in (p,p_) pt (m as Rewrite_Set_Inst (subs, rls)) =
465 if member op = [Pbl,Met] p_
466 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
469 val pp = par_pblobj pt p;
470 val thy' = (get_obj g_domID pt pp):theory';
471 val thy = assoc_thy thy';
472 val {rew_ord'=ro',(*asm_rls=asm_rls,*)...} =
473 get_met (get_obj g_metID pt pp);
474 val (f,p) = case p_ of (*p 12.4.00 unnecessary*)
475 Frm => (get_obj g_form pt p, p)
476 | Res => ((fst o (get_obj g_result pt)) p, lev_on p)
477 | _ => error ("applicable_in: call by "^
480 let val subst = subs2subst thy subs;
481 val subs' = subst2subs' subst;
482 in case rewrite_set_inst_ thy (*put_asm*)false subst (assoc_rls rls) f of
483 SOME (f',asm) => Appl (
484 Rewrite_Set_Inst' (thy',(*put_asm*)false,subst,assoc_rls rls, f, (f', asm)))
485 | NONE => Notappl (rls^" not applicable") end
486 handle _ => Notappl ("syntax error in "^(subs2str subs)) end
488 | applicable_in (p,p_) pt (m as Rewrite_Set rls) =
489 if member op = [Pbl,Met] p_
490 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
493 val pp = par_pblobj pt p;
494 val thy' = (get_obj g_domID pt pp):theory';
495 val (f,p) = case p_ of (*p 12.4.00 unnecessary*)
496 Frm => (get_obj g_form pt p, p)
497 | Res => ((fst o (get_obj g_result pt)) p, lev_on p)
498 | _ => error ("applicable_in: call by "^
500 in case rewrite_set_ (assoc_thy thy') false (assoc_rls rls) f of
502 ((*tracing("#.# applicable_in Rewrite_Set,2f'= "^f');*)
503 Appl (Rewrite_Set' (thy',(*put_asm*)false,assoc_rls rls, f, (f', asm)))
505 | NONE => Notappl (rls^" not applicable") end
507 | applicable_in (p,p_) pt (m as Detail_Set rls) =
508 if member op = [Pbl,Met] p_
509 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
511 let val pp = par_pblobj pt p
512 val thy' = (get_obj g_domID pt pp):theory'
514 Frm => get_obj g_form pt p
515 | Res => (fst o (get_obj g_result pt)) p
516 | _ => error ("applicable_in: call by "^
518 in case rewrite_set_ (assoc_thy thy') false (assoc_rls rls) f of
520 Appl (Detail_Set' (thy',false,assoc_rls rls, f, (f',asm)))
521 | NONE => Notappl (rls^" not applicable") end
524 | applicable_in p pt (End_Ruleset) =
525 error ("applicable_in: not impl. for "^
526 (tac2str End_Ruleset))
528 (* val ((p,p_), pt, (m as Calculate op_)) = (p, pt, m);
530 | applicable_in (p,p_) pt (m as Calculate op_) =
531 if member op = [Pbl,Met] p_
532 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
535 val (msg,thy',isa_fn) = from_pblobj_or_detail_calc op_ p pt;
537 Frm => get_obj g_form pt p
538 | Res => (fst o (get_obj g_result pt)) p
539 in if msg = "OK" then
540 case calculate_ (assoc_thy thy') isa_fn f of
541 SOME (f', (id, thm)) =>
542 Appl (Calculate' (thy',op_, f, (f', (id, string_of_thmI thm))))
543 | NONE => Notappl ("'calculate "^op_^"' not applicable")
547 (*Substitute combines two different kind of "substitution":
548 (1) subst_atomic: for ?a..?z
549 (2) Pattern.match: for solving equational systems
550 (which raises exn for ?a..?z)*)
551 | applicable_in (p,p_) pt (m as Substitute sube) =
552 if member op = [Pbl,Met] p_
553 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
554 else let val pp = par_pblobj pt p
555 val thy = assoc_thy (get_obj g_domID pt pp)
557 Frm => get_obj g_form pt p
558 | Res => (fst o (get_obj g_result pt)) p
559 val {rew_ord',erls,...} = get_met (get_obj g_metID pt pp)
560 val subte = sube2subte sube
561 val subst = sube2subst thy sube
562 in if foldl and_ (true, map contains_Var subte)
564 then let val f' = subst_atomic subst f
565 in if f = f' then Notappl (sube2str sube^" not applicable")
566 else Appl (Substitute' (subte, f, f'))
569 else case rewrite_terms_ thy (assoc_rew_ord rew_ord')
571 SOME (f', _) => Appl (Substitute' (subte, f, f'))
572 | NONE => Notappl (sube2str sube^" not applicable")
574 (*-------WN08114 interrupted with error in polyminus.sml "11 = 11"
575 | applicable_in (p,p_) pt (m as Substitute sube) =
576 if member op = [Pbl,Met] p_
577 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
578 else let val pp = par_pblobj pt p
579 val thy = assoc_thy (get_obj g_domID pt pp)
581 Frm => get_obj g_form pt p
582 | Res => (fst o (get_obj g_result pt)) p
583 val {rew_ord',erls,...} = get_met (get_obj g_metID pt pp)
584 val subte = sube2subte sube
585 in case rewrite_terms_ thy (assoc_rew_ord rew_ord') erls subte f of
586 SOME (f', _) => Appl (Substitute' (subte, f, f'))
587 | NONE => Notappl (sube2str sube^" not applicable")
591 | applicable_in p pt (Apply_Assumption cts') =
592 (error ("applicable_in: not impl. for " ^ (tac2str (Apply_Assumption cts'))))
594 (*'logical' applicability wrt. script in locate: Inconsistent?*)
595 | applicable_in (p,p_) pt (m as Take ct') =
596 if member op = [Pbl,Met] p_
597 then Notappl (tac2str m ^ " not for pos " ^ pos'2str (p,p_))
599 let val thy' = get_obj g_domID pt (par_pblobj pt p);
600 in (case parseNEW (assoc_thy thy' |> thy2ctxt) ct' of
601 SOME ct => Appl (Take' ct)
602 | NONE => Notappl ("syntax error in " ^ ct'))
605 | applicable_in p pt (Take_Inst ct') =
606 error ("applicable_in: not impl. for " ^ tac2str (Take_Inst ct'))
607 | applicable_in p pt (Group (con, ints)) =
608 error ("applicable_in: not impl. for " ^ tac2str (Group (con, ints)))
610 | applicable_in (p,p_) pt (m as Subproblem (domID, pblID)) =
611 if member op = [Pbl,Met] p_
612 then (*maybe Apply_Method has already been done FIXME.WN150511: declare_constraints*)
613 case get_obj g_env pt p of
615 Appl (Subproblem' ((domID, pblID, e_metID), [],
616 e_term, [], e_ctxt(*FIXME.WN150511*), 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, [], e_ctxt, subpbl domID pblID))
622 | applicable_in p pt (End_Subproblem) =
623 error ("applicable_in: not impl. for " ^ tac2str End_Subproblem)
624 | applicable_in p pt (CAScmd ct') =
625 error ("applicable_in: not impl. for " ^ tac2str (CAScmd ct'))
626 | applicable_in p pt (Split_And) =
627 error ("applicable_in: not impl. for " ^ tac2str Split_And)
628 | applicable_in p pt (Conclude_And) =
629 error ("applicable_in: not impl. for " ^ tac2str Conclude_And)
630 | applicable_in p pt (Split_Or) =
631 error ("applicable_in: not impl. for " ^ tac2str Split_Or)
632 | applicable_in p pt (Conclude_Or) =
633 error ("applicable_in: not impl. for " ^ tac2str Conclude_Or)
635 | applicable_in (p,p_) pt (Begin_Trans) =
637 val (f,p) = case p_ of (*p 12.4.00 unnecessary*)
638 (*_____ implizit Take in gen*)
639 Frm => (get_obj g_form pt p, (lev_on o lev_dn) p)
640 | Res => ((fst o (get_obj g_result pt)) p, (lev_on o lev_dn o lev_on) p)
641 | _ => error ("applicable_in: call by "^
643 val thy' = get_obj g_domID pt (par_pblobj pt p);
644 in (Appl (Begin_Trans' f))
645 handle _ => error ("applicable_in: Begin_Trans finds \
646 \syntaxerror in '"^(term2str f)^"'") end
648 (*TODO: check parent branches*)
649 | applicable_in (p,p_) pt (End_Trans) =
650 let val thy' = get_obj g_domID pt (par_pblobj pt p);
652 then Appl (End_Trans' (get_obj g_result pt p))
653 else Notappl "'End_Trans' is not applicable at \
654 \the beginning of a transitive sequence"
655 (*TODO: check parent branches*)
658 | applicable_in p pt (Begin_Sequ) =
659 error ("applicable_in: not impl. for "^
660 (tac2str (Begin_Sequ)))
661 | applicable_in p pt (End_Sequ) =
662 error ("applicable_in: not impl. for "^
663 (tac2str (End_Sequ)))
664 | applicable_in p pt (Split_Intersect) =
665 error ("applicable_in: not impl. for "^
666 (tac2str (Split_Intersect)))
667 | applicable_in p pt (End_Intersect) =
668 error ("applicable_in: not impl. for "^
669 (tac2str (End_Intersect)))
670 (* val Appl (Check_elementwse'(t1,"Assumptions",t2)) = it;
673 val Check_elementwise pred = m;
675 val ((p,p_), Check_elementwise pred) = (p, m);
677 | applicable_in (p,p_) pt (m as Check_elementwise pred) =
678 if member op = [Pbl,Met] p_
679 then Notappl ((tac2str m)^" not for pos "^(pos'2str (p,p_)))
682 val pp = par_pblobj pt p;
683 val thy' = (get_obj g_domID pt pp):theory';
684 val thy = assoc_thy thy'
685 val metID = (get_obj g_metID pt pp)
686 val {crls,...} = get_met metID
687 (*val _=tracing("### applicable_in Check_elementwise: crls= "^crls)
688 val _=tracing("### applicable_in Check_elementwise: pred= "^pred)*)
689 (*val erl = the (assoc'(!ruleset',crls))*)
690 val (f,asm) = case p_ of
691 Frm => (get_obj g_form pt p , [])
692 | Res => get_obj g_result pt p;
693 (*val _= tracing("### applicable_in Check_elementwise: f= "^f);*)
694 val vp = (thy2ctxt thy, pred) |-> parseNEW |> the |> mk_set thy pt p f;
695 (*val (v,p)=vp;val _=tracing("### applicable_in Check_elementwise: vp= "^
696 pair2str(term2str v,term2str p))*)
698 Const ("List.list.Cons",_) $ _ $ _ =>
699 Appl (Check_elementwise'
701 ((*tracing("### applicable_in Check_elementwise: --> "^
702 (res2str (check_elementwise thy crls f vp)));*)
703 check_elementwise thy crls f vp)))
704 | Const ("Tools.UniversalList",_) =>
705 Appl (Check_elementwise' (f, pred, (f,asm)))
706 | Const ("List.list.Nil",_) =>
707 (*Notappl "not applicable to empty list" 3.6.03*)
708 Appl (Check_elementwise' (f, pred, (f,asm(*[] 11.6.03???*))))
709 | _ => Notappl ("not applicable: "^(term2str f)^" should be constants")
712 | applicable_in (p,p_) pt Or_to_List =
713 if member op = [Pbl,Met] p_
714 then Notappl ((tac2str Or_to_List)^" not for pos "^(pos'2str (p,p_)))
717 val pp = par_pblobj pt p;
718 val thy' = (get_obj g_domID pt pp):theory';
719 val thy = assoc_thy thy';
721 Frm => get_obj g_form pt p
722 | Res => (fst o (get_obj g_result pt)) p;
723 in (let val ls = or2list f
724 in Appl (Or_to_List' (f, ls)) end)
725 handle _ => Notappl ("'Or_to_List' not applicable to "^(term2str f))
728 | applicable_in p pt (Collect_Trues) =
729 error ("applicable_in: not impl. for "^
730 (tac2str (Collect_Trues)))
732 | applicable_in p pt (Empty_Tac) =
733 Notappl "Empty_Tac is not applicable"
735 | applicable_in (p,p_) pt (Tac id) =
737 val pp = par_pblobj pt p;
738 val thy' = (get_obj g_domID pt pp):theory';
739 val thy = assoc_thy thy';
741 Frm => get_obj g_form pt p
742 | Pbl => error "applicable_in (p,Pbl) pt (Tac id): not at Pbl"
743 | Res => (fst o (get_obj g_result pt)) p;
745 "subproblem_equation_dummy" =>
747 then Appl (Tac_ (thy, term2str f, id,
748 "subproblem_equation_dummy ("^(term2str f)^")"))
749 else Notappl "applicable only to equations made explicit"
750 | "solve_equation_dummy" =>
751 let (*val _= tracing("### applicable_in: solve_equation_dummy: f= "
753 val (id',f') = split_dummy (term2str f);
754 (*val _= tracing("### applicable_in: f'= "^f');*)
755 (*val _= (term_of o the o (parse thy)) f';*)
756 (*val _= tracing"### applicable_in: solve_equation_dummy";*)
757 in if id' <> "subproblem_equation_dummy" then Notappl "no subproblem"
758 else if (thy2ctxt thy, f') |-> parseNEW |> the |> is_expliceq
759 then Appl (Tac_ (thy, term2str f, id, "[" ^ f' ^ "]"))
760 else error ("applicable_in: f= " ^ f') end
761 | _ => Appl (Tac_ (thy, term2str f, id, term2str f)) end
763 | applicable_in p pt End_Proof' = Appl End_Proof''
765 | applicable_in _ _ m =
766 error ("applicable_in called for "^(tac2str m));
769 fun tac2tac_ pt p m =
770 case applicable_in p pt m of
772 | Notappl _ => error ("tac2mstp': fails with"^