1 (* use"ME/generate.sml";
5 (*.initialize istate for Detail_Set.*)
7 fun init_istate (Rewrite_Set rls) =
8 (* val (Rewrite_Set rls) = (get_obj g_tac pt p);
10 (case assoc_rls rls of
11 Rrls {scr=sc as Rfuns {init_state=ii,...},...} => (RrlsState (ii t))
12 (* val Rrls {scr=sc as Rfuns {init_state=ii,...},...} = assoc_rls rls;
14 | Rls {scr=EmptyScr,...} =>
15 error ("interSteps>..>init_istate: \""^rls^"\" has EmptyScr."
16 ^"use prep_rls for storing rule-sets !")
17 | Rls {scr=Script s,...} =>
18 (* val Rls {scr=Script s,...} = assoc_rls rls;
20 (ScrState ([(one_scr_arg s, t)], [], NONE, e_term, Sundef, true))
21 | Seq {scr=EmptyScr,...} =>
22 error ("interSteps>..>init_istate: \""^rls^"\" has EmptyScr."
23 ^"use prep_rls for storing rule-sets !")
24 | Seq {srls=srls,scr=Script s,...} =>
25 (ScrState ([(one_scr_arg s, t)], [], NONE, e_term, Sundef, true)))
26 | init_istate (Rewrite_Set_Inst (subs, rls)) =
27 (* val (Rewrite_Set_Inst (subs, rls)) = (get_obj g_tac pt p);
29 let val (_, v)::_ = subs2subst (assoc_thy "Isac") subs
30 in case assoc_rls rls of
31 Rls {scr=EmptyScr,...} =>
32 error ("interSteps>..>init_istate: \""^rls^"\" has EmptyScr."
33 ^"use prep_rls for storing rule-sets !")
34 | Rls {scr=Script s,...} =>
35 let val (a1, a2) = two_scr_arg s
36 in (ScrState ([(a1, v), (a2, t)],[], NONE, e_term, Sundef,true)) end
37 | Seq {scr=EmptyScr,...} =>
38 error ("interSteps>..>init_istate: \""^rls^"\" has EmptyScr."
39 ^"use prep_rls for storing rule-sets !")
40 (* val Seq {scr=Script s,...} = assoc_rls rls;
42 | Seq {scr=Script s,...} =>
43 let val (a1, a2) = two_scr_arg s
44 in (ScrState ([(a1, v), (a2, t)],[], NONE, e_term, Sundef,true)) end
47 (*~~~~~~~~~~~~~~~~~~~~~~copy for dev. until del.~~~~~~~~~~~~~~~~~~~~~~~~~*)
48 fun init_istate (Rewrite_Set rls) t =
49 (* val (Rewrite_Set rls) = (get_obj g_tac pt p);
51 (case assoc_rls rls of
52 Rrls {scr=sc as Rfuns {init_state=ii,...},...} => (RrlsState (ii t))
53 (* val Rrls {scr=sc as Rfuns {init_state=ii,...},...} = assoc_rls rls;
55 | Rls {scr=EmptyScr,...} =>
56 error ("interSteps>..>init_istate: \""^rls^"\" has EmptyScr."
57 ^"use prep_rls for storing rule-sets !")
58 | Rls {scr=Script s,...} =>
59 (* val Rls {scr=Script s,...} = assoc_rls rls;
61 (ScrState ([(one_scr_arg s, t)], [], NONE, e_term, Sundef, true))
62 | Seq {scr=EmptyScr,...} =>
63 error ("interSteps>..>init_istate: \""^rls^"\" has EmptyScr."
64 ^"use prep_rls for storing rule-sets !")
65 | Seq {srls=srls,scr=Script s,...} =>
66 (ScrState ([(one_scr_arg s, t)], [], NONE, e_term, Sundef, true)))
67 (* val ((Rewrite_Set_Inst (subs, rls)), t) = ((get_obj g_tac pt p), t);
69 | init_istate (Rewrite_Set_Inst (subs, rls)) t =
70 let val (_, v)::_ = subs2subst (assoc_thy "Isac") subs
71 (*...we suppose the substitution of only _one_ bound variable*)
72 in case assoc_rls rls of
73 Rls {scr=EmptyScr,...} =>
74 error ("interSteps>..>init_istate: \""^rls^"\" has EmptyScr."
75 ^"use prep_rls for storing rule-sets !")
76 | Rls {scr=Script s,...} =>
77 let val (form, bdv) = two_scr_arg s
78 in (ScrState ([(form, t), (bdv, v)],[], NONE, e_term, Sundef,true))
80 | Seq {scr=EmptyScr,...} =>
81 error ("interSteps>..>init_istate: \""^rls^"\" has EmptyScr."
82 ^"use prep_rls for storing rule-sets !")
83 (* val Seq {scr=Script s,...} = assoc_rls rls;
85 | Seq {scr=Script s,...} =>
86 let val (form, bdv) = two_scr_arg s
87 in (ScrState ([(form, t), (bdv, v)],[], NONE, e_term, Sundef,true))
92 (*.a taci holds alle information required to build a node in the calc-tree;
93 a taci is assumed to be used efficiently such that the calc-tree
94 resulting from applying a taci need not be stored separately;
95 see "type calcstate".*)
96 (*TODO.WN0504 redesign ??? or redesign generate ?? see "fun generate"
97 TODO.WN0512 ? redesign this _list_:
98 # only used for [Apply_Method + (Take or Subproblem)], i.e. for initacs
99 # the latter problem may be resolved automatically if "fun autocalc" is
100 not any more used for the specify-phase and for changing the phases*)
102 (tac * (*for comparison with input tac*)
103 tac_ * (*for ptree generation*)
104 (pos' * (*after applying tac_, for ptree generation*)
105 (istate * Proof.context))); (*after applying tac_, for ptree generation*)
106 val e_taci = (Empty_Tac, Empty_Tac_, (e_pos', (e_istate, e_ctxt))): taci;
107 (* val (tac, tac_, (pos', istate))::_ = tacis';
109 fun taci2str ((tac, tac_, (pos', (istate, _))):taci) =
110 "( "^tac2str tac^", "^tac_2str tac_^", ( "^pos'2str pos'
111 ^", "^istate2str istate^" ))";
112 fun tacis2str tacis = (strs2str o (map (linefeed o taci2str))) tacis;
114 datatype pblmet = (*%^%*)
115 Upblmet (*undefined*)
116 | Problem of pblID (*%^%*)
117 | Method of metID; (*%^%*)
118 fun pblmet2str (Problem pblID) = "Problem "^(strs2str pblID)(*%^%*)
119 | pblmet2str (Method metID) = "Method "^(metID2str metID);(*%^%*)
120 (*%^%*) (*26.6. moved to sequent.sml: fun ~~~~~~~~~; was here below*)
123 (* copy from 03.60.usecases.sml 15.11.99 *)
125 Accept | NotAccept | Example
126 | YourTurn | MyTurn (* internal use only 7.6.02 java-sml*)
128 | DontKnow (*| HowComes | WhatFor 7.6.02 java-sml*)
129 | Undo (*| Back | Forward 7.6.02 java-sml*)
130 | EndProof | EndSession
131 | ActivePlus | ActiveMinus | SpeedPlus | SpeedMinus
132 (*Stepwidth...7.6.02 java-sml*)
133 | Auto | NotAuto | Details;
134 (* for test-print-outs *)
135 fun user_cmd2str Accept ="Accept"
136 | user_cmd2str NotAccept ="NotAccept"
137 | user_cmd2str Example ="Example"
138 | user_cmd2str MyTurn ="MyTurn"
139 | user_cmd2str YourTurn ="YourTurn"
140 | user_cmd2str Rules ="Rules"
141 (*| user_cmd2str HowComes ="HowComes"*)
142 | user_cmd2str DontKnow ="DontKnow"
143 (*| user_cmd2str WhatFor ="WhatFor"
144 | user_cmd2str Back ="Back"*)
145 | user_cmd2str Undo ="Undo"
146 (*| user_cmd2str Forward ="Forward"*)
147 | user_cmd2str EndProof ="EndProof"
148 | user_cmd2str EndSession ="EndSession"
149 | user_cmd2str ActivePlus = "ActivePlus"
150 | user_cmd2str ActiveMinus = "ActiveMinus"
151 | user_cmd2str SpeedPlus = "SpeedPlus"
152 | user_cmd2str SpeedMinus = "SpeedMinus"
153 | user_cmd2str Auto = "Auto"
154 | user_cmd2str NotAuto = "NotAuto"
155 | user_cmd2str Details = "Details";
159 (*3.5.00: TODO: foppFK eliminated in interface FE-KE !!!*)
160 datatype foppFK = (* in DG cases div 2 *)
161 EmptyFoppFK (*DG internal*)
163 | PpcFK of cterm' ppc;
164 fun foppFK2str (FormFK ct') ="FormFK "^ct'
165 | foppFK2str (PpcFK ppc) ="PpcFK "^(ppc2str ppc)
166 | foppFK2str EmptyFoppFK ="EmptyFoppFK";
169 datatype nest = Open | Closed | Nundef;
170 fun nest2str Open = "Open"
171 | nest2str Closed = "Closed"
172 | nest2str Nundef = "Nundef";
175 datatype edit = EdUndef | Write | Protect;
176 (* bridge --> kernel *)
177 (* bridge <-> kernel *)
178 (* needed in dialog.sml *) (* bridge <-- kernel *)
179 fun edit2str EdUndef = "EdUndef"
180 | edit2str Write = "Write"
181 | edit2str Protect = "Protect";
185 New_User | End_User (*<->*)
186 | New_Proof | End_Proof (*<->*)
187 | Command of user_cmd (*-->*)
188 | Request of string | Message of string (*<--*)
189 | Error_ of string | System of string (*<--*)
190 | FoPpcFK of foppFK (*-->*)
191 | FormKF of cellID * edit * indent * nest * cterm' (*<--*)
192 | PpcKF of cellID * edit * indent * nest * (pblmet * item ppc) (*<--*)
193 | RuleFK of tac (*-->*)
194 | RuleKF of edit * tac (*<--*)
195 | RefinedKF of (pblID * ((itm list) * ((bool * term) list))) (*<--*)
196 | Select of tac list (*<--*)
197 | RefineKF of match list (*<--*)
198 | Speed of int (*<--*)
199 | Active of int (*<--*)
200 | Domain of domID; (*<--*)
202 fun inout2str End_Proof = "End_Proof"
203 | inout2str (Command user_cmd) = "Command "^(user_cmd2str user_cmd)
204 | inout2str (Request s) = "Request "^s
205 | inout2str (Message s) = "Message "^s
206 | inout2str (Error_ s) = "Error_ "^s
207 | inout2str (System s) = "System "^s
208 | inout2str (FoPpcFK foppFK) = "FoPpcFK "^(foppFK2str foppFK)
209 | inout2str (FormKF (cellID, edit, indent, nest, ct')) =
210 "FormKF ("^(string_of_int cellID)^","
211 ^(edit2str edit)^","^(string_of_int indent)^","
212 ^(nest2str nest)^",("
214 | inout2str (PpcKF (cellID, edit, indent, nest, (pm,itemppc))) =
215 "PpcKF ("^(string_of_int cellID)^","
216 ^(edit2str edit)^","^(string_of_int indent)^","
217 ^(nest2str nest)^",("
218 ^(pblmet2str pm)^","^(itemppc2str itemppc)^"))"
219 | inout2str (RuleKF (edit,tac)) = "RuleKF "^
220 pair2str(edit2str edit,tac2str tac)
221 | inout2str (RuleFK tac) = "RuleFK "^(tac2str tac)
222 | inout2str (Select tacs)=
223 "Select "^((strs2str' o (map tac2str)) tacs)
224 | inout2str (RefineKF ms) = "RefineKF "^(matchs2str ms)
225 | inout2str (Speed i) = "Speed "^(string_of_int i)
226 | inout2str (Active i) = "Active "^(string_of_int i)
227 | inout2str (Domain dI) = "Domain "^dI;
228 fun inouts2str ios = (strs2str' o (map inout2str)) ios;
231 Form' of inout (* packing cterm' | cterm' ppc *)
232 | Problems of inout (* passes specify (and solve) *)
236 fun mout2str (Form' inout) ="Form' "^(inout2str inout)
237 | mout2str (Error' inout) ="Error' "^(inout2str inout)
238 | mout2str (EmptyMout ) ="EmptyMout";
240 (*fun Form'2str (Form' )*)
246 (* init pbl with ...,dsc,empty | [] *)
249 fun pbt2itm (f, (d, t)) =
250 ((0, [], false, f, Inc ((d, []), (e_term, []))) : itm);
251 in map pbt2itm pbt end;
252 (*take formal parameters from pbt, for transfer from pbl/met-hierarchy*)
255 fun pbt2itm (f,(d,t)) =
256 ((0,[],false,f,Inc((d,[t]),(e_term,[]))):itm);
257 in map pbt2itm pbt end;
260 (*generate 1 ppobj in ptree*)
261 (*TODO.WN0501: take calcstate as an argument (see embed_derive etc.)?specify?*)
262 fun generate1 thy (Add_Given' (_, itmlist)) _ (pos as (p,p_)) pt =
263 (pos:pos',[],Form' (PpcKF (0,EdUndef,0,Nundef,(Upblmet, itms2itemppc thy [][]))),
265 Pbl => update_pbl pt p itmlist
266 | Met => update_met pt p itmlist)
267 (*WN110515 probably declare_constraints with input item (without dsc) --
268 -- important when specifying without formalisation*)
269 | generate1 thy (Add_Find' (_, itmlist)) _ (pos as (p,p_)) pt =
270 (pos,[],Form' (PpcKF (0,EdUndef,0,Nundef,(Upblmet,itms2itemppc thy [][]))),
272 Pbl => update_pbl pt p itmlist
273 | Met => update_met pt p itmlist)
274 (*WN110515 probably declare_constraints with input item (without dsc)*)
275 | generate1 thy (Add_Relation' (_, itmlist)) _ (pos as (p,p_)) pt =
276 (pos,[],Form' (PpcKF (0,EdUndef,0,Nundef,(Upblmet,itms2itemppc thy [][]))),
278 Pbl => update_pbl pt p itmlist
279 | Met => update_met pt p itmlist)
281 | generate1 thy (Specify_Theory' domID) _ (pos as (p,_)) pt =
282 (pos,[],Form' (PpcKF (0,EdUndef,0,Nundef,(Upblmet,itms2itemppc thy [][]))),
283 update_domID pt p domID)
285 | generate1 thy (Specify_Problem' (pI, (ok, (itms, pre)))) _
287 let val pt = update_pbl pt p itms
288 val pt = update_pblID pt p pI
290 Form' (PpcKF (0,EdUndef,0,Nundef,(Upblmet,itms2itemppc thy [][]))),
293 | generate1 thy (Specify_Method' (mID, oris, itms)) _
295 let val pt = update_oris pt p oris
296 val pt = update_met pt p itms
297 val pt = update_metID pt p mID
299 Form' (PpcKF (0,EdUndef,0,Nundef,(Upblmet,itms2itemppc thy [][]))),
302 | generate1 thy (Model_Problem' (_, itms, met)) _ (pos as (p,_)) pt =
304 val pt = update_pbl pt p itms
305 val pt = update_met pt p met
306 in (pos,[],Form'(PpcKF(0,EdUndef,0,Nundef, (Upblmet, itms2itemppc thy [] []))), pt)
309 | generate1 thy (Refine_Tacitly' (pI,pIre,domID,metID,pbl))
310 _ (pos as (p,_)) pt =
311 let val pt = update_pbl pt p pbl
312 val pt = update_orispec pt p (domID,pIre,metID)
314 Form'(PpcKF(0,EdUndef,0,Nundef,(Upblmet,itms2itemppc thy [][]))),
317 | generate1 thy (Refine_Problem' (pI,_)) _ (pos as (p,_)) pt =
318 let val (dI,_,mI) = get_obj g_spec pt p
319 val pt = update_spec pt p (dI, pI, mI)
321 Form'(PpcKF(0,EdUndef,0,Nundef,(Upblmet,itms2itemppc thy [][]))),pt)
324 | generate1 thy (Apply_Method' (_,topt, is, ctxt)) _ (pos as (p,p_)) pt =
325 ((*tracing("###generate1 Apply_Method': pos = "^pos'2str (p,p_));
326 tracing("###generate1 Apply_Method': topt= "^termopt2str topt);
327 tracing("###generate1 Apply_Method': is = "^istate2str is);*)
330 let val (pt,c) = cappend_form pt p (is, ctxt) t
331 (*val _= tracing("###generate1 Apply_Method: after cappend")*)
332 in (pos,c, EmptyMout,pt)
335 (pos,[],EmptyMout,update_env pt p (SOME (is, ctxt))))
336 (* val (thy, (Take' t), l, (p,p_), pt) =
337 ((assoc_thy "Isac"), tac_, is, pos, pt);
339 | generate1 thy (Take' t) l (p,p_) pt = (* val (Take' t) = m; *)
340 let (*val _=tracing("### generate1: Take' pos="^pos'2str (p,p_));*)
341 val p = let val (ps,p') = split_last p(*no connex to prev.ppobj*)
342 in if p'=0 then ps@[1] else p end;
343 val (pt,c) = cappend_form pt p l t;
345 Form' (FormKF (~1,EdUndef,(length p), Nundef, term2str t)), pt) end
347 (* val (l, (p,p_)) = (RrlsState is, p);
349 val (thy, Begin_Trans' t, l, (p,Frm), pt) =
350 (assoc_thy "Isac", tac_, is, p, pt);
352 | generate1 thy (Begin_Trans' t) l (p,Frm) pt =
353 let (* print_depth 99;
354 map fst (get_interval ([],Pbl) ([],Res) 9999 pt);print_depth 3;
356 val (pt,c) = cappend_form pt p l t
358 map fst (get_interval ([],Pbl) ([],Res) 9999 pt);print_depth 3;
360 val pt = update_branch pt p TransitiveB (*040312*)
361 (*replace the old PrfOjb ~~~~~*)
362 val p = (lev_on o lev_dn(*starts with [...,0]*)) p;
363 val (pt,c') = cappend_form pt p l t(*FIXME.0402 same istate ???*);
364 in ((p,Frm), c @ c', Form' (FormKF (~1,EdUndef,(length p), Nundef,
365 term2str t)), pt) end
367 (* val (thy, Begin_Trans' t, l, (p,Res), pt) =
368 (assoc_thy "Isac", tac_, is, p, pt);
370 | generate1 thy (Begin_Trans' t) l (p ,Res) pt =
371 (*append after existing PrfObj _________*)
372 generate1 thy (Begin_Trans' t) l (lev_on p,Frm) pt
374 | generate1 thy (End_Trans' tasm) l (p,p_) pt =
375 let val p' = lev_up p
376 val (pt,c) = append_result pt p' l tasm Complete;
377 in ((p',Res), c, Form' (FormKF (~1,EdUndef,(length p), Nundef, term2str t)),
380 | generate1 thy (Rewrite_Inst' (_,_,_,_,subs',thm',f,(f',asm))) (is, ctxt)
382 let (*val _= tracing("###generate1 Rewrite_Inst': pos= "^pos'2str (p,p_));*)
383 val (pt,c) = cappend_atomic pt p (is, insert_assumptions asm ctxt) f
384 (Rewrite_Inst (subst2subs subs',thm')) (f',asm) Complete;
385 val pt = update_branch pt p TransitiveB (*040312*)
386 (*val pt = union_asm pt (par_pblobj pt p) (map (rpair p) asm);9.6.03??*)
387 in ((p,Res), c, Form' (FormKF (~1,EdUndef,(length p), Nundef, term2str f')),
390 | generate1 thy (Rewrite' (thy',ord',rls',pa,thm',f,(f',asm))) (is, ctxt)
392 let (*val _= tracing("###generate1 Rewrite': pos= "^pos'2str (p,p_))*)
393 val (pt,c) = cappend_atomic pt p (is, insert_assumptions asm ctxt) f
394 (Rewrite thm') (f',asm) Complete
395 val pt = update_branch pt p TransitiveB (*040312*)
396 (*val pt = union_asm pt (par_pblobj pt p) (map (rpair p) asm);9.6.03??*)
397 in ((p,Res), c, Form' (FormKF (~1,EdUndef,(length p), Nundef, term2str f')),
400 | generate1 thy (Rewrite_Asm' all) l p pt =
401 generate1 thy (Rewrite' all) l p pt
403 | generate1 thy (Rewrite_Set_Inst' (_,_,subs',rls',f,(f',asm))) (is, ctxt)
405 (* val (thy, Rewrite_Set_Inst' (_,_,subs',rls',f,(f',asm)), l, (p,p_), pt) =
406 (assoc_thy "Isac", tac_, is, pos, pt);
408 let (*val _=tracing("###generate1 Rewrite_Set_Inst': pos= "^pos'2str(p,p_))*)
409 val (pt,c) = cappend_atomic pt p (is, insert_assumptions asm ctxt) f
410 (Rewrite_Set_Inst (subst2subs subs',id_rls rls')) (f',asm) Complete
411 val pt = update_branch pt p TransitiveB (*040312*)
412 (*val pt = union_asm pt (par_pblobj pt p) (map (rpair p) asm');9.6.03??*)
413 in ((p,Res), c, Form' (FormKF (~1,EdUndef,(length p), Nundef, term2str f')),
416 | generate1 thy (Detail_Set_Inst' (_,_,subs,rls,f,(f',asm))) (is, ctxt) (p,p_)
418 let val ctxt' = insert_assumptions asm ctxt
419 val (pt,c) = cappend_form pt p (is, ctxt') f
420 val pt = update_branch pt p TransitiveB (*040312*)
421 val is = init_istate (Rewrite_Set_Inst (subst2subs subs, id_rls rls)) f
422 val tac_ = Apply_Method' (e_metID, SOME t, is, ctxt')
423 val pos' = ((lev_on o lev_dn) p, Frm)
424 in (*implicit Take*) generate1 thy tac_ (is, ctxt') pos' pt end
426 | generate1 thy (Rewrite_Set' (_,_,rls',f,(f',asm))) (is, ctxt) (p,p_) pt =
427 let (*val _= tracing("###generate1 Rewrite_Set': pos= "^pos'2str (p,p_))*)
428 val (pt,c) = cappend_atomic pt p (is, insert_assumptions asm ctxt) f
429 (Rewrite_Set (id_rls rls')) (f',asm) Complete
430 val pt = update_branch pt p TransitiveB (*040312*)
431 (*val pt = union_asm pt (par_pblobj pt p) (map (rpair p) asm');9.6.03??*)
432 in ((p,Res), c, Form' (FormKF (~1,EdUndef,(length p), Nundef, term2str f')),
435 | generate1 thy (Detail_Set' (_,_,rls,f,(f',asm))) (is, ctxt) (p,p_) pt =
436 let val (pt,c) = cappend_form pt p (is, ctxt) f
437 val pt = update_branch pt p TransitiveB (*040312*)
439 val is = init_istate (Rewrite_Set (id_rls rls)) f
440 val tac_ = Apply_Method' (e_metID, SOME t, is, ctxt)
441 val pos' = ((lev_on o lev_dn) p, Frm)
442 in (*implicit Take*) generate1 thy tac_ (is, ctxt) pos' pt end
444 | generate1 thy (Check_Postcond' (pI, (scval, asm))) l (p,p_) pt =
445 let val (pt,c) = append_result pt p l (scval, asm) Complete
446 in ((p,Res), c, Form' (FormKF (~1,EdUndef,(length p),
447 Nundef, term2str scval)), pt) end
449 | generate1 thy (Calculate' (thy',op_,f,(f',thm'))) l (p,p_) pt =
450 let val (pt,c) = cappend_atomic pt p l f (Calculate op_) (f',[]) Complete;
451 in ((p,Res), c, Form' (FormKF (~1,EdUndef,(length p), Nundef, term2str f')),
454 | generate1 thy (Check_elementwise' (consts,pred,(f',asm))) l (p,p_) pt =
455 let(*val _=tracing("###generate1 Check_elementwise': p= "^pos'2str(p,p_))*)
456 val (pt,c) = cappend_atomic pt p l consts
457 (Check_elementwise pred) (f',asm) Complete;
458 in ((p,Res), c, Form' (FormKF (~1,EdUndef,(length p), Nundef, term2str f')),
461 | generate1 thy (Or_to_List' (ors,list)) l (p,p_) pt =
462 let val (pt,c) = cappend_atomic pt p l ors
463 Or_to_List (list,[]) Complete;
464 in ((p,Res), c, Form' (FormKF(~1,EdUndef,(length p), Nundef, term2str list)),
467 | generate1 thy (Substitute' (subte, t, t')) l (p,p_) pt =
470 cappend_atomic pt p l t (Substitute (subte2sube subte)) (t',[]) Complete;
471 in ((p,Res), c, Form' (FormKF(~1,EdUndef,(length p), Nundef, term2str t')), pt)
474 | generate1 thy (Tac_ (_,f,id,f')) l (p,p_) pt =
477 cappend_atomic pt p l (str2term f) (Tac id) (str2term f',[]) Complete;
478 in ((p,Res), c, Form' (FormKF (~1,EdUndef,(length p), Nundef, f')), pt)end
480 | generate1 thy (Subproblem' ((domID, pblID, metID), oris, hdl, fmz_, ctxt, f))
482 let (*val _=tracing("###generate1 Subproblem': pos= "^pos'2str (p,p_))*)
484 cappend_problem pt p l (fmz_, (domID, pblID, metID)) (oris, (domID, pblID, metID), hdl);
485 val pt = update_ctxt pt p ctxt
486 val f = Syntax.string_of_term (thy2ctxt thy) f;
487 in ((p,Pbl), c, Form' (FormKF (~1,EdUndef,(length p), Nundef, f)), pt) end
489 | generate1 thy m' _ _ _ =
490 error ("generate1: not impl.for "^(tac_2str m'));
492 fun generate_hard thy m' (p,p_) pt =
496 Frm => p | Res => lev_on p
497 | _ => error ("generate_hard: call by " ^ pos'2str (p,p_));
498 in generate1 thy m' (e_istate, e_ctxt) (p,p_) pt end;
500 (*tacis are in reverse order from nxt_solve_/specify_: last = fst to insert*)
501 fun generate ([]: taci list) ptp = ptp
502 | generate tacis (pt, c, _:pos'(*!dropped!WN0504redesign generate/tacis?*))=
504 val (tacis', (_, tac_, (p, is))) = split_last tacis
505 val (p',c',_,pt') = generate1 (assoc_thy "Isac") tac_ is p pt
506 in generate tacis' (pt', c@c', p') end;
508 (*. a '_deriv'ation is constructed during 'reverse rewring' by an Rrls *
509 * of for connecting a user-input formula with the current calc-state. *
510 *# It is somewhat incompatible with the rest of the math-engine: *
511 * (1) it is not created by a script *
512 * (2) thus there cannot be another user-input within a derivation *
513 *# It suffers particularily from the not-well-foundedness of the math-engine*
514 * (1) FIXME other branchtyptes than Transitive will change 'embed_deriv' *
515 * (2) FIXME and eventually 'compare_step' (ie. the script interpreter) *
516 * (3) FIXME and eventually 'lev_back' *
517 *# SOME improvements are evident FIXME.040215 '_deriv'ation: *
518 * (1) FIXME nest Rls_ in 'make_deriv' *
519 * (2) FIXME do the not-reversed part in 'make_deriv' by scripts -- thus *
520 * user-input will become possible in this part of a derivation *
521 * (3) FIXME do (2) only if a derivation has been found -- for efficiency, *
522 * while a non-derivable inform requires to step until End_Proof' *
523 * (4) FIXME find criteria on when _not_ to step until End_Proof' *
526 (*.update pos in tacis for embedding by generate.*)
529 fun insert_pos _ [] = []
530 | insert_pos (p:pos) (((tac,tac_,(_, ist))::tacis):taci list) =
531 ((tac,tac_,((p, Res), ist)):taci)
532 ::((insert_pos (lev_on p) tacis):taci list);
534 fun res_from_taci (_, Rewrite'(_,_,_,_,_,_,(res, asm)), _) = (res, asm)
535 | res_from_taci (_, Rewrite_Set'(_,_,_,_,(res, asm)), _) = (res, asm)
536 | res_from_taci (_, tac_, _) =
537 error ("res_from_taci: called with" ^ tac_2str tac_);
539 (*.embed the tacis created by a '_deriv'ation; sys.form <> input.form
540 tacis are in order, thus are reverted for generate.*)
541 (* val (tacis, (pt, pos as (p, Frm))) = (tacis', ptp);
543 fun embed_deriv (tacis:taci list) (pt, pos as (p, Frm):pos') =
544 (*inform at Frm: replace the whole PrfObj by a Transitive-ProfObj FIXME?0402
545 and transfer the istate (from _after_ compare_deriv) from Frm to Res*)
546 let val (res, asm) = (res_from_taci o last_elem) tacis
547 val (SOME (ist, ctxt),_) = get_obj g_loc pt p
548 val form = get_obj g_form pt p
549 (*val p = lev_on p; ---------------only difference to (..,Res) below*)
550 val tacis = (Begin_Trans, Begin_Trans' form, (pos, (Uistate, ctxt)))
551 ::(insert_pos ((lev_on o lev_dn) p) tacis)
552 @ [(End_Trans, End_Trans' (res, asm),
553 (pos_plus (length tacis) (lev_dn p, Res),
554 (new_val res ist, ctxt)))]
555 val {nrls,...} = get_met (get_obj g_metID pt (par_pblobj pt p))
556 val (pt, c, pos as (p,_)) = generate (rev tacis) (pt, [], (p, Res))
557 val pt = update_tac pt p (Derive (id_rls nrls))
558 (*FIXME.040216 struct.ctree*)
559 val pt = update_branch pt p TransitiveB
560 in (c, (pt, pos:pos')) end
562 (* val (tacis, (pt, (p, Res))) = (tacis', ptp);
564 | embed_deriv tacis (pt, (p, Res)) =
565 (*inform at Res: append a Transitive-PrfObj FIXME?0402 other branch-types ?
566 and transfer the istate (from _after_ compare_deriv) from Res to new Res*)
567 let val (res, asm) = (res_from_taci o last_elem) tacis
568 val (_, SOME (ist, ctxt)) = get_obj g_loc pt p
569 val (f,a) = get_obj g_result pt p
570 val p = lev_on p(*---------------only difference to (..,Frm) above*);
571 val tacis = (Begin_Trans, Begin_Trans' f, ((p, Frm), (Uistate, ctxt)))
572 ::(insert_pos ((lev_on o lev_dn) p) tacis)
573 @ [(End_Trans, End_Trans' (res, asm),
574 (pos_plus (length tacis) (lev_dn p, Res),
575 (new_val res ist, ctxt)))];
576 val {nrls,...} = get_met (get_obj g_metID pt (par_pblobj pt p))
577 val (pt, c, pos as (p,_)) = generate (rev tacis) (pt, [], (p, Res))
578 val pt = update_tac pt p (Derive (id_rls nrls))
579 (*FIXME.040216 struct.ctree*)
580 val pt = update_branch pt p TransitiveB
581 in (c, (pt, pos)) end;