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