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