src/Pure/context.ML
author wenzelm
Wed Apr 04 23:29:39 2007 +0200 (2007-04-04)
changeset 22599 d920d38f1f02
parent 22149 7a8c2a556d28
child 22603 76c30440c9af
permissions -rw-r--r--
theory: maintain ancestors in order of creation;
wenzelm@6185
     1
(*  Title:      Pure/context.ML
wenzelm@6185
     2
    ID:         $Id$
wenzelm@6185
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@6185
     4
wenzelm@16436
     5
Generic theory contexts with unique identity, arbitrarily typed data,
wenzelm@22095
     6
development graph and history support. Generic proof contexts with
wenzelm@22095
     7
arbitrarily typed data.
wenzelm@6185
     8
*)
wenzelm@6185
     9
wenzelm@6185
    10
signature BASIC_CONTEXT =
wenzelm@6185
    11
sig
wenzelm@16436
    12
  type theory
wenzelm@16436
    13
  type theory_ref
wenzelm@16436
    14
  exception THEORY of string * theory list
wenzelm@6185
    15
end;
wenzelm@6185
    16
wenzelm@6185
    17
signature CONTEXT =
wenzelm@6185
    18
sig
wenzelm@6185
    19
  include BASIC_CONTEXT
wenzelm@16436
    20
  (*theory context*)
wenzelm@16489
    21
  val theory_name: theory -> string
wenzelm@16436
    22
  val parents_of: theory -> theory list
wenzelm@16436
    23
  val ancestors_of: theory -> theory list
wenzelm@16436
    24
  val is_stale: theory -> bool
wenzelm@16436
    25
  val ProtoPureN: string
wenzelm@16436
    26
  val PureN: string
wenzelm@16436
    27
  val CPureN: string
wenzelm@16436
    28
  val draftN: string
wenzelm@16436
    29
  val exists_name: string -> theory -> bool
wenzelm@16436
    30
  val names_of: theory -> string list
wenzelm@16436
    31
  val pretty_thy: theory -> Pretty.T
wenzelm@16436
    32
  val string_of_thy: theory -> string
wenzelm@16436
    33
  val pprint_thy: theory -> pprint_args -> unit
wenzelm@16436
    34
  val pretty_abbrev_thy: theory -> Pretty.T
wenzelm@16436
    35
  val str_of_thy: theory -> string
wenzelm@16719
    36
  val check_thy: theory -> theory
wenzelm@16436
    37
  val eq_thy: theory * theory -> bool
wenzelm@16436
    38
  val subthy: theory * theory -> bool
wenzelm@16594
    39
  val joinable: theory * theory -> bool
wenzelm@16489
    40
  val merge: theory * theory -> theory                     (*exception TERM*)
wenzelm@16489
    41
  val merge_refs: theory_ref * theory_ref -> theory_ref    (*exception TERM*)
wenzelm@16436
    42
  val self_ref: theory -> theory_ref
wenzelm@16436
    43
  val deref: theory_ref -> theory
wenzelm@16436
    44
  val copy_thy: theory -> theory
wenzelm@16436
    45
  val checkpoint_thy: theory -> theory
wenzelm@16489
    46
  val finish_thy: theory -> theory
wenzelm@16533
    47
  val theory_data_of: theory -> string list
wenzelm@16489
    48
  val pre_pure_thy: theory
wenzelm@16489
    49
  val begin_thy: (theory -> Pretty.pp) -> string -> theory list -> theory
wenzelm@16533
    50
  (*proof context*)
wenzelm@16533
    51
  type proof
wenzelm@16533
    52
  val theory_of_proof: proof -> theory
wenzelm@17060
    53
  val transfer_proof: theory -> proof -> proof
wenzelm@16533
    54
  val init_proof: theory -> proof
wenzelm@16533
    55
  val proof_data_of: theory -> string list
wenzelm@16533
    56
  (*generic context*)
wenzelm@18632
    57
  datatype generic = Theory of theory | Proof of proof
wenzelm@18632
    58
  val cases: (theory -> 'a) -> (proof -> 'a) -> generic -> 'a
wenzelm@19678
    59
  val mapping: (theory -> theory) -> (proof -> proof) -> generic -> generic
wenzelm@21660
    60
  val mapping_result: (theory -> 'a * theory) -> (proof -> 'a * proof) -> generic -> 'a * generic
wenzelm@18632
    61
  val the_theory: generic -> theory
wenzelm@18632
    62
  val the_proof: generic -> proof
wenzelm@18731
    63
  val map_theory: (theory -> theory) -> generic -> generic
wenzelm@18731
    64
  val map_proof: (proof -> proof) -> generic -> generic
wenzelm@18731
    65
  val theory_map: (generic -> generic) -> theory -> theory
wenzelm@18731
    66
  val proof_map: (generic -> generic) -> proof -> proof
wenzelm@18665
    67
  val theory_of: generic -> theory   (*total*)
wenzelm@18665
    68
  val proof_of: generic -> proof     (*total*)
wenzelm@22095
    69
  (*delayed setup*)
wenzelm@22085
    70
  val add_setup: (theory -> theory) -> unit
wenzelm@22085
    71
  val setup: unit -> theory -> theory
wenzelm@6185
    72
end;
wenzelm@6185
    73
wenzelm@16436
    74
signature PRIVATE_CONTEXT =
wenzelm@16436
    75
sig
wenzelm@16436
    76
  include CONTEXT
wenzelm@16436
    77
  structure TheoryData:
wenzelm@16436
    78
  sig
wenzelm@16489
    79
    val declare: string -> Object.T -> (Object.T -> Object.T) -> (Object.T -> Object.T) ->
wenzelm@16489
    80
      (Pretty.pp -> Object.T * Object.T -> Object.T) -> serial
wenzelm@16436
    81
    val init: serial -> theory -> theory
wenzelm@16436
    82
    val get: serial -> (Object.T -> 'a) -> theory -> 'a
wenzelm@16436
    83
    val put: serial -> ('a -> Object.T) -> 'a -> theory -> theory
wenzelm@16489
    84
  end
wenzelm@16533
    85
  structure ProofData:
wenzelm@16533
    86
  sig
wenzelm@16533
    87
    val declare: string -> (theory -> Object.T) -> serial
wenzelm@16533
    88
    val init: serial -> theory -> theory
wenzelm@16533
    89
    val get: serial -> (Object.T -> 'a) -> proof -> 'a
wenzelm@16533
    90
    val put: serial -> ('a -> Object.T) -> 'a -> proof -> proof
wenzelm@16533
    91
  end
wenzelm@16436
    92
end;
wenzelm@16436
    93
wenzelm@16436
    94
structure Context: PRIVATE_CONTEXT =
wenzelm@6185
    95
struct
wenzelm@6185
    96
wenzelm@16436
    97
(*** theory context ***)
wenzelm@6185
    98
wenzelm@16489
    99
(** theory data **)
wenzelm@16489
   100
wenzelm@16489
   101
(* data kinds and access methods *)
wenzelm@16489
   102
wenzelm@19028
   103
(*private copy avoids potential conflict of table exceptions*)
wenzelm@19028
   104
structure Datatab = TableFun(type key = int val ord = int_ord);
wenzelm@19028
   105
wenzelm@16489
   106
local
wenzelm@16489
   107
wenzelm@16489
   108
type kind =
wenzelm@16489
   109
 {name: string,
wenzelm@16489
   110
  empty: Object.T,
wenzelm@16489
   111
  copy: Object.T -> Object.T,
wenzelm@16489
   112
  extend: Object.T -> Object.T,
wenzelm@16489
   113
  merge: Pretty.pp -> Object.T * Object.T -> Object.T};
wenzelm@16489
   114
wenzelm@19028
   115
val kinds = ref (Datatab.empty: kind Datatab.table);
wenzelm@16489
   116
wenzelm@16489
   117
fun invoke meth_name meth_fn k =
wenzelm@19028
   118
  (case Datatab.lookup (! kinds) k of
wenzelm@16489
   119
    SOME kind => meth_fn kind |> transform_failure (fn exn =>
wenzelm@17340
   120
      EXCEPTION (exn, "Theory data method " ^ #name kind ^ "." ^ meth_name ^ " failed"))
wenzelm@16489
   121
  | NONE => sys_error ("Invalid theory data identifier " ^ string_of_int k));
wenzelm@16489
   122
wenzelm@16489
   123
in
wenzelm@16489
   124
wenzelm@16489
   125
fun invoke_name k    = invoke "name" (K o #name) k ();
wenzelm@16489
   126
fun invoke_empty k   = invoke "empty" (K o #empty) k ();
wenzelm@16489
   127
val invoke_copy      = invoke "copy" #copy;
wenzelm@16489
   128
val invoke_extend    = invoke "extend" #extend;
wenzelm@16489
   129
fun invoke_merge pp  = invoke "merge" (fn kind => #merge kind pp);
wenzelm@16489
   130
wenzelm@16533
   131
fun declare_theory_data name empty copy extend merge =
wenzelm@16489
   132
  let
wenzelm@16489
   133
    val k = serial ();
wenzelm@16533
   134
    val kind = {name = name, empty = empty, copy = copy, extend = extend, merge = merge};
wenzelm@21962
   135
    val _ =
wenzelm@21962
   136
      if Datatab.exists (equal name o #name o #2) (! kinds) then
wenzelm@21962
   137
        warning ("Duplicate declaration of theory data " ^ quote name)
wenzelm@21962
   138
      else ();
wenzelm@19028
   139
    val _ = change kinds (Datatab.update (k, kind));
wenzelm@16489
   140
  in k end;
wenzelm@16489
   141
wenzelm@19028
   142
val copy_data = Datatab.map' invoke_copy;
wenzelm@19028
   143
val extend_data = Datatab.map' invoke_extend;
wenzelm@19028
   144
fun merge_data pp = Datatab.join (invoke_merge pp) o pairself extend_data;
wenzelm@16489
   145
wenzelm@16489
   146
end;
wenzelm@16489
   147
wenzelm@16489
   148
wenzelm@16489
   149
wenzelm@16489
   150
(** datatype theory **)
wenzelm@16489
   151
wenzelm@16436
   152
datatype theory =
wenzelm@16436
   153
  Theory of
wenzelm@16533
   154
   (*identity*)
wenzelm@16489
   155
   {self: theory ref option,            (*dynamic self reference -- follows theory changes*)
wenzelm@16489
   156
    id: serial * string,                (*identifier of this theory*)
wenzelm@16489
   157
    ids: string Inttab.table,           (*identifiers of ancestors*)
wenzelm@16489
   158
    iids: string Inttab.table} *        (*identifiers of intermediate checkpoints*)
wenzelm@16533
   159
   (*data*)
wenzelm@19028
   160
   {theory: Object.T Datatab.table,     (*theory data record*)
wenzelm@19028
   161
    proof: unit Datatab.table} *        (*proof data kinds*)
wenzelm@16533
   162
   (*ancestry*)
wenzelm@16489
   163
   {parents: theory list,               (*immediate predecessors*)
wenzelm@16489
   164
    ancestors: theory list} *           (*all predecessors*)
wenzelm@16533
   165
   (*history*)
wenzelm@16489
   166
   {name: string,                       (*prospective name of finished theory*)
wenzelm@16489
   167
    version: int,                       (*checkpoint counter*)
wenzelm@16489
   168
    intermediates: theory list};        (*intermediate checkpoints*)
wenzelm@16436
   169
wenzelm@16436
   170
exception THEORY of string * theory list;
wenzelm@16436
   171
wenzelm@16436
   172
fun rep_theory (Theory args) = args;
wenzelm@16436
   173
wenzelm@16436
   174
val identity_of = #1 o rep_theory;
wenzelm@16436
   175
val data_of     = #2 o rep_theory;
wenzelm@16489
   176
val ancestry_of = #3 o rep_theory;
wenzelm@16489
   177
val history_of  = #4 o rep_theory;
wenzelm@16436
   178
wenzelm@16489
   179
fun make_identity self id ids iids = {self = self, id = id, ids = ids, iids = iids};
wenzelm@16533
   180
fun make_data theory proof = {theory = theory, proof = proof};
wenzelm@16489
   181
fun make_ancestry parents ancestors = {parents = parents, ancestors = ancestors};
wenzelm@16436
   182
fun make_history name vers ints = {name = name, version = vers, intermediates = ints};
wenzelm@16436
   183
wenzelm@18731
   184
fun map_theory_data f {theory, proof} = make_data (f theory) proof;
wenzelm@18731
   185
fun map_proof_data f {theory, proof} = make_data theory (f proof);
wenzelm@16533
   186
wenzelm@16533
   187
val the_self = the o #self o identity_of;
wenzelm@16436
   188
val parents_of = #parents o ancestry_of;
wenzelm@16436
   189
val ancestors_of = #ancestors o ancestry_of;
wenzelm@16489
   190
val theory_name = #name o history_of;
wenzelm@16436
   191
wenzelm@16436
   192
wenzelm@16436
   193
(* staleness *)
wenzelm@16436
   194
wenzelm@16533
   195
fun eq_id ((i: int, _), (j, _)) = (i = j);
wenzelm@16436
   196
wenzelm@16436
   197
fun is_stale
wenzelm@16436
   198
    (Theory ({self = SOME (ref (Theory ({id = id', ...}, _, _, _))), id, ...}, _, _, _)) =
wenzelm@16436
   199
      not (eq_id (id, id'))
wenzelm@16436
   200
  | is_stale (Theory ({self = NONE, ...}, _, _, _)) = true;
wenzelm@16436
   201
wenzelm@16436
   202
fun vitalize (thy as Theory ({self = SOME r, ...}, _, _, _)) = (r := thy; thy)
wenzelm@16489
   203
  | vitalize (thy as Theory ({self = NONE, id, ids, iids}, data, ancestry, history)) =
wenzelm@16436
   204
      let
wenzelm@16436
   205
        val r = ref thy;
wenzelm@16489
   206
        val thy' = Theory (make_identity (SOME r) id ids iids, data, ancestry, history);
wenzelm@16436
   207
      in r := thy'; thy' end;
wenzelm@16436
   208
wenzelm@16436
   209
wenzelm@16436
   210
(* names *)
wenzelm@16436
   211
wenzelm@16436
   212
val ProtoPureN = "ProtoPure";
wenzelm@16436
   213
val PureN = "Pure";
wenzelm@16436
   214
val CPureN = "CPure";
wenzelm@16436
   215
wenzelm@16436
   216
val draftN = "#";
wenzelm@16436
   217
fun draft_id (_, name) = (name = draftN);
wenzelm@16436
   218
val is_draft = draft_id o #id o identity_of;
wenzelm@16436
   219
wenzelm@20821
   220
fun exists_name name (thy as Theory ({id, ids, iids, ...}, _, _, _)) =
wenzelm@20821
   221
  name = theory_name thy orelse
wenzelm@16489
   222
  name = #2 id orelse
wenzelm@16489
   223
  Inttab.exists (equal name o #2) ids orelse
wenzelm@16489
   224
  Inttab.exists (equal name o #2) iids;
wenzelm@16436
   225
wenzelm@16489
   226
fun names_of (Theory ({id, ids, iids, ...}, _, _, _)) =
wenzelm@16489
   227
  rev (#2 id :: Inttab.fold (cons o #2) iids (Inttab.fold (cons o #2) ids []));
wenzelm@16436
   228
wenzelm@16436
   229
fun pretty_thy thy =
wenzelm@16436
   230
  Pretty.str_list "{" "}" (names_of thy @ (if is_stale thy then ["!"] else []));
wenzelm@16436
   231
wenzelm@16436
   232
val string_of_thy = Pretty.string_of o pretty_thy;
wenzelm@16436
   233
val pprint_thy = Pretty.pprint o pretty_thy;
wenzelm@16436
   234
wenzelm@16436
   235
fun pretty_abbrev_thy thy =
wenzelm@16436
   236
  let
wenzelm@16436
   237
    val names = names_of thy;
wenzelm@16436
   238
    val n = length names;
wenzelm@16436
   239
    val abbrev = if n > 5 then "..." :: List.drop (names, n - 5) else names;
wenzelm@16436
   240
  in Pretty.str_list "{" "}" abbrev end;
wenzelm@16436
   241
wenzelm@16436
   242
val str_of_thy = Pretty.str_of o pretty_abbrev_thy;
wenzelm@16436
   243
wenzelm@16436
   244
wenzelm@16533
   245
(* consistency *)    (*exception TERM*)
wenzelm@16436
   246
wenzelm@16719
   247
fun check_thy thy =
wenzelm@16436
   248
  if is_stale thy then
wenzelm@16719
   249
    raise TERM ("Stale theory encountered:\n" ^ string_of_thy thy, [])
wenzelm@16436
   250
  else thy;
wenzelm@16436
   251
wenzelm@16489
   252
fun check_ins id ids =
wenzelm@16894
   253
  if draft_id id orelse Inttab.defined ids (#1 id) then ids
wenzelm@16436
   254
  else if Inttab.exists (equal (#2 id) o #2) ids then
wenzelm@16436
   255
    raise TERM ("Different versions of theory component " ^ quote (#2 id), [])
wenzelm@17412
   256
  else Inttab.update id ids;
wenzelm@16436
   257
wenzelm@16489
   258
fun check_insert intermediate id (ids, iids) =
wenzelm@16489
   259
  let val ids' = check_ins id ids and iids' = check_ins id iids
wenzelm@16489
   260
  in if intermediate then (ids, iids') else (ids', iids) end;
wenzelm@16489
   261
wenzelm@16489
   262
fun check_merge
wenzelm@16489
   263
    (Theory ({id = id1, ids = ids1, iids = iids1, ...}, _, _, history1))
wenzelm@16489
   264
    (Theory ({id = id2, ids = ids2, iids = iids2, ...}, _, _, history2)) =
wenzelm@16489
   265
  (Inttab.fold check_ins ids2 ids1, Inttab.fold check_ins iids2 iids1)
wenzelm@16489
   266
  |> check_insert (#version history1 > 0) id1
wenzelm@16489
   267
  |> check_insert (#version history2 > 0) id2;
wenzelm@16436
   268
wenzelm@16436
   269
wenzelm@16533
   270
(* equality and inclusion *)
wenzelm@16533
   271
wenzelm@16719
   272
val eq_thy = eq_id o pairself (#id o identity_of o check_thy);
wenzelm@16533
   273
wenzelm@16533
   274
fun proper_subthy
wenzelm@16719
   275
    (Theory ({id = (i, _), ...}, _, _, _), Theory ({ids, iids, ...}, _, _, _)) =
wenzelm@16894
   276
  Inttab.defined ids i orelse Inttab.defined iids i;
wenzelm@16533
   277
wenzelm@16533
   278
fun subthy thys = eq_thy thys orelse proper_subthy thys;
wenzelm@16533
   279
wenzelm@16594
   280
fun joinable (thy1, thy2) = subthy (thy1, thy2) orelse subthy (thy2, thy1);
wenzelm@16594
   281
wenzelm@16533
   282
wenzelm@16489
   283
(* theory references *)
wenzelm@16489
   284
wenzelm@16489
   285
(*theory_ref provides a safe way to store dynamic references to a
wenzelm@16533
   286
  theory in external data structures -- a plain theory value would
wenzelm@16533
   287
  become stale as the self reference moves on*)
wenzelm@16489
   288
wenzelm@16489
   289
datatype theory_ref = TheoryRef of theory ref;
wenzelm@16489
   290
wenzelm@16719
   291
val self_ref = TheoryRef o the_self o check_thy;
wenzelm@16489
   292
fun deref (TheoryRef (ref thy)) = thy;
wenzelm@16489
   293
wenzelm@16489
   294
wenzelm@16533
   295
(* trivial merge *)    (*exception TERM*)
wenzelm@16436
   296
wenzelm@16436
   297
fun merge (thy1, thy2) =
wenzelm@16719
   298
  if eq_thy (thy1, thy2) then thy1
wenzelm@16719
   299
  else if proper_subthy (thy2, thy1) then thy1
wenzelm@16719
   300
  else if proper_subthy (thy1, thy2) then thy2
wenzelm@16436
   301
  else (check_merge thy1 thy2;
wenzelm@16436
   302
    raise TERM (cat_lines ["Attempt to perform non-trivial merge of theories:",
wenzelm@16436
   303
      str_of_thy thy1, str_of_thy thy2], []));
wenzelm@16436
   304
wenzelm@16719
   305
fun merge_refs (ref1, ref2) =
wenzelm@16719
   306
  if ref1 = ref2 then ref1
wenzelm@16719
   307
  else self_ref (merge (deref ref1, deref ref2));
wenzelm@16436
   308
wenzelm@16436
   309
wenzelm@16489
   310
wenzelm@16489
   311
(** build theories **)
wenzelm@16489
   312
wenzelm@16489
   313
(* primitives *)
wenzelm@16489
   314
wenzelm@16489
   315
fun create_thy name self id ids iids data ancestry history =
wenzelm@16489
   316
  let
wenzelm@17756
   317
    val {version, name = _, intermediates = _} = history;
wenzelm@17756
   318
    val intermediate = version > 0;
wenzelm@16489
   319
    val (ids', iids') = check_insert intermediate id (ids, iids);
wenzelm@16489
   320
    val id' = (serial (), name);
wenzelm@16489
   321
    val _ = check_insert intermediate id' (ids', iids');
wenzelm@16489
   322
    val identity' = make_identity self id' ids' iids';
wenzelm@16489
   323
  in vitalize (Theory (identity', data, ancestry, history)) end;
wenzelm@16436
   324
wenzelm@16489
   325
fun change_thy name f (thy as Theory ({self, id, ids, iids}, data, ancestry, history)) =
wenzelm@16489
   326
  let
wenzelm@16719
   327
    val _ = check_thy thy;
wenzelm@16489
   328
    val (self', data', ancestry') =
wenzelm@16489
   329
      if is_draft thy then (self, data, ancestry)    (*destructive change!*)
wenzelm@16489
   330
      else if #version history > 0
wenzelm@18731
   331
      then (NONE, map_theory_data copy_data data, ancestry)
wenzelm@18731
   332
      else (NONE, map_theory_data extend_data data,
wenzelm@18731
   333
        make_ancestry [thy] (thy :: #ancestors ancestry));
wenzelm@16489
   334
    val data'' = f data';
wenzelm@16489
   335
  in create_thy name self' id ids iids data'' ancestry' history end;
wenzelm@16489
   336
wenzelm@16489
   337
fun name_thy name = change_thy name I;
wenzelm@16489
   338
val modify_thy = change_thy draftN;
wenzelm@16489
   339
val extend_thy = modify_thy I;
wenzelm@16489
   340
wenzelm@16489
   341
fun copy_thy (thy as Theory ({id, ids, iids, ...}, data, ancestry, history)) =
wenzelm@16719
   342
  (check_thy thy;
wenzelm@18731
   343
    create_thy draftN NONE id ids iids (map_theory_data copy_data data) ancestry history);
wenzelm@16489
   344
wenzelm@16489
   345
val pre_pure_thy = create_thy draftN NONE (serial (), draftN) Inttab.empty Inttab.empty
wenzelm@19028
   346
  (make_data Datatab.empty Datatab.empty) (make_ancestry [] []) (make_history ProtoPureN 0 []);
wenzelm@16489
   347
wenzelm@16489
   348
wenzelm@16489
   349
(* named theory nodes *)
wenzelm@16489
   350
wenzelm@16489
   351
fun merge_thys pp (thy1, thy2) =
wenzelm@16533
   352
  if exists_name CPureN thy1 <> exists_name CPureN thy2 then
wenzelm@16436
   353
    error "Cannot merge Pure and CPure developments"
wenzelm@16436
   354
  else
wenzelm@16436
   355
    let
wenzelm@16489
   356
      val (ids, iids) = check_merge thy1 thy2;
wenzelm@16533
   357
      val data1 = data_of thy1 and data2 = data_of thy2;
wenzelm@16533
   358
      val data = make_data
wenzelm@16533
   359
        (merge_data (pp thy1) (#theory data1, #theory data2))
wenzelm@19028
   360
        (Datatab.merge (K true) (#proof data1, #proof data2));
wenzelm@16489
   361
      val ancestry = make_ancestry [] [];
wenzelm@16436
   362
      val history = make_history "" 0 [];
wenzelm@16489
   363
    in create_thy draftN NONE (serial (), draftN) ids iids data ancestry history end;
wenzelm@16489
   364
wenzelm@16533
   365
fun maximal_thys thys =
wenzelm@16533
   366
  thys |> filter (fn thy => not (exists (fn thy' => proper_subthy (thy, thy')) thys));
wenzelm@16533
   367
wenzelm@22599
   368
val creation_order = rev_order o int_ord o pairself (#1 o #id o identity_of);
wenzelm@22599
   369
wenzelm@16489
   370
fun begin_thy pp name imports =
wenzelm@16489
   371
  if name = draftN then error ("Illegal theory name: " ^ quote draftN)
wenzelm@16489
   372
  else
wenzelm@16489
   373
    let
wenzelm@16533
   374
      val parents =
wenzelm@19046
   375
        maximal_thys (distinct eq_thy (map check_thy imports));
wenzelm@22599
   376
      val ancestors = sort_distinct creation_order (parents @ maps ancestors_of parents);
wenzelm@16489
   377
      val Theory ({id, ids, iids, ...}, data, _, _) =
wenzelm@16489
   378
        (case parents of
wenzelm@16489
   379
          [] => error "No parent theories"
wenzelm@16533
   380
        | [thy] => extend_thy thy
wenzelm@16533
   381
        | thy :: thys => Library.foldl (merge_thys pp) (thy, thys));
wenzelm@16489
   382
      val ancestry = make_ancestry parents ancestors;
wenzelm@16489
   383
      val history = make_history name 0 [];
wenzelm@16489
   384
    in create_thy draftN NONE id ids iids data ancestry history end;
wenzelm@16436
   385
wenzelm@16436
   386
wenzelm@16489
   387
(* undoable checkpoints *)
wenzelm@16436
   388
wenzelm@16489
   389
fun checkpoint_thy thy =
wenzelm@16489
   390
  if not (is_draft thy) then thy
wenzelm@16436
   391
  else
wenzelm@16436
   392
    let
wenzelm@16489
   393
      val {name, version, intermediates} = history_of thy;
wenzelm@16489
   394
      val thy' as Theory (identity', data', ancestry', _) =
wenzelm@16489
   395
        name_thy (name ^ ":" ^ string_of_int version) thy;
wenzelm@16489
   396
      val history' = make_history name (version + 1) (thy' :: intermediates);
wenzelm@16489
   397
    in vitalize (Theory (identity', data', ancestry', history')) end;
wenzelm@16489
   398
wenzelm@16489
   399
fun finish_thy thy =
wenzelm@16489
   400
  let
wenzelm@16489
   401
    val {name, version, intermediates} = history_of thy;
wenzelm@16719
   402
    val rs = map (the_self o check_thy) intermediates;
wenzelm@16489
   403
    val thy' as Theory ({self, id, ids, ...}, data', ancestry', _) = name_thy name thy;
wenzelm@16489
   404
    val identity' = make_identity self id ids Inttab.empty;
wenzelm@16489
   405
    val history' = make_history name 0 [];
wenzelm@16489
   406
    val thy'' = vitalize (Theory (identity', data', ancestry', history'));
wenzelm@16533
   407
    val _ = List.app (fn r => r := thy'') rs;
wenzelm@16533
   408
  in thy'' end;
wenzelm@16489
   409
wenzelm@16489
   410
wenzelm@16489
   411
(* theory data *)
wenzelm@16436
   412
wenzelm@16533
   413
fun dest_data name_of tab =
wenzelm@19028
   414
  map name_of (Datatab.keys tab)
wenzelm@18931
   415
  |> map (rpair ()) |> Symtab.make_list |> Symtab.dest
wenzelm@16489
   416
  |> map (apsnd length)
wenzelm@16489
   417
  |> map (fn (name, 1) => name | (name, n) => name ^ enclose "[" "]" (string_of_int n));
wenzelm@16489
   418
wenzelm@16533
   419
val theory_data_of = dest_data invoke_name o #theory o data_of;
wenzelm@16533
   420
wenzelm@16489
   421
structure TheoryData =
wenzelm@16489
   422
struct
wenzelm@16489
   423
wenzelm@16489
   424
val declare = declare_theory_data;
wenzelm@16489
   425
wenzelm@16489
   426
fun get k dest thy =
wenzelm@19028
   427
  (case Datatab.lookup (#theory (data_of thy)) k of
wenzelm@16489
   428
    SOME x => (dest x handle Match =>
wenzelm@16489
   429
      error ("Failed to access theory data " ^ quote (invoke_name k)))
wenzelm@16489
   430
  | NONE => error ("Uninitialized theory data " ^ quote (invoke_name k)));
wenzelm@16489
   431
wenzelm@19028
   432
fun put k mk x = modify_thy (map_theory_data (Datatab.update (k, mk x)));
wenzelm@16489
   433
fun init k = put k I (invoke_empty k);
wenzelm@16489
   434
wenzelm@16489
   435
end;
wenzelm@16436
   436
wenzelm@16436
   437
wenzelm@16436
   438
wenzelm@16533
   439
(*** proof context ***)
wenzelm@16533
   440
wenzelm@16533
   441
(* datatype proof *)
wenzelm@16533
   442
wenzelm@19028
   443
datatype proof = Proof of theory_ref * Object.T Datatab.table;
wenzelm@17060
   444
wenzelm@17060
   445
fun theory_of_proof (Proof (thy_ref, _)) = deref thy_ref;
wenzelm@16533
   446
fun data_of_proof (Proof (_, data)) = data;
wenzelm@17060
   447
fun map_prf f (Proof (thy_ref, data)) = Proof (thy_ref, f data);
wenzelm@17060
   448
wenzelm@17060
   449
fun transfer_proof thy' (prf as Proof (thy_ref, data)) =
wenzelm@17060
   450
  if not (subthy (deref thy_ref, thy')) then
haftmann@19815
   451
    error "transfer proof context: not a super theory"
wenzelm@17060
   452
  else Proof (self_ref thy', data);
wenzelm@16533
   453
wenzelm@16533
   454
wenzelm@16533
   455
(* proof data kinds *)
wenzelm@16533
   456
wenzelm@16533
   457
local
wenzelm@16533
   458
wenzelm@16533
   459
type kind =
wenzelm@16533
   460
 {name: string,
wenzelm@16533
   461
  init: theory -> Object.T};
wenzelm@16533
   462
wenzelm@19028
   463
val kinds = ref (Datatab.empty: kind Datatab.table);
wenzelm@16533
   464
wenzelm@16533
   465
fun invoke meth_name meth_fn k =
wenzelm@19028
   466
  (case Datatab.lookup (! kinds) k of
wenzelm@16533
   467
    SOME kind => meth_fn kind |> transform_failure (fn exn =>
wenzelm@17340
   468
      EXCEPTION (exn, "Proof data method " ^ #name kind ^ "." ^ meth_name ^ " failed"))
wenzelm@16533
   469
  | NONE => sys_error ("Invalid proof data identifier " ^ string_of_int k));
wenzelm@16533
   470
wenzelm@16533
   471
fun invoke_name k = invoke "name" (K o #name) k ();
wenzelm@16533
   472
val invoke_init   = invoke "init" #init;
wenzelm@16533
   473
wenzelm@16533
   474
in
wenzelm@16533
   475
wenzelm@16533
   476
val proof_data_of = dest_data invoke_name o #proof o data_of;
wenzelm@16533
   477
wenzelm@16533
   478
fun init_proof thy =
wenzelm@19028
   479
  Proof (self_ref thy, Datatab.map' (fn k => fn _ => invoke_init k thy) (#proof (data_of thy)));
wenzelm@16533
   480
wenzelm@16533
   481
structure ProofData =
wenzelm@16533
   482
struct
wenzelm@16533
   483
wenzelm@16533
   484
fun declare name init =
wenzelm@16533
   485
  let
wenzelm@16533
   486
    val k = serial ();
wenzelm@16533
   487
    val kind = {name = name, init = init};
wenzelm@21962
   488
    val _ =
wenzelm@21962
   489
      if Datatab.exists (equal name o #name o #2) (! kinds) then
wenzelm@21962
   490
        warning ("Duplicate declaration of proof data " ^ quote name)
wenzelm@21962
   491
      else ();
wenzelm@19028
   492
    val _ = change kinds (Datatab.update (k, kind));
wenzelm@16533
   493
  in k end;
wenzelm@16533
   494
wenzelm@19028
   495
fun init k = modify_thy (map_proof_data (Datatab.update (k, ())));
wenzelm@16533
   496
wenzelm@16533
   497
fun get k dest prf =
wenzelm@19028
   498
  (case Datatab.lookup (data_of_proof prf) k of
wenzelm@16533
   499
    SOME x => (dest x handle Match =>
wenzelm@16533
   500
      error ("Failed to access proof data " ^ quote (invoke_name k)))
wenzelm@16533
   501
  | NONE => error ("Uninitialized proof data " ^ quote (invoke_name k)));
wenzelm@16533
   502
wenzelm@19028
   503
fun put k mk x = map_prf (Datatab.update (k, mk x));
wenzelm@16533
   504
wenzelm@16533
   505
end;
wenzelm@16533
   506
wenzelm@16533
   507
end;
wenzelm@16533
   508
wenzelm@16533
   509
wenzelm@18632
   510
wenzelm@16533
   511
(*** generic context ***)
wenzelm@16533
   512
wenzelm@18632
   513
datatype generic = Theory of theory | Proof of proof;
wenzelm@18632
   514
wenzelm@18632
   515
fun cases f _ (Theory thy) = f thy
wenzelm@18632
   516
  | cases _ g (Proof prf) = g prf;
wenzelm@16533
   517
wenzelm@19678
   518
fun mapping f g = cases (Theory o f) (Proof o g);
wenzelm@21660
   519
fun mapping_result f g = cases (apsnd Theory o f) (apsnd Proof o g);
wenzelm@19678
   520
wenzelm@18731
   521
val the_theory = cases I (fn _ => raise Fail "Ill-typed context: theory expected");
wenzelm@18731
   522
val the_proof = cases (fn _ => raise Fail "Ill-typed context: proof expected") I;
wenzelm@16533
   523
wenzelm@18731
   524
fun map_theory f = Theory o f o the_theory;
wenzelm@18731
   525
fun map_proof f = Proof o f o the_proof;
wenzelm@18731
   526
wenzelm@18731
   527
fun theory_map f = the_theory o f o Theory;
wenzelm@18731
   528
fun proof_map f = the_proof o f o Proof;
wenzelm@18665
   529
wenzelm@18632
   530
val theory_of = cases I theory_of_proof;
wenzelm@18632
   531
val proof_of = cases init_proof I;
wenzelm@16533
   532
wenzelm@22085
   533
wenzelm@22085
   534
wenzelm@22095
   535
(** delayed theory setup **)
wenzelm@22085
   536
wenzelm@22085
   537
local
wenzelm@22085
   538
  val setup_fn = ref (I: theory -> theory);
wenzelm@22085
   539
in
wenzelm@22085
   540
  fun add_setup f = setup_fn := (! setup_fn #> f);
wenzelm@22085
   541
  fun setup () = let val f = ! setup_fn in setup_fn := I; f end;
wenzelm@22085
   542
end;
wenzelm@22085
   543
wenzelm@6185
   544
end;
wenzelm@6185
   545
wenzelm@6185
   546
structure BasicContext: BASIC_CONTEXT = Context;
wenzelm@6185
   547
open BasicContext;
wenzelm@16436
   548
wenzelm@16436
   549
wenzelm@16436
   550
wenzelm@16533
   551
(*** type-safe interfaces for data declarations ***)
wenzelm@16533
   552
wenzelm@16533
   553
(** theory data **)
wenzelm@16436
   554
wenzelm@16436
   555
signature THEORY_DATA_ARGS =
wenzelm@16436
   556
sig
wenzelm@16436
   557
  val name: string
wenzelm@16436
   558
  type T
wenzelm@16436
   559
  val empty: T
wenzelm@16436
   560
  val copy: T -> T
wenzelm@16436
   561
  val extend: T -> T
wenzelm@16436
   562
  val merge: Pretty.pp -> T * T -> T
wenzelm@16436
   563
  val print: theory -> T -> unit
wenzelm@16436
   564
end;
wenzelm@16436
   565
wenzelm@16436
   566
signature THEORY_DATA =
wenzelm@16436
   567
sig
wenzelm@16436
   568
  type T
wenzelm@16436
   569
  val init: theory -> theory
wenzelm@16436
   570
  val print: theory -> unit
wenzelm@16436
   571
  val get: theory -> T
wenzelm@16489
   572
  val get_sg: theory -> T    (*obsolete*)
wenzelm@16436
   573
  val put: T -> theory -> theory
wenzelm@16436
   574
  val map: (T -> T) -> theory -> theory
wenzelm@16436
   575
end;
wenzelm@16436
   576
wenzelm@16436
   577
functor TheoryDataFun(Data: THEORY_DATA_ARGS): THEORY_DATA =
wenzelm@16436
   578
struct
wenzelm@16436
   579
wenzelm@16436
   580
structure TheoryData = Context.TheoryData;
wenzelm@16436
   581
wenzelm@16436
   582
type T = Data.T;
wenzelm@16436
   583
exception Data of T;
wenzelm@16436
   584
wenzelm@16436
   585
val kind = TheoryData.declare Data.name
wenzelm@16436
   586
  (Data Data.empty)
wenzelm@16436
   587
  (fn Data x => Data (Data.copy x))
wenzelm@16436
   588
  (fn Data x => Data (Data.extend x))
wenzelm@16489
   589
  (fn pp => fn (Data x1, Data x2) => Data (Data.merge pp (x1, x2)));
wenzelm@16436
   590
wenzelm@16436
   591
val init = TheoryData.init kind;
wenzelm@16436
   592
val get = TheoryData.get kind (fn Data x => x);
wenzelm@16489
   593
val get_sg = get;
wenzelm@16489
   594
fun print thy = Data.print thy (get thy);
wenzelm@16436
   595
val put = TheoryData.put kind Data;
wenzelm@16436
   596
fun map f thy = put (f (get thy)) thy;
wenzelm@16436
   597
wenzelm@16436
   598
end;
wenzelm@16436
   599
wenzelm@16533
   600
wenzelm@16533
   601
wenzelm@16533
   602
(** proof data **)
wenzelm@16533
   603
wenzelm@16533
   604
signature PROOF_DATA_ARGS =
wenzelm@16533
   605
sig
wenzelm@16533
   606
  val name: string
wenzelm@16533
   607
  type T
wenzelm@16533
   608
  val init: theory -> T
wenzelm@16533
   609
  val print: Context.proof -> T -> unit
wenzelm@16533
   610
end;
wenzelm@16533
   611
wenzelm@16533
   612
signature PROOF_DATA =
wenzelm@16533
   613
sig
wenzelm@16533
   614
  type T
wenzelm@16533
   615
  val init: theory -> theory
wenzelm@16533
   616
  val print: Context.proof -> unit
wenzelm@16533
   617
  val get: Context.proof -> T
wenzelm@16533
   618
  val put: T -> Context.proof -> Context.proof
wenzelm@16533
   619
  val map: (T -> T) -> Context.proof -> Context.proof
wenzelm@16533
   620
end;
wenzelm@16533
   621
wenzelm@16533
   622
functor ProofDataFun(Data: PROOF_DATA_ARGS): PROOF_DATA =
wenzelm@16533
   623
struct
wenzelm@16533
   624
wenzelm@16533
   625
structure ProofData = Context.ProofData;
wenzelm@16533
   626
wenzelm@16533
   627
type T = Data.T;
wenzelm@16533
   628
exception Data of T;
wenzelm@16533
   629
wenzelm@16533
   630
val kind = ProofData.declare Data.name (Data o Data.init);
wenzelm@16533
   631
wenzelm@16533
   632
val init = ProofData.init kind;
wenzelm@16533
   633
val get = ProofData.get kind (fn Data x => x);
wenzelm@16533
   634
fun print prf = Data.print prf (get prf);
wenzelm@16533
   635
val put = ProofData.put kind Data;
wenzelm@16533
   636
fun map f prf = put (f (get prf)) prf;
wenzelm@16533
   637
wenzelm@16533
   638
end;
wenzelm@16533
   639
wenzelm@18632
   640
wenzelm@18632
   641
wenzelm@18632
   642
(** generic data **)
wenzelm@18632
   643
wenzelm@18632
   644
signature GENERIC_DATA_ARGS =
wenzelm@18632
   645
sig
wenzelm@18632
   646
  val name: string
wenzelm@18632
   647
  type T
wenzelm@18632
   648
  val empty: T
wenzelm@18632
   649
  val extend: T -> T
wenzelm@18632
   650
  val merge: Pretty.pp -> T * T -> T
wenzelm@18632
   651
  val print: Context.generic -> T -> unit
wenzelm@18632
   652
end;
wenzelm@18632
   653
wenzelm@18632
   654
signature GENERIC_DATA =
wenzelm@18632
   655
sig
wenzelm@18632
   656
  type T
wenzelm@18632
   657
  val init: theory -> theory
wenzelm@18632
   658
  val get: Context.generic -> T
wenzelm@18632
   659
  val put: T -> Context.generic -> Context.generic
wenzelm@18632
   660
  val map: (T -> T) -> Context.generic -> Context.generic
wenzelm@18632
   661
  val print: Context.generic -> unit
wenzelm@18632
   662
end;
wenzelm@18632
   663
wenzelm@18632
   664
functor GenericDataFun(Data: GENERIC_DATA_ARGS): GENERIC_DATA =
wenzelm@18632
   665
struct
wenzelm@18632
   666
wenzelm@18632
   667
structure ThyData = TheoryDataFun(open Data val copy = I fun print _ _ = ());
wenzelm@18632
   668
structure PrfData =
wenzelm@18632
   669
  ProofDataFun(val name = Data.name type T = Data.T val init = ThyData.get fun print _ _ = ());
wenzelm@18632
   670
wenzelm@18632
   671
type T = Data.T;
wenzelm@18632
   672
val init = ThyData.init #> PrfData.init;
wenzelm@18632
   673
wenzelm@18632
   674
fun get (Context.Theory thy) = ThyData.get thy
wenzelm@18632
   675
  | get (Context.Proof prf) = PrfData.get prf;
wenzelm@18632
   676
wenzelm@18632
   677
fun put x (Context.Theory thy) = Context.Theory (ThyData.put x thy)
wenzelm@18632
   678
  | put x (Context.Proof prf) = Context.Proof (PrfData.put x prf);
wenzelm@18632
   679
wenzelm@18632
   680
fun map f ctxt = put (f (get ctxt)) ctxt;
wenzelm@18632
   681
wenzelm@18632
   682
fun print ctxt = Data.print ctxt (get ctxt);
wenzelm@18632
   683
wenzelm@18632
   684
end;
wenzelm@18632
   685
wenzelm@16533
   686
(*hide private interface*)
wenzelm@16436
   687
structure Context: CONTEXT = Context;
wenzelm@20297
   688
wenzelm@21518
   689
(*fake predeclarations*)
wenzelm@20297
   690
structure Proof = struct type context = Context.proof end;
wenzelm@21518
   691
structure ProofContext =
wenzelm@21518
   692
struct val theory_of = Context.theory_of_proof val init = Context.init_proof end;