src/Pure/Thy/thy_info.ML
author wenzelm
Thu Aug 19 16:33:36 1999 +0200 (1999-08-19)
changeset 7288 21ff5bb68a5c
parent 7267 96f71fb54efb
child 7589 59663b367833
permissions -rw-r--r--
lookup_theory;
berghofe@3604
     1
(*  Title:      Pure/Thy/thy_info.ML
berghofe@3604
     2
    ID:         $Id$
wenzelm@6211
     3
    Author:     Markus Wenzel, TU Muenchen
berghofe@3604
     4
wenzelm@6362
     5
Theory loader database, including theory and file dependencies.
wenzelm@3976
     6
*)
berghofe@3604
     7
wenzelm@5209
     8
signature BASIC_THY_INFO =
wenzelm@5209
     9
sig
wenzelm@5209
    10
  val theory: string -> theory
wenzelm@6211
    11
  val theory_of_sign: Sign.sg -> theory
wenzelm@6211
    12
  val theory_of_thm: thm -> theory
wenzelm@6241
    13
(*val use: string -> unit*)             (*exported later*)
wenzelm@6241
    14
  val time_use: string -> unit
wenzelm@6211
    15
  val touch_thy: string -> unit
wenzelm@6211
    16
  val use_thy: string -> unit
wenzelm@6211
    17
  val update_thy: string -> unit
wenzelm@6666
    18
  val remove_thy: string -> unit
wenzelm@6211
    19
  val time_use_thy: string -> unit
wenzelm@6527
    20
  val use_thy_only: string -> unit
wenzelm@7099
    21
  val update_thy_only: string -> unit
wenzelm@6211
    22
end;
wenzelm@5209
    23
berghofe@3604
    24
signature THY_INFO =
berghofe@3604
    25
sig
wenzelm@5209
    26
  include BASIC_THY_INFO
wenzelm@7099
    27
  datatype action = Update | Outdate | Remove
wenzelm@7099
    28
  val str_of_action: action -> string
wenzelm@7099
    29
  val add_hook: (action -> string -> unit) -> unit
wenzelm@6211
    30
  val names: unit -> string list
wenzelm@7288
    31
  val lookup_theory: string -> theory option
wenzelm@6211
    32
  val get_theory: string -> theory
berghofe@6654
    33
  val get_preds: string -> string list
wenzelm@7267
    34
  val loaded_files: string -> ((Path.T * File.info) * bool) list
wenzelm@7099
    35
  val touch_all_thys: unit -> unit
wenzelm@7244
    36
  val may_load_file: bool -> bool -> Path.T -> unit
wenzelm@6329
    37
  val use_path: Path.T -> unit
wenzelm@6241
    38
  val use: string -> unit
wenzelm@7191
    39
  val pretend_use: string -> unit
wenzelm@7244
    40
  val quiet_update_thy: string -> unit
wenzelm@6329
    41
  val begin_theory: string -> string list -> (Path.T * bool) list -> theory
wenzelm@7244
    42
  val begin_update_theory: string -> string list -> (Path.T * bool) list -> theory
wenzelm@6211
    43
  val end_theory: theory -> theory
wenzelm@6666
    44
  val finish: unit -> unit
wenzelm@6211
    45
  val register_theory: theory -> unit
berghofe@3604
    46
end;
berghofe@3604
    47
wenzelm@6362
    48
structure ThyInfo: THY_INFO =
wenzelm@6211
    49
struct
berghofe@3604
    50
berghofe@3604
    51
wenzelm@7099
    52
(** theory loader actions and hooks **)
wenzelm@7099
    53
wenzelm@7099
    54
datatype action = Update | Outdate | Remove;
wenzelm@7099
    55
val str_of_action = fn Update => "Update" | Outdate => "Outdate" | Remove => "Remove";
wenzelm@7099
    56
wenzelm@7099
    57
local
wenzelm@7099
    58
  val hooks = ref ([]: (action -> string -> unit) list);
wenzelm@7099
    59
in
wenzelm@7099
    60
  fun add_hook f = hooks := f :: ! hooks;
wenzelm@7191
    61
  fun perform action name = seq (fn f => (try (fn () => f action name) (); ())) (! hooks);
wenzelm@7099
    62
end;
wenzelm@7099
    63
wenzelm@7099
    64
wenzelm@7099
    65
wenzelm@6211
    66
(** thy database **)
wenzelm@6211
    67
wenzelm@6211
    68
(* messages *)
wenzelm@6211
    69
wenzelm@6211
    70
fun gen_msg txt [] = txt
wenzelm@6211
    71
  | gen_msg txt names = txt ^ " " ^ commas_quote names;
wenzelm@6211
    72
wenzelm@6211
    73
fun loader_msg txt names = gen_msg ("Theory loader: " ^ txt) names;
wenzelm@6211
    74
wenzelm@6211
    75
val show_path = space_implode " via " o map quote;
wenzelm@6211
    76
fun cycle_msg name names = loader_msg ("cyclic dependency of " ^ show_path (name :: names)) [];
berghofe@3604
    77
berghofe@3604
    78
wenzelm@6666
    79
(* derived graph operations *)
berghofe@3604
    80
wenzelm@6211
    81
fun add_deps name parents G =
wenzelm@6211
    82
  foldl (fn (H, parent) => Graph.add_edge_acyclic (parent, name) H) (G, parents)
wenzelm@6211
    83
    handle Graph.CYCLES namess => error (cat_lines (map (cycle_msg name) namess));
berghofe@3604
    84
wenzelm@6666
    85
fun del_deps name G =
wenzelm@6211
    86
  foldl (fn (H, parent) => Graph.del_edge (parent, name) H) (G, Graph.imm_preds G name);
wenzelm@3976
    87
wenzelm@6211
    88
fun update_node name parents entry G =
wenzelm@6211
    89
  add_deps name parents
wenzelm@6211
    90
    (if can (Graph.get_node G) name then del_deps name G else Graph.new_node (name, entry) G);
berghofe@3604
    91
berghofe@3604
    92
wenzelm@6211
    93
(* thy database *)
wenzelm@6211
    94
wenzelm@6211
    95
type deps =
wenzelm@6211
    96
  {present: bool, outdated: bool,
wenzelm@7267
    97
    master: ThyLoad.master option, files: (Path.T * ((Path.T * File.info) * bool) option) list};
wenzelm@6211
    98
wenzelm@6241
    99
fun make_deps present outdated master files =
wenzelm@6241
   100
  {present = present, outdated = outdated, master = master, files = files}: deps;
berghofe@3604
   101
wenzelm@7211
   102
fun init_deps master files = Some (make_deps false true master (map (rpair None) files));
wenzelm@7211
   103
wenzelm@7211
   104
wenzelm@6362
   105
type thy = deps option * theory option;
berghofe@3604
   106
wenzelm@6211
   107
local
wenzelm@6362
   108
  val database = ref (Graph.empty: thy Graph.T);
wenzelm@6211
   109
in
wenzelm@6362
   110
  fun get_thys () = ! database;
wenzelm@6362
   111
  fun change_thys f = database := (f (! database));
berghofe@3604
   112
end;
wenzelm@5209
   113
wenzelm@5209
   114
wenzelm@6211
   115
(* access thy graph *)
wenzelm@6211
   116
wenzelm@6211
   117
fun thy_graph f x = f (get_thys ()) x;
wenzelm@6666
   118
fun get_names () = Graph.keys (get_thys ());
wenzelm@6211
   119
wenzelm@6211
   120
wenzelm@6211
   121
(* access thy *)
wenzelm@6211
   122
wenzelm@6211
   123
fun lookup_thy name = Some (thy_graph Graph.get_node name) handle Graph.UNDEFINED _ => None;
wenzelm@6211
   124
wenzelm@6211
   125
fun get_thy name =
wenzelm@6211
   126
  (case lookup_thy name of
wenzelm@6211
   127
    Some thy => thy
wenzelm@6211
   128
  | None => error (loader_msg "nothing known about theory" [name]));
wenzelm@6211
   129
wenzelm@6211
   130
fun change_thy name f = (get_thy name; change_thys (Graph.map_node name f));
wenzelm@6211
   131
wenzelm@6211
   132
wenzelm@6211
   133
(* access deps *)
wenzelm@6211
   134
wenzelm@6211
   135
val lookup_deps = apsome #1 o lookup_thy;
wenzelm@6211
   136
val get_deps = #1 o get_thy;
wenzelm@6211
   137
fun change_deps name f = change_thy name (fn (deps, x) => (f deps, x));
wenzelm@6211
   138
wenzelm@6666
   139
fun is_finished name = is_none (get_deps name);
wenzelm@6211
   140
fun get_files name = (case get_deps name of Some {files, ...} => files | _ => []);
wenzelm@7191
   141
wenzelm@7191
   142
fun loaded_files name =
wenzelm@7191
   143
  (case get_deps name of
wenzelm@7267
   144
    Some {master = Some master, files, ...} => (ThyLoad.get_thy master, true) :: mapfilter #2 files
wenzelm@7191
   145
  | Some {files, ...} => mapfilter #2 files
wenzelm@7191
   146
  | None => []);
wenzelm@6211
   147
berghofe@6654
   148
fun get_preds name =
berghofe@6654
   149
  (thy_graph Graph.imm_preds name) handle Graph.UNDEFINED _ =>
berghofe@6654
   150
    error (loader_msg "nothing known about theory" [name]);
berghofe@6654
   151
wenzelm@6211
   152
wenzelm@6211
   153
(* access theory *)
wenzelm@6211
   154
wenzelm@7288
   155
fun lookup_theory name = #2 (get_thy name);
wenzelm@7288
   156
wenzelm@6211
   157
fun get_theory name =
wenzelm@7288
   158
  (case lookup_theory name of
wenzelm@7288
   159
    (Some theory) => theory
wenzelm@6211
   160
  | _ => error (loader_msg "undefined theory entry for" [name]));
wenzelm@6211
   161
wenzelm@6211
   162
val theory_of_sign = get_theory o Sign.name_of;
wenzelm@6211
   163
val theory_of_thm = theory_of_sign o Thm.sign_of_thm;
wenzelm@6211
   164
wenzelm@7099
   165
fun put_theory name theory = change_thy name (fn (deps, _) => (deps, Some theory));
wenzelm@6211
   166
wenzelm@6211
   167
wenzelm@6211
   168
wenzelm@6211
   169
(** thy operations **)
wenzelm@6211
   170
wenzelm@6241
   171
(* maintain 'outdated' flag *)
wenzelm@6211
   172
wenzelm@7099
   173
local
wenzelm@7099
   174
wenzelm@6241
   175
fun is_outdated name =
wenzelm@6241
   176
  (case lookup_deps name of
wenzelm@6241
   177
    Some (Some {outdated, ...}) => outdated
wenzelm@6241
   178
  | _ => false);
wenzelm@6211
   179
wenzelm@6241
   180
fun outdate_thy name =
wenzelm@7099
   181
  if is_finished name orelse is_outdated name then ()
wenzelm@7099
   182
  else (change_deps name (apsome (fn {present, outdated = _, master, files} =>
wenzelm@7099
   183
    make_deps present true master files)); perform Outdate name);
wenzelm@7099
   184
wenzelm@7099
   185
in
wenzelm@6211
   186
wenzelm@6241
   187
fun touch_thy name =
wenzelm@7099
   188
  if is_finished name then warning (loader_msg "tried to touch finished theory" [name])
wenzelm@7099
   189
  else seq outdate_thy (thy_graph Graph.all_succs [name]);
wenzelm@6211
   190
wenzelm@7099
   191
fun touch_all_thys () = seq outdate_thy (get_names ());
wenzelm@6211
   192
wenzelm@7099
   193
end;
wenzelm@6211
   194
wenzelm@6211
   195
wenzelm@7244
   196
(* check 'finished' state *)
wenzelm@7244
   197
wenzelm@7244
   198
fun check_unfinished fail name =
wenzelm@7244
   199
  if is_some (lookup_thy name) andalso is_finished name then
wenzelm@7288
   200
    fail (loader_msg "cannot update finished theory" [name])
wenzelm@7244
   201
  else ();
wenzelm@7244
   202
wenzelm@7244
   203
wenzelm@7244
   204
(* may_load_file *)
wenzelm@6211
   205
wenzelm@7191
   206
local
wenzelm@7191
   207
wenzelm@7191
   208
fun may_run_file really path =
wenzelm@6211
   209
  let
wenzelm@7191
   210
    val load = ThyLoad.may_load_file really;
wenzelm@6211
   211
    fun provide name info (deps as Some {present, outdated, master, files}) =
wenzelm@6263
   212
          if exists (equal path o #1) files then
wenzelm@7267
   213
            Some (make_deps present outdated master
wenzelm@7267
   214
              (overwrite (files, (path, Some (info, really)))))
wenzelm@6241
   215
          else (warning (loader_msg "undeclared dependency of theory" [name] ^
wenzelm@6389
   216
            " on file: " ^ quote (Path.pack path)); deps)
wenzelm@6211
   217
      | provide _ _ None = None;
wenzelm@6211
   218
  in
wenzelm@6211
   219
    (case apsome PureThy.get_name (Context.get_context ()) of
wenzelm@7191
   220
      None => (load path; ())
wenzelm@6211
   221
    | Some name =>
wenzelm@7191
   222
        if is_some (lookup_thy name) then change_deps name (provide name (load path))
wenzelm@7191
   223
        else (load path; ()))
wenzelm@6211
   224
  end;
wenzelm@6211
   225
wenzelm@7191
   226
in
wenzelm@7191
   227
wenzelm@7244
   228
fun may_load_file really time path =
wenzelm@7244
   229
  if really andalso time then
wenzelm@7244
   230
    let val name = Path.pack path in
wenzelm@7244
   231
      timeit (fn () =>
wenzelm@7244
   232
       (writeln ("\n**** Starting file " ^ quote name ^ " ****");
wenzelm@7244
   233
        may_run_file really path;
wenzelm@7244
   234
        writeln ("**** Finished file " ^ quote name ^ " ****\n")))
wenzelm@7244
   235
    end
wenzelm@7244
   236
  else may_run_file really path;
wenzelm@7191
   237
wenzelm@7191
   238
end;
wenzelm@6233
   239
wenzelm@7244
   240
val use_path    = may_load_file true false;
wenzelm@7244
   241
val use         = use_path o Path.unpack;
wenzelm@7244
   242
val time_use    = may_load_file true true o Path.unpack;
wenzelm@7244
   243
val pretend_use = may_load_file false false o Path.unpack;
wenzelm@7244
   244
wenzelm@6233
   245
wenzelm@7099
   246
(* load_thy *)
wenzelm@7099
   247
wenzelm@7099
   248
fun required_by [] = ""
wenzelm@7099
   249
  | required_by initiators = " (required by " ^ show_path (rev initiators) ^ ")";
wenzelm@7099
   250
wenzelm@7099
   251
fun load_thy ml time initiators dir name parents =
wenzelm@7099
   252
  let
wenzelm@7099
   253
    val _ = if name mem_string initiators then error (cycle_msg name (rev initiators)) else ();
wenzelm@7099
   254
    val _ = writeln ("Loading theory " ^ quote name ^ required_by initiators);
wenzelm@7099
   255
wenzelm@7099
   256
    val _ = touch_thy name;
wenzelm@7099
   257
    val master = ThyLoad.load_thy dir name ml time;
wenzelm@7099
   258
wenzelm@7099
   259
    val files = get_files name;
wenzelm@7099
   260
    val missing_files = mapfilter (fn (path, None) => Some (Path.pack path) | _ => None) files;
wenzelm@7099
   261
  in
wenzelm@7099
   262
    if null missing_files then ()
wenzelm@7099
   263
    else warning (loader_msg "unresolved dependencies of theory" [name] ^
wenzelm@7223
   264
      " on file(s): " ^ commas_quote missing_files);
wenzelm@7191
   265
    change_deps name (fn _ => Some (make_deps true false (Some master) files));
wenzelm@7099
   266
    perform Update name
wenzelm@7099
   267
  end;
wenzelm@7099
   268
wenzelm@7099
   269
wenzelm@6211
   270
(* require_thy *)
wenzelm@6211
   271
wenzelm@7211
   272
local
wenzelm@6211
   273
wenzelm@7191
   274
fun load_deps dir name =
wenzelm@7191
   275
  let val (master, (parents, files)) = ThyLoad.deps_thy dir name
wenzelm@7191
   276
  in (Some (init_deps (Some master) files), parents) end;
wenzelm@6211
   277
wenzelm@6211
   278
fun file_current (_, None) = false
wenzelm@7267
   279
  | file_current (path, info) = (apsome fst info = ThyLoad.check_file path);
wenzelm@6211
   280
wenzelm@7191
   281
fun current_deps strict dir name =
wenzelm@6211
   282
  (case lookup_deps name of
wenzelm@7191
   283
    None => (false, load_deps dir name)
wenzelm@6211
   284
  | Some deps =>
wenzelm@6211
   285
      let val same_deps = (None, thy_graph Graph.imm_preds name) in
wenzelm@6211
   286
        (case deps of
wenzelm@6211
   287
          None => (true, same_deps)
wenzelm@6211
   288
        | Some {present, outdated, master, files} =>
wenzelm@6211
   289
            if present andalso not strict then (true, same_deps)
wenzelm@6211
   290
            else
wenzelm@7191
   291
              let val master' = Some (ThyLoad.check_thy dir name) in
wenzelm@7191
   292
                if master <> master' then (false, load_deps dir name)
wenzelm@6211
   293
                else (not outdated andalso forall file_current files, same_deps)
wenzelm@6211
   294
              end)
wenzelm@6211
   295
      end);
wenzelm@6211
   296
wenzelm@7066
   297
fun require_thy ml time strict keep_strict initiators prfx (visited, str) =
wenzelm@6211
   298
  let
wenzelm@7066
   299
    val path = Path.expand (Path.unpack str);
wenzelm@6484
   300
    val name = Path.pack (Path.base path);
wenzelm@7066
   301
  in
wenzelm@7066
   302
    if name mem_string visited then (visited, (true, name))
wenzelm@7066
   303
    else
wenzelm@7066
   304
      let
wenzelm@7066
   305
        val dir = Path.append prfx (Path.dir path);
wenzelm@7066
   306
        val req_parent =
wenzelm@7211
   307
          require_thy true time (strict andalso keep_strict) keep_strict (name :: initiators) dir;
wenzelm@6484
   308
wenzelm@7191
   309
        val (current, (new_deps, parents)) = current_deps strict dir name handle ERROR =>
wenzelm@7099
   310
          error (loader_msg "the error(s) above occurred while examining theory" [name] ^
wenzelm@7066
   311
            (if null initiators then "" else "\n" ^ required_by initiators));
wenzelm@7066
   312
        val (visited', parent_results) = foldl_map req_parent (name :: visited, parents);
wenzelm@6211
   313
wenzelm@7066
   314
        val result =
wenzelm@7066
   315
          if current andalso forall #1 parent_results then true
wenzelm@7066
   316
          else
wenzelm@7066
   317
            ((case new_deps of
wenzelm@7099
   318
              Some deps => change_thys (update_node name parents (deps, None))
wenzelm@7066
   319
            | None => ());
wenzelm@7099
   320
             load_thy ml time initiators dir name parents;
wenzelm@7099
   321
             false);
wenzelm@7066
   322
      in (visited', (result, name)) end
wenzelm@7066
   323
  end;
wenzelm@6484
   324
wenzelm@7066
   325
fun gen_use_thy req s =
wenzelm@7066
   326
  let val (_, (_, name)) = req [] Path.current ([], s)
wenzelm@7066
   327
  in Context.context (get_theory name) end;
wenzelm@6241
   328
wenzelm@7244
   329
fun warn_finished f name = (check_unfinished warning name; f name);
wenzelm@7244
   330
wenzelm@7211
   331
in
wenzelm@7211
   332
wenzelm@7244
   333
val weak_use_thy     = gen_use_thy (require_thy true false false false);
wenzelm@7244
   334
val quiet_update_thy = gen_use_thy (require_thy true false true true);
wenzelm@7244
   335
wenzelm@7244
   336
val use_thy          = warn_finished (gen_use_thy (require_thy true false true false));
wenzelm@7244
   337
val time_use_thy     = warn_finished (gen_use_thy (require_thy true true true false));
wenzelm@7244
   338
val use_thy_only     = warn_finished (gen_use_thy (require_thy false false true false));
wenzelm@7244
   339
val update_thy       = warn_finished (gen_use_thy (require_thy true false true true));
wenzelm@7244
   340
val update_thy_only  = warn_finished (gen_use_thy (require_thy false false true true));
wenzelm@6211
   341
wenzelm@7211
   342
end;
wenzelm@7211
   343
wenzelm@6211
   344
wenzelm@6666
   345
(* remove_thy *)
wenzelm@6666
   346
wenzelm@6666
   347
fun remove_thy name =
wenzelm@6666
   348
  if is_finished name then error (loader_msg "cannot remove finished theory" [name])
wenzelm@6666
   349
  else
wenzelm@6666
   350
    let val succs = thy_graph Graph.all_succs [name] in
wenzelm@6666
   351
      writeln (loader_msg "removing" succs);
wenzelm@7191
   352
      seq (perform Remove) succs;
wenzelm@7191
   353
      change_thys (Graph.del_nodes succs)
wenzelm@6666
   354
    end;
wenzelm@6666
   355
wenzelm@6666
   356
wenzelm@7066
   357
(* begin / end theory *)
wenzelm@6211
   358
wenzelm@7244
   359
fun gen_begin_theory check_thy name parents paths =
wenzelm@6211
   360
  let
wenzelm@7244
   361
    val _ = check_unfinished error name;
wenzelm@7244
   362
    val _ = (map Path.basic parents; seq check_thy parents);
wenzelm@6211
   363
    val theory = PureThy.begin_theory name (map get_theory parents);
wenzelm@7191
   364
    val _ = change_thys (update_node name parents (init_deps None [], Some theory));
wenzelm@6329
   365
    val use_paths = mapfilter (fn (x, true) => Some x | _ => None) paths;
wenzelm@6329
   366
  in Context.setmp (Some theory) (seq use_path) use_paths; theory end;
wenzelm@6211
   367
wenzelm@7244
   368
val begin_theory = gen_begin_theory weak_use_thy;
wenzelm@7244
   369
val begin_update_theory = gen_begin_theory quiet_update_thy;
wenzelm@7244
   370
wenzelm@6211
   371
fun end_theory theory =
wenzelm@7099
   372
  let
wenzelm@7099
   373
    val theory' = PureThy.end_theory theory;
wenzelm@7099
   374
    val name = PureThy.get_name theory;
wenzelm@7099
   375
  in put_theory name theory'; theory' end;
wenzelm@6211
   376
wenzelm@6211
   377
wenzelm@6666
   378
(* finish all theories *)
wenzelm@6211
   379
wenzelm@6666
   380
fun finish () = change_thys (Graph.map_nodes (fn (_, entry) => (None, entry)));
wenzelm@6211
   381
wenzelm@6211
   382
wenzelm@6211
   383
(* register existing theories *)
wenzelm@6211
   384
wenzelm@6211
   385
fun register_theory theory =
wenzelm@6211
   386
  let
wenzelm@6211
   387
    val name = PureThy.get_name theory;
wenzelm@6211
   388
    val parents = Theory.parents_of theory;
wenzelm@6211
   389
    val parent_names = map PureThy.get_name parents;
wenzelm@6211
   390
wenzelm@6211
   391
    fun err txt bads =
wenzelm@6211
   392
      error (loader_msg txt bads ^ "\n" ^ gen_msg "cannot register theory" [name]);
wenzelm@6211
   393
wenzelm@6666
   394
    val nonfinished = filter_out is_finished parent_names;
wenzelm@6211
   395
    fun get_variant (x, y_name) =
wenzelm@6211
   396
      if Theory.eq_thy (x, get_theory y_name) then None
wenzelm@6211
   397
      else Some y_name;
wenzelm@6211
   398
    val variants = mapfilter get_variant (parents ~~ parent_names);
wenzelm@6211
   399
wenzelm@6211
   400
    fun register G =
wenzelm@6362
   401
      (Graph.new_node (name, (None, Some theory)) G
wenzelm@6211
   402
        handle Graph.DUPLICATE _ => err "duplicate theory entry" [])
wenzelm@6211
   403
      |> add_deps name parent_names;
wenzelm@6211
   404
  in
wenzelm@6666
   405
    if not (null nonfinished) then err "non-finished parent theories" nonfinished
wenzelm@6211
   406
    else if not (null variants) then err "different versions of parent theories" variants
wenzelm@7099
   407
    else (change_thys register; perform Update name)
wenzelm@6211
   408
  end;
wenzelm@6211
   409
wenzelm@6211
   410
wenzelm@6211
   411
(*final declarations of this structure*)
wenzelm@6211
   412
val theory = get_theory;
wenzelm@6211
   413
val names = get_names;
wenzelm@6211
   414
wenzelm@6211
   415
end;
wenzelm@6211
   416
wenzelm@5209
   417
structure BasicThyInfo: BASIC_THY_INFO = ThyInfo;
wenzelm@5209
   418
open BasicThyInfo;