src/Pure/context.ML
author wenzelm
Thu Mar 27 14:41:14 2008 +0100 (2008-03-27)
changeset 26428 5b2beca2087d
parent 26421 3dfb36923a56
child 26435 bdce320cd426
permissions -rw-r--r--
eliminated theory ProtoPure;
implicit setup of emerging theory Pure;
added >>> operator;
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@16436
    27
  val draftN: string
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@18731
    60
  val theory_map: (generic -> generic) -> theory -> theory
wenzelm@18731
    61
  val proof_map: (generic -> generic) -> proof -> proof
wenzelm@18665
    62
  val theory_of: generic -> theory   (*total*)
wenzelm@18665
    63
  val proof_of: generic -> proof     (*total*)
wenzelm@26413
    64
  (*thread data*)
wenzelm@26413
    65
  val thread_data: unit -> generic option
wenzelm@26413
    66
  val the_thread_data: unit -> generic
wenzelm@26413
    67
  val set_thread_data: generic option -> unit
wenzelm@26413
    68
  val setmp_thread_data: generic option -> ('a -> 'b) -> 'a -> 'b
wenzelm@26413
    69
  val >> : (theory -> theory) -> unit
wenzelm@26428
    70
  val >>> : (theory -> 'a * theory) -> 'a
wenzelm@22095
    71
  (*delayed setup*)
wenzelm@22085
    72
  val add_setup: (theory -> theory) -> unit
wenzelm@22085
    73
  val setup: unit -> theory -> theory
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
val CPureN = "CPure";
wenzelm@16436
   202
wenzelm@16436
   203
val draftN = "#";
wenzelm@16436
   204
fun draft_id (_, name) = (name = draftN);
wenzelm@16436
   205
val is_draft = draft_id o #id o identity_of;
wenzelm@16436
   206
wenzelm@20821
   207
fun exists_name name (thy as Theory ({id, ids, iids, ...}, _, _, _)) =
wenzelm@20821
   208
  name = theory_name thy orelse
wenzelm@16489
   209
  name = #2 id orelse
wenzelm@16489
   210
  Inttab.exists (equal name o #2) ids orelse
wenzelm@16489
   211
  Inttab.exists (equal name o #2) iids;
wenzelm@16436
   212
wenzelm@16489
   213
fun names_of (Theory ({id, ids, iids, ...}, _, _, _)) =
wenzelm@16489
   214
  rev (#2 id :: Inttab.fold (cons o #2) iids (Inttab.fold (cons o #2) ids []));
wenzelm@16436
   215
wenzelm@16436
   216
fun pretty_thy thy =
wenzelm@16436
   217
  Pretty.str_list "{" "}" (names_of thy @ (if is_stale thy then ["!"] else []));
wenzelm@16436
   218
wenzelm@16436
   219
val string_of_thy = Pretty.string_of o pretty_thy;
wenzelm@16436
   220
val pprint_thy = Pretty.pprint o pretty_thy;
wenzelm@16436
   221
wenzelm@16436
   222
fun pretty_abbrev_thy thy =
wenzelm@16436
   223
  let
wenzelm@16436
   224
    val names = names_of thy;
wenzelm@16436
   225
    val n = length names;
wenzelm@16436
   226
    val abbrev = if n > 5 then "..." :: List.drop (names, n - 5) else names;
wenzelm@16436
   227
  in Pretty.str_list "{" "}" abbrev end;
wenzelm@16436
   228
wenzelm@16436
   229
val str_of_thy = Pretty.str_of o pretty_abbrev_thy;
wenzelm@16436
   230
wenzelm@16436
   231
wenzelm@24141
   232
(* theory references *)
wenzelm@24141
   233
wenzelm@24141
   234
(*theory_ref provides a safe way to store dynamic references to a
wenzelm@24141
   235
  theory in external data structures -- a plain theory value would
wenzelm@24141
   236
  become stale as the self reference moves on*)
wenzelm@24141
   237
wenzelm@24141
   238
datatype theory_ref = TheoryRef of theory ref;
wenzelm@16436
   239
wenzelm@24141
   240
fun deref (TheoryRef (ref thy)) = thy;
wenzelm@24141
   241
wenzelm@24141
   242
fun check_thy thy =  (*thread-safe version*)
wenzelm@24141
   243
  let val thy_ref = TheoryRef (the_self thy) in
wenzelm@24141
   244
    if is_stale thy then error ("Stale theory encountered:\n" ^ string_of_thy thy)
wenzelm@24141
   245
    else thy_ref
wenzelm@24141
   246
  end;
wenzelm@24141
   247
wenzelm@24141
   248
wenzelm@24141
   249
(* consistency *)
wenzelm@16436
   250
wenzelm@16489
   251
fun check_ins id ids =
wenzelm@16894
   252
  if draft_id id orelse Inttab.defined ids (#1 id) then ids
wenzelm@16436
   253
  else if Inttab.exists (equal (#2 id) o #2) ids then
wenzelm@23355
   254
    error ("Different versions of theory component " ^ quote (#2 id))
wenzelm@17412
   255
  else Inttab.update id ids;
wenzelm@16436
   256
wenzelm@16489
   257
fun check_insert intermediate id (ids, iids) =
wenzelm@16489
   258
  let val ids' = check_ins id ids and iids' = check_ins id iids
wenzelm@16489
   259
  in if intermediate then (ids, iids') else (ids', iids) end;
wenzelm@16489
   260
wenzelm@16489
   261
fun check_merge
wenzelm@16489
   262
    (Theory ({id = id1, ids = ids1, iids = iids1, ...}, _, _, history1))
wenzelm@16489
   263
    (Theory ({id = id2, ids = ids2, iids = iids2, ...}, _, _, history2)) =
wenzelm@16489
   264
  (Inttab.fold check_ins ids2 ids1, Inttab.fold check_ins iids2 iids1)
wenzelm@16489
   265
  |> check_insert (#version history1 > 0) id1
wenzelm@16489
   266
  |> check_insert (#version history2 > 0) id2;
wenzelm@16436
   267
wenzelm@16436
   268
wenzelm@16533
   269
(* equality and inclusion *)
wenzelm@16533
   270
wenzelm@24141
   271
val eq_thy = eq_id o pairself (#id o identity_of);
wenzelm@16533
   272
wenzelm@16533
   273
fun proper_subthy
wenzelm@16719
   274
    (Theory ({id = (i, _), ...}, _, _, _), Theory ({ids, iids, ...}, _, _, _)) =
wenzelm@16894
   275
  Inttab.defined ids i orelse Inttab.defined iids i;
wenzelm@16533
   276
wenzelm@16533
   277
fun subthy thys = eq_thy thys orelse proper_subthy thys;
wenzelm@16533
   278
wenzelm@16594
   279
fun joinable (thy1, thy2) = subthy (thy1, thy2) orelse subthy (thy2, thy1);
wenzelm@16594
   280
wenzelm@16533
   281
wenzelm@23355
   282
(* trivial merge *)
wenzelm@16436
   283
wenzelm@16436
   284
fun merge (thy1, thy2) =
wenzelm@16719
   285
  if eq_thy (thy1, thy2) then thy1
wenzelm@16719
   286
  else if proper_subthy (thy2, thy1) then thy1
wenzelm@16719
   287
  else if proper_subthy (thy1, thy2) then thy2
wenzelm@16436
   288
  else (check_merge thy1 thy2;
wenzelm@23355
   289
    error (cat_lines ["Attempt to perform non-trivial merge of theories:",
wenzelm@23355
   290
      str_of_thy thy1, str_of_thy thy2]));
wenzelm@16436
   291
wenzelm@16719
   292
fun merge_refs (ref1, ref2) =
wenzelm@16719
   293
  if ref1 = ref2 then ref1
wenzelm@24141
   294
  else check_thy (merge (deref ref1, deref ref2));
wenzelm@16436
   295
wenzelm@16436
   296
wenzelm@16489
   297
wenzelm@16489
   298
(** build theories **)
wenzelm@16489
   299
wenzelm@16489
   300
(* primitives *)
wenzelm@16489
   301
wenzelm@16489
   302
fun create_thy name self id ids iids data ancestry history =
wenzelm@16489
   303
  let
wenzelm@17756
   304
    val {version, name = _, intermediates = _} = history;
wenzelm@17756
   305
    val intermediate = version > 0;
wenzelm@16489
   306
    val (ids', iids') = check_insert intermediate id (ids, iids);
wenzelm@16489
   307
    val id' = (serial (), name);
wenzelm@16489
   308
    val _ = check_insert intermediate id' (ids', iids');
wenzelm@16489
   309
    val identity' = make_identity self id' ids' iids';
wenzelm@16489
   310
  in vitalize (Theory (identity', data, ancestry, history)) end;
wenzelm@16436
   311
wenzelm@24369
   312
fun change_thy name f thy =
wenzelm@16489
   313
  let
wenzelm@24141
   314
    val Theory ({self, id, ids, iids}, data, ancestry, history) = thy;
wenzelm@16489
   315
    val (self', data', ancestry') =
wenzelm@16489
   316
      if is_draft thy then (self, data, ancestry)    (*destructive change!*)
wenzelm@16489
   317
      else if #version history > 0
wenzelm@22847
   318
      then (NONE, copy_data data, ancestry)
wenzelm@24369
   319
      else (NONE, extend_data data, make_ancestry [thy] (thy :: #ancestors ancestry));
wenzelm@16489
   320
    val data'' = f data';
wenzelm@24369
   321
    val thy' = NAMED_CRITICAL "theory" (fn () =>
wenzelm@24369
   322
      (check_thy thy; create_thy name self' id ids iids data'' ancestry' history));
wenzelm@24369
   323
  in thy' end;
wenzelm@16489
   324
wenzelm@16489
   325
fun name_thy name = change_thy name I;
wenzelm@16489
   326
val modify_thy = change_thy draftN;
wenzelm@16489
   327
val extend_thy = modify_thy I;
wenzelm@16489
   328
wenzelm@24369
   329
fun copy_thy thy =
wenzelm@24141
   330
  let
wenzelm@24141
   331
    val Theory ({id, ids, iids, ...}, data, ancestry, history) = thy;
wenzelm@24369
   332
    val data' = copy_data data;
wenzelm@24369
   333
    val thy' = NAMED_CRITICAL "theory" (fn () =>
wenzelm@24369
   334
      (check_thy thy; create_thy draftN NONE id ids iids data' ancestry history));
wenzelm@24369
   335
  in thy' end;
wenzelm@16489
   336
wenzelm@16489
   337
val pre_pure_thy = create_thy draftN NONE (serial (), draftN) Inttab.empty Inttab.empty
wenzelm@26428
   338
  Datatab.empty (make_ancestry [] []) (make_history PureN 0 []);
wenzelm@16489
   339
wenzelm@16489
   340
wenzelm@16489
   341
(* named theory nodes *)
wenzelm@16489
   342
wenzelm@16489
   343
fun merge_thys pp (thy1, thy2) =
wenzelm@16533
   344
  if exists_name CPureN thy1 <> exists_name CPureN thy2 then
wenzelm@16436
   345
    error "Cannot merge Pure and CPure developments"
wenzelm@24369
   346
  else
wenzelm@16436
   347
    let
wenzelm@16489
   348
      val (ids, iids) = check_merge thy1 thy2;
wenzelm@22847
   349
      val data = merge_data (pp thy1) (data_of thy1, data_of thy2);
wenzelm@16489
   350
      val ancestry = make_ancestry [] [];
wenzelm@16436
   351
      val history = make_history "" 0 [];
wenzelm@24369
   352
      val thy' = NAMED_CRITICAL "theory" (fn () =>
wenzelm@24369
   353
       (check_thy thy1; check_thy thy2;
wenzelm@24369
   354
        create_thy draftN NONE (serial (), draftN) ids iids data ancestry history))
wenzelm@24369
   355
    in thy' end;
wenzelm@16489
   356
wenzelm@16533
   357
fun maximal_thys thys =
wenzelm@16533
   358
  thys |> filter (fn thy => not (exists (fn thy' => proper_subthy (thy, thy')) thys));
wenzelm@16533
   359
wenzelm@16489
   360
fun begin_thy pp name imports =
wenzelm@16489
   361
  if name = draftN then error ("Illegal theory name: " ^ quote draftN)
wenzelm@24369
   362
  else
wenzelm@16489
   363
    let
wenzelm@24141
   364
      val parents = maximal_thys (distinct eq_thy imports);
wenzelm@22603
   365
      val ancestors = distinct eq_thy (parents @ maps ancestors_of parents);
wenzelm@16489
   366
      val Theory ({id, ids, iids, ...}, data, _, _) =
wenzelm@16489
   367
        (case parents of
wenzelm@16489
   368
          [] => error "No parent theories"
wenzelm@16533
   369
        | [thy] => extend_thy thy
wenzelm@16533
   370
        | thy :: thys => Library.foldl (merge_thys pp) (thy, thys));
wenzelm@16489
   371
      val ancestry = make_ancestry parents ancestors;
wenzelm@16489
   372
      val history = make_history name 0 [];
wenzelm@24369
   373
      val thy' = NAMED_CRITICAL "theory" (fn () =>
wenzelm@24369
   374
        (map check_thy imports; create_thy draftN NONE id ids iids data ancestry history));
wenzelm@24369
   375
    in thy' end;
wenzelm@16436
   376
wenzelm@16436
   377
wenzelm@16489
   378
(* undoable checkpoints *)
wenzelm@16436
   379
wenzelm@16489
   380
fun checkpoint_thy thy =
wenzelm@16489
   381
  if not (is_draft thy) then thy
wenzelm@24369
   382
  else
wenzelm@16436
   383
    let
wenzelm@16489
   384
      val {name, version, intermediates} = history_of thy;
wenzelm@16489
   385
      val thy' as Theory (identity', data', ancestry', _) =
wenzelm@16489
   386
        name_thy (name ^ ":" ^ string_of_int version) thy;
wenzelm@16489
   387
      val history' = make_history name (version + 1) (thy' :: intermediates);
wenzelm@24369
   388
      val thy'' = NAMED_CRITICAL "theory" (fn () =>
wenzelm@24369
   389
        (check_thy thy'; vitalize (Theory (identity', data', ancestry', history'))));
wenzelm@24369
   390
    in thy'' end;
wenzelm@16489
   391
wenzelm@24141
   392
fun finish_thy thy = NAMED_CRITICAL "theory" (fn () =>
wenzelm@16489
   393
  let
wenzelm@16489
   394
    val {name, version, intermediates} = history_of thy;
wenzelm@24141
   395
    val rs = map ((fn TheoryRef r => r) o check_thy) intermediates;
wenzelm@16489
   396
    val thy' as Theory ({self, id, ids, ...}, data', ancestry', _) = name_thy name thy;
wenzelm@16489
   397
    val identity' = make_identity self id ids Inttab.empty;
wenzelm@16489
   398
    val history' = make_history name 0 [];
wenzelm@16489
   399
    val thy'' = vitalize (Theory (identity', data', ancestry', history'));
wenzelm@16533
   400
    val _ = List.app (fn r => r := thy'') rs;
wenzelm@24141
   401
  in thy'' end);
wenzelm@16489
   402
wenzelm@16489
   403
wenzelm@16489
   404
(* theory data *)
wenzelm@16436
   405
wenzelm@16489
   406
structure TheoryData =
wenzelm@16489
   407
struct
wenzelm@16489
   408
wenzelm@16489
   409
val declare = declare_theory_data;
wenzelm@16489
   410
wenzelm@16489
   411
fun get k dest thy =
wenzelm@22847
   412
  dest ((case Datatab.lookup (data_of thy) k of
wenzelm@22847
   413
    SOME x => x
wenzelm@22847
   414
  | NONE => invoke_copy k (invoke_empty k)));   (*adhoc value*)
wenzelm@16489
   415
wenzelm@22847
   416
fun put k mk x = modify_thy (Datatab.update (k, mk x));
wenzelm@16489
   417
wenzelm@16489
   418
end;
wenzelm@16436
   419
wenzelm@16436
   420
wenzelm@16436
   421
wenzelm@16533
   422
(*** proof context ***)
wenzelm@16533
   423
wenzelm@16533
   424
(* datatype proof *)
wenzelm@16533
   425
wenzelm@24184
   426
datatype proof = Prf of Object.T Datatab.table * theory_ref;
wenzelm@17060
   427
wenzelm@24184
   428
fun theory_of_proof (Prf (_, thy_ref)) = deref thy_ref;
wenzelm@24184
   429
fun data_of_proof (Prf (data, _)) = data;
wenzelm@24184
   430
fun map_prf f (Prf (data, thy_ref)) = Prf (f data, thy_ref);
wenzelm@17060
   431
wenzelm@16533
   432
wenzelm@16533
   433
(* proof data kinds *)
wenzelm@16533
   434
wenzelm@16533
   435
local
wenzelm@16533
   436
wenzelm@22847
   437
val kinds = ref (Datatab.empty: (theory -> Object.T) Datatab.table);
wenzelm@16533
   438
wenzelm@22847
   439
fun invoke_init k =
wenzelm@19028
   440
  (case Datatab.lookup (! kinds) k of
wenzelm@22847
   441
    SOME init => init
wenzelm@22847
   442
  | NONE => sys_error "Invalid proof data identifier");
wenzelm@16533
   443
wenzelm@22847
   444
fun init_data thy =
wenzelm@22847
   445
  Datatab.map' (fn k => fn _ => invoke_init k thy) (! kinds);
wenzelm@22847
   446
wenzelm@22847
   447
fun init_new_data data thy =
wenzelm@22847
   448
  Datatab.merge (K true) (data, init_data thy);
wenzelm@16533
   449
wenzelm@16533
   450
in
wenzelm@16533
   451
wenzelm@24184
   452
fun init_proof thy = Prf (init_data thy, check_thy thy);
wenzelm@16533
   453
wenzelm@24184
   454
fun transfer_proof thy' (prf as Prf (data, thy_ref)) =
wenzelm@24141
   455
  let
wenzelm@24141
   456
    val thy = deref thy_ref;
wenzelm@24141
   457
    val _ = subthy (thy, thy') orelse error "transfer proof context: not a super theory";
wenzelm@24141
   458
    val _ = check_thy thy;
wenzelm@24184
   459
    val data' = init_new_data data thy';
wenzelm@24141
   460
    val thy_ref' = check_thy thy';
wenzelm@24184
   461
  in Prf (data', thy_ref') end;
wenzelm@22847
   462
wenzelm@16533
   463
wenzelm@16533
   464
structure ProofData =
wenzelm@16533
   465
struct
wenzelm@16533
   466
wenzelm@22847
   467
fun declare init =
wenzelm@16533
   468
  let
wenzelm@16533
   469
    val k = serial ();
wenzelm@23944
   470
    val _ = CRITICAL (fn () => change kinds (Datatab.update (k, init)));
wenzelm@16533
   471
  in k end;
wenzelm@16533
   472
wenzelm@16533
   473
fun get k dest prf =
wenzelm@22847
   474
  dest (case Datatab.lookup (data_of_proof prf) k of
wenzelm@22847
   475
    SOME x => x
wenzelm@22847
   476
  | NONE => invoke_init k (theory_of_proof prf));   (*adhoc value*)
wenzelm@16533
   477
wenzelm@19028
   478
fun put k mk x = map_prf (Datatab.update (k, mk x));
wenzelm@16533
   479
wenzelm@16533
   480
end;
wenzelm@16533
   481
wenzelm@16533
   482
end;
wenzelm@16533
   483
wenzelm@16533
   484
wenzelm@18632
   485
wenzelm@16533
   486
(*** generic context ***)
wenzelm@16533
   487
wenzelm@18632
   488
datatype generic = Theory of theory | Proof of proof;
wenzelm@18632
   489
wenzelm@18632
   490
fun cases f _ (Theory thy) = f thy
wenzelm@18632
   491
  | cases _ g (Proof prf) = g prf;
wenzelm@16533
   492
wenzelm@19678
   493
fun mapping f g = cases (Theory o f) (Proof o g);
wenzelm@21660
   494
fun mapping_result f g = cases (apsnd Theory o f) (apsnd Proof o g);
wenzelm@19678
   495
wenzelm@23595
   496
val the_theory = cases I (fn _ => error "Ill-typed context: theory expected");
wenzelm@23595
   497
val the_proof = cases (fn _ => error "Ill-typed context: proof expected") I;
wenzelm@16533
   498
wenzelm@18731
   499
fun map_theory f = Theory o f o the_theory;
wenzelm@18731
   500
fun map_proof f = Proof o f o the_proof;
wenzelm@18731
   501
wenzelm@18731
   502
fun theory_map f = the_theory o f o Theory;
wenzelm@18731
   503
fun proof_map f = the_proof o f o Proof;
wenzelm@18665
   504
wenzelm@18632
   505
val theory_of = cases I theory_of_proof;
wenzelm@18632
   506
val proof_of = cases init_proof I;
wenzelm@16533
   507
wenzelm@22085
   508
wenzelm@22085
   509
wenzelm@26413
   510
(** thread data **)
wenzelm@26413
   511
wenzelm@26413
   512
local val tag = Universal.tag () : generic option Universal.tag in
wenzelm@26413
   513
wenzelm@26413
   514
fun thread_data () =
wenzelm@26413
   515
  (case Multithreading.get_data tag of
wenzelm@26413
   516
    SOME (SOME context) => SOME context
wenzelm@26413
   517
  | _ => NONE);
wenzelm@26413
   518
wenzelm@26413
   519
fun the_thread_data () =
wenzelm@26413
   520
  (case thread_data () of
wenzelm@26413
   521
    SOME context => context
wenzelm@26413
   522
  | _ => error "Unknown context");
wenzelm@26413
   523
wenzelm@26413
   524
fun set_thread_data context = Multithreading.put_data (tag, context);
wenzelm@26413
   525
fun setmp_thread_data context = Library.setmp_thread_data tag (thread_data ()) context;
wenzelm@26413
   526
wenzelm@26428
   527
end;
wenzelm@26428
   528
wenzelm@26428
   529
fun >>> f =
wenzelm@26428
   530
  let
wenzelm@26428
   531
    val (res, thy') = f (the_theory (the_thread_data ()));
wenzelm@26428
   532
    val _ = set_thread_data (SOME (Theory thy'));
wenzelm@26428
   533
  in res end;
wenzelm@26428
   534
wenzelm@26421
   535
nonfix >>;
wenzelm@26428
   536
fun >> f = >>> (fn thy => ((), f thy));
wenzelm@26413
   537
wenzelm@26428
   538
val _ = set_thread_data (SOME (Theory pre_pure_thy));
wenzelm@26413
   539
wenzelm@26413
   540
wenzelm@26413
   541
wenzelm@22095
   542
(** delayed theory setup **)
wenzelm@22085
   543
wenzelm@22085
   544
local
wenzelm@22085
   545
  val setup_fn = ref (I: theory -> theory);
wenzelm@22085
   546
in
wenzelm@23944
   547
  fun add_setup f = CRITICAL (fn () => setup_fn := (! setup_fn #> f));
wenzelm@23944
   548
  fun setup () = CRITICAL (fn () => let val f = ! setup_fn in setup_fn := I; f end);
wenzelm@22085
   549
end;
wenzelm@22085
   550
wenzelm@6185
   551
end;
wenzelm@6185
   552
wenzelm@6185
   553
structure BasicContext: BASIC_CONTEXT = Context;
wenzelm@6185
   554
open BasicContext;
wenzelm@16436
   555
wenzelm@16436
   556
wenzelm@16436
   557
wenzelm@16533
   558
(*** type-safe interfaces for data declarations ***)
wenzelm@16533
   559
wenzelm@16533
   560
(** theory data **)
wenzelm@16436
   561
wenzelm@16436
   562
signature THEORY_DATA_ARGS =
wenzelm@16436
   563
sig
wenzelm@16436
   564
  type T
wenzelm@16436
   565
  val empty: T
wenzelm@16436
   566
  val copy: T -> T
wenzelm@16436
   567
  val extend: T -> T
wenzelm@16436
   568
  val merge: Pretty.pp -> T * T -> T
wenzelm@16436
   569
end;
wenzelm@16436
   570
wenzelm@16436
   571
signature THEORY_DATA =
wenzelm@16436
   572
sig
wenzelm@16436
   573
  type T
wenzelm@16436
   574
  val get: theory -> T
wenzelm@16436
   575
  val put: T -> theory -> theory
wenzelm@16436
   576
  val map: (T -> T) -> theory -> theory
wenzelm@22847
   577
  val init: theory -> theory
wenzelm@16436
   578
end;
wenzelm@16436
   579
wenzelm@16436
   580
functor TheoryDataFun(Data: THEORY_DATA_ARGS): THEORY_DATA =
wenzelm@16436
   581
struct
wenzelm@16436
   582
wenzelm@16436
   583
structure TheoryData = Context.TheoryData;
wenzelm@16436
   584
wenzelm@16436
   585
type T = Data.T;
wenzelm@16436
   586
exception Data of T;
wenzelm@16436
   587
wenzelm@22847
   588
val kind = TheoryData.declare
wenzelm@16436
   589
  (Data Data.empty)
wenzelm@16436
   590
  (fn Data x => Data (Data.copy x))
wenzelm@16436
   591
  (fn Data x => Data (Data.extend x))
wenzelm@16489
   592
  (fn pp => fn (Data x1, Data x2) => Data (Data.merge pp (x1, x2)));
wenzelm@16436
   593
wenzelm@16436
   594
val get = TheoryData.get kind (fn Data x => x);
wenzelm@16436
   595
val put = TheoryData.put kind Data;
wenzelm@16436
   596
fun map f thy = put (f (get thy)) thy;
wenzelm@16436
   597
wenzelm@22847
   598
fun init thy = map I thy;
wenzelm@22847
   599
wenzelm@16436
   600
end;
wenzelm@16436
   601
wenzelm@16533
   602
wenzelm@16533
   603
wenzelm@16533
   604
(** proof data **)
wenzelm@16533
   605
wenzelm@16533
   606
signature PROOF_DATA_ARGS =
wenzelm@16533
   607
sig
wenzelm@16533
   608
  type T
wenzelm@16533
   609
  val init: theory -> T
wenzelm@16533
   610
end;
wenzelm@16533
   611
wenzelm@16533
   612
signature PROOF_DATA =
wenzelm@16533
   613
sig
wenzelm@16533
   614
  type T
wenzelm@16533
   615
  val get: Context.proof -> T
wenzelm@16533
   616
  val put: T -> Context.proof -> Context.proof
wenzelm@16533
   617
  val map: (T -> T) -> Context.proof -> Context.proof
wenzelm@16533
   618
end;
wenzelm@16533
   619
wenzelm@16533
   620
functor ProofDataFun(Data: PROOF_DATA_ARGS): PROOF_DATA =
wenzelm@16533
   621
struct
wenzelm@16533
   622
wenzelm@16533
   623
structure ProofData = Context.ProofData;
wenzelm@16533
   624
wenzelm@16533
   625
type T = Data.T;
wenzelm@16533
   626
exception Data of T;
wenzelm@16533
   627
wenzelm@22847
   628
val kind = ProofData.declare (Data o Data.init);
wenzelm@16533
   629
wenzelm@16533
   630
val get = ProofData.get kind (fn Data x => x);
wenzelm@16533
   631
val put = ProofData.put kind Data;
wenzelm@16533
   632
fun map f prf = put (f (get prf)) prf;
wenzelm@16533
   633
wenzelm@16533
   634
end;
wenzelm@16533
   635
wenzelm@18632
   636
wenzelm@18632
   637
wenzelm@18632
   638
(** generic data **)
wenzelm@18632
   639
wenzelm@18632
   640
signature GENERIC_DATA_ARGS =
wenzelm@18632
   641
sig
wenzelm@18632
   642
  type T
wenzelm@18632
   643
  val empty: T
wenzelm@18632
   644
  val extend: T -> T
wenzelm@18632
   645
  val merge: Pretty.pp -> T * T -> T
wenzelm@18632
   646
end;
wenzelm@18632
   647
wenzelm@18632
   648
signature GENERIC_DATA =
wenzelm@18632
   649
sig
wenzelm@18632
   650
  type T
wenzelm@18632
   651
  val get: Context.generic -> T
wenzelm@18632
   652
  val put: T -> Context.generic -> Context.generic
wenzelm@18632
   653
  val map: (T -> T) -> Context.generic -> Context.generic
wenzelm@18632
   654
end;
wenzelm@18632
   655
wenzelm@18632
   656
functor GenericDataFun(Data: GENERIC_DATA_ARGS): GENERIC_DATA =
wenzelm@18632
   657
struct
wenzelm@18632
   658
wenzelm@22847
   659
structure ThyData = TheoryDataFun(open Data val copy = I);
wenzelm@22847
   660
structure PrfData = ProofDataFun(type T = Data.T val init = ThyData.get);
wenzelm@18632
   661
wenzelm@18632
   662
type T = Data.T;
wenzelm@18632
   663
wenzelm@18632
   664
fun get (Context.Theory thy) = ThyData.get thy
wenzelm@18632
   665
  | get (Context.Proof prf) = PrfData.get prf;
wenzelm@18632
   666
wenzelm@18632
   667
fun put x (Context.Theory thy) = Context.Theory (ThyData.put x thy)
wenzelm@18632
   668
  | put x (Context.Proof prf) = Context.Proof (PrfData.put x prf);
wenzelm@18632
   669
wenzelm@18632
   670
fun map f ctxt = put (f (get ctxt)) ctxt;
wenzelm@18632
   671
wenzelm@18632
   672
end;
wenzelm@18632
   673
wenzelm@16533
   674
(*hide private interface*)
wenzelm@16436
   675
structure Context: CONTEXT = Context;
wenzelm@20297
   676
wenzelm@21518
   677
(*fake predeclarations*)
wenzelm@20297
   678
structure Proof = struct type context = Context.proof end;
wenzelm@21518
   679
structure ProofContext =
wenzelm@21518
   680
struct val theory_of = Context.theory_of_proof val init = Context.init_proof end;