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