(* Title:  Tactics; tac_ for interaction with frontend, input for internal use.

   Author: Walther Neuper 170121

   (c) due to copyright terms

regular expression for search:

Add_Find|Add_Given|Add_Relation|Apply_Assumption|Apply_Method|Begin_Sequ|Begin_Trans|Split_And|Split_Or|Split_Intersect|Conclude_And|Conclude_Or|Collect_Trues|End_Sequ|End_Trans|End_Ruleset|End_Subproblem|End_Intersect|End_Proof|CAScmd|Calculate|Check_Postcond|Check_elementwise|Del_Find|Del_Given|Del_Relation|Derive|Detail_Set|Detail_Set_Inst|End_Detail|Empty_Tac|Free_Solve|Init_Proof|Model_Problem Or_to_List|Refine_Problem|Refine_Tacitly| Rewrite|Rewrite_Inst|Rewrite_Set|Rewrite_Set_Inst|Specify_Method|Specify_Problem|Specify_Theory|Subproblem|Substitute|Tac|Take|Take_Inst

*)

signature TACTIC =

sig

  datatype T =

    Add_Find' of TermC.as_string * Model.itm list | Add_Given' of TermC.as_string * Model.itm list 

  | Add_Relation' of TermC.as_string * Model.itm list

  | Apply_Method' of Method.id * term option * Istate_Def.T * Proof.context

  | Del_Find' of TermC.as_string | Del_Given' of TermC.as_string | Del_Relation' of TermC.as_string

  | Init_Proof' of TermC.as_string list * Spec.T

  | Model_Problem' of Problem.id * Model.itm list * Model.itm list

  | Refine_Problem' of Problem.id * (Model.itm list * (bool * term) list)

  | Refine_Tacitly' of Problem.id * Problem.id * ThyC.id * Method.id * Model.itm list

  | Specify_Method' of Method.id * Model.ori list * Model.itm list

  | Specify_Problem' of Problem.id * (bool * (Model.itm list * (bool * term) list))

  | Specify_Theory' of ThyC.id

  (* ^^^^^--------------------- for specify-phase, for solve-phase ---------------------vvvvv*)

  | CAScmd' of term

  | Calculate' of ThyC.id * string * term * (term * ThmC.T)

  | Check_Postcond' of Problem.id * term

  | Check_elementwise' of term * TermC.as_string * Selem.result

(*RM*)| Derive' of Rule_Set.T      

  | Empty_Tac_

  | Free_Solve'

(*RM* )| Apply_Assumption of TermC.as_string list( *RM*)

  | Or_to_List' of term * term

  | Rewrite' of ThyC.id * Rewrite_Ord.rew_ord' * Rule_Set.T * bool * ThmC.T * term * Selem.result

  | Rewrite_Inst' of ThyC.id * Rewrite_Ord.rew_ord' * Rule_Set.T * bool * subst * ThmC.T * term * Selem.result

  | Rewrite_Set' of ThyC.id * bool * Rule_Set.T * term * Selem.result

  | Rewrite_Set_Inst' of ThyC.id * bool * subst * Rule_Set.T * term * Selem.result

  | Subproblem' of

      Spec.T * Model.ori list *

      term *          (* CAScmd, e.g. "solve (-1 + x = 0, x)" *)

      Selem.fmz_ *    (* either input to root-probl.  or derived from prog. in ???  *)

      (*Istate.T *       ?       *)

      Proof.context * (* derived from prog. in ???  *)

      term            (* ?UNUSED, e.g."Subproblem\n (''Test'',\n  ??.\<^const>String.char.Char ''LINEAR'' ''univariate'' ''equation''\n   ''test'')" *)

  | Substitute' of Rule_Def.rew_ord_ * Rule_Set.T * Subst.as_eqs * term * term

(*RM*)| Tac_ of theory * string * string * string

  | Take' of term

(*RM* )| Take_Inst of TermC.as_string( *RM*)

(*RM*)| Begin_Sequ' | Begin_Trans' of term

(*RM*)| Split_And' of term | Split_Or' of term | Split_Intersect' of term

(*RM*)| Conclude_And' of term | Conclude_Or' of term | Collect_Trues' of term

(*RM*)| End_Sequ' | End_Trans' of Selem.result

(*RM*)| End_Ruleset' of term | End_Intersect' of term | End_Proof''

(*RM*)| Detail_Set' of ThyC.id * bool * Rule_Set.T * term * Selem.result

(*RM*)| Detail_Set_Inst' of ThyC.id * bool * subst * Rule_Set.T * term * Selem.result

(*RM*)| End_Detail' of Selem.result;

  val string_of: T -> string

  datatype input =

    Add_Find of TermC.as_string | Add_Given of TermC.as_string

  | Add_Relation of TermC.as_string

  | Apply_Method of Method.id

  | Del_Find of TermC.as_string | Del_Given of TermC.as_string | Del_Relation of TermC.as_string

  | Init_Proof of TermC.as_string list * Spec.T

  | Model_Problem

  | Refine_Problem of Problem.id

  | Refine_Tacitly of Problem.id

  | Specify_Method of Method.id

  | Specify_Problem of Problem.id

  | Specify_Theory of ThyC.id

  (* ^^^^^--------------------- for specify-phase, for solve-phase ---------------------vvvvv*)

  | CAScmd of TermC.as_string

  | Calculate of string

  | Check_Postcond of Problem.id

  | Check_elementwise of TermC.as_string

(*RM*)| Derive of Rule_Set.id(*RM*)

  | Empty_Tac

(*RM*)| Free_Solve

(*RM*)| Apply_Assumption of TermC.as_string list

  | Or_to_List

  | Rewrite of ThmC.T

  | Rewrite_Inst of Subst.input * ThmC.T

  | Rewrite_Set of Rule_Set.id

  | Rewrite_Set_Inst of Subst.input * Rule_Set.id

  | Subproblem of ThyC.id * Problem.id

  | Substitute of Subst.input

(*RM*)| Tac of string

  | Take of TermC.as_string

(*RM*)| Take_Inst of TermC.as_string

(*RM*)| Begin_Sequ | Begin_Trans

(*RM*)| Split_And | Split_Or | Split_Intersect

(*RM*)| Conclude_And | Conclude_Or | Collect_Trues

(*RM*)| End_Sequ | End_Trans

(*RM*)| End_Ruleset | End_Subproblem | End_Intersect

(*RM*)| Detail_Set of Rule_Set.id

(*RM*)| Detail_Set_Inst of Subst.input * Rule_Set.id

(*RM*)| End_Detail

  | End_Proof';

  val input_to_string : input -> string

  val tac2IDstr : input -> string

  val is_empty : input -> bool

  val eq_tac : input * input -> bool

  val is_rewtac : input -> bool

  val is_rewset : input -> bool

  val rls_of : input -> Rule_Set.id

  val rule2tac : theory -> (term * term) list ->  Rule.rule -> input

  val applicable : theory -> string -> Rule_Set.T -> term -> input ->input list

  val for_specify: input -> bool

  val input_from_T : T -> input

  val result : T -> term

  val creates_assms: T -> term list

  val insert_assumptions: T -> Proof.context -> Proof.context

  val for_specify': T -> bool

(* ---- for tests only: shifted from below to remove the Warning "unused" at fun.def. --------- *)

  (* NONE *)

(*/-------------------------------------------------------- ! aktivate for Test_Isac BEGIN ---\* )

  (* NONE *)

( *\--- ! aktivate for Test_Isac END ----------------------------------------------------------/*)

(*----- unused code, kept as hints to design ideas ---------------------------------------------*)

  (* NONE *)

end

(**)

structure Tactic(**): TACTIC(**) =

struct

(**)

(** tactics for user at front-end **)

(* tactics for user at front-end.

   input propagates the construction of the calc-tree;

   there are

   (a) 'specsteps' for the specify-phase, and others for the solve-phase

   (b) those of the solve-phase are 'initac's and others;

       initacs start with a formula different from the preceding formula.

   see 'type tac_' for the internal representation of tactics

*)

datatype input =

    Add_Find of TermC.as_string | Add_Given of TermC.as_string | Add_Relation of TermC.as_string

  | Apply_Assumption of TermC.as_string list

  | Apply_Method of Method.id

    (* creates an "istate" in PblObj.env; in case of "implicit_take" 

      creates a formula at ((lev_on o lev_dn) p, Frm) and in this "ppobj.loc"

      a "SOME istate" at fst of "loc".

      As each step (in the solve-phase) has a resulting formula (at the front-end)

      Apply_Method also does the 1st step in the script (an "initac") if there is no "implicit_take" *)  

  (*/--- TODO: re-design ? -----------------------------------------------------------------\*)

  | Begin_Sequ | Begin_Trans

  | Split_And | Split_Or | Split_Intersect

  | Conclude_And | Conclude_Or | Collect_Trues

  | End_Sequ | End_Trans

  | End_Ruleset | End_Subproblem (* WN0509 drop *) | End_Intersect | End_Proof'

  (*\--- TODO: re-design ? -----------------------------------------------------------------/*)

  | CAScmd of TermC.as_string

  | Calculate of string

  | Check_Postcond of Problem.id

  | Check_elementwise of TermC.as_string

  | Del_Find of TermC.as_string | Del_Given of TermC.as_string | Del_Relation of TermC.as_string

  | Derive of Rule_Set.id                 (* WN0509 drop *)

  | Detail_Set of Rule_Set.id             (* WN0509 drop *)

  | Detail_Set_Inst of Subst.input * Rule_Set.id (* WN0509 drop *)

  | End_Detail                     (* WN0509 drop *)

  | Empty_Tac

  | Free_Solve

  | Init_Proof of TermC.as_string list * Spec.T

  | Model_Problem

  | Or_to_List

  | Refine_Problem of Problem.id

  | Refine_Tacitly of Problem.id

   (* rewrite-tactics can transport a (thmID, thm) to and (!) from the java-front-end

     because there all the thms are present with both (thmID, thm)

     (where user-views can show both or only one of (thmID, thm)),

     and thm is created from ThmID by assoc_thm'' when entering isabisac *)

  | Rewrite of ThmC.T

  | Rewrite_Inst of Subst.input * ThmC.T

  | Rewrite_Set of Rule_Set.id

  | Rewrite_Set_Inst of Subst.input * Rule_Set.id

  | Specify_Method of Method.id

  | Specify_Problem of Problem.id

  | Specify_Theory of ThyC.id

  | Subproblem of ThyC.id * Problem.id (* WN0509 drop *)

  | Substitute of Subst.input

  | Tac of string               (* WN0509 drop *)

  | Take of TermC.as_string | Take_Inst of TermC.as_string

fun input_to_string ma = case ma of

    Init_Proof (ppc, spec)  => 

      "Init_Proof "^(pair2str (strs2str ppc, Spec.to_string spec))

  | Model_Problem           => "Model_Problem "

  | Refine_Tacitly pblID    => "Refine_Tacitly " ^ strs2str pblID 

  | Refine_Problem pblID    => "Refine_Problem " ^ strs2str pblID 

  | Add_Given cterm'        => "Add_Given " ^ cterm'

  | Del_Given cterm'        => "Del_Given " ^ cterm'

  | Add_Find cterm'         => "Add_Find " ^ cterm'

  | Del_Find cterm'         => "Del_Find " ^ cterm'

  | Add_Relation cterm'     => "Add_Relation " ^ cterm'

  | Del_Relation cterm'     => "Del_Relation " ^ cterm'

  | Specify_Theory domID    => "Specify_Theory " ^ quote domID

  | Specify_Problem pblID   => "Specify_Problem " ^ strs2str pblID

  | Specify_Method metID    => "Specify_Method " ^ strs2str metID

  | Apply_Method metID      => "Apply_Method " ^ strs2str metID

  | Check_Postcond pblID    => "Check_Postcond " ^ strs2str pblID

  | Free_Solve              => "Free_Solve"

  | Rewrite_Inst (subs, (id, thm)) =>

    "Rewrite_Inst " ^ (pair2str (subs2str subs, spair2str (id, thm |> Thm.prop_of |> UnparseC.term)))

  | Rewrite (id, thm) => "Rewrite " ^ spair2str (id, thm |> Thm.prop_of |> UnparseC.term)

  | Rewrite_Set_Inst (subs, rls) => 

    "Rewrite_Set_Inst " ^ pair2str (subs2str subs, quote rls)

  | Rewrite_Set rls         => "Rewrite_Set " ^ quote rls

  | Detail_Set rls          => "Detail_Set " ^ quote rls

  | Detail_Set_Inst (subs, rls) =>  "Detail_Set_Inst " ^ pair2str (subs2str subs, quote rls)

  | End_Detail              => "End_Detail"

  | Derive rls'             => "Derive " ^ rls' 

  | Calculate op_           => "Calculate " ^ op_

  | Substitute sube         => "Substitute " ^ Subst.string_eqs_to_string sube	     

  | Apply_Assumption ct's   => "Apply_Assumption " ^ strs2str ct's

  | Take cterm'             => "Take " ^ quote cterm'

  | Take_Inst cterm'        => "Take_Inst " ^ quote cterm'

  | Subproblem (domID, pblID) => "Subproblem " ^ pair2str (domID, strs2str pblID)

  | End_Subproblem          => "End_Subproblem"

  | CAScmd cterm'           => "CAScmd " ^ quote cterm'

  | Check_elementwise cterm'=> "Check_elementwise " ^ quote cterm'

  | Or_to_List              => "Or_to_List "

  | Collect_Trues           => "Collect_Trues"

  | Empty_Tac               => "Empty_Tac"

  | Tac string              => "Tac " ^ string

  | End_Proof'              => "input End_Proof'"

  | _                       => "input_to_string not impl. for ?!";

fun tac2IDstr ma = case ma of

    Model_Problem => "Model_Problem"

  | Refine_Tacitly _ => "Refine_Tacitly"

  | Refine_Problem _ => "Refine_Problem"

  | Add_Given _ => "Add_Given"

  | Del_Given _ => "Del_Given"

  | Add_Find _ => "Add_Find"

  | Del_Find _ => "Del_Find"

  | Add_Relation _ => "Add_Relation"

  | Del_Relation _ => "Del_Relation"

  | Specify_Theory _ => "Specify_Theory"

  | Specify_Problem _ => "Specify_Problem"

  | Specify_Method _ => "Specify_Method"

  | Apply_Method _ => "Apply_Method"

  | Check_Postcond _ => "Check_Postcond"

  | Free_Solve => "Free_Solve"

  | Rewrite_Inst _ => "Rewrite_Inst"

  | Rewrite _ => "Rewrite"

  | Rewrite_Set_Inst _ => "Rewrite_Set_Inst"

  | Rewrite_Set _ => "Rewrite_Set"

  | Detail_Set _ => "Detail_Set"

  | Detail_Set_Inst _ => "Detail_Set_Inst"

  | Derive _ => "Derive "

  | Calculate _ => "Calculate "

  | Substitute _ => "Substitute" 

  | Apply_Assumption _ => "Apply_Assumption"

  | Take _ => "Take"

  | Take_Inst _ => "Take_Inst"

  | Subproblem _ => "Subproblem"

  | End_Subproblem => "End_Subproblem"

  | CAScmd _ => "CAScmd"

  | Check_elementwise _ => "Check_elementwise"

  | Or_to_List => "Or_to_List "

  | Collect_Trues => "Collect_Trues"

  | Empty_Tac => "Empty_Tac"

  | Tac _ => "Tac "

  | End_Proof' => "End_Proof'"

  | _ => "input_to_string not impl. for ?!";

fun is_empty input = case input of Empty_Tac => true | _ => false

fun eq_tac (Rewrite (id1, _), Rewrite (id2, _)) = id1 = id2

  | eq_tac (Rewrite_Inst (_, (id1, _)), Rewrite_Inst (_, (id2, _))) = id1 = id2

  | eq_tac (Rewrite_Set id1, Rewrite_Set id2) = id1 = id2

  | eq_tac (Rewrite_Set_Inst (_, id1), Rewrite_Set_Inst (_, id2)) = id1 = id2

  | eq_tac (Calculate id1, Calculate id2) = id1 = id2

  | eq_tac _ = false

fun is_rewset (Rewrite_Set_Inst _) = true

  | is_rewset (Rewrite_Set _) = true 

  | is_rewset _ = false;

fun is_rewtac (Rewrite _) = true

  | is_rewtac (Rewrite_Inst _) = true

  | is_rewtac input = is_rewset input;

fun rls_of (Rewrite_Set_Inst (_, rls)) = rls

  | rls_of (Rewrite_Set rls) = rls

  | rls_of input = error ("rls_of: called with input \"" ^ tac2IDstr input ^ "\"");

fun rule2tac thy _ (Rule.Eval (opID, _)) = Calculate (assoc_calc thy opID)

  | rule2tac _ [] (Rule.Thm thm'') = Rewrite thm''

  | rule2tac _ subst (Rule.Thm thm'') = 

    Rewrite_Inst (Subst.T_to_input subst, thm'')

  | rule2tac _ [] (Rule.Rls_ rls) = Rewrite_Set (Rule_Set.id rls)

  | rule2tac _ subst (Rule.Rls_ rls) = 

    Rewrite_Set_Inst (Subst.T_to_input subst, (Rule_Set.id rls))

  | rule2tac _ _ rule = 

    error ("rule2tac: called with \"" ^ Rule.to_string rule ^ "\"");

(* try if a rewrite-rule is applicable to a given formula; 

   in case of rule-sets (recursivley) collect all _atomic_ rewrites *) 

fun try_rew thy ((_, ro) : Rewrite_Ord.rew_ord) erls (subst : subst) f (thm' as Rule.Thm (_, thm)) =

    if Auto_Prog.contains_bdv thm

    then case Rewrite.rewrite_inst_ thy ro erls false subst thm f of

	    SOME _ => [rule2tac thy subst thm']

	  | NONE => []

    else (case Rewrite.rewrite_ thy ro erls false thm f of

	    SOME _ => [rule2tac thy [] thm']

	  | NONE => [])

  | try_rew thy _ _ _ f (cal as Rule.Eval c) = 

    (case Eval.adhoc_thm thy c f of

	    SOME _ => [rule2tac thy [] cal]

    | NONE => [])

  | try_rew thy _ _ _ f (cal as Rule.Cal1 c) = 

    (case Eval.adhoc_thm thy c f of

	      SOME _ => [rule2tac thy [] cal]

      | NONE => [])

  | try_rew thy _ _ subst f (Rule.Rls_ rls) = filter_appl_rews thy subst f rls

  | try_rew _ _ _ _ _ _ = error "try_rew: uncovered case"

and filter_appl_rews thy subst f (Rule_Def.Repeat {rew_ord = ro, erls, rules, ...}) = 

    gen_distinct eq_tac (flat (map (try_rew thy ro erls subst f) rules))

  | filter_appl_rews thy subst f (Rule_Set.Sequence {rew_ord = ro, erls, rules,...}) = 

    gen_distinct eq_tac (flat (map (try_rew thy ro erls subst f) rules))

  | filter_appl_rews _ _ _ (Rule_Set.Rrls _) = []

  | filter_appl_rews _ _ _ _ = error "filter_appl_rews: uncovered case"

(* decide if a tactic is applicable to a given formula; 

   in case of Rewrite_Set* go down to _atomic_ rewrite-tactics *)

fun applicable thy _ _ f (Calculate scrID) =

    try_rew thy Rewrite_Ord.e_rew_ordX Rule_Set.empty [] f (Rule.Eval (assoc_calc' thy scrID |> snd))

  | applicable thy ro erls f (Rewrite thm'') =

    try_rew thy (ro, Rewrite_Ord.assoc_rew_ord ro) erls [] f (Rule.Thm thm'')

  | applicable thy ro erls f (Rewrite_Inst (subs, thm'')) =

    try_rew thy (ro, Rewrite_Ord.assoc_rew_ord ro) erls (Subst.T_from_input thy subs) f (Rule.Thm thm'')

  | applicable thy _ _ f (Rewrite_Set rls') =

    filter_appl_rews thy [] f (assoc_rls rls')

  | applicable thy _ _ f (Rewrite_Set_Inst (subs, rls')) =

    filter_appl_rews thy (Subst.T_from_input thy subs) f (assoc_rls rls')

  | applicable _ _ _ _ tac = 

    (tracing ("### applicable: not impl. for tac = '" ^ input_to_string tac ^ "'"); []);

(** tactics for internal use **)

(* tactics for for internal use, compare "input" for user at the front-end.

  tac_ contains results from check in 'fun applicable_in'.

  This is useful for costly results, e.g. from rewriting;

  however, these results might be changed by Scripts like

      "      eq = (Rewrite_Set ''ansatz_rls'' False) eql;" ^

      "      eq = (Rewrite_Set equival_trans False) eq;" ^

  TODO.WN120106 ANALOGOUSLY TO Substitute':

  So tac_ contains the term t the result was calculated from

  in order to compare t with t' possibly changed by "Expr "

  and re-calculate result if t<>t'

  TODO.WN161219: replace *every* cterm' by term

*)

  datatype T =

    Add_Find' of TermC.as_string * Model.itm list | Add_Given' of TermC.as_string * Model.itm list 

  | Add_Relation' of TermC.as_string * Model.itm list

  | Apply_Method' of (* creates the 1st step visible in a (sub-) comprising

                      * tactic Apply_Method metID

                      * formula term                                        *)

      Method.id *  (* key for Know_Store                                     *)

      term option *  (* the first formula of Calc.T. TODO: rm option        *)           

      Istate_Def.T * (* for the newly started program                       *)

      Proof.context  (* for the newly started program                       *)

  (*/--- TODO: re-design ? -----------------------------------------------------------------\*)

  | Begin_Sequ' | Begin_Trans' of term

  | Split_And' of term | Split_Or' of term | Split_Intersect' of term

  | Conclude_And' of term | Conclude_Or' of term | Collect_Trues' of term

  | End_Sequ' | End_Trans' of Selem.result

  | End_Ruleset' of term | End_Intersect' of term | End_Proof''

  (*\--- TODO: re-design ? -----------------------------------------------------------------/*)

  | CAScmd' of term

  | Calculate' of ThyC.id * string * term * (term * ThmC.T)

  | Check_Postcond' of Problem.id *

    term         (* returnvalue of program in solve *)

  | Check_elementwise' of (* DEPRECATED, made idle for Calc.T in df00a2b5c4cc *)

    term *       (* (1) the current formula: [x=1,x=...]                      *)

    string *     (* (2) the pred from Check_elementwise                       *)

    Selem.result (* (3) composed from (1) and (2): {x. pred}                  *)

  | Del_Find' of TermC.as_string | Del_Given' of TermC.as_string | Del_Relation' of TermC.as_string

  | Derive' of Rule_Set.T

  | Detail_Set' of ThyC.id * bool * Rule_Set.T * term * Selem.result

  | Detail_Set_Inst' of ThyC.id * bool * subst * Rule_Set.T * term * Selem.result

  | End_Detail' of Selem.result

  | Empty_Tac_

  | Free_Solve'

  | Init_Proof' of TermC.as_string list * Spec.T

  | Model_Problem' of (* first step in specifying   *)

    Problem.id *     (* key into Know_Store           *)

    Model.itm list *  (* the 'untouched' pbl        *)

    Model.itm list    (* the casually completed met *)

  | Or_to_List' of term * term

  | Refine_Problem' of Problem.id * (Model.itm list * (bool * term) list)

  | Refine_Tacitly' of

    Problem.id *     (* input                                                                *)

    Problem.id *     (* the refined from applicable_in                                       *)

    ThyC.id *      (* from new pbt?! filled in specify                                     *)

    Method.id *     (* from new pbt?! filled in specify                                     *)

    Model.itm list    (* drop ! 9.03: remains [] for Model_Problem recognizing its activation *)

  | Rewrite' of ThyC.id * Rewrite_Ord.rew_ord' * Rule_Set.T * bool * ThmC.T * term * Selem.result

  | Rewrite_Inst' of ThyC.id * Rewrite_Ord.rew_ord' * Rule_Set.T * bool * subst * ThmC.T * term * Selem.result

  | Rewrite_Set' of ThyC.id * bool * Rule_Set.T * term * Selem.result

  | Rewrite_Set_Inst' of ThyC.id * bool * subst * Rule_Set.T * term * Selem.result

  | Specify_Method' of Method.id * Model.ori list * Model.itm list

  | Specify_Problem' of Problem.id * 

    (bool *                  (* matches	                                  *)

      (Model.itm list *      (* ppc	                                      *)

        (bool * term) list)) (* preconditions marked true/false           *)

  | Specify_Theory' of ThyC.id

  | Subproblem' of

    Spec.T * 

		(Model.ori list) *       (* filled in associate Subproblem'           *)

		term *                   (* filled -"-, headline of calc-head         *)

		Selem.fmz_ *             (* string list from arguments                *)

    Proof.context *          (* for specify-phase                         *)

		term                     (* Subproblem (thyID, pbl) OR cascmd         *)  

  | Substitute' of           

    Rule_Def.rew_ord_ *          (* for re-calculation                        *)

    Rule_Set.T *               (* for re-calculation                        *)

    Subst.as_eqs *            (* the 'substitution': terms of type bool    *)

    term *                   (* to be substituted into                    *)

    term                     (* resulting from the substitution           *)

  | Tac_ of theory * string * string * string

  | Take' of term

fun string_of ma = case ma of

    Init_Proof' (ppc, spec)  => "Init_Proof' " ^ pair2str (strs2str ppc, Spec.to_string spec)

  | Model_Problem' (pblID, _, _) => "Model_Problem' " ^ strs2str pblID

  | Refine_Tacitly'(p, prefin, domID, metID, _) => "Refine_Tacitly' (" ^ strs2str p ^ ", " ^

    strs2str prefin ^ ", " ^ domID ^ ", " ^ strs2str metID ^ ", pbl-itms)"

  | Refine_Problem' _ => "Refine_Problem' (" ^ (*matchs2str ms*)"..." ^ ")"

  | Add_Given' _ => "Add_Given' "(*^cterm'*)

  | Del_Given' _ => "Del_Given' "(*^cterm'*)

  | Add_Find' _ => "Add_Find' "(*^cterm'*)

  | Del_Find' _ => "Del_Find' "(*^cterm'*)

  | Add_Relation' _ => "Add_Relation' "(*^cterm'*)

  | Del_Relation' _ => "Del_Relation' "(*^cterm'*)

  | Specify_Theory' domID => "Specify_Theory' " ^ quote domID

  | Specify_Problem' (pI, (ok, _)) =>  "Specify_Problem' " ^ 

    spair2str (strs2str pI, spair2str (bool2str ok, spair2str ("itms2str_ itms", "items2str pre")))

  | Specify_Method' (pI, oris, _) => "Specify_Method' (" ^ 

    Method.id_to_string pI ^ ", " ^ Model.oris2str oris ^ ", )"

  | Apply_Method' (metID, _, _, _) => "Apply_Method' " ^ strs2str metID

  | Check_Postcond' (pblID, scval) => "Check_Postcond' " ^

      (spair2str (strs2str pblID, UnparseC.term scval))

  | Free_Solve' => "Free_Solve'"

  | Rewrite_Inst' (*subs,thm'*) _ => "Rewrite_Inst' "(*^(pair2str (subs2str subs, spair2str thm'))*)

  | Rewrite' _(*thm'*) => "Rewrite' "(*^(spair2str thm')*)

  | Rewrite_Set_Inst' _(*subs,thm'*) => "Rewrite_Set_Inst' "(*^(pair2str (subs2str subs, quote rls))*)

  | Rewrite_Set' (thy', pasm, rls', f, (f', asm)) => "Rewrite_Set' (" ^ thy' ^ "," ^ bool2str pasm ^

    "," ^ Rule_Set.id rls' ^ "," ^ UnparseC.term f ^ ",(" ^ UnparseC.term f' ^ "," ^ UnparseC.terms asm ^ "))"

  | End_Detail' _ => "End_Detail' xxx"

  | Detail_Set' _ => "Detail_Set' xxx"

  | Detail_Set_Inst' _ => "Detail_Set_Inst' xxx"

  | Derive' rls => "Derive' " ^ Rule_Set.id rls

  | Calculate'  _ => "Calculate' "

  | Substitute' _ => "Substitute' "(*^(subs2str subs)*)    

  | Take' _(*cterm'*) => "Take' "(*^(quote cterm'	)*)

  | Subproblem' _(*(spec, oris, _, _, _, pbl_form)*) => 

    "Subproblem' "(*^(pair2str (domID, strs2str ,))*)

  | CAScmd' _(*cterm'*) => "CAScmd' "(*^(quote cterm')*)

  | Empty_Tac_ => "Empty_Tac_"

  | Tac_ (_, form, id, result) => "Tac_ (thy," ^ form ^ "," ^ id ^ "," ^ result ^ ")"

  | _  => "string_of not impl. for arg";

fun input_from_T (Refine_Tacitly' (pI, _, _, _, _)) = Refine_Tacitly pI

  | input_from_T (Model_Problem' (_, _, _)) = Model_Problem

  | input_from_T (Add_Given' (t, _)) = Add_Given t

  | input_from_T (Add_Find' (t, _)) = Add_Find t

  | input_from_T (Add_Relation' (t, _)) = Add_Relation t

  | input_from_T (Specify_Theory' dI) = Specify_Theory dI

  | input_from_T (Specify_Problem' (dI, _)) = Specify_Problem dI

  | input_from_T (Specify_Method' (dI, _, _)) = Specify_Method dI

  | input_from_T (Rewrite' (_, _, _, _, thm, _, _)) = Rewrite thm

  | input_from_T (Rewrite_Inst' (_, _, _, _, sub, thm, _, _)) = Rewrite_Inst (Subst.T_to_input sub, thm)

  | input_from_T (Rewrite_Set' (_, _, rls, _, _)) = Rewrite_Set (Rule_Set.id rls)

  | input_from_T (Detail_Set' (_, _, rls, _, _)) = Detail_Set (Rule_Set.id rls)

  | input_from_T (Rewrite_Set_Inst' (_, _, sub, rls, _, _)) = 

    Rewrite_Set_Inst (Subst.T_to_input sub, Rule_Set.id rls)

  | input_from_T (Detail_Set_Inst' (_, _, sub, rls, _, _)) = 

    Detail_Set_Inst (Subst.T_to_input sub, Rule_Set.id rls)

  | input_from_T (Calculate' (_, op_, _, _)) = Calculate (op_)

  | input_from_T (Check_elementwise' (_, pred, _)) = Check_elementwise pred

  | input_from_T (Or_to_List' _) = Or_to_List

  | input_from_T (Take' term) = Take (UnparseC.term term)

  | input_from_T (Substitute' (_, _, subte, _, _)) = Substitute (Subst.eqs_to_input subte) 

  | input_from_T (Tac_ (_, _, id, _)) = Tac id

  | input_from_T (Subproblem' ((domID, pblID, _), _, _, _,_ ,_)) = Subproblem (domID, pblID)

  | input_from_T (Check_Postcond' (pblID, _)) = Check_Postcond pblID

  | input_from_T Empty_Tac_ = Empty_Tac

  | input_from_T m = raise ERROR (": not impl. for "^(string_of m));

fun res (Rewrite_Inst' (_ , _, _, _, _, _, _, res)) = res

  | res (Rewrite' (_, _, _, _, _, _, res)) = res

  | res (Rewrite_Set_Inst' (_, _, _, _, _, res)) = res

  | res (Rewrite_Set' (_, _, _, _, res)) = res

  | res (Calculate' (_, _, _, (t, _))) = (t, [])

  | res (Check_elementwise' (_, _, res)) = res

  | res (Subproblem' (_, _, _, _, _, t)) = (t, [])

  | res (Take' t) = (t, [])

  | res (Substitute' (_, _, _, _, t)) = (t, [])

  | res (Or_to_List' (_,  t)) = (t, [])

  | res m = raise ERROR ("result: not impl.for " ^ string_of m)

(*fun result m = (fst o res) m; TODO*)

fun result tac = (fst o res) tac;

fun creates_assms tac = (snd o res) tac;

fun insert_assumptions tac ctxt  = ContextC.insert_assumptions (creates_assms tac) ctxt

fun for_specify (Init_Proof _) = true

  | for_specify Model_Problem  = true

  | for_specify (Refine_Tacitly _) = true

  | for_specify (Refine_Problem _) = true

  | for_specify (Add_Given _) = true

  | for_specify (Del_Given _) = true

  | for_specify (Add_Find _) = true

  | for_specify (Del_Find _) = true

  | for_specify (Add_Relation _) = true

  | for_specify (Del_Relation _) = true

  | for_specify (Specify_Theory _) = true

  | for_specify (Specify_Problem _) = true

  | for_specify (Specify_Method _) = true

  | for_specify _ = false

fun for_specify' (Init_Proof' _) = true

  | for_specify' (Model_Problem' _) = true

  | for_specify' (Refine_Tacitly' _) = true

  | for_specify' (Refine_Problem' _) = true

  | for_specify' (Add_Given' _) = true

  | for_specify' (Del_Given' _) = true

  | for_specify' (Add_Find' _) = true

  | for_specify' (Del_Find' _) = true

  | for_specify' (Add_Relation' _) = true

  | for_specify' (Del_Relation' _) = true

  | for_specify' (Specify_Theory' _) = true

  | for_specify' (Specify_Problem' _) = true

  | for_specify' (Specify_Method' _) = true

  | for_specify' _ = false

(**)end(**)