src/Pure/theory.ML
author wenzelm
Wed Oct 15 15:18:41 1997 +0200 (1997-10-15)
changeset 3878 0258594baaa9
parent 3865 0035d1f97096
child 3885 dccac762b0be
permissions -rw-r--r--
remove merge_theories;
merge_list: always prepares extend -- no longer supports aliasing merges;
paulson@1526
     1
(*  Title:      Pure/theory.ML
paulson@1526
     2
    ID:         $Id$
paulson@1526
     3
    Author:     Lawrence C Paulson and Markus Wenzel
paulson@1526
     4
    Copyright   1996  University of Cambridge
paulson@1526
     5
wenzelm@3767
     6
Theories.
paulson@1526
     7
*)
paulson@1526
     8
wenzelm@3767
     9
(*this part made pervasive*)
wenzelm@3767
    10
signature BASIC_THEORY =
wenzelm@3767
    11
sig
paulson@1526
    12
  type theory
paulson@1526
    13
  exception THEORY of string * theory list
paulson@1526
    14
  val rep_theory        : theory ->
wenzelm@3814
    15
    {sign: Sign.sg,
wenzelm@3814
    16
      new_axioms: term Symtab.table,
wenzelm@3814
    17
      oracles: ((Sign.sg * exn -> term) * stamp) Symtab.table,
wenzelm@3814
    18
      parents: theory list}
paulson@1526
    19
  val sign_of           : theory -> Sign.sg
paulson@1526
    20
  val syn_of            : theory -> Syntax.syntax
paulson@1526
    21
  val stamps_of_thy     : theory -> string ref list
paulson@1526
    22
  val parents_of        : theory -> theory list
paulson@1526
    23
  val subthy            : theory * theory -> bool
paulson@1526
    24
  val eq_thy            : theory * theory -> bool
paulson@1526
    25
  val proto_pure_thy    : theory
paulson@1526
    26
  val pure_thy          : theory
paulson@1526
    27
  val cpure_thy         : theory
wenzelm@3767
    28
  val cert_axm          : Sign.sg -> string * term -> string * term
wenzelm@3767
    29
  val read_axm          : Sign.sg -> string * string -> string * term
wenzelm@3767
    30
  val inferT_axm        : Sign.sg -> string * term -> string * term
wenzelm@3767
    31
end
wenzelm@3767
    32
wenzelm@3767
    33
signature THEORY =
wenzelm@3767
    34
sig
wenzelm@3767
    35
  include BASIC_THEORY
wenzelm@3814
    36
  val thmK		: string
wenzelm@3814
    37
  val oracleK		: string
wenzelm@3767
    38
  (*theory extendsion primitives*)
wenzelm@3806
    39
  val add_classes	: (xclass * xclass list) list -> theory -> theory
wenzelm@3806
    40
  val add_classes_i	: (xclass * class list) list -> theory -> theory
wenzelm@3806
    41
  val add_classrel	: (xclass * xclass) list -> theory -> theory
wenzelm@3787
    42
  val add_classrel_i	: (class * class) list -> theory -> theory
wenzelm@3806
    43
  val add_defsort	: xsort -> theory -> theory
wenzelm@3787
    44
  val add_defsort_i	: sort -> theory -> theory
wenzelm@3806
    45
  val add_types		: (xstring * int * mixfix) list -> theory -> theory
wenzelm@3806
    46
  val add_tyabbrs	: (xstring * string list * string * mixfix) list
paulson@1526
    47
    -> theory -> theory
wenzelm@3806
    48
  val add_tyabbrs_i	: (xstring * string list * typ * mixfix) list
paulson@1526
    49
    -> theory -> theory
wenzelm@3806
    50
  val add_arities	: (xstring * xsort list * xsort) list -> theory -> theory
wenzelm@3787
    51
  val add_arities_i	: (string * sort list * sort) list -> theory -> theory
wenzelm@3806
    52
  val add_consts	: (xstring * string * mixfix) list -> theory -> theory
wenzelm@3806
    53
  val add_consts_i	: (xstring * typ * mixfix) list -> theory -> theory
wenzelm@3806
    54
  val add_syntax	: (xstring * string * mixfix) list -> theory -> theory
wenzelm@3806
    55
  val add_syntax_i	: (xstring * typ * mixfix) list -> theory -> theory
wenzelm@3806
    56
  val add_modesyntax	: string * bool -> (xstring * string * mixfix) list -> theory -> theory
wenzelm@3806
    57
  val add_modesyntax_i	: string * bool -> (xstring * typ * mixfix) list -> theory -> theory
paulson@1539
    58
  val add_trfuns	:
paulson@1526
    59
    (string * (Syntax.ast list -> Syntax.ast)) list *
paulson@1526
    60
    (string * (term list -> term)) list *
paulson@1526
    61
    (string * (term list -> term)) list *
paulson@1526
    62
    (string * (Syntax.ast list -> Syntax.ast)) list -> theory -> theory
wenzelm@2385
    63
  val add_trfunsT	:
wenzelm@2385
    64
    (string * (typ -> term list -> term)) list -> theory -> theory
wenzelm@2693
    65
  val add_tokentrfuns:
wenzelm@2693
    66
    (string * string * (string -> string * int)) list -> theory -> theory
paulson@1526
    67
  val add_trrules     : (string * string)Syntax.trrule list -> theory -> theory
paulson@1539
    68
  val add_trrules_i	: Syntax.ast Syntax.trrule list -> theory -> theory
wenzelm@3806
    69
  val add_axioms	: (xstring * string) list -> theory -> theory
wenzelm@3806
    70
  val add_axioms_i	: (xstring * term) list -> theory -> theory
wenzelm@3814
    71
  val add_oracle	: string * (Sign.sg * exn -> term) -> theory -> theory
wenzelm@3806
    72
  val add_defs		: (xstring * string) list -> theory -> theory
wenzelm@3806
    73
  val add_defs_i	: (xstring * term) list -> theory -> theory
wenzelm@3787
    74
  val add_path		: string -> theory -> theory
wenzelm@3814
    75
  val add_space		: string * string list -> theory -> theory
wenzelm@3767
    76
  val add_name		: string -> theory -> theory
wenzelm@3878
    77
  val init_data		: string * exn * (exn -> exn) * (exn * exn -> exn) *
wenzelm@3878
    78
    (string -> exn -> unit) -> theory -> theory
wenzelm@3865
    79
  val get_data		: theory -> string -> exn
wenzelm@3865
    80
  val put_data		: string * exn -> theory -> theory
wenzelm@3878
    81
  val merge_list	: theory list -> theory
paulson@1526
    82
end;
paulson@1526
    83
paulson@1526
    84
wenzelm@3767
    85
structure Theory: THEORY =
paulson@1526
    86
struct
wenzelm@2206
    87
wenzelm@2206
    88
(** datatype theory **)
paulson@1526
    89
paulson@1526
    90
datatype theory =
paulson@1526
    91
  Theory of {
paulson@1526
    92
    sign: Sign.sg,
paulson@1526
    93
    new_axioms: term Symtab.table,
wenzelm@3814
    94
    oracles: ((Sign.sg * exn -> term) * stamp) Symtab.table,
paulson@1526
    95
    parents: theory list};
paulson@1526
    96
paulson@1526
    97
fun rep_theory (Theory args) = args;
paulson@1526
    98
paulson@1526
    99
(*errors involving theories*)
paulson@1526
   100
exception THEORY of string * theory list;
paulson@1526
   101
paulson@1526
   102
paulson@1526
   103
val sign_of = #sign o rep_theory;
paulson@1526
   104
val syn_of = #syn o Sign.rep_sg o sign_of;
paulson@1526
   105
paulson@1526
   106
(*stamps associated with a theory*)
paulson@1526
   107
val stamps_of_thy = #stamps o Sign.rep_sg o sign_of;
paulson@1526
   108
paulson@1526
   109
(*return the immediate ancestors*)
paulson@1526
   110
val parents_of = #parents o rep_theory;
paulson@1526
   111
paulson@1526
   112
paulson@1526
   113
(*compare theories*)
paulson@1526
   114
val subthy = Sign.subsig o pairself sign_of;
paulson@1526
   115
val eq_thy = Sign.eq_sg o pairself sign_of;
paulson@1526
   116
paulson@1526
   117
paulson@1526
   118
(* the Pure theories *)
paulson@1526
   119
wenzelm@3878
   120
fun make_thy sign axms oras parents =
wenzelm@3878
   121
  Theory {sign = sign, new_axioms = axms, oracles = oras, parents = parents};
paulson@1526
   122
wenzelm@3878
   123
val proto_pure_thy = make_thy Sign.proto_pure Symtab.null Symtab.null [];
wenzelm@3878
   124
val pure_thy = make_thy Sign.pure Symtab.null Symtab.null [proto_pure_thy];
wenzelm@3878
   125
val cpure_thy = make_thy Sign.cpure Symtab.null Symtab.null [proto_pure_thy];
paulson@1526
   126
paulson@1526
   127
paulson@1526
   128
paulson@1526
   129
(** extend theory **)
paulson@1526
   130
wenzelm@3814
   131
(*name space kinds*)
wenzelm@3814
   132
val thmK = "thm";
wenzelm@3814
   133
val oracleK = "oracle";
wenzelm@3814
   134
wenzelm@3814
   135
wenzelm@3814
   136
(* extend logical part of a theory *)
wenzelm@3814
   137
paulson@1526
   138
fun err_dup_axms names =
paulson@1526
   139
  error ("Duplicate axiom name(s) " ^ commas_quote names);
paulson@1526
   140
wenzelm@3814
   141
fun err_dup_oras names =
wenzelm@3814
   142
  error ("Duplicate oracles " ^ commas_quote names);
wenzelm@3814
   143
wenzelm@3814
   144
wenzelm@3814
   145
fun ext_thy thy sign' new_axms new_oras =
paulson@1526
   146
  let
wenzelm@3814
   147
    val Theory {sign, new_axioms, oracles, parents} = thy;
paulson@1526
   148
    val draft = Sign.is_draft sign;
wenzelm@3814
   149
    val new_axioms' =
paulson@1526
   150
      Symtab.extend_new (if draft then new_axioms else Symtab.null, new_axms)
paulson@1526
   151
        handle Symtab.DUPS names => err_dup_axms names;
wenzelm@3814
   152
    val oracles' =
wenzelm@3814
   153
      Symtab.extend_new (oracles, new_oras)
wenzelm@3814
   154
        handle Symtab.DUPS names => err_dup_oras names;
wenzelm@3814
   155
    val parents' = if draft then parents else [thy];
paulson@1526
   156
  in
wenzelm@3878
   157
    make_thy sign' new_axioms' oracles' parents'
paulson@1526
   158
  end;
paulson@1526
   159
paulson@1526
   160
paulson@1526
   161
(* extend signature of a theory *)
paulson@1526
   162
paulson@1526
   163
fun ext_sg extfun decls (thy as Theory {sign, ...}) =
wenzelm@3814
   164
  ext_thy thy (extfun decls sign) [] [];
paulson@1526
   165
wenzelm@2206
   166
val add_classes      = ext_sg Sign.add_classes;
wenzelm@3787
   167
val add_classes_i    = ext_sg Sign.add_classes_i;
wenzelm@2206
   168
val add_classrel     = ext_sg Sign.add_classrel;
wenzelm@3787
   169
val add_classrel_i   = ext_sg Sign.add_classrel_i;
wenzelm@2206
   170
val add_defsort      = ext_sg Sign.add_defsort;
wenzelm@3787
   171
val add_defsort_i    = ext_sg Sign.add_defsort_i;
wenzelm@2206
   172
val add_types        = ext_sg Sign.add_types;
wenzelm@2206
   173
val add_tyabbrs      = ext_sg Sign.add_tyabbrs;
wenzelm@2206
   174
val add_tyabbrs_i    = ext_sg Sign.add_tyabbrs_i;
wenzelm@2206
   175
val add_arities      = ext_sg Sign.add_arities;
wenzelm@3787
   176
val add_arities_i    = ext_sg Sign.add_arities_i;
wenzelm@2206
   177
val add_consts       = ext_sg Sign.add_consts;
wenzelm@2206
   178
val add_consts_i     = ext_sg Sign.add_consts_i;
wenzelm@2206
   179
val add_syntax       = ext_sg Sign.add_syntax;
wenzelm@2206
   180
val add_syntax_i     = ext_sg Sign.add_syntax_i;
wenzelm@2206
   181
val add_modesyntax   = curry (ext_sg Sign.add_modesyntax);
wenzelm@2206
   182
val add_modesyntax_i = curry (ext_sg Sign.add_modesyntax_i);
wenzelm@2206
   183
val add_trfuns       = ext_sg Sign.add_trfuns;
wenzelm@2385
   184
val add_trfunsT      = ext_sg Sign.add_trfunsT;
wenzelm@2693
   185
val add_tokentrfuns  = ext_sg Sign.add_tokentrfuns;
wenzelm@2206
   186
val add_trrules      = ext_sg Sign.add_trrules;
wenzelm@2206
   187
val add_trrules_i    = ext_sg Sign.add_trrules_i;
wenzelm@3787
   188
val add_path         = ext_sg Sign.add_path;
wenzelm@3787
   189
val add_space        = ext_sg Sign.add_space;
wenzelm@3767
   190
val add_name         = ext_sg Sign.add_name;
paulson@1526
   191
paulson@1526
   192
wenzelm@3814
   193
wenzelm@3814
   194
(** add axioms **)
wenzelm@3814
   195
paulson@1526
   196
(* prepare axioms *)
paulson@1526
   197
paulson@1526
   198
fun err_in_axm name =
paulson@1526
   199
  error ("The error(s) above occurred in axiom " ^ quote name);
paulson@1526
   200
paulson@1526
   201
fun no_vars tm =
paulson@1526
   202
  if null (term_vars tm) andalso null (term_tvars tm) then tm
paulson@1526
   203
  else error "Illegal schematic variable(s) in term";
paulson@1526
   204
paulson@1526
   205
fun cert_axm sg (name, raw_tm) =
paulson@1526
   206
  let
paulson@1526
   207
    val (t, T, _) = Sign.certify_term sg raw_tm
wenzelm@2979
   208
      handle TYPE (msg, _, _) => error msg
paulson@1526
   209
	   | TERM (msg, _) => error msg;
paulson@1526
   210
  in
paulson@1526
   211
    assert (T = propT) "Term not of type prop";
paulson@1526
   212
    (name, no_vars t)
paulson@1526
   213
  end
paulson@1526
   214
  handle ERROR => err_in_axm name;
paulson@1526
   215
paulson@1526
   216
(*Some duplication of code with read_def_cterm*)
paulson@1526
   217
fun read_axm sg (name, str) = 
wenzelm@3814
   218
  let
wenzelm@3814
   219
    val ts = Syntax.read (#syn (Sign.rep_sg sg)) propT str;
wenzelm@3814
   220
    val (_, t, _) =
wenzelm@3814
   221
          Sign.infer_types sg (K None) (K None) [] true (ts, propT);
paulson@1960
   222
  in cert_axm sg (name,t) end
paulson@1960
   223
  handle ERROR => err_in_axm name;
paulson@1526
   224
paulson@1526
   225
fun inferT_axm sg (name, pre_tm) =
wenzelm@3814
   226
  let
wenzelm@3814
   227
    val (_, t, _) =
wenzelm@3814
   228
      Sign.infer_types sg (K None) (K None) [] true ([pre_tm], propT);
wenzelm@3814
   229
  in (name, no_vars t) end
paulson@1526
   230
  handle ERROR => err_in_axm name;
paulson@1526
   231
paulson@1526
   232
paulson@1526
   233
(* extend axioms of a theory *)
paulson@1526
   234
wenzelm@3814
   235
fun ext_axms prep_axm raw_axms (thy as Theory {sign, ...}) =
paulson@1526
   236
  let
wenzelm@3814
   237
    val raw_axms' = map (apfst (Sign.full_name sign)) raw_axms;
wenzelm@3814
   238
    val axioms =
wenzelm@3814
   239
      map (apsnd (Term.compress_term o Logic.varify) o prep_axm sign) raw_axms';
wenzelm@3814
   240
    val sign' = Sign.add_space (thmK, map fst axioms) sign;
paulson@1526
   241
  in
wenzelm@3814
   242
    ext_thy thy sign' axioms []
paulson@1526
   243
  end;
paulson@1526
   244
paulson@1526
   245
val add_axioms = ext_axms read_axm;
paulson@1526
   246
val add_axioms_i = ext_axms cert_axm;
paulson@1526
   247
paulson@1526
   248
wenzelm@3814
   249
(* add oracle **)
wenzelm@3814
   250
wenzelm@3814
   251
fun add_oracle (raw_name, oracle) (thy as Theory {sign, ...}) =
wenzelm@3814
   252
  let
wenzelm@3814
   253
    val name = Sign.full_name sign raw_name;
wenzelm@3814
   254
    val sign' = Sign.add_space (oracleK, [name]) sign;
wenzelm@3814
   255
  in
wenzelm@3814
   256
    ext_thy thy sign' [] [(name, (oracle, stamp ()))]
wenzelm@3814
   257
  end;
wenzelm@3814
   258
wenzelm@3814
   259
wenzelm@3767
   260
wenzelm@3767
   261
(** add constant definitions **)
wenzelm@3767
   262
wenzelm@3767
   263
(* all_axioms_of *)
wenzelm@3767
   264
wenzelm@3767
   265
(*results may contain duplicates!*)
wenzelm@3767
   266
wenzelm@3767
   267
fun ancestry_of thy =
wenzelm@3767
   268
  thy :: List.concat (map ancestry_of (parents_of thy));
wenzelm@3767
   269
wenzelm@3767
   270
val all_axioms_of =
wenzelm@3767
   271
  List.concat o map (Symtab.dest o #new_axioms o rep_theory) o ancestry_of;
wenzelm@3767
   272
wenzelm@3767
   273
wenzelm@3767
   274
(* clash_types, clash_consts *)
wenzelm@3767
   275
wenzelm@3767
   276
(*check if types have common instance (ignoring sorts)*)
wenzelm@3767
   277
wenzelm@3767
   278
fun clash_types ty1 ty2 =
wenzelm@3767
   279
  let
wenzelm@3767
   280
    val ty1' = Type.varifyT ty1;
wenzelm@3767
   281
    val ty2' = incr_tvar (maxidx_of_typ ty1' + 1) (Type.varifyT ty2);
wenzelm@3767
   282
  in
wenzelm@3767
   283
    Type.raw_unify (ty1', ty2')
wenzelm@3767
   284
  end;
wenzelm@3767
   285
wenzelm@3767
   286
fun clash_consts (c1, ty1) (c2, ty2) =
wenzelm@3767
   287
  c1 = c2 andalso clash_types ty1 ty2;
wenzelm@3767
   288
wenzelm@3767
   289
wenzelm@3767
   290
(* clash_defns *)
wenzelm@3767
   291
wenzelm@3767
   292
fun clash_defn c_ty (name, tm) =
wenzelm@3767
   293
  let val (c, ty') = dest_Const (head_of (fst (Logic.dest_equals tm))) in
wenzelm@3767
   294
    if clash_consts c_ty (c, ty') then Some (name, ty') else None
wenzelm@3767
   295
  end handle TERM _ => None;
wenzelm@3767
   296
wenzelm@3767
   297
fun clash_defns c_ty axms =
wenzelm@3767
   298
  distinct (mapfilter (clash_defn c_ty) axms);
wenzelm@3767
   299
wenzelm@3767
   300
wenzelm@3767
   301
(* dest_defn *)
wenzelm@3767
   302
wenzelm@3767
   303
fun dest_defn tm =
wenzelm@3767
   304
  let
wenzelm@3787
   305
    fun err msg = raise TERM (msg, [tm]);
wenzelm@3767
   306
wenzelm@3767
   307
    val (lhs, rhs) = Logic.dest_equals (Logic.strip_imp_concl tm)
wenzelm@3767
   308
      handle TERM _ => err "Not a meta-equality (==)";
wenzelm@3767
   309
    val (head, args) = strip_comb lhs;
wenzelm@3767
   310
    val (c, ty) = dest_Const head
wenzelm@3767
   311
      handle TERM _ => err "Head of lhs not a constant";
wenzelm@3767
   312
wenzelm@3767
   313
    fun occs_const (Const c_ty') = (c_ty' = (c, ty))
wenzelm@3767
   314
      | occs_const (Abs (_, _, t)) = occs_const t
wenzelm@3767
   315
      | occs_const (t $ u) = occs_const t orelse occs_const u
wenzelm@3767
   316
      | occs_const _ = false;
wenzelm@3767
   317
wenzelm@3767
   318
    val show_frees = commas_quote o map (fst o dest_Free);
wenzelm@3767
   319
    val show_tfrees = commas_quote o map fst;
wenzelm@3767
   320
wenzelm@3767
   321
    val lhs_dups = duplicates args;
wenzelm@3767
   322
    val rhs_extras = gen_rems (op =) (term_frees rhs, args);
wenzelm@3767
   323
    val rhs_extrasT = gen_rems (op =) (term_tfrees rhs, typ_tfrees ty);
wenzelm@3767
   324
  in
wenzelm@3767
   325
    if not (forall is_Free args) then
wenzelm@3767
   326
      err "Arguments (on lhs) must be variables"
wenzelm@3767
   327
    else if not (null lhs_dups) then
wenzelm@3767
   328
      err ("Duplicate variables on lhs: " ^ show_frees lhs_dups)
wenzelm@3767
   329
    else if not (null rhs_extras) then
wenzelm@3767
   330
      err ("Extra variables on rhs: " ^ show_frees rhs_extras)
wenzelm@3767
   331
    else if not (null rhs_extrasT) then
wenzelm@3767
   332
      err ("Extra type variables on rhs: " ^ show_tfrees rhs_extrasT)
wenzelm@3767
   333
    else if occs_const rhs then
wenzelm@3767
   334
      err ("Constant to be defined occurs on rhs")
wenzelm@3767
   335
    else (c, ty)
wenzelm@3767
   336
  end;
wenzelm@3767
   337
wenzelm@3767
   338
wenzelm@3767
   339
(* check_defn *)
wenzelm@3767
   340
wenzelm@3814
   341
fun err_in_defn sg name msg =
wenzelm@3814
   342
  (writeln msg; error ("The error(s) above occurred in definition " ^
wenzelm@3814
   343
    quote (Sign.full_name sg name)));
wenzelm@3767
   344
wenzelm@3767
   345
fun check_defn sign (axms, (name, tm)) =
wenzelm@3767
   346
  let
wenzelm@3767
   347
    fun show_const (c, ty) = quote (Pretty.string_of (Pretty.block
wenzelm@3767
   348
      [Pretty.str (c ^ " ::"), Pretty.brk 1, Sign.pretty_typ sign ty]));
wenzelm@3767
   349
wenzelm@3767
   350
    fun show_defn c (dfn, ty') = show_const (c, ty') ^ " in " ^ dfn;
wenzelm@3767
   351
    fun show_defns c = cat_lines o map (show_defn c);
wenzelm@3767
   352
wenzelm@3767
   353
    val (c, ty) = dest_defn tm
wenzelm@3814
   354
      handle TERM (msg, _) => err_in_defn sign name msg;
wenzelm@3767
   355
    val defns = clash_defns (c, ty) axms;
wenzelm@3767
   356
  in
wenzelm@3767
   357
    if not (null defns) then
wenzelm@3814
   358
      err_in_defn sign name ("Definition of " ^ show_const (c, ty) ^
wenzelm@3767
   359
        "\nclashes with " ^ show_defns c defns)
wenzelm@3767
   360
    else (name, tm) :: axms
wenzelm@3767
   361
  end;
wenzelm@3767
   362
wenzelm@3767
   363
wenzelm@3767
   364
(* add_defs *)
wenzelm@3767
   365
wenzelm@3767
   366
fun ext_defns prep_axm raw_axms thy =
wenzelm@3767
   367
  let
wenzelm@3767
   368
    val axms = map (prep_axm (sign_of thy)) raw_axms;
wenzelm@3767
   369
    val all_axms = all_axioms_of thy;
wenzelm@3767
   370
  in
wenzelm@3767
   371
    foldl (check_defn (sign_of thy)) (all_axms, axms);
wenzelm@3767
   372
    add_axioms_i axms thy
wenzelm@3767
   373
  end;
wenzelm@3767
   374
wenzelm@3767
   375
val add_defs_i = ext_defns cert_axm;
wenzelm@3767
   376
val add_defs = ext_defns read_axm;
wenzelm@3767
   377
wenzelm@3767
   378
wenzelm@3878
   379
wenzelm@3865
   380
(** additional theory data **)
wenzelm@3865
   381
wenzelm@3865
   382
val init_data = ext_sg Sign.init_data;
wenzelm@3865
   383
val get_data = Sign.get_data o sign_of;
wenzelm@3865
   384
val put_data = ext_sg Sign.put_data;
wenzelm@3865
   385
wenzelm@3865
   386
wenzelm@3767
   387
paulson@1526
   388
(** merge theories **)
paulson@1526
   389
wenzelm@3878
   390
(*merge list of theories from left to right, preparing extend*)
wenzelm@3878
   391
fun merge_list thys =
paulson@1526
   392
  let
paulson@1526
   393
    fun is_union thy = forall (fn t => subthy (t, thy)) thys;
paulson@1526
   394
    val is_draft = Sign.is_draft o sign_of;
paulson@1526
   395
paulson@1526
   396
    fun add_sign (sg, Theory {sign, ...}) =
wenzelm@3878
   397
      Sign.nontriv_merge (sg, sign) handle TERM (msg, _) => error msg;
wenzelm@3814
   398
wenzelm@3814
   399
    fun oracles_of (Theory {oracles, ...}) = Symtab.dest oracles;
wenzelm@3814
   400
    fun eq_ora ((_, (_, s1: stamp)), (_, (_, s2))) = s1 = s2;
paulson@1526
   401
  in
wenzelm@3878
   402
    if exists is_draft thys then
wenzelm@3878
   403
      raise THEORY ("Illegal merge of draft theories", thys)
wenzelm@3878
   404
    else
wenzelm@3878
   405
      (case find_first is_union thys of
wenzelm@3878
   406
        Some (Theory {sign, oracles, new_axioms = _, parents = _}) =>
wenzelm@3878
   407
          make_thy (Sign.prep_ext sign) Symtab.null oracles thys
wenzelm@3878
   408
      | None =>
wenzelm@3878
   409
          make_thy
wenzelm@3878
   410
            (Sign.prep_ext (foldl add_sign (Sign.proto_pure, thys)))
wenzelm@3878
   411
            Symtab.null
wenzelm@3878
   412
            (Symtab.make (gen_distinct eq_ora (flat (map oracles_of thys)))
wenzelm@3878
   413
              handle Symtab.DUPS names => err_dup_oras names)
wenzelm@3878
   414
            thys)
paulson@1526
   415
  end;
paulson@1526
   416
paulson@1526
   417
paulson@1526
   418
end;
paulson@1526
   419
wenzelm@3767
   420
structure BasicTheory: BASIC_THEORY = Theory;
wenzelm@3767
   421
open BasicTheory;