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