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