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