neuper@41968: (* Title: solve an example by interpreting a method's script neuper@41968: Author: Walther Neuper 1999 neuper@41968: (c) copyright due to lincense terms. neuper@41968: 1234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890 neuper@41968: 10 20 30 40 50 60 70 80 90 100 neuper@37906: *) neuper@37906: wneuper@59273: structure Solve = wneuper@59273: struct wneuper@59276: open Ctree; wneuper@59273: neuper@37906: fun safe (ScrState (_,_,_,_,s,_)) = s neuper@37906: | safe (RrlsState _) = Safe; neuper@37906: neuper@37906: type mstID = string; neuper@37906: type tac'_ = mstID * tac; (*DG <-> ME*) neuper@37906: val e_tac'_ = ("Empty_Tac", Empty_Tac):tac'_; neuper@37906: neuper@37906: fun mk_tac'_ m = case m of neuper@37906: Init_Proof (ppc, spec) => ("Init_Proof", Init_Proof (ppc, spec )) neuper@37906: | Model_Problem => ("Model_Problem", Model_Problem) neuper@37906: | Refine_Tacitly pblID => ("Refine_Tacitly", Refine_Tacitly pblID) neuper@37906: | Refine_Problem pblID => ("Refine_Problem", Refine_Problem pblID) neuper@37906: | Add_Given cterm' => ("Add_Given", Add_Given cterm') neuper@37906: | Del_Given cterm' => ("Del_Given", Del_Given cterm') neuper@37906: | Add_Find cterm' => ("Add_Find", Add_Find cterm') neuper@37906: | Del_Find cterm' => ("Del_Find", Del_Find cterm') neuper@37906: | Add_Relation cterm' => ("Add_Relation", Add_Relation cterm') neuper@37906: | Del_Relation cterm' => ("Del_Relation", Del_Relation cterm') neuper@37906: neuper@37906: | Specify_Theory domID => ("Specify_Theory", Specify_Theory domID) neuper@37906: | Specify_Problem pblID => ("Specify_Problem", Specify_Problem pblID) neuper@37906: | Specify_Method metID => ("Specify_Method", Specify_Method metID) neuper@37906: | Apply_Method metID => ("Apply_Method", Apply_Method metID) neuper@37906: | Check_Postcond pblID => ("Check_Postcond", Check_Postcond pblID) neuper@37906: | Free_Solve => ("Free_Solve",Free_Solve) neuper@37906: neuper@37906: | Rewrite_Inst (subs, thm') => ("Rewrite_Inst", Rewrite_Inst (subs, thm')) neuper@37906: | Rewrite thm' => ("Rewrite", Rewrite thm') neuper@37906: | Rewrite_Asm thm' => ("Rewrite_Asm", Rewrite_Asm thm') neuper@37906: | Rewrite_Set_Inst (subs, rls') neuper@37906: => ("Rewrite_Set_Inst", Rewrite_Set_Inst (subs, rls')) neuper@37906: | Rewrite_Set rls' => ("Rewrite_Set", Rewrite_Set rls') neuper@37906: | End_Ruleset => ("End_Ruleset", End_Ruleset) neuper@37906: neuper@37906: | End_Detail => ("End_Detail", End_Detail) neuper@37906: | Detail_Set rls' => ("Detail_Set", Detail_Set rls') neuper@37906: | Detail_Set_Inst (s, rls') => ("Detail_Set_Inst", Detail_Set_Inst (s, rls')) neuper@37906: neuper@37906: | Calculate op_ => ("Calculate", Calculate op_) neuper@37906: | Substitute sube => ("Substitute", Substitute sube) neuper@37906: | Apply_Assumption cts' => ("Apply_Assumption", Apply_Assumption cts') neuper@37906: neuper@37906: | Take cterm' => ("Take", Take cterm') neuper@37906: | Take_Inst cterm' => ("Take_Inst", Take_Inst cterm') neuper@37906: | Group (con, ints) => ("Group", Group (con, ints)) neuper@37906: | Subproblem (domID, pblID) => ("Subproblem", Subproblem (domID, pblID)) neuper@37906: (* neuper@37906: | Subproblem_Full(spec,cts')=> ("Subproblem_Full", Subproblem_Full(spec,cts')) neuper@37906: *) neuper@37906: | End_Subproblem => ("End_Subproblem",End_Subproblem) neuper@37906: | CAScmd cterm' => ("CAScmd", CAScmd cterm') neuper@37906: neuper@37906: | Split_And => ("Split_And", Split_And) neuper@37906: | Conclude_And => ("Conclude_And", Conclude_And) neuper@37906: | Split_Or => ("Split_Or", Split_Or) neuper@37906: | Conclude_Or => ("Conclude_Or", Conclude_Or) neuper@37906: | Begin_Trans => ("Begin_Trans", Begin_Trans) neuper@37906: | End_Trans => ("End_Trans", End_Trans) neuper@37906: | Begin_Sequ => ("Begin_Sequ", Begin_Sequ) neuper@37906: | End_Sequ => ("End_Sequ", Begin_Sequ) neuper@37906: | Split_Intersect => ("Split_Intersect", Split_Intersect) neuper@37906: | End_Intersect => ("End_Intersect", End_Intersect) neuper@37906: | Check_elementwise cterm' => ("Check_elementwise", Check_elementwise cterm') neuper@37906: | Or_to_List => ("Or_to_List", Or_to_List) neuper@37906: | Collect_Trues => ("Collect_Results", Collect_Trues) neuper@37906: neuper@37906: | Empty_Tac => ("Empty_Tac",Empty_Tac) neuper@37906: | Tac string => ("Tac",Tac string) neuper@37906: | End_Proof' => ("End_Proof'",End_Proof'); neuper@37906: neuper@37906: (*Detail*) neuper@37906: val empty_tac'_ = (mk_tac'_ Empty_Tac):tac'_; neuper@37906: neuper@37906: fun mk_tac ((_,m):tac'_) = m; neuper@37906: fun mk_mstID ((mI,_):tac'_) = mI; neuper@37906: neuper@37906: fun tac'_2str ((ID,ms):tac'_) = ID ^ (tac2str ms); neuper@37906: (* TODO: tac2str, tac'_2str NOT tested *) neuper@37906: neuper@37906: neuper@37906: wneuper@59279: type squ = ctree; (* TODO: safe etc. *) neuper@37906: neuper@37906: (*13.9.02-------------- neuper@37906: type ctr = (loc * pos) list; neuper@38034: val ops = [("PLUS","Groups.plus_class.plus"),("MINUS","Groups.minus_class.minus"),("TIMES","Groups.times_class.times"), neuper@37906: ("cancel","cancel"),("pow","pow"),("sqrt","sqrt")]; neuper@37980: ML {* neuper@37980: @{term "PLUS"}; (*Free ("PLUS", "'a") : term*) neuper@37980: @{term "plus"}; (*Const ("Groups.plus_class.plus", "'a => 'a => 'a")*) neuper@37980: @{term "MINUS"}; (*Free ("MINUS", "'a")*) neuper@37980: @{term "minus"}; (*Const ("Groups.minus_class.minus", "'a => 'a => 'a")*) neuper@37980: @{term "TIMES"}; (*Free ("TIMES", "'a")*) neuper@37980: @{term "times"}; (*Const ("Groups.times_class.times", "'a => 'a => 'a")*) neuper@37980: @{term "CANCEL"}; (*Free ("CANCEL", "'a")*) neuper@37980: @{term "cancel"}; (*Free ("cancel", "'a")*) neuper@37980: @{term "POWER"}; (*Free ("POWER", "'a")*) neuper@37980: @{term "pow"}; (*Free ("pow", "'a")*) neuper@37980: @{term "SQRT"}; (*Free ("SQRT", "'a")*) neuper@37980: @{term "sqrt"}; (*Const ("NthRoot.sqrt", "RealDef.real => RealDef.real")*) neuper@37980: *} neuper@37906: fun op_intern op_ = neuper@37980: case assoc (ops, op_) of neuper@38031: SOME op' => op' | NONE => error ("op_intern: no op= "^op_); neuper@37906: -----------------------*) neuper@37906: neuper@37906: neuper@37906: neuper@37906: (* use"ME/solve.sml"; neuper@37906: use"solve.sml"; neuper@37906: wneuper@59186: val ttt = (Thm.term_of o the o (parse thy))"Substitute [(bdv,x)] g"; wneuper@59186: val ttt = (Thm.term_of o the o (parse thy))"Rewrite thmid True g"; neuper@37906: neuper@37906: Const ("Script.Rewrite'_Inst",_) $ sub $ Free (thm',_) $ Const (pa,_) $ f' neuper@37906: *) neuper@37906: neuper@37906: neuper@37906: neuper@37906: val specsteps = ["Init_Proof","Refine_Tacitly","Refine_Problem", neuper@37906: "Model_Problem",(*"Match_Problem",*) neuper@37906: "Add_Given","Del_Given","Add_Find","Del_Find", neuper@37906: "Add_Relation","Del_Relation", neuper@37906: "Specify_Theory","Specify_Problem","Specify_Method"]; neuper@37906: neuper@37906: neuper@37906: wneuper@59257: fun step2taci ((tac_, _, pt, p, _) : Lucin.step) = (*FIXXME.040312: redesign step*) wneuper@59276: (Lucin.tac_2tac tac_, tac_, (p, Ctree.get_loc pt p)): Generate.taci; neuper@37906: neuper@37906: neuper@37906: (*FIXME.WN050821 compare solve ... nxt_solv*) neuper@37906: (* val ("Apply_Method",Apply_Method' (mI,_))=(mI,m); neuper@37906: val (("Apply_Method",Apply_Method' (mI,_,_)),pt, pos as (p,_))=(m,pt, pos); neuper@37906: *) wneuper@59279: fun solve ("Apply_Method", m as Apply_Method' (mI, _, _, _)) (pt:ctree, (pos as (p,_))) = wneuper@59269: let val {srls, ...} = Specify.get_met mI; neuper@42014: val PblObj {meth=itms, ...} = get_obj I pt p; neuper@41999: val thy' = get_obj g_domID pt p; neuper@41999: val thy = assoc_thy thy'; wneuper@59257: val (is as ScrState (env,_,_,_,_,_), ctxt, sc) = Lucin.init_scrstate thy itms mI; wneuper@59257: val ini = Lucin.init_form thy sc env; neuper@41999: val p = lev_dn p; neuper@41999: in neuper@41999: case ini of neuper@41999: SOME t => neuper@41999: let val (pos,c,_,pt) = wneuper@59271: Generate.generate1 thy (Apply_Method' (mI, SOME t, is, ctxt)) neuper@41999: (is, ctxt) (lev_on p, Frm)(*implicit Take*) pt; neuper@41999: in ("ok",([(Apply_Method mI, Apply_Method' (mI, SOME t, is, ctxt), wneuper@59265: ((lev_on p, Frm), (is, ctxt)))], c, (pt, pos)) : Chead.calcstate') neuper@41999: end neuper@41999: | NONE => (*execute the first tac in the Script, compare solve m*) neuper@41999: let wneuper@59257: val (m', (is', ctxt'), _) = Lucin.next_tac (thy', srls) (pt, (p, Res)) sc (is, ctxt); neuper@41999: val d = e_rls (*FIXME: get simplifier from domID*); neuper@41999: in wneuper@59257: case Lucin.locate_gen (thy',srls) m' (pt,(p, Res)) (sc,d) (is', ctxt') of wneuper@59257: Lucin.Steps (is'', ss as (m'',f',pt',p',c')::_) => neuper@41999: ("ok", (map step2taci ss, c', (pt',p'))) neuper@41999: | NotLocatable => wneuper@59271: let val (p,ps,f,pt) = Generate.generate_hard (assoc_thy "Isac") m (p,Frm) pt; wneuper@59257: in wneuper@59257: ("not-found-in-script",([(Lucin.tac_2tac m, m, (pos, (is, ctxt)))], ps, (pt,p))) wneuper@59257: end neuper@41999: end neuper@41999: end neuper@37906: neuper@37906: | solve ("Free_Solve", Free_Solve') (pt,po as (p,_)) = neuper@41975: let (*val _=tracing"###solve Free_Solve";*) neuper@41975: val p' = lev_dn_ (p,Res); neuper@41975: val pt = update_metID pt (par_pblobj pt p) e_metID; neuper@41975: in ("ok", ([(Empty_Tac, Empty_Tac_, (po, (Uistate, e_ctxt)))], [], (pt,p'))) neuper@41975: end neuper@37906: neuper@42018: | solve ("Check_Postcond", Check_Postcond' (pI,_)) (pt,(pos as (p,p_))) = neuper@42018: let neuper@41975: val pp = par_pblobj pt p neuper@41975: val asm = neuper@41975: (case get_obj g_tac pt p of neuper@41975: Check_elementwise _ => (*collects and instantiates asms*) neuper@41975: (snd o (get_obj g_result pt)) p neuper@41975: | _ => get_assumptions_ pt (p,p_)) neuper@41975: handle _ => [] (*WN.27.5.03 asms in subpbls not completely clear*) neuper@41975: val metID = get_obj g_metID pt pp; wneuper@59269: val {srls=srls,scr=sc,...} = Specify.get_met metID; neuper@41975: val loc as (ScrState (E,l,a,_,_,b), ctxt) = get_loc pt (p,p_); neuper@41975: val thy' = get_obj g_domID pt pp; neuper@41975: val thy = assoc_thy thy'; wneuper@59257: val (_,_,(scval,scsaf)) = Lucin.next_tac (thy',srls) (pt,(p,p_)) sc loc; neuper@41975: in neuper@41975: if pp = [] neuper@41975: then neuper@41975: let neuper@41975: val is = ScrState (E,l,a,scval,scsaf,b) neuper@42018: val tac_ = Check_Postcond' (pI, (scval, asm)) wneuper@59271: val (pos,ps,f,pt) = Generate.generate1 thy tac_ (is, ctxt) (pp,Res) pt; neuper@41975: in ("ok", ([(Check_Postcond pI, tac_, ((pp,Res),(is, ctxt)))], ps,(pt,pos))) end neuper@41975: else neuper@41975: let (*resume script of parpbl, transfer value of subpbl-script*) neuper@41975: val ppp = par_pblobj pt (lev_up p); neuper@41975: val thy' = get_obj g_domID pt ppp; neuper@41975: val thy = assoc_thy thy'; neuper@41975: val metID = get_obj g_metID pt ppp; wneuper@59269: val sc = (#scr o Specify.get_met) metID; neuper@41975: val (ScrState (E,l,a,_,_,b), ctxt') = get_loc pt (pp(*!/p/*),Frm); neuper@42023: val ctxt'' = from_subpbl_to_caller ctxt scval ctxt' neuper@41975: val ((p,p_),ps,f,pt) = wneuper@59271: Generate.generate1 thy (Check_Postcond' (pI, (scval, asm))) neuper@41975: (ScrState (E,l,a,scval,scsaf,b), ctxt'') (pp,Res) pt; neuper@42018: in ("ok", ([(Check_Postcond pI, Check_Postcond'(pI,(scval, asm)), neuper@41975: ((pp,Res), (ScrState (E,l,a,scval,scsaf,b), ctxt'')))],ps,(pt,(p,p_)))) neuper@41975: end neuper@41975: end neuper@37906: neuper@37906: | solve (_,End_Proof'') (pt, (p,p_)) = neuper@37906: ("end-proof", neuper@41997: ([(Empty_Tac,Empty_Tac_,(([],Res),(Uistate, e_ctxt)))],[],(pt,(p,p_)))) neuper@37906: neuper@37906: (*-----------vvvvvvvvvvv could be done by generate1 ?!?*) neuper@41997: | solve (_,End_Detail' t) (pt, (p,p_)) = neuper@41997: let neuper@41997: val pr as (p',_) = (lev_up p, Res) neuper@41997: val pp = par_pblobj pt p neuper@41997: val r = (fst o (get_obj g_result pt)) p' wneuper@59279: (*Rewrite_Set* done at Detail_Set*: this result is already in ctree*) neuper@41997: val thy' = get_obj g_domID pt pp wneuper@59257: val (srls, is, sc) = Lucin.from_pblobj' thy' pr pt wneuper@59257: val (tac_,is',_) = Lucin.next_tac (thy',srls) (pt,pr) sc is neuper@41997: in ("ok", ([(End_Detail, End_Detail' t , neuper@41997: ((p,p_), get_loc pt (p,p_)))], [], (pt,pr))) neuper@41997: end neuper@37906: neuper@37906: | solve (mI,m) (pt, po as (p,p_)) = neuper@41997: if e_metID = get_obj g_metID pt (par_pblobj pt p)(*29.8.02: could be detail, too !!*) neuper@41997: then neuper@42006: let neuper@42006: val ctxt = get_ctxt pt po neuper@42006: val ((p,p_),ps,f,pt) = wneuper@59271: Generate.generate1 (assoc_thy (get_obj g_domID pt (par_pblobj pt p))) neuper@42006: m (e_istate, ctxt) (p,p_) pt; neuper@41997: in ("no-method-specified", (*Free_Solve*) neuper@42006: ([(Empty_Tac,Empty_Tac_, ((p,p_),(Uistate, ctxt)))], ps, (pt,(p,p_)))) neuper@41997: end neuper@41997: else neuper@41997: let neuper@41997: val thy' = get_obj g_domID pt (par_pblobj pt p); wneuper@59257: val (srls, is, sc) = Lucin.from_pblobj_or_detail' thy' (p,p_) pt; neuper@41997: val d = e_rls; (*FIXME.WN0108: canon.simplifier for domain is missing: generate from domID?*) neuper@41997: in wneuper@59257: case Lucin.locate_gen (thy',srls) m (pt,(p,p_)) (sc,d) is of wneuper@59257: Lucin.Steps (is', ss as (m',f',pt',p',c')::_) => neuper@41997: let neuper@41997: (*27.8.02:next_tac may change to other branches in pt FIXXXXME*) neuper@41997: in ("ok", (map step2taci ss, c', (pt',p'))) end neuper@41997: | NotLocatable => neuper@41997: let val (p,ps,f,pt) = wneuper@59271: Generate.generate_hard (assoc_thy "Isac") m (p,p_) pt; neuper@41997: in ("not-found-in-script", wneuper@59257: ([(Lucin.tac_2tac m, m, (po,is))], ps, (pt,p))) neuper@41997: end neuper@41997: end; neuper@37906: neuper@41997: (*FIXME.WN050821 compare fun solve ... fun nxt_solv*) neuper@37906: (* nxt_solv (Apply_Method' vvv FIXME: get args in applicable_in *) wneuper@59279: fun nxt_solv (Apply_Method' (mI,_,_,_)) _ (pt:ctree, pos as (p,_)) = neuper@41997: let wneuper@59269: val {srls,ppc,...} = Specify.get_met mI; neuper@42014: val PblObj{meth=itms,origin=(oris,_,_),probl, ...} = get_obj I pt p; wneuper@59265: val itms = if itms <> [] then itms else Chead.complete_metitms oris probl [] ppc neuper@41997: val thy' = get_obj g_domID pt p; neuper@41997: val thy = assoc_thy thy'; wneuper@59257: val (is as ScrState (env,_,_,_,_,_), ctxt, scr) = Lucin.init_scrstate thy itms mI; wneuper@59257: val ini = Lucin.init_form thy scr env; neuper@41997: in neuper@41997: case ini of neuper@41997: SOME t => neuper@41997: let neuper@41997: val pos = ((lev_on o lev_dn) p, Frm) neuper@41997: val tac_ = Apply_Method' (mI, SOME t, is, ctxt); neuper@41997: val (pos,c,_,pt) = (*implicit Take*) wneuper@59271: Generate.generate1 thy tac_ (is, ctxt) pos pt wneuper@59265: in ([(Apply_Method mI, tac_, (pos, (is, ctxt)))], c, (pt, pos)) : Chead.calcstate' end neuper@41997: | NONE => neuper@41997: let neuper@41997: val pt = update_env pt (fst pos) (SOME (is, ctxt)) neuper@41997: val (tacis, c, ptp) = nxt_solve_ (pt, pos) neuper@41997: in (tacis @ neuper@41997: [(Apply_Method mI, Apply_Method' (mI, NONE, e_istate, ctxt), (pos, (is, ctxt)))], neuper@41997: c, ptp) neuper@41997: end neuper@41997: end neuper@41997: neuper@41997: (*TODO.WN050913 remove unnecessary code below*) neuper@37906: | nxt_solv (Check_Postcond' (pI,_)) _ (pt, pos as (p,p_)) = neuper@41997: let neuper@41997: val pp = par_pblobj pt p neuper@41997: val asm = neuper@41997: (case get_obj g_tac pt p of neuper@41997: Check_elementwise _ => (*collects and instantiates asms*) neuper@41997: (snd o (get_obj g_result pt)) p neuper@41997: | _ => get_assumptions_ pt (p,p_)) neuper@41997: handle _ => [] (*FIXME.WN030527 asms in subpbls not completely clear*) neuper@41997: val metID = get_obj g_metID pt pp; wneuper@59269: val {srls=srls,scr=sc,...} = Specify.get_met metID; neuper@41997: val loc as (ScrState (E,l,a,_,_,b), ctxt) = get_loc pt (p,p_); neuper@41997: val thy' = get_obj g_domID pt pp; neuper@37906: val thy = assoc_thy thy'; wneuper@59257: val (_,_,(scval,scsaf)) = Lucin.next_tac (thy',srls) (pt,(p,p_)) sc loc; neuper@41997: in neuper@41997: if pp = [] neuper@41997: then neuper@41997: let neuper@41997: val is = ScrState (E,l,a,scval,scsaf,b) neuper@42018: val tac_ = Check_Postcond'(pI,(scval, asm)) neuper@41997: val ((p,p_),ps,f,pt) = wneuper@59271: Generate.generate1 thy tac_ (is, ctxt) (pp,Res) pt; neuper@41997: in ([(Check_Postcond pI, tac_, ((pp,Res), (is, ctxt)))],ps,(pt, (p,p_))) end neuper@41997: else neuper@41997: let (*resume script of parpbl, transfer value of subpbl-script*) neuper@41997: val ppp = par_pblobj pt (lev_up p); neuper@41997: val thy' = get_obj g_domID pt ppp; neuper@41997: val thy = assoc_thy thy'; neuper@41997: val metID = get_obj g_metID pt ppp; wneuper@59269: val {scr,...} = Specify.get_met metID; neuper@41997: val (ScrState (E,l,a,_,_,b), ctxt') = get_loc pt (pp(*!/p/*),Frm) neuper@42023: val ctxt'' = from_subpbl_to_caller ctxt scval ctxt' neuper@42018: val tac_ = Check_Postcond' (pI, (scval, asm)) neuper@41997: val is = ScrState (E,l,a,scval,scsaf,b) wneuper@59271: val ((p,p_),ps,f,pt) = Generate.generate1 thy tac_ (is, ctxt'') (pp, Res) pt; neuper@41997: in ([(Check_Postcond pI, tac_, ((pp, Res), (is, ctxt'')))], ps, (pt, (p,p_))) end neuper@41997: end neuper@37906: neuper@37906: | nxt_solv (End_Proof'') _ ptp = ([], [], ptp) neuper@37906: neuper@37906: | nxt_solv tac_ is (pt, pos as (p,p_)) = neuper@41999: let neuper@41999: val pos = neuper@41999: case pos of neuper@41999: (p, Met) => ((lev_on o lev_dn) p, Frm)(*begin script*) neuper@41999: | (p, Res) => (lev_on p,Res) (*somewhere in script*) neuper@41999: | _ => pos wneuper@59271: val (pos',c,_,pt) = Generate.generate1 (assoc_thy "Isac") tac_ is pos pt; wneuper@59257: in ([(Lucin.tac_2tac tac_, tac_, (pos,is))], c, (pt, pos')) end neuper@37906: wneuper@59279: (* find the next tac from the script, nxt_solv will update the ctree *) neuper@37906: and nxt_solve_ (ptp as (pt, pos as (p,p_))) = neuper@41972: if e_metID = get_obj g_metID pt (par_pblobj pt p) wneuper@59265: then ([], [], (pt, (p, p_))) : Chead.calcstate' neuper@41972: else neuper@41972: let neuper@41972: val thy' = get_obj g_domID pt (par_pblobj pt p); wneuper@59257: val (srls, is, sc) = Lucin.from_pblobj_or_detail' thy' (p,p_) pt; wneuper@59257: val (tac_,is,(t,_)) = Lucin.next_tac (thy',srls) (pt,pos) sc is; neuper@41972: (*TODO here ^^^ return finished/helpless/ok !*) neuper@41972: in case tac_ of neuper@41972: End_Detail' _ => ([(End_Detail, End_Detail' (t,[(*FIXME.040215*)]), neuper@41972: (pos, is))], [], (pt, pos)) neuper@41972: | _ => nxt_solv tac_ is ptp end; neuper@37906: neuper@42092: (* says how may steps of a calculation should be done by "fun autocalc" *) wneuper@59121: (*FIXXXME040624: does NOT match interfaces/ITOCalc.java wneuper@59121: TODO.WN0512 redesign togehter with autocalc ?*) neuper@37906: datatype auto = wneuper@59260: Step of int (*1 do #int steps (may stop in model/specify) wneuper@59260: IS VERY INEFFICIENT IN MODEL/SPECIY *) neuper@37906: | CompleteModel (*2 complete modeling wneuper@59260: if model complete, finish specifying *) wneuper@59260: | CompleteCalcHead (*3 complete model/specify in one go *) neuper@37906: | CompleteToSubpbl (*4 stop at the next begin of a subproblem, wneuper@59260: if none, complete the actual (sub)problem *) wneuper@59260: | CompleteSubpbl (*5 complete the actual (sub)problem (incl.ev.subproblems) *) wneuper@59260: | CompleteCalc; (*6 complete the calculation as a whole *) neuper@42092: neuper@37906: fun autoord (Step _ ) = 1 neuper@37906: | autoord CompleteModel = 2 neuper@37906: | autoord CompleteCalcHead = 3 neuper@37906: | autoord CompleteToSubpbl = 4 neuper@37906: | autoord CompleteSubpbl = 5 neuper@37906: | autoord CompleteCalc = 6; neuper@37906: wneuper@59279: fun complete_solve auto c (ptp as (_, p as (_,p_)): ctree * pos') = neuper@41997: if p = ([], Res) neuper@41997: then ("end-of-calculation", [], ptp) neuper@41997: else neuper@37935: if member op = [Pbl,Met] p_ neuper@41997: then neuper@41997: let wneuper@59265: val ptp = Chead.all_modspec ptp neuper@41997: val (_, c', ptp) = all_solve auto c ptp neuper@41997: in complete_solve auto (c @ c') ptp end neuper@41997: else neuper@41997: case nxt_solve_ ptp of neuper@41997: ((Subproblem _, tac_, (_, is))::_, c', ptp') => neuper@41997: if autoord auto < 5 neuper@41997: then ("ok", c @ c', ptp) neuper@41997: else neuper@41997: let wneuper@59265: val ptp = Chead.all_modspec ptp' neuper@41997: val (_, c'', ptp) = all_solve auto (c @ c') ptp neuper@41997: in complete_solve auto (c @ c'@ c'') ptp end neuper@41997: | ((Check_Postcond _, tac_, (_, is))::_, c', ptp' as (_, p')) => neuper@41997: if autoord auto < 6 orelse p' = ([],Res) neuper@41997: then ("ok", c @ c', ptp') neuper@41997: else complete_solve auto (c @ c') ptp' neuper@41997: | ((End_Detail, _, _)::_, c', ptp') => neuper@41997: if autoord auto < 6 neuper@41997: then ("ok", c @ c', ptp') neuper@41997: else complete_solve auto (c @ c') ptp' neuper@41997: | (_, c', ptp') => complete_solve auto (c @ c') ptp' neuper@37906: wneuper@59279: and all_solve auto c (ptp as (pt, pos as (p,_)): ctree * pos') = neuper@41997: let neuper@41997: val (_,_,mI) = get_obj g_spec pt p neuper@41997: val ctxt = get_ctxt pt pos neuper@42090: val (_, c', ptp) = nxt_solv (Apply_Method' (mI, NONE, e_istate, ctxt)) (e_istate, ctxt) ptp neuper@41997: in complete_solve auto (c @ c') ptp end; neuper@41997: neuper@41997: (* aux.fun for detailrls with Rrls, reverse rewriting *) s1210629013@52153: fun rul_terms_2nds _ nds t [] = nds s1210629013@52153: | rul_terms_2nds thy nds t ((rule, res as (t', _)) :: rts) = s1210629013@52153: (append_atomic [] (e_istate, e_ctxt) t (rule2tac thy [] rule) res Complete EmptyPtree) :: s1210629013@52153: (rul_terms_2nds thy nds t' rts); neuper@37906: neuper@41997: (* detail steps done internally by Rewrite_Set* into ctree by use of a script *) neuper@41997: fun detailrls pt (pos as (p,p_):pos') = neuper@41997: let neuper@41997: val t = get_obj g_form pt p neuper@41997: val tac = get_obj g_tac pt p neuper@41997: val rls = (assoc_rls o rls_of) tac neuper@41997: val ctxt = get_ctxt pt pos neuper@41997: in neuper@41997: case rls of neuper@41997: Rrls {scr = Rfuns {init_state,...},...} => neuper@41997: let neuper@41997: val (_,_,_,rul_terms) = init_state t s1210629013@52153: val newnds = rul_terms_2nds (Proof_Context.theory_of ctxt) [] t rul_terms neuper@41997: val pt''' = ins_chn newnds pt p neuper@41997: in ("detailrls", pt''', (p @ [length newnds], Res):pos') end neuper@41997: | _ => neuper@41997: let wneuper@59271: val is = Generate.init_istate tac t neuper@41997: (*TODO.WN060602 ScrState (["(t_, Problem (Isac,[equation,univar]))"] neuper@41997: is wrong for simpl, but working ?!? *) neuper@41997: val tac_ = Apply_Method' (e_metID(*WN0402: see generate1 !?!*), SOME t, is, ctxt) neuper@41997: val pos' = ((lev_on o lev_dn) p, Frm) neuper@41997: val thy = assoc_thy "Isac" wneuper@59271: val (_,_,_,pt') = (*implicit Take*)Generate.generate1 thy tac_ (is, ctxt) pos' pt neuper@41997: val (_,_,(pt'',_)) = complete_solve CompleteSubpbl [] (pt',pos') neuper@41997: val newnds = children (get_nd pt'' p) neuper@41997: val pt''' = ins_chn newnds pt p neuper@41997: (*complete_solve cuts branches after*) neuper@41997: in ("detailrls", pt''', (p @ [length newnds], Res):pos') end neuper@41997: end; neuper@37906: neuper@37906: neuper@37906: neuper@37906: (* val(mI,m)=m;val ppp=p;(*!!!*)val(p,p_)=pos;val(_,pt,_)=ppp(*!!!*); neuper@37906: get_form ((mI,m):tac'_) ((p,p_):pos') ppp; neuper@37906: *) neuper@37906: fun get_form ((mI,m):tac'_) ((p,p_):pos') pt = wneuper@59272: case Applicable.applicable_in (p,p_) pt m of wneuper@59271: Chead.Notappl e => Generate.Error' e wneuper@59265: | Chead.Appl m => neuper@37906: (* val Appl m=applicable_in (p,p_) pt m; neuper@37906: *) neuper@37935: if member op = specsteps mI wneuper@59265: then let val (_,_,f,_,_,_) = Chead.specify m (p,p_) [] pt neuper@37906: in f end neuper@37906: else let val (*_,_,f,_,_,_*)_ = solve (mI,m) (pt,(p,p_)) wneuper@59271: in (*f*) Generate.EmptyMout end; neuper@37906: wneuper@59273: end