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
119 \item DEL double code: nxt_specify_init_calc IN specify.sml + step-specify.sml
127 \item clarify Tactic.Subproblem (domID, pblID) as term in Pstate {act_arg, ...}
128 there it is Free ("Subproblem", "char list \<times> ..
129 instead of Const (|???.Subproblem", "char list \<times> ..
130 AND THE STRING REPRESENTATION IS STRANGE:
131 Subproblem (''Test'',
132 ??.\ <^const> String.char.Char ''LINEAR'' ''univariate'' ''equation''
136 term2str; (*defined by..*)
137 fun term_to_string''' thy t =
139 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
140 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
142 val t = @{term "aaa + bbb"}
143 val t = @{term "Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation''])"};
145 val sss = Print_Mode.setmp [] (Syntax.string_of_term @{context}) t
147 writeln sss (*.. here perfect: Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation'']) *)
152 \item cleanup fun me:
153 fun me (*(_, Empty_Tac) p _ _ = raise ERROR ("me: Empty_Tac at " ^ pos'2str p)
154 | me*) (_, tac) p _(*NEW remove*) pt =
155 + -------------------------^^^^^^
156 # see test-code.sml fun me_trace
157 use this also for me, not only for me_ist_ctxt; del. me
158 this requires much updating in all test/*
160 \item shift tests into NEW model.sml (upd, upds_envv, ..)
162 \item clarify handling of contexts ctxt ContextC
165 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
167 \item Check_Elementwise "Assumptions": prerequisite for ^^goal
168 rm tactic Check_elementwise "Assumptions" in a way, which keeps it for Minisubpbl
169 rm Assumptions :: bool (* TODO: remove with making ^^^ idle *)
175 \item complete mstools.sml (* survey on handling contexts:
180 \item librarys.ml --> libraryC.sml + text from termC.sml
187 \item concentrate "insert_assumptions" for locate_input_tactic in "associate", ?OR? Tactic.insert_assumptions
188 DONE for find_next_step by Tactic.insert_assumptions m' ctxt
190 \item rm from "generate1" ("Detail_Set_Inst'", Tactic.Detail_Set' ?)
191 \item ?"insert_assumptions" necessary in "init_pstate" ?+++? in "applicable_in" ?+++? "associate"
194 \item DO DELETIONS AFTER analogous concentrations in find_next_step
197 \item ? what is the difference headline <--> cascmd in
198 Subproblem' (spec, oris, headline, fmz_, context, cascmd)
199 \item Substitute' what does "re-calculation mean in the datatype comment?
201 \item inform: TermC.parse (ThyC.get_theory "Isac_Knowledge") istr --> parseNEW context istr
203 \item unify/clarify stac2tac_ |
206 \item extract common code from associate.. stac2tac_xxx
207 \item rename LItool.tac_from_prog -> Tactic.from_prog_tac ? Solve_Tac.from_prog_tac,
212 \item unify in signature LANGUAGE_TOOLS =\\
213 val pblterm: ThyC.id -> Problem.id -> term vvv vvv\\
214 val subpbl: string -> string list -> term unify with ^^^
216 \item Telem.safe is questionable: has it been replaced by Safe_Step, Not_Derivable, Helpless, etc?
217 Note: replacement of Istate.safe by Istate.appy_ didn't care much about Telem.safe.
218 If Telem.safe is kept, consider merge with CTbasic.ostate
220 \item remove find_next_step from solve Apply_Method';
221 this enforces Pos.at_first_tactic, which should be dropped, too.
227 subsection \<open>Postponed --> Major reforms\<close>
232 \item make parser mutually recursive for Problem .. Solution
233 preps. in Test_Parse_Isac:
235 subsubsection "problem_mini" shows a principal issue with recursive parsing
236 probably due to !2! arguments of parser (as shown in Cookbook)
237 Test_Parsers_Cookbook:
238 (* recursive parser p.140 \<section>6.1 adapted to tokens: *) shows differences,
239 which might help understanding the principal issue
240 see also Test_Parsers subsection "recursive parsing"
244 \item revisit bootstrap Calcelements. rule->calcelems->termC
245 would be nice, but is hard: UnparseC.terms -> TermC.s_to_string
247 \item replace all Ctree.update_* with Ctree.cupdate_problem
249 \item rename (ist as {eval, ...}) -> (ist as {eval_rls, ...})
251 \item exception PROG analogous to TERM
253 \item sig/struc ..elems --> ..elem
255 \item distille CAS-command, CAScmd, etc into a struct
257 \item check location of files:
258 test/Tools/isac/Interpret/ptyps.thy
259 test/Tools/isac/Specify.ptyps.sml
261 \item check occurences of Atools in src/ test/
262 \item Const ("Atools.pow", _) ---> Const ("Base_Tool.pow", _)
266 \item Diff.thy: differentiateX --> differentiate after removal of script-constant
267 \item Test.thy: met_test_sqrt2: deleted?!
269 \item Rewrite_Ord.rew_ord' := overwritel (! Rewrite_Ord.rew_ord', (*<<<---- use Know_Store.xxx, too*)
271 \item automatically extrac rls from program-code
272 ? take ["SignalProcessing", "Z_Transform", "Inverse_sub"] as an example ?
274 \item finish output of LItool.trace with Check_Postcond (useful for SubProblem)
276 \item replace Rule_Set.empty by Rule_Set.Empty
277 latter is more clear, but replacing ***breaks rewriting over all examples***,
278 e.g. see ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x'
279 in Minisubplb/200-start-method-NEXT_STEP.sml:
280 (*+* )------- in f3cac3053e7b (Rule_Set.empty just renamed, NOT deleted) we had
282 (*+*) Rls {calc = [], erls = Erls, errpatts = [], id = "empty", preconds = [], rew_ord =
283 (*+*) ("dummy_ord", fn), rules = [], scr = Empty_Prog, srls = Erls}:
284 (*+*).. THIS IS Rule_Set.empty, BUT IT DID not CAUSE ANY ERROR !
285 (*+*)------- WITH Rule_Set.empty REMOVED (based on f3cac3053e7b) we had
286 (*+*)val Empty = prls (* <---ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x' *)
287 ( *+*)val ["sqroot-test", "univariate", "equation", "test"] = cpI
288 THAT INDICATES, that much rewriting/evaluating JUST WORKED BY CHANCE?!?
299 section \<open>Major reforms\<close>
302 subsection \<open>Exception Size raised\<close>
304 During update Isabelle2018 --> Isabelle2019 we noticed, that
305 "isabelle build" uses resources more efficiently than "isabelle jedit".
306 The former works, but the latter causes
308 \item "Exception- Size raised"
310 \item "exception Size raised (line 169 of "./basis/LibrarySupport.sml")"
311 in test/../biegelinie-*.xml.
313 This has been detected after changeset (30cd47104ad7) "lucin: reorganise theories in ProgLang".
315 Find tools to investigate the Exception, and find ways around it eventually.
317 subsection \<open>Cleanup & review signatures wrt. implementation.pdf canonical argument order\<close>
320 \item there are comments in several signatures
321 \item ML_file "~~/src/Tools/isac/Interpret/specification-elems.sml" can be (almost) deleted
322 \item src/../Frontend/: signatures missing
326 subsection \<open>overall structure of code\<close>
329 \item try to separate Isac_Knowledge from MathEngine
330 common base: Knowledge_Author / ..??
332 \item ML_file "~~/src/Tools/isac/Interpret/ctree.sml" (*shift to base in common with Interpret*)
338 subsection \<open>Separate MathEngineBasic/ Specify/ Interpret/ MathEngine/\<close>
343 \item re-organise code for Interpret
345 \item Step*: Step_Specify | Step_Solve | Step DONE
347 \item Prog_Tac: fun get_first_argument takes both Prog_Tac + Program --- wait for separate Tactical
348 then shift into common descendant
353 \item ??????????? WHY CAN LI.by_tactic NOT BE REPLACED BY Step_Solve.by_tactic ???????????
358 subsection \<open>Review modelling- + specification-phase\<close>
364 \item check match between args of partial_function and model-pattern of meth;
365 provide error message.
367 \item "--- hack for funpack: generalise handling of meths which extend problem items ---"
369 \item see several locations of hack in code
370 \item these locations are NOT sufficient, see
371 test/../biegelinie-3.sml --- IntegrierenUndKonstanteBestimmen2: Bsp.7.70. auto ---
372 \item "fun associate" "match_ags ..dI" instead "..pI" breaks many tests, however,
373 this would be according to survey Notes (3) in src/../calchead.sml.
375 \item see "failed trial to generalise handling of meths"98298342fb6d
376 \item abstract specify + nxt_specif to common aux-funs;
377 see e.g. "--- hack for funpack: generalise handling of meths which extend problem items ---"
379 \item type model = itm list ?
380 \item review survey Notes in src/../calchead.sml: they are questionable
381 \item review copy-named, probably two issues commingled
383 \item special handling of "#Find#, because it is not a formal argument of partial_function
384 \item special naming for solutions of equation solving: x_1, x_2, ...
388 \item this has been written in one go:
390 \item reconsidering I_Model.max_vt, use problem with meth ["DiffApp", "max_by_calculus"]
391 \item reconsider add_field': where is it used for what? Shift into mk_oris
392 \item reconsider match_itms_oris: where is it used for what? max_vt ONLY???
393 \item in Specify_Method search root-oris for items (e.g. "errorBound"), #1# in survey
394 \item Specify_Problem, Specify_Method: check respective identifiers after re-Specify_
395 (relevant for pre-condition)
396 \item unify match_ags to mk_oris1..N with different args (fmz | pat list, pbl | meth
401 subsection \<open>taci list, type step\<close>
403 taci was, most likely, invented to make "fun me" more efficient by avoiding duplicate rewrite,
404 and probably, because the Kernel interface separated setNextTactic and applyTactic.
405 Both are no good reasons to make code more complicated.
407 !!! taci list is used in do_next !!!
411 \item can lev_on_total replace lev_on ? ..Test_Isac_Short + rename lev_on_total -> lev_on
413 \item Step* functions should return Calc.T instead of Calc.state_post
415 \item states.sml: check, when "length tacis > 1"
416 \item in Test_Isac.thy there is only 1 error in Interpret/inform.sml
417 \item (*WN190713 REMOVE: "creating a new node" was never implemented for more than one node?!?
419 \item brute force setting all empty ([], [], ptp) works!?! but ptp causes errors -- investigate!
423 subsection \<open>Ctree\<close>
426 # mixture pos' .. pos in cappend_*, append_* is confusing
427 # existpt p pt andalso Tactic.is_empty DIFFERENT IN append_*, cappend_* is confusing
428 "exception PTREE "get_obj: pos =" ^^^^^: ^^^^ due to cut !!!
429 NOTE: exn IN if..andalso.. IS NOT!!! DETECTED, THIS is confusing
430 see test/../--- Minisubpbl/800-append-on-Frm.sml ---
431 # ?!? "cut branches below cannot be decided here" in append_atomic
432 # sign. of functions too different ?!?canonical arg.order ?!?
435 \item remove update_branch, update_*? -- make branch, etc args of append_*
437 \item close sig Ctree, contains cappend_* ?only? --- ?make parallel to ?Pide_Store?
439 \item unify args to Ctree.state (pt, p)
440 \item fun update_env .. repl_env \<rightarrow>updatempty
447 subsection \<open>replace theory/thy by context/ctxt\<close>
451 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
452 special case: Tactic.Refine_Problem
454 \item theory can be retrieved from ctxt by Proof_Context.theory_of
456 \item cleaup the many conversions string -- theory
457 \item make dest_spec --> (theory, pblID, metID) ?+ common_subthy ?
458 \item 1. Rewrite.eval_true_, then
459 LItool.check_leaf, Rewrite.eval_prog_expr, Step.add, LItool.tac_from_prog.
461 let val thy = ThyC.get_theory "Isac_Knowledge";(*TODO*)
464 \item in locate_input_tactic .. ?scan_dn1?; Program.is_eval_expr .use Term.exists_Const
465 \item push srls into pstate
466 \item lucas-intrpreter.locate_input_tactic: scan_to_tactic1 srls tac cstate (progr, Rule_Set.Empty)
471 subsection \<open>Rfuns, Begin_/End_Detail', Rrls, Istate\<close>
473 remove refactor Rfuns, Rule.Prog, Rule.Empty_Prog, RrlsState: this is a concept never brought to work.
474 Clarify relation to reverse rewriting!
476 \item separate mut.recursion program with rule and rls by deleting fild scr in rls
477 (possible since CS 43160c1e775a
478 ` "replace Prog. in prep_rls by Auto_Prog.gen, which generates Prog. on the fly" )
480 \item probably only "normal_form" seems to be needed
481 \item deleted Rfuns in NEW "locate_input_tactic": no active test for "locate_rule"
482 but that seems desirable
483 \item ?how is the relation to reverse-rewriting ???
484 \item "Rfuns" markers in test/../rational
486 \item datatype istate (Istate.T): remove RrlsState, pstate: use Rrls only for creating results beyond
487 rewriting and/or respective intermediate steps (e.g. cancellation of fractions).
488 Thus we get a 1-step-action which does NOT require a state beyond istate/pstate.
489 Thus we drastically reduce complexity, also get rid of "fun from_pblobj_or_detail_calc" , etc.
490 \item debug ^^^ related: is there an occurence of Steps with more than 1 element?
492 \item and do_next (* WN1907: ?only for Begin_/End_Detail' DEL!!!*)
494 \item shouldn't go Rfuns from Rewrite --> Rewrite_Set; they behave similar to "fun interSteps" ?
496 \item ?finally Prog could go from Calcelems to ProgLang?
499 subsection \<open>Inverse_Z_Transform.thy\<close>
502 \item\label{new-var-rhs} rule1..6, ruleZY introduce new variables on the rhs of the rewrite-rule.
503 ? replace rewriting with substitution ?!?
504 The problem is related to the decision of typing for "d_d" and making bound variables free (while
505 shifting specific handling in equation solving etc. to the meta-logic).
506 \item Find "stepResponse (x[n::real]::bool)" is superfluous, because immediately used by
507 rewrite-rules; see \ref{new-var-rhs}.
508 \item Reconsider whole problem:
509 input only the polynomial as argument of partial_function, in ([1], Frm) compile lhs "X z" ?
512 subsection \<open>Adopt Isabelle's numerals for Isac\<close>
515 \item replace numerals of type "real" by "nat" in some specific functions from ListC.thy
516 and have both representations in parallel for "nat".
521 subsection \<open>Redesign equation solver\<close>
523 Existing solver is structured along the WRONG assumption,
524 that Poly.thy must be the LAST thy among all thys involved -- while the opposite is the case.
526 Preliminary solution: all inappropriately located thms are collected in Base_Tools.thy
528 subsection \<open>Finetunig required for xmldata in kbase\<close>
530 See xmldata https://intra.ist.tugraz.at/hg/isac/rev/5b222a649390
531 and in kbase html-representation generated from these xmldata.
532 Notes in ~~/xmldata/TODO.txt.
535 section \<open>Hints for further development\<close>
538 subsection \<open>Coding standards & some explanations for math-authors\<close>
539 text \<open>copy from doc/math-eng.tex WN.28.3.03
540 WN071228 extended\<close>
542 subsubsection \<open>Identifiers\<close>
543 text \<open>Naming is particularily crucial, because Isabelles name space is global, and isac does
544 not yet use the novel locale features introduces by Isar. For instance, {\tt probe} sounds
545 reasonable as (1) a description in the model of a problem-pattern, (2) as an element of the
546 problem hierarchies key, (3) as a socalled CAS-command, (4) as the name of a related script etc.
547 However, all the cases (1)..(4) require different typing for one and the same
548 identifier {\tt probe} which is impossible, and actually leads to strange errors
549 (for instance (1) is used as string, except in a script addressing a Subproblem).
551 These are the preliminary rules for naming identifiers>
553 \item [elements of a key] into the hierarchy of problems or methods must not contain
554 capital letters and may contain underscrores, e.g. {\tt probe, for_polynomials}.
555 \item [descriptions in problem-patterns] must contain at least 1 capital letter and
556 must not contain underscores, e.g. {\tt Probe, forPolynomials}.
557 \item [CAS-commands] follow the same rules as descriptions in problem-patterns above, thus
558 beware of conflicts~!
559 \item [script identifiers] always end with {\tt Program}, e.g. {\tt ProbeScript}.
563 %WN071228 extended\<close>
565 subsubsection \<open>Rule sets\<close>
566 text \<open>The actual version of the coding standards for rulesets is in {\tt /IsacKnowledge/Atools.ML
567 where it can be viewed using the knowledge browsers.
569 There are rulesets visible to the student, and there are rulesets visible (in general) only for
570 math authors. There are also rulesets which {\em must} exist for {\em each} theory;
571 these contain the identifier of the respective theory (including all capital letters)
572 as indicated by {\it Thy} below.
575 \item [norm\_{\it Thy}] exists for each theory, and {\em efficiently} calculates a
576 normalform for all terms which can be expressed by the definitions of the respective theory
577 (and the respective parents).
578 \item [simplify\_{\it Thy}] exists for each theory, and calculates a normalform for all terms
579 which can be expressed by the definitions of the respective theory (and the respective parents)
580 such, that the rewrites can be presented to the student.
581 \item [calculate\_{\it Thy}] exists for each theory, and evaluates terms with
582 numerical constants only (i.e. all terms which can be expressed by the definitions of
583 the respective theory and the respective parent theories). In particular, this ruleset includes
584 evaluating in/equalities with numerical constants only.
585 WN.3.7.03: may be dropped due to more generality: numericals and non-numericals
586 are logically equivalent, where the latter often add to the assumptions
587 (e.g. in Check_elementwise).
590 The above rulesets are all visible to the user, and also may be input;
591 thus they must be contained in {\tt Theory_Data} (KEStore_Elems.add_rlss,
592 KEStore_Elems.get_rlss). All these rulesets must undergo a preparation
593 using the function {\tt prep_rls'}, which generates a script for stepwise rewriting etc.
594 The following rulesets are used for internal purposes and usually invisible to the (naive) user:
601 {\tt Rule_Set.append_rules, Rule_Set.merge, remove_rls} TODO
604 subsection \<open>get proof-state\<close>
606 Re: [isabelle] Programatically get "this"
607 ----------------------------------------------------
608 So here is my (Makarius') version of your initial example, following these principles:
614 val ctxt = @{context};
617 Name_Space.full_name (Proof_Context.naming_of ctxt) (Binding.name Auto_Bind.thisN);
618 val this = #thms (the (Proof_Context.lookup_fact ctxt this_name));
623 subsection \<open>write Specification to jEdit\<close>
625 Re: [isabelle] Printing terms with type annotations
626 ----------------------------------------------------
627 On 06/02/2019 17:52, Moa Johansson wrote:
629 > I’m writing some code that should create a snippet of Isar script.
631 This is how Sledgehammer approximates this:
633 http://isabelle.in.tum.de/repos/isabelle/file/Isabelle2018/src/HOL/Tools/Sledgehammer/sledgehammer_isar_proof.ML#l299
635 (The module name already shows that the proper terminology is "Isar
636 proof" (or "Isar proof text"). Proof scripts are a thing from the past,
637 before Isar. You can emulate old-style proof scripts via a sequence of
638 'apply' commands, but this is improper Isar.)
640 Note that there is no standard function in Isabelle/Pure, because the
641 problem to print just the right amount of type information is very
642 complex and not fully solved. One day, after 1 or 2 rounds of
643 refinements over the above approach, it might become generally available.
645 subsection \<open>follow Isabelle conventions (*Does not yet work in Isabelle2018\<close>
647 isabelle update -u path_cartouches
648 isabelle update -u inner_syntax_cartouches
650 section \<open>Questions to Isabelle experts\<close>
653 \item ad ERROR Undefined fact "all_left" in Test_Isac: error-pattern.sml
654 Undefined fact: "xfoldr_Nil" inssort.sml
655 (* probably two different reasons:
657 (*WN0509 compare PolyEq.all_left "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)"*)
658 all_left: "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)" and
661 (*WN0509 compare LinEq.all_left "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)"*)
662 all_left: "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)" and
664 test/../partial_fractions.sml
665 (*[7], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["PolyEq", "normalise_poly"])*)
666 (*[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)"))*)
668 test/../mathengine-stateless.sml
669 (*if ThmC.string_of_thm @ {thm rnorm_equation_add} = "\<not> ?b =!= 0 \<Longrightarrow> (?a = ?b) = (?a + - 1 * ?b = 0)"
670 then () else error "string_of_thm changed";*)
672 (*---------------------------------------------------------------------------------------------*)
674 primrec xfoldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a xlist \<Rightarrow> 'b \<Rightarrow> 'b" where
675 xfoldr_Nil: "xfoldr f {|| ||} = id" |
676 xfoldr_Cons: "xfoldr f (x @# xs) = f x \<circ> xfoldr f xs"
679 srls = Rule_Set.empty, calc = [], rules = [
680 Rule.Thm ("xfoldr_Nil",(*num_str*) @{thm xfoldr_Nil} (* foldr ?f [] = id *)),
684 \item ?OK Test_Isac_Short with
685 LI.by_tactic tac (get_istate_LI pt p, get_ctxt_LI pt p) ptp
687 LI.by_tactic tac (Istate.empty, ContextC.empty) ptp
690 \item test from last CS with outcommented re-def of code ->
691 -> \<open>further tests additional to src/.. files\<close>
692 ADDTESTS/redefined-code.sml
694 \item efb749b79361 Test_Some_Short.thy has 2 errors, which disappear in thy ?!?:
695 ML_file "Interpret/error-pattern.sml" Undefined fact: "all_left"
696 ML_file "Knowledge/inssort.sml" Undefined fact: "xfoldr_Nil"
698 \item what is the actual replacement of "hg log --follow" ?
700 \item how HANDLE these exceptions, e.g.:
701 Syntax.read_term ctxt "Randbedingungen y 0 = (0::real), y L = 0, M_b 0 = 0, M_b L = 0]"
704 Failed to parse term"
706 \item how cope with "exception Size raised (line 171 of "./basis/LibrarySupport.sml")"
707 e.g. in test/Interpret/lucas-interpreter.sml
713 section \<open>For copy & paste\<close>
731 subsection \<open>xxx\<close>
732 subsubsection \<open>xxx\<close>