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