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 -------/*)
30 \item fun specify_init_calc defined twice
32 \item push nes identifiers back from O/I_Model to Model_Def
34 \item rename Tactic.Calculate -> Tactic.Evaluate
37 \item replace src/ Erls by Rule_Set.Empty
39 \item rename ptyps.sml -> specify-etc.sml
40 rename Specify -> Specify_Etc
41 rename SpecifyNEW -> Specify
43 \item specific_from_prog in..end: replace o by |> (Test_Isac or Test_Some!)
45 \item cleanup ThmC in MathEngBasic
56 subsection \<open>Postponed from current changeset\<close>
60 \item ctxt is superfluous in specify-phase due to type constraints from Descript.thy
62 \item Derive.do_one: TODO find code in common with complete_solve
63 Derive.embed: TODO rewrite according to CAO (+ no intermediate access to Ctree)
65 \item Solve_Check: postponed parsing input to _ option
67 \item ? "fetch-tactics.sml" from Mathengine -> BridgeLibisabelle ?
69 \item ? unify struct.Step and struct.Solve in MathEngine ?
71 \item use "Eval_Def" for renaming identifiers
73 \item why does Test_Build_Thydata.thy depend on ProgLang and not on CalcElements ?
77 \item LI.do_next (*TODO RM..*) ???
78 \item generate.sml: RM datatype edit TOGETHER WITH datatype inout
79 \item TermC.list2isalist: typ -> term list -> term .. should NOT requires typ
80 \item get_ctxt_LI should replace get_ctxt
81 \item ALL CODE: rename spec(ification) --> know(ledge), in Specification: Relation -> Knowledge
82 \item rename Base_Tool.thy <--- Base_Tools
83 \item adopt naming conventions in Knowledge: EqSystem --> Equation_System, etc
84 \item rename field scr in meth
85 \item DEL double code: nxt_specify_init_calc IN specify.sml + step-specify.sml
93 \item clarify Tactic.Subproblem (domID, pblID) as term in Pstate {act_arg, ...}
94 there it is Free ("Subproblem", "char list \<times> ..
95 instead of Const (|???.Subproblem", "char list \<times> ..
96 AND THE STRING REPRESENTATION IS STRANGE:
98 ??.\ <^const> String.char.Char ''LINEAR'' ''univariate'' ''equation''
102 term2str; (*defined by..*)
103 fun term_to_string''' thy t =
105 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
106 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
108 val t = @{term "aaa + bbb"}
109 val t = @{term "Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation''])"};
111 val sss = Print_Mode.setmp [] (Syntax.string_of_term @{context}) t
113 writeln sss (*.. here perfect: Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation'']) *)
118 \item cleanup fun me:
119 fun me (*(_, Empty_Tac) p _ _ = raise ERROR ("me: Empty_Tac at " ^ pos'2str p)
120 | me*) (_, tac) p _(*NEW remove*) pt =
121 + -------------------------^^^^^^
122 # see test-code.sml fun me_trace
123 use this also for me, not only for me_ist_ctxt; del. me
124 this requires much updating in all test/*
126 \item shift tests into NEW model.sml (upd, upds_envv, ..)
128 \item clarify handling of contexts ctxt ContextC
131 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
133 \item Check_Elementwise "Assumptions": prerequisite for ^^goal
134 rm tactic Check_elementwise "Assumptions" in a way, which keeps it for Minisubpbl
135 rm Assumptions :: bool (* TODO: remove with making ^^^ idle *)
141 \item complete mstools.sml (* survey on handling contexts:
146 \item librarys.ml --> libraryC.sml + text from termC.sml
153 \item concentrate "insert_assumptions" for locate_input_tactic in "associate", ?OR? Tactic.insert_assumptions
154 DONE for find_next_step by Tactic.insert_assumptions m' ctxt
156 \item rm from "generate1" ("Detail_Set_Inst'", Tactic.Detail_Set' ?)
157 \item ?"insert_assumptions" necessary in "init_pstate" ?+++? in "applicable_in" ?+++? "associate"
160 \item DO DELETIONS AFTER analogous concentrations in find_next_step
163 \item ? what is the difference headline <--> cascmd in
164 Subproblem' (spec, oris, headline, fmz_, context, cascmd)
165 \item Substitute' what does "re-calculation mean in the datatype comment?
167 \item inform: TermC.parse (ThyC.get_theory "Isac_Knowledge") istr --> parseNEW context istr
169 \item unify/clarify stac2tac_ |
172 \item extract common code from associate.. stac2tac_xxx
173 \item rename LItool.tac_from_prog -> Tactic.from_prog_tac ? Solve_Tac.from_prog_tac,
178 \item unify in signature LANGUAGE_TOOLS =\\
179 val pblterm: ThyC.id -> Problem.id -> term vvv vvv\\
180 val subpbl: string -> string list -> term unify with ^^^
182 \item Telem.safe is questionable: has it been replaced by Safe_Step, Not_Derivable, Helpless, etc?
183 Note: replacement of Istate.safe by Istate.appy_ didn't care much about Telem.safe.
184 If Telem.safe is kept, consider merge with CTbasic.ostate
186 \item remove find_next_step from solve Apply_Method';
187 this enforces Pos.at_first_tactic, which should be dropped, too.
193 subsection \<open>Postponed --> Major reforms\<close>
197 \item revisit bootstrap Calcelements. rule->calcelems->termC
198 would be nice, but is hard: UnparseC.terms -> TermC.s_to_string
200 \item replace all Ctree.update_* with Ctree.cupdate_problem
202 \item rename (ist as {eval, ...}) -> (ist as {eval_rls, ...})
204 \item exception PROG analogous to TERM
206 \item sig/struc ..elems --> ..elem
208 \item distille CAS-command, CAScmd, etc into a struct
210 \item check location of files:
211 test/Tools/isac/Interpret/ptyps.thy
212 test/Tools/isac/Specify.ptyps.sml
214 \item check occurences of Atools in src/ test/
215 \item Const ("Atools.pow", _) ---> Const ("Base_Tool.pow", _)
219 \item Diff.thy: differentiateX --> differentiate after removal of script-constant
220 \item Test.thy: met_test_sqrt2: deleted?!
222 \item Rewrite_Ord.rew_ord' := overwritel (! Rewrite_Ord.rew_ord', (*<<<---- use Know_Store.xxx, too*)
224 \item automatically extrac rls from program-code
225 ? take ["SignalProcessing", "Z_Transform", "Inverse_sub"] as an example ?
227 \item finish output of LItool.trace with Check_Postcond (useful for SubProblem)
229 \item replace Rule_Set.empty by Rule_Set.Empty
230 latter is more clear, but replacing ***breaks rewriting over all examples***,
231 e.g. see ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x'
232 in Minisubplb/200-start-method-NEXT_STEP.sml:
233 (*+* )------- in f3cac3053e7b (Rule_Set.empty just renamed, NOT deleted) we had
235 (*+*) Rls {calc = [], erls = Erls, errpatts = [], id = "empty", preconds = [], rew_ord =
236 (*+*) ("dummy_ord", fn), rules = [], scr = Empty_Prog, srls = Erls}:
237 (*+*).. THIS IS Rule_Set.empty, BUT IT DID not CAUSE ANY ERROR !
238 (*+*)------- WITH Rule_Set.empty REMOVED (based on f3cac3053e7b) we had
239 (*+*)val Empty = prls (* <---ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x' *)
240 ( *+*)val ["sqroot-test", "univariate", "equation", "test"] = cpI
241 THAT INDICATES, that much rewriting/evaluating JUST WORKED BY CHANCE?!?
252 section \<open>Major reforms\<close>
255 subsection \<open>Exception Size raised\<close>
257 During update Isabelle2018 --> Isabelle2019 we noticed, that
258 "isabelle build" uses resources more efficiently than "isabelle jedit".
259 The former works, but the latter causes
261 \item "Exception- Size raised"
263 \item "exception Size raised (line 169 of "./basis/LibrarySupport.sml")"
264 in test/../biegelinie-*.xml.
266 This has been detected after changeset (30cd47104ad7) "lucin: reorganise theories in ProgLang".
268 Find tools to investigate the Exception, and find ways around it eventually.
270 subsection \<open>Cleanup & review signatures wrt. implementation.pdf canonical argument order\<close>
273 \item there are comments in several signatures
274 \item ML_file "~~/src/Tools/isac/Interpret/specification-elems.sml" can be (almost) deleted
275 \item src/../Frontend/: signatures missing
279 subsection \<open>overall structure of code\<close>
282 \item try to separate Isac_Knowledge from MathEngine
283 common base: Knowledge_Author / ..??
285 \item ML_file "~~/src/Tools/isac/Interpret/ctree.sml" (*shift to base in common with Interpret*)
291 subsection \<open>Separate MathEngineBasic/ Specify/ Interpret/ MathEngine/\<close>
296 \item re-organise code for Interpret
298 \item Step*: Step_Specify | Step_Solve | Step DONE
300 \item Prog_Tac: fun get_first_argument takes both Prog_Tac + Program --- wait for separate Tactical
301 then shift into common descendant
306 \item ??????????? WHY CAN LI.by_tactic NOT BE REPLACED BY Step_Solve.by_tactic ???????????
311 subsection \<open>Review modelling- + specification-phase\<close>
317 \item check match between args of partial_function and model-pattern of meth;
318 provide error message.
320 \item "--- hack for funpack: generalise handling of meths which extend problem items ---"
322 \item see several locations of hack in code
323 \item these locations are NOT sufficient, see
324 test/../biegelinie-3.sml --- IntegrierenUndKonstanteBestimmen2: Bsp.7.70. auto ---
325 \item "fun associate" "match_ags ..dI" instead "..pI" breaks many tests, however,
326 this would be according to survey Notes (3) in src/../calchead.sml.
328 \item see "failed trial to generalise handling of meths"98298342fb6d
329 \item abstract specify + nxt_specif to common aux-funs;
330 see e.g. "--- hack for funpack: generalise handling of meths which extend problem items ---"
332 \item type model = itm list ?
333 \item review survey Notes in src/../calchead.sml: they are questionable
334 \item review copy-named, probably two issues commingled
336 \item special handling of "#Find#, because it is not a formal argument of partial_function
337 \item special naming for solutions of equation solving: x_1, x_2, ...
341 \item this has been written in one go:
343 \item reconsidering I_Model.max_vt, use problem with meth ["DiffApp","max_by_calculus"]
344 \item reconsider add_field': where is it used for what? Shift into mk_oris
345 \item reconsider match_itms_oris: where is it used for what? max_vt ONLY???
346 \item in Specify_Method search root-oris for items (e.g. "errorBound"), #1# in survey
347 \item Specify_Problem, Specify_Method: check respective identifiers after re-Specify_
348 (relevant for pre-condition)
349 \item unify match_ags to mk_oris1..N with different args (fmz | pat list, pbl | meth
354 subsection \<open>taci list, type step\<close>
356 taci was, most likely, invented to make "fun me" more efficient by avoiding duplicate rewrite,
357 and probably, because the Kernel interface separated setNextTactic and applyTactic.
358 Both are no good reasons to make code more complicated.
360 !!! taci list is used in do_next !!!
364 \item can lev_on_total replace lev_on ? ..Test_Isac_Short + rename lev_on_total -> lev_on
366 \item Step* functions should return Calc.T instead of Chead.calcstate'
368 \item states.sml: check, when "length tacis > 1"
369 \item in Test_Isac.thy there is only 1 error in Interpret/inform.sml
370 \item (*WN190713 REMOVE: "creating a new node" was never implemented for more than one node?!?
372 \item brute force setting all empty ([], [], ptp) works!?! but ptp causes errors -- investigate!
376 subsection \<open>Ctree\<close>
379 # mixture pos' .. pos in cappend_*, append_* is confusing
380 # existpt p pt andalso Tactic.is_empty DIFFERENT IN append_*, cappend_* is confusing
381 "exception PTREE "get_obj: pos =" ^^^^^: ^^^^ due to cut !!!
382 NOTE: exn IN if..andalso.. IS NOT!!! DETECTED, THIS is confusing
383 see test/../--- Minisubpbl/800-append-on-Frm.sml ---
384 # ?!? "cut branches below cannot be decided here" in append_atomic
385 # sign. of functions too different ?!?canonical arg.order ?!?
388 \item remove update_branch, update_*? -- make branch, etc args of append_*
390 \item close sig Ctree, contains cappend_* ?only? --- ?make parallel to ?Pide_Store?
392 \item unify args to Ctree.state (pt, p)
393 \item fun update_env .. repl_env \<rightarrow>updatempty
400 subsection \<open>replace theory/thy by context/ctxt\<close>
404 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
405 special case: Tactic.Refine_Problem
407 \item theory can be retrieved from ctxt by Proof_Context.theory_of
409 \item cleaup the many conversions string -- theory
410 \item make dest_spec --> (theory, pblID, metID) ?+ common_subthy ?
411 \item 1. Rewrite.eval_true_, then
412 LItool.check_leaf, Rewrite.eval_prog_expr, Step.add, LItool.tac_from_prog.
414 let val thy = ThyC.get_theory "Isac_Knowledge";(*TODO*)
417 \item in locate_input_tactic .. ?scan_dn1?; Program.is_eval_expr .use Term.exists_Const
418 \item push srls into pstate
419 \item lucas-intrpreter.locate_input_tactic: scan_to_tactic1 srls tac cstate (progr, Rule_Set.Empty)
424 subsection \<open>Rfuns, Begin_/End_Detail', Rrls, Istate\<close>
426 remove refactor Rfuns, Rule.Prog, Rule.Empty_Prog, RrlsState: this is a concept never brought to work.
427 Clarify relation to reverse rewriting!
429 \item separate mut.recursion program with rule and rls by deleting fild scr in rls
430 (possible since CS 43160c1e775a
431 ` "replace Prog. in prep_rls by Auto_Prog.gen, which generates Prog. on the fly" )
433 \item probably only "normal_form" seems to be needed
434 \item deleted Rfuns in NEW "locate_input_tactic": no active test for "locate_rule"
435 but that seems desirable
436 \item ?how is the relation to reverse-rewriting ???
437 \item "Rfuns" markers in test/../rational
439 \item datatype istate (Istate.T): remove RrlsState, pstate: use Rrls only for creating results beyond
440 rewriting and/or respective intermediate steps (e.g. cancellation of fractions).
441 Thus we get a 1-step-action which does NOT require a state beyond istate/pstate.
442 Thus we drastically reduce complexity, also get rid of "fun from_pblobj_or_detail_calc" , etc.
443 \item debug ^^^ related: is there an occurence of Steps with more than 1 element?
445 \item and do_next (* WN1907: ?only for Begin_/End_Detail' DEL!!!*)
447 \item shouldn't go Rfuns from Rewrite --> Rewrite_Set; they behave similar to "fun interSteps" ?
449 \item ?finally Prog could go from Calcelems to ProgLang?
452 subsection \<open>Inverse_Z_Transform.thy\<close>
455 \item\label{new-var-rhs} rule1..6, ruleZY introduce new variables on the rhs of the rewrite-rule.
456 ? replace rewriting with substitution ?!?
457 The problem is related to the decision of typing for "d_d" and making bound variables free (while
458 shifting specific handling in equation solving etc. to the meta-logic).
459 \item Find "stepResponse (x[n::real]::bool)" is superfluous, because immediately used by
460 rewrite-rules; see \ref{new-var-rhs}.
461 \item Reconsider whole problem:
462 input only the polynomial as argument of partial_function, in ([1], Frm) compile lhs "X z" ?
465 subsection \<open>Adopt Isabelle's numerals for Isac\<close>
468 \item replace numerals of type "real" by "nat" in some specific functions from ListC.thy
469 and have both representations in parallel for "nat".
474 subsection \<open>Redesign equation solver\<close>
476 Existing solver is structured along the WRONG assumption,
477 that Poly.thy must be the LAST thy among all thys involved -- while the opposite is the case.
479 Preliminary solution: all inappropriately located thms are collected in Base_Tools.thy
481 subsection \<open>Finetunig required for xmldata in kbase\<close>
483 See xmldata https://intra.ist.tugraz.at/hg/isac/rev/5b222a649390
484 and in kbase html-representation generated from these xmldata.
485 Notes in ~~/xmldata/TODO.txt.
488 section \<open>Hints for further development\<close>
491 subsection \<open>Coding standards & some explanations for math-authors\<close>
492 text \<open>copy from doc/math-eng.tex WN.28.3.03
493 WN071228 extended\<close>
495 subsubsection \<open>Identifiers\<close>
496 text \<open>Naming is particularily crucial, because Isabelles name space is global, and isac does
497 not yet use the novel locale features introduces by Isar. For instance, {\tt probe} sounds
498 reasonable as (1) a description in the model of a problem-pattern, (2) as an element of the
499 problem hierarchies key, (3) as a socalled CAS-command, (4) as the name of a related script etc.
500 However, all the cases (1)..(4) require different typing for one and the same
501 identifier {\tt probe} which is impossible, and actually leads to strange errors
502 (for instance (1) is used as string, except in a script addressing a Subproblem).
504 These are the preliminary rules for naming identifiers>
506 \item [elements of a key] into the hierarchy of problems or methods must not contain
507 capital letters and may contain underscrores, e.g. {\tt probe, for_polynomials}.
508 \item [descriptions in problem-patterns] must contain at least 1 capital letter and
509 must not contain underscores, e.g. {\tt Probe, forPolynomials}.
510 \item [CAS-commands] follow the same rules as descriptions in problem-patterns above, thus
511 beware of conflicts~!
512 \item [script identifiers] always end with {\tt Program}, e.g. {\tt ProbeScript}.
516 %WN071228 extended\<close>
518 subsubsection \<open>Rule sets\<close>
519 text \<open>The actual version of the coding standards for rulesets is in {\tt /IsacKnowledge/Atools.ML
520 where it can be viewed using the knowledge browsers.
522 There are rulesets visible to the student, and there are rulesets visible (in general) only for
523 math authors. There are also rulesets which {\em must} exist for {\em each} theory;
524 these contain the identifier of the respective theory (including all capital letters)
525 as indicated by {\it Thy} below.
528 \item [norm\_{\it Thy}] exists for each theory, and {\em efficiently} calculates a
529 normalform for all terms which can be expressed by the definitions of the respective theory
530 (and the respective parents).
531 \item [simplify\_{\it Thy}] exists for each theory, and calculates a normalform for all terms
532 which can be expressed by the definitions of the respective theory (and the respective parents)
533 such, that the rewrites can be presented to the student.
534 \item [calculate\_{\it Thy}] exists for each theory, and evaluates terms with
535 numerical constants only (i.e. all terms which can be expressed by the definitions of
536 the respective theory and the respective parent theories). In particular, this ruleset includes
537 evaluating in/equalities with numerical constants only.
538 WN.3.7.03: may be dropped due to more generality: numericals and non-numericals
539 are logically equivalent, where the latter often add to the assumptions
540 (e.g. in Check_elementwise).
543 The above rulesets are all visible to the user, and also may be input;
544 thus they must be contained in {\tt Theory_Data} (KEStore_Elems.add_rlss,
545 KEStore_Elems.get_rlss). All these rulesets must undergo a preparation
546 using the function {\tt prep_rls'}, which generates a script for stepwise rewriting etc.
547 The following rulesets are used for internal purposes and usually invisible to the (naive) user:
554 {\tt Rule_Set.append_rules, Rule_Set.merge, remove_rls} TODO
557 subsection \<open>get proof-state\<close>
559 Re: [isabelle] Programatically get "this"
560 ----------------------------------------------------
561 So here is my (Makarius') version of your initial example, following these principles:
567 val ctxt = @{context};
570 Name_Space.full_name (Proof_Context.naming_of ctxt) (Binding.name Auto_Bind.thisN);
571 val this = #thms (the (Proof_Context.lookup_fact ctxt this_name));
576 subsection \<open>write Specification to jEdit\<close>
578 Re: [isabelle] Printing terms with type annotations
579 ----------------------------------------------------
580 On 06/02/2019 17:52, Moa Johansson wrote:
582 > I’m writing some code that should create a snippet of Isar script.
584 This is how Sledgehammer approximates this:
586 http://isabelle.in.tum.de/repos/isabelle/file/Isabelle2018/src/HOL/Tools/Sledgehammer/sledgehammer_isar_proof.ML#l299
588 (The module name already shows that the proper terminology is "Isar
589 proof" (or "Isar proof text"). Proof scripts are a thing from the past,
590 before Isar. You can emulate old-style proof scripts via a sequence of
591 'apply' commands, but this is improper Isar.)
593 Note that there is no standard function in Isabelle/Pure, because the
594 problem to print just the right amount of type information is very
595 complex and not fully solved. One day, after 1 or 2 rounds of
596 refinements over the above approach, it might become generally available.
598 subsection \<open>follow Isabelle conventions (*Does not yet work in Isabelle2018\<close>
600 isabelle update -u path_cartouches
601 isabelle update -u inner_syntax_cartouches
603 section \<open>Questions to Isabelle experts\<close>
606 \item ad ERROR Undefined fact "all_left" in Test_Isac: error-pattern.sml
607 Undefined fact: "xfoldr_Nil" inssort.sml
608 (* probably two different reasons:
610 (*WN0509 compare PolyEq.all_left "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)"*)
611 all_left: "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)" and
614 (*WN0509 compare LinEq.all_left "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)"*)
615 all_left: "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)" and
617 test/../partial_fractions.sml
618 (*[7], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["PolyEq", "normalise_poly"])*)
619 (*[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)"))*)
621 test/../mathengine-stateless.sml
622 (*if ThmC.string_of_thm @ {thm rnorm_equation_add} = "\<not> ?b =!= 0 \<Longrightarrow> (?a = ?b) = (?a + - 1 * ?b = 0)"
623 then () else error "string_of_thm changed";*)
625 (*---------------------------------------------------------------------------------------------*)
627 primrec xfoldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a xlist \<Rightarrow> 'b \<Rightarrow> 'b" where
628 xfoldr_Nil: "xfoldr f {|| ||} = id" |
629 xfoldr_Cons: "xfoldr f (x @# xs) = f x \<circ> xfoldr f xs"
632 srls = Rule_Set.empty, calc = [], rules = [
633 Rule.Thm ("xfoldr_Nil",(*num_str*) @{thm xfoldr_Nil} (* foldr ?f [] = id *)),
637 \item ?OK Test_Isac_Short with
638 LI.by_tactic tac (get_istate_LI pt p, get_ctxt_LI pt p) ptp
640 LI.by_tactic tac (Istate.empty, ContextC.empty) ptp
643 \item test from last CS with outcommented re-def of code ->
644 -> \<open>further tests additional to src/.. files\<close>
645 ADDTESTS/redefined-code.sml
647 \item efb749b79361 Test_Some_Short.thy has 2 errors, which disappear in thy ?!?:
648 ML_file "Interpret/error-pattern.sml" Undefined fact: "all_left"
649 ML_file "Knowledge/inssort.sml" Undefined fact: "xfoldr_Nil"
651 \item what is the actual replacement of "hg log --follow" ?
653 \item how HANDLE these exceptions, e.g.:
654 Syntax.read_term ctxt "Randbedingungen y 0 = (0::real), y L = 0, M_b 0 = 0, M_b L = 0]"
657 Failed to parse term"
659 \item how cope with "exception Size raised (line 171 of "./basis/LibrarySupport.sml")"
660 e.g. in test/Interpret/lucas-interpreter.sml
666 section \<open>For copy & paste\<close>
684 subsection \<open>xxx\<close>
685 subsubsection \<open>xxx\<close>