comments on relation between files.
note: higher order functions might allow for re-union.
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
36 \item rename ptyps.sml -> specify-etc.sml
37 rename Specify -> Specify_Etc
38 rename SpecifyNEW -> Specify
40 \item specific_from_prog in..end: replace o by |> (Test_Isac or Test_Some!)
42 \item cleanup ThmC in MathEngBasic
53 subsection \<open>Postponed from current changeset\<close>
59 \item use "Eval_Def" for renaming identifiers
61 \item why does Test_Build_Thydata.thy depend on ProgLang and not on CalcElements ?
65 \item LI.do_next (*TODO RM..*) ???
66 \item generate.sml: RM datatype edit TOGETHER WITH datatype inout
67 \item TermC.list2isalist: typ -> term list -> term .. should NOT requires typ
68 \item get_ctxt_LI should replace get_ctxt
69 \item ALL CODE: rename spec(ification) --> know(ledge), in Specification: Relation -> Knowledge
70 \item rename Base_Tool.thy <--- Base_Tools
71 \item adopt naming conventions in Knowledge: EqSystem --> Equation_System, etc
72 \item rename field scr in meth
73 \item DEL double code: nxt_specify_init_calc IN specify.sml + step-specify.sml
81 \item clarify Tactic.Subproblem (domID, pblID) as term in Pstate {act_arg, ...}
82 there it is Free ("Subproblem", "char list \<times> ..
83 instead of Const (|???.Subproblem", "char list \<times> ..
84 AND THE STRING REPRESENTATION IS STRANGE:
86 ??.\ <^const> String.char.Char ''LINEAR'' ''univariate'' ''equation''
90 term2str; (*defined by..*)
91 fun term_to_string''' thy t =
93 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
94 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
96 val t = @{term "aaa + bbb"}
97 val t = @{term "Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation''])"};
99 val sss = Print_Mode.setmp [] (Syntax.string_of_term @{context}) t
101 writeln sss (*.. here perfect: Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation'']) *)
106 \item cleanup fun me:
107 fun me (*(_, Empty_Tac) p _ _ = raise ERROR ("me: Empty_Tac at " ^ pos'2str p)
108 | me*) (_, tac) p _(*NEW remove*) pt =
109 + -------------------------^^^^^^
110 # see test-code.sml fun me_trace
111 use this also for me, not only for me_ist_ctxt; del. me
112 this requires much updating in all test/*
115 \item generate, generate1: NO thy as arg.
116 Generate.generate1 thy is redundant: is the same during pbl, thus lookup spec
117 redesign return value (originally for output by fun me?)
119 \item shift tests into NEW model.sml (upd, upds_envv, ..)
122 \item clarify handling of contexts ctxt ContextC
125 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
127 \item Check_Elementwise "Assumptions": prerequisite for ^^goal
128 rm tactic Check_elementwise "Assumptions" in a way, which keeps it for Minisubpbl
129 rm Assumptions :: bool (* TODO: remove with making ^^^ idle *)
135 \item complete mstools.sml (* survey on handling contexts:
140 \item librarys.ml --> libraryC.sml + text from termC.sml
147 \item concentrate "insert_assumptions" for locate_input_tactic in "associate", ?OR? Tactic.insert_assumptions
148 DONE for find_next_step by Tactic.insert_assumptions m' ctxt
150 \item rm from "generate1" ("Detail_Set_Inst'", Tactic.Detail_Set' ?)
151 \item shift from "applicable_in..Apply_Method" to ? ? ? (is ONLY use-case in appl.sml))
152 \item ?"insert_assumptions" necessary in "init_pstate" ?+++? in "applicable_in" ?+++? "associate"
155 \item DO DELETIONS AFTER analogous concentrations in find_next_step
158 \item ? what is the difference headline <--> cascmd in
159 Subproblem' (spec, oris, headline, fmz_, context, cascmd)
161 \item inform: TermC.parse (ThyC.get_theory "Isac_Knowledge") istr --> parseNEW context istr
163 \item unify/clarify stac2tac_ |
166 \item extract common code from associate.. stac2tac_xxx
167 \item rename LItool.tac_from_prog -> Tactic.from_prog_tac ? Solve_Tac.from_prog_tac,
172 \item unify in signature LANGUAGE_TOOLS =\\
173 val pblterm: ThyC.id -> Problem.id -> term vvv vvv\\
174 val subpbl: string -> string list -> term unify with ^^^
176 \item Telem.safe is questionable: has it been replaced by Safe_Step, Not_Derivable, Helpless, etc?
177 Note: replacement of Istate.safe by Istate.appy_ didn't care much about Telem.safe.
178 If Telem.safe is kept, consider merge with CTbasic.ostate
180 \item remove find_next_step from solve Apply_Method';
181 this enforces Pos.at_first_tactic, which should be dropped, too.
187 subsection \<open>Postponed --> Major reforms\<close>
191 \item revisit bootstrap Calcelements. rule->calcelems->termC
192 would be nice, but is hard: UnparseC.terms -> TermC.s_to_string
194 \item replace all Ctree.update_* with Ctree.cupdate_problem
196 \item rename (ist as {eval, ...}) -> (ist as {eval_rls, ...})
198 \item exception PROG analogous to TERM
200 \item sig/struc ..elems --> ..elem
202 \item distille CAS-command, CAScmd, etc into a struct
204 \item check location of files:
205 test/Tools/isac/Interpret/ptyps.thy
206 test/Tools/isac/Specify.ptyps.sml
208 \item check occurences of Atools in src/ test/
209 \item Const ("Atools.pow", _) ---> Const ("Base_Tool.pow", _)
213 \item Diff.thy: differentiateX --> differentiate after removal of script-constant
214 \item Test.thy: met_test_sqrt2: deleted?!
216 \item Rewrite_Ord.rew_ord' := overwritel (! Rewrite_Ord.rew_ord', (*<<<---- use Know_Store.xxx, too*)
218 \item automatically extrac rls from program-code
219 ? take ["SignalProcessing", "Z_Transform", "Inverse_sub"] as an example ?
221 \item finish output of LItool.trace with Check_Postcond (useful for SubProblem)
223 \item replace Rule_Set.empty by Rule_Set.Empty
224 latter is more clear, but replacing ***breaks rewriting over all examples***,
225 e.g. see ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x'
226 in Minisubplb/200-start-method-NEXT_STEP.sml:
227 (*+* )------- in f3cac3053e7b (Rule_Set.empty just renamed, NOT deleted) we had
229 (*+*) Rls {calc = [], erls = Erls, errpatts = [], id = "empty", preconds = [], rew_ord =
230 (*+*) ("dummy_ord", fn), rules = [], scr = Empty_Prog, srls = Erls}:
231 (*+*).. THIS IS Rule_Set.empty, BUT IT DID not CAUSE ANY ERROR !
232 (*+*)------- WITH Rule_Set.empty REMOVED (based on f3cac3053e7b) we had
233 (*+*)val Empty = prls (* <---ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x' *)
234 ( *+*)val ["sqroot-test", "univariate", "equation", "test"] = cpI
235 THAT INDICATES, that much rewriting/evaluating JUST WORKED BY CHANCE?!?
246 section \<open>Major reforms\<close>
249 subsection \<open>Exception Size raised\<close>
251 During update Isabelle2018 --> Isabelle2019 we noticed, that
252 "isabelle build" uses resources more efficiently than "isabelle jedit".
253 The former works, but the latter causes
255 \item "Exception- Size raised"
257 \item "exception Size raised (line 169 of "./basis/LibrarySupport.sml")"
258 in test/../biegelinie-*.xml.
260 This has been detected after changeset (30cd47104ad7) "lucin: reorganise theories in ProgLang".
262 Find tools to investigate the Exception, and find ways around it eventually.
264 subsection \<open>Cleanup & review signatures wrt. implementation.pdf canonical argument order\<close>
267 \item there are comments in several signatures
268 \item ML_file "~~/src/Tools/isac/Interpret/specification-elems.sml" can be (almost) deleted
269 \item src/../Frontend/: signatures missing
273 subsection \<open>overall structure of code\<close>
276 \item try to separate Isac_Knowledge from MathEngine
277 common base: Knowledge_Author / ..??
279 \item ML_file "~~/src/Tools/isac/Interpret/ctree.sml" (*shift to base in common with Interpret*)
285 subsection \<open>Separate MathEngineBasic/ Specify/ Interpret/ MathEngine/\<close>
290 \item re-organise code for Interpret
292 \item Step*: Step_Specify | Step_Solve | Step
294 \item *.check | *.add ARE TOO LATE IN BUILD with Step_Specify | Step_Solve
295 Specify_Step.check | Specify_Step.add <-- Applicable.applicable_in
296 Solve_Step.check | Solve_Step.add <-- Generate.generate1
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, ...
340 \item structure Tactic Specify -?-> Proglang (would require Model., Selem.)
342 \item this has been written in one go:
344 \item reconsidering Model.max_vt, use problem with meth ["DiffApp","max_by_calculus"]
345 \item reconsider add_field': where is it used for what? Shift into mk_oris
346 \item reconsider match_itms_oris: where is it used for what? max_vt ONLY???
347 \item in Specify_Method search root-oris for items (e.g. "errorBound"), #1# in survey
348 \item Specify_Problem, Specify_Method: check respective identifiers after re-Specify_
349 (relevant for pre-condition)
350 \item unify match_ags to mk_oris1..N with different args (fmz | pat list, pbl | meth
355 subsection \<open>taci list, type step\<close>
357 taci was, most likely, invented to make "fun me" more efficient by avoiding duplicate rewrite,
358 and probably, because the Kernel interface separated setNextTactic and applyTactic.
359 Both are no good reasons to make code more complicated.
361 !!! taci list is used in do_next !!!
365 \item can lev_on_total replace lev_on ? ..Test_Isac_Short + rename lev_on_total -> lev_on
367 \item Step* functions should return Calc.T instead of Chead.calcstate'
369 \item states.sml: check, when "length tacis > 1"
370 \item in Test_Isac.thy there is only 1 error in Interpret/inform.sml
371 \item (*WN190713 REMOVE: "creating a new node" was never implemented for more than one node?!?
373 \item brute force setting all empty ([], [], ptp) works!?! but ptp causes errors -- investigate!
377 subsection \<open>Ctree\<close>
380 # mixture pos' .. pos in cappend_*, append_* is confusing
381 # existpt p pt andalso Tactic.is_empty DIFFERENT IN append_*, cappend_* is confusing
382 "exception PTREE "get_obj: pos =" ^^^^^: ^^^^ due to cut !!!
383 NOTE: exn IN if..andalso.. IS NOT!!! DETECTED, THIS is confusing
384 see test/../--- Minisubpbl/800-append-on-Frm.sml ---
385 # ?!? "cut branches below cannot be decided here" in append_atomic
386 # sign. of functions too different ?!?canonical arg.order ?!?
389 \item remove update_branch, update_*? -- make branch, etc args of append_*
391 \item close sig Ctree, contains cappend_* ?only? --- ?make parallel to ?Pide_Store?
393 \item unify args to Ctree.state (pt, p)
394 \item fun update_env .. repl_env \<rightarrow>updatempty
401 subsection \<open>replace theory/thy by context/ctxt\<close>
405 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
406 special case: Tactic.Refine_Problem
408 \item theory can be retrieved from ctxt by Proof_Context.theory_of
410 \item cleaup the many conversions string -- theory
411 \item make dest_spec --> (theory, pblID, metID) ?+ common_subthy ?
412 \item 1. Rewrite.eval_true_, then
413 LItool.check_leaf, Rewrite.eval_prog_expr, Generate.generate1, LItool.tac_from_prog.
415 let val thy = ThyC.get_theory "Isac_Knowledge";(*TODO*)
418 \item in locate_input_tactic .. ?scan_dn1?; Program.is_eval_expr .use Term.exists_Const
419 \item push srls into pstate
420 \item lucas-intrpreter.locate_input_tactic: scan_to_tactic1 srls tac cstate (progr, Rule_Set.Empty)
425 subsection \<open>Rfuns, Begin_/End_Detail', Rrls, Istate\<close>
427 remove refactor Rfuns, Rule.Prog, Rule.Empty_Prog, RrlsState: this is a concept never brought to work.
428 Clarify relation to reverse rewriting!
430 \item separate mut.recursion program with rule and rls by deleting fild scr in rls
431 (possible since CS 43160c1e775a
432 ` "replace Prog. in prep_rls by Auto_Prog.gen, which generates Prog. on the fly" )
434 \item probably only "normal_form" seems to be needed
435 \item deleted Rfuns in NEW "locate_input_tactic": no active test for "locate_rule"
436 but that seems desirable
437 \item ?how is the relation to reverse-rewriting ???
438 \item "Rfuns" markers in test/../rational
440 \item datatype istate (Istate.T): remove RrlsState, pstate: use Rrls only for creating results beyond
441 rewriting and/or respective intermediate steps (e.g. cancellation of fractions).
442 Thus we get a 1-step-action which does NOT require a state beyond istate/pstate.
443 Thus we drastically reduce complexity, also get rid of "fun from_pblobj_or_detail_calc" , etc.
444 \item debug ^^^ related: is there an occurence of Steps with more than 1 element?
446 \item and do_next (* WN1907: ?only for Begin_/End_Detail' DEL!!!*)
448 \item shouldn't go Rfuns from Rewrite --> Rewrite_Set; they behave similar to "fun interSteps" ?
450 \item ?finally Prog could go from Calcelems to ProgLang?
453 subsection \<open>Inverse_Z_Transform.thy\<close>
456 \item\label{new-var-rhs} rule1..6, ruleZY introduce new variables on the rhs of the rewrite-rule.
457 ? replace rewriting with substitution ?!?
458 The problem is related to the decision of typing for "d_d" and making bound variables free (while
459 shifting specific handling in equation solving etc. to the meta-logic).
460 \item Find "stepResponse (x[n::real]::bool)" is superfluous, because immediately used by
461 rewrite-rules; see \ref{new-var-rhs}.
462 \item Reconsider whole problem:
463 input only the polynomial as argument of partial_function, in ([1], Frm) compile lhs "X z" ?
466 subsection \<open>Adopt Isabelle's numerals for Isac\<close>
469 \item replace numerals of type "real" by "nat" in some specific functions from ListC.thy
470 and have both representations in parallel for "nat".
475 subsection \<open>Redesign equation solver\<close>
477 Existing solver is structured along the WRONG assumption,
478 that Poly.thy must be the LAST thy among all thys involved -- while the opposite is the case.
480 Preliminary solution: all inappropriately located thms are collected in Base_Tools.thy
482 subsection \<open>Finetunig required for xmldata in kbase\<close>
484 See xmldata https://intra.ist.tugraz.at/hg/isac/rev/5b222a649390
485 and in kbase html-representation generated from these xmldata.
486 Notes in ~~/xmldata/TODO.txt.
489 section \<open>Hints for further development\<close>
492 subsection \<open>Coding standards & some explanations for math-authors\<close>
493 text \<open>copy from doc/math-eng.tex WN.28.3.03
494 WN071228 extended\<close>
496 subsubsection \<open>Identifiers\<close>
497 text \<open>Naming is particularily crucial, because Isabelles name space is global, and isac does
498 not yet use the novel locale features introduces by Isar. For instance, {\tt probe} sounds
499 reasonable as (1) a description in the model of a problem-pattern, (2) as an element of the
500 problem hierarchies key, (3) as a socalled CAS-command, (4) as the name of a related script etc.
501 However, all the cases (1)..(4) require different typing for one and the same
502 identifier {\tt probe} which is impossible, and actually leads to strange errors
503 (for instance (1) is used as string, except in a script addressing a Subproblem).
505 These are the preliminary rules for naming identifiers>
507 \item [elements of a key] into the hierarchy of problems or methods must not contain
508 capital letters and may contain underscrores, e.g. {\tt probe, for_polynomials}.
509 \item [descriptions in problem-patterns] must contain at least 1 capital letter and
510 must not contain underscores, e.g. {\tt Probe, forPolynomials}.
511 \item [CAS-commands] follow the same rules as descriptions in problem-patterns above, thus
512 beware of conflicts~!
513 \item [script identifiers] always end with {\tt Program}, e.g. {\tt ProbeScript}.
517 %WN071228 extended\<close>
519 subsubsection \<open>Rule sets\<close>
520 text \<open>The actual version of the coding standards for rulesets is in {\tt /IsacKnowledge/Atools.ML
521 where it can be viewed using the knowledge browsers.
523 There are rulesets visible to the student, and there are rulesets visible (in general) only for
524 math authors. There are also rulesets which {\em must} exist for {\em each} theory;
525 these contain the identifier of the respective theory (including all capital letters)
526 as indicated by {\it Thy} below.
529 \item [norm\_{\it Thy}] exists for each theory, and {\em efficiently} calculates a
530 normalform for all terms which can be expressed by the definitions of the respective theory
531 (and the respective parents).
532 \item [simplify\_{\it Thy}] exists for each theory, and calculates a normalform for all terms
533 which can be expressed by the definitions of the respective theory (and the respective parents)
534 such, that the rewrites can be presented to the student.
535 \item [calculate\_{\it Thy}] exists for each theory, and evaluates terms with
536 numerical constants only (i.e. all terms which can be expressed by the definitions of
537 the respective theory and the respective parent theories). In particular, this ruleset includes
538 evaluating in/equalities with numerical constants only.
539 WN.3.7.03: may be dropped due to more generality: numericals and non-numericals
540 are logically equivalent, where the latter often add to the assumptions
541 (e.g. in Check_elementwise).
544 The above rulesets are all visible to the user, and also may be input;
545 thus they must be contained in {\tt Theory_Data} (KEStore_Elems.add_rlss,
546 KEStore_Elems.get_rlss). All these rulesets must undergo a preparation
547 using the function {\tt prep_rls'}, which generates a script for stepwise rewriting etc.
548 The following rulesets are used for internal purposes and usually invisible to the (naive) user:
555 {\tt Rule_Set.append_rules, Rule_Set.merge, remove_rls} TODO
558 subsection \<open>get proof-state\<close>
560 Re: [isabelle] Programatically get "this"
561 ----------------------------------------------------
562 So here is my (Makarius') version of your initial example, following these principles:
568 val ctxt = @{context};
571 Name_Space.full_name (Proof_Context.naming_of ctxt) (Binding.name Auto_Bind.thisN);
572 val this = #thms (the (Proof_Context.lookup_fact ctxt this_name));
577 subsection \<open>write Specification to jEdit\<close>
579 Re: [isabelle] Printing terms with type annotations
580 ----------------------------------------------------
581 On 06/02/2019 17:52, Moa Johansson wrote:
583 > I’m writing some code that should create a snippet of Isar script.
585 This is how Sledgehammer approximates this:
587 http://isabelle.in.tum.de/repos/isabelle/file/Isabelle2018/src/HOL/Tools/Sledgehammer/sledgehammer_isar_proof.ML#l299
589 (The module name already shows that the proper terminology is "Isar
590 proof" (or "Isar proof text"). Proof scripts are a thing from the past,
591 before Isar. You can emulate old-style proof scripts via a sequence of
592 'apply' commands, but this is improper Isar.)
594 Note that there is no standard function in Isabelle/Pure, because the
595 problem to print just the right amount of type information is very
596 complex and not fully solved. One day, after 1 or 2 rounds of
597 refinements over the above approach, it might become generally available.
599 subsection \<open>follow Isabelle conventions (*Does not yet work in Isabelle2018\<close>
601 isabelle update -u path_cartouches
602 isabelle update -u inner_syntax_cartouches
604 section \<open>Questions to Isabelle experts\<close>
607 \item ad ERROR Undefined fact "all_left" in Test_Isac: error-pattern.sml
608 Undefined fact: "xfoldr_Nil" inssort.sml
609 (* probably two different reasons:
611 (*WN0509 compare PolyEq.all_left "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)"*)
612 all_left: "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)" and
615 (*WN0509 compare LinEq.all_left "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)"*)
616 all_left: "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)" and
618 test/../partial_fractions.sml
619 (*[7], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["PolyEq", "normalise_poly"])*)
620 (*[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)"))*)
622 test/../mathengine-stateless.sml
623 (*if ThmC.string_of_thm @ {thm rnorm_equation_add} = "\<not> ?b =!= 0 \<Longrightarrow> (?a = ?b) = (?a + - 1 * ?b = 0)"
624 then () else error "string_of_thm changed";*)
626 (*---------------------------------------------------------------------------------------------*)
628 primrec xfoldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a xlist \<Rightarrow> 'b \<Rightarrow> 'b" where
629 xfoldr_Nil: "xfoldr f {|| ||} = id" |
630 xfoldr_Cons: "xfoldr f (x @# xs) = f x \<circ> xfoldr f xs"
633 srls = Rule_Set.empty, calc = [], rules = [
634 Rule.Thm ("xfoldr_Nil",(*num_str*) @{thm xfoldr_Nil} (* foldr ?f [] = id *)),
638 \item ?OK Test_Isac_Short with
639 LI.by_tactic tac (get_istate_LI pt p, get_ctxt_LI pt p) ptp
641 LI.by_tactic tac (Istate.empty, ContextC.empty) ptp
644 \item test from last CS with outcommented re-def of code ->
645 -> \<open>further tests additional to src/.. files\<close>
646 ADDTESTS/redefined-code.sml
648 \item efb749b79361 Test_Some_Short.thy has 2 errors, which disappear in thy ?!?:
649 ML_file "Interpret/error-pattern.sml" Undefined fact: "all_left"
650 ML_file "Knowledge/inssort.sml" Undefined fact: "xfoldr_Nil"
652 \item what is the actual replacement of "hg log --follow" ?
654 \item how HANDLE these exceptions, e.g.:
655 Syntax.read_term ctxt "Randbedingungen y 0 = (0::real), y L = 0, M_b 0 = 0, M_b L = 0]"
658 Failed to parse term"
660 \item how cope with "exception Size raised (line 171 of "./basis/LibrarySupport.sml")"
661 e.g. in test/Interpret/lucas-interpreter.sml
667 section \<open>For copy & paste\<close>
685 subsection \<open>xxx\<close>
686 subsubsection \<open>xxx\<close>