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