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