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