src/Tools/isac/TODO.thy
author Walther Neuper <walther.neuper@jku.at>
Fri, 14 Aug 2020 12:36:33 +0200
changeset 60045 28e2088e7cf1
parent 60040 a05df90c0dee
child 60089 bf4b3b8420aa
permissions -rw-r--r--
compare Outer_Syntax.command with Outer_Syntax.local_theory (from Naproche)
     1 (* Title:  todo's for isac core
     2    Author: Walther Neuper 111013
     3    (c) copyright due to lincense terms.
     4 *)
     5 theory TODO
     6 imports "~~/src/Doc/Prog_Prove/LaTeXsugar"
     7 begin
     8 
     9 text \<open>
    10 Legend: here + code since 200120
    11   \<open>(*DOC\<close> identifies stuff dedicated for isac/Doc/Lucas_Interpreter
    12   \<open>(*?!?\<close> identifies a design question
    13 
    14 Distillation of "rounds of reforms":
    15   \<open>TODOs from current changesets\<close> \<rightarrow> \<open>Postponed from current changeset\<close> \<rightarrow>
    16   (*to be removed..*) \<rightarrow> \<open>Separated tasks\<close> (*.. to be removed*)
    17   \<rightarrow> subsection of \<open>Major reforms\<close>
    18 \<close>
    19 
    20 section \<open>TODOs from current changesets\<close>
    21 text\<open>
    22   Shift more complicated issues from  \<open>Current changeset\<close> to \<open>Postponed from current changeset\<close>
    23 \<close>
    24 subsection \<open>Current changeset\<close>
    25 text \<open>
    26 (*/------- to  from -------\*)
    27 (*\------- to  from -------/*)
    28   \begin{itemize}
    29   \item xxx
    30   \item xxx
    31   \item as soon as src/../parseC.sml is stable,
    32     remove defs from Test_Parse_Isac.thy
    33     + and shift tests from Test_Parse_Isac -> test/../parseC.sml
    34   \item xxx
    35   \item Specify.find_next_step: References.select
    36     cpI = ["vonBelastungZu", "Biegelinien"]: References_Def.id
    37                                       ^^^^^  Problem.id
    38   \item xxx
    39   \item Calc.state_empty_post \<rightarrow> Calc.state_post_empty
    40   \item xxx
    41   \item distribute code from test/../calchead.sml
    42   \item xxx
    43   \item rename Tactic.Calculate -> Tactic.Evaluate
    44   \item xxx
    45   \item replace src/ Erls by Rule_Set.Empty
    46   \item xxx
    47   \item rename ptyps.sml -> specify-etc.sml
    48         rename Specify -> Specify_Etc
    49         rename Specify -> Specify
    50   \item xxx
    51   \item specific_from_prog in..end: replace o by |> (Test_Isac or Test_Some!)
    52   \item xxx
    53   \item cleanup ThmC in MathEngBasic
    54   \item xxx
    55   \item xxx
    56   \item xxx
    57   \item xxx
    58   \item xxx
    59   \item xxx
    60   \item xxx
    61   \item xxx
    62   \end{itemize}
    63 \<close>
    64 subsection \<open>Postponed from current changeset\<close>
    65 text \<open>
    66   \begin{itemize}
    67   \item xxx
    68   \item make steps around SubProblem more consistent:
    69     SubProblem (thy, [pbl]) is bypassed by Model_Problem, if it is 1st Tactic in a Program.
    70     Design:
    71     * the Tactic SubProblem (thy, [pbl]) creates the formula SubProblem (thy, [pbl])
    72       (only the headline !)
    73     * the Tactic Model_Problem starts Specification
    74       (with an empty Model)
    75     see test/../sub-problem.sml
    76   \item xxx
    77   \item Specify_Step.add has dummy argument Istate_Def.Uistate -- remove down to Ctree
    78   \item xxx
    79   \item Step_Specify.by_tactic (Tactic.Model_Problem' (id, _, met))
    80                      by_tactic (Tactic.Specify_Theory' domID)
    81     had very old, strange code at 11b5b8b81876
    82     ?redes Model_Problem', Specify_Theory' <--> Specify_Method: Step_Specify.complet_for ?
    83     INTERMED. NO REPAIR: NOT PROMPTED IN TESTS
    84   \item xxx
    85   \item unify code Specify.find_next_step <--> Step_Specify.by_tactic (Tactic.Specify_Method'
    86   \item xxx
    87   \item Isa20.implementation: 0.2.4 Printing ML values ?INSTEAD? *.TO_STRING ???
    88     ??? writeln ( make_string {x = x, y = y}); ???
    89   \item xxx
    90   \item revise O_Model and I_Model with an example with more than 1 variant.
    91   \item xxx
    92   \item ctxt is superfluous in specify-phase due to type constraints from Descript.thy
    93   \item xxx
    94   \item Derive.do_one: TODO find code in common with complete_solve
    95         Derive.embed: TODO rewrite according to CAO (+ no intermediate access to Ctree)
    96   \item xxx
    97   \item Solve_Check: postponed parsing input to _ option
    98   \item xxx
    99   \item ? "fetch-tactics.sml" from Mathengine -> BridgeLibisabelle ?
   100   \item xxx
   101   \item ? unify struct.Step and struct.Solve in MathEngine ?
   102   \item xxx
   103   \item use "Eval_Def" for renaming identifiers
   104   \item xxx
   105   \item why does Test_Build_Thydata.thy depend on ProgLang and not on CalcElements ?
   106   \item xxx
   107   \item xxx
   108   \begin{itemize}
   109   \item LI.do_next (*TODO RM..*) ???
   110   \item generate.sml: RM datatype edit TOGETHER WITH datatype inout
   111   \item TermC.list2isalist: typ -> term list -> term  .. should NOT requires typ
   112   \item get_ctxt_LI should replace get_ctxt
   113   \item ALL CODE: rename spec(ification) --> know(ledge), in Specification: Relation -> Knowledge
   114   \item rename   Base_Tool.thy  <---         Base_Tools
   115   \item adopt naming conventions in Knowledge: EqSystem --> Equation_System, etc
   116   \item rename field scr in meth
   117   \item DEL double code: nxt_specify_init_calc IN specify.sml + step-specify.sml
   118   \item xxx
   119   \item xxx
   120   \item xxx
   121   \item xxx
   122   \item xxx
   123   \item xxx
   124   \item xxx
   125   \item clarify Tactic.Subproblem (domID, pblID) as term in Pstate {act_arg, ...}
   126      there it is Free ("Subproblem", "char list \<times> ..
   127      instead of  Const (|???.Subproblem", "char list \<times> ..
   128      AND THE STRING REPRESENTATION IS STRANGE: 
   129        Subproblem (''Test'',
   130         ??.\ <^const> String.char.Char ''LINEAR'' ''univariate'' ''equation''
   131          ''test'')
   132      ML \<open>
   133      \<close> ML \<open>
   134      term2str; (*defined by..*)
   135      fun term_to_string''' thy t =
   136        let
   137          val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
   138        in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
   139      \<close> ML \<open>
   140      val t = @{term "aaa + bbb"}
   141      val t = @{term "Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation''])"};
   142      \<close> ML \<open>
   143      val sss = Print_Mode.setmp [] (Syntax.string_of_term @{context}) t
   144      \<close> ML \<open>
   145      writeln sss (*.. here perfect: Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation'']) *)
   146      \<close> ML \<open>
   147      \<close>
   148   \item xxx
   149   \item xxx
   150   \item cleanup fun me:
   151     fun me (*(_, Empty_Tac) p _ _ = raise ERROR ("me:  Empty_Tac at " ^ pos'2str p)
   152       | me*) (_, tac) p _(*NEW remove*) pt =
   153     + -------------------------^^^^^^
   154     # see test-code.sml fun me_trace
   155       use this also for me, not only for me_ist_ctxt; del. me
   156       this requires much updating in all test/*
   157   \item xxx
   158   \item shift tests into NEW model.sml (upd, upds_envv, ..)
   159   \item xxx
   160   \item clarify handling of contexts ctxt ContextC
   161     \begin{itemize}
   162     \item xxx
   163     \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
   164     \item xxx
   165     \item Check_Elementwise "Assumptions": prerequisite for ^^goal
   166       rm tactic Check_elementwise "Assumptions" in a way, which keeps it for Minisubpbl
   167       rm Assumptions  :: bool  (* TODO: remove with making ^^^ idle *)
   168     \item xxx
   169     \item xxx
   170     \end{itemize}
   171   \item xxx
   172   \item xxx
   173   \item complete mstools.sml (* survey on handling contexts:
   174   \item xxx
   175   \item xxx
   176   \item xxx
   177   \item xxx
   178   \item librarys.ml --> libraryC.sml + text from termC.sml
   179   \item xxx
   180   \item xxx
   181   \item xxx
   182   \item xxx
   183   \item xxx
   184   \item xxx
   185   \item concentrate "insert_assumptions" for locate_input_tactic in "associate", ?OR? Tactic.insert_assumptions
   186                                    DONE  for find_next_step by Tactic.insert_assumptions m' ctxt 
   187     \begin{itemize}
   188     \item rm from "generate1" ("Detail_Set_Inst'", Tactic.Detail_Set' ?)
   189     \item ?"insert_assumptions" necessary in "init_pstate" ?+++? in "applicable_in" ?+++? "associate"
   190     \item xxx
   191     \item xxx
   192     \item DO DELETIONS AFTER analogous concentrations in find_next_step
   193     \end{itemize}
   194   \item xxx
   195   \item ? what is the difference headline <--> cascmd in
   196     Subproblem' (spec, oris, headline, fmz_, context, cascmd)
   197   \item Substitute' what does "re-calculation mean in the datatype comment?
   198   \item xxx
   199   \item inform: TermC.parse (ThyC.get_theory "Isac_Knowledge") istr --> parseNEW context istr
   200   \item xxx
   201   \item unify/clarify stac2tac_ | 
   202     \begin{itemize}
   203     \item xxx
   204     \item extract common code from associate.. stac2tac_xxx
   205     \item rename LItool.tac_from_prog -> Tactic.from_prog_tac ? Solve_Tac.from_prog_tac,
   206     \item xxx
   207     \item xxx
   208     \end{itemize}
   209   \item xxx
   210   \item unify in signature LANGUAGE_TOOLS =\\
   211     val pblterm: ThyC.id -> Problem.id -> term     vvv        vvv\\
   212     val subpbl: string -> string list -> term          unify with ^^^
   213   \item xxx
   214   \item Telem.safe is questionable: has it been replaced by Safe_Step, Not_Derivable, Helpless, etc?
   215     Note: replacement of Istate.safe by Istate.appy_ didn't care much about Telem.safe.
   216     If Telem.safe is kept, consider merge with CTbasic.ostate
   217   \item xxx
   218   \item remove find_next_step from solve Apply_Method';
   219     this enforces Pos.at_first_tactic, which should be dropped, too.
   220   \item xxx
   221   \item xxx
   222   \item xxx
   223   \end{itemize}
   224 \<close>
   225 subsection \<open>Postponed --> Major reforms\<close>
   226 text \<open>
   227   \begin{itemize}
   228   \item xxx          
   229   \item xxx
   230   \item make parser mutually recursive for Problem .. Solution
   231     preps. in Test_Parse_Isac:
   232       Test_Parse_Isac:
   233         subsubsection "problem_mini" shows a principal issue with recursive parsing
   234         probably due to !2! arguments of parser (as shown in Cookbook)
   235       Test_Parsers_Cookbook:
   236         (* recursive parser p.140 \<section>6.1 adapted to tokens: *) shows differences,
   237         which might help understanding the principal issue
   238     see also Test_Parsers  subsection "recursive parsing"
   239   \item xxx
   240   \item xxx          
   241   \item xxx          
   242   \item revisit bootstrap Calcelements. rule->calcelems->termC
   243     would be nice, but is hard: UnparseC.terms -> TermC.s_to_string
   244   \item xxx
   245   \item replace all Ctree.update_* with Ctree.cupdate_problem
   246   \item xxx
   247   \item rename (ist as {eval, ...}) -> (ist as {eval_rls, ...})
   248   \item xxx
   249   \item exception PROG analogous to TERM
   250   \item xxx
   251   \item sig/struc ..elems --> ..elem
   252   \item xxx          
   253   \item distille CAS-command, CAScmd, etc into a struct
   254   \item xxx          
   255   \item check location of files:
   256         test/Tools/isac/Interpret/ptyps.thy
   257         test/Tools/isac/Specify.ptyps.sml
   258   \item xxx
   259   \item check occurences of Atools in src/ test/
   260   \item Const ("Atools.pow", _) ---> Const ("Base_Tool.pow", _) 
   261   \item xxx          
   262   \item rm Float
   263   \item xxx
   264   \item Diff.thy: differentiateX --> differentiate after removal of script-constant
   265   \item Test.thy: met_test_sqrt2: deleted?!
   266   \item xxx          
   267   \item Rewrite_Ord.rew_ord' := overwritel (! Rewrite_Ord.rew_ord', (*<<<---- use Know_Store.xxx, too*)
   268   \item xxx
   269     \item automatically extrac rls from program-code 
   270       ? take ["SignalProcessing", "Z_Transform", "Inverse_sub"] as an example ?
   271   \item xxx          
   272   \item finish output of LItool.trace with Check_Postcond (useful for SubProblem)
   273   \item xxx
   274   \item replace Rule_Set.empty by Rule_Set.Empty
   275     latter is more clear, but replacing ***breaks rewriting over all examples***,
   276     e.g. see ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x'
   277     in Minisubplb/200-start-method-NEXT_STEP.sml:
   278      (*+* )------- in f3cac3053e7b (Rule_Set.empty just renamed, NOT deleted) we had
   279      (*+*)  prls =
   280      (*+*)    Rls {calc = [], erls = Erls, errpatts = [], id = "empty", preconds = [], rew_ord =
   281      (*+*)      ("dummy_ord", fn), rules = [], scr = Empty_Prog, srls = Erls}:
   282      (*+*).. THIS IS Rule_Set.empty, BUT IT DID not CAUSE ANY ERROR !
   283      (*+*)------- WITH Rule_Set.empty REMOVED (based on f3cac3053e7b) we had
   284      (*+*)val Empty = prls (* <---ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x' *)
   285      ( *+*)val ["sqroot-test", "univariate", "equation", "test"] = cpI
   286     THAT INDICATES, that much rewriting/evaluating JUST WORKED BY CHANCE?!?
   287   \item xxx          
   288   \item xxx
   289   \item xxx          
   290   \item xxx
   291   \item xxx          
   292   \item xxx
   293   \item xxx          
   294   \end{itemize}
   295 \<close>
   296 
   297 section \<open>Major reforms\<close>
   298 text \<open>
   299 \<close>
   300 subsection \<open>Exception Size raised\<close>
   301 text \<open>
   302   During update Isabelle2018 --> Isabelle2019 we noticed, that
   303   "isabelle build" uses resources more efficiently than "isabelle jedit".
   304   The former works, but the latter causes 
   305   \begin{itemize}
   306   \item "Exception- Size raised"
   307     in Build_Thydata.thy
   308   \item "exception Size raised (line 169 of "./basis/LibrarySupport.sml")"
   309     in test/../biegelinie-*.xml.
   310   \end{itemize}
   311   This has been detected after changeset (30cd47104ad7) "lucin: reorganise theories in ProgLang".
   312 
   313   Find tools to investigate the Exception, and find ways around it eventually.
   314 \<close>
   315 subsection \<open>Cleanup & review signatures wrt. implementation.pdf canonical argument order\<close>
   316 text \<open>
   317   \begin{itemize}
   318   \item there are comments in several signatures
   319   \item ML_file "~~/src/Tools/isac/Interpret/specification-elems.sml" can be (almost) deleted
   320   \item src/../Frontend/: signatures missing
   321   \item xxx
   322   \end{itemize}
   323 \<close>
   324 subsection \<open>overall structure of code\<close>
   325 text \<open>
   326   \begin{itemize}
   327   \item try to separate Isac_Knowledge from MathEngine
   328     common base: Knowledge_Author / ..??
   329   \item xxx
   330   \item  ML_file "~~/src/Tools/isac/Interpret/ctree.sml" (*shift to base in common with Interpret*)
   331   \item xxx
   332   \item xxx
   333   \item xxx
   334   \end{itemize}
   335 \<close>
   336 subsection \<open>Separate MathEngineBasic/ Specify/ Interpret/ MathEngine/\<close>
   337 text \<open>
   338   \begin{itemize}
   339   \item xxx
   340   \item xxx
   341   \item re-organise code for Interpret
   342     \begin{itemize}
   343     \item Step*: Step_Specify | Step_Solve | Step DONE
   344     \item xxx
   345     \item Prog_Tac: fun get_first_argument takes both Prog_Tac + Program --- wait for separate Tactical
   346       then shift into common descendant
   347     \item xxx
   348     \end{itemize}
   349   \item xxx
   350   \item xxx
   351   \item ??????????? WHY CAN LI.by_tactic NOT BE REPLACED BY Step_Solve.by_tactic ???????????
   352   \item xxx
   353   \item xxx
   354   \end{itemize}
   355 \<close>
   356 subsection \<open>Review modelling- + specification-phase\<close>
   357 text \<open>
   358   \begin{itemize}
   359   \item xxx
   360   \item xxx
   361   \item xxx
   362   \item check match between args of partial_function and model-pattern of meth;
   363      provide error message.
   364   \item xxx
   365   \item "--- hack for funpack: generalise handling of meths which extend problem items ---"
   366     \begin{itemize}
   367     \item see several locations of hack in code
   368     \item these locations are NOT sufficient, see
   369       test/../biegelinie-3.sml --- IntegrierenUndKonstanteBestimmen2: Bsp.7.70. auto ---
   370     \item "fun associate" "match_ags ..dI" instead "..pI" breaks many tests, however,
   371       this would be according to survey Notes (3) in src/../calchead.sml.
   372     \end{itemize}
   373   \item see "failed trial to generalise handling of meths"98298342fb6d
   374   \item abstract specify + nxt_specif to common aux-funs;
   375     see e.g. "--- hack for funpack: generalise handling of meths which extend problem items ---"
   376   \item xxx
   377   \item type model = itm list ?
   378   \item review survey Notes in src/../calchead.sml: they are questionable
   379   \item review copy-named, probably two issues commingled 
   380     \begin{itemize}
   381     \item special handling of "#Find#, because it is not a formal argument of partial_function
   382     \item special naming for solutions of equation solving: x_1, x_2, ...
   383     \end{itemize}
   384   \item xxx
   385   \item xxx
   386   \item this has been written in one go:
   387     \begin{itemize}
   388     \item reconsidering I_Model.max_vt, use problem with meth ["DiffApp", "max_by_calculus"]
   389     \item reconsider add_field': where is it used for what? Shift into mk_oris
   390     \item reconsider match_itms_oris: where is it used for what? max_vt ONLY???
   391     \item in Specify_Method search root-oris for items (e.g. "errorBound"), #1# in survey
   392     \item Specify_Problem, Specify_Method: check respective identifiers after re-Specify_
   393       (relevant for pre-condition)
   394     \item unify match_ags to mk_oris1..N with different args (fmz | pat list, pbl | meth
   395     \item 
   396     \end{itemize}
   397   \end{itemize}
   398 \<close>
   399 subsection \<open>taci list, type step\<close>
   400 text \<open>
   401 taci was, most likely, invented to make "fun me" more efficient by avoiding duplicate rewrite,
   402 and probably, because the Kernel interface separated setNextTactic and applyTactic.
   403 Both are no good reasons to make code more complicated.
   404 
   405 !!! taci list is used in do_next !!!
   406 
   407   \begin{itemize}
   408   \item xxx
   409   \item can lev_on_total replace lev_on ? ..Test_Isac_Short + rename lev_on_total -> lev_on
   410   \item xxx
   411   \item Step* functions should return Calc.T instead of Calc.state_post
   412   \item xxx
   413   \item states.sml: check, when "length tacis > 1"
   414   \item in Test_Isac.thy there is only 1 error in Interpret/inform.sml
   415   \item (*WN190713 REMOVE: "creating a new node" was never implemented for more than one node?!?
   416   \item xxx
   417   \item brute force setting all empty ([], [], ptp) works!?! but ptp causes errors -- investigate!
   418   \item xxx
   419   \end{itemize}
   420 \<close>
   421 subsection \<open>Ctree\<close>
   422 text \<open>
   423 analysis
   424 # mixture pos' .. pos in cappend_*, append_* is confusing
   425 # existpt p pt andalso Tactic.is_empty DIFFERENT IN append_*, cappend_* is confusing
   426   "exception PTREE "get_obj: pos =" ^^^^^: ^^^^ due to cut !!!
   427   NOTE: exn IN if..andalso.. IS NOT!!! DETECTED, THIS                       is confusing
   428   see test/../--- Minisubpbl/800-append-on-Frm.sml ---
   429 # ?!? "cut branches below cannot be decided here" in append_atomic
   430 # sign. of functions too different ?!?canonical arg.order ?!?
   431   \begin{itemize}
   432   \item xxx
   433   \item remove update_branch, update_*? -- make branch, etc args of append_*
   434   \item xxx
   435   \item close sig Ctree, contains cappend_* ?only? --- ?make parallel to ?Pide_Store?
   436   \item xxx
   437   \item unify args to Ctree.state (pt, p)
   438   \item  fun update_env       .. repl_env                   \<rightarrow>updatempty
   439   \item xxx
   440   \item xxx
   441   \item xxx
   442   \item xxx
   443   \end{itemize}
   444 \<close>
   445 subsection \<open>replace theory/thy by context/ctxt\<close>
   446 text \<open>
   447   \begin{itemize}
   448   \item xxx
   449   \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
   450     special case: Tactic.Refine_Problem
   451   \item xxx
   452   \item theory can be retrieved from ctxt by Proof_Context.theory_of
   453   \item xxx
   454   \item cleaup the many conversions string -- theory
   455   \item make dest_spec --> (theory, pblID, metID) ?+ common_subthy ?
   456   \item 1. Rewrite.eval_true_, then
   457     LItool.check_leaf, Rewrite.eval_prog_expr, Step.add, LItool.tac_from_prog.
   458   \item fun associate
   459     let val thy = ThyC.get_theory "Isac_Knowledge";(*TODO*)
   460   \item xxx
   461   \item xxx
   462   \item in locate_input_tactic .. ?scan_dn1?; Program.is_eval_expr   .use  Term.exists_Const
   463   \item push srls into pstate
   464   \item lucas-intrpreter.locate_input_tactic: scan_to_tactic1 srls tac cstate (progr, Rule_Set.Empty)
   465                                                                                       ^^^^^^^^^^^^^^^
   466   \item xxx
   467   \end{itemize}
   468 \<close>
   469 subsection \<open>Rfuns, Begin_/End_Detail', Rrls, Istate\<close>
   470 text \<open>
   471 remove refactor Rfuns, Rule.Prog, Rule.Empty_Prog, RrlsState: this is a concept never brought to work.
   472   Clarify relation to reverse rewriting!
   473   \begin{itemize}
   474   \item separate mut.recursion program with rule and rls by deleting fild scr in rls
   475     (possible since CS 43160c1e775a
   476   ` "replace Prog. in prep_rls by Auto_Prog.gen, which generates Prog. on the fly" )
   477   \item xxx
   478   \item probably only "normal_form" seems to be needed
   479   \item deleted Rfuns in NEW "locate_input_tactic": no active test for "locate_rule"
   480     but that seems desirable
   481   \item ?how is the relation to reverse-rewriting ???
   482   \item "Rfuns" markers in test/../rational
   483   \item xxx
   484   \item datatype istate (Istate.T): remove RrlsState, pstate: use Rrls only for creating results beyond
   485     rewriting and/or respective intermediate steps (e.g. cancellation of fractions).
   486     Thus we get a 1-step-action which does NOT require a state beyond istate/pstate.
   487     Thus we drastically reduce complexity, also get rid of "fun from_pblobj_or_detail_calc" , etc.
   488   \item debug ^^^ related: is there an occurence of Steps with more than 1 element?
   489   \item xxx
   490   \item and do_next (* WN1907: ?only for Begin_/End_Detail' DEL!!!*)
   491   \item xxx
   492   \item shouldn't go Rfuns from Rewrite --> Rewrite_Set; they behave similar to "fun interSteps" ?
   493   \item xxx
   494   \item ?finally Prog could go from Calcelems to ProgLang?
   495   \end{itemize}
   496 \<close>
   497 subsection \<open>Inverse_Z_Transform.thy\<close>
   498 text \<open>
   499   \begin{itemize}
   500   \item\label{new-var-rhs} rule1..6, ruleZY introduce new variables on the rhs of the rewrite-rule.
   501   ? replace rewriting with substitution ?!?
   502   The problem is related to the decision of typing for "d_d" and making bound variables free (while
   503   shifting specific handling in equation solving etc. to the meta-logic). 
   504   \item Find "stepResponse (x[n::real]::bool)" is superfluous, because immediately used by
   505     rewrite-rules; see \ref{new-var-rhs}.
   506   \item Reconsider whole problem:
   507     input only the polynomial as argument of partial_function, in ([1], Frm) compile lhs "X z" ?
   508   \end{itemize}
   509 \<close>
   510 subsection \<open>Adopt Isabelle's numerals for Isac\<close>
   511 text \<open>
   512   \begin{itemize}
   513   \item replace numerals of type "real" by "nat" in some specific functions from ListC.thy
   514     and have both representations in parallel for "nat".
   515   \item xxx
   516   \item xxx
   517   \end{itemize}
   518 \<close>
   519 subsection \<open>Redesign equation solver\<close>
   520 text \<open>
   521   Existing solver is structured along the WRONG assumption,
   522   that Poly.thy must be the LAST thy among all thys involved -- while the opposite is the case.
   523 
   524   Preliminary solution: all inappropriately located thms are collected in Base_Tools.thy
   525 \<close>
   526 subsection \<open>Finetunig required for xmldata in kbase\<close>
   527 text \<open>
   528   See xmldata https://intra.ist.tugraz.at/hg/isac/rev/5b222a649390
   529   and in kbase html-representation generated from these xmldata.
   530   Notes in ~~/xmldata/TODO.txt.
   531 \<close>
   532 
   533 section \<open>Hints for further development\<close>
   534 text \<open>
   535 \<close>
   536 subsection \<open>Coding standards & some explanations for math-authors\<close>
   537 text \<open>copy from doc/math-eng.tex WN.28.3.03
   538 WN071228 extended\<close>
   539 
   540 subsubsection \<open>Identifiers\<close>
   541 text \<open>Naming is particularily crucial, because Isabelles name space is global, and isac does
   542   not yet use the novel locale features introduces by Isar. For instance, {\tt probe} sounds
   543   reasonable as (1) a description in the model of a problem-pattern, (2) as an element of the
   544   problem hierarchies key, (3) as a socalled CAS-command, (4) as the name of a related script etc.
   545   However, all the cases (1)..(4) require different typing for one and the same
   546   identifier {\tt probe} which is impossible, and actually leads to strange errors
   547   (for instance (1) is used as string, except in a script addressing a Subproblem).
   548 
   549   These are the preliminary rules for naming identifiers>
   550   \begin{description}
   551   \item [elements of a key] into the hierarchy of problems or methods must not contain
   552     capital letters and may contain underscrores, e.g. {\tt probe, for_polynomials}.
   553   \item [descriptions in problem-patterns] must contain at least 1 capital letter and
   554     must not contain underscores, e.g. {\tt Probe, forPolynomials}.
   555   \item [CAS-commands] follow the same rules as descriptions in problem-patterns above, thus
   556     beware of conflicts~!
   557   \item [script identifiers] always end with {\tt Program}, e.g. {\tt ProbeScript}.
   558   \item [???] ???
   559   \item [???] ???
   560   \end{description}
   561 %WN071228 extended\<close>
   562 
   563 subsubsection \<open>Rule sets\<close>
   564 text \<open>The actual version of the coding standards for rulesets is in {\tt /IsacKnowledge/Atools.ML
   565   where it can be viewed using the knowledge browsers.
   566 
   567   There are rulesets visible to the student, and there are rulesets visible (in general) only for
   568   math authors. There are also rulesets which {\em must} exist for {\em each} theory;
   569   these contain the identifier of the respective theory (including all capital letters) 
   570   as indicated by {\it Thy} below.
   571 
   572   \begin{description}
   573   \item [norm\_{\it Thy}] exists for each theory, and {\em efficiently} calculates a
   574     normalform for all terms which can be expressed by the definitions of the respective theory
   575     (and the respective parents).
   576   \item [simplify\_{\it Thy}] exists for each theory, and calculates a normalform for all terms
   577     which can be expressed by the definitions of the respective theory (and the respective parents)
   578     such, that the rewrites can be presented to the student.
   579   \item [calculate\_{\it Thy}] exists for each theory, and evaluates terms with 
   580     numerical constants only (i.e. all terms which can be expressed by the definitions of
   581     the respective theory and the respective parent theories). In particular, this ruleset includes
   582     evaluating in/equalities with numerical constants only.
   583     WN.3.7.03: may be dropped due to more generality: numericals and non-numericals
   584     are logically equivalent, where the latter often add to the assumptions
   585     (e.g. in Check_elementwise).
   586   \end{description}
   587 
   588   The above rulesets are all visible to the user, and also may be input; 
   589   thus they must be contained in {\tt Theory_Data} (KEStore_Elems.add_rlss,
   590   KEStore_Elems.get_rlss). All these rulesets must undergo a preparation
   591   using the function {\tt prep_rls'}, which generates a script for stepwise rewriting etc.
   592   The following rulesets are used for internal purposes and usually invisible to the (naive) user:
   593 
   594   \begin{description}
   595   \item [*\_erls] TODO
   596   \item [*\_prls] 
   597   \item [*\_srls] 
   598   \end{description}
   599 {\tt Rule_Set.append_rules, Rule_Set.merge, remove_rls} TODO
   600 \<close>
   601 
   602 subsection \<open>get proof-state\<close>
   603 text \<open>
   604   Re: [isabelle] Programatically get "this"
   605   ----------------------------------------------------
   606   So here is my (Makarius') version of your initial example, following these principles:
   607   begin{verbatim}
   608     notepad
   609     begin
   610       assume a: A
   611       ML_val \<open>
   612         val ctxt = @{context};
   613     
   614         val this_name =
   615           Name_Space.full_name (Proof_Context.naming_of ctxt) (Binding.name Auto_Bind.thisN);
   616         val this = #thms (the (Proof_Context.lookup_fact ctxt this_name));
   617       \<close>
   618     end
   619   end{verbatim}
   620 \<close>
   621 subsection \<open>write Specification to jEdit\<close>
   622 text \<open>
   623   Re: [isabelle] Printing terms with type annotations
   624   ----------------------------------------------------
   625   On 06/02/2019 17:52, Moa Johansson wrote:
   626   >
   627   > I’m writing some code that should create a snippet of Isar script.
   628   
   629   This is how Sledgehammer approximates this:
   630   
   631   http://isabelle.in.tum.de/repos/isabelle/file/Isabelle2018/src/HOL/Tools/Sledgehammer/sledgehammer_isar_proof.ML#l299
   632   
   633   (The module name already shows that the proper terminology is "Isar
   634   proof" (or "Isar proof text").  Proof scripts are a thing from the past,
   635   before Isar. You can emulate old-style proof scripts via a sequence of
   636   'apply' commands, but this is improper Isar.)
   637   
   638   Note that there is no standard function in Isabelle/Pure, because the
   639   problem to print just the right amount of type information is very
   640   complex and not fully solved. One day, after 1 or 2 rounds of
   641   refinements over the above approach, it might become generally available.
   642 \<close>
   643 subsection \<open>follow Isabelle conventions (*Does not yet work in Isabelle2018\<close>
   644 text \<open>
   645   isabelle update -u path_cartouches
   646   isabelle update -u inner_syntax_cartouches
   647 \<close>
   648 section \<open>Questions to Isabelle experts\<close>
   649 text \<open>
   650 \begin{itemize}
   651 \item ad ERROR Undefined fact "all_left"        in Test_Isac: error-pattern.sml
   652                Undefined fact: "xfoldr_Nil"                   inssort.sml
   653     (* probably two different reasons:
   654     src/../LinEq.thy
   655       (*WN0509 compare PolyEq.all_left "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)"*)
   656       all_left:          "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)" and
   657     
   658     src/../PolyEq.thy
   659       (*WN0509 compare LinEq.all_left "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)"*)
   660       all_left:              "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)" and
   661     
   662     test/../partial_fractions.sml
   663     (*[7], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["PolyEq", "normalise_poly"])*)
   664     (*[7, 1], Frm*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Rewrite ("all_left", "\<not> ?b =!= 0 \<Longrightarrow> (?a = ?b) = (?a - ?b = 0)"))*)
   665     
   666     test/../mathengine-stateless.sml
   667     (*if ThmC.string_of_thm @ {thm rnorm_equation_add} =  "\<not> ?b =!= 0 \<Longrightarrow> (?a = ?b) = (?a + - 1 * ?b = 0)"
   668     then () else error "string_of_thm changed";*)
   669     
   670     (*---------------------------------------------------------------------------------------------*)
   671     src/../LinEq.thy
   672     primrec xfoldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a xlist \<Rightarrow> 'b \<Rightarrow> 'b" where
   673     xfoldr_Nil:  "xfoldr f {|| ||} = id" |
   674     xfoldr_Cons: "xfoldr f (x @# xs) = f x \<circ> xfoldr f xs"
   675     
   676     src/../InsSort.thy
   677         srls = Rule_Set.empty, calc = [], rules = [
   678           Rule.Thm ("xfoldr_Nil",(*num_str*) @{thm xfoldr_Nil} (* foldr ?f [] = id *)),
   679     *)
   680 \item xxx
   681 \item xxx
   682 \item ?OK Test_Isac_Short with
   683     LI.by_tactic tac (get_istate_LI pt p, get_ctxt_LI pt p) ptp
   684   instead
   685     LI.by_tactic tac (Istate.empty, ContextC.empty) ptp
   686   in step-solve ?
   687 \item xxx
   688 \item test from last CS with outcommented re-def of code -> 
   689   -> \<open>further tests additional to src/.. files\<close>
   690       ADDTESTS/redefined-code.sml
   691 \item xxx
   692 \item efb749b79361 Test_Some_Short.thy has 2 errors, which disappear in thy ?!?:
   693   ML_file "Interpret/error-pattern.sml" Undefined fact: "all_left"
   694   ML_file "Knowledge/inssort.sml" Undefined fact: "xfoldr_Nil"
   695 \item xxx
   696 \item what is the actual replacement of "hg log --follow" ?
   697 \item xxx
   698 \item how HANDLE these exceptions, e.g.:
   699     Syntax.read_term ctxt "Randbedingungen y 0 = (0::real), y L = 0, M_b 0 = 0, M_b L = 0]"
   700   GIVES
   701     "Inner syntax error
   702      Failed to parse term"
   703 \item xxx
   704 \item how cope with "exception Size raised (line 171 of "./basis/LibrarySupport.sml")"
   705   e.g. in test/Interpret/lucas-interpreter.sml
   706 \item xxx
   707 \item xxx
   708 \end{itemize}
   709 \<close>
   710 
   711 section \<open>For copy & paste\<close>
   712 text \<open>
   713 \begin{itemize}
   714 \item xxx
   715   \begin{itemize}
   716   \item xxx
   717     \begin{itemize}
   718     \item xxx
   719       \begin{itemize}
   720       \item xxx
   721         \begin{itemize}
   722         \item xxx
   723         \end{itemize}
   724       \end{itemize}
   725     \end{itemize}
   726   \end{itemize}
   727 \end{itemize}
   728 \<close>
   729 subsection \<open>xxx\<close>
   730 subsubsection \<open>xxx\<close>
   731 end