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