src/Pure/context.ML
author wenzelm
Sat Dec 13 15:06:24 2008 +0100 (2008-12-13 ago)
changeset 29093 1cc36c0ec9eb
parent 29069 c7ba485581ae
child 29095 a75f3ed534a0
permissions -rw-r--r--
refined identity and ancestry: explicit draft flat, ids are unnamed, name consistency is checked for ancestry;
tuned history: renamed version to stage, disallow checkpoint/finish_thy on finished theories;
added display_names -- user-level presentation;
removed obsolete exists_name, names_of;
tuned;
wenzelm@6185
     1
(*  Title:      Pure/context.ML
wenzelm@6185
     2
    Author:     Markus Wenzel, TU Muenchen
wenzelm@6185
     3
wenzelm@16436
     4
Generic theory contexts with unique identity, arbitrarily typed data,
wenzelm@24141
     5
monotonic development graph and history support.  Generic proof
wenzelm@24141
     6
contexts with arbitrarily typed data.
wenzelm@6185
     7
*)
wenzelm@6185
     8
wenzelm@6185
     9
signature BASIC_CONTEXT =
wenzelm@6185
    10
sig
wenzelm@16436
    11
  type theory
wenzelm@16436
    12
  type theory_ref
wenzelm@16436
    13
  exception THEORY of string * theory list
wenzelm@6185
    14
end;
wenzelm@6185
    15
wenzelm@6185
    16
signature CONTEXT =
wenzelm@6185
    17
sig
wenzelm@6185
    18
  include BASIC_CONTEXT
wenzelm@16436
    19
  (*theory context*)
wenzelm@16436
    20
  val parents_of: theory -> theory list
wenzelm@16436
    21
  val ancestors_of: theory -> theory list
wenzelm@29069
    22
  val theory_name: theory -> string
wenzelm@16436
    23
  val is_stale: theory -> bool
wenzelm@26623
    24
  val is_draft: theory -> bool
wenzelm@28317
    25
  val reject_draft: theory -> theory
wenzelm@29093
    26
  val PureN: string
wenzelm@29093
    27
  val display_names: theory -> string list
wenzelm@16436
    28
  val pretty_thy: theory -> Pretty.T
wenzelm@16436
    29
  val string_of_thy: theory -> string
wenzelm@16436
    30
  val pprint_thy: theory -> pprint_args -> unit
wenzelm@27341
    31
  val pprint_thy_ref: theory_ref -> pprint_args -> unit
wenzelm@16436
    32
  val pretty_abbrev_thy: theory -> Pretty.T
wenzelm@16436
    33
  val str_of_thy: theory -> string
wenzelm@24141
    34
  val deref: theory_ref -> theory
wenzelm@24141
    35
  val check_thy: theory -> theory_ref
wenzelm@16436
    36
  val eq_thy: theory * theory -> bool
wenzelm@16436
    37
  val subthy: theory * theory -> bool
wenzelm@16594
    38
  val joinable: theory * theory -> bool
wenzelm@23355
    39
  val merge: theory * theory -> theory
wenzelm@23355
    40
  val merge_refs: theory_ref * theory_ref -> theory_ref
wenzelm@16436
    41
  val copy_thy: theory -> theory
wenzelm@16436
    42
  val checkpoint_thy: theory -> theory
wenzelm@16489
    43
  val finish_thy: theory -> theory
wenzelm@16489
    44
  val begin_thy: (theory -> Pretty.pp) -> string -> theory list -> theory
wenzelm@16533
    45
  (*proof context*)
wenzelm@16533
    46
  type proof
wenzelm@16533
    47
  val theory_of_proof: proof -> theory
wenzelm@17060
    48
  val transfer_proof: theory -> proof -> proof
wenzelm@16533
    49
  val init_proof: theory -> proof
wenzelm@16533
    50
  (*generic context*)
wenzelm@18632
    51
  datatype generic = Theory of theory | Proof of proof
wenzelm@18632
    52
  val cases: (theory -> 'a) -> (proof -> 'a) -> generic -> 'a
wenzelm@19678
    53
  val mapping: (theory -> theory) -> (proof -> proof) -> generic -> generic
wenzelm@21660
    54
  val mapping_result: (theory -> 'a * theory) -> (proof -> 'a * proof) -> generic -> 'a * generic
wenzelm@18632
    55
  val the_theory: generic -> theory
wenzelm@18632
    56
  val the_proof: generic -> proof
wenzelm@18731
    57
  val map_theory: (theory -> theory) -> generic -> generic
wenzelm@18731
    58
  val map_proof: (proof -> proof) -> generic -> generic
wenzelm@26486
    59
  val map_theory_result: (theory -> 'a * theory) -> generic -> 'a * generic
wenzelm@26486
    60
  val map_proof_result: (proof -> 'a * proof) -> generic -> 'a * generic
wenzelm@18731
    61
  val theory_map: (generic -> generic) -> theory -> theory
wenzelm@18731
    62
  val proof_map: (generic -> generic) -> proof -> proof
wenzelm@18665
    63
  val theory_of: generic -> theory   (*total*)
wenzelm@18665
    64
  val proof_of: generic -> proof     (*total*)
wenzelm@26413
    65
  (*thread data*)
wenzelm@26413
    66
  val thread_data: unit -> generic option
wenzelm@26413
    67
  val the_thread_data: unit -> generic
wenzelm@26413
    68
  val set_thread_data: generic option -> unit
wenzelm@26413
    69
  val setmp_thread_data: generic option -> ('a -> 'b) -> 'a -> 'b
wenzelm@26463
    70
  val >> : (generic -> generic) -> unit
wenzelm@26463
    71
  val >>> : (generic -> 'a * generic) -> 'a
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@22847
    79
    val declare: 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 get: serial -> (Object.T -> 'a) -> theory -> 'a
wenzelm@16436
    82
    val put: serial -> ('a -> Object.T) -> 'a -> theory -> theory
wenzelm@16489
    83
  end
wenzelm@16533
    84
  structure ProofData:
wenzelm@16533
    85
  sig
wenzelm@22847
    86
    val declare: (theory -> Object.T) -> serial
wenzelm@16533
    87
    val get: serial -> (Object.T -> 'a) -> proof -> 'a
wenzelm@16533
    88
    val put: serial -> ('a -> Object.T) -> 'a -> proof -> proof
wenzelm@16533
    89
  end
wenzelm@16436
    90
end;
wenzelm@16436
    91
wenzelm@16436
    92
structure Context: PRIVATE_CONTEXT =
wenzelm@6185
    93
struct
wenzelm@6185
    94
wenzelm@16436
    95
(*** theory context ***)
wenzelm@6185
    96
wenzelm@16489
    97
(** theory data **)
wenzelm@16489
    98
wenzelm@16489
    99
(* data kinds and access methods *)
wenzelm@16489
   100
wenzelm@19028
   101
(*private copy avoids potential conflict of table exceptions*)
wenzelm@19028
   102
structure Datatab = TableFun(type key = int val ord = int_ord);
wenzelm@19028
   103
wenzelm@16489
   104
local
wenzelm@16489
   105
wenzelm@16489
   106
type kind =
wenzelm@22847
   107
 {empty: Object.T,
wenzelm@16489
   108
  copy: Object.T -> Object.T,
wenzelm@16489
   109
  extend: Object.T -> Object.T,
wenzelm@16489
   110
  merge: Pretty.pp -> Object.T * Object.T -> Object.T};
wenzelm@16489
   111
wenzelm@19028
   112
val kinds = ref (Datatab.empty: kind Datatab.table);
wenzelm@16489
   113
wenzelm@22847
   114
fun invoke f k =
wenzelm@19028
   115
  (case Datatab.lookup (! kinds) k of
wenzelm@22847
   116
    SOME kind => f kind
wenzelm@22847
   117
  | NONE => sys_error "Invalid theory data identifier");
wenzelm@16489
   118
wenzelm@16489
   119
in
wenzelm@16489
   120
wenzelm@22847
   121
fun invoke_empty k   = invoke (K o #empty) k ();
wenzelm@22847
   122
val invoke_copy      = invoke #copy;
wenzelm@22847
   123
val invoke_extend    = invoke #extend;
wenzelm@22847
   124
fun invoke_merge pp  = invoke (fn kind => #merge kind pp);
wenzelm@16489
   125
wenzelm@22847
   126
fun declare_theory_data empty copy extend merge =
wenzelm@16489
   127
  let
wenzelm@16489
   128
    val k = serial ();
wenzelm@22847
   129
    val kind = {empty = empty, copy = copy, extend = extend, merge = merge};
wenzelm@23944
   130
    val _ = CRITICAL (fn () => change kinds (Datatab.update (k, kind)));
wenzelm@16489
   131
  in k end;
wenzelm@16489
   132
wenzelm@19028
   133
val copy_data = Datatab.map' invoke_copy;
wenzelm@19028
   134
val extend_data = Datatab.map' invoke_extend;
wenzelm@19028
   135
fun merge_data pp = Datatab.join (invoke_merge pp) o pairself extend_data;
wenzelm@16489
   136
wenzelm@16489
   137
end;
wenzelm@16489
   138
wenzelm@16489
   139
wenzelm@16489
   140
wenzelm@16489
   141
(** datatype theory **)
wenzelm@16489
   142
wenzelm@16436
   143
datatype theory =
wenzelm@16436
   144
  Theory of
wenzelm@16533
   145
   (*identity*)
wenzelm@29093
   146
   {self: theory ref option,      (*dynamic self reference -- follows theory changes*)
wenzelm@29093
   147
    draft: bool,                  (*draft mode -- linear changes*)
wenzelm@29093
   148
    id: serial,                   (*identifier*)
wenzelm@29093
   149
    ids: unit Inttab.table} *     (*cumulative identifiers of non-drafts -- symbolic body content*)
wenzelm@29093
   150
   (*data*)                      
wenzelm@29093
   151
   Object.T Datatab.table *      
wenzelm@29093
   152
   (*ancestry*)                  
wenzelm@29093
   153
   {parents: theory list,         (*immediate predecessors*)
wenzelm@29093
   154
    ancestors: theory list} *     (*all predecessors -- canonical reverse order*)
wenzelm@29093
   155
   (*history*)                   
wenzelm@29093
   156
   {name: string,                 (*official theory name*)
wenzelm@29093
   157
    stage: int};                  (*checkpoint counter*)
wenzelm@16436
   158
wenzelm@16436
   159
exception THEORY of string * theory list;
wenzelm@16436
   160
wenzelm@16436
   161
fun rep_theory (Theory args) = args;
wenzelm@16436
   162
wenzelm@16436
   163
val identity_of = #1 o rep_theory;
wenzelm@16436
   164
val data_of     = #2 o rep_theory;
wenzelm@16489
   165
val ancestry_of = #3 o rep_theory;
wenzelm@16489
   166
val history_of  = #4 o rep_theory;
wenzelm@16436
   167
wenzelm@29093
   168
fun make_identity self draft id ids = {self = self, draft = draft, id = id, ids = ids};
wenzelm@16489
   169
fun make_ancestry parents ancestors = {parents = parents, ancestors = ancestors};
wenzelm@29093
   170
fun make_history name stage = {name = name, stage = stage};
wenzelm@16436
   171
wenzelm@16533
   172
val the_self = the o #self o identity_of;
wenzelm@16436
   173
val parents_of = #parents o ancestry_of;
wenzelm@16436
   174
val ancestors_of = #ancestors o ancestry_of;
wenzelm@16489
   175
val theory_name = #name o history_of;
wenzelm@16436
   176
wenzelm@16436
   177
wenzelm@16436
   178
(* staleness *)
wenzelm@16436
   179
wenzelm@29093
   180
fun eq_id (i: int, j) = i = j;
wenzelm@16436
   181
wenzelm@16436
   182
fun is_stale
wenzelm@16436
   183
    (Theory ({self = SOME (ref (Theory ({id = id', ...}, _, _, _))), id, ...}, _, _, _)) =
wenzelm@16436
   184
      not (eq_id (id, id'))
wenzelm@16436
   185
  | is_stale (Theory ({self = NONE, ...}, _, _, _)) = true;
wenzelm@16436
   186
wenzelm@16436
   187
fun vitalize (thy as Theory ({self = SOME r, ...}, _, _, _)) = (r := thy; thy)
wenzelm@29093
   188
  | vitalize (thy as Theory ({self = NONE, draft, id, ids}, data, ancestry, history)) =
wenzelm@16436
   189
      let
wenzelm@16436
   190
        val r = ref thy;
wenzelm@29093
   191
        val thy' = Theory (make_identity (SOME r) draft id ids, data, ancestry, history);
wenzelm@16436
   192
      in r := thy'; thy' end;
wenzelm@16436
   193
wenzelm@16436
   194
wenzelm@29093
   195
(* draft mode *)
wenzelm@16436
   196
wenzelm@29093
   197
val is_draft = #draft o identity_of;
wenzelm@16436
   198
wenzelm@28317
   199
fun reject_draft thy =
wenzelm@28317
   200
  if is_draft thy then raise THEORY ("Illegal draft theory -- stable checkpoint required", [thy])
wenzelm@28317
   201
  else thy;
wenzelm@28317
   202
wenzelm@29093
   203
wenzelm@29093
   204
(* names *)
wenzelm@29093
   205
wenzelm@29093
   206
val PureN = "Pure";
wenzelm@29093
   207
val draftN = "#";
wenzelm@16436
   208
wenzelm@29093
   209
fun display_names thy =
wenzelm@29093
   210
  let
wenzelm@29093
   211
    val draft = if is_draft thy then [draftN] else [];
wenzelm@29093
   212
    val name =
wenzelm@29093
   213
      (case #stage (history_of thy) of
wenzelm@29093
   214
        ~1 => theory_name thy
wenzelm@29093
   215
      | n => theory_name thy ^ ":" ^ string_of_int n);
wenzelm@29093
   216
    val ancestor_names = map theory_name (ancestors_of thy);
wenzelm@29093
   217
    val stale = if is_stale thy then ["!"] else [];
wenzelm@29093
   218
  in rev (stale @ draft @ [name] @ ancestor_names) end;
wenzelm@29069
   219
wenzelm@29093
   220
val pretty_thy = Pretty.str_list "{" "}" o display_names;
wenzelm@16436
   221
val string_of_thy = Pretty.string_of o pretty_thy;
wenzelm@16436
   222
val pprint_thy = Pretty.pprint o pretty_thy;
wenzelm@16436
   223
wenzelm@16436
   224
fun pretty_abbrev_thy thy =
wenzelm@16436
   225
  let
wenzelm@29093
   226
    val names = display_names thy;
wenzelm@16436
   227
    val n = length names;
wenzelm@16436
   228
    val abbrev = if n > 5 then "..." :: List.drop (names, n - 5) else names;
wenzelm@16436
   229
  in Pretty.str_list "{" "}" abbrev end;
wenzelm@16436
   230
wenzelm@16436
   231
val str_of_thy = Pretty.str_of o pretty_abbrev_thy;
wenzelm@16436
   232
wenzelm@16436
   233
wenzelm@24141
   234
(* theory references *)
wenzelm@24141
   235
wenzelm@24141
   236
(*theory_ref provides a safe way to store dynamic references to a
wenzelm@24141
   237
  theory in external data structures -- a plain theory value would
wenzelm@24141
   238
  become stale as the self reference moves on*)
wenzelm@24141
   239
wenzelm@24141
   240
datatype theory_ref = TheoryRef of theory ref;
wenzelm@16436
   241
wenzelm@24141
   242
fun deref (TheoryRef (ref thy)) = thy;
wenzelm@24141
   243
wenzelm@24141
   244
fun check_thy thy =  (*thread-safe version*)
wenzelm@24141
   245
  let val thy_ref = TheoryRef (the_self thy) in
wenzelm@24141
   246
    if is_stale thy then error ("Stale theory encountered:\n" ^ string_of_thy thy)
wenzelm@24141
   247
    else thy_ref
wenzelm@24141
   248
  end;
wenzelm@24141
   249
wenzelm@27341
   250
val pprint_thy_ref = Pretty.pprint o pretty_thy o deref;
wenzelm@27341
   251
wenzelm@24141
   252
wenzelm@29093
   253
(* build ids *)
wenzelm@29093
   254
wenzelm@29093
   255
fun insert_id draft id ids =
wenzelm@29093
   256
  if draft then ids
wenzelm@29093
   257
  else Inttab.update (id, ()) ids;
wenzelm@16436
   258
wenzelm@29093
   259
fun merge_ids
wenzelm@29093
   260
    (Theory ({draft = draft1, id = id1, ids = ids1, ...}, _, _, _))
wenzelm@29093
   261
    (Theory ({draft = draft2, id = id2, ids = ids2, ...}, _, _, _)) =
wenzelm@29093
   262
  Inttab.merge (K true) (ids1, ids2)
wenzelm@29093
   263
  |> insert_id draft1 id1
wenzelm@29093
   264
  |> insert_id draft2 id2;
wenzelm@16436
   265
wenzelm@16436
   266
wenzelm@16533
   267
(* equality and inclusion *)
wenzelm@16533
   268
wenzelm@24141
   269
val eq_thy = eq_id o pairself (#id o identity_of);
wenzelm@16533
   270
wenzelm@29069
   271
fun proper_subthy (Theory ({id, ...}, _, _, _), Theory ({ids, ...}, _, _, _)) =
wenzelm@29093
   272
  Inttab.defined ids id;
wenzelm@16533
   273
wenzelm@16533
   274
fun subthy thys = eq_thy thys orelse proper_subthy thys;
wenzelm@16533
   275
wenzelm@16594
   276
fun joinable (thy1, thy2) = subthy (thy1, thy2) orelse subthy (thy2, thy1);
wenzelm@16594
   277
wenzelm@16533
   278
wenzelm@29093
   279
(* consistent ancestors *)
wenzelm@29093
   280
wenzelm@29093
   281
fun extend_ancestors thy thys =
wenzelm@29093
   282
  if member eq_thy thys thy then raise THEORY ("Duplicate theory node", thy :: thys)
wenzelm@29093
   283
  else thy :: thys;
wenzelm@29093
   284
wenzelm@29093
   285
fun extend_ancestors_of thy = extend_ancestors thy (ancestors_of thy);
wenzelm@29093
   286
wenzelm@29093
   287
val merge_ancestors = merge (fn (thy1, thy2) =>
wenzelm@29093
   288
  eq_thy (thy1, thy2) orelse
wenzelm@29093
   289
    theory_name thy1 = theory_name thy2 andalso
wenzelm@29093
   290
      raise THEORY ("Inconsistent theory versions", [thy1, thy2]));
wenzelm@29093
   291
wenzelm@29093
   292
wenzelm@23355
   293
(* trivial merge *)
wenzelm@16436
   294
wenzelm@16436
   295
fun merge (thy1, thy2) =
wenzelm@16719
   296
  if eq_thy (thy1, thy2) then thy1
wenzelm@16719
   297
  else if proper_subthy (thy2, thy1) then thy1
wenzelm@16719
   298
  else if proper_subthy (thy1, thy2) then thy2
wenzelm@29093
   299
  else error (cat_lines ["Attempt to perform non-trivial merge of theories:",
wenzelm@29093
   300
    str_of_thy thy1, str_of_thy thy2]);
wenzelm@16436
   301
wenzelm@16719
   302
fun merge_refs (ref1, ref2) =
wenzelm@16719
   303
  if ref1 = ref2 then ref1
wenzelm@24141
   304
  else check_thy (merge (deref ref1, deref ref2));
wenzelm@16436
   305
wenzelm@16436
   306
wenzelm@16489
   307
wenzelm@16489
   308
(** build theories **)
wenzelm@16489
   309
wenzelm@16489
   310
(* primitives *)
wenzelm@16489
   311
wenzelm@29093
   312
fun create_thy self draft ids data ancestry history =
wenzelm@29093
   313
  let val identity = make_identity self draft (serial ()) ids;
wenzelm@29093
   314
  in vitalize (Theory (identity, data, ancestry, history)) end;
wenzelm@16436
   315
wenzelm@29093
   316
fun change_thy draft' f thy =
wenzelm@16489
   317
  let
wenzelm@29093
   318
    val Theory ({self, draft, id, ids}, data, ancestry, history) = thy;
wenzelm@16489
   319
    val (self', data', ancestry') =
wenzelm@29093
   320
      if draft then (self, data, ancestry)    (*destructive change!*)
wenzelm@29093
   321
      else if #stage history > 0
wenzelm@22847
   322
      then (NONE, copy_data data, ancestry)
wenzelm@29093
   323
      else (NONE, extend_data data, make_ancestry [thy] (extend_ancestors_of thy));
wenzelm@29093
   324
    val ids' = insert_id draft id ids;
wenzelm@16489
   325
    val data'' = f data';
wenzelm@24369
   326
    val thy' = NAMED_CRITICAL "theory" (fn () =>
wenzelm@29093
   327
      (check_thy thy; create_thy self' draft' ids' data'' ancestry' history));
wenzelm@24369
   328
  in thy' end;
wenzelm@16489
   329
wenzelm@29093
   330
val name_thy = change_thy false I;
wenzelm@29093
   331
val extend_thy = change_thy true I;
wenzelm@29093
   332
val modify_thy = change_thy true;
wenzelm@16489
   333
wenzelm@24369
   334
fun copy_thy thy =
wenzelm@24141
   335
  let
wenzelm@29093
   336
    val Theory ({draft, id, ids, ...}, data, ancestry, history) = thy;
wenzelm@29093
   337
    val ids' = insert_id draft id ids;
wenzelm@24369
   338
    val data' = copy_data data;
wenzelm@24369
   339
    val thy' = NAMED_CRITICAL "theory" (fn () =>
wenzelm@29093
   340
      (check_thy thy; create_thy NONE true ids' data' ancestry history));
wenzelm@24369
   341
  in thy' end;
wenzelm@16489
   342
wenzelm@29093
   343
val pre_pure_thy = create_thy NONE true Inttab.empty
wenzelm@29069
   344
  Datatab.empty (make_ancestry [] []) (make_history PureN 0);
wenzelm@16489
   345
wenzelm@16489
   346
wenzelm@16489
   347
(* named theory nodes *)
wenzelm@16489
   348
wenzelm@16489
   349
fun merge_thys pp (thy1, thy2) =
wenzelm@26957
   350
  let
wenzelm@29093
   351
    val ids = merge_ids thy1 thy2;
wenzelm@26957
   352
    val data = merge_data (pp thy1) (data_of thy1, data_of thy2);
wenzelm@26957
   353
    val ancestry = make_ancestry [] [];
wenzelm@29069
   354
    val history = make_history "" 0;
wenzelm@26957
   355
    val thy' = NAMED_CRITICAL "theory" (fn () =>
wenzelm@29093
   356
     (check_thy thy1; check_thy thy2; create_thy NONE true ids data ancestry history));
wenzelm@26957
   357
  in thy' end;
wenzelm@16489
   358
wenzelm@16533
   359
fun maximal_thys thys =
wenzelm@28617
   360
  thys |> filter_out (fn thy => exists (fn thy' => proper_subthy (thy, thy')) thys);
wenzelm@16533
   361
wenzelm@16489
   362
fun begin_thy pp name imports =
wenzelm@29093
   363
  if name = "" orelse name = draftN then error ("Bad theory name: " ^ quote name)
wenzelm@24369
   364
  else
wenzelm@16489
   365
    let
wenzelm@24141
   366
      val parents = maximal_thys (distinct eq_thy imports);
wenzelm@29093
   367
      val ancestors =
wenzelm@29093
   368
        Library.foldl merge_ancestors ([], map ancestors_of parents)
wenzelm@29093
   369
        |> fold extend_ancestors parents;
wenzelm@29093
   370
wenzelm@29093
   371
      val Theory ({ids, ...}, data, _, _) =
wenzelm@16489
   372
        (case parents of
wenzelm@16489
   373
          [] => error "No parent theories"
wenzelm@16533
   374
        | [thy] => extend_thy thy
wenzelm@16533
   375
        | thy :: thys => Library.foldl (merge_thys pp) (thy, thys));
wenzelm@29093
   376
wenzelm@16489
   377
      val ancestry = make_ancestry parents ancestors;
wenzelm@29069
   378
      val history = make_history name 0;
wenzelm@24369
   379
      val thy' = NAMED_CRITICAL "theory" (fn () =>
wenzelm@29093
   380
        (map check_thy imports; create_thy NONE true ids data ancestry history));
wenzelm@24369
   381
    in thy' end;
wenzelm@16436
   382
wenzelm@16436
   383
wenzelm@29093
   384
(* history stages *)
wenzelm@29093
   385
wenzelm@29093
   386
fun history_stage f thy =
wenzelm@29093
   387
  let
wenzelm@29093
   388
    val {name, stage} = history_of thy;
wenzelm@29093
   389
    val _ = stage = ~1 andalso raise THEORY ("Theory already finished", [thy]);
wenzelm@29093
   390
    val history' = make_history name (f stage);
wenzelm@29093
   391
    val thy' as Theory (identity', data', ancestry', _) = name_thy thy;
wenzelm@29093
   392
    val thy'' = NAMED_CRITICAL "theory" (fn () =>
wenzelm@29093
   393
      (check_thy thy'; vitalize (Theory (identity', data', ancestry', history'))));
wenzelm@29093
   394
  in thy'' end;
wenzelm@16436
   395
wenzelm@16489
   396
fun checkpoint_thy thy =
wenzelm@29093
   397
  if is_draft thy then history_stage (fn stage => stage + 1) thy
wenzelm@29093
   398
  else thy;
wenzelm@16489
   399
wenzelm@29093
   400
val finish_thy = history_stage (fn _ => ~1);
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@28122
   517
  (case Thread.getLocal 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@28122
   526
fun set_thread_data context = Thread.setLocal (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;