src/Pure/Thy/thy_info.ML
author berghofe
Mon Jul 19 18:21:26 2004 +0200 (2004-07-19)
changeset 15065 9feac0b7f935
parent 14981 e73f8140af78
child 15158 2281784015a5
permissions -rw-r--r--
Some changes to allow qualified theory import.
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@7935
    32
  val check_known_thy: string -> bool
wenzelm@7935
    33
  val if_known_thy: (string -> unit) -> string -> unit
wenzelm@7288
    34
  val lookup_theory: string -> theory option
wenzelm@6211
    35
  val get_theory: string -> theory
berghofe@6654
    36
  val get_preds: string -> string list
wenzelm@7935
    37
  val loaded_files: string -> Path.T list
wenzelm@7910
    38
  val touch_child_thys: string -> unit
wenzelm@7099
    39
  val touch_all_thys: unit -> unit
wenzelm@7941
    40
  val load_file: bool -> Path.T -> unit
wenzelm@6241
    41
  val use: string -> unit
wenzelm@7952
    42
  val quiet_update_thy: bool -> string -> unit
wenzelm@9822
    43
  val pretend_use_thy_only: 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@9417
   122
wenzelm@9417
   123
(*theory names in topological order*)
wenzelm@9417
   124
fun get_names () =
wenzelm@9417
   125
  let val G = get_thys ()
wenzelm@14774
   126
  in Graph.all_succs G (Graph.minimals G) end;
wenzelm@6211
   127
wenzelm@6211
   128
wenzelm@6211
   129
(* access thy *)
wenzelm@6211
   130
wenzelm@7935
   131
fun lookup_thy name =
wenzelm@9327
   132
  Some (thy_graph Graph.get_node name) handle Graph.UNDEF _ => None;
wenzelm@7935
   133
wenzelm@7910
   134
val known_thy = is_some o lookup_thy;
wenzelm@7935
   135
fun check_known_thy name = known_thy name orelse (warning ("Unknown theory " ^ quote name); false);
wenzelm@7935
   136
fun if_known_thy f name = if check_known_thy name then f name else ();
wenzelm@6211
   137
wenzelm@6211
   138
fun get_thy name =
wenzelm@6211
   139
  (case lookup_thy name of
wenzelm@6211
   140
    Some thy => thy
wenzelm@6211
   141
  | None => error (loader_msg "nothing known about theory" [name]));
wenzelm@6211
   142
wenzelm@6211
   143
fun change_thy name f = (get_thy name; change_thys (Graph.map_node name f));
wenzelm@6211
   144
wenzelm@6211
   145
wenzelm@6211
   146
(* access deps *)
wenzelm@6211
   147
wenzelm@6211
   148
val lookup_deps = apsome #1 o lookup_thy;
wenzelm@6211
   149
val get_deps = #1 o get_thy;
wenzelm@6211
   150
fun change_deps name f = change_thy name (fn (deps, x) => (f deps, x));
wenzelm@6211
   151
wenzelm@6666
   152
fun is_finished name = is_none (get_deps name);
wenzelm@6211
   153
fun get_files name = (case get_deps name of Some {files, ...} => files | _ => []);
wenzelm@7191
   154
wenzelm@7191
   155
fun loaded_files name =
wenzelm@7191
   156
  (case get_deps name of
wenzelm@7935
   157
    None => []
wenzelm@7910
   158
  | Some {master, files, ...} =>
wenzelm@7935
   159
      (case master of Some m => [#1 (ThyLoad.get_thy m)] | None => []) @
wenzelm@7941
   160
      (mapfilter (apsome #1 o #2) files));
wenzelm@6211
   161
berghofe@6654
   162
fun get_preds name =
wenzelm@9327
   163
  (thy_graph Graph.imm_preds name) handle Graph.UNDEF _ =>
berghofe@6654
   164
    error (loader_msg "nothing known about theory" [name]);
berghofe@6654
   165
wenzelm@6211
   166
wenzelm@6211
   167
(* access theory *)
wenzelm@6211
   168
wenzelm@7687
   169
fun lookup_theory name =
wenzelm@7687
   170
  (case lookup_thy name of
wenzelm@7687
   171
    Some (_, Some thy) => Some thy
wenzelm@7687
   172
  | _ => None);
wenzelm@7288
   173
wenzelm@6211
   174
fun get_theory name =
wenzelm@7288
   175
  (case lookup_theory name of
wenzelm@7288
   176
    (Some theory) => theory
wenzelm@6211
   177
  | _ => error (loader_msg "undefined theory entry for" [name]));
wenzelm@6211
   178
wenzelm@6211
   179
val theory_of_sign = get_theory o Sign.name_of;
wenzelm@6211
   180
val theory_of_thm = theory_of_sign o Thm.sign_of_thm;
wenzelm@6211
   181
wenzelm@7099
   182
fun put_theory name theory = change_thy name (fn (deps, _) => (deps, Some theory));
wenzelm@6211
   183
wenzelm@6211
   184
wenzelm@6211
   185
wenzelm@6211
   186
(** thy operations **)
wenzelm@6211
   187
wenzelm@6241
   188
(* maintain 'outdated' flag *)
wenzelm@6211
   189
wenzelm@7099
   190
local
wenzelm@7099
   191
wenzelm@6241
   192
fun is_outdated name =
wenzelm@6241
   193
  (case lookup_deps name of
wenzelm@6241
   194
    Some (Some {outdated, ...}) => outdated
wenzelm@6241
   195
  | _ => false);
wenzelm@6211
   196
wenzelm@6241
   197
fun outdate_thy name =
wenzelm@7099
   198
  if is_finished name orelse is_outdated name then ()
wenzelm@7099
   199
  else (change_deps name (apsome (fn {present, outdated = _, master, files} =>
wenzelm@7099
   200
    make_deps present true master files)); perform Outdate name);
wenzelm@7099
   201
wenzelm@7910
   202
fun check_unfinished name =
wenzelm@7910
   203
  if is_finished name then (warning (loader_msg "tried to touch finished theory" [name]); None)
wenzelm@7910
   204
  else Some name;
wenzelm@7910
   205
wenzelm@7099
   206
in
wenzelm@6211
   207
wenzelm@7910
   208
fun touch_thys names =
wenzelm@7910
   209
  seq outdate_thy (thy_graph Graph.all_succs (mapfilter check_unfinished names));
wenzelm@7910
   210
wenzelm@7910
   211
fun touch_thy name = touch_thys [name];
wenzelm@7910
   212
fun touch_child_thys name = touch_thys (thy_graph Graph.imm_succs name);
wenzelm@6211
   213
wenzelm@7099
   214
fun touch_all_thys () = seq outdate_thy (get_names ());
wenzelm@6211
   215
wenzelm@7099
   216
end;
wenzelm@6211
   217
wenzelm@6211
   218
wenzelm@7244
   219
(* check 'finished' state *)
wenzelm@7244
   220
wenzelm@7244
   221
fun check_unfinished fail name =
wenzelm@7910
   222
  if known_thy name andalso is_finished name then
wenzelm@7288
   223
    fail (loader_msg "cannot update finished theory" [name])
wenzelm@7244
   224
  else ();
wenzelm@7244
   225
wenzelm@7244
   226
wenzelm@7941
   227
(* load_file *)
wenzelm@6211
   228
wenzelm@7191
   229
local
wenzelm@7191
   230
wenzelm@7941
   231
fun provide path name info (deps as Some {present, outdated, master, files}) =
wenzelm@7941
   232
     (if exists (equal path o #1) files then ()
wenzelm@7941
   233
      else warning (loader_msg "undeclared dependency of theory" [name] ^
wenzelm@7941
   234
        " on file: " ^ quote (Path.pack path));
wenzelm@7941
   235
      Some (make_deps present outdated master (overwrite (files, (path, Some info)))))
wenzelm@7941
   236
  | provide _ _ _ None = None;
wenzelm@7941
   237
wenzelm@7941
   238
fun run_file path =
wenzelm@7941
   239
  (case apsome PureThy.get_name (Context.get_context ()) of
wenzelm@7941
   240
    None => (ThyLoad.load_file path; ())
wenzelm@7941
   241
  | Some name =>
wenzelm@7941
   242
      if known_thy name then change_deps name (provide path name (ThyLoad.load_file path))
wenzelm@7941
   243
      else (ThyLoad.load_file path; ()));
wenzelm@6211
   244
wenzelm@7191
   245
in
wenzelm@7191
   246
wenzelm@7941
   247
fun load_file time path =
wenzelm@7941
   248
  if time then
wenzelm@7244
   249
    let val name = Path.pack path in
wenzelm@7244
   250
      timeit (fn () =>
wenzelm@9778
   251
       (priority ("\n**** Starting file " ^ quote name ^ " ****");
wenzelm@9036
   252
        run_file path;
wenzelm@9778
   253
        priority ("**** Finished file " ^ quote name ^ " ****\n")))
wenzelm@7244
   254
    end
wenzelm@7941
   255
  else run_file path;
wenzelm@7941
   256
wenzelm@7941
   257
val use = load_file false o Path.unpack;
wenzelm@7941
   258
val time_use = load_file true o Path.unpack;
wenzelm@7191
   259
wenzelm@7191
   260
end;
wenzelm@6233
   261
wenzelm@6233
   262
wenzelm@7099
   263
(* load_thy *)
wenzelm@7099
   264
wenzelm@9490
   265
fun required_by _ [] = ""
wenzelm@9490
   266
  | required_by s initiators = s ^ "(required by " ^ show_path (rev initiators) ^ ")";
wenzelm@7099
   267
berghofe@15065
   268
fun load_thy really ml time initiators dir name =
wenzelm@7099
   269
  let
wenzelm@9822
   270
    val _ =
wenzelm@9822
   271
      if really then priority ("Loading theory " ^ quote name ^ required_by " " initiators)
wenzelm@9822
   272
      else priority ("Registering theory " ^ quote name);
wenzelm@7099
   273
wenzelm@7099
   274
    val _ = touch_thy name;
wenzelm@9822
   275
    val master =
wenzelm@9822
   276
      if really then ThyLoad.load_thy dir name ml time
wenzelm@9822
   277
      else #1 (ThyLoad.deps_thy dir name ml);
wenzelm@7099
   278
wenzelm@7099
   279
    val files = get_files name;
wenzelm@7099
   280
    val missing_files = mapfilter (fn (path, None) => Some (Path.pack path) | _ => None) files;
wenzelm@7099
   281
  in
wenzelm@7099
   282
    if null missing_files then ()
wenzelm@7099
   283
    else warning (loader_msg "unresolved dependencies of theory" [name] ^
wenzelm@7223
   284
      " on file(s): " ^ commas_quote missing_files);
wenzelm@7191
   285
    change_deps name (fn _ => Some (make_deps true false (Some master) files));
wenzelm@7099
   286
    perform Update name
wenzelm@7099
   287
  end;
wenzelm@7099
   288
wenzelm@7099
   289
wenzelm@6211
   290
(* require_thy *)
wenzelm@6211
   291
berghofe@15065
   292
fun base_of_path s = Path.pack (Path.base (Path.unpack s));
berghofe@15065
   293
wenzelm@7211
   294
local
wenzelm@6211
   295
wenzelm@7941
   296
fun load_deps ml dir name =
wenzelm@7941
   297
  let val (master, (parents, files)) = ThyLoad.deps_thy dir name ml
wenzelm@7191
   298
  in (Some (init_deps (Some master) files), parents) end;
wenzelm@6211
   299
wenzelm@6211
   300
fun file_current (_, None) = false
wenzelm@7941
   301
  | file_current (path, info) = (info = ThyLoad.check_file path);
wenzelm@6211
   302
wenzelm@7941
   303
fun current_deps ml strict dir name =
wenzelm@6211
   304
  (case lookup_deps name of
wenzelm@7941
   305
    None => (false, load_deps ml dir name)
wenzelm@6211
   306
  | Some deps =>
wenzelm@6211
   307
      let val same_deps = (None, thy_graph Graph.imm_preds name) in
wenzelm@6211
   308
        (case deps of
wenzelm@6211
   309
          None => (true, same_deps)
wenzelm@6211
   310
        | Some {present, outdated, master, files} =>
wenzelm@6211
   311
            if present andalso not strict then (true, same_deps)
wenzelm@6211
   312
            else
wenzelm@7941
   313
              let val master' = Some (ThyLoad.check_thy dir name ml) in
wenzelm@7941
   314
                if master <> master' then (false, load_deps ml dir name)
wenzelm@6211
   315
                else (not outdated andalso forall file_current files, same_deps)
wenzelm@6211
   316
              end)
wenzelm@6211
   317
      end);
wenzelm@6211
   318
wenzelm@9822
   319
fun require_thy really ml time strict keep_strict initiators prfx (visited, str) =
wenzelm@6211
   320
  let
wenzelm@7066
   321
    val path = Path.expand (Path.unpack str);
wenzelm@6484
   322
    val name = Path.pack (Path.base path);
wenzelm@7066
   323
  in
wenzelm@9332
   324
    if name mem_string initiators then error (cycle_msg initiators) else ();
wenzelm@7952
   325
    if known_thy name andalso is_finished name orelse name mem_string visited then
wenzelm@7952
   326
      (visited, (true, name))
wenzelm@7066
   327
    else
wenzelm@7066
   328
      let
wenzelm@7066
   329
        val dir = Path.append prfx (Path.dir path);
wenzelm@9822
   330
        val req_parent = require_thy true true time (strict andalso keep_strict) keep_strict
berghofe@15065
   331
          (name :: initiators);
wenzelm@6484
   332
wenzelm@7941
   333
        val (current, (new_deps, parents)) = current_deps ml strict dir name handle ERROR =>
wenzelm@7099
   334
          error (loader_msg "the error(s) above occurred while examining theory" [name] ^
wenzelm@9490
   335
            (if null initiators then "" else required_by "\n" initiators));
berghofe@15065
   336
        val dir' = (case new_deps of
berghofe@15065
   337
            None => dir
berghofe@15065
   338
          | Some (Some {master = Some m, ...}) => Path.dir (fst (ThyLoad.get_thy m)));
berghofe@15065
   339
        val (visited', parent_results) = foldl_map (req_parent dir') (name :: visited, parents);
wenzelm@6211
   340
wenzelm@9822
   341
        val thy = if not really then Some (get_theory name) else None;
wenzelm@7066
   342
        val result =
wenzelm@7066
   343
          if current andalso forall #1 parent_results then true
wenzelm@7066
   344
          else
wenzelm@7066
   345
            ((case new_deps of
berghofe@15065
   346
              Some deps => change_thys (update_node name (map base_of_path parents) (deps, thy))
wenzelm@7066
   347
            | None => ());
berghofe@15065
   348
             load_thy really ml (time orelse ! Output.timing) initiators dir name;
wenzelm@7099
   349
             false);
wenzelm@7066
   350
      in (visited', (result, name)) end
wenzelm@7066
   351
  end;
wenzelm@6484
   352
wenzelm@7066
   353
fun gen_use_thy req s =
wenzelm@7066
   354
  let val (_, (_, name)) = req [] Path.current ([], s)
wenzelm@7066
   355
  in Context.context (get_theory name) end;
wenzelm@6241
   356
wenzelm@7244
   357
fun warn_finished f name = (check_unfinished warning name; f name);
wenzelm@7244
   358
wenzelm@7211
   359
in
wenzelm@7211
   360
wenzelm@9822
   361
val weak_use_thy        = gen_use_thy (require_thy true true false false false);
wenzelm@9822
   362
fun quiet_update_thy ml = gen_use_thy (require_thy true ml false true true);
wenzelm@7244
   363
wenzelm@9822
   364
val use_thy          = warn_finished (gen_use_thy (require_thy true true false true false));
wenzelm@9822
   365
val time_use_thy     = warn_finished (gen_use_thy (require_thy true true true true false));
wenzelm@9822
   366
val use_thy_only     = warn_finished (gen_use_thy (require_thy true false false true false));
wenzelm@9822
   367
val update_thy       = warn_finished (gen_use_thy (require_thy true true false true true));
wenzelm@9822
   368
val update_thy_only  = warn_finished (gen_use_thy (require_thy true false false true true));
wenzelm@9822
   369
val pretend_use_thy_only = warn_finished (gen_use_thy (require_thy false false false true false));
wenzelm@6211
   370
wenzelm@7211
   371
end;
wenzelm@7211
   372
wenzelm@6211
   373
wenzelm@6666
   374
(* remove_thy *)
wenzelm@6666
   375
wenzelm@6666
   376
fun remove_thy name =
wenzelm@7910
   377
  if is_finished name then error (loader_msg "cannot remove finished theory" [name])
wenzelm@6666
   378
  else
wenzelm@6666
   379
    let val succs = thy_graph Graph.all_succs [name] in
wenzelm@9778
   380
      priority (loader_msg "removing" succs);
wenzelm@7191
   381
      seq (perform Remove) succs;
wenzelm@7191
   382
      change_thys (Graph.del_nodes succs)
wenzelm@6666
   383
    end;
wenzelm@6666
   384
wenzelm@6666
   385
wenzelm@7066
   386
(* begin / end theory *)
wenzelm@6211
   387
wenzelm@8805
   388
fun begin_theory present upd name parents paths =
wenzelm@6211
   389
  let
berghofe@15065
   390
    val bparents = map base_of_path parents;
wenzelm@8805
   391
    val assert_thy = if upd then quiet_update_thy true else weak_use_thy;
wenzelm@7244
   392
    val _ = check_unfinished error name;
berghofe@15065
   393
    val _ = seq assert_thy parents;
berghofe@15065
   394
    val theory = PureThy.begin_theory name (map get_theory bparents);
wenzelm@7952
   395
    val deps =
wenzelm@7952
   396
      if known_thy name then get_deps name
wenzelm@7952
   397
      else (init_deps None (map #1 paths));   (*records additional ML files only!*)
wenzelm@6329
   398
    val use_paths = mapfilter (fn (x, true) => Some x | _ => None) paths;
wenzelm@9451
   399
berghofe@15065
   400
    val _ = change_thys (update_node name bparents (deps, Some (Theory.copy theory)));
berghofe@15065
   401
    val theory' = theory |> present name bparents paths;
wenzelm@9451
   402
    val _ = put_theory name (Theory.copy theory');
wenzelm@8805
   403
    val ((), theory'') = Context.pass_theory theory' (seq (load_file false)) use_paths;
wenzelm@9451
   404
    val _ = put_theory name (Theory.copy theory'');
wenzelm@8805
   405
  in theory'' end;
wenzelm@7244
   406
wenzelm@6211
   407
fun end_theory theory =
wenzelm@7099
   408
  let
wenzelm@7099
   409
    val theory' = PureThy.end_theory theory;
wenzelm@7099
   410
    val name = PureThy.get_name theory;
wenzelm@7099
   411
  in put_theory name theory'; theory' end;
wenzelm@6211
   412
wenzelm@6211
   413
wenzelm@6666
   414
(* finish all theories *)
wenzelm@6211
   415
wenzelm@6666
   416
fun finish () = change_thys (Graph.map_nodes (fn (_, entry) => (None, entry)));
wenzelm@6211
   417
wenzelm@6211
   418
wenzelm@6211
   419
(* register existing theories *)
wenzelm@6211
   420
wenzelm@6211
   421
fun register_theory theory =
wenzelm@6211
   422
  let
wenzelm@6211
   423
    val name = PureThy.get_name theory;
wenzelm@6211
   424
    val parents = Theory.parents_of theory;
wenzelm@6211
   425
    val parent_names = map PureThy.get_name parents;
wenzelm@6211
   426
wenzelm@6211
   427
    fun err txt bads =
wenzelm@6211
   428
      error (loader_msg txt bads ^ "\n" ^ gen_msg "cannot register theory" [name]);
wenzelm@6211
   429
wenzelm@6666
   430
    val nonfinished = filter_out is_finished parent_names;
wenzelm@6211
   431
    fun get_variant (x, y_name) =
wenzelm@6211
   432
      if Theory.eq_thy (x, get_theory y_name) then None
wenzelm@6211
   433
      else Some y_name;
wenzelm@6211
   434
    val variants = mapfilter get_variant (parents ~~ parent_names);
wenzelm@6211
   435
wenzelm@6211
   436
    fun register G =
wenzelm@6362
   437
      (Graph.new_node (name, (None, Some theory)) G
wenzelm@9327
   438
        handle Graph.DUP _ => err "duplicate theory entry" [])
wenzelm@6211
   439
      |> add_deps name parent_names;
wenzelm@6211
   440
  in
wenzelm@6666
   441
    if not (null nonfinished) then err "non-finished parent theories" nonfinished
wenzelm@6211
   442
    else if not (null variants) then err "different versions of parent theories" variants
wenzelm@7099
   443
    else (change_thys register; perform Update name)
wenzelm@6211
   444
  end;
wenzelm@6211
   445
wenzelm@6211
   446
wenzelm@6211
   447
(*final declarations of this structure*)
wenzelm@6211
   448
val theory = get_theory;
wenzelm@6211
   449
val names = get_names;
wenzelm@6211
   450
wenzelm@6211
   451
end;
wenzelm@6211
   452
wenzelm@5209
   453
structure BasicThyInfo: BASIC_THY_INFO = ThyInfo;
wenzelm@5209
   454
open BasicThyInfo;