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