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