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