wneuper/isa: src/Tools/isac/Interpret/script.sml@2556b7865f9b

     1 (* interpreter for scripts

     2    (c) Walther Neuper 2000

     4 use"ME/script.sml";

     5 use"script.sml";

     6 *)

     7 signature INTERPRETER =

     8 sig

     9   (*type ets (list of executed tactics) see sequent.sml*)

    11   datatype locate

    12     = NotLocatable

    13     | Steps of (tac_ * mout * ptree * pos' * cid * safe (* ets*)) list

    14 (*    | ToDo of ets 28.4.02*)

    16   (*diss: next-tactic-function*)

    17   val next_tac : theory' -> ptree * pos' -> metID -> scr -> ets -> tac_

    18   (*diss: locate-function*)

    19   val locate_gen : theory'

    20                    -> tac_

    21                       -> ptree * pos' -> scr * rls -> ets -> loc_ -> locate

    23   val sel_rules : ptree -> pos' -> tac list

    24   val init_form : scr -> ets -> loc_ * term option (*FIXME not up to date*)

    25   val formal_args : term -> term list

    27   (*shift to library ...*)

    28   val inst_abs : theory' -> term -> term

    29   val itms2args : metID -> itm list -> term list

    30   val user_interrupt : loc_ * (tac_ * env * env * term * term * safe)

    31   (*val empty : term*)

    32 end

    37 (*

    38 structure Interpreter : INTERPRETER =

    39 struct

    40 *)

    42 (*.traces the leaves (ie. non-tactical nodes) of the script

    43    found by next_tac.

    44    a leaf is either a tactic or an 'exp' in 'let v = expr'

    45    where 'exp' does not contain a tactic.*)

    46 val trace_script = Unsynchronized.ref false;

    48 type step =     (*data for creating a new node in the ptree;

    49 		 designed for use:

    50                	 fun ass* scrstate steps =

    51                	 ... case ass* scrstate steps of

    52                	     Assoc (scrstate, steps) => ... ass* scrstate steps*)

    53     tac_       (*transformed from associated tac*)

    54     * mout       (*result with indentation etc.*)

    55     * ptree      (*containing node created by tac_ + resp. scrstate*)

    56     * pos'       (*position in ptree; ptree * pos' is the proofstate*)

    57     * pos' list; (*of ptree-nodes probably cut (by fst tac_)*)

    58 val e_step = (Empty_Tac_, EmptyMout, EmptyPtree, e_pos',[]:pos' list):step;

    60 fun rule2thm' (Thm (id, thm)) = (id, string_of_thmI thm):thm'

    61   | rule2thm' r = error ("rule2thm': not defined for "^(rule2str r));

    62 fun rule2rls' (Rls_ rls) = id_rls rls

    63   | rule2rls' r = error ("rule2rls': not defined for "^(rule2str r));

    65 (*.makes a (rule,term) list to a Step (m, mout, pt', p', cid) for solve;

    66    complicated with current t in rrlsstate.*)

    67 fun rts2steps steps ((pt,p),(f,f'',rss,rts),(thy',ro,er,pa)) [(r, (f', am))] =

    68       let

    69         val thy = assoc_thy thy'

    70         val ctxt = get_ctxt pt p |> insert_assumptions am

    71 	      val m = Rewrite' (thy', ro, er, pa, rule2thm' r, f, (f', am))

    72 	      val is = RrlsState (f', f'', rss, rts)

    73 	      val p = case p of (p',Frm) => p | (p',Res) => (lev_on p',Res)

    74 	      val (p', cid, mout, pt') = generate1 thy m (is, ctxt) p pt

    75       in (is, (m, mout, pt', p', cid) :: steps) end

    76   | rts2steps steps ((pt,p),(f,f'',rss,rts),(thy',ro,er,pa)) ((r, (f', am))::rts') =

    77       let

    78         val thy = assoc_thy thy'

    79         val ctxt = get_ctxt pt p |> insert_assumptions am

    80 	      val m = Rewrite' (thy',ro,er,pa, rule2thm' r, f, (f', am))

    81 	      val is = RrlsState (f',f'',rss,rts)

    82 	      val p = case p of (p',Frm) => p | (p',Res) => (lev_on p',Res)

    83 	      val (p', cid, mout, pt') = generate1 thy m (is, ctxt) p pt

    84       in rts2steps ((m, mout, pt', p', cid)::steps)

    85 		    ((pt',p'),(f',f'',rss,rts),(thy',ro,er,pa)) rts' end;

    87 (*. functions for the environment stack .*)

    88 fun accessenv id es = the (assoc((top es):env, id))

    89     handle _ => error ("accessenv: "^(free2str id)^" not in env");

    90 fun updateenv id vl (es:env stack) =

    91     (push (overwrite(top es, (id, vl))) (pop es)):env stack;

    92 fun pushenv id vl (es:env stack) =

    93     (push (overwrite(top es, (id, vl))) es):env stack;

    94 val popenv = pop:env stack -> env stack;

    98 fun de_esc_underscore str =

    99   let fun scan [] = []

   100 	| scan (s::ss) = if s = "'" then (scan ss)

   101 			 else (s::(scan ss))

   102   in (implode o scan o Symbol.explode) str end;

   103 (*

   104 > val str = "Rewrite_Set_Inst";

   105 > val esc = esc_underscore str;

   106 val it = "Rewrite'_Set'_Inst" : string

   107 > val des = de_esc_underscore esc;

   108  val des = de_esc_underscore esc;*)

   110 (*go at a location in a script and fetch the contents*)

   111 fun go [] t = t

   112   | go (D::p) (Abs(s,ty,t0)) = go (p:loc_) t0

   113   | go (L::p) (t1 $ t2) = go p t1

   114   | go (R::p) (t1 $ t2) = go p t2

   115   | go l _ = error ("go: no "^(loc_2str l));

   116 (*

   117 > val t = (term_of o the o (parse thy)) "a+b";

   118 val it = Const (#,#) $ Free (#,#) $ Free ("b","RealDef.real") : term

   119 > val plus_a = go [L] t;

   120 > val b = go [R] t;

   121 > val plus = go [L,L] t;

   122 > val a = go [L,R] t;

   124 > val t = (term_of o the o (parse thy)) "a+b+c";

   125 val t = Const (#,#) $ (# $ # $ Free #) $ Free ("c","RealDef.real") : term

   126 > val pl_pl_a_b = go [L] t;

   127 > val c = go [R] t;

   128 > val a = go [L,R,L,R] t;

   129 > val b = go [L,R,R] t;

   130 *)

   133 (* get a subterm t with test t, and record location *)

   134 fun get l test (t as Const (s,T)) =

   135     if test t then SOME (l,t) else NONE

   136   | get l test (t as Free (s,T)) =

   137     if test t then SOME (l,t) else NONE

   138   | get l test (t as Bound n) =

   139     if test t then SOME (l,t) else NONE

   140   | get l test (t as Var (s,T)) =

   141     if test t then SOME (l,t) else NONE

   142   | get l test (t as Abs (s,T,body)) =

   143     if test t then SOME (l:loc_,t) else get ((l@[D]):loc_) test body

   144   | get l test (t as t1 $ t2) =

   145     if test t then SOME (l,t)

   146     else case get (l@[L]) test t1 of

   147       NONE => get (l@[R]) test t2

   148     | SOME (l',t') => SOME (l',t');

   149 (*18.6.00

   150 > val sss = ((term_of o the o (parse thy))

   151   "Script Solve_root_equation (eq_::bool) (v_::real) (err_::bool) =\

   152    \ (let e_ = Try (Rewrite square_equation_left True eq_) \

   153    \  in [e_])");

   154           ______ compares head_of !!

   155 > get [] (eq_str "HOL.Let") sss;            [R]

   156 > get [] (eq_str "Script.Try") sss;     [R,L,R]

   157 > get [] (eq_str "Script.Rewrite") sss; [R,L,R,R]

   158 > get [] (eq_str "HOL.True") sss;           [R,L,R,R,L,R]

   159 > get [] (eq_str "e_") sss;             [R,R]

   160 *)

   162 fun test_negotiable t =

   163     member op = (!negotiable)

   164            ((strip_thy o (term_str (Thy_Info.get_theory "Script")) o head_of) t);

   166 (*.get argument of first stactic in a script for init_form.*)

   167 fun get_stac thy (h $ body) =

   168   let

   169     fun get_t y (Const ("Script.Seq",_) $ e1 $ e2) a =

   170     	(case get_t y e1 a of NONE => get_t y e2 a | la => la)

   171       | get_t y (Const ("Script.Seq",_) $ e1 $ e2 $ a) _ =

   172     	(case get_t y e1 a of NONE => get_t y e2 a | la => la)

   173       | get_t y (Const ("Script.Try",_) $ e) a = get_t y e a

   174       | get_t y (Const ("Script.Try",_) $ e $ a) _ = get_t y e a

   175       | get_t y (Const ("Script.Repeat",_) $ e) a = get_t y e a

   176       | get_t y (Const ("Script.Repeat",_) $ e $ a) _ = get_t y e a

   177       | get_t y (Const ("Script.Or",_) $e1 $ e2) a =

   178     	(case get_t y e1 a of NONE => get_t y e2 a | la => la)

   179       | get_t y (Const ("Script.Or",_) $e1 $ e2 $ a) _ =

   180     	(case get_t y e1 a of NONE => get_t y e2 a | la => la)

   181       | get_t y (Const ("Script.While",_) $ c $ e) a = get_t y e a

   182       | get_t y (Const ("Script.While",_) $ c $ e $ a) _ = get_t y e a

   183       | get_t y (Const ("Script.Letpar",_) $ e1 $ Abs (_,_,e2)) a =

   184     	(case get_t y e1 a of NONE => get_t y e2 a | la => la)

   185     (*| get_t y (Const ("HOL.Let",_) $ e1 $ Abs (_,_,e2)) a =

   186 	    (case get_t y e1 a of NONE => get_t y e2 a | la => la)

   187       | get_t y (Abs (_,_,e)) a = get_t y e a*)

   188       | get_t y (Const ("HOL.Let",_) $ e1 $ Abs (_,_,e2)) a =

   189     	get_t y e1 a (*don't go deeper without evaluation !*)

   190       | get_t y (Const ("If",_) $ c $ e1 $ e2) a = NONE

   191     	(*(case get_t y e1 a of NONE => get_t y e2 a | la => la)*)

   193       | get_t y (Const ("Script.Rewrite",_) $ _ $ _ $ a) _ = SOME a

   194       | get_t y (Const ("Script.Rewrite",_) $ _ $ _    ) a = SOME a

   195       | get_t y (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ $ a) _ = SOME a

   196       | get_t y (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ )    a = SOME a

   197       | get_t y (Const ("Script.Rewrite'_Set",_) $ _ $ _ $ a) _ = SOME a

   198       | get_t y (Const ("Script.Rewrite'_Set",_) $ _ $ _ )    a = SOME a

   199       | get_t y (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ $a)_ =SOME a

   200       | get_t y (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ )  a =SOME a

   201       | get_t y (Const ("Script.Calculate",_) $ _ $ a) _ = SOME a

   202       | get_t y (Const ("Script.Calculate",_) $ _ )    a = SOME a

   204       | get_t y (Const ("Script.Substitute",_) $ _ $ a) _ = SOME a

   205       | get_t y (Const ("Script.Substitute",_) $ _ )    a = SOME a

   207       | get_t y (Const ("Script.SubProblem",_) $ _ $ _) _ = NONE

   209       | get_t y x _ =

   210 	((*tracing ("### get_t yac: list-expr "^(term2str x));*)

   211 	 NONE)

   212 in get_t thy body e_term end;

   214 (*FIXME: get 1st stac by next_stac [] instead of ... ?? 29.7.02*)

   215 (* val Script sc = scr;

   216    *)

   217 fun init_form thy (Script sc) env =

   218   (case get_stac thy sc of

   219      NONE => NONE

   220              (*error ("init_form: no 1st stac in "^

   221 	      (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) sc))*)

   222    | SOME stac => SOME (subst_atomic env stac))

   223   | init_form _ _ _ = error "init_form: no match";

   225 (* use"ME/script.sml";

   226    use"script.sml";

   227    *)

   231 (*the 'iteration-argument' of a stac (args not eval)*)

   232 fun itr_arg _ (Const ("Script.Rewrite'_Inst",_) $ _ $ _ $ _ $ v) = v

   233   | itr_arg _ (Const ("Script.Rewrite",_) $ _ $ _ $ v) = v

   234   | itr_arg _ (Const ("Script.Rewrite'_Set'_Inst",_) $ _ $ _ $ _ $ v) = v

   235   | itr_arg _ (Const ("Script.Rewrite'_Set",_) $ _ $ _ $ v) = v

   236   | itr_arg _ (Const ("Script.Calculate",_) $ _ $ v) = v

   237   | itr_arg _ (Const ("Script.Check'_elementwise",_) $ consts $ _) = consts

   238   | itr_arg _ (Const ("Script.Or'_to'_List",_) $ _) = e_term

   239   | itr_arg _ (Const ("Script.Tac",_) $ _) = e_term

   240   | itr_arg _ (Const ("Script.SubProblem",_) $ _ $ _) = e_term

   241   | itr_arg thy t = error

   242     ("itr_arg not impl. for " ^

   243     (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt (assoc_thy thy))) t));

   244 (* val t = (term_of o the o (parse thy))"Rewrite rroot_square_inv False e_";

   245 > itr_arg "Script" t;

   246 val it = Free ("e_","RealDef.real") : term

   247 > val t = (term_of o the o (parse thy))"xxx";

   248 > itr_arg "Script" t;

   249 *** itr_arg not impl. for xxx

   250 uncaught exception ERROR

   251   raised at: library.ML:1114.35-1114.40*)

   254 (*.get the arguments of the script out of the scripts parsetree.*)

   255 fun formal_args scr = (fst o split_last o snd o strip_comb) scr;

   256 (*

   257 > formal_args scr;

   258   [Free ("f_","RealDef.real"),Free ("v_","RealDef.real"),

   259    Free ("eqs_","bool List.list")] : term list

   260 *)

   262 (*.get the identifier of the script out of the scripts parsetree.*)

   263 fun id_of_scr sc = (id_of o fst o strip_comb) sc;

   265 (*WN020526: not clear, when a is available in ass_up for eva-_true*)

   266 (*WN060906: in "fun handle_leaf" eg. uses "SOME M__"(from some PREVIOUS

   267   curried Rewrite) for CURRENT value (which may be different from PREVIOUS);

   268   thus "NONE" must be set at the end of currying (ill designed anyway)*)

   269 fun upd_env_opt env (SOME a, v) = upd_env env (a,v)

   270   | upd_env_opt env (NONE, v) =

   271       (tracing ("*** upd_env_opt: (NONE," ^ term2str v ^ ")"); env);

   273 type dsc = typ; (*<-> nam..unknow in Descript.thy*)

   274 fun typ_str (Type (s,_)) = s

   275   | typ_str (TFree(s,_)) = s

   276   | typ_str (TVar ((s,i),_)) = s ^ (string_of_int i);

   278 (*get the _result_-type of a description*)

   279 fun dsc_valT (Const (_,(Type (_,[_,T])))) = (strip_thy o typ_str) T;

   280 (*> val t = (term_of o the o (parse thy)) "equality";

   281 > val T = type_of t;

   282 val T = "bool => Tools.una" : typ

   283 > val dsc = dsc_valT t;

   284 val dsc = "una" : string

   286 > val t = (term_of o the o (parse thy)) "fixedValues";

   287 > val T = type_of t;

   288 val T = "bool List.list => Tools.nam" : typ

   289 > val dsc = dsc_valT t;

   290 val dsc = "nam" : string*)

   292 (*.from penv in itm_ make args for script depending on type of description.*)

   293 (*6.5.03 TODO: push penv into script -- and drop mk_arg here || drop penv

   294   9.5.03 penv postponed: penv = env for script at the moment, (*mk_arg*)*)

   295 fun mk_arg thy d [] =

   296     error ("mk_arg: no data for " ^

   297 	   (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) d))

   298   | mk_arg thy d [t] =

   299     (case dsc_valT d of

   300 	 "una" => [t]

   301        | "nam" =>

   302 	 [case t of

   303 	      r as (Const ("HOL.eq",_) $ _ $ _) => r

   304 	    | _ => error ("mk_arg: dsc-typ 'nam' applied to non-equality "^

   305 		     (Print_Mode.setmp [] (Syntax.string_of_term

   306                                                (thy2ctxt thy)) t))]

   307        | s => error ("mk_arg: not impl. for "^s))

   309   | mk_arg thy d (t::ts) = (mk_arg thy d [t]) @ (mk_arg thy d ts);

   310 (*

   311  val d = d_in itm_;

   312  val [t] = ts_in itm_;

   313 mk_arg thy

   314 *)

   319 (*.create the actual parameters (args) of script: their order

   320   is given by the order in met.pat .*)

   321 (*WN.5.5.03: ?: does this allow for different descriptions ???

   322              ?: why not taken from formal args of script ???

   323 !: FIXXXME penv: push it here in itms2args into script-evaluation*)

   324 (* val (thy, mI, itms) = (thy, metID, itms);

   325    *)

   326 fun itms2args thy mI (itms:itm list) =

   327     let val mvat = max_vt itms

   328 	fun okv mvat (_,vats,b,_,_) = member op = vats mvat andalso b

   329 	val itms = filter (okv mvat) itms

   330 	fun test_dsc d (_,_,_,_,itm_) = (d = d_in itm_)

   331 	fun itm2arg itms (_,(d,_)) =

   332 	    case find_first (test_dsc d) itms of

   333 		NONE =>

   334 		error ("itms2args: '"^term2str d^"' not in itms")

   335 	      (*| SOME (_,_,_,_,itm_) => mk_arg thy (d_in itm_) (ts_in itm_);

   336                penv postponed; presently penv holds already env for script*)

   337 	      | SOME (_,_,_,_,itm_) => penvval_in itm_

   338 	fun sel_given_find (s,_) = (s = "#Given") orelse (s = "#Find")

   339 	val pats = (#ppc o get_met) mI

   340     in (flat o (map (itm2arg itms))) pats end;

   341 (*

   342 > val sc = ... Solve_root_equation ...

   343 > val mI = ("Script","sqrt-equ-test");

   344 > val PblObj{meth={ppc=itms,...},...} = get_obj I pt [];

   345 > val ts = itms2args thy mI itms;

   346 > map (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))) ts;

   347 ["sqrt (#9 + #4 * x) = sqrt x + sqrt (#5 + x)","x","#0"] : string list

   348 *)

   351 (*["BOOL (1+x=2)","REAL x"] --match_ags--> oris

   352   --oris2fmz_vals--> ["equality (1+x=2)","boundVariable x","solutions L"]*)

   353 fun oris2fmz_vals oris =

   354     let fun ori2fmz_vals ((_,_,_,dsc,ts):ori) =

   355 	    ((term2str o comp_dts') (dsc, ts), last_elem ts)

   356 	    handle _ => error ("ori2fmz_env called with "^terms2str ts)

   357     in (split_list o (map ori2fmz_vals)) oris end;

   359 (*detour necessary, because generate1 delivers a string-result*)

   360 fun mout2term thy (Form' (FormKF (_,_,_,_,res))) =

   361   (term_of o the o (parse (assoc_thy thy))) res

   362   | mout2term thy (Form' (PpcKF _)) = e_term;(*3.8.01: res of subpbl

   363 					   at time of detection in script*)

   365 (*.convert a script-tac 'stac' to a tactic 'tac'; if stac is an initac,

   366    then convert to a 'tac_' (as required in appy).

   367    arg pt:ptree for pushing the thy specified in rootpbl into subpbls.*)

   368 fun stac2tac_ pt thy (Const ("Script.Rewrite",_) $ Free (thmID,_) $ _ $ f) =

   369       let

   370         val tid = (de_esc_underscore o strip_thy) thmID

   371       in (Rewrite (tid, (string_of_thmI o (assoc_thm' thy)) (tid,"")), Empty_Tac_)

   372       end

   374   | stac2tac_ pt thy (Const ("Script.Rewrite'_Inst",_) $ sub $ Free (thmID,_) $ _ $ f) =

   375       let

   376         val subML = ((map isapair2pair) o isalist2list) sub

   377         val subStr = subst2subs subML

   378         val tid = (de_esc_underscore o strip_thy) thmID (*4.10.02 unnoetig*)

   379       in (Rewrite_Inst (subStr, (tid, (string_of_thmI o (assoc_thm' thy)) (tid,""))), Empty_Tac_)

   380       end

   382   | stac2tac_ pt thy (Const ("Script.Rewrite'_Set",_) $ Free (rls,_) $ _ $ f) =

   383       (Rewrite_Set ((de_esc_underscore o strip_thy) rls), Empty_Tac_)

   385   | stac2tac_ pt thy (Const ("Script.Rewrite'_Set'_Inst",_) $ sub $ Free (rls,_) $ _ $ f) =

   386       let

   387         val subML = ((map isapair2pair) o isalist2list) sub;

   388         val subStr = subst2subs subML;

   389       in (Rewrite_Set_Inst (subStr,rls), Empty_Tac_) end

   391   | stac2tac_ pt thy (Const ("Script.Calculate",_) $ Free (op_,_) $ f) =

   392       (Calculate op_, Empty_Tac_)

   394   | stac2tac_ pt thy (Const ("Script.Take",_) $ t) =

   395       (Take (term2str t), Empty_Tac_)

   397   | stac2tac_ pt thy (Const ("Script.Substitute",_) $ isasub $ arg) =

   398       (Substitute ((subte2sube o isalist2list) isasub), Empty_Tac_)

   400   | stac2tac_ pt thy (Const("Script.Check'_elementwise",_) $ _ $

   401 		(set as Const ("Set.Collect",_) $ Abs (_,_,pred))) =

   402       (Check_elementwise (Print_Mode.setmp [] (Syntax.string_of_term

   403                           (thy2ctxt thy)) pred), (*set*)Empty_Tac_)

   405   | stac2tac_ pt thy (Const("Script.Or'_to'_List",_) $ _ ) =

   406       (Or_to_List, Empty_Tac_)

   408     (*12.1.01.for subproblem_equation_dummy in root-equation *)

   409   | stac2tac_ pt thy (Const ("Script.Tac",_) $ Free (str,_)) =

   410       (Tac ((de_esc_underscore o strip_thy) str),  Empty_Tac_)

   412     (*compare "| assod _ (Subproblem'"*)

   413   | stac2tac_ pt thy (stac as Const ("Script.SubProblem",_) $

   414 	  (Const ("Product_Type.Pair",_) $Free (dI',_) $

   415 		 (Const ("Product_Type.Pair",_) $ pI' $ mI')) $ ags') =

   416       let

   417         val dI = ((implode o drop_last(*.."'"*) o Symbol.explode) dI')(*^""*);

   418         val thy = maxthy (assoc_thy dI) (rootthy pt);

   419 	      val pI = ((map (de_esc_underscore o free2str)) o isalist2list) pI';

   420 	      val mI = ((map (de_esc_underscore o free2str)) o isalist2list) mI';

   421 	      val ags = isalist2list ags';

   422 	      val (pI, pors, mI) =

   423 	        if mI = ["no_met"]

   424 	        then

   425             let

   426               val pors = (match_ags thy ((#ppc o get_pbt) pI) ags)

   427 			          handle ERROR "actual args do not match formal args"

   428 				        => (match_ags_msg pI stac ags(*raise exn*); [])

   429 		          val pI' = refine_ori' pors pI;

   430 		        in (pI', pors (*refinement over models with diff.prec only*),

   431 		            (hd o #met o get_pbt) pI') end

   432 	        else (pI, (match_ags thy ((#ppc o get_pbt) pI) ags)

   433 		        handle ERROR "actual args do not match formal args"

   434 			      => (match_ags_msg pI stac ags(*raise exn*); []), mI);

   435         val (fmz_, vals) = oris2fmz_vals pors;

   436 	      val {cas,ppc,thy,...} = get_pbt pI

   437 	      val dI = theory2theory' thy (*.take dI from _refined_ pbl.*)

   438 	      val dI = theory2theory' (maxthy (assoc_thy dI) (rootthy pt));

   439         val ctxt = ProofContext.init_global

   440         val ctxt = dI |> Thy_Info.get_theory |> ProofContext.init_global

   441           |> declare_constraints' vals

   442 	      val hdl =

   443           case cas of

   444 		        NONE => pblterm dI pI

   445 		      | SOME t => subst_atomic ((vars_of_pbl_' ppc) ~~~ vals) t

   446         val f = subpbl (strip_thy dI) pI

   447       in (Subproblem (dI, pI),	Subproblem' ((dI, pI, mI), pors, hdl, fmz_, ctxt, f))

   448       end

   450   | stac2tac_ pt thy t = error

   451   ("stac2tac_ TODO: no match for " ^

   452    (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) t));

   454 fun stac2tac pt thy t = (fst o stac2tac_ pt thy) t;

   456 (*test a term for being a _list_ (set ?) of constants; could be more rigorous*)

   457 fun list_of_consts (Const ("List.list.Cons",_) $ _ $ _) = true

   458   | list_of_consts (Const ("List.list.Nil",_)) = true

   459   | list_of_consts _ = false;

   460 (*val ttt = (term_of o the o (parse thy)) "[x=#1,x=#2,x=#3]";

   461 > list_of_consts ttt;

   462 val it = true : bool

   463 > val ttt = (term_of o the o (parse thy)) "[]";

   464 > list_of_consts ttt;

   465 val it = true : bool*)

   469 datatype ass =

   470     Ass of

   471       tac_ *   (* SubProblem gets args instantiated in assod *)

   472   	  term     (* for itr_arg, result in ets *)

   473   | AssWeak of

   474       tac_ *

   475   	  term     (*for itr_arg,result in ets*)

   476   | NotAss;

   478 (*.assod: tac_ associated with stac w.r.t. d

   479 args

   480  pt:ptree for pushing the thy specified in rootpbl into subpbls

   481 returns

   482  Ass    : associated: e.g. thmID in stac = thmID in m

   483                        +++ arg   in stac = arg   in m

   484  AssWeak: weakly ass.:e.g. thmID in stac = thmID in m, //arg//

   485  NotAss :             e.g. thmID in stac/=/thmID in m (not =)

   486 8.01:

   487  tac_ SubProblem with args completed from script

   488 .*)

   489 fun assod pt d (m as Rewrite_Inst' (thy',rod,rls,put,subs,(thmID,thm),f,(f',asm))) stac =

   490       (case stac of

   491 	       (Const ("Script.Rewrite'_Inst",_) $ subs_ $ Free (thmID_,idT) $b$f_) =>

   492 	          if thmID = thmID_

   493             then

   494 	            if f = f_

   495               then ((*tracing"3### assod ..Ass";*)Ass (m,f'))

   496 	            else ((*tracing"3### assod ..AssWeak";*)AssWeak(m, f'))

   497 	          else ((*tracing"3### assod ..NotAss";*)NotAss)

   498        | (Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free (rls_,_) $_$f_) =>

   499 	          if contains_rule (Thm (thmID, refl(*dummy*))) (assoc_rls rls_)

   500             then

   501 	            if f = f_ then Ass (m,f') else AssWeak (m,f')

   502 	          else NotAss

   503        | _ => NotAss)

   505   | assod pt d (m as Rewrite' (thy,rod,rls,put,(thmID,thm),f,(f',asm))) stac =

   506       (case stac of

   507 	       (t as Const ("Script.Rewrite",_) $ Free (thmID_,idT) $ b $ f_) =>

   508 	         ((*tracing ("3### assod: stac = " ^ ter2str t);

   509 	          tracing ("3### assod: f(m)= " ^ term2str f);*)

   510 	          if thmID = thmID_

   511             then

   512 	            if f = f_

   513               then ((*tracing"3### assod ..Ass";*)Ass (m,f'))

   514 	            else

   515                 ((*tracing"### assod ..AssWeak";

   516 		             tracing("### assod: f(m)  = " ^ term2str f);

   517 		             tracing("### assod: f(stac)= " ^ term2str f_)*)

   518 		             AssWeak (m,f'))

   519 	          else ((*tracing"3### assod ..NotAss";*)NotAss))

   520        | (Const ("Script.Rewrite'_Set",_) $ Free (rls_,_) $ _ $ f_) =>

   521 	          if contains_rule (Thm (thmID, refl(*dummy*))) (assoc_rls rls_)

   522             then

   523 	            if f = f_ then Ass (m,f') else AssWeak (m,f')

   524 	          else NotAss

   525        | _ => NotAss)

   527   | assod pt d (m as Rewrite_Set_Inst' (thy',put,sub,rls,f,(f',asm)))

   528     (Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free (rls_,_) $ _ $ f_) =

   529       if id_rls rls = rls_

   530       then

   531         if f = f_ then Ass (m,f') else AssWeak (m,f')

   532       else NotAss

   534   | assod pt d (m as Detail_Set_Inst' (thy',put,sub,rls,f,(f',asm)))

   535     (Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free (rls_,_) $ _ $ f_) =

   536       if id_rls rls = rls_

   537       then

   538         if f = f_ then Ass (m,f') else AssWeak (m,f')

   539       else NotAss

   541   | assod pt d (m as Rewrite_Set' (thy,put,rls,f,(f',asm)))

   542     (Const ("Script.Rewrite'_Set",_) $ Free (rls_,_) $ _ $ f_) =

   543       if id_rls rls = rls_

   544       then

   545         if f = f_ then Ass (m,f') else AssWeak (m,f')

   546       else NotAss

   548   | assod pt d (m as Detail_Set' (thy,put,rls,f,(f',asm)))

   549     (Const ("Script.Rewrite'_Set",_) $ Free (rls_,_) $ _ $ f_) =

   550       if id_rls rls = rls_

   551       then

   552         if f = f_ then Ass (m,f') else AssWeak (m,f')

   553       else NotAss

   555   | assod pt d (m as Calculate' (thy',op_,f,(f',thm'))) stac =

   556       (case stac of

   557 	       (Const ("Script.Calculate",_) $ Free (op__,_) $ f_) =>

   558 	         if op_ = op__

   559            then

   560 	           if f = f_ then Ass (m,f') else AssWeak (m,f')

   561 	         else NotAss

   562        | (Const ("Script.Rewrite'_Set'_Inst",_) $ sub_ $ Free(rls_,_) $_$f_)  =>

   563 	         if contains_rule (Calc (snd (assoc1 (!calclist', op_)))) (assoc_rls rls_)

   564            then

   565 	           if f = f_ then Ass (m,f') else AssWeak (m,f')

   566 	         else NotAss

   567        | (Const ("Script.Rewrite'_Set",_) $ Free (rls_, _) $ _ $ f_) =>

   568 	         if contains_rule (Calc (snd (assoc1 (!calclist', op_)))) (assoc_rls rls_)

   569            then

   570 	           if f = f_ then Ass (m,f') else AssWeak (m,f')

   571 	         else NotAss

   572        | _ => NotAss)

   574   | assod pt _ (m as Check_elementwise' (consts,_,(consts_chkd,_)))

   575     (Const ("Script.Check'_elementwise",_) $ consts' $ _) =

   576       ((*tracing("### assod Check'_elementwise: consts= "^(term2str consts)^

   577 	     ", consts'= "^(term2str consts'));

   578        atomty consts; atomty consts';*)

   579        if consts = consts'

   580        then ((*tracing"### assod Check'_elementwise: Ass";*) Ass (m, consts_chkd))

   581        else ((*tracing"### assod Check'_elementwise: NotAss";*) NotAss))

   583   | assod pt _ (m as Or_to_List' (ors, list)) (Const ("Script.Or'_to'_List",_) $ _) =

   584 	    Ass (m, list)

   586   | assod pt _ (m as Take' term) (Const ("Script.Take",_) $ _) =

   587 	    Ass (m, term)

   589   | assod pt _ (m as Substitute' (_, _, res)) (Const ("Script.Substitute",_) $ _ $ _) =

   590 	    Ass (m, res)

   592   | assod pt _ (m as Tac_ (thy,f,id,f')) (Const ("Script.Tac",_) $ Free (id',_)) =

   593       if id = id'

   594       then Ass (m, ((term_of o the o (parse thy)) f'))

   595       else NotAss

   597     (*compare "| stac2tac_ thy (Const ("Script.SubProblem",_)"*)

   598   | assod pt _ (Subproblem' ((domID,pblID,metID),_,_,_,_,f))

   599 	  (stac as Const ("Script.SubProblem",_) $ (Const ("Product_Type.Pair",_) $

   600 		 Free (dI',_) $ (Const ("Product_Type.Pair",_) $ pI' $ mI')) $ ags') =

   601       let

   602         val dI = ((implode o drop_last(*.."'"*) o Symbol.explode) dI')(*^""*);

   603         val thy = maxthy (assoc_thy dI) (rootthy pt);

   604 	      val pI = ((map (de_esc_underscore o free2str)) o isalist2list) pI';

   605 	      val mI = ((map (de_esc_underscore o free2str)) o isalist2list) mI';

   606 	      val ags = isalist2list ags';

   607 	      val (pI, pors, mI) =

   608 	        if mI = ["no_met"]

   609 	        then

   610             let

   611               val pors = (match_ags thy ((#ppc o get_pbt) pI) ags)

   612 			          handle ERROR "actual args do not match formal args"

   613 				        => (match_ags_msg pI stac ags(*raise exn*);[]);

   614 		          val pI' = refine_ori' pors pI;

   615 		        in (pI', pors (*refinement over models with diff.prec only*),

   616 		            (hd o #met o get_pbt) pI')

   617             end

   618 	        else (pI, (match_ags thy ((#ppc o get_pbt) pI) ags)

   619 		        handle ERROR "actual args do not match formal args"

   620 			      => (match_ags_msg pI stac ags(*raise exn*);[]), mI);

   621         val (fmz_, vals) = oris2fmz_vals pors;

   622 	      val {cas, ppc, thy,...} = get_pbt pI

   623 	      val dI = theory2theory' thy (*take dI from _refined_ pbl*)

   624 	      val dI = theory2theory' (maxthy (assoc_thy dI) (rootthy pt))

   625 	      val ctxt = dI |> Thy_Info.get_theory |> ProofContext.init_global

   626           |> declare_constraints' vals

   627 	      val hdl =

   628           case cas of

   629 		        NONE => pblterm dI pI

   630 		      | SOME t => subst_atomic ((vars_of_pbl_' ppc) ~~~ vals) t

   631         val f = subpbl (strip_thy dI) pI

   632       in

   633         if domID = dI andalso pblID = pI

   634         then Ass (Subproblem' ((dI, pI, mI), pors, hdl, fmz_, ctxt, f), f)

   635         else NotAss

   636       end

   638   | assod pt d m t =

   639       (if (!trace_script)

   640        then tracing("@@@ the 'tac_' proposed to apply does NOT match the leaf found in the script:\n"^

   641 		     "@@@ tac_ = "^(tac_2str m))

   642        else ();

   643        NotAss);

   645 fun tac_2tac (Refine_Tacitly' (pI,_,_,_,_)) = Refine_Tacitly pI

   646   | tac_2tac (Model_Problem' (pI,_,_))      = Model_Problem

   647   | tac_2tac (Add_Given' (t,_))             = Add_Given t

   648   | tac_2tac (Add_Find' (t,_))              = Add_Find t

   649   | tac_2tac (Add_Relation' (t,_))          = Add_Relation t

   651   | tac_2tac (Specify_Theory' dI)           = Specify_Theory dI

   652   | tac_2tac (Specify_Problem' (dI,_))      = Specify_Problem dI

   653   | tac_2tac (Specify_Method' (dI,_,_))     = Specify_Method dI

   655   | tac_2tac (Rewrite' (thy,rod,erls,put,(thmID,thm),f,(f',asm))) = Rewrite (thmID,thm)

   657   | tac_2tac (Rewrite_Inst' (thy,rod,erls,put,sub,(thmID,thm),f,(f',asm)))=

   658       Rewrite_Inst (subst2subs sub,(thmID,thm))

   660   | tac_2tac (Rewrite_Set' (thy,put,rls,f,(f',asm))) = Rewrite_Set (id_rls rls)

   661   | tac_2tac (Detail_Set' (thy,put,rls,f,(f',asm))) = Detail_Set (id_rls rls)

   663   | tac_2tac (Rewrite_Set_Inst' (thy,put,sub,rls,f,(f',asm))) =

   664       Rewrite_Set_Inst (subst2subs sub,id_rls rls)

   665   | tac_2tac (Detail_Set_Inst' (thy,put,sub,rls,f,(f',asm))) =

   666       Detail_Set_Inst (subst2subs sub,id_rls rls)

   668   | tac_2tac (Calculate' (thy,op_,t,(t',thm'))) = Calculate (op_)

   670   | tac_2tac (Check_elementwise' (consts,pred,consts')) = Check_elementwise pred

   672   | tac_2tac (Or_to_List' _) = Or_to_List

   673   | tac_2tac (Take' term) = Take (term2str term)

   674   | tac_2tac (Substitute' (subte, t, res)) = Substitute (subte2sube subte)

   676   | tac_2tac (Tac_ (_,f,id,f')) = Tac id

   678   | tac_2tac (Subproblem' ((domID, pblID, _), _, _, _,_ ,_)) = Subproblem (domID, pblID)

   679   | tac_2tac (Check_Postcond' (pblID, _)) = Check_Postcond pblID

   680   | tac_2tac Empty_Tac_ = Empty_Tac

   681   | tac_2tac m =

   682       error ("tac_2tac: not impl. for "^(tac_2str m));

   687 (** decompose tac_ to a rule and to (lhs,rhs)

   688     unly needed                          --- **)

   690 val idT = Type ("Script.ID",[]);

   691 (*val tt = (term_of o the o (parse thy)) "square_equation_left::ID";

   692 type_of tt = idT;

   693 val it = true : bool

   694 *)

   696 fun make_rule thy t =

   697   let val ct = cterm_of thy (Trueprop $ t)

   698   in Thm (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))

   699                            (term_of ct), make_thm ct) end;

   701 (* val (Rewrite_Inst'(thy',rod,rls,put,subs,(thmID,thm),f,(f',asm)))=m;

   702    *)

   703 (*decompose tac_ to a rule and to (lhs,rhs) for ets FIXME.12.03: obsolete!

   704  NOTE.12.03: also used for msg 'not locatable' ?!: 'Subproblem' missing !!!

   705 WN0508 only use in tac_2res, which uses only last return-value*)

   706 fun rep_tac_ (Rewrite_Inst'

   707 		 (thy',rod,rls,put,subs,(thmID,thm),f,(f',asm))) =

   708   let val fT = type_of f;

   709     val b = if put then HOLogic.true_const else HOLogic.false_const;

   710     val sT = (type_of o fst o hd) subs;

   711     val subs' = list2isalist (HOLogic.mk_prodT (sT, sT))

   712       (map HOLogic.mk_prod subs);

   713     val sT' = type_of subs';

   714     val lhs = Const ("Script.Rewrite'_Inst",[sT',idT,(*fT*)bool,fT] ---> fT)

   715       $ subs' $ Free (thmID,idT) $ b $ f;

   716   in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end

   717 (*Fehlersuche 25.4.01

   718 (a)----- als String zusammensetzen:

   719 ML> term2str f;

   720 val it = "d_d x #4 + d_d x (x ^^^ #2 + #3 * x)" : string

   721 ML> term2str f';

   722 val it = "#0 + d_d x (x ^^^ #2 + #3 * x)" : string

   723 ML> subs;

   724 val it = [(Free ("bdv","RealDef.real"),Free ("x","RealDef.real"))] : subst

   725 > val tt = (term_of o the o (parse thy))

   726   "(Rewrite_Inst[(bdv,x)]diff_const False(d_d x #4 + d_d x (x ^^^ #2 + #3 * x)))=(#0 + d_d x (x ^^^ #2 + #3 * x))";

   727 > atomty tt;

   728 ML> tracing (term2str tt);

   729 (Rewrite_Inst [(bdv,x)] diff_const False d_d x #4 + d_d x (x ^^^ #2 + #3 * x)) =

   730  #0 + d_d x (x ^^^ #2 + #3 * x)

   732 (b)----- laut rep_tac_:

   733 > val ttt=HOLogic.mk_eq (lhs,f');

   734 > atomty ttt;

   737 (*Fehlersuche 1-2Monate vor 4.01:*)

   738 > val tt = (term_of o the o (parse thy))

   739   "Rewrite_Inst[(bdv,x)]square_equation_left True(x=#1+#2)";

   740 > atomty tt;

   742 > val f = (term_of o the o (parse thy)) "x=#1+#2";

   743 > val f' = (term_of o the o (parse thy)) "x=#3";

   744 > val subs = [((term_of o the o (parse thy)) "bdv",

   745 	       (term_of o the o (parse thy)) "x")];

   746 > val sT = (type_of o fst o hd) subs;

   747 > val subs' = list2isalist (HOLogic.mk_prodT (sT, sT))

   748 			      (map HOLogic.mk_prod subs);

   749 > val sT' = type_of subs';

   750 > val lhs = Const ("Script.Rewrite'_Inst",[sT',idT,fT,fT] ---> fT)

   751   $ subs' $ Free (thmID,idT) $ HOLogic.true_const $ f;

   752 > lhs = tt;

   753 val it = true : bool

   754 > rep_tac_ (Rewrite_Inst'

   755 	       ("Script","tless_true","eval_rls",false,subs,

   756 		("square_equation_left",""),f,(f',[])));

   757 *)

   758   | rep_tac_ (Rewrite' (thy',rod,rls,put,(thmID,thm),f,(f',asm)))=

   759   let

   760     val fT = type_of f;

   761     val b = if put then HOLogic.true_const else HOLogic.false_const;

   762     val lhs = Const ("Script.Rewrite",[idT,HOLogic.boolT,fT] ---> fT)

   763       $ Free (thmID,idT) $ b $ f;

   764   in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end

   765 (*

   766 > val tt = (term_of o the o (parse thy)) (*____   ____..test*)

   767   "Rewrite square_equation_left True (x=#1+#2) = (x=#3)";

   769 > val f = (term_of o the o (parse thy)) "x=#1+#2";

   770 > val f' = (term_of o the o (parse thy)) "x=#3";

   771 > val Thm (id,thm) =

   772   rep_tac_ (Rewrite'

   773    ("Script","tless_true","eval_rls",false,

   774     ("square_equation_left",""),f,(f',[])));

   775 > val SOME ct = parse thy

   776   "Rewrite square_equation_left True (x=#1+#2)";

   777 > rewrite_ Script.thy tless_true eval_rls true thm ct;

   778 val it = SOME ("x = #3",[]) : (cterm * cterm list) option

   779 *)

   780   | rep_tac_ (Rewrite_Set_Inst'

   781 		 (thy',put,subs,rls,f,(f',asm))) =

   782     (e_rule, (e_term, f'))

   783 (*WN050824: type error ...

   784   let val fT = type_of f;

   785     val sT = (type_of o fst o hd) subs;

   786     val subs' = list2isalist (HOLogic.mk_prodT (sT, sT))

   787       (map HOLogic.mk_prod subs);

   788     val sT' = type_of subs';

   789     val b = if put then HOLogic.true_const else HOLogic.false_const

   790     val lhs = Const ("Script.Rewrite'_Set'_Inst",

   791 		     [sT',idT,fT,fT] ---> fT)

   792       $ subs' $ Free (id_rls rls,idT) $ b $ f;

   793   in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end*)

   794 (* ... vals from Rewrite_Inst' ...

   795 > rep_tac_ (Rewrite_Set_Inst'

   796 	       ("Script",false,subs,

   797 		"isolate_bdv",f,(f',[])));

   798 *)

   799 (* val (Rewrite_Set' (thy',put,rls,f,(f',asm)))=m;

   800 *)

   801   | rep_tac_ (Rewrite_Set' (thy',put,rls,f,(f',asm)))=

   802   let val fT = type_of f;

   803     val b = if put then HOLogic.true_const else HOLogic.false_const;

   804     val lhs = Const ("Script.Rewrite'_Set",[idT,bool,fT] ---> fT)

   805       $ Free (id_rls rls,idT) $ b $ f;

   806   in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end

   807 (* 13.3.01:

   808 val thy = assoc_thy thy';

   809 val t = HOLogic.mk_eq (lhs,f');

   810 make_rule thy t;

   811 --------------------------------------------------

   812 val lll = (term_of o the o (parse thy))

   813   "Rewrite_Set SqRoot_simplify False (d_d x (x ^^^ #2 + #3 * x) + d_d x #4)";

   815 --------------------------------------------------

   816 > val f = (term_of o the o (parse thy)) "x=#1+#2";

   817 > val f' = (term_of o the o (parse thy)) "x=#3";

   818 > val Thm (id,thm) =

   819   rep_tac_ (Rewrite_Set'

   820    ("Script",false,"SqRoot_simplify",f,(f',[])));

   821 val id = "(Rewrite_Set SqRoot_simplify True x = #1 + #2) = (x = #3)" : string

   822 val thm = "(Rewrite_Set SqRoot_simplify True x = #1 + #2) = (x = #3)" : thm

   823 *)

   824   | rep_tac_ (Calculate' (thy',op_,f,(f',thm')))=

   825   let val fT = type_of f;

   826     val lhs = Const ("Script.Calculate",[idT,fT] ---> fT)

   827       $ Free (op_,idT) $ f

   828   in (((make_rule (assoc_thy thy')) o HOLogic.mk_eq) (lhs,f'),(lhs,f')) end

   829 (*

   830 > val lhs'=(term_of o the o (parse thy))"Calculate plus (#1+#2)";

   831   ... test-root-equ.sml: calculate ...

   832 > val Appl m'=applicable_in p pt (Calculate "PLUS");

   833 > val (lhs,_)=tac_2etac m';

   834 > lhs'=lhs;

   835 val it = true : bool*)

   836   | rep_tac_ (Check_elementwise' (t,str,(t',asm)))  = (Erule, (e_term, t'))

   837   | rep_tac_ (Subproblem' (_, _, _, _, _, t'))  = (Erule, (e_term, t'))

   838   | rep_tac_ (Take' (t'))  = (Erule, (e_term, t'))

   839   | rep_tac_ (Substitute' (subst,t,t'))  = (Erule, (t, t'))

   840   | rep_tac_ (Or_to_List' (t, t'))  = (Erule, (t, t'))

   841   | rep_tac_ m = error ("rep_tac_: not impl.for "^

   842 				 (tac_2str m));

   844 (*"N.3.6.03------

   845 fun tac_2rule m = (fst o rep_tac_) m;

   846 fun tac_2etac m = (snd o rep_tac_) m;

   847 fun tac_2tac m = (fst o snd o rep_tac_) m;*)

   848 fun tac_2res m = (snd o snd o rep_tac_) m;(*ONLYuse of rep_tac_

   849 					        FIXXXXME: simplify rep_tac_*)

   852 (* handle a leaf at the end of recursive descent:

   853    a leaf is either a tactic or an 'exp' in 'let v = expr'

   854    where 'exp' does not contain a tactic.

   855    handling a leaf comprises

   856    (1) 'subst_stacexpr' substitute env and complete curried tactic

   857    (2) rewrite the leaf by 'srls'

   858 *)

   859 fun handle_leaf call thy srls E a v t =

   860       (*WN050916 'upd_env_opt' is a blind copy from previous version*)

   861        case subst_stacexpr E a v t of

   862 	       (a', STac stac) => (*script-tactic*)

   863 	         let val stac' =

   864              eval_listexpr_ (assoc_thy thy) srls (subst_atomic (upd_env_opt E (a,v)) stac)

   865 	         in

   866              (if (!trace_script)

   867 	            then tracing ("@@@ "^call^" leaf '"^term2str t^"' ---> STac '"^term2str stac'^"'")

   868 	            else ();

   869 	            (a', STac stac'))

   870 	         end

   871        | (a', Expr lexpr) => (*leaf-expression*)

   872 	         let val lexpr' =

   873              eval_listexpr_ (assoc_thy thy) srls (subst_atomic (upd_env_opt E (a,v)) lexpr)

   874 	         in

   875              (if (!trace_script)

   876 	            then tracing("@@@ "^call^" leaf '"^term2str t^"' ---> Expr '"^term2str lexpr'^"'")

   877 	            else ();

   878 	            (a', Expr lexpr'))

   879 	         end;

   882 (** locate an applicable stactic in a script **)

   884 datatype assoc = (*ExprVal in the sense of denotational semantics*)

   885   Assoc of     (*the stac is associated, strongly or weakly*)

   886   scrstate *       (*the current; returned for next_tac etc. outside ass* *)

   887   (step list)    (*list of steps done until associated stac found;

   888 	           initiated with the data for doing the 1st step,

   889                    thus the head holds these data further on,

   890 		   while the tail holds steps finished (incl.scrstate in ptree)*)

   891 | NasApp of   (*stac not associated, but applicable, ptree-node generated*)

   892   scrstate * (step list)

   893 | NasNap of     (*stac not associated, not applicable, nothing generated;

   894 	         for distinction in Or, for leaving iterations, leaving Seq,

   895 		 evaluate scriptexpressions*)

   896   term * env;

   897 fun assoc2str (Assoc     _) = "Assoc"

   898   | assoc2str (NasNap  _) = "NasNap"

   899   | assoc2str (NasApp _) = "NasApp";

   902 datatype asap = (*arg. of assy _only_ for distinction w.r.t. Or*)

   903   Aundef   (*undefined: set only by (topmost) Or*)

   904 | AssOnly  (*do not execute appl stacs - there could be an associated

   905 	     in parallel Or-branch*)

   906 | AssGen;  (*no Ass(Weak) found within Or, thus

   907              search for _applicable_ stacs, execute and generate pt*)

   908 (*this constructions doesnt allow arbitrary nesting of Or !!!*)

   911 (*assy, ass_up, astep_up scanning for locate_gen at stactic in a script.

   912   search is clearly separated into (1)-(2):

   913   (1) assy is recursive descent;

   914   (2) ass_up resumes interpretation at a location somewhere in the script;

   915       astep_up does only get to the parentnode of the scriptexpr.

   916   consequence:

   917   * call of (2) means _always_ that in this branch below

   918     there was an appl.stac (Repeat, Or e1, ...) found by the previous step.

   919 *)

   920 fun assy ya (is as (E,l,a,v,S,b),ss) (Const ("HOL.Let",_) $ e $ (Abs (id,T,body))) =

   921       (case assy ya ((E , l@[L,R], a,v,S,b),ss) e of

   922 	       NasApp ((E',l,a,v,S,bb),ss) =>

   923 	         let

   924              val id' = mk_Free (id, T);

   925 	           val E' = upd_env E' (id', v);

   926 	         in assy ya ((E', l@[R,D], a,v,S,b),ss) body end

   927        | NasNap (v,E) =>

   928 	         let

   929              val id' = mk_Free (id, T);

   930 	           val E' = upd_env E (id', v);

   931 	         in assy ya ((E', l@[R,D], a,v,S,b),ss) body end

   932        | ay => ay)

   934   | assy (ya as (((thy,srls),_),_)) ((E,l,_,v,S,b),ss) (Const ("Script.While",_) $ c $ e $ a) =

   935       (if eval_true_ thy srls (subst_atomic (upd_env E (a,v)) c)

   936        then assy ya ((E, l@[L,R], SOME a,v,S,b),ss)  e

   937        else NasNap (v, E))

   938   | assy (ya as (((thy,srls),_),_)) ((E,l,a,v,S,b),ss) (Const ("Script.While",_) $ c $ e) =

   939       (if eval_true_ thy srls (subst_atomic (upd_env_opt E (a,v)) c)

   940        then assy ya ((E, l@[R], a,v,S,b),ss) e

   941        else NasNap (v, E))

   943   | assy (ya as (((thy,srls),_),_)) ((E,l,a,v,S,b),ss) (Const ("If",_) $ c $ e1 $ e2) =

   944       (if eval_true_ thy srls (subst_atomic (upd_env_opt E (a,v)) c)

   945        then assy ya ((E, l@[L,R], a,v,S,b),ss) e1

   946        else assy ya ((E, l@[  R], a,v,S,b),ss) e2)

   948   | assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Try",_) $ e $ a) =

   949       (case assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e of

   950          ay => ay)

   951   | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Try",_) $ e) =

   952       (case assy ya ((E, l@[R], a,v,S,b),ss) e of

   953          ay => ay)

   955   | assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Seq",_) $e1 $ e2 $ a) =

   956       (case assy ya ((E, l@[L,L,R], SOME a,v,S,b),ss) e1 of

   957 	       NasNap (v, E) => assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e2

   958        | NasApp ((E,_,_,v,_,_),ss) => assy ya ((E, l@[L,R], SOME a,v,S,b),ss) e2

   959        | ay => ay)

   960   | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Seq",_) $e1 $ e2) =

   961       (case assy ya ((E, l@[L,R], a,v,S,b),ss) e1 of

   962 	       NasNap (v, E) => assy ya ((E, l@[R], a,v,S,b),ss) e2

   963        | NasApp ((E,_,_,v,_,_),ss) => assy ya ((E, l@[R], a,v,S,b),ss) e2

   964        | ay => ay)

   966   | assy ya ((E,l,_,v,S,b),ss) (Const ("Script.Repeat",_) $ e $ a) =

   967       assy ya ((E,(l@[L,R]),SOME a,v,S,b),ss) e

   968   | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Repeat",_) $ e) =

   969       assy ya ((E,(l@[R]),a,v,S,b),ss) e

   971   | assy (y, Aundef) ((E,l,_,v,S,b),ss) (Const ("Script.Or",_) $e1 $ e2 $ a) =

   972       (case assy (y, AssOnly) ((E,(l@[L,L,R]),SOME a,v,S,b),ss) e1 of

   973 	       NasNap (v, E) =>

   974 	         (case assy (y, AssOnly) ((E,(l@[L,R]),SOME a,v,S,b),ss) e2 of

   975 	            NasNap (v, E) =>

   976 	              (case assy (y, AssGen) ((E,(l@[L,L,R]),SOME a,v,S,b),ss) e1 of

   977 	                 NasNap (v, E) =>

   978 	                   assy (y, AssGen) ((E, (l@[L,R]), SOME a,v,S,b),ss) e2

   979 	               | ay => ay)

   980 	          | ay =>(ay))

   981        | NasApp _ => error ("assy: FIXXXME ///must not return NasApp///")

   982        | ay => (ay))

   983   | assy ya ((E,l,a,v,S,b),ss) (Const ("Script.Or",_) $e1 $ e2) =

   984       (case assy ya ((E,(l@[L,R]),a,v,S,b),ss) e1 of

   985 	       NasNap (v, E) => assy ya ((E,(l@[R]),a,v,S,b),ss) e2

   986        | ay => (ay))

   988   | assy (((thy',sr),d),ap) (is as (E,l,a,v,S,b), (m,_,pt,(p,p_),c)::ss) t =

   989       (case handle_leaf "locate" thy' sr E a v t of

   990 	       (a', Expr s) =>

   991 	          (NasNap (eval_listexpr_ (assoc_thy thy') sr

   992 			         (subst_atomic (upd_env_opt E (a',v)) t), E))

   993        | (a', STac stac) =>

   994 	         let

   995              val ctxt = get_ctxt pt (p,p_)

   996              val p' =

   997                case p_ of Frm => p

   998                | Res => lev_on p

   999 			         | _ => error ("assy: call by " ^ pos'2str (p,p_));

  1000 	         in

  1001              case assod pt d m stac of

  1002 	             Ass (m,v') =>

  1003 	               let val (p'',c',f',pt') =

  1004                    generate1 (assoc_thy thy') m (ScrState (E,l,a',v',S,true), ctxt) (p',p_) pt;

  1005 	               in Assoc ((E,l,a',v',S,true), (m,f',pt',p'',c @ c')::ss) end

  1006              | AssWeak (m,v') =>

  1007 	               let val (p'',c',f',pt') =

  1008                    generate1 (assoc_thy thy') m (ScrState (E,l,a',v',S,false), ctxt) (p',p_) pt;

  1009 	               in Assoc ((E,l,a',v',S,false), (m,f',pt',p'',c @ c')::ss) end

  1010              | NotAss =>

  1011                  (case ap of   (*switch for Or: 1st AssOnly, 2nd AssGen*)

  1012                     AssOnly => (NasNap (v, E))

  1013                   | gen =>

  1014                       (case applicable_in (p,p_) pt (stac2tac pt (assoc_thy thy') stac) of

  1015 			                   Appl m' =>

  1016 			                     let

  1017                              val is = (E,l,a',tac_2res m',S,false(*FIXXXME.WN0?*))

  1018 			                       val (p'',c',f',pt') =

  1019 			                         generate1 (assoc_thy thy') m' (ScrState is, ctxt) (p',p_) pt;

  1020 			                     in NasApp (is,(m,f',pt',p'',c @ c')::ss) end

  1021 		                   | Notappl _ => (NasNap (v, E))

  1022 			                )

  1023 		             )

  1024            end);

  1026 fun ass_up (ys as (y,s,Script sc,d)) (is as (E,l,a,v,S,b),ss)

  1027 	   (Const ("HOL.Let",_) $ _) =

  1028     let (*val _= tracing("### ass_up1 Let$e: is=")

  1029 	val _= tracing(istate2str (ScrState is))*)

  1030 	val l = drop_last l; (*comes from e, goes to Abs*)

  1031       val (Const ("HOL.Let",_) $ e $ (Abs (i,T,body))) = go l sc;

  1032       val i = mk_Free (i, T);

  1033       val E = upd_env E (i, v);

  1034       (*val _=tracing("### ass_up2 Let$e: E="^(subst2str E));*)

  1035     in case assy (((y,s),d),Aundef) ((E, l@[R,D], a,v,S,b),ss) body of

  1036 	   Assoc iss => Assoc iss

  1037 	 | NasApp iss => astep_up ys iss

  1038 	 | NasNap (v, E) => astep_up ys ((E,l,a,v,S,b),ss) end

  1040   | ass_up ys (iss as (is,_)) (Abs (_,_,_)) =

  1041     ((*tracing("### ass_up  Abs: is=");

  1042      tracing(istate2str (ScrState is));*)

  1043      astep_up ys iss) (*TODO 5.9.00: env ?*)

  1045   | ass_up ys (iss as (is,_)) (Const ("HOL.Let",_) $ e $ (Abs (i,T,b)))=

  1046     ((*tracing("### ass_up Let $ e $ Abs: is=");

  1047      tracing(istate2str (ScrState is));*)

  1048      astep_up ys iss) (*TODO 5.9.00: env ?*)

  1050     (* val (ysa, iss,                 (Const ("Script.Seq",_) $ _ $ _ $ _)) =

  1051 	   (ys,  ((E,up,a,v,S,b),ss), (go up sc));

  1052        *)

  1053   | ass_up ysa iss (Const ("Script.Seq",_) $ _ $ _ $ _) =

  1054     astep_up ysa iss (*all has been done in (*2*) below*)

  1056   | ass_up ysa iss (Const ("Script.Seq",_) $ _ $ _) =

  1057     (* val (ysa, iss,                 (Const ("Script.Seq",_) $ _ $ _)) =

  1058 	   (ys,  ((E,up,a,v,S,b),ss), (go up sc));

  1059        *)

  1060     astep_up ysa iss (*2*: comes from e2*)

  1062   | ass_up (ysa as (y,s,Script sc,d)) (is as (E,l,a,v,S,b),ss)

  1063 	   (Const ("Script.Seq",_) $ _ ) = (*2*: comes from e1, goes to e2*)

  1064 	   (* val ((ysa as (y,s,Script sc,d)), (is as (E,l,a,v,S,b),ss),

  1065 	                                  (Const ("Script.Seq",_) $ _ )) =

  1066 		  (ys,   ((E,up,a,v,S,b),ss), (go up sc));

  1067 	      *)

  1068     let val up = drop_last l;

  1069 	val Const ("Script.Seq",_) $ _ $ e2 = go up sc

  1070 	(*val _= tracing("### ass_up Seq$e: is=")

  1071 	val _= tracing(istate2str (ScrState is))*)

  1072     in case assy (((y,s),d),Aundef) ((E, up@[R], a,v,S,b),ss) e2 of

  1073 	   NasNap (v,E) => astep_up ysa ((E,up,a,v,S,b),ss)

  1074 	 | NasApp iss => astep_up ysa iss

  1075 	 | ay => ay end

  1077     (* val (ysa, iss,                 (Const ("Script.Try",_) $ e $ _)) =

  1078 	   (ys,  ((E,up,a,v,S,b),ss), (go up sc));

  1079        *)

  1080   | ass_up ysa iss (Const ("Script.Try",_) $ e $ _) =

  1081     astep_up ysa iss

  1083   (* val (ysa, iss, (Const ("Script.Try",_) $ e)) =

  1084 	 (ys,  ((E,up,a,v,S,b),ss), (go up sc));

  1085      *)

  1086   | ass_up ysa iss (Const ("Script.Try",_) $ e) =

  1087     ((*tracing("### ass_up Try $ e");*)

  1088      astep_up ysa iss)

  1090   | ass_up (ys as (y,s,_,d)) ((E,l,_,v,S,b),ss)

  1091 	   (*(Const ("Script.While",_) $ c $ e $ a) = WN050930 blind fix*)

  1092 	   (t as Const ("Script.While",_) $ c $ e $ a) =

  1093     ((*tracing("### ass_up: While c= "^

  1094 	     (term2str (subst_atomic (upd_env E (a,v)) c)));*)

  1095      if eval_true_ y s (subst_atomic (upd_env E (a,v)) c)

  1096     then (case assy (((y,s),d),Aundef) ((E, l@[L,R], SOME a,v,S,b),ss) e of

  1097        NasNap (v,E') => astep_up ys ((E',l, SOME a,v,S,b),ss)

  1098      | NasApp ((E',l,a,v,S,b),ss) =>

  1099        ass_up ys ((E',l,a,v,S,b),ss) t (*WN050930 't' was not assigned*)

  1100      | ay => ay)

  1101     else astep_up ys ((E,l, SOME a,v,S,b),ss)

  1102 	 )

  1104   | ass_up (ys as (y,s,_,d)) ((E,l,a,v,S,b),ss)

  1105 	   (*(Const ("Script.While",_) $ c $ e) = WN050930 blind fix*)

  1106 	   (t as Const ("Script.While",_) $ c $ e) =

  1107     if eval_true_ y s (subst_atomic (upd_env_opt E (a,v)) c)

  1108     then (case assy (((y,s),d),Aundef) ((E, l@[R], a,v,S,b),ss) e of

  1109        NasNap (v,E') => astep_up ys ((E',l, a,v,S,b),ss)

  1110      | NasApp ((E',l,a,v,S,b),ss) =>

  1111        ass_up ys ((E',l,a,v,S,b),ss) t (*WN050930 't' was not assigned*)

  1112      | ay => ay)

  1113     else astep_up ys ((E,l, a,v,S,b),ss)

  1115   | ass_up y iss (Const ("If",_) $ _ $ _ $ _) = astep_up y iss

  1117   | ass_up (ys as (y,s,_,d)) ((E,l,_,v,S,b),ss)

  1118 	   (t as Const ("Script.Repeat",_) $ e $ a) =

  1119   (case assy (((y,s),d), Aundef) ((E, (l@[L,R]), SOME a,v,S,b),ss) e of

  1120        NasNap (v,E') => astep_up ys ((E',l, SOME a,v,S,b),ss)

  1121      | NasApp ((E',l,a,v,S,b),ss) =>

  1122        ass_up ys ((E',l,a,v,S,b),ss) t

  1123      | ay => ay)

  1125   | ass_up (ys as (y,s,_,d)) (is as ((E,l,a,v,S,b),ss))

  1126 	   (t as Const ("Script.Repeat",_) $ e) =

  1127   (case assy (((y,s),d), Aundef) ((E, (l@[R]), a,v,S,b),ss) e of

  1128        NasNap (v', E') => astep_up ys ((E',l,a,v',S,b),ss)

  1129      | NasApp ((E',l,a,v',S,bb),ss) =>

  1130        ass_up ys ((E',l,a,v',S,b),ss) t

  1131      | ay => ay)

  1133   | ass_up y iss (Const ("Script.Or",_) $ _ $ _ $ _) = astep_up y iss

  1135   | ass_up y iss (Const ("Script.Or",_) $ _ $ _) = astep_up y iss

  1137   | ass_up y ((E,l,a,v,S,b),ss) (Const ("Script.Or",_) $ _ ) =

  1138     astep_up y ((E, (drop_last l), a,v,S,b),ss)

  1140   | ass_up y iss t =

  1141     error ("ass_up not impl for t= "^(term2str t))

  1142 (* 9.6.03

  1143    val (ys as (_,_,Script sc,_), ss) =

  1144        ((thy',srls,scr,d), [(m,EmptyMout,pt,p,[])]:step list);

  1145    astep_up ys ((E,l,a,v,S,b),ss);

  1146    val ((ys as (_,_,Script sc,_)), ((E,l,a,v,S,b),ss)) =

  1147        (ysa, iss);

  1148    val ((ys as (_,_,Script sc,_)), ((E,l,a,v,S,b),ss)) =

  1149        ((thy',srls,scr,d), ((E,l,a,v,S,b), [(m,EmptyMout,pt,p,[])]));

  1150    *)

  1151 and astep_up (ys as (_,_,Script sc,_)) ((E,l,a,v,S,b),ss) =

  1152   if 1 < length l

  1153     then

  1154       let val up = drop_last l;

  1155 	  (*val _= tracing("### astep_up: E= "^env2str E);*)

  1156       in ass_up ys ((E,up,a,v,S,b),ss) (go up sc) end

  1157   else (NasNap (v, E))

  1158 ;

  1164 (* use"ME/script.sml";

  1165    use"script.sml";

  1166  term2str (go up sc);

  1168    *)

  1170 (*check if there are tacs for rewriting only*)

  1171 fun rew_only ([]:step list) = true

  1172   | rew_only (((Rewrite' _          ,_,_,_,_))::ss) = rew_only ss

  1173   | rew_only (((Rewrite_Inst' _     ,_,_,_,_))::ss) = rew_only ss

  1174   | rew_only (((Rewrite_Set' _      ,_,_,_,_))::ss) = rew_only ss

  1175   | rew_only (((Rewrite_Set_Inst' _ ,_,_,_,_))::ss) = rew_only ss

  1176   | rew_only (((Calculate' _        ,_,_,_,_))::ss) = rew_only ss

  1177   | rew_only (((Begin_Trans' _      ,_,_,_,_))::ss) = rew_only ss

  1178   | rew_only (((End_Trans' _        ,_,_,_,_))::ss) = rew_only ss

  1179   | rew_only _ = false;

  1182 datatype locate =

  1183   Steps of istate      (*producing hd of step list (which was latest)

  1184 	                 for next_tac, for reporting Safe|Unsafe to DG*)

  1185 	   * step      (*(scrstate producing this step is in ptree !)*)

  1186 		 list  (*locate_gen may produce intermediate steps*)

  1187 | NotLocatable;        (*no (m Ass m') or (m AssWeak m') found*)

  1191 (* locate_gen tries to locate an input tac m in the script.

  1192    pursuing this goal the script is executed until an (m' equiv m) is found,

  1193    or the end of the script

  1194 args

  1195    m   : input by the user, already checked by applicable_in,

  1196          (to be searched within Or; and _not_ an m doing the step on ptree !)

  1197    p,pt: (incl ets) at the time of input

  1198    scr : the script

  1199    d   : canonical simplifier for locating Take, Substitute, Subproblems etc.

  1200    ets : ets at the time of input

  1201    l   : the location (in scr) of the stac which generated the current formula

  1202 returns

  1203    Steps: pt,p (incl. ets) with m done

  1204           pos' list of proofobjs cut (from generate)

  1205           safe: implied from last proofobj

  1206 	  ets:

  1207    ///ToDo : ets contains a list of tacs to be done before m can be done

  1208           NOT IMPL. -- "error: do other step before"

  1209    NotLocatable: thus generate_hard

  1210 *)

  1211 fun locate_gen (thy',_) (Rewrite'(_,ro,er,pa,(id,str),f,_)) (pt,p)

  1212 	  (Rfuns {locate_rule=lo,...}, d) (RrlsState (_,f'',rss,rts), ctxt) =

  1213       (case lo rss f (Thm (id, mk_thm (assoc_thy thy') str)) of

  1214 	       [] => NotLocatable

  1215        | rts' =>

  1216 	         Steps (rts2steps [] ((pt,p),(f,f'',rss,rts),(thy',ro,er,pa)) rts'))

  1218   | locate_gen (ts as (thy',srls)) (m:tac_) ((pt,p):ptree * pos')

  1219 	  (scr as Script (h $ body),d) (ScrState (E,l,a,v,S,b), ctxt)  =

  1220       let val thy = assoc_thy thy';

  1221       in

  1222         case if l = [] orelse ((*init.in solve..Apply_Method...*)

  1223 			         (last_elem o fst) p = 0 andalso snd p = Res)

  1224 	           then (assy ((ts,d),Aundef) ((E,[R],a,v,S,b), [(m,EmptyMout,pt,p,[])]) body)

  1225 	           else (astep_up (thy',srls,scr,d) ((E,l,a,v,S,b), [(m,EmptyMout,pt,p,[])]) ) of

  1226 	        Assoc (iss as (is as (_,_,_,_,_,bb), ss as ((m',f',pt',p',c')::_))) =>

  1227 	          (if bb

  1228              then Steps (ScrState is, ss)

  1229 	           else

  1230                if rew_only ss (*andalso 'not bb'= associated weakly*)

  1231 	             then

  1232                  let

  1233                    val (po,p_) = p

  1234                    val po' = case p_ of Frm => po | Res => lev_on po

  1235                    val (p'',c'',f'',pt'') =

  1236 		                 generate1 thy m (ScrState is, ctxt) (po',p_) pt;

  1237 	               in Steps (ScrState is, [(m, f'',pt'',p'',c'')]) end

  1238 	             else Steps (ScrState is, ss))

  1240         | NasApp _ => NotLocatable

  1241       end

  1243   | locate_gen _ m _ (sc,_) (is, _) =

  1244       error ("locate_gen: wrong arguments,\n tac= " ^ tac_2str m ^ ",\n " ^

  1245 		    "scr= " ^ scr2str sc ^ ",\n istate= " ^ istate2str is);

  1247 (** find the next stactic in a script **)

  1249 datatype appy =  (*ExprVal in the sense of denotational semantics*)

  1250     Appy of      (*applicable stac found, search stalled*)

  1251     tac_ *       (*tac_ associated (fun assod) with stac*)

  1252     scrstate     (*after determination of stac WN.18.8.03*)

  1253   | Napp of      (*stac found was not applicable;

  1254 	           this mode may become Skip in Repeat, Try and Or*)

  1255     env (*stack*)  (*popped while nxt_up*)

  1256   | Skip of      (*for restart after Appy, for leaving iterations,

  1257 	           for passing the value of scriptexpressions,

  1258 		   and for finishing the script successfully*)

  1259     term * env (*stack*);

  1261 (*appy, nxt_up, nstep_up scanning for next_tac.

  1262   search is clearly separated into (1)-(2):

  1263   (1) appy is recursive descent;

  1264   (2) nxt_up resumes interpretation at a location somewhere in the script;

  1265       nstep_up does only get to the parentnode of the scriptexpr.

  1266   consequence:

  1267   * call of (2) means _always_ that in this branch below

  1268     there was an applicable stac (Repeat, Or e1, ...)

  1269 *)

  1272 datatype appy_ = (*as argument in nxt_up, nstep_up, from appy*)

  1273   (* Appy          is only (final) returnvalue, not argument during search *)

  1274      Napp_       (*ev. detects 'script is not appropriate for this example'*)

  1275    | Skip_;      (*detects 'script successfully finished'

  1276 		               also used as init-value for resuming; this works,

  1277 	                 because 'nxt_up Or e1' treats as Appy*)

  1279 fun appy thy ptp E l (t as Const ("HOL.Let",_) $ e $ (Abs (i,T,b))) a v =

  1280       (case appy thy ptp E (l@[L,R]) e a v of

  1281          Skip (res, E) =>

  1282            let val E' = upd_env E (Free (i,T), res);

  1283            in appy thy ptp E' (l@[R,D]) b a v end

  1284        | ay => ay)

  1286   | appy (thy as (th,sr)) ptp E l (t as Const ("Script.While"(*1*),_) $ c $ e $ a) _ v =

  1287       (if eval_true_ th sr (subst_atomic (upd_env E (a,v)) c)

  1288        then appy thy ptp E (l@[L,R]) e (SOME a) v

  1289        else Skip (v, E))

  1291   | appy (thy as (th,sr)) ptp E l (t as Const ("Script.While"(*2*),_) $ c $ e) a v =

  1292       (if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)

  1293        then appy thy ptp E (l@[R]) e a v

  1294        else Skip (v, E))

  1296   | appy (thy as (th,sr)) ptp E l (t as Const ("If",_) $ c $ e1 $ e2) a v =

  1297       (if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)

  1298        then ((*tracing("### appy If: true");*)appy thy ptp E (l@[L,R]) e1 a v)

  1299        else ((*tracing("### appy If: false");*)appy thy ptp E (l@[  R]) e2 a v))

  1301   | appy thy ptp E l (Const ("Script.Repeat"(*1*),_) $ e $ a) _ v =

  1302       (appy thy ptp E (l@[L,R]) e (SOME a) v)

  1304   | appy thy ptp E l (Const ("Script.Repeat"(*2*),_) $ e) a v =

  1305       (appy thy ptp E (l@[R]) e a v)

  1307   | appy thy ptp E l (t as Const ("Script.Try",_) $ e $ a) _ v =

  1308      (case appy thy ptp E (l@[L,R]) e (SOME a) v of

  1309         Napp E => (Skip (v, E))

  1310       | ay => ay)

  1312   | appy thy ptp E l(t as Const ("Script.Try",_) $ e) a v =

  1313      (case appy thy ptp E (l@[R]) e a v of

  1314         Napp E => (Skip (v, E))

  1315       | ay => ay)

  1317   | appy thy ptp E l (Const ("Script.Or"(*1*),_) $e1 $ e2 $ a) _ v =

  1318      (case appy thy ptp E (l@[L,L,R]) e1 (SOME a) v of

  1319 	      Appy lme => Appy lme

  1320       | _ => appy thy ptp E (*env*) (l@[L,R]) e2 (SOME a) v)

  1322   | appy thy ptp E l (Const ("Script.Or"(*2*),_) $e1 $ e2) a v =

  1323       (case appy thy ptp E (l@[L,R]) e1 a v of

  1324 	       Appy lme => Appy lme

  1325        | _ => appy thy ptp E (l@[R]) e2 a v)

  1327   | appy thy ptp E l (Const ("Script.Seq"(*1*),_) $ e1 $ e2 $ a) _ v =

  1328       (case appy thy ptp E (l@[L,L,R]) e1 (SOME a) v of

  1329 	       Skip (v,E) => appy thy ptp E (l@[L,R]) e2 (SOME a) v

  1330        | ay => ay)

  1332   | appy thy ptp E l (Const ("Script.Seq",_) $ e1 $ e2) a v =

  1333       (case appy thy ptp E (l@[L,R]) e1 a v of

  1334 	       Skip (v,E) => appy thy ptp E (l@[R]) e2 a v

  1335        | ay => ay)

  1337   (* a leaf has been found *)

  1338   | appy (thy as (th,sr)) (pt, p) E l t a v =

  1339       (case handle_leaf "next  " th sr E a v t of

  1340 	       (a', Expr s) => Skip (s, E)

  1341        | (a', STac stac) =>

  1342 	         let val (m,m') = stac2tac_ pt (assoc_thy th) stac

  1343            in

  1344              case m of

  1345 	             Subproblem _ => Appy (m', (E,l,a',tac_2res m',Sundef,false))

  1346 	           | _ =>

  1347                (case applicable_in p pt m of

  1348 			            Appl m' => (Appy (m', (E,l,a',tac_2res m',Sundef,false)))

  1349 		         | _ => ((*tracing("### appy: Napp");*)Napp E))

  1350 	         end);

  1352 fun nxt_up thy ptp (scr as (Script sc)) E l ay

  1353     (t as Const ("HOL.Let",_) $ _) a v = (*comes from let=...*)

  1354        (if ay = Napp_

  1355         then nstep_up thy ptp scr E (drop_last l) Napp_ a v

  1356         else (*Skip_*)

  1357 	        let

  1358             val up = drop_last l;

  1359 	          val (Const ("HOL.Let",_) $ e $ (Abs (i,T,body))) = go up sc;

  1360             val i = mk_Free (i, T);

  1361             val E = upd_env E (i, v);

  1362           in

  1363             case appy thy ptp E (up@[R,D]) body a v  of

  1364 	            Appy lre => Appy lre

  1365 	          | Napp E => nstep_up thy ptp scr E up Napp_ a v

  1366 	          | Skip (v,E) => nstep_up thy ptp scr E up Skip_ a v end)

  1368   | nxt_up thy ptp scr E l ay

  1369     (t as Abs (_,_,_)) a v =

  1370     ((*tracing("### nxt_up Abs: " ^ term2str t);*)

  1371      nstep_up thy ptp scr E (*enr*) l ay a v)

  1373   | nxt_up thy ptp scr E l ay

  1374     (t as Const ("HOL.Let",_) $ e $ (Abs (i,T,b))) a v =

  1375     ((*tracing("### nxt_up Let$e$Abs: is=");

  1376      tracing(istate2str (ScrState (E,l,a,v,Sundef,false)));*)

  1377      (*tracing("### nxt_up Let e Abs: " ^ term2str t);*)

  1378      nstep_up thy ptp scr (*upd_env*) E (*a,v)*)

  1379 	      (*eno,upd_env env (iar,res),iar,res,saf*) l ay a v)

  1381   (*no appy_: never causes Napp -> Helpless*)

  1382   | nxt_up (thy as (th,sr)) ptp scr E l _

  1383   (Const ("Script.While"(*1*),_) $ c $ e $ _) a v =

  1384   if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)

  1385     then case appy thy ptp E (l@[L,R]) e a v of

  1386 	     Appy lr => Appy lr

  1387 	   | Napp E => nstep_up thy ptp scr E l Skip_ a v

  1388 	   | Skip (v,E) => nstep_up thy ptp scr E l Skip_ a v

  1389   else nstep_up thy ptp scr E l Skip_ a v

  1391   (*no appy_: never causes Napp - Helpless*)

  1392   | nxt_up (thy as (th,sr)) ptp scr E l _

  1393   (Const ("Script.While"(*2*),_) $ c $ e) a v =

  1394   if eval_true_ th sr (subst_atomic (upd_env_opt E (a,v)) c)

  1395     then case appy thy ptp E (l@[R]) e a v of

  1396 	     Appy lr => Appy lr

  1397 	   | Napp E => nstep_up thy ptp scr E l Skip_ a v

  1398 	   | Skip (v,E) => nstep_up thy ptp scr E l Skip_ a v

  1399   else nstep_up thy ptp scr E l Skip_ a v

  1401 (* val (scr, l) = (Script sc, up);

  1402    *)

  1403   | nxt_up thy ptp scr E l ay (Const ("If",_) $ _ $ _ $ _) a v =

  1404     nstep_up thy ptp scr E l ay a v

  1406   | nxt_up thy ptp scr E l _ (*no appy_: there was already a stac below*)

  1407   (Const ("Script.Repeat"(*1*),T) $ e $ _) a v =

  1408     (case appy thy ptp (*upd_env*) E (*a,v)*) ((l@[L,R]):loc_) e a v  of

  1409       Appy lr => Appy lr

  1410     | Napp E => ((*tracing("### nxt_up Repeat a: ");*)

  1411 		 nstep_up thy ptp scr E l Skip_ a v)

  1412     | Skip (v,E) => ((*tracing("### nxt_up Repeat: Skip res ="^

  1413 		(Sign.string_of_term(sign_of (assoc_thy thy)) res'));*)

  1414 		    nstep_up thy ptp scr E l Skip_ a v))

  1416   | nxt_up thy ptp scr E l _ (*no appy_: there was already a stac below*)

  1417   (Const ("Script.Repeat"(*2*),T) $ e) a v =

  1418     (case appy thy ptp (*upd_env*) E (*a,v)*) ((l@[R]):loc_) e a v  of

  1419       Appy lr => Appy lr

  1420     | Napp E => ((*tracing("### nxt_up Repeat a: ");*)

  1421 		 nstep_up thy ptp scr E l Skip_ a v)

  1422     | Skip (v,E) => ((*tracing("### nxt_up Repeat: Skip res ="^

  1423 		(Sign.string_of_term(sign_of (assoc_thy thy)) res'));*)

  1424 		    nstep_up thy ptp scr E l Skip_ a v))

  1425 (* val (thy, ptp, scr, E, l,   _,(t as Const ("Script.Try",_) $ e $ _), a, v) =

  1426        (thy, ptp, (Script sc),

  1427 	               E, up, ay,(go up sc),                            a, v);

  1428    *)

  1429   | nxt_up thy ptp scr E l _ (*makes Napp to Skip*)

  1430   (t as Const ("Script.Try",_) $ e $ _) a v =

  1431     ((*tracing("### nxt_up Try " ^ term2str t);*)

  1432      nstep_up thy ptp scr E l Skip_ a v )

  1433 (* val (thy, ptp, scr, E, l,   _,(t as Const ("Script.Try",_) $ e), a, v) =

  1434        (thy, ptp, (Script sc),

  1435 	               E, up, ay,(go up sc),                        a, v);

  1436    *)

  1437   | nxt_up thy ptp scr E l _ (*makes Napp to Skip*)

  1438   (t as Const ("Script.Try"(*2*),_) $ e) a v =

  1439     ((*tracing("### nxt_up Try " ^ term2str t);*)

  1440      nstep_up thy ptp scr E l Skip_ a v)

  1443   | nxt_up thy ptp scr E l ay

  1444   (Const ("Script.Or",_) $ _ $ _ $ _) a v = nstep_up thy ptp scr E l ay a v

  1446   | nxt_up thy ptp scr E l ay

  1447   (Const ("Script.Or",_) $ _ $ _) a v = nstep_up thy ptp scr E l ay a v

  1449   | nxt_up thy ptp scr E l ay

  1450   (Const ("Script.Or",_) $ _ ) a v =

  1451     nstep_up thy ptp scr E (drop_last l) ay a v

  1452 (* val (thy, ptp, scr, E, l, ay, (Const ("Script.Seq",_) $ _ $ _ $ _), a, v) =

  1453        (thy, ptp, (Script sc),

  1454 		       E, up, ay,(go up sc),                           a, v);

  1455    *)

  1456   | nxt_up thy ptp scr E l ay (*all has been done in (*2*) below*)

  1457   (Const ("Script.Seq"(*1*),_) $ _ $ _ $ _) a v =

  1458     nstep_up thy ptp scr E l ay a v

  1459 (* val (thy, ptp, scr, E, l, ay, (Const ("Script.Seq",_) $ _ $ e2), a, v) =

  1460        (thy, ptp, (Script sc),

  1461 		       E, up, ay,(go up sc),                        a, v);

  1462    *)

  1463   | nxt_up thy ptp scr E l ay (*comes from e2*)

  1464 	   (Const ("Script.Seq"(*2*),_) $ _ $ e2) a v =

  1465     nstep_up thy ptp scr E l ay a v

  1466 (* val (thy, ptp, scr, E, l, ay, (Const ("Script.Seq",_) $ _), a, v) =

  1467        (thy, ptp, (Script sc),

  1468 		       E, up, ay,(go up sc),                   a, v);

  1469    *)

  1470   | nxt_up thy ptp (scr as Script sc) E l ay (*comes from e1*)

  1471 	   (Const ("Script.Seq",_) $ _) a v =

  1472     if ay = Napp_

  1473     then nstep_up thy ptp scr E (drop_last l) Napp_ a v

  1474     else (*Skip_*)

  1475 	let val up = drop_last l;

  1476 	    val Const ("Script.Seq"(*2*),_) $ _ $ e2 = go up sc;

  1477 	in case appy thy ptp E (up@[R]) e2 a v  of

  1478 	    Appy lr => Appy lr

  1479 	  | Napp E => nstep_up thy ptp scr E up Napp_ a v

  1480 	  | Skip (v,E) => nstep_up thy ptp scr E up Skip_ a v end

  1482   | nxt_up (thy,_) ptp scr E l ay t a v =

  1483     error ("nxt_up not impl for " ^ term2str t)

  1485 (* val (thy, ptp, (Script sc), E, l, ay,    a, v)=

  1486        (thy, ptp, scr,         E, l, Skip_, a, v);

  1487    val (thy, ptp, (Script sc), E, l, ay,    a, v)=

  1488        (thy, ptp, sc,          E, l, Skip_, a, v);

  1489    *)

  1490 and nstep_up thy ptp (Script sc) E l ay a v =

  1491   (if 1 < length l

  1492    then

  1493      let val up = drop_last l;

  1494      in (nxt_up thy ptp (Script sc) E up ay (go up sc) a v ) end

  1495    else (*interpreted to end*)

  1496      if ay = Skip_ then Skip (v, E) else Napp E

  1497 );

  1499 (* decide for the next applicable stac in the script;

  1500    returns (stactic, value) - the value in case the script is finished

  1501    12.8.02:         ~~~~~ and no assumptions ??? FIXME ???

  1502    20.8.02: must return p in case of finished, because the next script

  1503             consulted need not be the calling script:

  1504             in case of detail ie. _inserted_ PrfObjs, the next stac

  1505             has to searched in a script with PblObj.status<>Complete !

  1506             (.. not true for other details ..PrfObj ??????????????????

  1507    20.8.02: do NOT return safe (is only changed in locate !!!)

  1508 *)

  1509 fun next_tac (thy,_) (pt,p) (Rfuns {next_rule,...}) (RrlsState(f,f',rss,_), ctxt) =

  1510       let val ctxt = get_ctxt pt p

  1511       in

  1512         if f = f'

  1513         then (End_Detail' (f',[])(*8.6.03*), (Uistate, ctxt),

  1514   		    (f', Sundef(*FIXME is no value of next_tac! vor 8.6.03*)))  (*finished*)

  1515         else

  1516           (case next_rule rss f of

  1517   	         NONE => (Empty_Tac_, (Uistate, ctxt), (e_term, Sundef))  (*helpless*)

  1518   	       | SOME (Thm (id,thm))(*8.6.03: muss auch f' liefern ?!!*) =>

  1519   	          (Rewrite' (thy, "e_rew_ord", e_rls,(*!?!8.6.03*) false,

  1520   			       (id, string_of_thmI thm), f,(e_term,[(*!?!8.6.03*)])),

  1521   	           (Uistate, ctxt), (e_term, Sundef)))                    (*next stac*)

  1522       end

  1524   | next_tac thy (ptp as (pt, pos as (p, _)):ptree * pos') (sc as Script (h $ body))

  1525 	  (ScrState (E,l,a,v,s,b), ctxt) =

  1526       let val ctxt = get_ctxt pt pos (*WN110518 we have ctxt twice -- redesign*)

  1527       in

  1528         (case if l = []

  1529               then appy thy ptp E [R] body NONE v

  1530               else nstep_up thy ptp sc E l Skip_ a v of

  1531             Skip (v, _) =>                                            (*finished*)

  1532               (case par_pbl_det pt p of

  1533 	               (true, p', _) =>

  1534 	                  let val (_,pblID,_) = get_obj g_spec pt p';

  1535 	                  in (Check_Postcond' (pblID, (v, [(*assigned in next step*)])),

  1536 	                    (e_istate, ctxt), (v,s))

  1537                     end

  1538 	             | (_, p', rls') =>

  1539                    (End_Detail' (e_term,[])(*8.6.03*), (e_istate, ctxt), (v,s)))

  1540          | Napp _ => (Empty_Tac_, (e_istate, ctxt), (e_term, Sundef)) (*helpless*)

  1541          | Appy (m', scrst as (_,_,_,v,_,_)) =>

  1542              (m', (ScrState scrst, ctxt), (v, Sundef)))               (*next stac*)

  1543       end

  1545   | next_tac _ _ _ (is, _) = error ("next_tac: not impl for " ^ (istate2str is));

  1548 (*.create the initial interpreter state from the items of the guard.*)

  1549 fun init_scrstate thy itms metID =

  1550   let

  1551     val actuals = itms2args thy metID itms

  1552 	  val scr as Script sc = (#scr o get_met) metID

  1553     val formals = formal_args sc

  1554 	  (*expects same sequence of (actual) args in itms and (formal) args in met*)

  1555 	  fun relate_args env [] [] = env

  1556 	    | relate_args env _ [] =

  1557 	        error ("ERROR in creating the environment for '" ^

  1558 			    id_of_scr sc ^ "' from \nthe items of the guard of " ^

  1559 			    metID2str metID ^ ",\n" ^

  1560 			    "formal arg(s), from the script, miss actual arg(s), from the guards env:\n" ^

  1561 			    (string_of_int o length) formals ^

  1562 			    " formals: " ^ terms2str formals ^ "\n" ^

  1563 			    (string_of_int o length) actuals ^

  1564 			    " actuals: " ^ terms2str actuals)

  1565 	    | relate_args env [] actual_finds = env (*may drop Find!*)

  1566 	    | relate_args env (a::aa) (f::ff) =

  1567 	        if type_of a = type_of f

  1568 	        then relate_args (env @ [(a, f)]) aa ff

  1569           else

  1570 	          error ("ERROR in creating the environment for '" ^

  1571 			      id_of_scr sc ^ "' from \nthe items of the guard of " ^

  1572 			      metID2str metID ^ ",\n" ^

  1573 			      "different types of formal arg, from the script, " ^

  1574 			      "and actual arg, from the guards env:'\n" ^

  1575 			      "formal: '" ^ term2str a ^ "::" ^ (type2str o type_of) a ^ "'\n" ^

  1576 			      "actual: '" ^ term2str f ^ "::" ^ (type2str o type_of) f ^ "'\n" ^

  1577 			      "in\n" ^

  1578 			      "formals: " ^ terms2str formals ^ "\n" ^

  1579 			      "actuals: " ^ terms2str actuals)

  1580      val env = relate_args [] formals actuals;

  1581      val ctxt = ProofContext.init_global thy |> declare_constraints' actuals

  1582      val {pre, prls, ...} = get_met metID;

  1583      val pres = check_preconds thy prls pre itms |> map snd;

  1584      val ctxt = ctxt |> insert_assumptions pres;

  1585    in (ScrState (env,[],NONE,e_term,Safe,true), ctxt, scr):istate * Proof.context * scr end;

  1587 (* decide, where to get script/istate from:

  1588    (*1*) from PblObj.env: at begin of script if no init_form

  1589    (*2*) from PblObj/PrfObj: if stac is in the middle of the script

  1590    (*3*) from rls/PrfObj: in case of detail a ruleset *)

  1591 fun from_pblobj_or_detail' thy' (p,p_) pt =

  1592   let val ctxt = get_ctxt pt (p,p_)

  1593   in

  1594     if member op = [Pbl,Met] p_

  1595     then case get_obj g_env pt p of

  1596   	       NONE => error "from_pblobj_or_detail': no istate"

  1597   	     | SOME is =>

  1598   	         let

  1599                val metID = get_obj g_metID pt p

  1600   		         val {srls,...} = get_met metID

  1601   	         in (srls, is, (#scr o get_met) metID) end

  1602     else

  1603       let val (pbl,p',rls') = par_pbl_det pt p

  1604       in if pbl

  1605          then                                                    (*2*)

  1606   	       let

  1607              val thy = assoc_thy thy'

  1608   	         val PblObj{meth=itms,...} = get_obj I pt p'

  1609 	           val metID = get_obj g_metID pt p'

  1610 	           val {srls,...} = get_met metID

  1611 	         in (*if last_elem p = 0 nothing written to pt yet*)

  1612 	           (srls, get_loc pt (p,p_), (#scr o get_met) metID)

  1613 	         end

  1614          else                                                    (*3*)

  1615 	         (e_rls, (*FIXME.WN0?: get from pbl or met !!! unused for Rrls in locate_gen, next_tac*)

  1616 	          get_loc pt (p,p_),

  1617 	            case rls' of

  1618 	  	          Rls {scr=scr,...} => scr

  1619 	            | Seq {scr=scr,...} => scr

  1620 	            | Rrls {scr=rfuns,...} => rfuns)

  1621       end

  1622   end;

  1624 (*.get script and istate from PblObj, see                        (*1*) above.*)

  1625 fun from_pblobj' thy' (p,p_) pt =

  1626   let

  1627     val p' = par_pblobj pt p

  1628 	  val thy = assoc_thy thy'

  1629 	  val PblObj {meth=itms, ...} = get_obj I pt p'

  1630 	  val metID = get_obj g_metID pt p'

  1631 	  val {srls,scr,...} = get_met metID

  1632   in

  1633     if last_elem p = 0 (*nothing written to pt yet*)

  1634     then

  1635        let val (is, ctxt, scr) = init_scrstate thy itms metID

  1636 	     in (srls, (is, ctxt), scr) end

  1637        else (srls, get_loc pt (p,p_), scr)

  1638     end;

  1640 (*.get the stactics and problems of a script as tacs

  1641   instantiated with the current environment;

  1642   l is the location which generated the given formula.*)

  1643 (*WN.12.5.03: quick-and-dirty repair for listexpressions*)

  1644 fun is_spec_pos Pbl = true

  1645   | is_spec_pos Met = true

  1646   | is_spec_pos _ = false;

  1648 (*. fetch _all_ tactics from script .*)

  1649 fun sel_rules _ (([],Res):pos') =

  1650     raise PTREE "no tactics applicable at the end of a calculation"

  1651 | sel_rules pt (p,p_) =

  1652   if is_spec_pos p_

  1653   then [get_obj g_tac pt p]

  1654   else

  1655     let val pp = par_pblobj pt p;

  1656 	val thy' = (get_obj g_domID pt pp):theory';

  1657 	val thy = assoc_thy thy';

  1658 	val metID = get_obj g_metID pt pp;

  1659 	val metID' =if metID =e_metID then(thd3 o snd3)(get_obj g_origin pt pp)

  1660 		     else metID

  1661 	val {scr=Script sc,srls,...} = get_met metID'

  1662 	val ScrState (env,_,a,v,_,_) = get_istate pt (p,p_);

  1663     in map ((stac2tac pt thy) o rep_stacexpr o #2 o

  1664 	    (handle_leaf "selrul" thy' srls env a v)) (stacpbls sc) end;

  1665 (*

  1666 > val Script sc = (#scr o get_met) ("SqRoot","sqrt-equ-test");

  1667 > val env = [((term_of o the o (parse (Thy_Info.get_theory "Isac"))) "bdv",

  1668              (term_of o the o (parse (Thy_Info.get_theory "Isac"))) "x")];

  1669 > map ((stac2tac pt thy) o #2 o(subst_stacexpr env NONE e_term)) (stacpbls sc);

  1670 *)

  1673 (*. fetch tactics from script and filter _applicable_ tactics;

  1674     in case of Rewrite_Set* go down to _atomic_ rewrite-tactics .*)

  1675 fun sel_appl_atomic_tacs _ (([],Res):pos') =

  1676     raise PTREE "no tactics applicable at the end of a calculation"

  1677   | sel_appl_atomic_tacs pt (p,p_) =

  1678     if is_spec_pos p_

  1679     then [get_obj g_tac pt p]

  1680     else

  1681 	let val pp = par_pblobj pt p

  1682 	    val thy' = (get_obj g_domID pt pp):theory'

  1683 	    val thy = assoc_thy thy'

  1684 	    val metID = get_obj g_metID pt pp

  1685 	    val metID' =if metID = e_metID

  1686 			then (thd3 o snd3) (get_obj g_origin pt pp)

  1687 			else metID

  1688 	    val {scr=Script sc,srls,erls,rew_ord'=ro,...} = get_met metID'

  1689 	    val ScrState (env,_,a,v,_,_) = get_istate pt (p,p_)

  1690 	    val alltacs = (*we expect at least 1 stac in a script*)

  1691 		map ((stac2tac pt thy) o rep_stacexpr o #2 o

  1692 		     (handle_leaf "selrul" thy' srls env a v)) (stacpbls sc)

  1693 	    val f = case p_ of

  1694 			Frm => get_obj g_form pt p

  1695 		      | Res => (fst o (get_obj g_result pt)) p

  1696 	(*WN071231 ? replace atomic_appl_tacs with applicable_in (ineff!) ?*)

  1697 	in (distinct o flat o

  1698 	    (map (atomic_appl_tacs thy ro erls f))) alltacs end;

  1701 (*

  1702 end

  1703 open Interpreter;

  1704 *)

  1706 (* use"ME/script.sml";

  1707    use"script.sml";

  1708    *)

author	Walther Neuper <neuper@ist.tugraz.at>
	Thu, 14 Jul 2011 09:33:57 +0200
branch	decompose-isar
changeset 42082	2556b7865f9b
parent 42023	927cb6806af1
child 42092	1a6d6089e594
permissions	-rw-r--r--