prefer symbolic directories $ISABELLE_ISAC and $ISABELLE_ISAC_TEST, instead of re-using ~~ for $ISABELLE_HOME;
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 -------/*)
29 \item resume step 6.10: unsuccessful trials with combination of types on Outer_Syntax
30 note: test in Calculation.thy is outcommented
32 \item re-arrange Isac's bootstrap: look for "after devel.of BridgeJEdit"
35 \item Input_Descript.descriptor -> Input_Descript.T
37 \item Step_Specify.initialisePIDE: remove hdl in return-value
38 rename Step_Specify.nxt_specify_init_calc
40 \item relate Prog_Epxr.lhs to Thm.lhs_of
42 \item as soon as src/../parseC.sml is stable,
43 remove defs from Test_Parse_Isac.thy
44 + and shift tests from Test_Parse_Isac -> test/../parseC.sml
46 \item Specify.find_next_step: References.select
47 cpI = ["vonBelastungZu", "Biegelinien"]: References_Def.id
50 \item Calc.state_empty_post \<rightarrow> Calc.state_post_empty
52 \item distribute code from test/../calchead.sml
54 \item rename Tactic.Calculate -> Tactic.Evaluate
56 \item replace src/ Erls by Rule_Set.Empty
58 \item rename ptyps.sml -> specify-etc.sml
59 rename Specify -> Specify_Etc
60 rename Specify -> Specify
62 \item specific_from_prog in..end: replace o by |> (Test_Isac or Test_Some!)
64 \item cleanup ThmC in MathEngBasic
75 subsection \<open>Postponed from current changeset\<close>
79 \item make steps around SubProblem more consistent:
80 SubProblem (thy, [pbl]) is bypassed by Model_Problem, if it is 1st Tactic in a Program.
82 * the Tactic SubProblem (thy, [pbl]) creates the formula SubProblem (thy, [pbl])
84 * the Tactic Model_Problem starts Specification
86 see test/../sub-problem.sml
88 \item Specify_Step.add has dummy argument Istate_Def.Uistate -- remove down to Ctree
90 \item Step_Specify.by_tactic (Tactic.Model_Problem' (id, _, met))
91 by_tactic (Tactic.Specify_Theory' domID)
92 had very old, strange code at 11b5b8b81876
93 ?redes Model_Problem', Specify_Theory' <--> Specify_Method: Step_Specify.complet_for ?
94 INTERMED. NO REPAIR: NOT PROMPTED IN TESTS
96 \item unify code Specify.find_next_step <--> Step_Specify.by_tactic (Tactic.Specify_Method'
98 \item Isa20.implementation: 0.2.4 Printing ML values ?INSTEAD? *.TO_STRING ???
99 ??? writeln ( make_string {x = x, y = y}); ???
101 \item revise O_Model and I_Model with an example with more than 1 variant.
103 \item ctxt is superfluous in specify-phase due to type constraints from Input_Descript.thy
105 \item Derive.do_one: TODO find code in common with complete_solve
106 Derive.embed: TODO rewrite according to CAO (+ no intermediate access to Ctree)
108 \item Solve_Check: postponed parsing input to _ option
110 \item ? "fetch-tactics.sml" from Mathengine -> BridgeLibisabelle ?
112 \item ? unify struct.Step and struct.Solve in MathEngine ?
114 \item use "Eval_Def" for renaming identifiers
116 \item why does Test_Build_Thydata.thy depend on ProgLang and not on CalcElements ?
120 \item LI.do_next (*TODO RM..*) ???
121 \item generate.sml: RM datatype edit TOGETHER WITH datatype inout
122 \item TermC.list2isalist: typ -> term list -> term .. should NOT requires typ
123 \item get_ctxt_LI should replace get_ctxt
124 \item ALL CODE: rename spec(ification) --> know(ledge), in Specification: Relation -> Knowledge
125 \item rename Base_Tool.thy <--- Base_Tools
126 \item adopt naming conventions in Knowledge: EqSystem --> Equation_System, etc
127 \item rename field scr in meth
135 \item clarify Tactic.Subproblem (domID, pblID) as term in Pstate {act_arg, ...}
136 there it is Free ("Subproblem", "char list \<times> ..
137 instead of Const (|???.Subproblem", "char list \<times> ..
138 AND THE STRING REPRESENTATION IS STRANGE:
139 Subproblem (''Test'',
140 ??.\ <^const> String.char.Char ''LINEAR'' ''univariate'' ''equation''
144 term2str; (*defined by..*)
145 fun term_to_string''' thy t =
147 val ctxt' = Config.put show_markup false (Proof_Context.init_global thy)
148 in Print_Mode.setmp [] (Syntax.string_of_term ctxt') t end;
150 val t = @{term "aaa + bbb"}
151 val t = @{term "Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation''])"};
153 val sss = Print_Mode.setmp [] (Syntax.string_of_term @{context}) t
155 writeln sss (*.. here perfect: Subproblem (''Test'', [''LINEAR'', ''univariate'', ''equation'']) *)
160 \item cleanup fun me:
161 fun me (*(_, Empty_Tac) p _ _ = raise ERROR ("me: Empty_Tac at " ^ pos'2str p)
162 | me*) (_, tac) p _(*NEW remove*) pt =
163 + -------------------------^^^^^^
164 # see test-code.sml fun me_trace
165 use this also for me, not only for me_ist_ctxt; del. me
166 this requires much updating in all test/*
168 \item shift tests into NEW model.sml (upd, upds_envv, ..)
170 \item clarify handling of contexts ctxt ContextC
173 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
175 \item Check_Elementwise "Assumptions": prerequisite for ^^goal
176 rm tactic Check_elementwise "Assumptions" in a way, which keeps it for Minisubpbl
177 rm Assumptions :: bool (* TODO: remove with making ^^^ idle *)
183 \item complete mstools.sml (* survey on handling contexts:
188 \item librarys.ml --> libraryC.sml + text from termC.sml
195 \item concentrate "insert_assumptions" for locate_input_tactic in "associate", ?OR? Tactic.insert_assumptions
196 DONE for find_next_step by Tactic.insert_assumptions m' ctxt
198 \item rm from "generate1" ("Detail_Set_Inst'", Tactic.Detail_Set' ?)
199 \item ?"insert_assumptions" necessary in "init_pstate" ?+++? in "applicable_in" ?+++? "associate"
202 \item DO DELETIONS AFTER analogous concentrations in find_next_step
205 \item ? what is the difference headline <--> cascmd in
206 Subproblem' (spec, oris, headline, fmz_, context, cascmd)
207 \item Substitute' what does "re-calculation mean in the datatype comment?
209 \item inform: TermC.parse (ThyC.get_theory "Isac_Knowledge") istr --> parseNEW context istr
211 \item unify/clarify stac2tac_ |
214 \item extract common code from associate.. stac2tac_xxx
215 \item rename LItool.tac_from_prog -> Tactic.from_prog_tac ? Solve_Tac.from_prog_tac,
220 \item unify in signature LANGUAGE_TOOLS =\\
221 val pblterm: ThyC.id -> Problem.id -> term vvv vvv\\
222 val subpbl: string -> string list -> term unify with ^^^
224 \item Telem.safe is questionable: has it been replaced by Safe_Step, Not_Derivable, Helpless, etc?
225 Note: replacement of Istate.safe by Istate.appy_ didn't care much about Telem.safe.
226 If Telem.safe is kept, consider merge with CTbasic.ostate
228 \item remove find_next_step from solve Apply_Method';
229 this enforces Pos.at_first_tactic, which should be dropped, too.
235 subsection \<open>Postponed --> Major reforms\<close>
240 \item make parser mutually recursive for Problem .. Solution
241 preps. in Test_Parse_Isac:
243 subsubsection "problem_mini" shows a principal issue with recursive parsing
244 probably due to !2! arguments of parser (as shown in Cookbook)
245 Test_Parsers_Cookbook:
246 (* recursive parser p.140 \<section>6.1 adapted to tokens: *) shows differences,
247 which might help understanding the principal issue
248 see also Test_Parsers subsection "recursive parsing"
252 \item revisit bootstrap Calcelements. rule->calcelems->termC
253 would be nice, but is hard: UnparseC.terms -> TermC.s_to_string
255 \item replace all Ctree.update_* with Ctree.cupdate_problem
257 \item rename (ist as {eval, ...}) -> (ist as {eval_rls, ...})
259 \item exception PROG analogous to TERM
261 \item sig/struc ..elems --> ..elem
263 \item distille CAS-command, CAScmd, etc into a struct
265 \item check location of files:
266 test/Tools/isac/Interpret/ptyps.thy
267 test/Tools/isac/Specify.ptyps.sml
269 \item check occurences of Atools in src/ test/
270 \item Const ("Atools.pow", _) ---> Const ("Base_Tool.pow", _)
274 \item Diff.thy: differentiateX --> differentiate after removal of script-constant
275 \item Test.thy: met_test_sqrt2: deleted?!
277 \item Rewrite_Ord.rew_ord' := overwritel (! Rewrite_Ord.rew_ord', (*<<<---- use Know_Store.xxx, too*)
279 \item automatically extrac rls from program-code
280 ? take ["SignalProcessing", "Z_Transform", "Inverse_sub"] as an example ?
282 \item finish output of LItool.trace with Check_Postcond (useful for SubProblem)
284 \item replace Rule_Set.empty by Rule_Set.Empty
285 latter is more clear, but replacing ***breaks rewriting over all examples***,
286 e.g. see ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x'
287 in Minisubplb/200-start-method-NEXT_STEP.sml:
288 (*+* )------- in f3cac3053e7b (Rule_Set.empty just renamed, NOT deleted) we had
290 (*+*) Rls {calc = [], erls = Erls, errpatts = [], id = "empty", preconds = [], rew_ord =
291 (*+*) ("dummy_ord", fn), rules = [], scr = Empty_Prog, srls = Erls}:
292 (*+*).. THIS IS Rule_Set.empty, BUT IT DID not CAUSE ANY ERROR !
293 (*+*)------- WITH Rule_Set.empty REMOVED (based on f3cac3053e7b) we had
294 (*+*)val Empty = prls (* <---ERROR: rewrite__set_ called with 'Erls' for 'precond_rootpbl x' *)
295 ( *+*)val ["sqroot-test", "univariate", "equation", "test"] = cpI
296 THAT INDICATES, that much rewriting/evaluating JUST WORKED BY CHANCE?!?
307 section \<open>Major reforms\<close>
310 subsection \<open>Exception Size raised\<close>
312 During update Isabelle2018 --> Isabelle2019 we noticed, that
313 "isabelle build" uses resources more efficiently than "isabelle jedit".
314 The former works, but the latter causes
316 \item "Exception- Size raised"
318 \item "exception Size raised (line 169 of "./basis/LibrarySupport.sml")"
319 in test/../biegelinie-*.xml.
321 This has been detected after changeset (30cd47104ad7) "lucin: reorganise theories in ProgLang".
323 Find tools to investigate the Exception, and find ways around it eventually.
325 subsection \<open>Cleanup & review signatures wrt. implementation.pdf canonical argument order\<close>
328 \item there are comments in several signatures
329 \item ML_file "$ISABELLE_ISAC/Interpret/specification-elems.sml" can be (almost) deleted
330 \item src/../Frontend/: signatures missing
334 subsection \<open>overall structure of code\<close>
337 \item try to separate Isac_Knowledge from MathEngine
338 common base: Knowledge_Author / ..??
340 \item ML_file "$ISABELLE_ISAC/Interpret/ctree.sml" (*shift to base in common with Interpret*)
346 subsection \<open>Separate MathEngineBasic/ Specify/ Interpret/ MathEngine/\<close>
351 \item re-organise code for Interpret
353 \item Step*: Step_Specify | Step_Solve | Step DONE
355 \item Prog_Tac: fun get_first_argument takes both Prog_Tac + Program --- wait for separate Tactical
356 then shift into common descendant
361 \item ??????????? WHY CAN LI.by_tactic NOT BE REPLACED BY Step_Solve.by_tactic ???????????
366 subsection \<open>Review modelling- + specification-phase\<close>
372 \item check match between args of partial_function and model-pattern of meth;
373 provide error message.
375 \item "--- hack for funpack: generalise handling of meths which extend problem items ---"
377 \item see several locations of hack in code
378 \item these locations are NOT sufficient, see
379 test/../biegelinie-3.sml --- IntegrierenUndKonstanteBestimmen2: Bsp.7.70. auto ---
380 \item "fun associate" "match_ags ..dI" instead "..pI" breaks many tests, however,
381 this would be according to survey Notes (3) in src/../calchead.sml.
383 \item see "failed trial to generalise handling of meths"98298342fb6d
384 \item abstract specify + nxt_specif to common aux-funs;
385 see e.g. "--- hack for funpack: generalise handling of meths which extend problem items ---"
387 \item type model = itm list ?
388 \item review survey Notes in src/../calchead.sml: they are questionable
389 \item review copy-named, probably two issues commingled
391 \item special handling of "#Find#, because it is not a formal argument of partial_function
392 \item special naming for solutions of equation solving: x_1, x_2, ...
396 \item this has been written in one go:
398 \item reconsidering I_Model.max_vt, use problem with meth ["DiffApp", "max_by_calculus"]
399 \item reconsider add_field': where is it used for what? Shift into mk_oris
400 \item reconsider match_itms_oris: where is it used for what? max_vt ONLY???
401 \item in Specify_Method search root-oris for items (e.g. "errorBound"), #1# in survey
402 \item Specify_Problem, Specify_Method: check respective identifiers after re-Specify_
403 (relevant for pre-condition)
404 \item unify match_ags to mk_oris1..N with different args (fmz | pat list, pbl | meth
409 subsection \<open>taci list, type step\<close>
411 taci was, most likely, invented to make "fun me" more efficient by avoiding duplicate rewrite,
412 and probably, because the Kernel interface separated setNextTactic and applyTactic.
413 Both are no good reasons to make code more complicated.
415 !!! taci list is used in do_next !!!
419 \item can lev_on_total replace lev_on ? ..Test_Isac_Short + rename lev_on_total -> lev_on
421 \item Step* functions should return Calc.T instead of Calc.state_post
423 \item states.sml: check, when "length tacis > 1"
424 \item in Test_Isac.thy there is only 1 error in Interpret/inform.sml
425 \item (*WN190713 REMOVE: "creating a new node" was never implemented for more than one node?!?
427 \item brute force setting all empty ([], [], ptp) works!?! but ptp causes errors -- investigate!
431 subsection \<open>Ctree\<close>
434 # mixture pos' .. pos in cappend_*, append_* is confusing
435 # existpt p pt andalso Tactic.is_empty DIFFERENT IN append_*, cappend_* is confusing
436 "exception PTREE "get_obj: pos =" ^^^^^: ^^^^ due to cut !!!
437 NOTE: exn IN if..andalso.. IS NOT!!! DETECTED, THIS is confusing
438 see test/../--- Minisubpbl/800-append-on-Frm.sml ---
439 # ?!? "cut branches below cannot be decided here" in append_atomic
440 # sign. of functions too different ?!?canonical arg.order ?!?
443 \item remove update_branch, update_*? -- make branch, etc args of append_*
445 \item close sig Ctree, contains cappend_* ?only? --- ?make parallel to ?Pide_Store?
447 \item unify args to Ctree.state (pt, p)
448 \item fun update_env .. repl_env \<rightarrow>updatempty
455 subsection \<open>replace theory/thy by context/ctxt\<close>
459 \item Specify/ works with thy | Interpret/ works with ctxt | MathEngine.step works with ?!?ctxt
460 special case: Tactic.Refine_Problem
462 \item theory can be retrieved from ctxt by Proof_Context.theory_of
464 \item cleaup the many conversions string -- theory
465 \item make dest_spec --> (theory, pblID, metID) ?+ common_subthy ?
466 \item 1. Rewrite.eval_true_, then
467 LItool.check_leaf, Rewrite.eval_prog_expr, Step.add, LItool.tac_from_prog.
469 let val thy = ThyC.get_theory "Isac_Knowledge";(*TODO*)
472 \item in locate_input_tactic .. ?scan_dn1?; Program.is_eval_expr .use Term.exists_Const
473 \item push srls into pstate
474 \item lucas-intrpreter.locate_input_tactic: scan_to_tactic1 srls tac cstate (progr, Rule_Set.Empty)
479 subsection \<open>Rfuns, Begin_/End_Detail', Rrls, Istate\<close>
481 remove refactor Rfuns, Rule.Prog, Rule.Empty_Prog, RrlsState: this is a concept never brought to work.
482 Clarify relation to reverse rewriting!
484 \item separate mut.recursion program with rule and rls by deleting fild scr in rls
485 (possible since CS 43160c1e775a
486 ` "replace Prog. in prep_rls by Auto_Prog.gen, which generates Prog. on the fly" )
488 \item probably only "normal_form" seems to be needed
489 \item deleted Rfuns in NEW "locate_input_tactic": no active test for "locate_rule"
490 but that seems desirable
491 \item ?how is the relation to reverse-rewriting ???
492 \item "Rfuns" markers in test/../rational
494 \item datatype istate (Istate.T): remove RrlsState, pstate: use Rrls only for creating results beyond
495 rewriting and/or respective intermediate steps (e.g. cancellation of fractions).
496 Thus we get a 1-step-action which does NOT require a state beyond istate/pstate.
497 Thus we drastically reduce complexity, also get rid of "fun from_pblobj_or_detail_calc" , etc.
498 \item debug ^^^ related: is there an occurence of Steps with more than 1 element?
500 \item and do_next (* WN1907: ?only for Begin_/End_Detail' DEL!!!*)
502 \item shouldn't go Rfuns from Rewrite --> Rewrite_Set; they behave similar to "fun interSteps" ?
504 \item ?finally Prog could go from Calcelems to ProgLang?
507 subsection \<open>Inverse_Z_Transform.thy\<close>
510 \item\label{new-var-rhs} rule1..6, ruleZY introduce new variables on the rhs of the rewrite-rule.
511 ? replace rewriting with substitution ?!?
512 The problem is related to the decision of typing for "d_d" and making bound variables free (while
513 shifting specific handling in equation solving etc. to the meta-logic).
514 \item Find "stepResponse (x[n::real]::bool)" is superfluous, because immediately used by
515 rewrite-rules; see \ref{new-var-rhs}.
516 \item Reconsider whole problem:
517 input only the polynomial as argument of partial_function, in ([1], Frm) compile lhs "X z" ?
520 subsection \<open>Adopt Isabelle's numerals for Isac\<close>
523 \item replace numerals of type "real" by "nat" in some specific functions from ListC.thy
524 and have both representations in parallel for "nat".
529 subsection \<open>Redesign equation solver\<close>
531 Existing solver is structured along the WRONG assumption,
532 that Poly.thy must be the LAST thy among all thys involved -- while the opposite is the case.
534 Preliminary solution: all inappropriately located thms are collected in Base_Tools.thy
536 subsection \<open>Finetunig required for xmldata in kbase\<close>
538 See xmldata https://intra.ist.tugraz.at/hg/isac/rev/5b222a649390
539 and in kbase html-representation generated from these xmldata.
540 Notes in ~~/xmldata/TODO.txt.
543 section \<open>Hints for further development\<close>
546 subsection \<open>Coding standards & some explanations for math-authors\<close>
547 text \<open>copy from doc/math-eng.tex WN.28.3.03
548 WN071228 extended\<close>
550 subsubsection \<open>Identifiers\<close>
551 text \<open>Naming is particularily crucial, because Isabelles name space is global, and isac does
552 not yet use the novel locale features introduces by Isar. For instance, {\tt probe} sounds
553 reasonable as (1) a description in the model of a problem-pattern, (2) as an element of the
554 problem hierarchies key, (3) as a socalled CAS-command, (4) as the name of a related script etc.
555 However, all the cases (1)..(4) require different typing for one and the same
556 identifier {\tt probe} which is impossible, and actually leads to strange errors
557 (for instance (1) is used as string, except in a script addressing a Subproblem).
559 These are the preliminary rules for naming identifiers>
561 \item [elements of a key] into the hierarchy of problems or methods must not contain
562 capital letters and may contain underscrores, e.g. {\tt probe, for_polynomials}.
563 \item [descriptions in problem-patterns] must contain at least 1 capital letter and
564 must not contain underscores, e.g. {\tt Probe, forPolynomials}.
565 \item [CAS-commands] follow the same rules as descriptions in problem-patterns above, thus
566 beware of conflicts~!
567 \item [script identifiers] always end with {\tt Program}, e.g. {\tt ProbeScript}.
571 %WN071228 extended\<close>
573 subsubsection \<open>Rule sets\<close>
574 text \<open>The actual version of the coding standards for rulesets is in {\tt /IsacKnowledge/Atools.ML
575 where it can be viewed using the knowledge browsers.
577 There are rulesets visible to the student, and there are rulesets visible (in general) only for
578 math authors. There are also rulesets which {\em must} exist for {\em each} theory;
579 these contain the identifier of the respective theory (including all capital letters)
580 as indicated by {\it Thy} below.
583 \item [norm\_{\it Thy}] exists for each theory, and {\em efficiently} calculates a
584 normalform for all terms which can be expressed by the definitions of the respective theory
585 (and the respective parents).
586 \item [simplify\_{\it Thy}] exists for each theory, and calculates a normalform for all terms
587 which can be expressed by the definitions of the respective theory (and the respective parents)
588 such, that the rewrites can be presented to the student.
589 \item [calculate\_{\it Thy}] exists for each theory, and evaluates terms with
590 numerical constants only (i.e. all terms which can be expressed by the definitions of
591 the respective theory and the respective parent theories). In particular, this ruleset includes
592 evaluating in/equalities with numerical constants only.
593 WN.3.7.03: may be dropped due to more generality: numericals and non-numericals
594 are logically equivalent, where the latter often add to the assumptions
595 (e.g. in Check_elementwise).
598 The above rulesets are all visible to the user, and also may be input;
599 thus they must be contained in {\tt Theory_Data} (KEStore_Elems.add_rlss,
600 KEStore_Elems.get_rlss). All these rulesets must undergo a preparation
601 using the function {\tt prep_rls'}, which generates a script for stepwise rewriting etc.
602 The following rulesets are used for internal purposes and usually invisible to the (naive) user:
609 {\tt Rule_Set.append_rules, Rule_Set.merge, remove_rls} TODO
612 subsection \<open>get proof-state\<close>
614 Re: [isabelle] Programatically get "this"
615 ----------------------------------------------------
616 So here is my (Makarius') version of your initial example, following these principles:
622 val ctxt = @{context};
625 Name_Space.full_name (Proof_Context.naming_of ctxt) (Binding.name Auto_Bind.thisN);
626 val this = #thms (the (Proof_Context.lookup_fact ctxt this_name));
631 subsection \<open>write Specification to jEdit\<close>
633 Re: [isabelle] Printing terms with type annotations
634 ----------------------------------------------------
635 On 06/02/2019 17:52, Moa Johansson wrote:
637 > I’m writing some code that should create a snippet of Isar script.
639 This is how Sledgehammer approximates this:
641 http://isabelle.in.tum.de/repos/isabelle/file/Isabelle2018/src/HOL/Tools/Sledgehammer/sledgehammer_isar_proof.ML#l299
643 (The module name already shows that the proper terminology is "Isar
644 proof" (or "Isar proof text"). Proof scripts are a thing from the past,
645 before Isar. You can emulate old-style proof scripts via a sequence of
646 'apply' commands, but this is improper Isar.)
648 Note that there is no standard function in Isabelle/Pure, because the
649 problem to print just the right amount of type information is very
650 complex and not fully solved. One day, after 1 or 2 rounds of
651 refinements over the above approach, it might become generally available.
653 subsection \<open>follow Isabelle conventions (*Does not yet work in Isabelle2018\<close>
655 isabelle update -u path_cartouches
656 isabelle update -u inner_syntax_cartouches
658 section \<open>Questions to Isabelle experts\<close>
661 \item ad ERROR Undefined fact "all_left" in Test_Isac: error-pattern.sml
662 Undefined fact: "xfoldr_Nil" inssort.sml
663 (* probably two different reasons:
665 (*WN0509 compare PolyEq.all_left "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)"*)
666 all_left: "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)" and
669 (*WN0509 compare LinEq.all_left "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)"*)
670 all_left: "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)" and
672 test/../partial_fractions.sml
673 (*[7], Met*)val (p,_,f,nxt,_,pt) = me nxt p [] pt; (*nxt = Apply_Method ["PolyEq", "normalise_poly"])*)
674 (*[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)"))*)
676 test/../mathengine-stateless.sml
677 (*if ThmC.string_of_thm @ {thm rnorm_equation_add} = "\<not> ?b =!= 0 \<Longrightarrow> (?a = ?b) = (?a + - 1 * ?b = 0)"
678 then () else error "string_of_thm changed";*)
680 (*---------------------------------------------------------------------------------------------*)
682 primrec xfoldr :: "('a \<Rightarrow> 'b \<Rightarrow> 'b) \<Rightarrow> 'a xlist \<Rightarrow> 'b \<Rightarrow> 'b" where
683 xfoldr_Nil: "xfoldr f {|| ||} = id" |
684 xfoldr_Cons: "xfoldr f (x @# xs) = f x \<circ> xfoldr f xs"
687 srls = Rule_Set.empty, calc = [], rules = [
688 Rule.Thm ("xfoldr_Nil",(*num_str*) @{thm xfoldr_Nil} (* foldr ?f [] = id *)),
692 \item ?OK Test_Isac_Short with
693 LI.by_tactic tac (get_istate_LI pt p, get_ctxt_LI pt p) ptp
695 LI.by_tactic tac (Istate.empty, ContextC.empty) ptp
698 \item test from last CS with outcommented re-def of code ->
699 -> \<open>further tests additional to src/.. files\<close>
700 ADDTESTS/redefined-code.sml
702 \item efb749b79361 Test_Some_Short.thy has 2 errors, which disappear in thy ?!?:
703 ML_file "Interpret/error-pattern.sml" Undefined fact: "all_left"
704 ML_file "Knowledge/inssort.sml" Undefined fact: "xfoldr_Nil"
706 \item what is the actual replacement of "hg log --follow" ?
708 \item how HANDLE these exceptions, e.g.:
709 Syntax.read_term ctxt "Randbedingungen y 0 = (0::real), y L = 0, M_b 0 = 0, M_b L = 0]"
712 Failed to parse term"
714 \item how cope with "exception Size raised (line 171 of "./basis/LibrarySupport.sml")"
715 e.g. in test/Interpret/lucas-interpreter.sml
721 section \<open>For copy & paste\<close>
739 subsection \<open>xxx\<close>
740 subsubsection \<open>xxx\<close>