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