src/Tools/isac/Interpret/mathengine.sml
author Walther Neuper <neuper@ist.tugraz.at>
Tue, 01 Jul 2014 16:10:52 +0200
changeset 55471 3b2a8b0d8fa9
parent 42387 767debe8a50c
child 59237 62e72f77e695
permissions -rw-r--r--
CLEANUP
     1 (* The _functional_ mathematics engine, ie. without a state.
     2    Input and output are Isabelle's formulae as strings.
     3    authors: Walther Neuper 2000
     4    (c) due to copyright terms
     5 
     6 use"mathengine.sml";
     7 *)
     8 
     9 signature MATHENGINE =
    10   sig
    11     type nxt_
    12     (* datatype nxt_ = HElpless | Nexts of CalcHead.calcstate *)
    13     type NEW
    14     type lOc_
    15     (*datatype
    16       lOc_ =
    17           ERror of string
    18         | UNsafe of CalcHead.calcstate'
    19         | Updated of CalcHead.calcstate' *)
    20 
    21     val CalcTreeTEST :
    22        fmz list ->
    23        pos' * NEW * mout * (string * tac) * safe * ptree
    24 
    25     val TESTg_form : ptree * (int list * pos_) -> mout
    26     val autocalc :
    27        pos' list ->
    28        pos' ->
    29        (ptree * pos') * taci list ->
    30        auto -> string * pos' list * (ptree * pos')
    31     val detailstep : ptree -> pos' -> string * ptree * pos'
    32    (* val e_tac_ : tac_ *)
    33     val f2str : mout -> cterm'
    34    (* val get_pblID : ptree * pos' -> pblID option *)
    35     val initmatch : ptree -> pos' -> ptform
    36    (* val loc_solve_ :
    37        string * tac_ -> ptree * (int list * pos_) -> lOc_ *)
    38    (* val loc_specify_ : tac_ -> ptree * pos' -> lOc_ *)
    39     val locatetac :     (*tests only*)
    40        tac ->
    41        ptree * (posel list * pos_) ->
    42        string * (taci list * pos' list * (ptree * (posel list * pos_)))
    43     val me :
    44        tac'_ ->
    45        pos' ->
    46        NEW ->
    47        ptree -> pos' * NEW * mout * tac'_ * safe * ptree
    48 
    49     val nxt_specify_ : ptree * (int list * pos_) -> calcstate'(*tests only*)
    50     val set_method : metID -> ptree * pos' -> ptree * ocalhd
    51     val set_problem : pblID -> ptree * pos' -> ptree * ocalhd
    52     val set_theory : thyID -> ptree * pos' -> ptree * ocalhd
    53     val step : pos' -> calcstate -> string * calcstate'
    54     val trymatch : pblID -> ptree -> pos' -> ptform
    55     val tryrefine : pblID -> ptree -> pos' -> ptform
    56   end
    57 
    58 
    59 
    60 (*------------------------------------------------------------------(**)
    61 structure MathEngine : MATHENGINE =
    62 struct
    63 (**)------------------------------------------------------------------*)
    64 
    65 fun get_pblID (pt, (p,_):pos') =
    66     let val p' = par_pblobj pt p
    67 	val (_,pI,_) = get_obj g_spec pt p'
    68 	val (_,(_,oI,_),_) = get_obj g_origin pt p'
    69     in if pI <> e_pblID then SOME pI
    70        else if oI <> e_pblID then SOME oI
    71        else NONE end;
    72 (*fun get_pblID (pt, (p,_):pos') =
    73     ((snd3 o (get_obj g_spec pt)) (par_pblobj pt p));*)
    74 
    75 
    76 (*--vvv--dummies for test*)
    77 val e_tac_ = Tac_ (Pure.thy,"","","");
    78 datatype lOc_ =
    79   ERror of string         (*after loc_specify, loc_solve*)
    80 | UNsafe of calcstate'    (*after loc_specify, loc_solve*)
    81 | Updated of calcstate';   (*after loc_specify, loc_solve*)
    82 fun loc_specify_ m (pt,pos) =
    83 (* val pos = ip;
    84    *)
    85     let val (p,_,f,_,s,pt) = specify m pos [] pt;
    86 (*      val (_,_,_,_,_,pt')= specify m pos [] pt;
    87    *) 
    88    in case f of
    89 	   (Error' (Error_ e)) => ERror e
    90 	 | _ => Updated ([], [], (pt,p)) end;
    91 
    92 (*. TODO push return-value cs' into solve and rename solve->loc_solve?_? .*)
    93 (* val (m, pos) = ((mI,m), ip);
    94    val (m,(pt,pos) ) = ((mI,m), ptp);
    95    *)  
    96 fun loc_solve_ m (pt,pos) =
    97     let val (msg, cs') = solve m (pt, pos);
    98 (* val (tacis,dels,(pt',p')) = cs';
    99    (tracing o istate2str) (get_istate pt' p');
   100    (term2str o fst) (get_obj g_result pt' (fst p'));
   101    *)
   102     in case msg of
   103 	   "ok" => Updated cs' 
   104 	 | msg => ERror msg 
   105     end;
   106 
   107 datatype nxt_ =
   108 	 HElpless  (**)
   109        | Nexts of calcstate; (**)
   110 
   111 (*. locate a tactic in a script and apply it if possible .*)
   112 (*report applicability of tac in tacis; pt is dropped in setNextTactic*)
   113 fun locatetac _ (ptp as (_,([],Res))) = ("end-of-calculation", ([], [], ptp))
   114   | locatetac tac (ptp as (pt, p)) =
   115       let val (mI,m) = mk_tac'_ tac;
   116       in case applicable_in p pt m of
   117 	         Notappl e => ("not-applicable", ([],[],  ptp):calcstate')
   118 	       | Appl m =>
   119 	           let 
   120                val x = if member op = specsteps mI
   121 		             then loc_specify_ m ptp else loc_solve_ (mI,m) ptp
   122 	           in case x of 
   123 		              ERror e => ("failure", ([], [], ptp))
   124 		              (*FIXXXXXME: loc_specify_, loc_solve_ TOGETHER with dropping meOLD+detail.sml*)
   125 		            | UNsafe cs' => ("unsafe-ok", cs')
   126 		            | Updated (cs' as (_,_,(_,p'))) => (*ev.SEVER.tacs like Begin_Trans*)
   127 		                (if p' = ([],Res) then "end-of-calculation" else "ok", cs')
   128                     (*for SEVER.tacs user to ask ? *)
   129 	           end
   130       end;
   131 
   132 (*iterated by nxt_me; there (the resulting) ptp dropped
   133   may call nxt_solve Apply_Method --- thus evaluated here after solve.sml*)
   134 fun nxt_specify_ (ptp as (pt, pos as (p,p_))) =
   135   let val pblobj as (PblObj{meth,origin=origin as (oris,(dI',pI',mI'),_),
   136 			  probl,spec=(dI,pI,mI), ...}) = get_obj I pt p;
   137   in 
   138     if just_created_ pblobj (*by Subproblem*) andalso origin <> e_origin
   139     then 
   140       case mI' of
   141 	      ["no_met"] => nxt_specif (Refine_Tacitly pI') (pt, (p, Pbl))
   142       | _ => nxt_specif Model_Problem (pt, (p,Pbl))
   143     else 
   144       let 
   145         val cpI = if pI = e_pblID then pI' else pI;
   146 		    val cmI = if mI = e_metID then mI' else mI;
   147 		    val {ppc, prls, where_, ...} = get_pbt cpI;
   148 		    val pre = check_preconds "thy 100820" prls where_ probl;
   149 		    val pb = foldl and_ (true, map fst pre);
   150 		    (*FIXME.WN0308:    ~~~~~: just check true in itms of pbl/met?*)
   151 		    val (_,tac) = nxt_spec p_ pb oris (dI',pI',mI') (probl, meth) 
   152 			    (ppc, (#ppc o get_met) cmI) (dI, pI, mI);
   153 	    in case tac of
   154 		       Apply_Method mI => 
   155 		         nxt_solv (Apply_Method' (mI, NONE, e_istate, e_ctxt)) (e_istate, e_ctxt) ptp
   156 		     | _ => nxt_specif tac ptp end
   157    end;
   158 
   159 (*.specify a new method;
   160    WN0512 impl.incomplete, see 'nxt_specif (Specify_Method ' .*)
   161 fun set_method (mI:metID) ptp =
   162     let val ([(_, Specify_Method' (_, _, mits), _)], [], (pt, pos as (p,_))) = 
   163 	    nxt_specif (Specify_Method mI) ptp
   164 	val pre = []        (*...from Specify_Method'*)
   165 	val complete = true (*...from Specify_Method'*)
   166 	(*from Specify_Method'  ? vvv,  vvv ?*)
   167 	val PblObj {origin = (_,_,hdf), spec,...} = get_obj I pt p
   168     in (pt, (complete, Met, hdf, mits, pre, spec):ocalhd) end;
   169 
   170 (*.specify a new problem;
   171    WN0512 impl.incomplete, see 'nxt_specif (Specify_Problem ' .*)
   172 fun set_problem pI (ptp: ptree * pos') =
   173     let val ([(_, Specify_Problem' (_, (complete, (pits, pre))),_)],
   174 	     _, (pt, pos as (p,_))) = nxt_specif (Specify_Problem pI) ptp
   175 	(*from Specify_Problem' ? vvv,  vvv ?*)
   176 	val PblObj {origin = (_,_,hdf), spec,...} = get_obj I pt p
   177     in (pt, (complete, Pbl, hdf, pits, pre, spec):ocalhd) end;
   178 
   179 fun set_theory (tI:thyID) (ptp: ptree * pos') =
   180     let val ([(_, Specify_Problem' (_, (complete, (pits, pre))),_)],
   181 	     _, (pt, pos as (p,_))) = nxt_specif (Specify_Theory tI) ptp
   182 	(*from Specify_Theory'  ? vvv,  vvv ?*)
   183 	val PblObj {origin = (_,_,hdf), spec,...} = get_obj I pt p
   184     in (pt, (complete, Pbl, hdf, pits, pre, spec):ocalhd) end;
   185 
   186 (* does a step forward; returns tactic used, ctree updated.
   187 TODO.WN0512 redesign after specify-phase became more separated from solve-phase *)
   188 fun step ((ip as (_,p_)):pos') ((ptp as (pt,p), tacis):calcstate) =
   189   let val pIopt = get_pblID (pt,ip);
   190   in
   191     if ip = ([],Res)
   192     then ("end-of-calculation", (tacis, [], ptp):calcstate') 
   193     else
   194       case tacis of
   195 	      (_::_) => 
   196           if ip = p (*the request is done where ptp waits for*)
   197 	        then 
   198             let val (pt',c',p') = generate tacis (pt,[],p)
   199 		        in ("ok", (tacis, c', (pt', p'))) end
   200 	        else (case (if member op = [Pbl,Met] p_
   201 		                  then nxt_specify_ (pt,ip) else nxt_solve_ (pt,ip))
   202 		                  handle _ => ([],[],ptp)(*e.g. Add_Given "equality///"*) of
   203 		              cs as ([],_,_) => ("helpless", cs)
   204 		            | cs => ("ok", cs))
   205 	    | _ => (case pIopt of
   206 		            NONE => ("no-fmz-spec", ([], [], ptp))
   207 		          | SOME pI =>
   208 		            (case (if member op = [Pbl,Met] p_
   209 			                   andalso is_none (get_obj g_env pt (fst p))
   210 			                        (*^^^^^^^^: Apply_Method without init_form*)
   211 			                 then nxt_specify_ (pt, ip) 
   212                        else nxt_solve_ (pt,ip) )
   213 			                handle _ => ([],[],ptp)(*e.g.by Add_Giv"equality///"*) of
   214 		               cs as ([],_,_) =>("helpless", cs)(*FIXXMEdel.handle*)
   215 			           | cs => ("ok", cs)))
   216   end;
   217 
   218 (*.does several steps within one calculation as given by "type auto";
   219    the steps may arbitrarily go into and leave different phases, 
   220    i.e. specify-phase and solve-phase.*)
   221 (*TODO.WN0512 ? redesign after the phases have been more separated
   222   at the fron-end in 05: 
   223   eg. CompleteCalcHead could be done by a separate fun !!!*)
   224 fun autocalc c ip (cs as (ptp as (_,p),tacis)) (Step s) =
   225     if s <= 1
   226     then let val (str, (_, c', ptp)) = step ip cs;(*1*)
   227 	 (*at least does 1 step, ev.1 too much*)
   228 	 in (str, c@c', ptp) end
   229     else let val (str, (_, c', ptp as (_, p))) = step ip cs;
   230 	 in if str = "ok" 
   231 	    then autocalc (c@c') p (ptp,[]) (Step (s-1))
   232 	    else (str, c@c', ptp) end
   233 (* handles autoord <= 3, autoord > 3 handled by all_/complete_solve *)
   234   | autocalc c (pos as (_,p_)) ((pt,_), _(*tacis would help 1x in solve*))auto =
   235      if autoord auto > 3 andalso just_created (pt, pos)
   236      then let val ptp = all_modspec (pt, pos);
   237 	  in all_solve auto c ptp end
   238      else
   239 	 if member op = [Pbl, Met] p_
   240  	 then if not (is_complete_mod (pt, pos))
   241 	      then let val ptp = complete_mod (pt, pos)
   242 		   in if autoord auto < 3 then ("ok", c, ptp)
   243 		      else 
   244 			  if not (is_complete_spec ptp)
   245 			  then let val ptp = complete_spec ptp
   246 			       in if autoord auto = 3 then ("ok", c, ptp)
   247 				  else all_solve auto c ptp
   248 			       end
   249 			  else if autoord auto = 3 then ("ok", c, ptp)
   250 			  else all_solve auto c ptp 
   251 		   end
   252 	      else 
   253 		  if not (is_complete_spec (pt,pos))
   254 		  then let val ptp = complete_spec (pt, pos)
   255 		       in if autoord auto = 3 then ("ok", c, ptp)
   256 			  else all_solve auto c ptp
   257 		       end
   258 		  else if autoord auto = 3 then ("ok", c, (pt, pos))
   259 		  else all_solve auto c (pt, pos)
   260 	 else complete_solve auto c (pt, pos);
   261 (* val pbl = get_obj g_pbl (fst ptp) [];
   262    val (oris,_,_) = get_obj g_origin (fst ptp) [];
   263 *)    
   264 
   265 
   266 
   267 
   268 
   269 (*.initialiye matching; before 'tryMatch' get the pblID to match with:
   270    if no pbl has been specified, take the init from origin.*)
   271 (*fun initmatch pt (pos as (p,_):pos') =
   272     let val PblObj {probl,origin=(os,(_,pI,_),_),spec=(dI',pI',mI'),...} = 
   273 	    get_obj I pt p
   274 	val pblID = if pI' = e_pblID 
   275 		    then (*TODO.WN051125 (#init o get_pbt) pI          <<<*) 
   276 			takelast (2, pI) (*FIXME.WN051125 a hack, impl.^^^*)
   277 		    else pI'
   278 	val spec = (dI',pblID,mI')
   279 	val {ppc,where_,prls,...} = get_pbt pblID
   280 	val (model_ok, (pbl, pre)) = 
   281 	    match_itms_oris (assoc_thy "Isac") probl (ppc,where_,prls) os
   282     in ModSpec (ocalhd_complete pbl pre spec,
   283 		Pbl, e_term, pbl, pre, spec) end;*)
   284 fun initcontext_pbl pt (pos as (p,_):pos') =
   285     let val PblObj {probl,origin=(os,(_,pI,_),hdl),spec=(dI',pI',mI'),...} = 
   286 	    get_obj I pt p
   287 	val pblID = if pI' = e_pblID 
   288 		    then (*TODO.WN051125 (#init o get_pbt) pI          <<<*) 
   289 			takelast (2, pI) (*FIXME.WN051125 a hack, impl.^^^*)
   290 		    else pI'
   291 	val {ppc,where_,prls,...} = get_pbt pblID
   292 	val (model_ok, (pbl, pre)) = 
   293 	    match_itms_oris (assoc_thy "Isac") probl (ppc,where_,prls) os
   294     in (model_ok, pblID, hdl, pbl, pre) end;
   295 
   296 fun initcontext_met pt (pos as (p,_):pos') =
   297     let val PblObj {meth,origin=(os,(_,_,mI), _),spec=(_, _, mI'),...} = 
   298 	    get_obj I pt p
   299 	val metID = if mI' = e_metID 
   300 		    then (*TODO.WN051125 (#init o get_pbt) pI          <<<*) 
   301 			takelast (2, mI) (*FIXME.WN051125 a hack, impl.^^^*)
   302 		    else mI'
   303 	val {ppc,pre,prls,scr,...} = get_met metID
   304 	val (model_ok, (pbl, pre)) = 
   305 	    match_itms_oris (assoc_thy "Isac") meth (ppc,pre,prls) os
   306     in (model_ok, metID, scr, pbl, pre) end;
   307 
   308 (*.match the model of a problem at pos p 
   309    with the model-pattern of the problem with pblID*)
   310 fun context_pbl pI pt (p:pos) =
   311     let val PblObj {probl,origin=(os,_,hdl),...} = get_obj I pt p
   312 	val {ppc,where_,prls,...} = get_pbt pI
   313 	val (model_ok, (pbl, pre)) = 
   314 	    match_itms_oris (assoc_thy "Isac") probl (ppc,where_,prls) os
   315     in (model_ok, pI, hdl, pbl, pre) end;
   316 
   317 fun context_met mI pt (p:pos) =
   318     let val PblObj {meth,origin=(os,_,hdl),...} = get_obj I pt p
   319 	val {ppc,pre,prls,scr,...} = get_met mI
   320 	val (model_ok, (pbl, pre)) = 
   321 	    match_itms_oris (assoc_thy "Isac") meth (ppc,pre,prls) os
   322     in (model_ok, mI, scr, pbl, pre) end
   323 
   324 
   325 (* val (pI, pt, pos as (p,_)) = (pblID, pt, p);
   326    *)
   327 fun tryrefine pI pt (pos as (p,_):pos') =
   328     let val PblObj {probl,origin=(os,_,hdl),...} = get_obj I pt p
   329     in case refine_pbl (assoc_thy "Isac") pI probl of
   330 	   NONE => (*copy from context_pbl*)
   331 	   let val {ppc,where_,prls,...} = get_pbt pI
   332 	       val (_, (pbl, pre)) = match_itms_oris (assoc_thy "Isac") 
   333 						     probl (ppc,where_,prls) os
   334 	   in (false, pI, hdl, pbl, pre) end
   335 	 | SOME (pI, (pbl, pre)) => 
   336 	   (true, pI, hdl, pbl, pre) 
   337     end;
   338 
   339 fun detailstep pt (pos as (p,p_):pos') = 
   340   let 
   341     val nd = get_nd pt p
   342     val cn = children nd
   343   in 
   344     if null cn 
   345     then if (is_rewset o (get_obj g_tac nd)) [(*root of nd*)]
   346       then detailrls pt pos
   347       else ("no-Rewrite_Set...", EmptyPtree, e_pos')
   348     else ("donesteps", pt,
   349     (p @ [length (children (get_nd pt p))], Res) ) 
   350   end;
   351 
   352 
   353 (***. for mathematics authoring on sml-toplevel; no XML .***)
   354 
   355 type NEW = int list;
   356 (* val sp = (dI',pI',mI');
   357    *)
   358 
   359 (*15.8.03 for me with loc_specify/solve, nxt_specify/solve
   360  delete as soon as TESTg_form -> _mout_ dropped*)
   361 fun TESTg_form ptp =
   362 (* val ptp = (pt,p);
   363    *) 
   364     let val (form,_,_) = pt_extract ptp
   365     in case form of
   366 	   Form t => Form' (FormKF (~1,EdUndef,0,Nundef,term2str t))
   367 	 | ModSpec (_,p_, head, gfr, pre, _) => 
   368 	   Form' (PpcKF (0,EdUndef,0,Nundef,
   369 			 (case p_ of Pbl => Problem[] | Met => Method[],
   370 			  itms2itemppc (assoc_thy"Isac") gfr pre)))
   371     end;
   372 
   373 (*.create a calc-tree; for use within sml: thus ^^^ NOT decoded to ^;
   374    compare "fun CalcTree" which DOES decode.*)
   375 fun CalcTreeTEST [(fmz, sp):fmz] = 
   376   let
   377     val cs as ((pt,p), tacis) = nxt_specify_init_calc (fmz, sp)
   378 	  val tac = case tacis of [] => Empty_Tac | _ => (#1 o hd) tacis
   379 	  val f = TESTg_form (pt,p)
   380   in (p, []:NEW, f, (tac2IDstr tac, tac), Sundef, pt) end; 
   381        
   382 (*for tests > 15.8.03 after separation setnexttactic / nextTac:
   383   external view: me should be used by math-authors as done so far
   384   internal view: loc_specify/solve, nxt_specify/solve used
   385                  i.e. same as in setnexttactic / nextTac*)
   386 (*ENDE TESTPHASE 08/10.03:
   387   NEW loeschen, eigene Version von locatetac, step
   388   meNEW, CalcTreeTEST: tac'_ -replace-> tac, remove [](cid) *)
   389 
   390 fun me ((_,tac):tac'_) (p:pos') (_:NEW(*remove*)) (pt:ptree) =
   391   let 
   392     val (pt, p) = 
   393 	    (*locatetac is here for testing by me; step would suffice in me*)
   394 	    case locatetac tac (pt,p) of
   395 		    ("ok", (_, _, ptp)) => ptp
   396 	    | ("unsafe-ok", (_, _, ptp)) => ptp
   397 	    | ("not-applicable",_) => (pt, p)
   398 	    | ("end-of-calculation", (_, _, ptp)) => ptp
   399 	    | ("failure",_) => error "sys-error";
   400 	  val (_, ts) =
   401 	    (case step p ((pt, e_pos'),[]) of
   402 		    ("ok", (ts as (tac,_,_)::_, _, _)) => ("",ts)
   403 	    | ("helpless",_) => ("helpless: cannot propose tac", [])
   404 	    | ("no-fmz-spec",_) => error "no-fmz-spec"
   405 	    | ("end-of-calculation", (ts, _, _)) => ("",ts))
   406 	    handle _ => error "sys-error";
   407 	  val tac = 
   408       case ts of 
   409         tacis as (_::_) => let val (tac,_,_) = last_elem tacis in tac end 
   410 		  | _ => if p = ([],Res) then End_Proof' else Empty_Tac;
   411   in (p:pos', []:NEW, TESTg_form (pt, p) (*form output comes from locatetac*), 
   412 	   (tac2IDstr tac, tac):tac'_, Sundef, pt) end;
   413 
   414 (*for quick test-print-out, until 'type inout' is removed*)
   415 fun f2str (Form' (FormKF (_, _, _, _, cterm'))) = cterm';
   416 
   417 
   418 
   419 (*------------------------------------------------------------------(**)
   420 end
   421 open MathEngine;
   422 (**)------------------------------------------------------------------*)
   423