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