1 (* Title: todo's for isac core
2 Author: Walther Neuper 111013
3 (c) copyright due to lincense terms.
6 imports "~~/src/Doc/Prog_Prove/LaTeXsugar"
10 Legend: here + code since 200120
11 \<open>(*DOC\<close> identifies stuff dedicated for isac/Doc/Lucas_Interpreter
12 \<open>(*?!?\<close> identifies a design question
14 Distillation of "rounds of reforms":
15 \<open>TODOs from current changesets\<close> \<rightarrow> \<open>Postponed from current changeset\<close> \<rightarrow>
16 (*to be removed..*) \<rightarrow> \<open>Separated tasks\<close> (*.. to be removed*)
17 \<rightarrow> subsection of \<open>Major reforms\<close>
20 section \<open>TODOs from current changesets\<close>
22 Shift more complicated issues from \<open>Current changeset\<close> to \<open>Postponed from current changeset\<close>
24 subsection \<open>Current changeset\<close>
26 (*/------- to from -------\*)
27 (*\------- to from -------/*)
33 remove find_next_step' (used only for p_)
35 \item LibraryC.distinct shadows Library.distinct (+ see Library.member)
37 \item Specify.find_next_step: References.select
38 cpI = ["vonBelastungZu", "Biegelinien"]: References_Def.id
41 \item Calc.state_empty_post \<rightarrow> Calc.state_post_empty
43 \item distribute code from test/../calchead.sml
45 \item rename Tactic.Calculate -> Tactic.Evaluate
47 \item replace src/ Erls by Rule_Set.Empty
49 \item rename ptyps.sml -> specify-etc.sml
50 rename Specify -> Specify_Etc
51 rename Specify -> Specify
53 \item specific_from_prog in..end: replace o by |> (Test_Isac or Test_Some!)
55 \item cleanup ThmC in MathEngBasic
66 subsection \<open>Postponed from current changeset\<close>
70 \item Step_Specify.by_tactic (Tactic.Model_Problem' (id, _, met))
71 by_tactic (Tactic.Specify_Theory' domID)
72 had very old, strange code at 11b5b8b81876
73 ?redes Model_Problem', Specify_Theory' <--> Specify_Method: Step_Specify.complet_for ?
74 INTERMED. NO REPAIR: NOT PROMPTED IN TESTS
76 \item unify code Specify.find_next_step <--> Step_Specify.by_tactic (Tactic.Specify_Method'
78 \item Isa20.implementation: 0.2.4 Printing ML values ?INSTEAD? *.TO_STRING ???
79 ??? writeln ( make_string {x = x, y = y}); ???
81 \item revise O_Model and I_Model with an example with more than 1 variant.
83 \item ctxt is superfluous in specify-phase due to type constraints from Descript.thy
85 \item Derive.do_one: TODO find code in common with complete_solve
86 Derive.embed: TODO rewrite according to CAO (+ no intermediate access to Ctree)
88 \item Solve_Check: postponed parsing input to _ option
90 \item ? "fetch-tactics.sml" from Mathengine -> BridgeLibisabelle ?
92 \item ? unify struct.Step and struct.Solve in MathEngine ?
94 \item use "Eval_Def" for renaming identifiers
96 \item why does Test_Build_Thydata.thy depend on ProgLang and not on CalcElements ?
100 \item LI.do_next (*TODO RM..*) ???
101 \item generate.sml: RM datatype edit TOGETHER WITH datatype inout
102 \item TermC.list2isalist: typ -> term list -> term .. should NOT requires typ
103 \item get_ctxt_LI should replace get_ctxt
104 \item ALL CODE: rename spec(ification) --> know(ledge), in Specification: Relation -> Knowledge
105 \item rename Base_Tool.thy <--- Base_Tools
106 \item adopt naming conventions in Knowledge: EqSystem --> Equation_System, etc
107 \item rename field scr in meth
108 \item DEL double code: nxt_specify_init_calc IN specify.sml + step-specify.sml
116 \item clarify Tactic.Subproblem (domID, pblID) as term in Pstate {act_arg, ...}
117 there it is Free ("Subproblem", "char list \<times> ..
118 instead of Const (|???.Subproblem", "char list \<times> ..
119 AND THE STRING REPRESENTATION IS STRANGE:
120 Subproblem (''Test'',
121 ??.\ <^const> String.char.Char ''LINEAR'' ''univariate'' ''equation''
125 term2str; (*defined by..*)
126 fun term_to_string''' thy t =
128 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
129 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
131 val t = @{term "aaa + bbb"}
132 val t = @{term "Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation''])"};
134 val sss = Print_Mode.setmp [] (Syntax.string_of_term @{context}) t
136 writeln sss (*.. here perfect: Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation'']) *)
141 \item cleanup fun me:
142 fun me (*(_, Empty_Tac) p _ _ = raise ERROR ("me: Empty_Tac at " ^ pos'2str p)
143 | me*) (_, tac) p _(*NEW remove*) pt =
144 + -------------------------^^^^^^
145 # see test-code.sml fun me_trace
146 use this also for me, not only for me_ist_ctxt; del. me
147 this requires much updating in all test/*
149 \item shift tests into NEW model.sml (upd, upds_envv, ..)
151 \item clarify handling of contexts ctxt ContextC
154 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
156 \item Check_Elementwise "Assumptions": prerequisite for ^^goal
157 rm tactic Check_elementwise "Assumptions" in a way, which keeps it for Minisubpbl
158 rm Assumptions :: bool (* TODO: remove with making ^^^ idle *)
164 \item complete mstools.sml (* survey on handling contexts:
169 \item librarys.ml --> libraryC.sml + text from termC.sml
176 \item concentrate "insert_assumptions" for locate_input_tactic in "associate", ?OR? Tactic.insert_assumptions
177 DONE for find_next_step by Tactic.insert_assumptions m' ctxt
179 \item rm from "generate1" ("Detail_Set_Inst'", Tactic.Detail_Set' ?)
180 \item ?"insert_assumptions" necessary in "init_pstate" ?+++? in "applicable_in" ?+++? "associate"
183 \item DO DELETIONS AFTER analogous concentrations in find_next_step
186 \item ? what is the difference headline <--> cascmd in
187 Subproblem' (spec, oris, headline, fmz_, context, cascmd)
188 \item Substitute' what does "re-calculation mean in the datatype comment?
190 \item inform: TermC.parse (ThyC.get_theory "Isac_Knowledge") istr --> parseNEW context istr
192 \item unify/clarify stac2tac_ |
195 \item extract common code from associate.. stac2tac_xxx
196 \item rename LItool.tac_from_prog -> Tactic.from_prog_tac ? Solve_Tac.from_prog_tac,
201 \item unify in signature LANGUAGE_TOOLS =\\
202 val pblterm: ThyC.id -> Problem.id -> term vvv vvv\\
203 val subpbl: string -> string list -> term unify with ^^^
205 \item Telem.safe is questionable: has it been replaced by Safe_Step, Not_Derivable, Helpless, etc?
206 Note: replacement of Istate.safe by Istate.appy_ didn't care much about Telem.safe.
207 If Telem.safe is kept, consider merge with CTbasic.ostate
209 \item remove find_next_step from solve Apply_Method';
210 this enforces Pos.at_first_tactic, which should be dropped, too.
216 subsection \<open>Postponed --> Major reforms\<close>
220 \item revisit bootstrap Calcelements. rule->calcelems->termC
221 would be nice, but is hard: UnparseC.terms -> TermC.s_to_string
223 \item replace all Ctree.update_* with Ctree.cupdate_problem
225 \item rename (ist as {eval, ...}) -> (ist as {eval_rls, ...})
227 \item exception PROG analogous to TERM
229 \item sig/struc ..elems --> ..elem
231 \item distille CAS-command, CAScmd, etc into a struct
233 \item check location of files:
234 test/Tools/isac/Interpret/ptyps.thy
235 test/Tools/isac/Specify.ptyps.sml
237 \item check occurences of Atools in src/ test/
238 \item Const ("Atools.pow", _) ---> Const ("Base_Tool.pow", _)
242 \item Diff.thy: differentiateX --> differentiate after removal of script-constant
243 \item Test.thy: met_test_sqrt2: deleted?!
245 \item Rewrite_Ord.rew_ord' := overwritel (! Rewrite_Ord.rew_ord', (*<<<---- use Know_Store.xxx, too*)
247 \item automatically extrac rls from program-code
248 ? take ["SignalProcessing", "Z_Transform", "Inverse_sub"] as an example ?
250 \item finish output of LItool.trace with Check_Postcond (useful for SubProblem)
252 \item replace Rule_Set.empty by Rule_Set.Empty
253 latter is more clear, but replacing ***breaks rewriting over all examples***,
254 e.g. see ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x'
255 in Minisubplb/200-start-method-NEXT_STEP.sml:
256 (*+* )------- in f3cac3053e7b (Rule_Set.empty just renamed, NOT deleted) we had
258 (*+*) Rls {calc = [], erls = Erls, errpatts = [], id = "empty", preconds = [], rew_ord =
259 (*+*) ("dummy_ord", fn), rules = [], scr = Empty_Prog, srls = Erls}:
260 (*+*).. THIS IS Rule_Set.empty, BUT IT DID not CAUSE ANY ERROR !
261 (*+*)------- WITH Rule_Set.empty REMOVED (based on f3cac3053e7b) we had
262 (*+*)val Empty = prls (* <---ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x' *)
263 ( *+*)val ["sqroot-test", "univariate", "equation", "test"] = cpI
264 THAT INDICATES, that much rewriting/evaluating JUST WORKED BY CHANCE?!?
275 section \<open>Major reforms\<close>
278 subsection \<open>Exception Size raised\<close>
280 During update Isabelle2018 --> Isabelle2019 we noticed, that
281 "isabelle build" uses resources more efficiently than "isabelle jedit".
282 The former works, but the latter causes
284 \item "Exception- Size raised"
286 \item "exception Size raised (line 169 of "./basis/LibrarySupport.sml")"
287 in test/../biegelinie-*.xml.
289 This has been detected after changeset (30cd47104ad7) "lucin: reorganise theories in ProgLang".
291 Find tools to investigate the Exception, and find ways around it eventually.
293 subsection \<open>Cleanup & review signatures wrt. implementation.pdf canonical argument order\<close>
296 \item there are comments in several signatures
297 \item ML_file "~~/src/Tools/isac/Interpret/specification-elems.sml" can be (almost) deleted
298 \item src/../Frontend/: signatures missing
302 subsection \<open>overall structure of code\<close>
305 \item try to separate Isac_Knowledge from MathEngine
306 common base: Knowledge_Author / ..??
308 \item ML_file "~~/src/Tools/isac/Interpret/ctree.sml" (*shift to base in common with Interpret*)
314 subsection \<open>Separate MathEngineBasic/ Specify/ Interpret/ MathEngine/\<close>
319 \item re-organise code for Interpret
321 \item Step*: Step_Specify | Step_Solve | Step DONE
323 \item Prog_Tac: fun get_first_argument takes both Prog_Tac + Program --- wait for separate Tactical
324 then shift into common descendant
329 \item ??????????? WHY CAN LI.by_tactic NOT BE REPLACED BY Step_Solve.by_tactic ???????????
334 subsection \<open>Review modelling- + specification-phase\<close>
340 \item check match between args of partial_function and model-pattern of meth;
341 provide error message.
343 \item "--- hack for funpack: generalise handling of meths which extend problem items ---"
345 \item see several locations of hack in code
346 \item these locations are NOT sufficient, see
347 test/../biegelinie-3.sml --- IntegrierenUndKonstanteBestimmen2: Bsp.7.70. auto ---
348 \item "fun associate" "match_ags ..dI" instead "..pI" breaks many tests, however,
349 this would be according to survey Notes (3) in src/../calchead.sml.
351 \item see "failed trial to generalise handling of meths"98298342fb6d
352 \item abstract specify + nxt_specif to common aux-funs;
353 see e.g. "--- hack for funpack: generalise handling of meths which extend problem items ---"
355 \item type model = itm list ?
356 \item review survey Notes in src/../calchead.sml: they are questionable
357 \item review copy-named, probably two issues commingled
359 \item special handling of "#Find#, because it is not a formal argument of partial_function
360 \item special naming for solutions of equation solving: x_1, x_2, ...
364 \item this has been written in one go:
366 \item reconsidering I_Model.max_vt, use problem with meth ["DiffApp", "max_by_calculus"]
367 \item reconsider add_field': where is it used for what? Shift into mk_oris
368 \item reconsider match_itms_oris: where is it used for what? max_vt ONLY???
369 \item in Specify_Method search root-oris for items (e.g. "errorBound"), #1# in survey
370 \item Specify_Problem, Specify_Method: check respective identifiers after re-Specify_
371 (relevant for pre-condition)
372 \item unify match_ags to mk_oris1..N with different args (fmz | pat list, pbl | meth
377 subsection \<open>taci list, type step\<close>
379 taci was, most likely, invented to make "fun me" more efficient by avoiding duplicate rewrite,
380 and probably, because the Kernel interface separated setNextTactic and applyTactic.
381 Both are no good reasons to make code more complicated.
383 !!! taci list is used in do_next !!!
387 \item can lev_on_total replace lev_on ? ..Test_Isac_Short + rename lev_on_total -> lev_on
389 \item Step* functions should return Calc.T instead of Calc.state_post
391 \item states.sml: check, when "length tacis > 1"
392 \item in Test_Isac.thy there is only 1 error in Interpret/inform.sml
393 \item (*WN190713 REMOVE: "creating a new node" was never implemented for more than one node?!?
395 \item brute force setting all empty ([], [], ptp) works!?! but ptp causes errors -- investigate!
399 subsection \<open>Ctree\<close>
402 # mixture pos' .. pos in cappend_*, append_* is confusing
403 # existpt p pt andalso Tactic.is_empty DIFFERENT IN append_*, cappend_* is confusing
404 "exception PTREE "get_obj: pos =" ^^^^^: ^^^^ due to cut !!!
405 NOTE: exn IN if..andalso.. IS NOT!!! DETECTED, THIS is confusing
406 see test/../--- Minisubpbl/800-append-on-Frm.sml ---
407 # ?!? "cut branches below cannot be decided here" in append_atomic
408 # sign. of functions too different ?!?canonical arg.order ?!?
411 \item remove update_branch, update_*? -- make branch, etc args of append_*
413 \item close sig Ctree, contains cappend_* ?only? --- ?make parallel to ?Pide_Store?
415 \item unify args to Ctree.state (pt, p)
416 \item fun update_env .. repl_env \<rightarrow>updatempty
423 subsection \<open>replace theory/thy by context/ctxt\<close>
427 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
428 special case: Tactic.Refine_Problem
430 \item theory can be retrieved from ctxt by Proof_Context.theory_of
432 \item cleaup the many conversions string -- theory
433 \item make dest_spec --> (theory, pblID, metID) ?+ common_subthy ?
434 \item 1. Rewrite.eval_true_, then
435 LItool.check_leaf, Rewrite.eval_prog_expr, Step.add, LItool.tac_from_prog.
437 let val thy = ThyC.get_theory "Isac_Knowledge";(*TODO*)
440 \item in locate_input_tactic .. ?scan_dn1?; Program.is_eval_expr .use Term.exists_Const
441 \item push srls into pstate
442 \item lucas-intrpreter.locate_input_tactic: scan_to_tactic1 srls tac cstate (progr, Rule_Set.Empty)
447 subsection \<open>Rfuns, Begin_/End_Detail', Rrls, Istate\<close>
449 remove refactor Rfuns, Rule.Prog, Rule.Empty_Prog, RrlsState: this is a concept never brought to work.
450 Clarify relation to reverse rewriting!
452 \item separate mut.recursion program with rule and rls by deleting fild scr in rls
453 (possible since CS 43160c1e775a
454 ` "replace Prog. in prep_rls by Auto_Prog.gen, which generates Prog. on the fly" )
456 \item probably only "normal_form" seems to be needed
457 \item deleted Rfuns in NEW "locate_input_tactic": no active test for "locate_rule"
458 but that seems desirable
459 \item ?how is the relation to reverse-rewriting ???
460 \item "Rfuns" markers in test/../rational
462 \item datatype istate (Istate.T): remove RrlsState, pstate: use Rrls only for creating results beyond
463 rewriting and/or respective intermediate steps (e.g. cancellation of fractions).
464 Thus we get a 1-step-action which does NOT require a state beyond istate/pstate.
465 Thus we drastically reduce complexity, also get rid of "fun from_pblobj_or_detail_calc" , etc.
466 \item debug ^^^ related: is there an occurence of Steps with more than 1 element?
468 \item and do_next (* WN1907: ?only for Begin_/End_Detail' DEL!!!*)
470 \item shouldn't go Rfuns from Rewrite --> Rewrite_Set; they behave similar to "fun interSteps" ?
472 \item ?finally Prog could go from Calcelems to ProgLang?
475 subsection \<open>Inverse_Z_Transform.thy\<close>
478 \item\label{new-var-rhs} rule1..6, ruleZY introduce new variables on the rhs of the rewrite-rule.
479 ? replace rewriting with substitution ?!?
480 The problem is related to the decision of typing for "d_d" and making bound variables free (while
481 shifting specific handling in equation solving etc. to the meta-logic).
482 \item Find "stepResponse (x[n::real]::bool)" is superfluous, because immediately used by
483 rewrite-rules; see \ref{new-var-rhs}.
484 \item Reconsider whole problem:
485 input only the polynomial as argument of partial_function, in ([1], Frm) compile lhs "X z" ?
488 subsection \<open>Adopt Isabelle's numerals for Isac\<close>
491 \item replace numerals of type "real" by "nat" in some specific functions from ListC.thy
492 and have both representations in parallel for "nat".
497 subsection \<open>Redesign equation solver\<close>
499 Existing solver is structured along the WRONG assumption,
500 that Poly.thy must be the LAST thy among all thys involved -- while the opposite is the case.
502 Preliminary solution: all inappropriately located thms are collected in Base_Tools.thy
504 subsection \<open>Finetunig required for xmldata in kbase\<close>
506 See xmldata https://intra.ist.tugraz.at/hg/isac/rev/5b222a649390
507 and in kbase html-representation generated from these xmldata.
508 Notes in ~~/xmldata/TODO.txt.
511 section \<open>Hints for further development\<close>
514 subsection \<open>Coding standards & some explanations for math-authors\<close>
515 text \<open>copy from doc/math-eng.tex WN.28.3.03
516 WN071228 extended\<close>
518 subsubsection \<open>Identifiers\<close>
519 text \<open>Naming is particularily crucial, because Isabelles name space is global, and isac does
520 not yet use the novel locale features introduces by Isar. For instance, {\tt probe} sounds
521 reasonable as (1) a description in the model of a problem-pattern, (2) as an element of the
522 problem hierarchies key, (3) as a socalled CAS-command, (4) as the name of a related script etc.
523 However, all the cases (1)..(4) require different typing for one and the same
524 identifier {\tt probe} which is impossible, and actually leads to strange errors
525 (for instance (1) is used as string, except in a script addressing a Subproblem).
527 These are the preliminary rules for naming identifiers>
529 \item [elements of a key] into the hierarchy of problems or methods must not contain
530 capital letters and may contain underscrores, e.g. {\tt probe, for_polynomials}.
531 \item [descriptions in problem-patterns] must contain at least 1 capital letter and
532 must not contain underscores, e.g. {\tt Probe, forPolynomials}.
533 \item [CAS-commands] follow the same rules as descriptions in problem-patterns above, thus
534 beware of conflicts~!
535 \item [script identifiers] always end with {\tt Program}, e.g. {\tt ProbeScript}.
539 %WN071228 extended\<close>
541 subsubsection \<open>Rule sets\<close>
542 text \<open>The actual version of the coding standards for rulesets is in {\tt /IsacKnowledge/Atools.ML
543 where it can be viewed using the knowledge browsers.
545 There are rulesets visible to the student, and there are rulesets visible (in general) only for
546 math authors. There are also rulesets which {\em must} exist for {\em each} theory;
547 these contain the identifier of the respective theory (including all capital letters)
548 as indicated by {\it Thy} below.
551 \item [norm\_{\it Thy}] exists for each theory, and {\em efficiently} calculates a
552 normalform for all terms which can be expressed by the definitions of the respective theory
553 (and the respective parents).
554 \item [simplify\_{\it Thy}] exists for each theory, and calculates a normalform for all terms
555 which can be expressed by the definitions of the respective theory (and the respective parents)
556 such, that the rewrites can be presented to the student.
557 \item [calculate\_{\it Thy}] exists for each theory, and evaluates terms with
558 numerical constants only (i.e. all terms which can be expressed by the definitions of
559 the respective theory and the respective parent theories). In particular, this ruleset includes
560 evaluating in/equalities with numerical constants only.
561 WN.3.7.03: may be dropped due to more generality: numericals and non-numericals
562 are logically equivalent, where the latter often add to the assumptions
563 (e.g. in Check_elementwise).
566 The above rulesets are all visible to the user, and also may be input;
567 thus they must be contained in {\tt Theory_Data} (KEStore_Elems.add_rlss,
568 KEStore_Elems.get_rlss). All these rulesets must undergo a preparation
569 using the function {\tt prep_rls'}, which generates a script for stepwise rewriting etc.
570 The following rulesets are used for internal purposes and usually invisible to the (naive) user:
577 {\tt Rule_Set.append_rules, Rule_Set.merge, remove_rls} TODO
580 subsection \<open>get proof-state\<close>
582 Re: [isabelle] Programatically get "this"
583 ----------------------------------------------------
584 So here is my (Makarius') version of your initial example, following these principles:
590 val ctxt = @{context};
593 Name_Space.full_name (Proof_Context.naming_of ctxt) (Binding.name Auto_Bind.thisN);
594 val this = #thms (the (Proof_Context.lookup_fact ctxt this_name));
599 subsection \<open>write Specification to jEdit\<close>
601 Re: [isabelle] Printing terms with type annotations
602 ----------------------------------------------------
603 On 06/02/2019 17:52, Moa Johansson wrote:
605 > I’m writing some code that should create a snippet of Isar script.
607 This is how Sledgehammer approximates this:
609 http://isabelle.in.tum.de/repos/isabelle/file/Isabelle2018/src/HOL/Tools/Sledgehammer/sledgehammer_isar_proof.ML#l299
611 (The module name already shows that the proper terminology is "Isar
612 proof" (or "Isar proof text"). Proof scripts are a thing from the past,
613 before Isar. You can emulate old-style proof scripts via a sequence of
614 'apply' commands, but this is improper Isar.)
616 Note that there is no standard function in Isabelle/Pure, because the
617 problem to print just the right amount of type information is very
618 complex and not fully solved. One day, after 1 or 2 rounds of
619 refinements over the above approach, it might become generally available.
621 subsection \<open>follow Isabelle conventions (*Does not yet work in Isabelle2018\<close>
623 isabelle update -u path_cartouches
624 isabelle update -u inner_syntax_cartouches
626 section \<open>Questions to Isabelle experts\<close>
629 \item ad ERROR Undefined fact "all_left" in Test_Isac: error-pattern.sml
630 Undefined fact: "xfoldr_Nil" inssort.sml
631 (* probably two different reasons:
633 (*WN0509 compare PolyEq.all_left "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)"*)
634 all_left: "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)" and
637 (*WN0509 compare LinEq.all_left "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)"*)
638 all_left: "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)" and
640 test/../partial_fractions.sml
641 (*[7], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["PolyEq", "normalise_poly"])*)
642 (*[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)"))*)
644 test/../mathengine-stateless.sml
645 (*if ThmC.string_of_thm @ {thm rnorm_equation_add} = "\<not> ?b =!= 0 \<Longrightarrow> (?a = ?b) = (?a + - 1 * ?b = 0)"
646 then () else error "string_of_thm changed";*)
648 (*---------------------------------------------------------------------------------------------*)
650 primrec xfoldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a xlist \<Rightarrow> 'b \<Rightarrow> 'b" where
651 xfoldr_Nil: "xfoldr f {|| ||} = id" |
652 xfoldr_Cons: "xfoldr f (x @# xs) = f x \<circ> xfoldr f xs"
655 srls = Rule_Set.empty, calc = [], rules = [
656 Rule.Thm ("xfoldr_Nil",(*num_str*) @{thm xfoldr_Nil} (* foldr ?f [] = id *)),
660 \item ?OK Test_Isac_Short with
661 LI.by_tactic tac (get_istate_LI pt p, get_ctxt_LI pt p) ptp
663 LI.by_tactic tac (Istate.empty, ContextC.empty) ptp
666 \item test from last CS with outcommented re-def of code ->
667 -> \<open>further tests additional to src/.. files\<close>
668 ADDTESTS/redefined-code.sml
670 \item efb749b79361 Test_Some_Short.thy has 2 errors, which disappear in thy ?!?:
671 ML_file "Interpret/error-pattern.sml" Undefined fact: "all_left"
672 ML_file "Knowledge/inssort.sml" Undefined fact: "xfoldr_Nil"
674 \item what is the actual replacement of "hg log --follow" ?
676 \item how HANDLE these exceptions, e.g.:
677 Syntax.read_term ctxt "Randbedingungen y 0 = (0::real), y L = 0, M_b 0 = 0, M_b L = 0]"
680 Failed to parse term"
682 \item how cope with "exception Size raised (line 171 of "./basis/LibrarySupport.sml")"
683 e.g. in test/Interpret/lucas-interpreter.sml
689 section \<open>For copy & paste\<close>
707 subsection \<open>xxx\<close>
708 subsubsection \<open>xxx\<close>