neuper@37906: (* use"../ME/ctree.sml"; neuper@37906: use"ME/ctree.sml"; neuper@37906: use"ctree.sml"; neuper@37906: W.N.26.10.99 neuper@37906: neuper@38015: tracing (pr_ptree pr_short pt); neuper@37906: neuper@37906: val Nd ( _, ns) = pt; neuper@37906: neuper@37906: *) neuper@37906: neuper@37906: (*structure Ptree (**): PTREE (**) = ###### outcommented ######*) neuper@37906: signature PTREE = neuper@37906: sig neuper@37906: type ptree neuper@37906: type envp neuper@37906: val e_ptree : ptree neuper@37906: exception PTREE of string neuper@37906: type branch neuper@37906: type ostate neuper@37906: type cellID neuper@37906: type cid neuper@37906: type posel neuper@37906: type pos neuper@37906: type pos' neuper@37906: type loc neuper@37906: type domID neuper@37906: type pblID neuper@37906: type metID neuper@37906: type spec neuper@37906: type 'a ppc neuper@37906: type con neuper@37906: type subs neuper@37906: type subst neuper@37906: type env neuper@37906: type ets neuper@37906: val ets2str : ets -> string neuper@37906: type item neuper@37906: type tac neuper@37906: type tac_ neuper@37906: val tac_2str : tac_ -> string neuper@37906: type safe neuper@37906: val safe2str : safe -> string neuper@37906: neuper@37906: type meth neuper@37906: val cappend_atomic : ptree -> pos -> loc -> cterm' -> tac neuper@37906: -> cterm' -> ostate -> cid -> ptree * posel list * cid neuper@37906: val cappend_form : ptree neuper@37906: -> pos -> loc -> cterm' -> cid -> ptree * pos * cid neuper@37906: val cappend_parent : ptree -> pos -> loc -> cterm' -> tac neuper@37906: -> branch -> cid -> ptree * int list * cid neuper@37906: val cappend_problem : ptree -> posel list(*FIXME*) -> loc neuper@37906: -> cterm' list * spec -> cid -> ptree * int list * cellID list neuper@37906: val append_result : ptree -> pos -> cterm' -> ostate -> ptree * pos neuper@37906: neuper@37906: type ppobj neuper@37906: val g_branch : ppobj -> branch neuper@37906: val g_cell : ppobj -> cid neuper@37906: val g_args : ppobj -> (int * (term list)) list (*args of scr*) neuper@37906: val g_form : ppobj -> cterm' neuper@37906: val g_loc : ppobj -> loc neuper@37906: val g_met : ppobj -> meth neuper@37906: val g_domID : ppobj -> domID neuper@37906: val g_metID : ppobj -> metID neuper@37906: val g_model : ppobj -> cterm' ppc neuper@37906: val g_tac : ppobj -> tac neuper@37906: val g_origin : ppobj -> cterm' list * spec neuper@37906: val g_ostate : ppobj -> ostate neuper@37906: val g_pbl : ppobj -> pblID * item ppc neuper@37906: val g_result : ppobj -> cterm' neuper@37906: val g_spec : ppobj -> spec neuper@37906: (* val get_all : (ppobj -> 'a) -> ptree -> 'a list neuper@37906: val get_alls : (ppobj -> 'a) -> ptree list -> 'a list *) neuper@37906: val get_obj : (ppobj -> 'a) -> ptree -> pos -> 'a neuper@37906: val gpt_cell : ptree -> cid neuper@37906: val par_pblobj : ptree -> pos -> pos neuper@37906: val pre_pos : pos -> pos neuper@37906: val lev_dn : int list -> int list neuper@37906: val lev_on : pos -> posel list neuper@37906: val lev_pred : pos -> pos neuper@37906: val lev_up : pos -> pos neuper@37906: (* val pr_cell : pos -> ppobj -> string neuper@37906: val pr_pos : int list -> string *) neuper@37906: val pr_ptree : (pos -> ppobj -> string) -> ptree -> string neuper@37906: val pr_short : pos -> ppobj -> string neuper@37906: (* val repl : 'a list -> int -> 'a -> 'a list neuper@37906: val repl_app : 'a list -> int -> 'a -> 'a list neuper@37906: val repl_branch : branch -> ppobj -> ppobj neuper@37906: val repl_domID : domID -> ppobj -> ppobj neuper@37906: val repl_form : cterm' -> ppobj -> ppobj neuper@37906: val repl_met : item ppc -> ppobj -> ppobj neuper@37906: val repl_metID : metID -> ppobj -> ppobj neuper@37906: val repl_model : cterm' list -> ppobj -> ppobj neuper@37906: val repl_tac : tac -> ppobj -> ppobj neuper@37906: val repl_pbl : item ppc -> ppobj -> ppobj neuper@37906: val repl_pblID : pblID -> ppobj -> ppobj neuper@37906: val repl_result : cterm' -> ostate -> ppobj -> ppobj neuper@37906: val repl_spec : spec -> ppobj -> ppobj neuper@37906: val repl_subs : (string * string) list -> ppobj -> ppobj *) neuper@37906: val rootthy : ptree -> domID neuper@37906: (* val test_trans : ppobj -> bool neuper@37906: val uni__asm : (string * pos) list -> ppobj -> ppobj neuper@37906: val uni__cid : cellID list -> ppobj -> ppobj *) neuper@37906: val union_asm : ptree -> pos -> (string * pos) list -> ptree neuper@37906: val union_cid : ptree -> pos -> cellID list -> ptree neuper@37906: val update_branch : ptree -> pos -> branch -> ptree neuper@37906: val update_domID : ptree -> pos -> domID -> ptree neuper@37906: val update_met : ptree -> pos -> meth -> ptree neuper@37906: val update_metppc : ptree -> pos -> item ppc -> ptree neuper@37906: val update_metID : ptree -> pos -> metID -> ptree neuper@37906: val update_tac : ptree -> pos -> tac -> ptree neuper@37906: val update_pbl : ptree -> pos -> pblID * item ppc -> ptree neuper@37906: val update_pblppc : ptree -> pos -> item ppc -> ptree neuper@37906: val update_pblID : ptree -> pos -> pblID -> ptree neuper@37906: val update_spec : ptree -> pos -> spec -> ptree neuper@37906: val update_subs : ptree -> pos -> (string * string) list -> ptree neuper@37906: neuper@37906: val rep_pblobj : ppobj neuper@37906: -> {branch:branch, cell:cid, env:envp, loc:loc, meth:meth, model:cterm' ppc, neuper@37906: origin:cterm' list * spec, ostate:ostate, probl:pblID * item ppc, neuper@37906: result:cterm', spec:spec} neuper@37906: val rep_prfobj : ppobj neuper@37906: -> {branch:branch, cell:cid, form:cterm', loc:loc, tac:tac, neuper@37906: ostate:ostate, result:cterm'} neuper@37906: end neuper@37906: neuper@37906: (* -------------- neuper@37906: structure Ptree (**): PTREE (**) = neuper@37906: struct neuper@37906: -------------- *) neuper@37906: neuper@37906: type env = (term * term) list; neuper@37906: neuper@37906: neuper@37906: datatype branch = neuper@37906: NoBranch | AndB | OrB neuper@37906: | TransitiveB (* FIXXXME.8.03: set branch from met in Apply_Method neuper@37906: FIXXXME.0402: -"- in Begin_Trans'*) neuper@37906: | SequenceB | IntersectB | CollectB | MapB; neuper@37906: fun branch2str NoBranch = "NoBranch" neuper@37906: | branch2str AndB = "AndB" neuper@37906: | branch2str OrB = "OrB" neuper@37906: | branch2str TransitiveB = "TransitiveB" neuper@37906: | branch2str SequenceB = "SequenceB" neuper@37906: | branch2str IntersectB = "IntersectB" neuper@37906: | branch2str CollectB = "CollectB" neuper@37906: | branch2str MapB = "MapB"; neuper@37906: neuper@37906: datatype ostate = neuper@37906: Incomplete | Complete | Inconsistent(*WN041020 latter unused*); neuper@37906: fun ostate2str Incomplete = "Incomplete" neuper@37906: | ostate2str Complete = "Complete" neuper@37906: | ostate2str Inconsistent = "Inconsistent"; neuper@37906: neuper@37906: type cellID = int; neuper@37906: type cid = cellID list; neuper@37906: neuper@37906: type posel = int; (* roundabout for (some of) nice signatures *) neuper@37906: type pos = posel list; neuper@37906: val pos2str = ints2str'; neuper@37906: datatype pos_ = neuper@37906: Pbl (*PblObj-position: problem-type*) neuper@37906: | Met (*PblObj-position: method*) neuper@37906: | Frm (*PblObj-position: -> Pbl in ME (not by moveDown !) neuper@37906: | PrfObj-position: formula*) neuper@37906: | Res (*PblObj | PrfObj-position: result*) neuper@37906: | Und; (*undefined*) neuper@37906: fun pos_2str Pbl = "Pbl" neuper@37906: | pos_2str Met = "Met" neuper@37906: | pos_2str Frm = "Frm" neuper@37906: | pos_2str Res = "Res" neuper@37906: | pos_2str Und = "Und"; neuper@37906: neuper@37906: type pos' = pos * pos_; neuper@37906: (*WN.12.03 remembering interator (pos * pos_) for ptree neuper@37906: pos : lev_on, lev_dn, lev_up, neuper@37906: lev_onFrm, lev_dnRes (..see solve Apply_Method !) neuper@37906: pos_: neuper@37906: # generate1 sets pos_ if possible ...?WN0502?NOT... neuper@37906: # generate1 does NOT set pos, because certain nodes can be lev_on OR lev_dn neuper@37906: exceptions: Begin/End_Trans neuper@37906: # thus generate(1) called in neuper@37906: .# assy, locate_gen neuper@37906: .# nxt_solv (tac_ -cases); general case: neuper@37906: val pos' = case pos' of (p,Res) => (lev_on p',Res) | _ => pos' neuper@37906: # WN050220, S(604): neuper@37906: generate1...(Rewrite(f,..,res))..(pos, pos_) neuper@37906: cappend_atomic.................pos ////// gets f+res always!!! neuper@37906: cut_tree....................pos, pos_ neuper@37906: *) neuper@37906: fun pos'2str (p,p_) = pair2str (ints2str' p, pos_2str p_); neuper@37906: fun pos's2str ps = (strs2str' o (map pos'2str)) ps; neuper@37906: val e_pos' = ([],Und):pos'; neuper@37906: neuper@37906: fun res2str (t, ts) = pair2str (term2str t, terms2str ts); neuper@37906: fun asm2str (t, p:pos) = pair2str (term2str t, ints2str' p); neuper@37906: fun asms2str asms = (strs2str' o (map asm2str)) asms; neuper@37906: neuper@37906: neuper@37906: neuper@37906: (*26.4.02: never used after introduction of scripts !!! neuper@37906: type loc = loc_ * (* + interpreter-state *) neuper@37906: (loc_ * rls') (* -"- for script of the ruleset*) neuper@37906: option; neuper@37926: val e_loc = ([],NONE):loc; neuper@37906: val ee_loc = (e_loc,e_loc);*) neuper@37906: neuper@37906: neuper@37906: datatype safe = Sundef | Safe | Unsafe | Helpless; neuper@37906: fun safe2str Sundef = "Sundef" neuper@37906: | safe2str Safe = "Safe" neuper@37906: | safe2str Unsafe = "Unsafe" neuper@37906: | safe2str Helpless = "Helpless"; neuper@37906: neuper@37906: type subs = cterm' list; (*16.11.00 for FE-KE*) neuper@37906: val e_subs = ["(bdv, x)"]; neuper@37906: neuper@37906: (*._sub_stitution as strings of _e_qualities.*) neuper@37906: type sube = cterm' list; neuper@37906: val e_sube = []:cterm' list; neuper@37906: fun sube2str s = strs2str s; neuper@37906: neuper@37906: (*._sub_stitution as _t_erms of _e_qualities.*) neuper@37906: type subte = term list; neuper@37906: val e_subte = []:term list; neuper@37906: fun subte2str ss = terms2str ss; neuper@37906: neuper@37906: fun subte2sube ss = map term2str ss; neuper@37906: neuper@37906: fun subst2subs s = map (pair2str o neuper@37929: (apfst (Syntax.string_of_term (thy2ctxt' "Isac"))) o neuper@37929: (apsnd (Syntax.string_of_term (thy2ctxt' "Isac")))) s; neuper@37929: fun subst2subs' s = map ((apfst (Syntax.string_of_term (thy2ctxt' "Isac"))) o neuper@37929: (apsnd (Syntax.string_of_term (thy2ctxt' "Isac")))) s; neuper@37906: fun subs2subst thy s = map (isapair2pair o term_of o the o (parse thy)) s; neuper@37906: (*> subs2subst thy ["(bdv,x)","(err,#0)"]; neuper@37906: val it = neuper@37906: [(Free ("bdv","RealDef.real"),Free ("x","RealDef.real")), neuper@37906: (Free ("err","RealDef.real"),Free ("#0","RealDef.real"))] neuper@37906: : (term * term) list*) neuper@37906: (*["bdv=x","err=0"] ---> [(bdv,x), (err,0)]*) neuper@37906: fun sube2subst thy s = map (dest_equals' o term_of o the o (parse thy)) s; neuper@37906: (* val ts = sube2subst thy ["bdv=x","err=0"]; neuper@37906: subst2str' ts; neuper@37906: *) neuper@37906: fun sube2subte ss = map str2term ss; neuper@37906: neuper@37906: neuper@37906: fun isasub2subst isasub = ((map isapair2pair) o isalist2list) isasub; neuper@37906: neuper@37906: neuper@37906: type scrstate = (*state for script interpreter*) neuper@37906: env(*stack*) (*used to instantiate tac for checking assod neuper@37906: 12.03.noticed: e_ not updated during execution ?!?*) neuper@37906: * loc_ (*location of tac in script*) neuper@37906: * term option(*argument of curried functions*) neuper@37906: * term (*value obtained by tac executed neuper@37906: updated also after a derivation by 'new_val'*) neuper@37906: * safe (*estimation of how result will be obtained*) neuper@37906: * bool; (*true = strongly .., false = weakly associated: neuper@37906: only used during ass_dn/up*) neuper@37925: val e_scrstate = ([],[],NONE,e_term,Sundef,false):scrstate; neuper@37906: neuper@37906: neuper@37906: (*21.8.02 ---> definitions.sml for datatype scr neuper@37906: type rrlsstate = (*state for reverse rewriting*) neuper@37906: (term * (*the current formula*) neuper@37906: rule list (*of reverse rewrite set (#1#)*) neuper@37906: list * (*may be serveral, eg. in norm_rational*) neuper@37906: (rule * (*Thm (+ Thm generated from Calc) resulting in ...*) neuper@37906: (term * (*... rewrite with ...*) neuper@37906: term list)) (*... assumptions*) neuper@37906: list); (*derivation from given term to normalform neuper@37906: in reverse order with sym_thm; neuper@37906: (#1#) could be extracted from here #1*) --------*) neuper@37906: neuper@37906: datatype istate = (*interpreter state*) neuper@37906: Uistate (*undefined in modspec, in '_deriv'ation*) neuper@37906: | ScrState of scrstate (*for script interpreter*) neuper@37906: | RrlsState of rrlsstate; (*for reverse rewriting*) neuper@37925: val e_istate = (ScrState ([],[],NONE,e_term,Sundef,false)):istate; neuper@37906: neuper@37906: type iist = istate option * istate option; neuper@37906: (*val e_iist = (e_istate, e_istate); --- sinnlos f"ur NICHT-equality-type*) neuper@37906: neuper@37906: neuper@37906: fun rta2str (r,(t,a)) = "\n("^(rule2str r)^",("^(term2str t)^", "^ neuper@37906: (terms2str a)^"))"; neuper@37906: fun istate2str Uistate = "Uistate" neuper@37906: | istate2str (ScrState (e,l,to,t,s,b):istate) = neuper@37906: "ScrState ("^ subst2str e ^",\n "^ neuper@37906: loc_2str l ^", "^ termopt2str to ^",\n "^ neuper@37906: term2str t ^", "^ safe2str s ^", "^ bool2str b ^")" neuper@37906: | istate2str (RrlsState (t,t1,rss,rtas)) = neuper@37906: "RrlsState ("^(term2str t)^", "^(term2str t1)^", "^ neuper@37906: ((strs2str o (map (strs2str o (map rule2str)))) rss)^", "^ neuper@37906: ((strs2str o (map rta2str)) rtas)^")"; neuper@37925: fun istates2str (NONE, NONE) = "(#NONE, #NONE)" neuper@37925: | istates2str (NONE, SOME ist) = "(#NONE,\n#SOME "^istate2str ist^")" neuper@37925: | istates2str (SOME ist, NONE) = "(#SOME "^istate2str ist^",\n #NONE)" neuper@37925: | istates2str (SOME i1, SOME i2) = "(#SOME "^istate2str i1^",\n #SOME "^ neuper@37906: istate2str i2^")"; neuper@37906: neuper@37906: fun new_val v (ScrState (env, loc_, topt, _, safe, bool)) = neuper@37906: (ScrState (env, loc_, topt, v, safe, bool)) neuper@38031: | new_val _ _ = error "new_val: only for ScrState"; neuper@37906: neuper@37906: datatype con = land | lor; neuper@37906: neuper@37906: neuper@37906: type spec = neuper@37906: domID * (*WN.12.03: is replaced by thy from get_met ?FIXME? in: neuper@37906: specify (Init_Proof..), nxt_specify_init_calc, neuper@37906: assod (.SubProblem...), stac2tac (.SubProblem...)*) neuper@37906: pblID * neuper@37906: metID; neuper@37906: fun spec2str ((dom,pbl,met)(*:spec*)) = neuper@37906: "(" ^ (quote dom) ^ ", " ^ (strs2str pbl) ^ neuper@37906: ", " ^ (strs2str met) ^ ")"; neuper@37906: (*> spec2str empty_spec; neuper@37906: val it = "(\"\", [], (\"\", \"\"))" : string *) neuper@37906: val empty_spec = (e_domID,e_pblID,e_metID):spec; neuper@37906: val e_spec = empty_spec; neuper@37906: neuper@37906: neuper@37906: neuper@37906: (*.tactics propagate the construction of the calc-tree; neuper@37906: there are neuper@37906: (a) 'specsteps' for the specify-phase, and others for the solve-phase neuper@37906: (b) those of the solve-phase are 'initac's and others; neuper@37906: initacs start with a formula different from the preceding formula. neuper@37906: see 'type tac_' for the internal representation of tactics.*) neuper@37906: datatype tac = neuper@37906: Init_Proof of ((cterm' list) * spec) neuper@37906: (*'specsteps'...*) neuper@37906: | Model_Problem neuper@37906: | Refine_Problem of pblID | Refine_Tacitly of pblID neuper@37906: neuper@37906: | Add_Given of cterm' | Del_Given of cterm' neuper@37906: | Add_Find of cterm' | Del_Find of cterm' neuper@37906: | Add_Relation of cterm' | Del_Relation of cterm' neuper@37906: neuper@37906: | Specify_Theory of domID | Specify_Problem of pblID neuper@37906: | Specify_Method of metID neuper@37906: (*...'specsteps'*) neuper@37906: | Apply_Method of metID neuper@37906: (*.creates an 'istate' in PblObj.env; in case of 'init_form' neuper@37906: creates a formula at ((lev_on o lev_dn) p, Frm) and in this ppobj.'loc' neuper@37925: 'SOME istate' (at fst of 'loc'). neuper@37906: As each step (in the solve-phase) has a resulting formula (at the front-end) neuper@37906: Apply_Method also does the 1st step in the script (an 'initac') if there neuper@37906: is no 'init_form' .*) neuper@37906: | Check_Postcond of pblID neuper@37906: | Free_Solve neuper@37906: neuper@37906: | Rewrite_Inst of ( subs * thm') | Rewrite of thm' neuper@37906: | Rewrite_Asm of thm' neuper@37906: | Rewrite_Set_Inst of ( subs * rls') | Rewrite_Set of rls' neuper@37906: | Detail_Set_Inst of ( subs * rls') | Detail_Set of rls' neuper@37906: | End_Detail (*end of script from next_tac, neuper@37906: in solve: switches back to parent script WN0509 drop!*) neuper@37906: | Derive of rls' (*an input formula using rls WN0509 drop!*) neuper@37906: | Calculate of string (* plus | minus | times | cancel | pow | sqrt *) neuper@37906: | End_Ruleset neuper@37906: | Substitute of sube | Apply_Assumption of cterm' list neuper@37906: neuper@37906: | Take of cterm' (*an 'initac'*) neuper@37906: | Take_Inst of cterm' neuper@37906: | Group of (con * int list ) neuper@37906: | Subproblem of (domID * pblID) (*an 'initac'*) neuper@37906: | CAScmd of cterm' (*6.6.02 URD: Function formula; WN0509 drop!*) neuper@37906: | End_Subproblem (*WN0509 drop!*) neuper@37906: neuper@37906: | Split_And | Conclude_And neuper@37906: | Split_Or | Conclude_Or neuper@37906: | Begin_Trans | End_Trans neuper@37906: | Begin_Sequ | End_Sequ(* substitute root.env *) neuper@37906: | Split_Intersect | End_Intersect neuper@37906: | Check_elementwise of cterm' | Collect_Trues neuper@37906: | Or_to_List neuper@37906: neuper@37906: | Empty_Tac (*TODO.11.6.03 ... of string: could carry msg of (Notappl msg) neuper@37906: in 'helpless'*) neuper@37906: | Tac of string(* eg.'repeat'*WN0509 drop!*) neuper@37906: | User (*internal, for ets*WN0509 drop!*) neuper@37906: | End_Proof';(* inout*) neuper@37906: neuper@37906: (* tac2str /--> library.sml: needed in dialog.sml for 'separable *) neuper@37906: fun tac2str (ma:tac) = case ma of neuper@37906: Init_Proof (ppc, spec) => neuper@37906: "Init_Proof "^(pair2str (strs2str ppc, spec2str spec)) neuper@37906: | Model_Problem => "Model_Problem " neuper@37906: | Refine_Tacitly pblID => "Refine_Tacitly "^(strs2str pblID) neuper@37906: | Refine_Problem pblID => "Refine_Problem "^(strs2str pblID) neuper@37906: | Add_Given cterm' => "Add_Given "^cterm' neuper@37906: | Del_Given cterm' => "Del_Given "^cterm' neuper@37906: | Add_Find cterm' => "Add_Find "^cterm' neuper@37906: | Del_Find cterm' => "Del_Find "^cterm' neuper@37906: | Add_Relation cterm' => "Add_Relation "^cterm' neuper@37906: | Del_Relation cterm' => "Del_Relation "^cterm' neuper@37906: neuper@37906: | Specify_Theory domID => "Specify_Theory "^(quote domID ) neuper@37906: | Specify_Problem pblID => "Specify_Problem "^(strs2str pblID ) neuper@37906: | Specify_Method metID => "Specify_Method "^(strs2str metID) neuper@37906: | Apply_Method metID => "Apply_Method "^(strs2str metID) neuper@37906: | Check_Postcond pblID => "Check_Postcond "^(strs2str pblID) neuper@37906: | Free_Solve => "Free_Solve" neuper@37906: neuper@37906: | Rewrite_Inst (subs,thm')=> neuper@37906: "Rewrite_Inst "^(pair2str (subs2str subs, spair2str thm')) neuper@37906: | Rewrite thm' => "Rewrite "^(spair2str thm') neuper@37906: | Rewrite_Asm thm' => "Rewrite_Asm "^(spair2str thm') neuper@37906: | Rewrite_Set_Inst (subs, rls) => neuper@37906: "Rewrite_Set_Inst "^(pair2str (subs2str subs, quote rls)) neuper@37906: | Rewrite_Set rls => "Rewrite_Set "^(quote rls ) neuper@37906: | Detail_Set rls => "Detail_Set "^(quote rls ) neuper@37906: | Detail_Set_Inst (subs, rls) => neuper@37906: "Detail_Set_Inst "^(pair2str (subs2str subs, quote rls)) neuper@37906: | End_Detail => "End_Detail" neuper@37906: | Derive rls' => "Derive "^rls' neuper@37906: | Calculate op_ => "Calculate "^op_ neuper@37906: | Substitute sube => "Substitute "^sube2str sube neuper@37906: | Apply_Assumption ct's => "Apply_Assumption "^(strs2str ct's) neuper@37906: neuper@37906: | Take cterm' => "Take "^(quote cterm' ) neuper@37906: | Take_Inst cterm' => "Take_Inst "^(quote cterm' ) neuper@37906: | Group (con, ints) => neuper@37906: "Group "^(pair2str (con2str con, ints2str ints)) neuper@37906: | Subproblem (domID, pblID) => neuper@37906: "Subproblem "^(pair2str (domID, strs2str pblID)) neuper@37906: (*| Subproblem_Full (spec, cts') => neuper@37906: "Subproblem_Full "^(pair2str (spec2str spec, strs2str cts'))*) neuper@37906: | End_Subproblem => "End_Subproblem" neuper@37906: | CAScmd cterm' => "CAScmd "^(quote cterm') neuper@37906: neuper@37906: | Check_elementwise cterm'=> "Check_elementwise "^(quote cterm') neuper@37906: | Or_to_List => "Or_to_List " neuper@37906: | Collect_Trues => "Collect_Trues" neuper@37906: neuper@37906: | Empty_Tac => "Empty_Tac" neuper@37906: | Tac string => "Tac "^string neuper@37906: | User => "User" neuper@37906: | End_Proof' => "tac End_Proof'" neuper@37906: | _ => "tac2str not impl. for ?!"; neuper@37906: neuper@37906: fun is_rewset (Rewrite_Set_Inst _) = true neuper@37906: | is_rewset (Rewrite_Set _) = true neuper@37906: | is_rewset _ = false; neuper@37906: fun is_rewtac (Rewrite _) = true neuper@37906: | is_rewtac (Rewrite_Inst _) = true neuper@37906: | is_rewtac (Rewrite_Asm _) = true neuper@37906: | is_rewtac tac = is_rewset tac; neuper@37906: neuper@37906: fun tac2IDstr (ma:tac) = case ma of neuper@37906: Model_Problem => "Model_Problem" neuper@37906: | Refine_Tacitly pblID => "Refine_Tacitly" neuper@37906: | Refine_Problem pblID => "Refine_Problem" neuper@37906: | Add_Given cterm' => "Add_Given" neuper@37906: | Del_Given cterm' => "Del_Given" neuper@37906: | Add_Find cterm' => "Add_Find" neuper@37906: | Del_Find cterm' => "Del_Find" neuper@37906: | Add_Relation cterm' => "Add_Relation" neuper@37906: | Del_Relation cterm' => "Del_Relation" neuper@37906: neuper@37906: | Specify_Theory domID => "Specify_Theory" neuper@37906: | Specify_Problem pblID => "Specify_Problem" neuper@37906: | Specify_Method metID => "Specify_Method" neuper@37906: | Apply_Method metID => "Apply_Method" neuper@37906: | Check_Postcond pblID => "Check_Postcond" neuper@37906: | Free_Solve => "Free_Solve" neuper@37906: neuper@37906: | Rewrite_Inst (subs,thm')=> "Rewrite_Inst" neuper@37906: | Rewrite thm' => "Rewrite" neuper@37906: | Rewrite_Asm thm' => "Rewrite_Asm" neuper@37906: | Rewrite_Set_Inst (subs, rls) => "Rewrite_Set_Inst" neuper@37906: | Rewrite_Set rls => "Rewrite_Set" neuper@37906: | Detail_Set rls => "Detail_Set" neuper@37906: | Detail_Set_Inst (subs, rls) => "Detail_Set_Inst" neuper@37906: | Derive rls' => "Derive " neuper@37906: | Calculate op_ => "Calculate " neuper@37906: | Substitute subs => "Substitute" neuper@37906: | Apply_Assumption ct's => "Apply_Assumption" neuper@37906: neuper@37906: | Take cterm' => "Take" neuper@37906: | Take_Inst cterm' => "Take_Inst" neuper@37906: | Group (con, ints) => "Group" neuper@37906: | Subproblem (domID, pblID) => "Subproblem" neuper@37906: | End_Subproblem => "End_Subproblem" neuper@37906: | CAScmd cterm' => "CAScmd" neuper@37906: neuper@37906: | Check_elementwise cterm'=> "Check_elementwise" neuper@37906: | Or_to_List => "Or_to_List " neuper@37906: | Collect_Trues => "Collect_Trues" neuper@37906: neuper@37906: | Empty_Tac => "Empty_Tac" neuper@37906: | Tac string => "Tac " neuper@37906: | User => "User" neuper@37906: | End_Proof' => "End_Proof'" neuper@37906: | _ => "tac2str not impl. for ?!"; neuper@37906: neuper@37906: fun rls_of (Rewrite_Set_Inst (_, rls)) = rls neuper@37906: | rls_of (Rewrite_Set rls) = rls neuper@38031: | rls_of tac = error ("rls_of: called with tac '"^tac2IDstr tac^"'"); neuper@37906: neuper@37906: fun thm_of_rew (Rewrite_Inst (subs,(thmID,_))) = neuper@37925: (thmID, SOME ((subs2subst (assoc_thy "Isac.thy") subs):subst)) neuper@37925: | thm_of_rew (Rewrite (thmID,_)) = (thmID, NONE) neuper@37925: | thm_of_rew (Rewrite_Asm (thmID,_)) = (thmID, NONE); neuper@37906: neuper@37906: fun rls_of_rewset (Rewrite_Set_Inst (subs,rls)) = neuper@37925: (rls, SOME ((subs2subst (assoc_thy "Isac.thy") subs):subst)) neuper@37925: | rls_of_rewset (Rewrite_Set rls) = (rls, NONE) neuper@37925: | rls_of_rewset (Detail_Set rls) = (rls, NONE) neuper@37906: | rls_of_rewset (Detail_Set_Inst (subs, rls)) = neuper@37925: (rls, SOME ((subs2subst (assoc_thy "Isac.thy") subs):subst)); neuper@37906: neuper@37906: fun rule2tac _ (Calc (opID, thm)) = Calculate (calID2calcID opID) neuper@37906: | rule2tac [] (Thm (thmID, thm)) = Rewrite (thmID, string_of_thmI thm) neuper@37906: | rule2tac subst (Thm (thmID, thm)) = neuper@37906: Rewrite_Inst (subst2subs subst, (thmID, string_of_thmI thm)) neuper@37906: | rule2tac [] (Rls_ rls) = Rewrite_Set (id_rls rls) neuper@37906: | rule2tac subst (Rls_ rls) = neuper@37906: Rewrite_Set_Inst (subst2subs subst, (id_rls rls)) neuper@37906: | rule2tac _ rule = neuper@38031: error ("rule2tac: called with '" ^ rule2str rule ^ "'"); neuper@37906: neuper@37906: type fmz_ = cterm' list; neuper@37906: neuper@37906: (*.a formalization of an example containing data neuper@37906: sufficient for mechanically finding the solution for the example.*) neuper@37906: (*FIXME.WN051014: dont store fmz = (_,spec) in the PblObj, neuper@37906: this is done in origin*) neuper@37906: type fmz = fmz_ * spec; neuper@37906: val e_fmz = ([],e_spec); neuper@37906: neuper@37906: (*tac_ is made from tac in applicable_in, neuper@37906: and carries all data necessary for generate;*) neuper@37906: datatype tac_ = neuper@37906: (* datatype tac = *) neuper@37906: Init_Proof' of ((cterm' list) * spec) neuper@37906: (* ori list !: code specify -> applicable*) neuper@37906: | Model_Problem' of pblID * neuper@37906: itm list * (*the 'untouched' pbl*) neuper@37906: itm list (*the casually completed met*) neuper@37906: | Refine_Tacitly' of pblID * (*input*) neuper@37906: pblID * (*the refined from applicable_in*) neuper@37906: domID * (*from new pbt?! filled in specify*) neuper@37906: metID * (*from new pbt?! filled in specify*) neuper@37906: itm list (*drop ! 9.03: remains [] for neuper@37906: Model_Problem recognizing its activation*) neuper@37906: | Refine_Problem' of (pblID * (itm list * (bool * Term.term) list)) neuper@37906: (*FIXME?040215 drop: done automatically in init_proof + Subproblem'*) neuper@37906: | Add_Given' of cterm' * neuper@37906: itm list (*updated with input in fun specify_additem*) neuper@37906: | Add_Find' of cterm' * neuper@37906: itm list (*updated with input in fun specify_additem*) neuper@37906: | Add_Relation' of cterm' * neuper@37906: itm list (*updated with input in fun specify_additem*) neuper@37906: | Del_Given' of cterm' | Del_Find' of cterm' | Del_Relation' of cterm' neuper@37906: (*4.00.: all.. term: in applicable_in ..? Syn ?only for FormFK?*) neuper@37906: neuper@37906: | Specify_Theory' of domID neuper@37906: | Specify_Problem' of (pblID * (* *) neuper@37906: (bool * (* matches *) neuper@37906: (itm list * (* ppc *) neuper@37906: (bool * term) list))) (* preconditions *) neuper@37906: | Specify_Method' of metID * neuper@37906: ori list * (*repl. "#undef"*) neuper@37906: itm list (*... updated from pbl to met*) neuper@37906: | Apply_Method' of metID * neuper@37906: (term option) * (*init_form*) neuper@37906: istate neuper@37906: | Check_Postcond' of neuper@37906: pblID * neuper@37906: (term * (*returnvalue of script in solve*) neuper@37906: cterm' list)(*collect by get_assumptions_ in applicable_in, except if neuper@37906: butlast tac is Check_elementwise: take only these asms*) neuper@37906: | Free_Solve' neuper@37906: neuper@37906: | Rewrite_Inst' of theory' * rew_ord' * rls neuper@37906: * bool * subst * thm' * term * (term * term list) neuper@37906: | Rewrite' of theory' * rew_ord' * rls * bool * thm' * neuper@37906: term * (term * term list) neuper@37906: | Rewrite_Asm' of theory' * rew_ord' * rls * bool * thm' * neuper@37906: term * (term * term list) neuper@37906: | Rewrite_Set_Inst' of theory' * bool * subst * rls * neuper@37906: term * (term * term list) neuper@37906: | Detail_Set_Inst' of theory' * bool * subst * rls * neuper@37906: term * (term * term list) neuper@37906: | Rewrite_Set' of theory' * bool * rls * term * (term * term list) neuper@37906: | Detail_Set' of theory' * bool * rls * term * (term * term list) neuper@37906: | End_Detail' of (term * (term list)) (*see End_Trans'*) neuper@37906: | End_Ruleset' of term neuper@37906: | Derive' of rls neuper@37906: | Calculate' of theory' * string * term * (term * thm') neuper@37906: (*WN.29.4.03 asm?: * term list??*) neuper@37906: | Substitute' of subte (*the 'substitution': terms of type bool*) neuper@37906: * term (*to be substituted in*) neuper@37906: * term (*resulting from the substitution*) neuper@37906: | Apply_Assumption' of term list * term neuper@37906: neuper@37906: | Take' of term | Take_Inst' of term neuper@37906: | Group' of (con * int list * term) neuper@37906: | Subproblem' of (spec * neuper@37906: (ori list) * (*filled in assod Subproblem'*) neuper@37906: term * (*-"-, headline of calc-head *) neuper@37906: fmz_ * neuper@37906: term) (*Subproblem(dom,pbl)*) neuper@37906: | CAScmd' of term neuper@37906: | End_Subproblem' of term (*???*) neuper@37906: | Split_And' of term | Conclude_And' of term neuper@37906: | Split_Or' of term | Conclude_Or' of term neuper@37906: | Begin_Trans' of term | End_Trans' of (term * (term list)) neuper@37906: | Begin_Sequ' | End_Sequ'(* substitute root.env*) neuper@37906: | Split_Intersect' of term | End_Intersect' of term neuper@37906: | Check_elementwise' of (*special case:*) neuper@37906: term * (*(1)the current formula: [x=1,x=...]*) neuper@37906: string * (*(2)the pred from Check_elementwise *) neuper@37906: (term * (*(3)composed from (1) and (2): {x. pred}*) neuper@37906: term list) (*20.5.03 assumptions*) neuper@37906: neuper@37906: | Or_to_List' of term * term (* (a | b, [a,b]) *) neuper@37906: | Collect_Trues' of term neuper@37906: neuper@37906: | Empty_Tac_ | Tac_ of (*for dummies*) neuper@37906: theory * neuper@37906: string * (*form*) neuper@37906: string * (*in Tac*) neuper@37906: string (*result of Tac".."*) neuper@37906: | User' (*internal for ets*) | End_Proof'';(*End_Proof:inout*) neuper@37906: neuper@37906: fun tac_2str ma = case ma of neuper@37906: Init_Proof' (ppc, spec) => neuper@37906: "Init_Proof' "^(pair2str (strs2str ppc, spec2str spec)) neuper@37906: | Model_Problem' (pblID,_,_) => "Model_Problem' "^(strs2str pblID ) neuper@37906: | Refine_Tacitly'(p,prefin,domID,metID,itms)=> neuper@37906: "Refine_Tacitly' (" neuper@37906: ^(strs2str p)^", "^(strs2str prefin)^", " neuper@37906: ^domID^", "^(strs2str metID)^", pbl-itms)" neuper@37906: | Refine_Problem' ms => "Refine_Problem' ("^(*matchs2str ms*)"..."^")" neuper@37906: (*| Match_Problem' (pI, (ok, (itms, pre))) => neuper@37906: "Match_Problem' "^(spair2str (strs2str pI, neuper@37906: spair2str (bool2str ok, neuper@37924: spair2str ("itms2str_ itms", neuper@37906: "items2str pre"))))*) neuper@37906: | Add_Given' cterm' => "Add_Given' "(*^cterm'*) neuper@37906: | Del_Given' cterm' => "Del_Given' "(*^cterm'*) neuper@37906: | Add_Find' cterm' => "Add_Find' "(*^cterm'*) neuper@37906: | Del_Find' cterm' => "Del_Find' "(*^cterm'*) neuper@37906: | Add_Relation' cterm' => "Add_Relation' "(*^cterm'*) neuper@37906: | Del_Relation' cterm' => "Del_Relation' "(*^cterm'*) neuper@37906: neuper@37906: | Specify_Theory' domID => "Specify_Theory' "^(quote domID ) neuper@37906: | Specify_Problem' (pI, (ok, (itms, pre))) => neuper@37906: "Specify_Problem' "^(spair2str (strs2str pI, neuper@37906: spair2str (bool2str ok, neuper@37924: spair2str ("itms2str_ itms", neuper@37906: "items2str pre")))) neuper@37906: | Specify_Method' (pI,oris,itms) => neuper@37906: "Specify_Method' ("^metID2str pI^", "^oris2str oris^", )" neuper@37906: neuper@37906: | Apply_Method' (metID,_,_) => "Apply_Method' "^(strs2str metID) neuper@37906: | Check_Postcond' (pblID,(scval,asm)) => neuper@37906: "Check_Postcond' "^(spair2str(strs2str pblID, neuper@37906: spair2str (term2str scval, strs2str asm))) neuper@37906: neuper@37906: | Free_Solve' => "Free_Solve'" neuper@37906: neuper@37906: | Rewrite_Inst' (*subs,thm'*) _ => neuper@37906: "Rewrite_Inst' "(*^(pair2str (subs2str subs, spair2str thm'))*) neuper@37906: | Rewrite' thm' => "Rewrite' "(*^(spair2str thm')*) neuper@37906: | Rewrite_Asm' thm' => "Rewrite_Asm' "(*^(spair2str thm')*) neuper@37906: | Rewrite_Set_Inst' (*subs,thm'*) _ => neuper@37906: "Rewrite_Set_Inst' "(*^(pair2str (subs2str subs, quote rls))*) neuper@37906: | Rewrite_Set'(thy',pasm,rls',f,(f',asm)) neuper@37906: => "Rewrite_Set' ("^thy'^","^(bool2str pasm)^","^(id_rls rls')^"," neuper@37929: ^(Syntax.string_of_term (thy2ctxt' "Isac") f)^",("^(Syntax.string_of_term (thy2ctxt' "Isac") f') neuper@37929: ^","^((strs2str o (map (Syntax.string_of_term (thy2ctxt' "Isac")))) asm)^"))" neuper@37906: neuper@37906: | End_Detail' _ => "End_Detail' xxx" neuper@37906: | Detail_Set' _ => "Detail_Set' xxx" neuper@37906: | Detail_Set_Inst' _ => "Detail_Set_Inst' xxx" neuper@37906: neuper@37906: | Derive' rls => "Derive' "^id_rls rls neuper@37906: | Calculate' _ => "Calculate' " neuper@37906: | Substitute' subs => "Substitute' "(*^(subs2str subs)*) neuper@37906: | Apply_Assumption' ct's => "Apply_Assumption' "(*^(strs2str ct's)*) neuper@37906: neuper@37906: | Take' cterm' => "Take' "(*^(quote cterm' )*) neuper@37906: | Take_Inst' cterm' => "Take_Inst' "(*^(quote cterm' )*) neuper@37906: | Group' (con, ints, _) => neuper@37906: "Group' "^(pair2str (con2str con, ints2str ints)) neuper@37906: | Subproblem' (spec, oris, _,_,pbl_form) => neuper@37906: "Subproblem' "(*^(pair2str (domID, strs2str ,...))*) neuper@37906: | End_Subproblem' _ => "End_Subproblem'" neuper@37906: | CAScmd' cterm' => "CAScmd' "(*^(quote cterm')*) neuper@37906: neuper@37906: | Empty_Tac_ => "Empty_Tac_" neuper@37906: | User' => "User'" neuper@37906: | Tac_ (_,form,id,result) => "Tac_ (thy,"^form^","^id^","^result^")" neuper@37906: | _ => "tac_2str not impl. for arg"; neuper@37906: neuper@37906: (*'executed tactics' (tac_s) with local environment etc.; neuper@37906: used for continuing eval script + for generate*) neuper@37906: type ets = neuper@37906: (loc_ * (* of tactic in scr, tactic (weakly) associated with tac_*) neuper@37906: (tac_ * (* (for generate) *) neuper@37906: env * (* with 'tactic=result' as a rule, tactic ev. _not_ ready: neuper@37906: for handling 'parallel let'*) neuper@37906: env * (* with results of (ready) tacs *) neuper@37906: term * (* itr_arg of tactic, for upd. env at Repeat, Try*) neuper@37906: term * (* result value of the tac *) neuper@37906: safe)) neuper@37906: list; neuper@37906: val Ets = []:ets; neuper@37906: neuper@37906: neuper@37906: fun ets2s (l,(m,eno,env,iar,res,s)) = neuper@37906: "\n("^(loc_2str l)^",("^(tac_2str m)^ neuper@37906: ",\n ens= "^(subst2str eno)^ neuper@37906: ",\n env= "^(subst2str env)^ neuper@37929: ",\n iar= "^(Syntax.string_of_term (thy2ctxt' "Isac") iar)^ neuper@37929: ",\n res= "^(Syntax.string_of_term (thy2ctxt' "Isac") res)^ neuper@37906: ",\n "^(safe2str s)^"))"; neuper@37906: fun ets2str (ets:ets) = (strs2str o (map ets2s)) ets; neuper@37906: neuper@37906: neuper@37906: type envp =(*9.5.03: unused, delete with field in ptree.PblObj FIXXXME*) neuper@37906: (int * term list) list * (*assoc-list: args of met*) neuper@37906: (int * rls) list * (*assoc-list: tacs already done ///15.9.00*) neuper@37906: (int * ets) list * (*assoc-list: tacs etc. already done*) neuper@37906: (string * pos) list; (*asms * from where*) neuper@37906: val empty_envp = ([],[],[],[]):envp; neuper@37906: neuper@37906: datatype ppobj = neuper@37906: PrfObj of {cell : lrd option, (*where in form tac has been applied*) neuper@37906: (*^^^FIXME.WN0607 rename this field*) neuper@37906: form : term, neuper@37906: tac : tac, (* also in istate*) neuper@37906: loc : istate option * istate option, (*for form, result neuper@37925: 13.8.02: (NONE,NONE) <==> e_istate ! see update_loc, get_loc*) neuper@37906: branch: branch, neuper@37906: result: term * term list, neuper@37906: ostate: ostate} (*Complete <=> result is OK*) neuper@37906: | PblObj of {cell : lrd option,(*unused: meaningful only for some _Prf_Obj*) neuper@37906: fmz : fmz, (*from init:FIXME never use this spec;-drop*) neuper@37906: origin: (ori list) * (*representation from fmz+pbt neuper@37906: for efficiently adding items in probl, meth*) neuper@37906: spec * (*updated by Refine_Tacitly*) neuper@37906: term, (*headline of calc-head, as calculated neuper@37906: initially(!)*) neuper@37906: (*# the origin of a root-pbl is created from fmz neuper@37906: (thus providing help for input to the user), neuper@37906: # the origin of a sub-pbl is created from the argument neuper@37906: -list of a script-tac 'SubProblem (spec) [arg-list]' neuper@37906: by 'match_ags'*) neuper@37906: spec : spec, (*explicitly input*) neuper@37906: probl : itm list, (*itms explicitly input*) neuper@37906: meth : itm list, (*itms automatically added to copy of probl neuper@37906: TODO: input like to 'probl'*) neuper@37906: env : istate option,(*for problem with initac in script*) neuper@37906: loc : istate option * istate option, (*for pbl+met * result*) neuper@37906: branch: branch, neuper@37906: result: term * term list, neuper@37906: ostate: ostate}; (*Complete <=> result is _proven_ OK*) neuper@37906: neuper@37906: (*.this tree contains isac's calculations; TODO.WN03 rename to ctree; neuper@37906: the structure has been copied from an early version of Theorema(c); neuper@37906: it has the disadvantage, that there is no space neuper@37906: for the first tactic in a script generating the first formula at (p,Frm); neuper@37906: this trouble has been covered by 'init_form' and 'Take' so far, neuper@37906: but it is crucial if the first tactic in a script is eg. 'Subproblem'; neuper@37906: see 'type tac ', Apply_Method. neuper@37906: .*) neuper@37906: datatype ptree = neuper@37906: EmptyPtree neuper@37906: | Nd of ppobj * (ptree list); neuper@37906: val e_ptree = EmptyPtree; neuper@37906: neuper@37906: fun rep_prfobj (PrfObj {cell,form,tac,loc,branch,result,ostate}) = neuper@37906: {cell=cell,form=form,tac=tac,loc=loc,branch=branch,result=result,ostate=ostate}; neuper@37906: fun rep_pblobj (PblObj {cell,origin,fmz,spec,probl,meth,env, neuper@37906: loc,branch,result,ostate}) = neuper@37906: {cell=cell,origin=origin,fmz=fmz,spec=spec,probl=probl,meth=meth, neuper@37906: env=env,loc=loc,branch=branch,result=result,ostate=ostate}; neuper@37906: fun is_prfobj (PrfObj _) = true neuper@37906: | is_prfobj _ =false; neuper@37906: (*val is_prfobj' = get_obj is_prfobj; *) neuper@37906: fun is_pblobj (PblObj _) = true neuper@37906: | is_pblobj _ = false; neuper@37906: (*val is_pblobj' = get_obj is_pblobj; 'Error: unbound constructor get_obj'*) neuper@37906: neuper@37906: neuper@37906: exception PTREE of string; neuper@37906: fun nth _ [] = raise PTREE "nth _ []" neuper@37906: | nth 1 (x::xs) = x neuper@37906: | nth n (x::xs) = nth (n-1) xs; neuper@37906: (*> nth 2 [11,22,33]; -->> val it = 22 : int*) neuper@37906: neuper@37906: fun lev_up ([]:pos) = raise PTREE "lev_up []" neuper@37906: | lev_up p = (drop_last p):pos; neuper@37906: fun lev_on ([]:pos) = raise PTREE "lev_on []" neuper@37906: | lev_on pos = neuper@37906: let val len = length pos neuper@37906: in (drop_last pos) @ [(nth len pos)+1] end; neuper@37906: fun lev_onFrm ((p,_):pos') = (lev_on p,Frm):pos' neuper@37906: | lev_onFrm p = raise PTREE ("*** lev_onFrm: pos'="^(pos'2str p)); neuper@37906: (*040216: for inform --> embed_deriv: remains on same level*) neuper@37906: fun lev_back (([],_):pos') = raise PTREE "lev_on_back: called by ([],_)" neuper@37906: | lev_back (p,_) = neuper@37906: if last_elem p <= 1 then (p, Frm):pos' neuper@37906: else ((drop_last p) @ [(nth (length p) p) - 1], Res); neuper@37906: (*.increase pos by n within a level.*) neuper@37906: fun pos_plus 0 pos = pos neuper@37906: | pos_plus n ((p,Frm):pos') = pos_plus (n-1) (p, Res) neuper@37906: | pos_plus n ((p, _):pos') = pos_plus (n-1) (lev_on p, Res); neuper@37906: neuper@37906: neuper@37906: neuper@37906: fun lev_pred ([]:pos) = raise PTREE "lev_pred []" neuper@37906: | lev_pred (pos:pos) = neuper@37906: let val len = length pos neuper@37906: in ((drop_last pos) @ [(nth len pos)-1]):pos end; neuper@37906: (*lev_pred [1,2,3]; neuper@37906: val it = [1,2,2] : pos neuper@37906: > lev_pred [1]; neuper@37906: val it = [0] : pos *) neuper@37906: neuper@37906: fun lev_dn p = p @ [0]; neuper@37906: (*> (lev_dn o lev_on) [1,2,3]; neuper@37906: val it = [1,2,4,0] : pos *) neuper@37906: (*fun lev_dn' ((p,p_):pos') = (lev_dn p, Frm):pos'; WN.3.12.03: never used*) neuper@37906: fun lev_dnRes ((p,_):pos') = (lev_dn p, Res):pos'; neuper@37906: neuper@37906: (*4.4.00*) neuper@37906: fun lev_up_ ((p,Res):pos') = (lev_up p,Res):pos' neuper@38031: | lev_up_ p' = error ("lev_up_: called for "^(pos'2str p')); neuper@37906: fun lev_dn_ ((p,_):pos') = (lev_dn p,Res):pos' neuper@37906: fun ind ((p,_):pos') = length p; (*WN050108 deprecated in favour of lev_of*) neuper@37906: fun lev_of ((p,_):pos') = length p; neuper@37906: neuper@37906: neuper@37906: (** convert ptree to a string **) neuper@37906: neuper@37906: (* convert a pos from list to string *) neuper@37906: fun pr_pos ps = (space_implode "." (map string_of_int ps))^". "; neuper@37906: (* show hd origin or form only *) neuper@37906: fun pr_short (p:pos) (PblObj {origin = (ori,_,_),...}) = neuper@37906: ((pr_pos p) ^ " ----- pblobj -----\n") neuper@37929: (* ((((Syntax.string_of_term (thy2ctxt' "Isac")) o #4 o hd) ori)^" "^ neuper@37929: (((Syntax.string_of_term (thy2ctxt' "Isac")) o hd(*!?!*) o #5 o hd) ori))^ neuper@37906: "\n") *) neuper@37906: | pr_short p (PrfObj {form = form,...}) = neuper@37906: ((pr_pos p) ^ (term2str form) ^ "\n"); neuper@37906: (* neuper@37906: fun pr_cell (p:pos) (PblObj {cell = c, origin = (ori,_,_),...}) = neuper@37906: ((ints2str c) ^" "^ neuper@37929: ((((Syntax.string_of_term (thy2ctxt' "Isac")) o #4 o hd) ori)^" "^ neuper@37929: (((Syntax.string_of_term (thy2ctxt' "Isac")) o hd(*!?!*) o #5 o hd) ori))^ neuper@37906: "\n") neuper@37906: | pr_cell p (PrfObj {cell = c, form = form,...}) = neuper@37906: ((ints2str c) ^" "^ (term2str form) ^ "\n"); neuper@37906: *) neuper@37906: neuper@37906: (* convert ptree *) neuper@37906: fun pr_ptree f pt = neuper@37906: let neuper@37906: fun pr_pt pfn _ EmptyPtree = "" neuper@37906: | pr_pt pfn ps (Nd (b, [])) = pfn ps b neuper@37906: | pr_pt pfn ps (Nd (b, ts)) = (pfn ps b)^ neuper@37906: (prts pfn (ps:pos) 1 ts) neuper@37906: and prts pfn ps p [] = "" neuper@37906: | prts pfn ps p (t::ts) = (pr_pt pfn (ps @ [p]) t)^ neuper@37906: (prts pfn ps (p+1) ts) neuper@37906: in pr_pt f [] pt end; neuper@37906: (* neuper@37906: > fun prfn ps b = (pr_pos ps)^" "^b(*TODO*)^"\n"; neuper@38006: > val pt = Unsynchronized.ref EmptyPtree; neuper@37986: > pt:=Nd("root'", neuper@37906: [Nd("xx1",[]), neuper@37906: Nd("xx2", neuper@37906: [Nd("xx2.1.",[]), neuper@37906: Nd("xx2.2.",[])]), neuper@37906: Nd("xx3",[])]); neuper@38015: > tracing (pr_ptree prfn (!pt)); neuper@37906: *) neuper@37906: neuper@37906: neuper@37906: (** access the branches of ptree **) neuper@37906: neuper@37906: fun ins_nth 1 e l = e::l neuper@37906: | ins_nth n e [] = raise PTREE "ins_nth n e []" neuper@37906: | ins_nth n e (l::ls) = l::(ins_nth (n-1) e ls); neuper@37906: fun repl [] _ _ = raise PTREE "repl [] _ _" neuper@37906: | repl (l::ls) 1 e = e::ls neuper@37906: | repl (l::ls) n e = l::(repl ls (n-1) e); neuper@37906: fun repl_app ls n e = neuper@37906: let val lim = 1 + length ls neuper@37906: in if n > lim then raise PTREE "repl_app: n > lim" neuper@37906: else if n = lim then ls @ [e] neuper@37906: else repl ls n e end; neuper@37906: (* neuper@37906: > repl [1,2,3] 2 22222; neuper@37906: val it = [1,22222,3] : int list neuper@37906: > repl_app [1,2,3,4] 5 5555; neuper@37906: val it = [1,2,3,4,5555] : int list neuper@37906: > repl_app [1,2,3] 2 22222; neuper@37906: val it = [1,22222,3] : int list neuper@37906: > repl_app [1] 2 22222 ; neuper@37906: val it = [1,22222] : int list neuper@37906: *) neuper@37906: neuper@37906: neuper@37906: (*.get from obj at pos by f : ppobj -> 'a.*) neuper@37906: fun get_obj f EmptyPtree (_:pos) = raise PTREE "get_obj f EmptyPtree" neuper@37906: | get_obj f (Nd (b, _)) [] = f b neuper@37906: | get_obj f (Nd (b, bs)) (p::ps) = neuper@37906: (* val (f, Nd (b, bs), (p::ps)) = (I, pt, p); neuper@37906: *) neuper@37906: let val _ = (nth p bs) handle _ => raise PTREE ("get_obj: pos = "^ neuper@37906: (ints2str' (p::ps))^" does not exist"); neuper@37906: in (get_obj f (nth p bs) (ps:pos)) neuper@37906: (*before WN050419: 'wrong type..' raised also if pos doesn't exist*) neuper@37906: handle _ => raise PTREE (*"get_obj: at pos = "^ neuper@37906: (ints2str' (p::ps))^" wrong type of ppobj"*) neuper@37906: ("get_obj: pos = "^ neuper@37906: (ints2str' (p::ps))^" does not exist") neuper@37906: end; neuper@37906: fun get_nd EmptyPtree _ = raise PTREE "get_nd EmptyPtree" neuper@37906: | get_nd n [] = n neuper@37906: | get_nd (Nd (_,nds)) (pos as p::(ps:pos)) = (get_nd (nth p nds) ps) neuper@37906: handle _ => raise PTREE ("get_nd: not existent pos = "^(ints2str' pos)); neuper@37906: neuper@37906: neuper@37906: (* for use by get_obj *) neuper@37925: fun g_cell (PblObj {cell = c,...}) = NONE neuper@37906: | g_cell (PrfObj {cell = c,...}) = c;(*WN0607 hack for quick introduction of lrd + rewrite-at (thms, calcs)*) neuper@37906: fun g_form (PrfObj {form = f,...}) = f neuper@37906: | g_form (PblObj {origin=(_,_,f),...}) = f; neuper@37906: fun g_form' (Nd (PrfObj {form = f,...}, _)) = f neuper@37906: | g_form' (Nd (PblObj {origin=(_,_,f),...}, _)) = f; neuper@37906: (* | g_form _ = raise PTREE "g_form not for PblObj";*) neuper@37906: fun g_origin (PblObj {origin = ori,...}) = ori neuper@37906: | g_origin _ = raise PTREE "g_origin not for PrfObj"; neuper@37906: fun g_fmz (PblObj {fmz = f,...}) = f neuper@37906: | g_fmz _ = raise PTREE "g_fmz not for PrfObj"; neuper@37906: fun g_spec (PblObj {spec = s,...}) = s neuper@37906: | g_spec _ = raise PTREE "g_spec not for PrfObj"; neuper@37906: fun g_pbl (PblObj {probl = p,...}) = p neuper@37906: | g_pbl _ = raise PTREE "g_pbl not for PrfObj"; neuper@37906: fun g_met (PblObj {meth = p,...}) = p neuper@37906: | g_met _ = raise PTREE "g_met not for PrfObj"; neuper@37906: fun g_domID (PblObj {spec = (d,_,_),...}) = d neuper@37906: | g_domID _ = raise PTREE "g_metID not for PrfObj"; neuper@37906: fun g_metID (PblObj {spec = (_,_,m),...}) = m neuper@37906: | g_metID _ = raise PTREE "g_metID not for PrfObj"; neuper@37906: fun g_env (PblObj {env,...}) = env neuper@37906: | g_env _ = raise PTREE "g_env not for PrfObj"; neuper@37906: fun g_loc (PblObj {loc = l,...}) = l neuper@37906: | g_loc (PrfObj {loc = l,...}) = l; neuper@37906: fun g_branch (PblObj {branch = b,...}) = b neuper@37906: | g_branch (PrfObj {branch = b,...}) = b; neuper@37906: fun g_tac (PblObj {spec = (d,p,m),...}) = Apply_Method m neuper@37906: | g_tac (PrfObj {tac = m,...}) = m; neuper@37906: fun g_result (PblObj {result = r,...}) = r neuper@37906: | g_result (PrfObj {result = r,...}) = r; neuper@37906: fun g_res (PblObj {result = (r,_),...}) = r neuper@37906: | g_res (PrfObj {result = (r,_),...}) = r; neuper@37906: fun g_res' (Nd (PblObj {result = (r,_),...}, _)) = r neuper@37906: | g_res' (Nd (PrfObj {result = (r,_),...}, _)) = r; neuper@37906: fun g_ostate (PblObj {ostate = r,...}) = r neuper@37906: | g_ostate (PrfObj {ostate = r,...}) = r; neuper@37906: fun g_ostate' (Nd (PblObj {ostate = r,...}, _)) = r neuper@37906: | g_ostate' (Nd (PrfObj {ostate = r,...}, _)) = r; neuper@37906: neuper@37925: fun gpt_cell (Nd (PblObj {cell = c,...},_)) = NONE neuper@37906: | gpt_cell (Nd (PrfObj {cell = c,...},_)) = c; neuper@37906: neuper@37906: (*in CalcTree/Subproblem an 'just_created_' model is created; neuper@37906: this is filled to 'untouched' by Model/Refine_Problem*) neuper@37906: fun just_created_ (PblObj {meth, probl, spec, ...}) = neuper@37906: null meth andalso null probl andalso spec = e_spec; neuper@37906: val e_origin = ([],e_spec,e_term): (ori list) * spec * term; neuper@37906: neuper@37906: fun just_created (pt,(p,_):pos') = neuper@37906: let val ppobj = get_obj I pt p neuper@37906: in is_pblobj ppobj andalso just_created_ ppobj end; neuper@37906: neuper@37906: (*.does the pos in the ctree exist ?.*) neuper@37906: fun existpt pos pt = can (get_obj I pt) pos; neuper@37906: (*.does the pos' in the ctree exist, ie. extra check for result in the node.*) neuper@37906: fun existpt' ((p,p_):pos') pt = neuper@37906: if can (get_obj I pt) p neuper@37906: then case p_ of neuper@37906: Res => get_obj g_ostate pt p = Complete neuper@37906: | _ => true neuper@37906: else false; neuper@37906: neuper@37906: (*.is this position appropriate for calculating intermediate steps?.*) neuper@37906: fun is_interpos ((_, Res):pos') = true neuper@37906: | is_interpos _ = false; neuper@37906: neuper@37906: fun last_onlev pt pos = not (existpt (lev_on pos) pt); neuper@37906: neuper@37906: neuper@37906: (*.find the position of the next parent which is a PblObj in ptree.*) neuper@37906: fun par_pblobj pt ([]:pos) = ([]:pos) neuper@37906: | par_pblobj pt p = neuper@37906: let fun par pt [] = [] neuper@37906: | par pt p = if is_pblobj (get_obj I pt p) then p neuper@37906: else par pt (lev_up p) neuper@37906: in par pt (lev_up p) end; neuper@37906: (* lev_up for hard_gen operating with pos = [...,0] *) neuper@37906: neuper@37906: (*.find the position and the children of the next parent which is a PblObj.*) neuper@37906: fun par_children (Nd (PblObj _, children)) ([]:pos) = (children, []:pos) neuper@37906: | par_children (pt as Nd (PblObj _, children)) p = neuper@37906: let fun par [] = (children, []) neuper@37906: | par p = let val Nd (obj, children) = get_nd pt p neuper@37906: in if is_pblobj obj then (children, p) else par (lev_up p) neuper@37906: end; neuper@37906: in par (lev_up p) end; neuper@37906: neuper@37906: (*.get the children of a node in ptree.*) neuper@37906: fun children (Nd (PblObj _, cn)) = cn neuper@37906: | children (Nd (PrfObj _, cn)) = cn; neuper@37906: neuper@37906: neuper@37906: (*.find the next parent, which is either a PblObj (return true) neuper@37906: or a PrfObj with tac = Detail_Set (return false).*) neuper@37906: (*FIXME.3.4.03:re-organize par_pbl_det after rls' --> rls*) neuper@37906: fun par_pbl_det pt ([]:pos) = (true, []:pos, Erls) neuper@37906: | par_pbl_det pt p = neuper@37906: let fun par pt [] = (true, [], Erls) neuper@37906: | par pt p = if is_pblobj (get_obj I pt p) then (true, p, Erls) neuper@37906: else case get_obj g_tac pt p of neuper@37906: (*Detail_Set rls' => (false, p, assoc_rls rls') neuper@37906: (*^^^--- before 040206 after ---vvv*) neuper@37906: |*)Rewrite_Set rls' => (false, p, assoc_rls rls') neuper@37906: | Rewrite_Set_Inst (_, rls') => neuper@37906: (false, p, assoc_rls rls') neuper@37906: | _ => par pt (lev_up p) neuper@37906: in par pt (lev_up p) end; neuper@37906: neuper@37906: neuper@37906: neuper@37906: neuper@37906: (*.get from the whole ptree by f : ppobj -> 'a.*) neuper@37906: fun get_all f EmptyPtree = [] neuper@37906: | get_all f (Nd (b, [])) = [f b] neuper@37906: | get_all f (Nd (b, bs)) = [f b] @ (get_alls f bs) neuper@37906: and get_alls f [] = [] neuper@37906: | get_alls f pts = flat (map (get_all f) pts); neuper@37906: neuper@37906: neuper@37906: (*.insert obj b into ptree at pos, ev.overwriting this pos.*) neuper@37906: fun insert b EmptyPtree ([]:pos) = Nd (b, []) neuper@37906: | insert b EmptyPtree _ = raise PTREE "insert b Empty _" neuper@37906: | insert b (Nd ( _, _)) [] = raise PTREE "insert b _ []" neuper@37906: | insert b (Nd (b', bs)) (p::[]) = neuper@37906: Nd (b', repl_app bs p (Nd (b,[]))) neuper@37906: | insert b (Nd (b', bs)) (p::ps) = neuper@37906: Nd (b', repl_app bs p (insert b (nth p bs) ps)); neuper@37906: (* neuper@37906: > type ppobj = string; neuper@38015: > tracing (pr_ptree prfn (!pt)); neuper@38006: val pt = Unsynchronized.ref Empty; neuper@37986: pt:= insert ("root'":ppobj) EmptyPtree []; neuper@37906: pt:= insert ("xx1":ppobj) (!pt) [1]; neuper@37906: pt:= insert ("xx2":ppobj) (!pt) [2]; neuper@37906: pt:= insert ("xx3":ppobj) (!pt) [3]; neuper@37906: pt:= insert ("xx2.1":ppobj) (!pt) [2,1]; neuper@37906: pt:= insert ("xx2.2":ppobj) (!pt) [2,2]; neuper@37906: pt:= insert ("xx2.1.1":ppobj) (!pt) [2,1,1]; neuper@37906: pt:= insert ("xx2.1.2":ppobj) (!pt) [2,1,2]; neuper@37906: pt:= insert ("xx2.1.3":ppobj) (!pt) [2,1,3]; neuper@37906: *) neuper@37906: neuper@37906: (*.insert children to a node without children.*) neuper@37906: (*compare: fun insert*) neuper@37906: fun ins_chn _ EmptyPtree (_:pos) = raise PTREE "ins_chn: EmptyPtree" neuper@37906: | ins_chn ns (Nd _) [] = raise PTREE "ins_chn: pos = []" neuper@37906: | ins_chn ns (Nd (b, bs)) (p::[]) = neuper@37906: if p > length bs then raise PTREE "ins_chn: pos not existent" neuper@37906: else let val Nd (b', bs') = nth p bs neuper@37906: in if null bs' then Nd (b, repl_app bs p (Nd (b', ns))) neuper@37906: else raise PTREE "ins_chn: pos mustNOT be overwritten" end neuper@37906: | ins_chn ns (Nd (b, bs)) (p::ps) = neuper@37906: Nd (b, repl_app bs p (ins_chn ns (nth p bs) ps)); neuper@37906: neuper@37906: (* print_depth 11;ins_chn;print_depth 3; ###insert#########################*); neuper@37906: neuper@37906: neuper@37906: (** apply f to obj at pos, f: ppobj -> ppobj **) neuper@37906: neuper@37906: fun appl_to_node f (Nd (b,bs)) = Nd (f b, bs); neuper@37906: fun appl_obj f EmptyPtree [] = EmptyPtree neuper@37906: | appl_obj f EmptyPtree _ = raise PTREE "appl_obj f Empty _" neuper@37906: | appl_obj f (Nd (b, bs)) [] = Nd (f b, bs) neuper@37906: | appl_obj f (Nd (b, bs)) (p::[]) = neuper@37906: Nd (b, repl_app bs p (((appl_to_node f) o (nth p)) bs)) neuper@37906: | appl_obj f (Nd (b, bs)) (p::ps) = neuper@37906: Nd (b, repl_app bs p (appl_obj f (nth p bs) (ps:pos))); neuper@37906: neuper@37906: (* for use by appl_obj *) neuper@37906: fun repl_form f (PrfObj {cell=c,form= _,tac=tac,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PrfObj {cell=c,form= f,tac=tac,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate} neuper@37906: | repl_form _ _ = raise PTREE "repl_form takes no PblObj"; neuper@37906: fun repl_pbl x (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=spec,probl=_,meth=meth,env=env,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj {cell=cell,origin=origin,fmz=fmz,spec=spec,probl= x, neuper@37906: meth=meth,env=env,loc=loc,branch=branch,result=result,ostate=ostate} neuper@37906: | repl_pbl _ _ = raise PTREE "repl_pbl takes no PrfObj"; neuper@37906: fun repl_met x (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=spec,probl=probl,meth=_,env=env,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj {cell=cell,origin=origin,fmz=fmz,spec=spec,probl=probl, neuper@37906: meth= x,env=env,loc=loc,branch=branch,result=result,ostate=ostate} neuper@37906: | repl_met _ _ = raise PTREE "repl_pbl takes no PrfObj"; neuper@37906: neuper@37906: fun repl_spec x (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec= _,probl=probl,meth=meth,env=env,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj {cell=cell,origin=origin,fmz=fmz,spec= x,probl=probl, neuper@37906: meth=meth,env=env,loc=loc,branch=branch,result=result,ostate=ostate} neuper@37906: | repl_spec _ _ = raise PTREE "repl_domID takes no PrfObj"; neuper@37906: fun repl_domID x (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=(_,p,m),probl=probl,meth=meth,env=env,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj {cell=cell,origin=origin,fmz=fmz,spec=(x,p,m),probl=probl, neuper@37906: meth=meth,env=env,loc=loc,branch=branch,result=result,ostate=ostate} neuper@37906: | repl_domID _ _ = raise PTREE "repl_domID takes no PrfObj"; neuper@37906: fun repl_pblID x (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=(d,_,m),probl=probl,meth=meth,env=env,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj {cell=cell,origin=origin,fmz=fmz,spec=(d,x,m),probl=probl, neuper@37906: meth=meth,env=env,loc=loc,branch=branch,result=result,ostate=ostate} neuper@37906: | repl_pblID _ _ = raise PTREE "repl_pblID takes no PrfObj"; neuper@37906: fun repl_metID x (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=(d,p,_),probl=probl,meth=meth,env=env,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj {cell=cell,origin=origin,fmz=fmz,spec=(d,p,x),probl=probl, neuper@37906: meth=meth,env=env,loc=loc,branch=branch,result=result,ostate=ostate} neuper@37906: | repl_metID _ _ = raise PTREE "repl_metID takes no PrfObj"; neuper@37906: neuper@37906: fun repl_result l f' s (PrfObj {cell=cell,form=form,tac=tac,loc=_, neuper@37906: branch=branch,result = _ ,ostate = _}) = neuper@37906: PrfObj {cell=cell,form=form,tac=tac,loc= l, neuper@37906: branch=branch,result = f',ostate = s} neuper@37906: | repl_result l f' s (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=spec,probl=probl,meth=meth,env=env,loc=_, neuper@37906: branch=branch,result= _ ,ostate= _}) = neuper@37906: PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=spec,probl=probl,meth=meth,env=env,loc= l, neuper@37906: branch=branch,result= f',ostate= s}; neuper@37906: neuper@37906: fun repl_tac x (PrfObj {cell=cell,form=form,tac= _,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PrfObj {cell=cell,form=form,tac= x,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate} neuper@37906: | repl_tac _ _ = raise PTREE "repl_tac takes no PblObj"; neuper@37906: neuper@37906: fun repl_branch b (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=spec,probl=probl,meth=meth,env=env,loc=loc, neuper@37906: branch= _,result=result,ostate=ostate}) = neuper@37906: PblObj {cell=cell,origin=origin,fmz=fmz,spec=spec,probl=probl, neuper@37906: meth=meth,env=env,loc=loc,branch= b,result=result,ostate=ostate} neuper@37906: | repl_branch b (PrfObj {cell=cell,form=form,tac=tac,loc=loc, neuper@37906: branch= _,result=result,ostate=ostate}) = neuper@37906: PrfObj {cell=cell,form=form,tac=tac,loc=loc, neuper@37906: branch= b,result=result,ostate=ostate}; neuper@37906: neuper@37906: fun repl_env e neuper@37906: (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=spec,probl=probl,meth=meth,env=_,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj {cell=cell,origin=origin,fmz=fmz,spec=spec,probl=probl, neuper@37906: meth=meth,env=e,loc=loc,branch=branch, neuper@37906: result=result,ostate=ostate} neuper@37906: | repl_env _ _ = raise PTREE "repl_ets takes no PrfObj"; neuper@37906: neuper@37906: fun repl_oris oris neuper@37906: (PblObj {cell=cell,origin=(_,spe,hdf),fmz=fmz, neuper@37906: spec=spec,probl=probl,meth=meth,env=env,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj{cell=cell,origin=(oris,spe,hdf),fmz=fmz,spec=spec,probl=probl, neuper@37906: meth=meth,env=env,loc=loc,branch=branch, neuper@37906: result=result,ostate=ostate} neuper@37906: | repl_oris _ _ = raise PTREE "repl_oris takes no PrfObj"; neuper@37906: fun repl_orispec spe neuper@37906: (PblObj {cell=cell,origin=(oris,_,hdf),fmz=fmz, neuper@37906: spec=spec,probl=probl,meth=meth,env=env,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj{cell=cell,origin=(oris,spe,hdf),fmz=fmz,spec=spec,probl=probl, neuper@37906: meth=meth,env=env,loc=loc,branch=branch, neuper@37906: result=result,ostate=ostate} neuper@37906: | repl_orispec _ _ = raise PTREE "repl_orispec takes no PrfObj"; neuper@37906: neuper@37906: fun repl_loc l (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=spec,probl=probl,meth=meth,env=env,loc=_, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj {cell=cell,origin=origin,fmz=fmz,spec=spec,probl=probl, neuper@37906: meth=meth,env=env,loc=l,branch=branch,result=result,ostate=ostate} neuper@37906: | repl_loc l (PrfObj {cell=cell,form=form,tac=tac,loc=_, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PrfObj {cell=cell,form=form,tac=tac,loc= l, neuper@37906: branch=branch,result=result,ostate=ostate}; neuper@37906: (* neuper@37906: fun uni__cid cell' neuper@37906: (PblObj {cell=cell,origin=origin,fmz=fmz, neuper@37906: spec=spec,probl=probl,meth=meth,env=env,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PblObj {cell=cell union cell',origin=origin,fmz=fmz,spec=spec,probl=probl, neuper@37906: meth=meth,env=env,loc=loc,branch=branch, neuper@37906: result=result,ostate=ostate} neuper@37906: | uni__cid cell' neuper@37906: (PrfObj {cell=cell,form=form,tac=tac,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}) = neuper@37906: PrfObj {cell=cell union cell',form=form,tac=tac,loc=loc, neuper@37906: branch=branch,result=result,ostate=ostate}; neuper@37906: *) neuper@37906: neuper@37906: (*WN050219 put here for interpreting code for cut_tree below...*) neuper@37906: type ocalhd = neuper@37906: bool * (*ALL itms+preconds true*) neuper@37906: pos_ * (*model belongs to Problem | Method*) neuper@37906: term * (*header: Problem... or Cas neuper@37906: FIXXXME.12.03: item! for marking syntaxerrors*) neuper@37906: itm list * (*model: given, find, relate*) neuper@37906: ((bool * term) list) *(*model: preconds*) neuper@37906: spec; (*specification*) neuper@37906: val e_ocalhd = (false, Und, e_term, [e_itm], [(false, e_term)], e_spec); neuper@37906: neuper@37906: datatype ptform = neuper@37906: Form of term neuper@37906: | ModSpec of ocalhd; neuper@37906: val e_ptform = Form e_term; neuper@37906: val e_ptform' = ModSpec e_ocalhd; neuper@37906: neuper@37906: neuper@37906: neuper@37906: (*.applies (snd f) to the branches at a pos if ((fst f) b), neuper@37906: f : (ppobj -> bool) * (int -> ptree list -> ptree list).*) neuper@37906: neuper@37906: fun appl_branch f EmptyPtree [] = (EmptyPtree, false) neuper@37906: | appl_branch f EmptyPtree _ = raise PTREE "appl_branch f Empty _" neuper@37906: | appl_branch f (Nd ( _, _)) [] = raise PTREE "appl_branch f _ []" neuper@37906: | appl_branch f (Nd (b, bs)) (p::[]) = neuper@37906: if (fst f) b then (Nd (b, (snd f) (p:posel) bs), true) neuper@37906: else (Nd (b, bs), false) neuper@37906: | appl_branch f (Nd (b, bs)) (p::ps) = neuper@37906: let val (b',bool) = appl_branch f (nth p bs) ps neuper@37906: in (Nd (b, repl_app bs p b'), bool) end; neuper@37906: neuper@37906: (* for cut_level; appl_branch(deprecated) *) neuper@37906: fun test_trans (PrfObj{branch = Transitive,...}) = true neuper@37906: | test_trans (PblObj{branch = Transitive,...}) = true neuper@37906: | test_trans _ = false; neuper@37906: neuper@37906: fun is_pblobj' pt (p:pos) = neuper@37906: let val ppobj = get_obj I pt p neuper@37906: in is_pblobj ppobj end; neuper@37906: neuper@37906: neuper@37906: fun delete_result pt (p:pos) = neuper@37925: (appl_obj (repl_result (fst (get_obj g_loc pt p), NONE) neuper@37906: (e_term,[]) Incomplete) pt p); neuper@37906: neuper@37906: fun del_res (PblObj {cell, fmz, origin, spec, probl, meth, neuper@37906: env, loc=(l1,_), branch, result, ostate}) = neuper@37906: PblObj {cell=cell,fmz=fmz,origin=origin,spec=spec,probl=probl,meth=meth, neuper@37925: env=env, loc=(l1,NONE), branch=branch, result=(e_term,[]), neuper@37906: ostate=Incomplete} neuper@37906: neuper@37906: | del_res (PrfObj {cell, form, tac, loc=(l1,_), branch, result, ostate}) = neuper@37925: PrfObj {cell=cell,form=form,tac=tac, loc=(l1,NONE), branch=branch, neuper@37906: result=(e_term,[]), ostate=Incomplete}; neuper@37906: neuper@37906: neuper@37906: (* neuper@37906: fun update_fmz pt pos x = appl_obj (repl_fmz x) pt pos; neuper@37906: 1.00 not used anymore*) neuper@37906: neuper@37906: (*FIXME.WN.12.03: update_X X pos pt -> pt could be chained by o (efficiency?)*) neuper@37906: fun update_env pt pos x = appl_obj (repl_env x) pt pos; neuper@37906: fun update_domID pt pos x = appl_obj (repl_domID x) pt pos; neuper@37906: fun update_pblID pt pos x = appl_obj (repl_pblID x) pt pos; neuper@37906: fun update_metID pt pos x = appl_obj (repl_metID x) pt pos; neuper@37906: fun update_spec pt pos x = appl_obj (repl_spec x) pt pos; neuper@37906: neuper@37906: fun update_pbl pt pos x = appl_obj (repl_pbl x) pt pos; neuper@37906: fun update_pblppc pt pos x = appl_obj (repl_pbl x) pt pos; neuper@37906: neuper@37906: fun update_met pt pos x = appl_obj (repl_met x) pt pos; neuper@37906: (*1.09.01 ---- neuper@37906: fun update_metppc pt pos x = neuper@37906: let val {rew_ord'=od,rls'=rs,asm_thm=at,asm_rls=ar,...} = neuper@37906: get_obj g_met pt pos neuper@37906: in appl_obj (repl_met neuper@37906: {rew_ord'=od,rls'=rs,asm_thm=at,asm_rls=ar,ppc=x}) neuper@37906: pt pos end;*) neuper@37906: fun update_metppc pt pos x = appl_obj (repl_met x) pt pos; neuper@37906: neuper@37906: (*fun union_cid pt pos x = appl_obj (uni__cid x) pt pos;*) neuper@37906: neuper@37906: fun update_branch pt pos x = appl_obj (repl_branch x) pt pos; neuper@37906: fun update_tac pt pos x = appl_obj (repl_tac x) pt pos; neuper@37906: neuper@37906: fun update_oris pt pos x = appl_obj (repl_oris x) pt pos; neuper@37906: fun update_orispec pt pos x = appl_obj (repl_orispec x) pt pos; neuper@37906: neuper@37906: (*done by append_* !! 3.5.02; ununsed WN050305 thus outcommented neuper@37925: fun update_loc pt (p,_) (ScrState ([],[],NONE, neuper@37906: Const ("empty",_),Sundef,false)) = neuper@37925: appl_obj (repl_loc (NONE,NONE)) pt p neuper@37906: | update_loc pt (p,Res) x = neuper@37906: let val (lform,_) = get_obj g_loc pt p neuper@37925: in appl_obj (repl_loc (lform,SOME x)) pt p end neuper@37906: neuper@37906: | update_loc pt (p,_) x = neuper@37906: let val (_,lres) = get_obj g_loc pt p neuper@37925: in appl_obj (repl_loc (SOME x,lres)) pt p end;-------------*) neuper@37906: neuper@37906: (*WN050305 for handling cut_tree in cappend_atomic -- TODO redesign !*) neuper@37906: fun update_loc' pt p iss = appl_obj (repl_loc iss) pt p; neuper@37906: neuper@37906: (*13.8.02--------------------------- neuper@37925: fun get_loc EmptyPtree _ = NONE neuper@37906: | get_loc pt (p,Res) = neuper@37906: let val (lfrm,lres) = get_obj g_loc pt p neuper@37906: in if lres = e_istate then lfrm else lres end neuper@37906: | get_loc pt (p,_) = neuper@37906: let val (lfrm,lres) = get_obj g_loc pt p neuper@37906: in if lfrm = e_istate then lres else lfrm end; 5.10.00: too liberal ?*) neuper@37906: (*13.8.02: options, because istate is no equalitype any more*) neuper@37906: fun get_loc EmptyPtree _ = e_istate neuper@37906: | get_loc pt (p,Res) = neuper@37906: (case get_obj g_loc pt p of neuper@37925: (SOME i, NONE) => i neuper@37925: | (NONE , NONE) => e_istate neuper@37925: | (_ , SOME i) => i) neuper@37906: | get_loc pt (p,_) = neuper@37906: (case get_obj g_loc pt p of neuper@37925: (NONE , SOME i) => i (*13.8.02 just copied from ^^^: too liberal ?*) neuper@37925: | (NONE , NONE) => e_istate neuper@37925: | (SOME i, _) => i); neuper@37906: val get_istate = get_loc; (*3.5.02*) neuper@37906: neuper@37906: (*.collect the assumptions within a problem up to a certain position.*) neuper@37906: type asms = (term * pos) list;(*WN0502 should be (pos' * term) list neuper@37906: ...........===^===*) neuper@37906: neuper@37906: fun get_asm (b:pos, p:pos) (Nd (PblObj {result=(_,asm),...},_)) = neuper@38015: ((*tracing ("### get_asm PblObj:(b,p)= "^ neuper@37906: (pair2str(ints2str b, ints2str p)));*) neuper@37906: (map (rpair b) asm):asms) neuper@37906: | get_asm (b, p) (Nd (PrfObj {result=(_,asm),...}, [])) = neuper@38015: ((*tracing ("### get_asm PrfObj []:(b,p)= "^ neuper@37906: (pair2str(ints2str b, ints2str p)));*) neuper@37906: (map (rpair b) asm)) neuper@37906: | get_asm (b, p:pos) (Nd (PrfObj _, nds)) = neuper@38015: let (*val _= tracing ("### get_asm PrfObj nds:(b,p)= "^ neuper@37906: (pair2str(ints2str b, ints2str p)));*) neuper@37906: val levdn = neuper@37906: if p <> [] then (b @ [hd p]:pos, tl p:pos) neuper@37906: else (b @ [1], [99999]) (*_deeper_ nesting is always _before_ p*) neuper@37906: in gets_asm levdn 1 nds end neuper@37906: and gets_asm _ _ [] = [] neuper@37906: | gets_asm (b, p' as p::ps) i (nd::nds) = neuper@37906: if p < i then [] neuper@38015: else ((*tracing ("### gets_asm: (b,p')= "^(pair2str(ints2str b, neuper@37906: ints2str p')));*) neuper@37906: (get_asm (b @ [i], ps) nd) @ (gets_asm (b, p') (i + 1) nds)); neuper@37906: neuper@37906: fun get_assumptions_ (Nd (PblObj {result=(r,asm),...}, cn)) (([], _):pos') = neuper@37906: if r = e_term then gets_asm ([], [99999]) 1 cn neuper@37906: else map (rpair []) asm neuper@37906: | get_assumptions_ pt (p,p_) = neuper@37906: let val (cn, base) = par_children pt p neuper@37906: val offset = drop (length base, p) neuper@37906: val base' = replicate (length base) 1 neuper@37906: val offset' = case p_ of neuper@37906: Frm => let val (qs,q) = split_last offset neuper@37906: in qs @ [q - 1] end neuper@37906: | _ => offset neuper@38015: (*val _= tracing ("... get_assumptions: (b,o)= "^ neuper@37906: (pair2str(ints2str base',ints2str offset)))*) neuper@37906: in gets_asm (base', offset) 1 cn end; neuper@37906: neuper@37906: neuper@37906: (*--------- neuper@37906: end neuper@37906: neuper@37906: open Ptree; neuper@37906: ----------*) neuper@37906: neuper@37906: (*pos of the formula on FE relative to the current pos, neuper@37906: which is the next writepos*) neuper@37906: fun pre_pos ([]:pos) = []:pos neuper@37906: | pre_pos pp = neuper@37906: let val (ps,p) = split_last pp neuper@37906: in case p of 1 => ps | n => ps @ [n-1] end; neuper@37906: neuper@37906: (*WN.20.5.03 ... but not used*) neuper@37906: fun posless [] (_::_) = true neuper@37906: | posless (_::_) [] = false neuper@37906: | posless (p::ps) (q::qs) = if p = q then posless ps qs else p < q; neuper@37906: (* posless [2,3,4] [3,4,5]; neuper@37906: true neuper@37906: > posless [2,3,4] [1,2,3]; neuper@37906: false neuper@37906: > posless [2,3] [2,3,4]; neuper@37906: true neuper@37906: > posless [2,3,4] [2,3]; neuper@37906: false neuper@37906: > posless [6] [6,5,2]; neuper@37906: true neuper@37906: +++ see Isabelle/../library.ML*) neuper@37906: neuper@37906: neuper@37906: (**.development for extracting an 'interval' from ptree.**) neuper@37906: neuper@37906: (*version 1 stopped 8.03 in favour of get_interval with !!!move_dn neuper@37906: actually used (inefficient) version with move_dn: see modspec.sml*) neuper@37906: local neuper@37906: neuper@37906: fun hdp [] = 1 | hdp [0] = 1 | hdp x = hd x;(*start with first*) neuper@37906: fun hdq [] = 99999 | hdq [0] = 99999 | hdq x = hd x;(*take until last*) neuper@37906: fun tlp [] = [0] | tlp [_] = [0] | tlp x = tl x; neuper@37906: fun tlq [] = [99999] | tlq [_] = [99999] | tlq x = tl x; neuper@37906: neuper@37906: fun getnd i (b,p) q (Nd (po, nds)) = neuper@37906: (if i <= 0 then [[b]] else []) @ neuper@37906: (getnds (i-1) true (b@[hdp p], tlp p) (tlq q) neuper@37906: (take_fromto (hdp p) (hdq q) nds)) neuper@37906: neuper@37906: and getnds _ _ _ _ [] = [] (*no children*) neuper@37906: | getnds i _ (b,p) q [nd] = (getnd i (b,p) q nd) (*l+r-margin*) neuper@37906: neuper@37906: | getnds i true (b,p) q [n1, n2] = (*l-margin, r-margin*) neuper@37906: (getnd i ( b, p ) [99999] n1) @ neuper@37906: (getnd ~99999 (lev_on b,[0]) q n2) neuper@37906: neuper@37906: | getnds i _ (b,p) q [n1, n2] = (*intern, r-margin*) neuper@37906: (getnd i ( b,[0]) [99999] n1) @ neuper@37906: (getnd ~99999 (lev_on b,[0]) q n2) neuper@37906: neuper@37906: | getnds i true (b,p) q (nd::(nds as _::_)) = (*l-margin, intern*) neuper@37906: (getnd i ( b, p ) [99999] nd) @ neuper@37906: (getnds ~99999 false (lev_on b,[0]) q nds) neuper@37906: neuper@37906: | getnds i _ (b,p) q (nd::(nds as _::_)) = (*intern, ...*) neuper@37906: (getnd i ( b,[0]) [99999] nd) @ neuper@37906: (getnds ~99999 false (lev_on b,[0]) q nds); neuper@37906: in neuper@37906: (*get an 'interval from to' from a ptree as 'intervals f t' of respective nodes neuper@37906: where 'from' are pos, i.e. a key as int list, 'f' an int (to,t analoguous) neuper@37906: (1) the 'f' are given neuper@37906: (1a) by 'from' if 'f' = the respective element of 'from' (left margin) neuper@37906: (1b) -inifinity, if 'f' > the respective element of 'from' (internal node) neuper@37906: (2) the 't' ar given neuper@37906: (2a) by 'to' if 't' = the respective element of 'to' (right margin) neuper@37906: (2b) inifinity, if 't' < the respective element of 'to (internal node)' neuper@37906: the 'f' and 't' are set by hdp,... *) neuper@37906: fun get_trace pt p q = neuper@37906: (flat o (getnds ((length p) -1) true ([hdp p], tlp p) (tlq q))) neuper@37906: (take_fromto (hdp p) (hdq q) (children pt)); neuper@37906: end; neuper@37906: (*WN0510 stoppde this development; neuper@37906: actually used (inefficient) version with move_dn: getFormulaeFromTo*) neuper@37906: neuper@37906: neuper@37906: neuper@37906: neuper@37906: fun get_somespec ((dI,pI,mI):spec) ((dI',pI',mI'):spec) = neuper@37906: let val domID = if dI = e_domID neuper@37906: then if dI' = e_domID neuper@38031: then error"pt_extract: no domID in probl,origin" neuper@37906: else dI' neuper@37906: else dI neuper@37906: val pblID = if pI = e_pblID neuper@37906: then if pI' = e_pblID neuper@38031: then error"pt_extract: no pblID in probl,origin" neuper@37906: else pI' neuper@37906: else pI neuper@37906: val metID = if mI = e_metID neuper@37906: then if pI' = e_metID neuper@38031: then error"pt_extract: no metID in probl,origin" neuper@37906: else mI' neuper@37906: else mI neuper@37906: in (domID, pblID, metID):spec end; neuper@37906: fun get_somespec' ((dI,pI,mI):spec) ((dI',pI',mI'):spec) = neuper@37906: let val domID = if dI = e_domID then dI' else dI neuper@37906: val pblID = if pI = e_pblID then pI' else pI neuper@37906: val metID = if mI = e_metID then mI' else mI neuper@37906: in (domID, pblID, metID):spec end; neuper@37906: neuper@37906: (*extract a formula or model from ptree for itms2itemppc or model2xml*) neuper@37906: fun preconds2str bts = neuper@37906: (strs2str o (map (linefeed o pair2str o neuper@37906: (apsnd term2str) o neuper@37906: (apfst bool2str)))) bts; neuper@37906: fun ocalhd2str ((b, p, hdf, itms, prec, spec):ocalhd) = neuper@37906: "("^bool2str b^", "^pos_2str p^", "^term2str hdf^ neuper@37928: ", "^itms2str_ (thy2ctxt' "Isac") itms^ neuper@37906: ", "^preconds2str prec^", \n"^spec2str spec^" )"; neuper@37906: neuper@37906: neuper@37906: neuper@37906: fun is_pblnd (Nd (ppobj, _)) = is_pblobj ppobj; neuper@37906: neuper@37906: neuper@37906: (**.functions for the 'ptree iterator' as seen from the FE-Kernel interface.**) neuper@37906: neuper@37906: (*move one step down into existing nodes of ptree; regard TransitiveB neuper@37906: ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~################## neuper@37906: fun move_dn _ (Nd (c, ns)) ([],p_) = (*root problem*) neuper@37906: (* val (Nd (c, ns), ([],p_)) = (pt, get_pos cI uI); neuper@37906: *) neuper@37906: if is_pblobj c neuper@37906: then case p_ of (*Frm => ([], Pbl) 1.12.03 neuper@37906: |*) Res => raise PTREE "move_dn: end of calculation" neuper@37906: | _ => if null ns (*go down from Pbl + Met*) neuper@37906: then raise PTREE "move_dn: solve problem not started" neuper@37906: else ([1], Frm) neuper@37906: else (case p_ of Res => raise PTREE "move_dn: end of (sub-)tree" neuper@37906: | _ => if null ns neuper@37906: then raise PTREE "move_dn: pos not existent 1" neuper@37906: else ([1], Frm)) neuper@37906: neuper@37906: (*iterate towards end of pos*) neuper@37906: (* val (P,(Nd (_, ns)),(p::(ps as (_::_)),p_)) = ([]:pos, pt, get_pos cI uI); neuper@37906: val (P,(Nd (_, ns)),(p::(ps as (_::_)),p_)) = ((P@[p]),(nth p ns),(ps, p_)); neuper@37906: *) neuper@37906: | move_dn P (Nd (_, ns)) (p::(ps as (_::_)),p_) = neuper@37906: if p > length ns then raise PTREE "move_dn: pos not existent 2" neuper@37906: else move_dn ((P@[p]): pos) (nth p ns) (ps, p_) neuper@37906: (* val (P, (Nd (c, ns)), ([p], p_)) = ((P@[p]), (nth p ns), (ps, p_)); neuper@37906: val (P, (Nd (c, ns)), ([p], p_)) = ([],pt,get_pos cI uI); neuper@37906: *) neuper@37906: | move_dn P (Nd (c, ns)) ([p], p_) = (*act on last element of pos*) neuper@37906: if p > length ns then raise PTREE "move_dn: pos not existent 3" neuper@37906: else if is_pblnd (nth p ns) then neuper@38015: ((*tracing("### move_dn: is_pblnd (nth p ns), P= "^ints2str' P^", \n"^ neuper@37906: "length ns= "^((string_of_int o length) ns)^ neuper@37906: ", p= "^string_of_int p^", p_= "^pos_2str p_);*) neuper@37906: case p_ of Res => if p = length ns neuper@37906: then if g_ostate c = Complete then (P, Res) neuper@37906: else raise PTREE (ints2str' P^" not complete") neuper@37906: (*FIXME here handle not-sequent-branches*) neuper@37906: else if g_branch c = TransitiveB neuper@37906: andalso (not o is_pblnd o (nth (p+1))) ns neuper@37906: then (P@[p+1], Res) neuper@37906: else (P@[p+1], if is_pblnd (nth (p+1) ns) neuper@37906: then Pbl else Frm) neuper@37906: | _ => if (null o children o (nth p)) ns (*go down from Pbl*) neuper@37906: then raise PTREE "move_dn: solve subproblem not started" neuper@37906: else (P @ [p, 1], neuper@37906: if (is_pblnd o hd o children o (nth p)) ns neuper@37906: then Pbl else Frm) neuper@37906: ) neuper@37906: (* val (P, Nd (c, ns), ([p], p_)) = ([], pt, ([1], Frm)); neuper@37906: *) neuper@37906: else case p_ of Frm => if (null o children o (nth p)) ns neuper@37906: (*then if g_ostate c = Complete then (P@[p],Res)*) neuper@37906: then if g_ostate' (nth p ns) = Complete neuper@37906: then (P@[p],Res) neuper@37906: else raise PTREE "move_dn: pos not existent 4" neuper@37906: else (P @ [p, 1], (*go down*) neuper@37906: if (is_pblnd o hd o children o (nth p)) ns neuper@37906: then Pbl else Frm) neuper@37906: | Res => if p = length ns neuper@37906: then neuper@37906: if g_ostate c = Complete then (P, Res) neuper@37906: else raise PTREE (ints2str' P^" not complete") neuper@37906: else neuper@37906: if g_branch c = TransitiveB neuper@37906: andalso (not o is_pblnd o (nth (p+1))) ns neuper@37906: then if (null o children o (nth (p+1))) ns neuper@37906: then (P@[p+1], Res) neuper@37906: else (P@[p+1,1], Frm)(*040221*) neuper@37906: else (P@[p+1], if is_pblnd (nth (p+1) ns) neuper@37906: then Pbl else Frm); neuper@37906: *) neuper@37906: (*.move one step down into existing nodes of ptree; skip Res = Frm.nxt; neuper@37906: move_dn at the end of the calc-tree raises PTREE.*) neuper@37906: fun move_dn _ (Nd (c, ns)) ([],p_) = (*root problem*) neuper@37906: (case p_ of neuper@37906: Res => raise PTREE "move_dn: end of calculation" neuper@37906: | _ => if null ns (*go down from Pbl + Met*) neuper@37906: then raise PTREE "move_dn: solve problem not started" neuper@37906: else ([1], Frm)) neuper@37906: | move_dn P (Nd (_, ns)) (p::(ps as (_::_)),p_) =(*iterate to end of pos*) neuper@37906: if p > length ns then raise PTREE "move_dn: pos not existent 2" neuper@37906: else move_dn ((P@[p]): pos) (nth p ns) (ps, p_) neuper@37906: neuper@37906: | move_dn P (Nd (c, ns)) ([p], p_) = (*act on last element of pos*) neuper@37906: if p > length ns then raise PTREE "move_dn: pos not existent 3" neuper@37906: else case p_ of neuper@37906: Res => neuper@37906: if p = length ns (*last Res on this level: go a level up*) neuper@37906: then if g_ostate c = Complete then (P, Res) neuper@37906: else raise PTREE (ints2str' P^" not complete 1") neuper@37906: else (*go to the next Nd on this level, or down into the next Nd*) neuper@37906: if is_pblnd (nth (p+1) ns) then (P@[p+1], Pbl) neuper@37906: else neuper@37906: if g_res' (nth p ns) = g_form' (nth (p+1) ns) neuper@37906: then if (null o children o (nth (p+1))) ns neuper@37906: then (*take the Res if Complete*) neuper@37906: if g_ostate' (nth (p+1) ns) = Complete neuper@37906: then (P@[p+1], Res) neuper@37906: else raise PTREE (ints2str' (P@[p+1])^ neuper@37906: " not complete 2") neuper@37906: else (P@[p+1,1], Frm)(*go down into the next PrfObj*) neuper@37906: else (P@[p+1], Frm)(*take Frm: exists if the Nd exists*) neuper@37906: | Frm => (*go down or to the Res of this Nd*) neuper@37906: if (null o children o (nth p)) ns neuper@37906: then if g_ostate' (nth p ns) = Complete then (P @ [p], Res) neuper@37906: else raise PTREE (ints2str' (P @ [p])^" not complete 3") neuper@37906: else (P @ [p, 1], Frm) neuper@37906: | _ => (*is Pbl or Met*) neuper@37906: if (null o children o (nth p)) ns neuper@37906: then raise PTREE "move_dn:solve subproblem not startd" neuper@37906: else (P @ [p, 1], neuper@37906: if (is_pblnd o hd o children o (nth p)) ns neuper@37906: then Pbl else Frm); neuper@37906: neuper@37906: neuper@37906: (*.go one level down into ptree.*) neuper@37906: fun movelevel_dn [] (Nd (c, ns)) ([],p_) = (*root problem*) neuper@37906: if is_pblobj c neuper@37906: then if null ns neuper@37906: then raise PTREE "solve problem not started" neuper@37906: else ([1], if (is_pblnd o hd) ns then Pbl else Frm) neuper@37906: else raise PTREE "pos not existent 1" neuper@37906: neuper@37906: (*iterate towards end of pos*) neuper@37906: | movelevel_dn P (Nd (_, ns)) (p::(ps as (_::_)),p_) = neuper@37906: if p > length ns then raise PTREE "pos not existent 2" neuper@37906: else movelevel_dn (P@[p]) (nth p ns) (ps, p_) neuper@37906: neuper@37906: | movelevel_dn P (Nd (c, ns)) ([p], p_) = (*act on last element of pos*) neuper@37906: if p > length ns then raise PTREE "pos not existent 3" else neuper@37906: case p_ of Res => neuper@37906: if p = length ns neuper@37906: then raise PTREE "no children" neuper@37906: else neuper@37906: if g_branch c = TransitiveB neuper@37906: then if (null o children o (nth (p+1))) ns neuper@37906: then raise PTREE "no children" neuper@37906: else (P @ [p+1, 1], neuper@37906: if (is_pblnd o hd o children o (nth (p+1))) ns neuper@37906: then Pbl else Frm) neuper@37906: else if (null o children o (nth p)) ns neuper@37906: then raise PTREE "no children" neuper@37906: else (P @ [p, 1], if (is_pblnd o hd o children o (nth p)) ns neuper@37906: then Pbl else Frm) neuper@37906: | _ => if (null o children o (nth p)) ns neuper@37906: then raise PTREE "no children" neuper@37906: else (P @ [p, 1], (*go down*) neuper@37906: if (is_pblnd o hd o children o (nth p)) ns neuper@37906: then Pbl else Frm); neuper@37906: neuper@37906: neuper@37906: neuper@37906: (*.go to the previous position in ptree; regard TransitiveB.*) neuper@37906: fun move_up _ (Nd (c, ns)) (([],p_):pos') = (*root problem*) neuper@37906: if is_pblobj c neuper@37906: then case p_ of Res => if null ns then ([], Pbl) (*Res -> Pbl (not Met)!*) neuper@37906: else ([length ns], Res) neuper@37906: | _ => raise PTREE "begin of calculation" neuper@37906: else raise PTREE "pos not existent" neuper@37906: neuper@37906: | move_up P (Nd (_, ns)) (p::(ps as (_::_)),p_) = (*iterate to end of pos*) neuper@37906: if p > length ns then raise PTREE "pos not existent" neuper@37906: else move_up (P@[p]) (nth p ns) (ps,p_) neuper@37906: neuper@37906: | move_up P (Nd (c, ns)) ([p], p_) = (*act on last element of pos*) neuper@37906: if p > length ns then raise PTREE "pos not existent" neuper@37906: else if is_pblnd (nth p ns) then neuper@37906: case p_ of Res => neuper@37906: let val nc = (length o children o (nth p)) ns neuper@37906: in if nc = 0 then (P@[p], Pbl) (*Res -> Pbl (not Met)!*) neuper@37906: else (P @ [p, nc], Res) end (*go down*) neuper@37906: | _ => if p = 1 then (P, Pbl) else (P@[p-1], Res) neuper@37906: else case p_ of Frm => if p <> 1 then (P, Frm) neuper@37906: else if is_pblobj c then (P, Pbl) else (P, Frm) neuper@37906: | Res => neuper@37906: let val nc = (length o children o (nth p)) ns neuper@37906: in if nc = 0 (*cannot go down*) neuper@37906: then if g_branch c = TransitiveB andalso p <> 1 neuper@37906: then (P@[p-1], Res) else (P@[p], Frm) neuper@37906: else (P @ [p, nc], Res) end; (*go down*) neuper@37906: neuper@37906: neuper@37906: neuper@37906: (*.go one level up in ptree; sets the position on Frm.*) neuper@37906: fun movelevel_up _ (Nd (c, ns)) (([],p_):pos') = (*root problem*) neuper@37906: raise PTREE "pos not existent" neuper@37906: neuper@37906: (*iterate towards end of pos*) neuper@37906: | movelevel_up P (Nd (_, ns)) (p::(ps as (_::_)),p_) = neuper@37906: if p > length ns then raise PTREE "pos not existent" neuper@37906: else movelevel_up (P@[p]) (nth p ns) (ps,p_) neuper@37906: neuper@37906: | movelevel_up P (Nd (c, ns)) ([p], p_) = (*act on last element of pos*) neuper@37906: if p > length ns then raise PTREE "pos not existent" neuper@37906: else if is_pblobj c then (P, Pbl) else (P, Frm); neuper@37906: neuper@37906: neuper@37906: (*.go to the next calc-head up in the calc-tree.*) neuper@37906: fun movecalchd_up pt ((p, Res):pos') = neuper@37906: (par_pblobj pt p, Pbl):pos' neuper@37906: | movecalchd_up pt (p, _) = neuper@37906: if is_pblobj (get_obj I pt p) neuper@37906: then (p, Pbl) else (par_pblobj pt p, Pbl); neuper@37906: neuper@37906: (*.determine the previous pos' on the same level.*) neuper@37906: (*WN0502 made for interSteps; _only_ works for branch TransitiveB*) neuper@37906: fun lev_pred' pt (pos:pos' as ([],Res)) = ([],Pbl):pos' neuper@37906: | lev_pred' pt (pos:pos' as (p, Res)) = neuper@37906: let val (p', last) = split_last p neuper@37906: in if last = 1 neuper@37906: then if (is_pblobj o (get_obj I pt)) p then (p,Pbl) else (p, Frm) neuper@37906: else if get_obj g_res pt (p' @ [last - 1]) = get_obj g_form pt p neuper@37906: then (p' @ [last - 1], Res) (*TransitiveB*) neuper@37906: else if (is_pblobj o (get_obj I pt)) p then (p,Pbl) else (p, Frm) neuper@37906: end; neuper@37906: neuper@37906: (*.determine the next pos' on the same level.*) neuper@37906: fun lev_on' pt (([],Pbl):pos') = ([],Res):pos' neuper@37906: | lev_on' pt (p, Res) = neuper@37906: if get_obj g_res pt p = get_obj g_form pt (lev_on p)(*TransitiveB*) neuper@37906: then if existpt' (lev_on p, Res) pt then (lev_on p, Res) neuper@38031: else error ("lev_on': (p, Res) -> (p, Res) not existent, \ neuper@37906: \p = "^ints2str' (lev_on p)) neuper@37906: else (lev_on p, Frm) neuper@37906: | lev_on' pt (p, _) = neuper@37906: if existpt' (p, Res) pt then (p, Res) neuper@38031: else error ("lev_on': (p, Frm) -> (p, Res) not existent, \ neuper@37906: \p = "^ints2str' p); neuper@37906: neuper@37906: fun exist_lev_on' pt p = (lev_on' pt p; true) handle _ => false; neuper@37906: neuper@37906: (*.is the pos' at the last element of a calulation _AND_ can be continued.*) neuper@37906: (* val (pt, pos as (p,p_)) = (pt, ([1],Frm)); neuper@37906: *) neuper@37906: fun is_curr_endof_calc pt (([],Res) : pos') = false neuper@37906: | is_curr_endof_calc pt (pos as (p,_)) = neuper@37906: not (exist_lev_on' pt pos) neuper@37906: andalso get_obj g_ostate pt (lev_up p) = Incomplete; neuper@37906: neuper@37906: neuper@37906: (**.insert into ctree and cut branches accordingly.**) neuper@37906: neuper@37906: (*.get all positions of certain intervals on the ctree.*) neuper@37906: (*OLD VERSION without move_dn; kept for occasional redesign neuper@37906: get all pos's to be cut in a ptree neuper@37906: below a pos or from a ptree list after i-th element (NO level_up).*) neuper@37906: fun get_allpos' (_:pos, _:posel) EmptyPtree = ([]:pos' list) neuper@37906: | get_allpos' (p, 1) (Nd (b, bs)) = (*p is pos of Nd*) neuper@37906: if g_ostate b = Incomplete neuper@38015: then ((*tracing("get_allpos' (p, 1) Incomplete: p="^ints2str' p);*) neuper@37906: [(p,Frm)] @ (get_allpos's (p, 1) bs) neuper@37906: ) neuper@38015: else ((*tracing("get_allpos' (p, 1) else: p="^ints2str' p);*) neuper@37906: [(p,Frm)] @ (get_allpos's (p, 1) bs) @ [(p,Res)] neuper@37906: ) neuper@37906: (*WN041020 here we assume what is presented on the worksheet ?!*) neuper@37906: | get_allpos' (p, i) (Nd (b, bs)) = (*p is pos of Nd*) neuper@37906: if length bs > 0 orelse is_pblobj b neuper@37906: then if g_ostate b = Incomplete neuper@37906: then [(p,Frm)] @ (get_allpos's (p, 1) bs) neuper@37906: else [(p,Frm)] @ (get_allpos's (p, 1) bs) @ [(p,Res)] neuper@37906: else neuper@37906: if g_ostate b = Incomplete neuper@37906: then [] neuper@37906: else [(p,Res)] neuper@37906: (*WN041020 here we assume what is presented on the worksheet ?!*) neuper@37906: and get_allpos's _ [] = [] neuper@37906: | get_allpos's (p, i) (pt::pts) = (*p is pos of parent-Nd*) neuper@37906: (get_allpos' (p@[i], i) pt) @ (get_allpos's (p, i+1) pts); neuper@37906: neuper@37906: (*.get all positions of certain intervals on the ctree.*) neuper@37906: (*NEW version WN050225*) neuper@37906: neuper@37906: neuper@37906: (*.cut branches.*) neuper@37906: (*before WN041019...... neuper@37906: val cut_branch = (test_trans, curry take): neuper@37906: (ppobj -> bool) * (int -> ptree list -> ptree list); neuper@37906: .. formlery used for ... neuper@37906: fun cut_tree''' _ [] = EmptyPtree neuper@37906: | cut_tree''' pt pos = neuper@37906: let val (pt',cut) = appl_branch cut_branch pt pos neuper@37906: in if cut andalso length pos > 1 then cut_tree''' pt' (lev_up pos) neuper@37906: else pt' end; neuper@37906: *) neuper@37906: (*OLD version before WN050225*) neuper@37906: (*WN050106 like cut_level, but deletes exactly 1 node --- for tests ONLY*) neuper@37906: fun cut_level_'_ (_:pos' list) (_:pos) EmptyPtree (_:pos') = neuper@37906: raise PTREE "cut_level_'_ Empty _" neuper@37906: | cut_level_'_ _ _ (Nd ( _, _)) ([],_) = raise PTREE "cut_level_'_ _ []" neuper@37906: | cut_level_'_ cuts P (Nd (b, bs)) (p::[],p_) = neuper@37906: if test_trans b neuper@37906: then (Nd (b, drop_nth [] (p:posel, bs)), neuper@37906: (* ~~~~~~~~~~~*) neuper@37906: cuts @ neuper@37906: (if p_ = Frm then [(P@[p],Res)] else ([]:pos' list)) @ neuper@37906: (*WN041020 here we assume what is presented on the worksheet ?!*) neuper@37906: (get_allpos's (P, p+1) (drop_nth [] (p, bs)))) neuper@37906: (* ~~~~~~~~~~~*) neuper@37906: else (Nd (b, bs), cuts) neuper@37906: | cut_level_'_ cuts P (Nd (b, bs)) ((p::ps),p_) = neuper@37906: let val (bs',cuts') = cut_level_'_ cuts P (nth p bs) (ps, p_) neuper@37906: in (Nd (b, repl_app bs p bs'), cuts @ cuts') end; neuper@37906: neuper@37906: (*before WN050219*) neuper@37906: fun cut_level (_:pos' list) (_:pos) EmptyPtree (_:pos') = neuper@37906: raise PTREE "cut_level EmptyPtree _" neuper@37906: | cut_level _ _ (Nd ( _, _)) ([],_) = raise PTREE "cut_level _ []" neuper@37906: neuper@37906: | cut_level cuts P (Nd (b, bs)) (p::[],p_) = neuper@37906: if test_trans b neuper@37906: then (Nd (b, take (p:posel, bs)), neuper@37906: cuts @ neuper@37906: (if p_ = Frm andalso (*#*) g_ostate b = Complete neuper@37906: then [(P@[p],Res)] else ([]:pos' list)) @ neuper@37906: (*WN041020 here we assume what is presented on the worksheet ?!*) neuper@37906: (get_allpos's (P, p+1) (takerest (p, bs)))) neuper@37906: else (Nd (b, bs), cuts) neuper@37906: neuper@37906: | cut_level cuts P (Nd (b, bs)) ((p::ps),p_) = neuper@37906: let val (bs',cuts') = cut_level cuts P (nth p bs) (ps, p_) neuper@37906: in (Nd (b, repl_app bs p bs'), cuts @ cuts') end; neuper@37906: neuper@37906: (*OLD version before WN050219, overwritten below*) neuper@37906: fun cut_tree _ (([],_):pos') = raise PTREE "cut_tree _ ([],_)" neuper@37906: | cut_tree pt (pos as ([p],_)) = neuper@37906: let val (pt', cuts) = cut_level ([]:pos' list) [] pt pos neuper@37906: in (pt', cuts @ (if get_obj g_ostate pt [] = Incomplete neuper@37906: then [] else [([],Res)])) end neuper@37906: | cut_tree pt (p,p_) = neuper@37906: let neuper@37906: fun cutfn pt cuts (p,p_) = neuper@37906: let val (pt', cuts') = cut_level [] (lev_up p) pt (p,p_) neuper@37906: val cuts'' = if get_obj g_ostate pt (lev_up p) = Incomplete neuper@37906: then [] else [(lev_up p, Res)] neuper@37906: in if length cuts' > 0 andalso length p > 1 neuper@37906: then cutfn pt' (cuts @ cuts') (lev_up p, Frm(*-->(p,Res)*)) neuper@37906: else (pt',cuts @ cuts') end neuper@37906: val (pt', cuts) = cutfn pt [] (p,p_) neuper@37906: in (pt', cuts @ (if get_obj g_ostate pt [] = Incomplete neuper@37906: then [] else [([], Res)])) end; neuper@37906: neuper@37906: neuper@37906: (*########/ inserted from ctreeNEW.sml \#################################**) neuper@37906: neuper@37906: (*.get all positions in a ptree until ([],Res) or ostate=Incomplete neuper@37906: val get_allp = fn : neuper@37906: pos' list -> : accumulated, start with [] neuper@37906: pos -> : the offset for subtrees wrt the root neuper@37906: ptree -> : (sub)tree neuper@37906: pos' : initialization (the last pos' before ...) neuper@37906: -> pos' list : of positions in this (sub) tree (relative to the root) neuper@37906: .*) neuper@37906: (* val (cuts, P, pt, pos) = ([], [3], get_nd pt [3], ([], Frm):pos'); neuper@37906: val (cuts, P, pt, pos) = ([], [2], get_nd pt [2], ([], Frm):pos'); neuper@37906: length (children pt); neuper@37906: *) neuper@37906: fun get_allp (cuts:pos' list) (P:pos, pos:pos') pt = neuper@37906: (let val nxt = move_dn [] pt pos (*exn if Incomplete reached*) neuper@37906: in if nxt <> ([],Res) neuper@37906: then get_allp (cuts @ [nxt]) (P, nxt) pt neuper@37906: else (map (apfst (curry op@ P)) (cuts @ [nxt])): pos' list neuper@37906: end) handle PTREE _ => (map (apfst (curry op@ P)) cuts); neuper@37906: neuper@37906: neuper@37906: (*the pts are assumed to be on the same level*) neuper@37906: fun get_allps (cuts: pos' list) (P:pos) [] = cuts neuper@37906: | get_allps cuts P (pt::pts) = neuper@37906: let val below = get_allp [] (P, ([], Frm)) pt neuper@37906: val levfrm = neuper@37906: if is_pblnd pt neuper@37906: then (P, Pbl)::below neuper@37906: else if last_elem P = 1 neuper@37906: then (P, Frm)::below neuper@37906: else (*Trans*) below neuper@37906: val levres = levfrm @ (if null below then [(P, Res)] else []) neuper@37906: in get_allps (cuts @ levres) (lev_on P) pts end; neuper@37906: neuper@37906: neuper@37906: (**.these 2 funs decide on how far cut_tree goes.**) neuper@37906: (*.shall the nodes _after_ the pos to be inserted at be deleted?.*) neuper@37906: fun test_trans (PrfObj{branch = Transitive,...}) = true neuper@37906: | test_trans (PrfObj{branch = NoBranch,...}) = true neuper@37906: | test_trans (PblObj{branch = Transitive,...}) = true neuper@37906: | test_trans (PblObj{branch = NoBranch,...}) = true neuper@37906: | test_trans _ = false; neuper@37906: (*.shall cutting be continued on the higher level(s)? neuper@37906: the Nd regarded will NOT be changed.*) neuper@37906: fun cutlevup (PblObj _) = false (*for tests of LK0502*) neuper@37906: | cutlevup _ = true; neuper@37906: val cutlevup = test_trans;(*WN060727 after summerterm tests.LK0502 withdrawn*) neuper@37906: neuper@37906: (*cut_bottom new sml603..608 neuper@37906: cut the level at the bottom of the pos (used by cappend_...) neuper@37906: and handle the parent in order to avoid extra case for root neuper@37906: fn: ptree -> : the _whole_ ptree for cut_levup neuper@37906: pos * posel -> : the pos after split_last neuper@37906: ptree -> : the parent of the Nd to be cut neuper@37906: return neuper@37906: (ptree * : the updated ptree neuper@37906: pos' list) * : the pos's cut neuper@37906: bool : cutting shall be continued on the higher level(s) neuper@37906: *) neuper@37906: fun cut_bottom _ (pt' as Nd (b, [])) = ((pt', []), cutlevup b) neuper@37906: | cut_bottom (P:pos, p:posel) (Nd (b, bs)) = neuper@37906: let (*divide level into 3 parts...*) neuper@37906: val keep = take (p - 1, bs) neuper@37906: val pt' as Nd (_,bs') = nth p bs neuper@37906: (*^^^^^_here_ will be 'insert'ed by 'append_..'*) neuper@37906: val (tail, tp) = (takerest (p, bs), neuper@37906: if null (takerest (p, bs)) then 0 else p + 1) neuper@37906: val (children, cuts) = neuper@37906: if test_trans b neuper@37906: then (keep, neuper@37906: (if is_pblnd pt' then [(P @ [p], Pbl)] else []) neuper@37906: @ (get_allp [] (P @ [p], (P, Frm)) pt') neuper@37906: @ (get_allps [] (P @ [p+1]) tail)) neuper@37906: else (keep @ [(*'insert'ed by 'append_..'*)] @ tail, neuper@37906: get_allp [] (P @ [p], (P, Frm)) pt') neuper@37906: val (pt'', cuts) = neuper@37906: if cutlevup b neuper@37906: then (Nd (del_res b, children), neuper@37906: cuts @ (if g_ostate b = Incomplete then [] else [(P,Res)])) neuper@37906: else (Nd (b, children), cuts) neuper@38015: (*val _= tracing("####cut_bottom (P, p)="^pos2str (P @ [p])^ neuper@37906: ", Nd=.............................................") neuper@37906: val _= show_pt pt'' neuper@38015: val _= tracing("####cut_bottom form='"^ neuper@37906: term2str (get_obj g_form pt'' [])) neuper@38015: val _= tracing("####cut_bottom cuts#="^string_of_int (length cuts)^ neuper@37906: ", cuts="^pos's2str cuts)*) neuper@37906: in ((pt'', cuts:pos' list), cutlevup b) end; neuper@37906: neuper@37906: neuper@37906: (*.go all levels from the bottom of 'pos' up to the root, neuper@37906: on each level compose the children of a node and accumulate the cut Nds neuper@37906: args neuper@37906: pos' list -> : for accumulation neuper@37906: bool -> : cutting shall be continued on the higher level(s) neuper@37906: ptree -> : the whole ptree for 'get_nd pt P' on each level neuper@37906: ptree -> : the Nd from the lower level for insertion at path neuper@37906: pos * posel -> : pos=path split for convenience neuper@37906: ptree -> : Nd the children of are under consideration on this call neuper@37906: returns : neuper@37906: ptree * pos' list : the updated parent-Nd and the pos's of the Nds cut neuper@37906: .*) neuper@37906: fun cut_levup (cuts:pos' list) clevup pt pt' (P:pos, p:posel) (Nd (b, bs)) = neuper@37906: let (*divide level into 3 parts...*) neuper@37906: val keep = take (p - 1, bs) neuper@37906: (*val pt' comes as argument from below*) neuper@37906: val (tail, tp) = (takerest (p, bs), neuper@37906: if null (takerest (p, bs)) then 0 else p + 1) neuper@37906: val (children, cuts') = neuper@37906: if clevup neuper@37906: then (keep @ [pt'], get_allps [] (P @ [p+1]) tail) neuper@37906: else (keep @ [pt'] @ tail, []) neuper@37906: val clevup' = if clevup then cutlevup b else false neuper@37906: (*the first Nd with false stops cutting on all levels above*) neuper@37906: val (pt'', cuts') = neuper@37906: if clevup' neuper@37906: then (Nd (del_res b, children), neuper@37906: cuts' @ (if g_ostate b = Incomplete then [] else [(P,Res)])) neuper@37906: else (Nd (b, children), cuts') neuper@38015: (*val _= tracing("#####cut_levup clevup= "^bool2str clevup) neuper@38015: val _= tracing("#####cut_levup cutlevup b= "^bool2str (cutlevup b)) neuper@38015: val _= tracing("#####cut_levup (P, p)="^pos2str (P @ [p])^ neuper@37906: ", Nd=.............................................") neuper@37906: val _= show_pt pt'' neuper@38015: val _= tracing("#####cut_levup form='"^ neuper@37906: term2str (get_obj g_form pt'' [])) neuper@38015: val _= tracing("#####cut_levup cuts#="^string_of_int (length cuts)^ neuper@37906: ", cuts="^pos's2str cuts)*) neuper@37906: in if null P then (pt'', (cuts @ cuts'):pos' list) neuper@37906: else let val (P, p) = split_last P neuper@37906: in cut_levup (cuts @ cuts') clevup' pt pt'' (P, p) (get_nd pt P) neuper@37906: end neuper@37906: end; neuper@37906: neuper@37906: (*.cut nodes after and below an inserted node in the ctree; neuper@37906: the cuts range is limited by the predicate 'fun cutlevup'.*) neuper@37906: fun cut_tree pt (pos,_) = neuper@37906: if not (existpt pos pt) neuper@37906: then (pt,[]) (*appending a formula never cuts anything*) neuper@37906: else let val (P, p) = split_last pos neuper@37906: val ((pt', cuts), clevup) = cut_bottom (P, p) (get_nd pt P) neuper@37906: (* pt' is the updated parent of the Nd to cappend_..*) neuper@37906: in if null P then (pt', cuts) neuper@37906: else let val (P, p) = split_last P neuper@37906: in cut_levup cuts clevup pt pt' (P, p) (get_nd pt P) neuper@37906: end neuper@37906: end; neuper@37906: neuper@37906: fun append_atomic p l f r f' s pt = neuper@38015: let (**val _= tracing("#@append_atomic: pos ="^pos2str p)**) neuper@37906: val (iss, f) = if existpt p pt andalso get_obj g_tac pt p=Empty_Tac neuper@37906: then (*after Take*) neuper@37925: ((fst (get_obj g_loc pt p), SOME l), neuper@37906: get_obj g_form pt p) neuper@37925: else ((NONE, SOME l), f) neuper@37925: in insert (PrfObj {cell = NONE, neuper@37906: form = f, neuper@37906: tac = r, neuper@37906: loc = iss, neuper@37906: branch= NoBranch, neuper@37906: result= f', neuper@37906: ostate= s}) pt p end; neuper@37906: neuper@37906: neuper@37906: (*20.8.02: cappend_* FIXXXXME cut branches below cannot be decided here: neuper@37906: detail - generate - cappend: inserted, not appended !!! neuper@37906: neuper@37906: cut decided in applicable_in !?! neuper@37906: *) neuper@37906: fun cappend_atomic pt p loc f r f' s = neuper@37906: (* val (pt, p, loc, f, r, f', s) = neuper@37906: (pt,p,l,f,Rewrite_Set_Inst (subst2subs subs',id_rls rls'), neuper@37906: (f',asm),Complete); neuper@37906: *) neuper@38015: ((*tracing("##@cappend_atomic: pos ="^pos2str p);*) neuper@37906: apfst (append_atomic p loc f r f' s) (cut_tree pt (p,Frm)) neuper@37906: ); neuper@37906: (*TODO.WN050305 redesign the handling of istates*) neuper@37906: fun cappend_atomic pt p ist_res f r f' s = neuper@37906: if existpt p pt andalso get_obj g_tac pt p=Empty_Tac neuper@37906: then (*after Take: transfer Frm and respective istate*) neuper@37906: let val (ist_form, f) = (get_loc pt (p,Frm), neuper@37906: get_obj g_form pt p) neuper@37906: val (pt, cs) = cut_tree pt (p,Frm) neuper@37906: val pt = append_atomic p e_istate f r f' s pt neuper@37925: val pt = update_loc' pt p (SOME ist_form, SOME ist_res) neuper@37906: in (pt, cs) end neuper@37906: else apfst (append_atomic p ist_res f r f' s) (cut_tree pt (p,Frm)); neuper@37906: neuper@37906: neuper@37906: (* called by Take *) neuper@37906: fun append_form p l f pt = neuper@38015: ((*tracing("##@append_form: pos ="^pos2str p);*) neuper@37925: insert (PrfObj {cell = NONE, neuper@37906: form = (*if existpt p pt neuper@37906: andalso get_obj g_tac pt p = Empty_Tac neuper@37906: (*distinction from 'old' (+complete!) pobjs*) neuper@37906: then get_obj g_form pt p else*) f, neuper@37906: tac = Empty_Tac, neuper@37925: loc = (SOME l, NONE), neuper@37906: branch= NoBranch, neuper@37906: result= (e_term,[]), neuper@37906: ostate= Incomplete}) pt p neuper@37906: ); neuper@37906: (* val (p,loc,f) = ([1], e_istate, str2term "x + 1 = 2"); neuper@37906: val (p,loc,f) = (fst p, e_istate, str2term "-1 + x = 0"); neuper@37906: *) neuper@37906: fun cappend_form pt p loc f = neuper@38015: ((*tracing("##@cappend_form: pos ="^pos2str p);*) neuper@37906: apfst (append_form p loc f) (cut_tree pt (p,Frm)) neuper@37906: ); neuper@37906: fun cappend_form pt p loc f = neuper@38015: let (*val _= tracing("##@cappend_form: pos ="^pos2str p) neuper@38015: val _= tracing("##@cappend_form before cut_tree: loc ="^istate2str loc)*) neuper@37906: val (pt', cs) = cut_tree pt (p,Frm) neuper@37906: val pt'' = append_form p loc f pt' neuper@38015: (*val _= tracing("##@cappend_form after append: loc ="^ neuper@37906: istates2str (get_obj g_loc pt'' p))*) neuper@37906: in (pt'', cs) end; neuper@37906: neuper@37906: neuper@37906: neuper@37906: fun append_result pt p l f s = neuper@38015: ((*tracing("##@append_result: pos ="^pos2str p);*) neuper@37906: (appl_obj (repl_result (fst (get_obj g_loc pt p), neuper@37925: SOME l) f s) pt p, []) neuper@37906: ); neuper@37906: neuper@37906: neuper@37906: (*WN041022 deprecated, still for kbtest/diffapp.sml, /systest/root-equ.sml*) neuper@37906: fun append_parent p l f r b pt = neuper@38015: let (*val _= tracing("###append_parent: pos ="^pos2str p);*) neuper@37906: val (ll,f) = if existpt p pt andalso get_obj g_tac pt p=Empty_Tac neuper@37925: then ((fst (get_obj g_loc pt p), SOME l), neuper@37906: get_obj g_form pt p) neuper@37925: else ((SOME l, NONE), f) neuper@37906: in insert (PrfObj neuper@37925: {cell = NONE, neuper@37906: form = f, neuper@37906: tac = r, neuper@37906: loc = ll, neuper@37906: branch= b, neuper@37906: result= (e_term,[]), neuper@37906: ostate= Incomplete}) pt p end; neuper@37906: fun cappend_parent pt p loc f r b = neuper@38015: ((*tracing("###cappend_parent: pos ="^pos2str p);*) neuper@37906: apfst (append_parent p loc f r b) (cut_tree pt (p,Und)) neuper@37906: ); neuper@37906: neuper@37906: neuper@37906: fun append_problem [] l fmz (strs,spec,hdf) _ = neuper@38015: ((*tracing("###append_problem: pos = []");*) neuper@37906: (Nd (PblObj neuper@37925: {cell = NONE, neuper@37906: origin= (strs,spec,hdf), neuper@37906: fmz = fmz, neuper@37906: spec = empty_spec, neuper@37906: probl = []:itm list, neuper@37906: meth = []:itm list, neuper@37925: env = NONE, neuper@37925: loc = (SOME l, NONE), neuper@37906: branch= TransitiveB,(*FIXXXXXME.27.8.03: for equations only*) neuper@37906: result= (e_term,[]), neuper@37906: ostate= Incomplete},[])) neuper@37906: ) neuper@37906: | append_problem p l fmz (strs,spec,hdf) pt = neuper@38015: ((*tracing("###append_problem: pos ="^pos2str p);*) neuper@37906: insert (PblObj neuper@37925: {cell = NONE, neuper@37906: origin= (strs,spec,hdf), neuper@37906: fmz = fmz, neuper@37906: spec = empty_spec, neuper@37906: probl = []:itm list, neuper@37906: meth = []:itm list, neuper@37925: env = NONE, neuper@37925: loc = (SOME l, NONE), neuper@37906: branch= TransitiveB, neuper@37906: result= (e_term,[]), neuper@37906: ostate= Incomplete}) pt p neuper@37906: ); neuper@37906: fun cappend_problem _ [] loc fmz ori = neuper@38015: ((*tracing("###cappend_problem: pos = []");*) neuper@37906: (append_problem [] loc fmz ori EmptyPtree,[]) neuper@37906: ) neuper@37906: | cappend_problem pt p loc fmz ori = neuper@38015: ((*tracing("###cappend_problem: pos ="^pos2str p);*) neuper@37906: apfst (append_problem p (loc:istate) fmz ori) (cut_tree pt (p,Frm)) neuper@37906: ); neuper@37906: neuper@37906: (*.get the theory explicitly specified for the rootpbl; neuper@37906: thus use this function _after_ finishing specification.*) neuper@37906: fun rootthy (Nd (PblObj {spec=(thyID, _, _),...}, _)) = assoc_thy thyID neuper@38031: | rootthy _ = error "rootthy"; neuper@37906: