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 -------\*)
27 (*\------- to -------/*)
29 \item ML_file "rule-set.sml" Know_Store -> MathEngBasic (=ThmC, Rewrite)
30 probably first review calcelems.sml
32 \item replace src/ Erls Rule_Set.Empty
34 \item rename exec-def.sml -> eval_def.sml
35 evaluate.sml _> evaluate.sml (struct Eval -> Evaluate?!?)
37 \item rename Know_Store -> Know_Store KNOWLEDGE_STORE + file.sml
38 Build_Thydata -> Build_Knowledge
40 \item rename ptyps.sml -> specify-etc.sml
41 rename Specify -> Specify_Etc
42 rename SpecifyNEW -> Specify
44 \item specific_from_prog in..end: replace o by |> (Test_Isac or Test_Some!)
46 \item cleanup ThmC in MathEngBasic
57 subsection \<open>Postponed from current changeset\<close>
63 \item use "Exec_Def" for renaming identifiers
65 \item why does Test_Build_Thydata.thy depend on ProgLang and not on CalcElements ?
69 \item LI.do_next (*TODO RM..*) ???
70 \item generate.sml: RM datatype edit TOGETHER WITH datatype inout
71 \item TermC.list2isalist: typ -> term list -> term .. should NOT requires typ
72 \item get_ctxt_LI should replace get_ctxt
73 \item ALL CODE: rename spec(ification) --> know(ledge), in Specification: Relation -> Knowledge
74 \item rename Base_Tool.thy <--- Base_Tools
75 \item adopt naming conventions in Knowledge: EqSystem --> Equation_System, etc
76 \item rename field scr in meth
77 \item DEL double code: nxt_specify_init_calc IN specify.sml + step-specify.sml
85 \item clarify Tactic.Subproblem (domID, pblID) as term in Pstate {act_arg, ...}
86 there it is Free ("Subproblem", "char list \<times> ..
87 instead of Const (|???.Subproblem", "char list \<times> ..
88 AND THE STRING REPRESENTATION IS STRANGE:
90 ??.\ <^const> String.char.Char ''LINEAR'' ''univariate'' ''equation''
94 term2str; (*defined by..*)
95 fun term_to_string''' thy t =
97 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
98 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
100 val t = @{term "aaa + bbb"}
101 val t = @{term "Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation''])"};
103 val sss = Print_Mode.setmp [] (Syntax.string_of_term @{context}) t
105 writeln sss (*.. here perfect: Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation'']) *)
110 \item cleanup fun me:
111 fun me (*(_, Empty_Tac) p _ _ = raise ERROR ("me: Empty_Tac at " ^ pos'2str p)
112 | me*) (_, tac) p _(*NEW remove*) pt =
113 + -------------------------^^^^^^
114 # see test-code.sml fun me_trace
115 use this also for me, not only for me_ist_ctxt; del. me
116 this requires much updating in all test/*
119 \item generate, generate1: NO thy as arg.
120 Generate.generate1 thy is redundant: is the same during pbl, thus lookup spec
121 redesign return value (originally for output by fun me?)
123 \item shift tests into NEW model.sml (upd, upds_envv, ..)
126 \item clarify handling of contexts ctxt ContextC
129 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
131 \item Check_Elementwise "Assumptions": prerequisite for ^^goal
132 rm tactic Check_elementwise "Assumptions" in a way, which keeps it for Minisubpbl
133 rm Assumptions :: bool (* TODO: remove with making ^^^ idle *)
139 \item complete mstools.sml (* survey on handling contexts:
144 \item librarys.ml --> libraryC.sml + text from termC.sml
151 \item concentrate "insert_assumptions" for locate_input_tactic in "associate", ?OR? Tactic.insert_assumptions
152 DONE for find_next_step by Tactic.insert_assumptions m' ctxt
154 \item rm from "generate1" ("Detail_Set_Inst'", Tactic.Detail_Set' ?)
155 \item shift from "applicable_in..Apply_Method" to ? ? ? (is ONLY use-case in appl.sml))
156 \item ?"insert_assumptions" necessary in "init_pstate" ?+++? in "applicable_in" ?+++? "associate"
159 \item DO DELETIONS AFTER analogous concentrations in find_next_step
162 \item ? what is the difference headline <--> cascmd in
163 Subproblem' (spec, oris, headline, fmz_, context, cascmd)
165 \item inform: TermC.parse (ThyC.get_theory "Isac_Knowledge") istr --> parseNEW context istr
167 \item unify/clarify stac2tac_ |
170 \item extract common code from associate.. stac2tac_xxx
171 \item rename LItool.tac_from_prog -> Tactic.from_prog_tac ? Solve_Tac.from_prog_tac,
176 \item unify in signature LANGUAGE_TOOLS =\\
177 val pblterm: ThyC.id -> Problem.id -> term vvv vvv\\
178 val subpbl: string -> string list -> term unify with ^^^
180 \item Telem.safe is questionable: has it been replaced by Safe_Step, Not_Derivable, Helpless, etc?
181 Note: replacement of Istate.safe by Istate.appy_ didn't care much about Telem.safe.
182 If Telem.safe is kept, consider merge with CTbasic.ostate
184 \item remove find_next_step from solve Apply_Method';
185 this enforces Pos.at_first_tactic, which should be dropped, too.
191 subsection \<open>Postponed --> Major reforms\<close>
195 \item revisit bootstrap Calcelements. rule->calcelems->termC
196 would be nice, but is hard: UnparseC.terms -> TermC.s_to_string
198 \item replace all Ctree.update_* with Ctree.cupdate_problem
200 \item rename (ist as {eval, ...}) -> (ist as {eval_rls, ...})
202 \item exception PROG analogous to TERM
204 \item sig/struc ..elems --> ..elem
206 \item distille CAS-command, CAScmd, etc into a struct
208 \item check location of files:
209 test/Tools/isac/Interpret/ptyps.thy
210 test/Tools/isac/Specify.ptyps.sml
212 \item check occurences of Atools in src/ test/
213 \item Const ("Atools.pow", _) ---> Const ("Base_Tool.pow", _)
217 \item Diff.thy: differentiateX --> differentiate after removal of script-constant
218 \item Test.thy: met_test_sqrt2: deleted?!
220 \item Rewrite_Ord.rew_ord' := overwritel (! Rewrite_Ord.rew_ord', (*<<<---- use Know_Store.xxx, too*)
222 \item automatically extrac rls from program-code
223 ? take ["SignalProcessing", "Z_Transform", "Inverse_sub"] as an example ?
225 \item finish output of LItool.trace with Check_Postcond (useful for SubProblem)
227 \item replace Rule_Set.empty by Rule_Set.Empty
228 latter is more clear, but replacing ***breaks rewriting over all examples***,
229 e.g. see ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x'
230 in Minisubplb/200-start-method-NEXT_STEP.sml:
231 (*+* )------- in f3cac3053e7b (Rule_Set.empty just renamed, NOT deleted) we had
233 (*+*) Rls {calc = [], erls = Erls, errpatts = [], id = "empty", preconds = [], rew_ord =
234 (*+*) ("dummy_ord", fn), rules = [], scr = Empty_Prog, srls = Erls}:
235 (*+*).. THIS IS Rule_Set.empty, BUT IT DID not CAUSE ANY ERROR !
236 (*+*)------- WITH Rule_Set.empty REMOVED (based on f3cac3053e7b) we had
237 (*+*)val Empty = prls (* <---ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x' *)
238 ( *+*)val ["sqroot-test", "univariate", "equation", "test"] = cpI
239 THAT INDICATES, that much rewriting/evaluating JUST WORKED BY CHANCE?!?
250 section \<open>Major reforms\<close>
253 subsection \<open>Exception Size raised\<close>
255 During update Isabelle2018 --> Isabelle2019 we noticed, that
256 "isabelle build" uses resources more efficiently than "isabelle jedit".
257 The former works, but the latter causes
259 \item "Exception- Size raised"
261 \item "exception Size raised (line 169 of "./basis/LibrarySupport.sml")"
262 in test/../biegelinie-*.xml.
264 This has been detected after changeset (30cd47104ad7) "lucin: reorganise theories in ProgLang".
266 Find tools to investigate the Exception, and find ways around it eventually.
268 subsection \<open>Cleanup & review signatures wrt. implementation.pdf canonical argument order\<close>
271 \item there are comments in several signatures
272 \item ML_file "~~/src/Tools/isac/Interpret/specification-elems.sml" can be (almost) deleted
273 \item src/../Frontend/: signatures missing
277 subsection \<open>overall structure of code\<close>
280 \item try to separate Isac_Knowledge from MathEngine
281 common base: Knowledge_Author / ..??
283 \item ML_file "~~/src/Tools/isac/Interpret/ctree.sml" (*shift to base in common with Interpret*)
289 subsection \<open>Separate MathEngineBasic/ Specify/ Interpret/ MathEngine/\<close>
294 \item re-organise code for Interpret
296 \item Step*: Step_Specify | Step_Solve | Step
298 \item *.check | *.add ARE TOO LATE IN BUILD with Step_Specify | Step_Solve
299 Specify_Step.check | Specify_Step.add <-- Applicable.applicable_in
300 Solve_Step.check | Solve_Step.add <-- Generate.generate1
304 \item Prog_Tac: fun get_first_argument takes both Prog_Tac + Program --- wait for separate Tactical
305 then shift into common descendant
310 \item ??????????? WHY CAN LI.by_tactic NOT BE REPLACED BY Step_Solve.by_tactic ???????????
315 subsection \<open>Review modelling- + specification-phase\<close>
321 \item check match between args of partial_function and model-pattern of meth;
322 provide error message.
324 \item "--- hack for funpack: generalise handling of meths which extend problem items ---"
326 \item see several locations of hack in code
327 \item these locations are NOT sufficient, see
328 test/../biegelinie-3.sml --- IntegrierenUndKonstanteBestimmen2: Bsp.7.70. auto ---
329 \item "fun associate" "match_ags ..dI" instead "..pI" breaks many tests, however,
330 this would be according to survey Notes (3) in src/../calchead.sml.
332 \item see "failed trial to generalise handling of meths"98298342fb6d
333 \item abstract specify + nxt_specif to common aux-funs;
334 see e.g. "--- hack for funpack: generalise handling of meths which extend problem items ---"
336 \item type model = itm list ?
337 \item review survey Notes in src/../calchead.sml: they are questionable
338 \item review copy-named, probably two issues commingled
340 \item special handling of "#Find#, because it is not a formal argument of partial_function
341 \item special naming for solutions of equation solving: x_1, x_2, ...
344 \item structure Tactic Specify -?-> Proglang (would require Model., Selem.)
346 \item this has been written in one go:
348 \item reconsidering Model.max_vt, use problem with meth ["DiffApp","max_by_calculus"]
349 \item reconsider add_field': where is it used for what? Shift into mk_oris
350 \item reconsider match_itms_oris: where is it used for what? max_vt ONLY???
351 \item in Specify_Method search root-oris for items (e.g. "errorBound"), #1# in survey
352 \item Specify_Problem, Specify_Method: check respective identifiers after re-Specify_
353 (relevant for pre-condition)
354 \item unify match_ags to mk_oris1..N with different args (fmz | pat list, pbl | meth
359 subsection \<open>taci list, type step\<close>
361 taci was, most likely, invented to make "fun me" more efficient by avoiding duplicate rewrite,
362 and probably, because the Kernel interface separated setNextTactic and applyTactic.
363 Both are no good reasons to make code more complicated.
365 !!! taci list is used in do_next !!!
369 \item can lev_on_total replace lev_on ? ..Test_Isac_Short + rename lev_on_total -> lev_on
371 \item Step* functions should return Calc.T instead of Chead.calcstate'
373 \item states.sml: check, when "length tacis > 1"
374 \item in Test_Isac.thy there is only 1 error in Interpret/inform.sml
375 \item (*WN190713 REMOVE: "creating a new node" was never implemented for more than one node?!?
377 \item brute force setting all empty ([], [], ptp) works!?! but ptp causes errors -- investigate!
381 subsection \<open>Ctree\<close>
384 # mixture pos' .. pos in cappend_*, append_* is confusing
385 # existpt p pt andalso Tactic.is_empty DIFFERENT IN append_*, cappend_* is confusing
386 "exception PTREE "get_obj: pos =" ^^^^^: ^^^^ due to cut !!!
387 NOTE: exn IN if..andalso.. IS NOT!!! DETECTED, THIS is confusing
388 see test/../--- Minisubpbl/800-append-on-Frm.sml ---
389 # ?!? "cut branches below cannot be decided here" in append_atomic
390 # sign. of functions too different ?!?canonical arg.order ?!?
393 \item remove update_branch, update_*? -- make branch, etc args of append_*
395 \item close sig Ctree, contains cappend_* ?only? --- ?make parallel to ?Pide_Store?
397 \item unify args to Ctree.state (pt, p)
398 \item fun update_env .. repl_env \<rightarrow>updatempty
405 subsection \<open>replace theory/thy by context/ctxt\<close>
409 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
410 special case: Tactic.Refine_Problem
412 \item theory can be retrieved from ctxt by Proof_Context.theory_of
414 \item cleaup the many conversions string -- theory
415 \item make dest_spec --> (theory, pblID, metID) ?+ common_subthy ?
416 \item 1. Rewrite.eval_true_, then
417 LItool.check_leaf, Rewrite.eval_prog_expr, Generate.generate1, LItool.tac_from_prog.
419 let val thy = ThyC.get_theory "Isac_Knowledge";(*TODO*)
422 \item in locate_input_tactic .. ?scan_dn1?; Program.is_eval_expr .use Term.exists_Const
423 \item push srls into pstate
424 \item lucas-intrpreter.locate_input_tactic: scan_to_tactic1 srls tac cstate (progr, Rule_Set.Empty)
429 subsection \<open>Rfuns, Begin_/End_Detail', Rrls, Istate\<close>
431 remove refactor Rfuns, Rule.Prog, Rule.Empty_Prog, RrlsState: this is a concept never brought to work.
432 Clarify relation to reverse rewriting!
434 \item separate mut.recursion program with rule and rls by deleting fild scr in rls
435 (possible since CS 43160c1e775a
436 ` "replace Prog. in prep_rls by Auto_Prog.gen, which generates Prog. on the fly" )
438 \item probably only "normal_form" seems to be needed
439 \item deleted Rfuns in NEW "locate_input_tactic": no active test for "locate_rule"
440 but that seems desirable
441 \item ?how is the relation to reverse-rewriting ???
442 \item "Rfuns" markers in test/../rational
444 \item datatype istate (Istate.T): remove RrlsState, pstate: use Rrls only for creating results beyond
445 rewriting and/or respective intermediate steps (e.g. cancellation of fractions).
446 Thus we get a 1-step-action which does NOT require a state beyond istate/pstate.
447 Thus we drastically reduce complexity, also get rid of "fun from_pblobj_or_detail_calc" , etc.
448 \item debug ^^^ related: is there an occurence of Steps with more than 1 element?
450 \item and do_next (* WN1907: ?only for Begin_/End_Detail' DEL!!!*)
452 \item shouldn't go Rfuns from Rewrite --> Rewrite_Set; they behave similar to "fun interSteps" ?
454 \item ?finally Prog could go from Calcelems to ProgLang?
457 subsection \<open>Inverse_Z_Transform.thy\<close>
460 \item\label{new-var-rhs} rule1..6, ruleZY introduce new variables on the rhs of the rewrite-rule.
461 ? replace rewriting with substitution ?!?
462 The problem is related to the decision of typing for "d_d" and making bound variables free (while
463 shifting specific handling in equation solving etc. to the meta-logic).
464 \item Find "stepResponse (x[n::real]::bool)" is superfluous, because immediately used by
465 rewrite-rules; see \ref{new-var-rhs}.
466 \item Reconsider whole problem:
467 input only the polynomial as argument of partial_function, in ([1], Frm) compile lhs "X z" ?
470 subsection \<open>Adopt Isabelle's numerals for Isac\<close>
473 \item replace numerals of type "real" by "nat" in some specific functions from ListC.thy
474 and have both representations in parallel for "nat".
479 subsection \<open>Redesign equation solver\<close>
481 Existing solver is structured along the WRONG assumption,
482 that Poly.thy must be the LAST thy among all thys involved -- while the opposite is the case.
484 Preliminary solution: all inappropriately located thms are collected in Base_Tools.thy
486 subsection \<open>Finetunig required for xmldata in kbase\<close>
488 See xmldata https://intra.ist.tugraz.at/hg/isac/rev/5b222a649390
489 and in kbase html-representation generated from these xmldata.
490 Notes in ~~/xmldata/TODO.txt.
493 section \<open>Hints for further development\<close>
496 subsection \<open>Coding standards & some explanations for math-authors\<close>
497 text \<open>copy from doc/math-eng.tex WN.28.3.03
498 WN071228 extended\<close>
500 subsubsection \<open>Identifiers\<close>
501 text \<open>Naming is particularily crucial, because Isabelles name space is global, and isac does
502 not yet use the novel locale features introduces by Isar. For instance, {\tt probe} sounds
503 reasonable as (1) a description in the model of a problem-pattern, (2) as an element of the
504 problem hierarchies key, (3) as a socalled CAS-command, (4) as the name of a related script etc.
505 However, all the cases (1)..(4) require different typing for one and the same
506 identifier {\tt probe} which is impossible, and actually leads to strange errors
507 (for instance (1) is used as string, except in a script addressing a Subproblem).
509 These are the preliminary rules for naming identifiers>
511 \item [elements of a key] into the hierarchy of problems or methods must not contain
512 capital letters and may contain underscrores, e.g. {\tt probe, for_polynomials}.
513 \item [descriptions in problem-patterns] must contain at least 1 capital letter and
514 must not contain underscores, e.g. {\tt Probe, forPolynomials}.
515 \item [CAS-commands] follow the same rules as descriptions in problem-patterns above, thus
516 beware of conflicts~!
517 \item [script identifiers] always end with {\tt Program}, e.g. {\tt ProbeScript}.
521 %WN071228 extended\<close>
523 subsubsection \<open>Rule sets\<close>
524 text \<open>The actual version of the coding standards for rulesets is in {\tt /IsacKnowledge/Atools.ML
525 where it can be viewed using the knowledge browsers.
527 There are rulesets visible to the student, and there are rulesets visible (in general) only for
528 math authors. There are also rulesets which {\em must} exist for {\em each} theory;
529 these contain the identifier of the respective theory (including all capital letters)
530 as indicated by {\it Thy} below.
533 \item [norm\_{\it Thy}] exists for each theory, and {\em efficiently} calculates a
534 normalform for all terms which can be expressed by the definitions of the respective theory
535 (and the respective parents).
536 \item [simplify\_{\it Thy}] exists for each theory, and calculates a normalform for all terms
537 which can be expressed by the definitions of the respective theory (and the respective parents)
538 such, that the rewrites can be presented to the student.
539 \item [calculate\_{\it Thy}] exists for each theory, and evaluates terms with
540 numerical constants only (i.e. all terms which can be expressed by the definitions of
541 the respective theory and the respective parent theories). In particular, this ruleset includes
542 evaluating in/equalities with numerical constants only.
543 WN.3.7.03: may be dropped due to more generality: numericals and non-numericals
544 are logically equivalent, where the latter often add to the assumptions
545 (e.g. in Check_elementwise).
548 The above rulesets are all visible to the user, and also may be input;
549 thus they must be contained in {\tt Theory_Data} (KEStore_Elems.add_rlss,
550 KEStore_Elems.get_rlss). All these rulesets must undergo a preparation
551 using the function {\tt prep_rls'}, which generates a script for stepwise rewriting etc.
552 The following rulesets are used for internal purposes and usually invisible to the (naive) user:
559 {\tt Rule_Set.append_rules, Rule_Set.merge, remove_rls} TODO
562 subsection \<open>get proof-state\<close>
564 Re: [isabelle] Programatically get "this"
565 ----------------------------------------------------
566 So here is my (Makarius') version of your initial example, following these principles:
572 val ctxt = @{context};
575 Name_Space.full_name (Proof_Context.naming_of ctxt) (Binding.name Auto_Bind.thisN);
576 val this = #thms (the (Proof_Context.lookup_fact ctxt this_name));
581 subsection \<open>write Specification to jEdit\<close>
583 Re: [isabelle] Printing terms with type annotations
584 ----------------------------------------------------
585 On 06/02/2019 17:52, Moa Johansson wrote:
587 > I’m writing some code that should create a snippet of Isar script.
589 This is how Sledgehammer approximates this:
591 http://isabelle.in.tum.de/repos/isabelle/file/Isabelle2018/src/HOL/Tools/Sledgehammer/sledgehammer_isar_proof.ML#l299
593 (The module name already shows that the proper terminology is "Isar
594 proof" (or "Isar proof text"). Proof scripts are a thing from the past,
595 before Isar. You can emulate old-style proof scripts via a sequence of
596 'apply' commands, but this is improper Isar.)
598 Note that there is no standard function in Isabelle/Pure, because the
599 problem to print just the right amount of type information is very
600 complex and not fully solved. One day, after 1 or 2 rounds of
601 refinements over the above approach, it might become generally available.
603 subsection \<open>follow Isabelle conventions (*Does not yet work in Isabelle2018\<close>
605 isabelle update -u path_cartouches
606 isabelle update -u inner_syntax_cartouches
608 section \<open>Questions to Isabelle experts\<close>
611 \item ad ERROR Undefined fact "all_left" in Test_Isac: error-pattern.sml
612 Undefined fact: "xfoldr_Nil" inssort.sml
613 (* probably two different reasons:
615 (*WN0509 compare PolyEq.all_left "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)"*)
616 all_left: "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)" and
619 (*WN0509 compare LinEq.all_left "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)"*)
620 all_left: "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)" and
622 test/../partial_fractions.sml
623 (*[7], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["PolyEq", "normalise_poly"])*)
624 (*[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)"))*)
626 test/../mathengine-stateless.sml
627 (*if ThmC.string_of_thm @ {thm rnorm_equation_add} = "\<not> ?b =!= 0 \<Longrightarrow> (?a = ?b) = (?a + - 1 * ?b = 0)"
628 then () else error "string_of_thm changed";*)
630 (*---------------------------------------------------------------------------------------------*)
632 primrec xfoldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a xlist \<Rightarrow> 'b \<Rightarrow> 'b" where
633 xfoldr_Nil: "xfoldr f {|| ||} = id" |
634 xfoldr_Cons: "xfoldr f (x @# xs) = f x \<circ> xfoldr f xs"
637 srls = Rule_Set.empty, calc = [], rules = [
638 Rule.Thm ("xfoldr_Nil",(*num_str*) @{thm xfoldr_Nil} (* foldr ?f [] = id *)),
642 \item ?OK Test_Isac_Short with
643 LI.by_tactic tac (get_istate_LI pt p, get_ctxt_LI pt p) ptp
645 LI.by_tactic tac (Istate.empty, ContextC.empty) ptp
648 \item test from last CS with outcommented re-def of code ->
649 -> \<open>further tests additional to src/.. files\<close>
650 ADDTESTS/redefined-code.sml
652 \item efb749b79361 Test_Some_Short.thy has 2 errors, which disappear in thy ?!?:
653 ML_file "Interpret/error-pattern.sml" Undefined fact: "all_left"
654 ML_file "Knowledge/inssort.sml" Undefined fact: "xfoldr_Nil"
656 \item what is the actual replacement of "hg log --follow" ?
658 \item how HANDLE these exceptions, e.g.:
659 Syntax.read_term ctxt "Randbedingungen y 0 = (0::real), y L = 0, M_b 0 = 0, M_b L = 0]"
662 Failed to parse term"
664 \item how cope with "exception Size raised (line 171 of "./basis/LibrarySupport.sml")"
665 e.g. in test/Interpret/lucas-interpreter.sml
671 section \<open>For copy & paste\<close>
689 subsection \<open>xxx\<close>
690 subsubsection \<open>xxx\<close>