(*  Title:  build and test isac on Isabelle2013

     Author: Walther Neuper, TU Graz, 100808

    (c) due to copyright terms

 For creating a heap image of isac see ~~/ROOT.

 ATTENTION: no errors in this theory do not mean that there are no errors in Isac;

 errors are rigorously detected when creating a heap.

 *)

 header {* Loading the isac mathengine;

   for debugging see text at begin (theory dependencies!) *}

 theory Build_Isac 

 imports Complex_Main

 (* use    "library.sml"

    use    "calcelems.sml"

    use    "ProgLang/termC.sml"

    use    "ProgLang/calculate.sml"

    use    "ProgLang/rewrite.sml"

   "use_thy ProgLang/ListC"

   "use_thy ProgLang/Tools"                                                 

   "use_thy ProgLang/Script"

    use    "ProgLang/scrtools.sml"

 *)        "ProgLang/ProgLang"

 (* use    "Interpret/mstools.sml"

    use    "Interpret/ctree.sml"

    use    "Interpret/ptyps.sml"

    use    "Interpret/generate.sml"

    use    "Interpret/calchead.sml"

    use    "Interpret/appl.sml"

    use    "Interpret/rewtools.sml"

    use    "Interpret/script.sml"

    use    "Interpret/solve.sml"

    use    "Interpret/inform.sml"

    use    "Interpret/mathengine.sml"

 *)        "Interpret/Interpret"

 (* use    "xmlsrc/mathml.sml"

    use    "xmlsrc/datatypes.sml"

    use    "xmlsrc/pbl-met-hierarchy.sml"

    use    "xmlsrc/thy-hierarchy.sml"                               

    use    "xmlsrc/interface-xml.sml"

 *)        "xmlsrc/xmlsrc"

 (* use     "Frontend/messages.sml"

    use     "Frontend/states.sml"

    use     "Frontend/interface.sml"

    use     "print_exn_G.sml"

 *)         "Frontend/Frontend"

            "Knowledge/Build_Thydata" (*imports Isac.thy etc*)

 begin

 text {* 

   show theory dependencies using the graph browser, 

   open "browser_info/HOL/Isac/session.graph"

   and proceed from the ancestors towards the siblings.

 *}

 section {*check presence of definitions from directories*}

 ML {* is_reall_dsc; (*from "ProgLang/scrtools.sml" *) *}

 ML {* me; (*from "Interpret/mathengine.sml"*) *}

 ML {* contextthyOK2xml; (*"xmlsrc/interface-xml.sml"*) *}

 ML {* print_exn_unit *}

 ML {* list_rls (*from Atools.thy WN130615??? or ProgLang???*) *}

 ML {* eval_occurs_in (*from Atools.thy*) *}

 ML {* @{thm last_thmI} (*from Atools.thy*) *}

 ML {*@{thm Querkraft_Belastung}*}

 ML {* check_guhs_unique := false; *}

 ML {* writeln "**** isac kernel = math-engine + Knowledge complete ******" *}

 ML {* @{theory "Isac"} *}

 ML {* CHECK_FILLPATS "at end of Build_Isac";

 (*"CHECK_FILLPATS: diff_sin_chain exists, fillpat --> NOT empty !!!"*)*}

 section {* State of approaching Isabelle by Isac *}

 text {* 

   Mathias Lehnfeld gives the following list in his thesis in section 

   4.2.3 Relation to Ongoing Isabelle Development.

 *}

 subsection {* (0) Survey on remaining Unsynchronized.ref *}

 text {*

   REMOVE WITHOUT REPLACEMENT (requires some efforts)

     calcelems.sml:val theory'  = Unsynchronized.ref ([]:(theory' * theory) list);

     calcelems.sml:val isab_thm_thy = Unsynchronized.ref ([] : (thmDeriv * term) list);

     calcelems.sml:val isabthys = Unsynchronized.ref ([] : theory list);

   REPLACE BY KEStore... (has been overlooked)

     calcelems.sml:val rew_ord' = Unsynchronized.ref ...

   KEEP FOR TRACING

     calcelems.sml:val trace_rewrite = Unsynchronized.ref false;

     calcelems.sml:val depth = Unsynchronized.ref 99999;

     calcelems.sml:val lim_rewrite = Unsynchronized.ref 99999;

     calcelems.sml:val lim_deriv = Unsynchronized.ref 100;

     Interpret/script.sml:val trace_script = Unsynchronized.ref false;

   KEEP FOR EASIER DEVELOPMENT

     calcelems.sml:val check_guhs_unique = Unsynchronized.ref true;

   KEEP FOR DEMOS

     Knowledge/GCD_Poly_ML.thy:  val trace_div = Unsynchronized.ref true;

     Knowledge/GCD_Poly_ML.thy:  val trace_div_invariant = Unsynchronized.ref false;

     Knowledge/GCD_Poly_ML.thy:  val trace_Euclid = Unsynchronized.ref true;

 *}

 subsection {* (1) Exploit parallelism for concurrent session management *}

 subsection {* (2) Make Isac’s programming language usable *}

 subsection {* (3) Adopt Isabelle’s numeral computation for Isac *}

 text {* 

   In 2002 isac already strived for floating point numbers. Since that time

   isac represents numerals as "Free", see below (*1*). These experiments are

   unsatisfactory with respect to logical soundness.

   Since Isabelle now has started to care about floating point numbers, it is high 

   time to adopt these together with the other numerals. Isabelle2012/13's numerals

   are different from Isabelle2011, see "test/Tools/isac/ProgLang/termC.sml".

   The transition from "Free" to standard numerals is a task to be scheduled for 

   several weeks. The urgency of this task follows from the experience, 

   that (1.2) for "thehier" is very hard, because "num_str" seems to destroy 

   some of the long identifiers of theorems which would tremendously simplify

   building a hierarchy of theorems according to (1.2), see (*2*) below.

 *}

 ML {*(*1*) Free ("123.456", HOLogic.realT) *}

 ML {*(*2*)

 val unknown = filter ((curry op= "??.unknown") o fst) isacrlsthms';

 unknown |> nth 1 |> snd |> term_to_string''' @{theory};

 unknown |> nth 2 |> snd |> term_to_string''' @{theory};

 (*but these seem ok:*)

   Thm.get_name_hint @{thm add_0};

   Thm.get_name_hint (num_str @{thm add_0});

 *}

 subsection {* (4) Improve the efficiency of Isac’s rewrite-engine *}

 subsection {* (5) Adopt Isabelle/jEdit for Isac *}

 end