(* Title:  Specify/step-specify.sml

   Author: Walther Neuper 2019

   (c) due to copyright terms

*)

signature STEP_SPECIFY =

sig

(*val do_next: Step.specify_do_next requires LI.by_tactic, which is not yet known in Step_Specify*)

  val by_tactic_input: Tactic.input -> Calc.T -> string * Calc.state_post

  val by_tactic: Tactic.T -> Calc.T -> string * Calc.state_post

  val initialise: Proof.context -> Formalise.T ->

    term * term * References.T * O_Model.T * Proof.context

  val nxt_specify_init_calc: Proof.context -> Formalise.T -> Calc.T * State_Steps.T

end

(**)

structure Step_Specify(**): STEP_SPECIFY(**) =

struct

(**)

open Pos

open Ctree

open Specification

fun by_tactic_input (tac as Tactic.Model_Problem) (pt, pos as (p, _)) =

    let

      val (oris, ospec, probl, spec, ctxt) = case get_obj I pt p of

        PblObj {origin = (oris, ospec, _), probl, spec, ctxt, ...} => (oris, ospec, probl, spec, ctxt)

      | _ => raise ERROR "by_tactic_input Model_Problem; uncovered case get_obj"

      val (_, pI, mI) = References.select_input ospec spec

      val mpc = (#ppc o MethodC.from_store ctxt) mI (* just for reuse I_Model.complete_method *)

      val {cas, ppc, ...} = Problem.from_store (Ctree.get_ctxt pt pos) pI

      val pbl = I_Model.init ppc (* fill in descriptions *)

      (*----------------if you think, this should be done by the Dialog 

       in the java front-end, search there for WN060225-modelProblem----*)

      val (pbl, met) = case cas of

        NONE => (pbl, [])

  		| _ => I_Model.complete_method (oris, mpc, ppc, probl)

      (*----------------------------------------------------------------*)

      val tac_ = Tactic.Model_Problem' (pI, pbl, met)

      val (pos,c,_,pt) = Specify_Step.add tac_ (Istate_Def.Uistate, ctxt) (pt, pos)

    in

      ("ok",([(tac, tac_, (pos, (Istate_Def.Uistate, ContextC.empty)))], c, (pt,pos)))

    end

  | by_tactic_input (Tactic.Add_Given ct) ptp = Specify.by_Add_ "#Given" ct ptp

  | by_tactic_input (Tactic.Add_Find  ct) ptp = Specify.by_Add_ "#Find"  ct ptp

  | by_tactic_input (Tactic.Add_Relation ct) ptp = Specify.by_Add_"#Relate" ct ptp

    (* called with MethodC.id_empty *)     

  | by_tactic_input (Tactic.Refine_Tacitly pI) (ptp as (pt, pos as (p, _))) =

    let 

      val (oris, dI, ctxt) = case get_obj I pt p of

        (PblObj {origin = (oris, (dI, _, _), _), ctxt, ...}) => (oris, dI, ctxt)

      | _ => raise ERROR "by_tactic_input Refine_Tacitly: uncovered case get_obj"

      val opt = Refine.refine_ori ctxt oris pI

    in 

      case opt of

	      SOME pI' => 

	        let

            val {met, ...} = Problem.from_store (Ctree.get_ctxt pt pos) pI'

	          (*val pt = update_pbl pt p pbl ..done by Model_Problem*)

	          val mI = if length met = 0 then MethodC.id_empty else hd met

	          val (pos, c, _, pt) = 

		          Specify_Step.add (Tactic.Refine_Tacitly' (pI, pI', dI, mI,(*pbl*)[])) (Istate_Def.Uistate, ctxt) (pt, pos)

	        in

	          ("ok", ([(Tactic.Refine_Tacitly pI, Tactic.Refine_Tacitly' (pI,pI',dI,mI,(*pbl*)[]),

	              (pos, (Istate_Def.Uistate, ContextC.empty)))], c, (pt,pos)))

          end

	    | NONE => ("failure", ([], [], ptp))

    end

  | by_tactic_input (Tactic.Refine_Problem pI) (ptp as (pt, pos as (p,_))) =

    let

      val (dI, dI', probl, ctxt) = case get_obj I pt p of

        PblObj {origin= (_, (dI, _, _), _), spec = (dI', _, _), probl, ctxt, ...} =>

          (dI, dI', probl, ctxt)

      | _ => raise ERROR "by_tactic_input Refine_Problem: uncovered case get_obj"

	    val thy = if dI' = ThyC.id_empty then dI else dI'

    in 

      case Refine.problem (ThyC.get_theory thy) pI probl of

	      NONE => ("failure", ([], [], ptp))

	    | SOME rfd => 

	      let 

          val (pos,c,_,pt) = Specify_Step.add (Tactic.Refine_Problem' rfd) (Istate_Def.Uistate, ctxt) (pt, pos)

	      in

	        ("ok", ([(Tactic.Refine_Problem pI, Tactic.Refine_Problem' rfd,

            (pos, (Istate_Def.Uistate, ContextC.empty)))], c, (pt,pos)))

        end

    end

  | by_tactic_input (Tactic.Specify_Problem pI) (pt, pos as (p, _)) =

    let

      val (oris, dI, dI', pI', probl, ctxt) = case get_obj I pt p of

        PblObj {origin = (oris, (dI,_,_),_), spec = (dI',pI',_), probl, ctxt, ...} =>

          (oris, dI, dI', pI', probl, ctxt)

      | _ => raise ERROR ""

	    val thy = ThyC.get_theory (if dI' = ThyC.id_empty then dI else dI');

      val {ppc,where_,prls,...} = Problem.from_store (Ctree.get_ctxt pt pos) pI

	    val pbl = 

	      if pI' = Problem.id_empty andalso pI = Problem.id_empty

	      then (false, (I_Model.init ppc, []))

	      else M_Match.match_itms_oris thy probl (ppc,where_,prls) oris

	      (*FIXXXME~~~~~~~~~~~~~~~: take pbl and compare with new pI WN.8.03*)

	    val (c, pt) =

	      case Specify_Step.add (Tactic.Specify_Problem' (pI, pbl)) (Istate_Def.Uistate, ctxt) (pt, pos) of

  	      ((_, Pbl), c, _, pt) => (c, pt)

  	    | _ => raise ERROR ""

    in

      ("ok", ([(Tactic.Specify_Problem pI, Tactic.Specify_Problem' (pI, pbl),

        (pos, (Istate_Def.Uistate, ContextC.empty)))], c, (pt, pos)))

    end

  | by_tactic_input (Tactic.Specify_Method id) (pt, pos) =

    let

      val (o_model, ctxt, i_model) = Specify_Step.complete_for id (pt, pos)

      val (pos, _, _, pt) = Specify_Step.add (Tactic.Specify_Method' (id, o_model, i_model))

        (Istate_Def.Uistate, ctxt) (pt, pos)

    in

      ("ok", ([(Tactic.Specify_Method id, Tactic.Specify_Method' (id, o_model, i_model),

        (pos, (Istate_Def.Uistate, ContextC.empty)))], [], (pt, pos)))

    end    

  | by_tactic_input (Tactic.Specify_Theory dI) (pt, pos as (_, Pbl)) =

    let

      val ctxt = get_ctxt pt pos

	    val (pos, c, _, pt) =            

	      Specify_Step.add (Tactic.Specify_Theory' dI)  (Istate_Def.Uistate, ctxt) (pt, pos)

    in (*FIXXXME: check if pbl can still be parsed*)

	    ("ok", ([(Tactic.Specify_Theory dI, Tactic.Specify_Theory' dI,

        (pos, (Istate_Def.Uistate, ctxt)))], c, (pt, pos)))

    end

  | by_tactic_input (Tactic.Specify_Theory dI) (pt, pos as (_, Met)) =

    let

      val ctxt = get_ctxt pt pos

	    val (pos, c, _, pt) = Specify_Step.add (Tactic.Specify_Theory' dI) (Istate_Def.Uistate, ctxt) (pt, pos)

    in  (*FIXXXME: check if met can still be parsed*)

	    ("ok", ([(Tactic.Specify_Theory dI, Tactic.Specify_Theory' dI,

        (pos, (Istate_Def.Uistate, ctxt)))], c, (pt, pos)))

    end

  | by_tactic_input m' _ = raise ERROR ("by_tactic_input: not impl. for " ^ Tactic.input_to_string m')

(**)

fun by_tactic (Tactic.Model_Problem' (id, pbl, met)) (pt, pos)  =

    let 

      val ((p, _), _, _, pt) = Specify_Step.add (Tactic.Model_Problem'(id, pbl, met))

        (Istate_Def.Uistate, ContextC.empty) (pt, pos)

(* deprecated^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ *)

    in

      ("ok", ([], [], (pt, (p, Pbl))))

    end

    (* called only if no_met is specified *)     

  | by_tactic (Tactic.Refine_Tacitly' (pI, pIre, _, _, _)) (pt, pos) =

      let

        val {met, thy,...} = Problem.from_store (Ctree.get_ctxt pt pos) pIre

        val (domID, metID) = (Context.theory_name thy, if length met = 0 then MethodC.id_empty else hd met)

        val ((p,_), _, _, pt) = 

	        Specify_Step.add (Tactic.Refine_Tacitly' (pI, pIre, domID, metID, [(*pbl*)]))

            (Istate_Def.Uistate, ContextC.empty) (pt, pos)

(* deprecated^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ *)

      in 

        ("ok", ([], [], (pt,(p, Pbl))))

      end

  | by_tactic (Tactic.Refine_Problem' (rfd as (id, _))) (pt, pos)  =

      let

        val ctxt = get_ctxt pt pos

        val (pos, _, _, pt) =

          Specify_Step.add (Tactic.Refine_Problem' rfd) (Istate_Def.Uistate, ctxt) (pt, pos)

      in

        ("ok", ([(Tactic.Refine_Problem id, Tactic.Refine_Problem' rfd,

            (pos, (Istate_Def.Uistate,ctxt)))], [], (pt, pos)))

      end

  | by_tactic (Tactic.Specify_Problem' (pI, (ok, (itms, pre)))) (pt, pos as (p, _)) =

      let

        val (_, _, _, _, _, _, ctxt, _) = case get_obj I pt p of

          PblObj {origin= (oris, (dI', pI', mI'), _), spec= (dI, _, mI), ctxt, meth = met, ...} =>

            (oris, dI', pI', mI', dI, mI, ctxt, met)

        | _ => raise ERROR "Step_Solve.by_tactic (Specify_Problem': uncovered case get_obj"

        val (p, pt) =

          case  Specify_Step.add (Tactic.Specify_Problem' (pI, (ok, (itms, pre)))) (Istate_Def.Uistate, ctxt) (pt, pos) of

            ((p, Pbl), _, _, pt) => (p, pt)

          | _ => raise ERROR "Step_Solve.by_tactic (Specify_Problem': uncovered case generate1 (WARNING WHY ?)"

      in

        ("ok", ([], [], (pt, (p, Pbl))))

      end    

  | by_tactic (Tactic.Specify_Method' (id, _, _)) (pt, pos) =

      let

        val (o_model, ctxt, i_model) = Specify_Step.complete_for id (pt, pos)

        val (pos, _, _, pt) = Specify_Step.add (Tactic.Specify_Method' (id, o_model, i_model))

          (Istate_Def.Uistate, ctxt) (pt, pos)

      in

        ("ok", ([], [], (pt, pos)))

      end

  | by_tactic (Tactic.Add_Given' (ct, _)) (pt, p)  = Specify.by_Add_ "#Given" ct (pt, p)

  | by_tactic (Tactic.Add_Find'  (ct, _)) (pt, p) = Specify.by_Add_ "#Find" ct (pt, p)

  | by_tactic (Tactic.Add_Relation' (ct, _)) (pt, p) = Specify.by_Add_"#Relate" ct (pt, p)

    (*strange old code, redes*)

  | by_tactic (Tactic.Specify_Theory' domID) (pt, (p, p_)) =

      let

        val p_ = case p_ of Met => Met | _ => Pbl

        val {spec = (dI, _, _), ctxt, ...} = Calc.specify_data (pt, (p, p_))

      in

        if domID = dI then

          ("ok", ([], [], (pt, (p, p_))))

        else (*FIXME: check ppc wrt. (new!) domID ..? still parsable?*)

	        let 

	          val ((p, p_), _, _, pt) = Specify_Step.add (Tactic.Specify_Theory' domID)

	            (Istate_Def.Uistate, ctxt) (pt, (p, p_))

	        in

            ("ok", ([], [], (pt, (p, p_))))

          end                

      end

  | by_tactic _ _ = raise ERROR "Step_Specify.by_tactic uncovered pattern in fun.def"

(* create a calc-tree with oris via a cas.refined pbl *)

(*  initialise <-?-> nxt_specify_init_calc *)

fun initialise ctxt (fmz, (dI, pI, mI)) = 

    let

	    val thy = ThyC.get_theory_PIDE ctxt dI

	    val ctxt = Proof_Context.init_global thy (* ctxt restricted to Formalise *)

	    val (pI, (pors, pctxt), mI) = 

	      if mI = ["no_met"] 

	      then 

          let 

            val pors = Problem.from_store ctxt pI |> #ppc |> O_Model.init thy fmz; (*..TermC.parseNEW'*)

            val pctxt = ContextC.initialise' thy fmz;                (*..DUPLICATE ermC.parseNEW'*)

		        val pI' = Refine.refine_ori' pctxt pors pI;

		      in (pI', (pors (*refinement over models with diff.precond only*), pctxt),

		        (hd o #met o Problem.from_store ctxt) pI')

		      end

	      else

	        let

	          val pors = Problem.from_store ctxt pI |> #ppc |> O_Model.init thy fmz; (*..TermC.parseNEW'*)

            val pctxt = ContextC.initialise' thy fmz;                (*..DUPLICATE ermC.parseNEW'*)

	        in (pI, (pors, pctxt), mI) end;

	    val {cas, ppc, thy = thy', ...} = Problem.from_store ctxt pI (*take dI from _refined_ pbl*)

	    val dI = Context.theory_name (ThyC.sub_common (thy, thy'))

	    val hdl = case cas of

		    NONE => Auto_Prog.pblterm dI pI

		  | SOME t => subst_atomic ((Model_Pattern.variables ppc) ~~~ O_Model.values pors) t

	    val hdlPIDE = case cas of

		    NONE => Auto_Prog.pblterm dI pI

		  | SOME t => subst_atomic ((Model_Pattern.variables ppc) ~~~ O_Model.values pors) t

    in

      (hdlPIDE, hdl, (dI, pI, mI), pors, pctxt)

    end;

(*TODO: HOW RELATES nxt_specify_init_calc \<longleftrightarrow> initialise *)

fun nxt_specify_init_calc ctxt ([], (dI, pI, mI)) = (*this will probably be dropped with PIDE*)

    if pI <> []

    then (* from pbl-browser or from CAS cmd with pI=[e_pblID] *)

	    let

        val {cas, met, ppc, thy, ...} = Problem.from_store ctxt pI

	      val dI = if dI = "" then Context.theory_name thy else dI

	      val mI = if mI = [] then hd met else mI

	      val hdl = case cas of NONE => Auto_Prog.pblterm dI pI | SOME t => t

	      val (pt, _) = cappend_problem e_ctree [] (Istate_Def.Uistate, ContextC.empty) ([], (dI, pI, mI))

				  ([], (dI,pI,mI), hdl, ContextC.empty)

	      val pt = update_spec pt [] (dI, pI, mI)

	      val pits = I_Model.init ppc

	      val pt = update_pbl pt [] pits

	    in ((pt, ([] , Pbl)), []) end

    else 

      if mI <> [] 

      then (* from met-browser *)

	      let

          val {ppc, ...} = MethodC.from_store ctxt mI

	        val dI = if dI = "" then "Isac_Knowledge" else dI

	        val (pt, _) = cappend_problem e_ctree [] (Istate_Def.empty, ContextC.empty)

	          ([], (dI, pI, mI)) ([], (dI, pI, mI), TermC.empty, ContextC.empty)

	        val pt = update_spec pt [] (dI, pI, mI)

	        val mits = I_Model.init ppc

	        val pt = update_met pt [] mits

	      in ((pt, ([], Met)), []) end

      else (* new example, pepare for interactive modeling *)

	      let

	        val (pt, _) = cappend_problem e_ctree [] (Istate_Def.empty, ContextC.empty) 

	          ([], References.empty) ([], References.empty, TermC.empty, ContextC.empty)

	      in ((pt, ([], Pbl)), []) end

  | nxt_specify_init_calc ctxt (model, (dI, pI, mI)) = 

    let            (* both ^^^  ^^^^^^^^^^^^  are either empty or complete *)

	    val (_, hdl, (dI, pI, mI), pors, pctxt) = initialise ctxt (model, (dI, pI, mI))

      val (pt, _) = cappend_problem e_ctree [] (Istate_Def.empty, pctxt)

        (model, (dI, pI, mI)) (pors, (dI, pI, mI), hdl, pctxt)

    in

      ((pt, ([], Pbl)), (fst3 o snd) (by_tactic_input Tactic.Model_Problem (pt, ([], Pbl))))

    end

(**)end(**)