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 -------/*)
33 \item Specify.find_next_step: References.select
34 cpI = ["vonBelastungZu", "Biegelinien"]: References_Def.id
37 \item Calc.state_empty_post \<rightarrow> Calc.state_post_empty
39 \item distribute code from test/../calchead.sml
41 \item rename Tactic.Calculate -> Tactic.Evaluate
43 \item replace src/ Erls by Rule_Set.Empty
45 \item rename ptyps.sml -> specify-etc.sml
46 rename Specify -> Specify_Etc
47 rename Specify -> Specify
49 \item specific_from_prog in..end: replace o by |> (Test_Isac or Test_Some!)
51 \item cleanup ThmC in MathEngBasic
62 subsection \<open>Postponed from current changeset\<close>
66 \item make steps around SubProblem more consistent:
67 SubProblem (thy, [pbl]) is bypassed by Model_Problem, if it is 1st Tactic in a Program.
69 * the Tactic SubProblem (thy, [pbl]) creates the formula SubProblem (thy, [pbl])
71 * the Tactic Model_Problem starts Specification
73 see test/../sub-problem.sml
75 \item Specify_Step.add has dummy argument Istate_Def.Uistate -- remove down to Ctree
77 \item Step_Specify.by_tactic (Tactic.Model_Problem' (id, _, met))
78 by_tactic (Tactic.Specify_Theory' domID)
79 had very old, strange code at 11b5b8b81876
80 ?redes Model_Problem', Specify_Theory' <--> Specify_Method: Step_Specify.complet_for ?
81 INTERMED. NO REPAIR: NOT PROMPTED IN TESTS
83 \item unify code Specify.find_next_step <--> Step_Specify.by_tactic (Tactic.Specify_Method'
85 \item Isa20.implementation: 0.2.4 Printing ML values ?INSTEAD? *.TO_STRING ???
86 ??? writeln ( make_string {x = x, y = y}); ???
88 \item revise O_Model and I_Model with an example with more than 1 variant.
90 \item ctxt is superfluous in specify-phase due to type constraints from Descript.thy
92 \item Derive.do_one: TODO find code in common with complete_solve
93 Derive.embed: TODO rewrite according to CAO (+ no intermediate access to Ctree)
95 \item Solve_Check: postponed parsing input to _ option
97 \item ? "fetch-tactics.sml" from Mathengine -> BridgeLibisabelle ?
99 \item ? unify struct.Step and struct.Solve in MathEngine ?
101 \item use "Eval_Def" for renaming identifiers
103 \item why does Test_Build_Thydata.thy depend on ProgLang and not on CalcElements ?
107 \item LI.do_next (*TODO RM..*) ???
108 \item generate.sml: RM datatype edit TOGETHER WITH datatype inout
109 \item TermC.list2isalist: typ -> term list -> term .. should NOT requires typ
110 \item get_ctxt_LI should replace get_ctxt
111 \item ALL CODE: rename spec(ification) --> know(ledge), in Specification: Relation -> Knowledge
112 \item rename Base_Tool.thy <--- Base_Tools
113 \item adopt naming conventions in Knowledge: EqSystem --> Equation_System, etc
114 \item rename field scr in meth
115 \item DEL double code: nxt_specify_init_calc IN specify.sml + step-specify.sml
123 \item clarify Tactic.Subproblem (domID, pblID) as term in Pstate {act_arg, ...}
124 there it is Free ("Subproblem", "char list \<times> ..
125 instead of Const (|???.Subproblem", "char list \<times> ..
126 AND THE STRING REPRESENTATION IS STRANGE:
127 Subproblem (''Test'',
128 ??.\ <^const> String.char.Char ''LINEAR'' ''univariate'' ''equation''
132 term2str; (*defined by..*)
133 fun term_to_string''' thy t =
135 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
136 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
138 val t = @{term "aaa + bbb"}
139 val t = @{term "Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation''])"};
141 val sss = Print_Mode.setmp [] (Syntax.string_of_term @{context}) t
143 writeln sss (*.. here perfect: Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation'']) *)
148 \item cleanup fun me:
149 fun me (*(_, Empty_Tac) p _ _ = raise ERROR ("me: Empty_Tac at " ^ pos'2str p)
150 | me*) (_, tac) p _(*NEW remove*) pt =
151 + -------------------------^^^^^^
152 # see test-code.sml fun me_trace
153 use this also for me, not only for me_ist_ctxt; del. me
154 this requires much updating in all test/*
156 \item shift tests into NEW model.sml (upd, upds_envv, ..)
158 \item clarify handling of contexts ctxt ContextC
161 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
163 \item Check_Elementwise "Assumptions": prerequisite for ^^goal
164 rm tactic Check_elementwise "Assumptions" in a way, which keeps it for Minisubpbl
165 rm Assumptions :: bool (* TODO: remove with making ^^^ idle *)
171 \item complete mstools.sml (* survey on handling contexts:
176 \item librarys.ml --> libraryC.sml + text from termC.sml
183 \item concentrate "insert_assumptions" for locate_input_tactic in "associate", ?OR? Tactic.insert_assumptions
184 DONE for find_next_step by Tactic.insert_assumptions m' ctxt
186 \item rm from "generate1" ("Detail_Set_Inst'", Tactic.Detail_Set' ?)
187 \item ?"insert_assumptions" necessary in "init_pstate" ?+++? in "applicable_in" ?+++? "associate"
190 \item DO DELETIONS AFTER analogous concentrations in find_next_step
193 \item ? what is the difference headline <--> cascmd in
194 Subproblem' (spec, oris, headline, fmz_, context, cascmd)
195 \item Substitute' what does "re-calculation mean in the datatype comment?
197 \item inform: TermC.parse (ThyC.get_theory "Isac_Knowledge") istr --> parseNEW context istr
199 \item unify/clarify stac2tac_ |
202 \item extract common code from associate.. stac2tac_xxx
203 \item rename LItool.tac_from_prog -> Tactic.from_prog_tac ? Solve_Tac.from_prog_tac,
208 \item unify in signature LANGUAGE_TOOLS =\\
209 val pblterm: ThyC.id -> Problem.id -> term vvv vvv\\
210 val subpbl: string -> string list -> term unify with ^^^
212 \item Telem.safe is questionable: has it been replaced by Safe_Step, Not_Derivable, Helpless, etc?
213 Note: replacement of Istate.safe by Istate.appy_ didn't care much about Telem.safe.
214 If Telem.safe is kept, consider merge with CTbasic.ostate
216 \item remove find_next_step from solve Apply_Method';
217 this enforces Pos.at_first_tactic, which should be dropped, too.
223 subsection \<open>Postponed --> Major reforms\<close>
227 \item revisit bootstrap Calcelements. rule->calcelems->termC
228 would be nice, but is hard: UnparseC.terms -> TermC.s_to_string
230 \item replace all Ctree.update_* with Ctree.cupdate_problem
232 \item rename (ist as {eval, ...}) -> (ist as {eval_rls, ...})
234 \item exception PROG analogous to TERM
236 \item sig/struc ..elems --> ..elem
238 \item distille CAS-command, CAScmd, etc into a struct
240 \item check location of files:
241 test/Tools/isac/Interpret/ptyps.thy
242 test/Tools/isac/Specify.ptyps.sml
244 \item check occurences of Atools in src/ test/
245 \item Const ("Atools.pow", _) ---> Const ("Base_Tool.pow", _)
249 \item Diff.thy: differentiateX --> differentiate after removal of script-constant
250 \item Test.thy: met_test_sqrt2: deleted?!
252 \item Rewrite_Ord.rew_ord' := overwritel (! Rewrite_Ord.rew_ord', (*<<<---- use Know_Store.xxx, too*)
254 \item automatically extrac rls from program-code
255 ? take ["SignalProcessing", "Z_Transform", "Inverse_sub"] as an example ?
257 \item finish output of LItool.trace with Check_Postcond (useful for SubProblem)
259 \item replace Rule_Set.empty by Rule_Set.Empty
260 latter is more clear, but replacing ***breaks rewriting over all examples***,
261 e.g. see ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x'
262 in Minisubplb/200-start-method-NEXT_STEP.sml:
263 (*+* )------- in f3cac3053e7b (Rule_Set.empty just renamed, NOT deleted) we had
265 (*+*) Rls {calc = [], erls = Erls, errpatts = [], id = "empty", preconds = [], rew_ord =
266 (*+*) ("dummy_ord", fn), rules = [], scr = Empty_Prog, srls = Erls}:
267 (*+*).. THIS IS Rule_Set.empty, BUT IT DID not CAUSE ANY ERROR !
268 (*+*)------- WITH Rule_Set.empty REMOVED (based on f3cac3053e7b) we had
269 (*+*)val Empty = prls (* <---ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x' *)
270 ( *+*)val ["sqroot-test", "univariate", "equation", "test"] = cpI
271 THAT INDICATES, that much rewriting/evaluating JUST WORKED BY CHANCE?!?
282 section \<open>Major reforms\<close>
285 subsection \<open>Exception Size raised\<close>
287 During update Isabelle2018 --> Isabelle2019 we noticed, that
288 "isabelle build" uses resources more efficiently than "isabelle jedit".
289 The former works, but the latter causes
291 \item "Exception- Size raised"
293 \item "exception Size raised (line 169 of "./basis/LibrarySupport.sml")"
294 in test/../biegelinie-*.xml.
296 This has been detected after changeset (30cd47104ad7) "lucin: reorganise theories in ProgLang".
298 Find tools to investigate the Exception, and find ways around it eventually.
300 subsection \<open>Cleanup & review signatures wrt. implementation.pdf canonical argument order\<close>
303 \item there are comments in several signatures
304 \item ML_file "~~/src/Tools/isac/Interpret/specification-elems.sml" can be (almost) deleted
305 \item src/../Frontend/: signatures missing
309 subsection \<open>overall structure of code\<close>
312 \item try to separate Isac_Knowledge from MathEngine
313 common base: Knowledge_Author / ..??
315 \item ML_file "~~/src/Tools/isac/Interpret/ctree.sml" (*shift to base in common with Interpret*)
321 subsection \<open>Separate MathEngineBasic/ Specify/ Interpret/ MathEngine/\<close>
326 \item re-organise code for Interpret
328 \item Step*: Step_Specify | Step_Solve | Step DONE
330 \item Prog_Tac: fun get_first_argument takes both Prog_Tac + Program --- wait for separate Tactical
331 then shift into common descendant
336 \item ??????????? WHY CAN LI.by_tactic NOT BE REPLACED BY Step_Solve.by_tactic ???????????
341 subsection \<open>Review modelling- + specification-phase\<close>
347 \item check match between args of partial_function and model-pattern of meth;
348 provide error message.
350 \item "--- hack for funpack: generalise handling of meths which extend problem items ---"
352 \item see several locations of hack in code
353 \item these locations are NOT sufficient, see
354 test/../biegelinie-3.sml --- IntegrierenUndKonstanteBestimmen2: Bsp.7.70. auto ---
355 \item "fun associate" "match_ags ..dI" instead "..pI" breaks many tests, however,
356 this would be according to survey Notes (3) in src/../calchead.sml.
358 \item see "failed trial to generalise handling of meths"98298342fb6d
359 \item abstract specify + nxt_specif to common aux-funs;
360 see e.g. "--- hack for funpack: generalise handling of meths which extend problem items ---"
362 \item type model = itm list ?
363 \item review survey Notes in src/../calchead.sml: they are questionable
364 \item review copy-named, probably two issues commingled
366 \item special handling of "#Find#, because it is not a formal argument of partial_function
367 \item special naming for solutions of equation solving: x_1, x_2, ...
371 \item this has been written in one go:
373 \item reconsidering I_Model.max_vt, use problem with meth ["DiffApp", "max_by_calculus"]
374 \item reconsider add_field': where is it used for what? Shift into mk_oris
375 \item reconsider match_itms_oris: where is it used for what? max_vt ONLY???
376 \item in Specify_Method search root-oris for items (e.g. "errorBound"), #1# in survey
377 \item Specify_Problem, Specify_Method: check respective identifiers after re-Specify_
378 (relevant for pre-condition)
379 \item unify match_ags to mk_oris1..N with different args (fmz | pat list, pbl | meth
384 subsection \<open>taci list, type step\<close>
386 taci was, most likely, invented to make "fun me" more efficient by avoiding duplicate rewrite,
387 and probably, because the Kernel interface separated setNextTactic and applyTactic.
388 Both are no good reasons to make code more complicated.
390 !!! taci list is used in do_next !!!
394 \item can lev_on_total replace lev_on ? ..Test_Isac_Short + rename lev_on_total -> lev_on
396 \item Step* functions should return Calc.T instead of Calc.state_post
398 \item states.sml: check, when "length tacis > 1"
399 \item in Test_Isac.thy there is only 1 error in Interpret/inform.sml
400 \item (*WN190713 REMOVE: "creating a new node" was never implemented for more than one node?!?
402 \item brute force setting all empty ([], [], ptp) works!?! but ptp causes errors -- investigate!
406 subsection \<open>Ctree\<close>
409 # mixture pos' .. pos in cappend_*, append_* is confusing
410 # existpt p pt andalso Tactic.is_empty DIFFERENT IN append_*, cappend_* is confusing
411 "exception PTREE "get_obj: pos =" ^^^^^: ^^^^ due to cut !!!
412 NOTE: exn IN if..andalso.. IS NOT!!! DETECTED, THIS is confusing
413 see test/../--- Minisubpbl/800-append-on-Frm.sml ---
414 # ?!? "cut branches below cannot be decided here" in append_atomic
415 # sign. of functions too different ?!?canonical arg.order ?!?
418 \item remove update_branch, update_*? -- make branch, etc args of append_*
420 \item close sig Ctree, contains cappend_* ?only? --- ?make parallel to ?Pide_Store?
422 \item unify args to Ctree.state (pt, p)
423 \item fun update_env .. repl_env \<rightarrow>updatempty
430 subsection \<open>replace theory/thy by context/ctxt\<close>
434 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
435 special case: Tactic.Refine_Problem
437 \item theory can be retrieved from ctxt by Proof_Context.theory_of
439 \item cleaup the many conversions string -- theory
440 \item make dest_spec --> (theory, pblID, metID) ?+ common_subthy ?
441 \item 1. Rewrite.eval_true_, then
442 LItool.check_leaf, Rewrite.eval_prog_expr, Step.add, LItool.tac_from_prog.
444 let val thy = ThyC.get_theory "Isac_Knowledge";(*TODO*)
447 \item in locate_input_tactic .. ?scan_dn1?; Program.is_eval_expr .use Term.exists_Const
448 \item push srls into pstate
449 \item lucas-intrpreter.locate_input_tactic: scan_to_tactic1 srls tac cstate (progr, Rule_Set.Empty)
454 subsection \<open>Rfuns, Begin_/End_Detail', Rrls, Istate\<close>
456 remove refactor Rfuns, Rule.Prog, Rule.Empty_Prog, RrlsState: this is a concept never brought to work.
457 Clarify relation to reverse rewriting!
459 \item separate mut.recursion program with rule and rls by deleting fild scr in rls
460 (possible since CS 43160c1e775a
461 ` "replace Prog. in prep_rls by Auto_Prog.gen, which generates Prog. on the fly" )
463 \item probably only "normal_form" seems to be needed
464 \item deleted Rfuns in NEW "locate_input_tactic": no active test for "locate_rule"
465 but that seems desirable
466 \item ?how is the relation to reverse-rewriting ???
467 \item "Rfuns" markers in test/../rational
469 \item datatype istate (Istate.T): remove RrlsState, pstate: use Rrls only for creating results beyond
470 rewriting and/or respective intermediate steps (e.g. cancellation of fractions).
471 Thus we get a 1-step-action which does NOT require a state beyond istate/pstate.
472 Thus we drastically reduce complexity, also get rid of "fun from_pblobj_or_detail_calc" , etc.
473 \item debug ^^^ related: is there an occurence of Steps with more than 1 element?
475 \item and do_next (* WN1907: ?only for Begin_/End_Detail' DEL!!!*)
477 \item shouldn't go Rfuns from Rewrite --> Rewrite_Set; they behave similar to "fun interSteps" ?
479 \item ?finally Prog could go from Calcelems to ProgLang?
482 subsection \<open>Inverse_Z_Transform.thy\<close>
485 \item\label{new-var-rhs} rule1..6, ruleZY introduce new variables on the rhs of the rewrite-rule.
486 ? replace rewriting with substitution ?!?
487 The problem is related to the decision of typing for "d_d" and making bound variables free (while
488 shifting specific handling in equation solving etc. to the meta-logic).
489 \item Find "stepResponse (x[n::real]::bool)" is superfluous, because immediately used by
490 rewrite-rules; see \ref{new-var-rhs}.
491 \item Reconsider whole problem:
492 input only the polynomial as argument of partial_function, in ([1], Frm) compile lhs "X z" ?
495 subsection \<open>Adopt Isabelle's numerals for Isac\<close>
498 \item replace numerals of type "real" by "nat" in some specific functions from ListC.thy
499 and have both representations in parallel for "nat".
504 subsection \<open>Redesign equation solver\<close>
506 Existing solver is structured along the WRONG assumption,
507 that Poly.thy must be the LAST thy among all thys involved -- while the opposite is the case.
509 Preliminary solution: all inappropriately located thms are collected in Base_Tools.thy
511 subsection \<open>Finetunig required for xmldata in kbase\<close>
513 See xmldata https://intra.ist.tugraz.at/hg/isac/rev/5b222a649390
514 and in kbase html-representation generated from these xmldata.
515 Notes in ~~/xmldata/TODO.txt.
518 section \<open>Hints for further development\<close>
521 subsection \<open>Coding standards & some explanations for math-authors\<close>
522 text \<open>copy from doc/math-eng.tex WN.28.3.03
523 WN071228 extended\<close>
525 subsubsection \<open>Identifiers\<close>
526 text \<open>Naming is particularily crucial, because Isabelles name space is global, and isac does
527 not yet use the novel locale features introduces by Isar. For instance, {\tt probe} sounds
528 reasonable as (1) a description in the model of a problem-pattern, (2) as an element of the
529 problem hierarchies key, (3) as a socalled CAS-command, (4) as the name of a related script etc.
530 However, all the cases (1)..(4) require different typing for one and the same
531 identifier {\tt probe} which is impossible, and actually leads to strange errors
532 (for instance (1) is used as string, except in a script addressing a Subproblem).
534 These are the preliminary rules for naming identifiers>
536 \item [elements of a key] into the hierarchy of problems or methods must not contain
537 capital letters and may contain underscrores, e.g. {\tt probe, for_polynomials}.
538 \item [descriptions in problem-patterns] must contain at least 1 capital letter and
539 must not contain underscores, e.g. {\tt Probe, forPolynomials}.
540 \item [CAS-commands] follow the same rules as descriptions in problem-patterns above, thus
541 beware of conflicts~!
542 \item [script identifiers] always end with {\tt Program}, e.g. {\tt ProbeScript}.
546 %WN071228 extended\<close>
548 subsubsection \<open>Rule sets\<close>
549 text \<open>The actual version of the coding standards for rulesets is in {\tt /IsacKnowledge/Atools.ML
550 where it can be viewed using the knowledge browsers.
552 There are rulesets visible to the student, and there are rulesets visible (in general) only for
553 math authors. There are also rulesets which {\em must} exist for {\em each} theory;
554 these contain the identifier of the respective theory (including all capital letters)
555 as indicated by {\it Thy} below.
558 \item [norm\_{\it Thy}] exists for each theory, and {\em efficiently} calculates a
559 normalform for all terms which can be expressed by the definitions of the respective theory
560 (and the respective parents).
561 \item [simplify\_{\it Thy}] exists for each theory, and calculates a normalform for all terms
562 which can be expressed by the definitions of the respective theory (and the respective parents)
563 such, that the rewrites can be presented to the student.
564 \item [calculate\_{\it Thy}] exists for each theory, and evaluates terms with
565 numerical constants only (i.e. all terms which can be expressed by the definitions of
566 the respective theory and the respective parent theories). In particular, this ruleset includes
567 evaluating in/equalities with numerical constants only.
568 WN.3.7.03: may be dropped due to more generality: numericals and non-numericals
569 are logically equivalent, where the latter often add to the assumptions
570 (e.g. in Check_elementwise).
573 The above rulesets are all visible to the user, and also may be input;
574 thus they must be contained in {\tt Theory_Data} (KEStore_Elems.add_rlss,
575 KEStore_Elems.get_rlss). All these rulesets must undergo a preparation
576 using the function {\tt prep_rls'}, which generates a script for stepwise rewriting etc.
577 The following rulesets are used for internal purposes and usually invisible to the (naive) user:
584 {\tt Rule_Set.append_rules, Rule_Set.merge, remove_rls} TODO
587 subsection \<open>get proof-state\<close>
589 Re: [isabelle] Programatically get "this"
590 ----------------------------------------------------
591 So here is my (Makarius') version of your initial example, following these principles:
597 val ctxt = @{context};
600 Name_Space.full_name (Proof_Context.naming_of ctxt) (Binding.name Auto_Bind.thisN);
601 val this = #thms (the (Proof_Context.lookup_fact ctxt this_name));
606 subsection \<open>write Specification to jEdit\<close>
608 Re: [isabelle] Printing terms with type annotations
609 ----------------------------------------------------
610 On 06/02/2019 17:52, Moa Johansson wrote:
612 > I’m writing some code that should create a snippet of Isar script.
614 This is how Sledgehammer approximates this:
616 http://isabelle.in.tum.de/repos/isabelle/file/Isabelle2018/src/HOL/Tools/Sledgehammer/sledgehammer_isar_proof.ML#l299
618 (The module name already shows that the proper terminology is "Isar
619 proof" (or "Isar proof text"). Proof scripts are a thing from the past,
620 before Isar. You can emulate old-style proof scripts via a sequence of
621 'apply' commands, but this is improper Isar.)
623 Note that there is no standard function in Isabelle/Pure, because the
624 problem to print just the right amount of type information is very
625 complex and not fully solved. One day, after 1 or 2 rounds of
626 refinements over the above approach, it might become generally available.
628 subsection \<open>follow Isabelle conventions (*Does not yet work in Isabelle2018\<close>
630 isabelle update -u path_cartouches
631 isabelle update -u inner_syntax_cartouches
633 section \<open>Questions to Isabelle experts\<close>
636 \item ad ERROR Undefined fact "all_left" in Test_Isac: error-pattern.sml
637 Undefined fact: "xfoldr_Nil" inssort.sml
638 (* probably two different reasons:
640 (*WN0509 compare PolyEq.all_left "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)"*)
641 all_left: "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)" and
644 (*WN0509 compare LinEq.all_left "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)"*)
645 all_left: "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)" and
647 test/../partial_fractions.sml
648 (*[7], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["PolyEq", "normalise_poly"])*)
649 (*[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)"))*)
651 test/../mathengine-stateless.sml
652 (*if ThmC.string_of_thm @ {thm rnorm_equation_add} = "\<not> ?b =!= 0 \<Longrightarrow> (?a = ?b) = (?a + - 1 * ?b = 0)"
653 then () else error "string_of_thm changed";*)
655 (*---------------------------------------------------------------------------------------------*)
657 primrec xfoldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a xlist \<Rightarrow> 'b \<Rightarrow> 'b" where
658 xfoldr_Nil: "xfoldr f {|| ||} = id" |
659 xfoldr_Cons: "xfoldr f (x @# xs) = f x \<circ> xfoldr f xs"
662 srls = Rule_Set.empty, calc = [], rules = [
663 Rule.Thm ("xfoldr_Nil",(*num_str*) @{thm xfoldr_Nil} (* foldr ?f [] = id *)),
667 \item ?OK Test_Isac_Short with
668 LI.by_tactic tac (get_istate_LI pt p, get_ctxt_LI pt p) ptp
670 LI.by_tactic tac (Istate.empty, ContextC.empty) ptp
673 \item test from last CS with outcommented re-def of code ->
674 -> \<open>further tests additional to src/.. files\<close>
675 ADDTESTS/redefined-code.sml
677 \item efb749b79361 Test_Some_Short.thy has 2 errors, which disappear in thy ?!?:
678 ML_file "Interpret/error-pattern.sml" Undefined fact: "all_left"
679 ML_file "Knowledge/inssort.sml" Undefined fact: "xfoldr_Nil"
681 \item what is the actual replacement of "hg log --follow" ?
683 \item how HANDLE these exceptions, e.g.:
684 Syntax.read_term ctxt "Randbedingungen y 0 = (0::real), y L = 0, M_b 0 = 0, M_b L = 0]"
687 Failed to parse term"
689 \item how cope with "exception Size raised (line 171 of "./basis/LibrarySupport.sml")"
690 e.g. in test/Interpret/lucas-interpreter.sml
696 section \<open>For copy & paste\<close>
714 subsection \<open>xxx\<close>
715 subsubsection \<open>xxx\<close>