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