(* Title: "BridgeLibisabelle/thy-hierarchy.sml"

   Author: Walther Neuper 0601

   (c) due to copyright terms

Export theory-data "thehier" to xml.

*)

signature THEORY_HIERARCHY =

sig

  val collect_cals: string * ThyC.id -> (Thy_Write.theID * Thy_Write.thydata) list

  val collect_isab: string -> string * thm -> Thy_Write.theID * Thy_Write.thydata

  val collect_ords: 'a * ThyC.id -> (Thy_Write.theID * Thy_Write.thydata) list

  val collect_part: string -> theory -> theory list -> (Thy_Write.theID * Thy_Write.thydata) list

  val collect_rlss: string -> (Rule_Set.id * (ThyC.id * Rule_Set.T)) list -> theory list ->

    (Thy_Write.theID * Thy_Write.thydata) list

  val collect_thms: string -> theory -> (Thy_Write.theID * Thy_Write.thydata) list

  val hierarchy_guh: 'a Store.T -> string

  val insert_errpatIDs: 'a -> Thy_Write.theID -> Error_Pattern_Def.id list ->

    Thy_Write.thydata * Thy_Write.theID

  val update_hrls: Thy_Write.thydata -> Error_Pattern_Def.id list -> Thy_Write.thydata

  val makeHcal: string * ThyC.id -> string * Rule_Def.calc -> Thy_Write.theID * Thy_Write.thydata

  val makeHord: string * ThyC.id -> string * Rule_Def.rew_ord_ ->

    Thy_Write.theID * Thy_Write.thydata

  val makeHrls: string -> Rule_Set.id * (ThyC.id * Rule_Def.rule_set) ->

    Thy_Write.theID * Thy_Write.thydata

  val makeHthm: string * ThyC.id -> thm -> Thy_Write.theID * Thy_Write.thydata

  val make_cal: theory -> Rule_Def.calc -> Thy_Write.authors -> Thy_Write.thydata * Thy_Write.theID

  val make_isa: theory -> ThyC.id * ThyC.id -> Thy_Write.authors ->

    Thy_Write.thydata * Thy_Write.theID

  val make_ord: theory -> Rule_Def.rew_ord_ -> Thy_Write.authors ->

    Thy_Write.thydata * Thy_Write.theID

  val make_rls: theory -> Rule_Def.rule_set -> Thy_Write.authors -> Thy_Write.thydata * Thy_Write.theID

  val make_thm: theory -> string -> string * thm -> Thy_Write.authors -> Thy_Write.thydata * Thy_Write.theID

  val make_thy: theory -> Thy_Write.authors -> Thy_Write.thydata * Thy_Write.theID

  val show_thes: unit -> unit

  val thes2file: Pbl_Met_Hierarchy.filepath -> unit

  val thms_of: theory -> thm list

  val thms_of_rlss: theory -> (Rule_Set.id * (ThyC.id * Rule_Def.rule_set)) list ->

    (string * thm) list

  val thy_hierarchy2file: Pbl_Met_Hierarchy.filepath -> unit

  val thydata2file: Pbl_Met_Hierarchy.filepath -> Pos.pos -> Thy_Write.theID -> Thy_Write.thydata -> unit

  val thydata2xml: Thy_Write.theID * Thy_Write.thydata -> xml

(* ---- for tests only: shifted from below to remove the Warning "unused" at fun.def. --------- *)

  (*NONE*)

(*/-------------------------------------------------------- ! aktivate for Test_Isac BEGIN ---\* )

  val get_fun_ids: theory -> (string * typ) list

  val thenode: Pbl_Met_Hierarchy.filepath -> string list -> Pos.pos -> (Pbl_Met_Hierarchy.filepath -> Pos.pos ->

    string list -> 'a -> 'b) -> 'a Store.node -> unit

  val thenodes: Pbl_Met_Hierarchy.filepath -> string list -> Pos.pos -> (Pbl_Met_Hierarchy.filepath -> Pos.pos ->

    string list -> 'a -> 'b) -> 'a Store.T -> unit

( *\--- ! aktivate for Test_Isac END ----------------------------------------------------------/*)

end

(**)

structure Thy_Hierarchy(**): THEORY_HIERARCHY(**) =

struct

(**)

open TermC (* allows contains_one_of to be infix *)

fun fun_id_of ({scr = prog, ...} : MethodC.T) = 

  case prog of

    Rule.Empty_Prog => NONE

  | Rule.Prog t => 

    (case t of

      Const ("HOL.eq", _) $ Free ("t", _) $ Free ("t", _) (*=@{thm refl}*) => NONE

    | _ => SOME (Program.get_fun_id t))

  | Rule.Rfuns _ => NONE

fun get_fun_ids thy =

  let 

    val mets = Store.get_all (KEStore_Elems.get_mets thy)

    (* all mets of the respective theory PLUS of all ancestor theories*)

    val fun_ids = mets |> map fun_id_of |> filter is_some |> map the

  in 

    filter (fn (str, _) => ThyC.cut_id str = Context.theory_name thy) fun_ids 

  end

(* copy from mutabelle_extra.ML, fun thms_of *)

fun thms_of thy = (* das ist zu verbessern *)

  let

    val fun_ids = get_fun_ids thy

  in

    filter (fn thm => Context.theory_name (Thm.theory_of_thm thm) = Context.theory_name thy

        andalso not (thm contains_one_of fun_ids)

        andalso not (ThmC.id_of_thm thm = "mono"))

        (* created in Biegelinie by partial_function ^^^^^^*)

      (map snd (Global_Theory.all_thms_of thy false))

  end

(* wrap theory-data into the uniform type thydata *)

fun makeHthm (part : string, thyID : ThyC.id) (thm : thm) =

    let val theID = [part, thyID, "Theorems"] @ [ThmC.id_of_thm thm] : Thy_Write.theID

    in (theID, Thy_Write.Hthm {guh = Thy_Write.theID2guh theID, coursedesign = [], 

		     mathauthors = ["isac-team"], fillpats = [], thm = thm})

    end;

fun makeHrls (part : string) (rls' : Rule_Set.id, thy_rls as (thyID, rls): ThyC.id * Rule_Set.T) =

    let val theID = [part, thyID,"Rulesets"] @ [rls'] : Thy_Write.theID

    in (theID, Thy_Write.Hrls {guh = Thy_Write.theID2guh theID, coursedesign = [], 

		     mathauthors = ["isac-team"], thy_rls = thy_rls})

    end;

fun makeHcal (part : string, thyID : ThyC.id) (calID, cal) =

    let val theID = [part, thyID,"Operations"] @ [calID] : Thy_Write.theID

    in (theID, Thy_Write.Hcal {guh = Thy_Write.theID2guh theID, coursedesign=[], 

		     mathauthors = ["isac-team"], calc = cal})

    end;

fun makeHord (part : string, thyID : ThyC.id) (ordID, ord) =

    let val theID = [part, thyID,"TODO-Orders"] @ [ordID] : Thy_Write.theID

    in (theID, Thy_Write.Hord  {guh = Thy_Write.theID2guh theID, coursedesign=[], 

		      mathauthors = ["isac-team"], ord = ord})

    end;

(* get all theorems from the list of rule-sets (defined in Knowledge) *)

fun thms_of_rlss thy rlss = (rlss : (Rule_Set.id * (ThyC.id * Rule_Set.T)) list)

  |> map (Thy_Present.thms_of_rls o #2 o #2)

  |> flat

  |> map (ThmC.revert_sym_rule thy)

  |> map (fn Rule.Thm (thmID, thm) => (thmID, thm))

  |> distinct (fn ((thmID1, _), (thmID2, _)) => thmID1 = thmID2) 

  : ThmC.T list                              

(* collect all thydata defined in in a theory *)

fun collect_thms part thy =

  map (makeHthm (part, Context.theory_name thy)) (rev (thms_of thy))

fun collect_rlss part rlss thys = (rlss : (Rule_Set.id * (ThyC.id * Rule_Set.T)) list)

  |> filter (fn (_, (thyID, _)) => member (op=) (map Context.theory_name thys) thyID)

  |> map (makeHrls part)

fun collect_cals (part, thy') =

  let val cals = [] (*FIXXXXXXXXXXME.WN060713 add thyID: (thyID, cal)*)

  in map (makeHcal (part, thy')) cals end;

fun collect_ords (part, thy') =

    let val thy = ThyC.get_theory thy'

    in [(*TODO.WN060120 rew_ord, Eval*)]:(Thy_Write.theID * Thy_Write.thydata) list end;

(* parts are: Isabelle | IsacKnowledge | IsacScripts, see Know_Store.thy *)

fun collect_part part parent thys =

  (flat (map (collect_thms part) thys)) @

  (collect_rlss part (KEStore_Elems.get_rlss parent) thys) @ 

  [(*TODO: collect_cals, collect_ords*)]

(* collect theorems defined in Isabelle *)

fun collect_isab isa (thmDeriv, thm) =

  let val theID =

    [isa, ThyC.cut_id thmDeriv, "Theorems", ThmC.cut_id thmDeriv]

  in 

    (theID: Thy_Write.theID, Thy_Write.Hthm {guh = Thy_Write.theID2guh theID, 

      mathauthors = ["Isabelle team, TU Munich"],

      coursedesign = [],

      fillpats = [],

      thm = thm}) 

  end

fun show_thes () = (writeln o Pbl_Met_Hierarchy.format_pblIDl o (Store.scan [])) (get_thes ());

(** create an xml representation for thehier: hierarchy of entries + files per entry **)

(* create an xml-hierarchy where the filname is created from the guh; 

  ad DTD: a NODE contains an ID and zero or more NODEs*)

fun hierarchy_guh h =

  let

    val i = indentation

    val j = indentation

    fun node i p theID (Store.Node (id, _, ns)) = 

        let

          val p' = Pos.lev_on p

          val theID' = theID @ [id]

        in

        (indt i) ^ "<NODE>\n" ^ 

        (indt (i+j)) ^ "<ID> " ^ id ^ " </ID>\n" ^ 

        (indt (i+j)) ^ "<NO> " (*on this level*) ^ (string_of_int o last_elem) p' ^ " </NO>\n" ^ 

        (indt (i+j)) ^ "<CONTENTREF> " ^ Thy_Write.theID2guh theID' ^ " </CONTENTREF>\n" ^

        (nodes (i+j) (Pos.lev_dn p') theID' ns) ^ 

        (indt i) ^ "</NODE>\n"

        end

    and nodes _ _ _ [] = ""

      | nodes i p theID (n :: ns) = (node i p theID n) ^ (nodes i (Pos.lev_on p) theID ns);

  in nodes j [0] [] h end;

fun thy_hierarchy2file (path: Pbl_Met_Hierarchy.filepath) = 

  Pbl_Met_Hierarchy.str2file (path ^ "thy_hierarchy.xml") 

    ("<NODE>\n" ^

    "  <ID> theory hierarchy </ID>\n" ^

    "  <NO> 1 </NO>\n" ^

    "  <CONTENTREF> thy_ROOT </CONTENTREF>\n" ^

    (hierarchy_guh (get_thes ())) ^

    "</NODE>");

(* create the xml-files for the thydata in the hierarchy *)

val i = indentation;

(* analoguous to 'fun met2xml' *)

fun thydata2xml (theID: Thy_Write.theID, Thy_Write.Html {guh, coursedesign, mathauthors, html}) =

      "<HTMLDATA>\n" ^

      indt i ^ "<GUH> "^ guh ^" </GUH>\n" ^

      id2xml i theID ^

      indt i ^ "<EXPLANATIONS> " ^ html ^ "</EXPLANATIONS>\n" ^

      authors2xml i "MATHAUTHORS" mathauthors ^

      authors2xml i "COURSEDESIGNS" coursedesign ^

      "</HTMLDATA>\n" : xml

  | thydata2xml (theID, Thy_Write.Hthm {guh, coursedesign, mathauthors, fillpats(*TODO?*), thm}) =

      "<THEOREMDATA>\n" ^

      indt i ^ "<GUH> "^ guh ^" </GUH>\n" ^

      id2xml i theID ^

      thm''2xml i thm ^

      indt i ^ "<PROOF>\n" ^

      extref2xml (i+i) "Proof of the theorem" (* TODO "Unsorted"vvv: distinguish Isabelle | Isac *)

	      ("http://www.ist.tugraz.at/projects/isac/www/kbase/thy/browser_info/HOL/HOL-Real/Isac/" ^

	        nth 2 theID ^ ".html") ^

	    indt i ^  "</PROOF>\n" ^

	    indt i ^ "<EXPLANATIONS> </EXPLANATIONS>\n" ^

	    authors2xml i "MATHAUTHORS" mathauthors ^

	    authors2xml i "COURSEDESIGNS" coursedesign ^

	    "</THEOREMDATA>\n"

  | thydata2xml (theID, Thy_Write.Hrls {guh, coursedesign, mathauthors, thy_rls}) =

      "<RULESETDATA>\n" ^

      indt i ^ "<GUH> "^ guh ^" </GUH>\n" ^

      id2xml i theID ^

      rls2xml i thy_rls ^

      indt i ^ "<EXPLANATIONS> </EXPLANATIONS>\n" ^

      authors2xml i "MATHAUTHORS" mathauthors ^

    authors2xml i "COURSEDESIGNS" coursedesign ^

      "</RULESETDATA>\n"

  | thydata2xml (theID, Thy_Write.Hcal {guh, coursedesign, mathauthors, calc}) =

      "<RULESETDATA>\n" ^

      indt i ^ "<GUH> "^ guh ^" </GUH>\n" ^

      id2xml i theID ^

      calc2xml i (Thy_Write.theID2thyID theID, calc) ^

      indt i ^ "<EXPLANATIONS> </EXPLANATIONS>\n" ^

      authors2xml i "MATHAUTHORS" mathauthors ^

      authors2xml i "COURSEDESIGNS" coursedesign ^

      "</RULESETDATA>\n"

  | thydata2xml (theID, _) =

      raise ERROR ("thydata2xml: not implemented for "^ strs2str' theID);

(* analoguous to 'fun met2file' *)

fun thydata2file (path : Pbl_Met_Hierarchy.filepath) (pos : Pos.pos) (theID : Thy_Write.theID) thydata =

  (writeln ("### thes2file: id = " ^ strs2str theID);

    Pbl_Met_Hierarchy.str2file (path ^ Thy_Present.theID2filename theID) (thydata2xml (theID, thydata)));

(* analoguous to 'fun node' *)

fun thenode (pa : Pbl_Met_Hierarchy.filepath) ids po wfn (Store.Node (id, [n], ns)) = 

    let val po' = Pos.lev_on po

    in wfn pa po' (ids @ [id]) n; thenodes pa (ids @ [id]) (Pos.lev_dn po') wfn ns end

and thenodes _ _ _ _ [] = ()

  | thenodes pa ids po wfn (n::ns) =

      (thenode pa ids po wfn n; thenodes pa ids (Pos.lev_on po) wfn ns);

(* analoguous to 'fun mets2file' *)

fun thes2file (p : Pbl_Met_Hierarchy.filepath) = thenodes p [] [0] thydata2file (get_thes ());

(***.store a single theory element in the hierarchy.***)

(*.for mathauthors only, other html is added to xml exported from here.*)

fun make_isa thy (part, thypart) (mathauthors : Thy_Write.authors) =

  let 

    val theID = [part, Context.theory_name thy, thypart]

    val guh = case theID of

        [part] => Thy_Write.part2guh theID

      | [part, thyID, thypart] => Thy_Write.thypart2guh theID

    val theID = Thy_Present.guh2theID guh

    val the = Thy_Write.Html {guh = guh, coursedesign = [], mathauthors = mathauthors, html = ""}

  in (the, theID) end

fun make_thy thy (mathauthors : Thy_Write.authors) =

  let 

    val guh = Thy_Write.thy2guh ["IsacKnowledge", Context.theory_name thy]

    val theID = Thy_Present.guh2theID guh

    val the = Thy_Write.Html {guh = guh, coursedesign = [], mathauthors = mathauthors, html = ""}

  in (the, theID) end

fun make_thm thy part (thmID : ThmC.id, thm) (mathauthors : Thy_Write.authors) =

  let

    val guh = Thy_Write.thm2guh (part, Context.theory_name thy) thmID

    val theID = Thy_Present.guh2theID guh

    val the = Thy_Write.Hthm {guh = guh, coursedesign = [(*inserted in xml after export*)], 

			mathauthors = mathauthors, fillpats = [], thm = thm}

  in (the, theID) end

fun make_rls thy rls (mathauthors : Thy_Write.authors) =

  let 

    val guh = Thy_Write.rls2guh ("IsacKnowledge", Context.theory_name thy) ((#id o Rule_Set.rep) rls)

    val theID = Thy_Present.guh2theID guh

    val the = Thy_Write.Hrls {guh = guh, coursedesign = [], mathauthors = mathauthors,

			thy_rls = (Context.theory_name thy, rls)}

	  (*needs no (!check_guhs_unique) because guh is generated automatically*)

  in (the, theID) end

fun make_cal thy cal (mathauthors : Thy_Write.authors) =

  let

    val guh = Thy_Write.cal2guh ("IsacKnowledge", Context.theory_name thy) ("TODO store_cal")

    val theID = Thy_Present.guh2theID guh

    val the = Thy_Write.Hcal {guh = guh, coursedesign = [], mathauthors = mathauthors, calc = cal}

  in (the, theID) end

fun make_ord thy ord (mathauthors : Thy_Write.authors) =

  let 

    val guh = Thy_Write.ord2guh ("IsacKnowledge", Context.theory_name thy) ("TODO store_ord")

    val theID = Thy_Present.guh2theID guh

    val the = Thy_Write.Hord {guh = guh, coursedesign = [], mathauthors = mathauthors, ord = ord}

  in (the, theID) end

(* for dialog-authoring *)

fun update_hrls (Thy_Write.Hrls {guh, coursedesign, mathauthors, thy_rls = (thyID, rls)}) errpatIDs =

    let

      val rls' = 

        case rls of

          Rule_Def.Repeat {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...}

          => Rule_Def.Repeat {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,

               calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}

        | Rule_Set.Sequence {id, preconds, rew_ord, erls, srls, calc, rules, scr, ...}

          => Rule_Set.Sequence {id = id, preconds = preconds, rew_ord = rew_ord, erls = erls, srls = srls,

               calc = calc, rules = rules, scr = scr, errpatts = errpatIDs}

        | Rule_Set.Rrls {id, prepat, rew_ord, erls, calc, scr, ...}

          => Rule_Set.Rrls {id = id, prepat = prepat, rew_ord = rew_ord, erls = erls, calc = calc,

               scr = scr, errpatts = errpatIDs}

        | Erls => Erls

    in

      Thy_Write.Hrls {guh = guh, coursedesign = coursedesign, mathauthors = mathauthors,

        thy_rls = (thyID, rls')}

    end

  | update_hrls _ _ = raise ERROR "update_hrls: wrong arguments";

fun insert_errpatIDs thy theID errpatIDs = (* TODO: redo like insert_fillpatts *)

  let

    val hrls = Thy_Read.from_store theID

    val hrls' = update_hrls hrls errpatIDs

      handle ERROR _ => raise ERROR ("insert_errpatIDs: " ^ strs2str theID ^ "must address a rule-set")

  in (hrls', theID) end

(**)end(**)

open Thy_Hierarchy