src/Pure/theory.ML
author nipkow
Sat Jul 08 19:14:43 2000 +0200 (2000-07-08)
changeset 9282 0181ac100520
parent 9280 78a9bca983ac
child 9320 803cb9c9d4dd
permissions -rw-r--r--
Defs are now checked for circularity (if not overloaded).
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,
nipkow@9282
    15
      const_deps: string list Symtab.table,
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@6188
    21
  val is_draft: theory -> bool
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@6311
    28
  val read_def_axm: Sign.sg * (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@6311
    29
    string list -> string * string -> string * term
wenzelm@3996
    30
  val read_axm: Sign.sg -> string * string -> string * term
wenzelm@3996
    31
  val inferT_axm: Sign.sg -> string * term -> string * term
wenzelm@3767
    32
end
wenzelm@3767
    33
wenzelm@3767
    34
signature THEORY =
wenzelm@3767
    35
sig
wenzelm@3767
    36
  include BASIC_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@8897
    44
  val add_defsort: string -> 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@8897
    52
  val add_arities: (xstring * string list * string) 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@6311
    68
    (string * string * (string -> string * real)) list -> theory -> theory
wenzelm@6311
    69
  val add_mode_tokentrfuns: string -> (string * (string -> string * real)) list
wenzelm@6311
    70
    -> theory -> theory
wenzelm@4617
    71
  val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@3996
    72
  val add_trrules_i: Syntax.ast Syntax.trrule list -> theory -> theory
wenzelm@3996
    73
  val add_axioms: (bstring * string) list -> theory -> theory
wenzelm@3996
    74
  val add_axioms_i: (bstring * term) list -> theory -> theory
wenzelm@4996
    75
  val add_oracle: bstring * (Sign.sg * Object.T -> term) -> theory -> theory
wenzelm@3996
    76
  val add_defs: (bstring * string) list -> theory -> theory
wenzelm@3996
    77
  val add_defs_i: (bstring * term) list -> theory -> theory
wenzelm@3996
    78
  val add_path: string -> theory -> theory
wenzelm@4846
    79
  val parent_path: theory -> theory
wenzelm@4846
    80
  val root_path: theory -> theory
wenzelm@8725
    81
  val hide_space: string * xstring list -> theory -> theory
wenzelm@8725
    82
  val hide_space_i: string * string list -> theory -> theory
wenzelm@8725
    83
  val hide_classes: string list -> theory -> theory
wenzelm@8725
    84
  val hide_types: string list -> theory -> theory
wenzelm@8725
    85
  val hide_consts: string list -> theory -> theory
wenzelm@3996
    86
  val add_name: string -> theory -> theory
wenzelm@5862
    87
  val copy: theory -> theory
wenzelm@6661
    88
  val prep_ext: theory -> theory
wenzelm@3996
    89
  val prep_ext_merge: theory list -> theory
paulson@4970
    90
  val requires: theory -> string -> string -> unit
wenzelm@6369
    91
  val assert_super: theory -> theory -> theory
wenzelm@3996
    92
  val pre_pure: theory
paulson@1526
    93
end;
paulson@1526
    94
wenzelm@6188
    95
signature PRIVATE_THEORY =
wenzelm@5642
    96
sig
wenzelm@5642
    97
  include THEORY
wenzelm@6546
    98
  val init_data: Object.kind -> (Object.T * (Object.T -> Object.T) * (Object.T -> Object.T) *
wenzelm@5642
    99
    (Object.T * Object.T -> Object.T) * (Sign.sg -> Object.T -> unit)) -> theory -> theory
wenzelm@5642
   100
  val print_data: Object.kind -> theory -> unit
wenzelm@5642
   101
  val get_data: Object.kind -> (Object.T -> 'a) -> theory -> 'a
wenzelm@5642
   102
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> theory -> theory
wenzelm@5642
   103
end;
paulson@1526
   104
wenzelm@5642
   105
wenzelm@6188
   106
structure Theory: PRIVATE_THEORY =
paulson@1526
   107
struct
wenzelm@2206
   108
wenzelm@3996
   109
wenzelm@2206
   110
(** datatype theory **)
paulson@1526
   111
paulson@1526
   112
datatype theory =
paulson@1526
   113
  Theory of {
paulson@1526
   114
    sign: Sign.sg,
nipkow@9282
   115
    const_deps: string list Symtab.table,
wenzelm@3996
   116
    axioms: term Symtab.table,
wenzelm@4996
   117
    oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table,
wenzelm@4019
   118
    parents: theory list,
wenzelm@4019
   119
    ancestors: theory list};
paulson@1526
   120
nipkow@9282
   121
(* currently, dependencies are 
nipkow@9282
   122
   - only tracked for non-overloaded definitions;
nipkow@9282
   123
   - hierarchical: c |-> cs means that constant c depends directly on the
nipkow@9282
   124
     constants cs, which may in turn depend on other constants.
nipkow@9282
   125
     This saves space, but requires more time when checking for circularity.
nipkow@9282
   126
*)
nipkow@9282
   127
nipkow@9282
   128
nipkow@9282
   129
fun make_theory sign deps axms oras parents ancestors =
nipkow@9282
   130
  Theory {sign = sign, const_deps = deps, axioms = axms, oracles = oras,
wenzelm@4019
   131
    parents = parents, ancestors = ancestors};
wenzelm@3996
   132
paulson@1526
   133
fun rep_theory (Theory args) = args;
paulson@1526
   134
wenzelm@3996
   135
val sign_of = #sign o rep_theory;
wenzelm@6188
   136
val is_draft = Sign.is_draft o sign_of;
wenzelm@3996
   137
val syn_of = #syn o Sign.rep_sg o sign_of;
wenzelm@3996
   138
val parents_of = #parents o rep_theory;
wenzelm@4019
   139
val ancestors_of = #ancestors o rep_theory;
wenzelm@3996
   140
paulson@1526
   141
(*errors involving theories*)
paulson@1526
   142
exception THEORY of string * theory list;
paulson@1526
   143
paulson@1526
   144
(*compare theories*)
paulson@1526
   145
val subthy = Sign.subsig o pairself sign_of;
paulson@1526
   146
val eq_thy = Sign.eq_sg o pairself sign_of;
paulson@1526
   147
wenzelm@6369
   148
(*check for some theory*)
paulson@4970
   149
fun requires thy name what =
wenzelm@4846
   150
  if exists (equal name) (Sign.stamp_names_of (sign_of thy)) then ()
wenzelm@4846
   151
  else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what);
paulson@1526
   152
wenzelm@6369
   153
fun assert_super thy1 thy2 =
wenzelm@6369
   154
  if subthy (thy1, thy2) then thy2
wenzelm@6369
   155
  else raise THEORY ("Not a super theory", [thy1, thy2]);
wenzelm@6369
   156
wenzelm@4846
   157
(*partial Pure theory*)
nipkow@9282
   158
val pre_pure =
nipkow@9282
   159
  make_theory Sign.pre_pure Symtab.empty Symtab.empty Symtab.empty [] [];
paulson@1526
   160
paulson@1526
   161
paulson@1526
   162
paulson@1526
   163
(** extend theory **)
paulson@1526
   164
wenzelm@8725
   165
(*name spaces*)
wenzelm@3996
   166
val axiomK = "axiom";
wenzelm@3814
   167
val oracleK = "oracle";
wenzelm@3814
   168
wenzelm@3814
   169
wenzelm@3814
   170
(* extend logical part of a theory *)
wenzelm@3814
   171
paulson@1526
   172
fun err_dup_axms names =
paulson@1526
   173
  error ("Duplicate axiom name(s) " ^ commas_quote names);
paulson@1526
   174
wenzelm@3814
   175
fun err_dup_oras names =
wenzelm@3814
   176
  error ("Duplicate oracles " ^ commas_quote names);
wenzelm@3814
   177
wenzelm@4996
   178
fun ext_theory thy ext_sg new_axms new_oras =
paulson@1526
   179
  let
nipkow@9282
   180
    val Theory {sign, const_deps, axioms, oracles, parents, ancestors} = thy;
paulson@1526
   181
    val draft = Sign.is_draft sign;
wenzelm@3996
   182
    val axioms' =
wenzelm@4488
   183
      Symtab.extend (if draft then axioms else Symtab.empty, new_axms)
paulson@1526
   184
        handle Symtab.DUPS names => err_dup_axms names;
wenzelm@3814
   185
    val oracles' =
wenzelm@4488
   186
      Symtab.extend (oracles, new_oras)
wenzelm@3814
   187
        handle Symtab.DUPS names => err_dup_oras names;
wenzelm@4019
   188
    val (parents', ancestors') =
wenzelm@4019
   189
      if draft then (parents, ancestors) else ([thy], thy :: ancestors);
paulson@1526
   190
  in
nipkow@9282
   191
    make_theory (ext_sg sign) const_deps axioms' oracles' parents' ancestors'
paulson@1526
   192
  end;
paulson@1526
   193
paulson@1526
   194
paulson@1526
   195
(* extend signature of a theory *)
paulson@1526
   196
wenzelm@4996
   197
fun ext_sign extfun decls thy = ext_theory thy (extfun decls) [] [];
paulson@1526
   198
wenzelm@4996
   199
val add_classes      = ext_sign Sign.add_classes;
wenzelm@4996
   200
val add_classes_i    = ext_sign Sign.add_classes_i;
wenzelm@4996
   201
val add_classrel     = ext_sign Sign.add_classrel;
wenzelm@4996
   202
val add_classrel_i   = ext_sign Sign.add_classrel_i;
wenzelm@4996
   203
val add_defsort      = ext_sign Sign.add_defsort;
wenzelm@4996
   204
val add_defsort_i    = ext_sign Sign.add_defsort_i;
wenzelm@4996
   205
val add_types        = ext_sign Sign.add_types;
wenzelm@4996
   206
val add_nonterminals = ext_sign Sign.add_nonterminals;
wenzelm@4996
   207
val add_tyabbrs      = ext_sign Sign.add_tyabbrs;
wenzelm@4996
   208
val add_tyabbrs_i    = ext_sign Sign.add_tyabbrs_i;
wenzelm@4996
   209
val add_arities      = ext_sign Sign.add_arities;
wenzelm@4996
   210
val add_arities_i    = ext_sign Sign.add_arities_i;
wenzelm@4996
   211
val add_consts       = ext_sign Sign.add_consts;
wenzelm@4996
   212
val add_consts_i     = ext_sign Sign.add_consts_i;
wenzelm@4996
   213
val add_syntax       = ext_sign Sign.add_syntax;
wenzelm@4996
   214
val add_syntax_i     = ext_sign Sign.add_syntax_i;
wenzelm@4996
   215
val add_modesyntax   = curry (ext_sign Sign.add_modesyntax);
wenzelm@4996
   216
val add_modesyntax_i = curry (ext_sign Sign.add_modesyntax_i);
wenzelm@4996
   217
val add_trfuns       = ext_sign Sign.add_trfuns;
wenzelm@4996
   218
val add_trfunsT      = ext_sign Sign.add_trfunsT;
wenzelm@4996
   219
val add_tokentrfuns  = ext_sign Sign.add_tokentrfuns;
wenzelm@6311
   220
fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f));
wenzelm@4996
   221
val add_trrules      = ext_sign Sign.add_trrules;
wenzelm@4996
   222
val add_trrules_i    = ext_sign Sign.add_trrules_i;
wenzelm@4996
   223
val add_path         = ext_sign Sign.add_path;
wenzelm@4846
   224
val parent_path      = add_path "..";
wenzelm@4846
   225
val root_path        = add_path "/";
wenzelm@4996
   226
val add_space        = ext_sign Sign.add_space;
wenzelm@8725
   227
val hide_space       = ext_sign Sign.hide_space;
wenzelm@8725
   228
val hide_space_i     = ext_sign Sign.hide_space_i;
wenzelm@8725
   229
val hide_classes     = curry hide_space_i Sign.classK;
wenzelm@8725
   230
val hide_types       = curry hide_space_i Sign.typeK;
wenzelm@8725
   231
val hide_consts      = curry hide_space_i Sign.constK;
wenzelm@4996
   232
val add_name         = ext_sign Sign.add_name;
wenzelm@6546
   233
val copy             = ext_sign (K Sign.copy) ();
wenzelm@6661
   234
val prep_ext         = ext_sign (K Sign.prep_ext) ();
wenzelm@3814
   235
wenzelm@3996
   236
wenzelm@6311
   237
wenzelm@3814
   238
(** add axioms **)
wenzelm@3814
   239
paulson@1526
   240
(* prepare axioms *)
paulson@1526
   241
paulson@1526
   242
fun err_in_axm name =
paulson@1526
   243
  error ("The error(s) above occurred in axiom " ^ quote name);
paulson@1526
   244
paulson@1526
   245
fun no_vars tm =
paulson@1526
   246
  if null (term_vars tm) andalso null (term_tvars tm) then tm
paulson@1526
   247
  else error "Illegal schematic variable(s) in term";
paulson@1526
   248
paulson@1526
   249
fun cert_axm sg (name, raw_tm) =
paulson@1526
   250
  let
paulson@1526
   251
    val (t, T, _) = Sign.certify_term sg raw_tm
wenzelm@2979
   252
      handle TYPE (msg, _, _) => error msg
wenzelm@3996
   253
           | TERM (msg, _) => error msg;
paulson@1526
   254
  in
paulson@1526
   255
    assert (T = propT) "Term not of type prop";
paulson@1526
   256
    (name, no_vars t)
paulson@1526
   257
  end
paulson@1526
   258
  handle ERROR => err_in_axm name;
paulson@1526
   259
wenzelm@5057
   260
(*some duplication of code with read_def_cterm*)
wenzelm@6661
   261
fun read_def_axm (sg, types, sorts) used (name, str) =
wenzelm@3814
   262
  let
wenzelm@3814
   263
    val ts = Syntax.read (#syn (Sign.rep_sg sg)) propT str;
wenzelm@5057
   264
    val (t, _) = Sign.infer_types sg types sorts used true (ts, propT);
paulson@1960
   265
  in cert_axm sg (name,t) end
paulson@1960
   266
  handle ERROR => err_in_axm name;
paulson@1526
   267
wenzelm@5057
   268
fun read_axm sg name_str = read_def_axm (sg, K None, K None) [] name_str;
wenzelm@5057
   269
paulson@1526
   270
fun inferT_axm sg (name, pre_tm) =
wenzelm@3814
   271
  let
wenzelm@4251
   272
    val (t, _) = Sign.infer_types sg (K None) (K None) [] true ([pre_tm], propT);
wenzelm@3814
   273
  in (name, no_vars t) end
paulson@1526
   274
  handle ERROR => err_in_axm name;
paulson@1526
   275
paulson@1526
   276
paulson@1526
   277
(* extend axioms of a theory *)
paulson@1526
   278
wenzelm@3814
   279
fun ext_axms prep_axm raw_axms (thy as Theory {sign, ...}) =
paulson@1526
   280
  let
wenzelm@3814
   281
    val raw_axms' = map (apfst (Sign.full_name sign)) raw_axms;
wenzelm@3814
   282
    val axioms =
wenzelm@3814
   283
      map (apsnd (Term.compress_term o Logic.varify) o prep_axm sign) raw_axms';
wenzelm@4996
   284
    val ext_sg = Sign.add_space (axiomK, map fst axioms);
paulson@1526
   285
  in
wenzelm@4996
   286
    ext_theory thy ext_sg axioms []
paulson@1526
   287
  end;
paulson@1526
   288
paulson@1526
   289
val add_axioms = ext_axms read_axm;
paulson@1526
   290
val add_axioms_i = ext_axms cert_axm;
paulson@1526
   291
paulson@1526
   292
wenzelm@3814
   293
(* add oracle **)
wenzelm@3814
   294
wenzelm@3814
   295
fun add_oracle (raw_name, oracle) (thy as Theory {sign, ...}) =
wenzelm@3814
   296
  let
wenzelm@3814
   297
    val name = Sign.full_name sign raw_name;
wenzelm@4996
   298
    val ext_sg = Sign.add_space (oracleK, [name]);
wenzelm@3814
   299
  in
wenzelm@4996
   300
    ext_theory thy ext_sg [] [(name, (oracle, stamp ()))]
wenzelm@3814
   301
  end;
wenzelm@3814
   302
wenzelm@3814
   303
wenzelm@3767
   304
wenzelm@3767
   305
(** add constant definitions **)
wenzelm@3767
   306
nipkow@9282
   307
(* add dependency *)
nipkow@9282
   308
(* check if not circular;
nipkow@9282
   309
   no dependency for c can have been declared already
nipkow@9282
   310
   because that would have raised a clash-of-definitions error.
nipkow@9282
   311
*)
nipkow@9282
   312
nipkow@9282
   313
fun add_dependencies(dep,c,cs) =
nipkow@9282
   314
  let fun circular path (vis,d) =
nipkow@9282
   315
        if c=d then raise TERM(
nipkow@9282
   316
  "Definition would create circular dependency of constants:\n" ^
nipkow@9282
   317
  space_implode " -> " (c::rev(c::path)),
nipkow@9282
   318
                               [])
nipkow@9282
   319
        else if d mem_string vis then vis
nipkow@9282
   320
             else case Symtab.lookup(dep,d) of None => vis
nipkow@9282
   321
                  | Some ds => foldl (circular(d::path)) (vis,ds)
nipkow@9282
   322
  in foldl (circular []) ([],cs); Symtab.update_new((c,cs),dep) end;
nipkow@9282
   323
wenzelm@3767
   324
(* all_axioms_of *)
wenzelm@3767
   325
wenzelm@3767
   326
(*results may contain duplicates!*)
wenzelm@3767
   327
wenzelm@4019
   328
fun all_axioms_of thy =
wenzelm@4019
   329
  flat (map (Symtab.dest o #axioms o rep_theory) (thy :: ancestors_of thy));
wenzelm@3767
   330
wenzelm@3767
   331
wenzelm@3767
   332
(* clash_types, clash_consts *)
wenzelm@3767
   333
wenzelm@3767
   334
(*check if types have common instance (ignoring sorts)*)
wenzelm@3767
   335
wenzelm@3767
   336
fun clash_types ty1 ty2 =
wenzelm@3767
   337
  let
wenzelm@3767
   338
    val ty1' = Type.varifyT ty1;
wenzelm@3767
   339
    val ty2' = incr_tvar (maxidx_of_typ ty1' + 1) (Type.varifyT ty2);
wenzelm@3767
   340
  in
wenzelm@3767
   341
    Type.raw_unify (ty1', ty2')
wenzelm@3767
   342
  end;
wenzelm@3767
   343
wenzelm@3767
   344
fun clash_consts (c1, ty1) (c2, ty2) =
wenzelm@3767
   345
  c1 = c2 andalso clash_types ty1 ty2;
wenzelm@3767
   346
wenzelm@3767
   347
wenzelm@3767
   348
(* clash_defns *)
wenzelm@3767
   349
wenzelm@3767
   350
fun clash_defn c_ty (name, tm) =
wenzelm@3767
   351
  let val (c, ty') = dest_Const (head_of (fst (Logic.dest_equals tm))) in
wenzelm@3767
   352
    if clash_consts c_ty (c, ty') then Some (name, ty') else None
wenzelm@3767
   353
  end handle TERM _ => None;
wenzelm@3767
   354
wenzelm@3767
   355
fun clash_defns c_ty axms =
wenzelm@3767
   356
  distinct (mapfilter (clash_defn c_ty) axms);
wenzelm@3767
   357
wenzelm@3767
   358
nipkow@9282
   359
(* overloading checks *)
nipkow@9280
   360
nipkow@9280
   361
fun overloaded_def(tsig,cT,T) =
nipkow@9280
   362
  let
nipkow@9280
   363
    val T = incr_tvar (maxidx_of_typ cT + 1) (Type.varifyT T);
nipkow@9280
   364
  in
nipkow@9280
   365
  if Type.typ_instance(tsig,cT,T) then None else (* overloading *)
nipkow@9280
   366
  if Type.typ_instance(tsig,Type.rem_sorts cT,Type.rem_sorts T)
nipkow@9280
   367
  then Some false (* useless additional sort constraints in def *)
nipkow@9280
   368
  else Some true  (* useful kind of overloading *)
nipkow@9280
   369
  end;
nipkow@9280
   370
nipkow@9280
   371
wenzelm@3767
   372
(* dest_defn *)
wenzelm@3767
   373
wenzelm@3767
   374
fun dest_defn tm =
wenzelm@3767
   375
  let
wenzelm@3787
   376
    fun err msg = raise TERM (msg, [tm]);
wenzelm@3767
   377
wenzelm@3767
   378
    val (lhs, rhs) = Logic.dest_equals (Logic.strip_imp_concl tm)
wenzelm@3767
   379
      handle TERM _ => err "Not a meta-equality (==)";
wenzelm@3767
   380
    val (head, args) = strip_comb lhs;
nipkow@9282
   381
    val c_ty as (c,ty) = dest_Const head
wenzelm@3767
   382
      handle TERM _ => err "Head of lhs not a constant";
wenzelm@3767
   383
wenzelm@4141
   384
    fun dest_free (Free (x, _)) = x
wenzelm@4141
   385
      | dest_free (Const ("TYPE", Type ("itself", [TFree (x, _)]))) = x
wenzelm@4141
   386
      | dest_free _ = raise Match;
wenzelm@4141
   387
wenzelm@4141
   388
    val show_frees = commas_quote o map dest_free;
wenzelm@3767
   389
    val show_tfrees = commas_quote o map fst;
wenzelm@3767
   390
wenzelm@3767
   391
    val lhs_dups = duplicates args;
wenzelm@3767
   392
    val rhs_extras = gen_rems (op =) (term_frees rhs, args);
wenzelm@3767
   393
    val rhs_extrasT = gen_rems (op =) (term_tfrees rhs, typ_tfrees ty);
wenzelm@3767
   394
  in
wenzelm@4141
   395
    if not (forall (can dest_free) args) then
wenzelm@3767
   396
      err "Arguments (on lhs) must be variables"
wenzelm@3767
   397
    else if not (null lhs_dups) then
wenzelm@3767
   398
      err ("Duplicate variables on lhs: " ^ show_frees lhs_dups)
wenzelm@3767
   399
    else if not (null rhs_extras) then
wenzelm@3767
   400
      err ("Extra variables on rhs: " ^ show_frees rhs_extras)
wenzelm@3767
   401
    else if not (null rhs_extrasT) then
wenzelm@3767
   402
      err ("Extra type variables on rhs: " ^ show_tfrees rhs_extrasT)
nipkow@9282
   403
    else if exists_Const (fn c_ty' => c_ty' = c_ty) rhs then
wenzelm@3767
   404
      err ("Constant to be defined occurs on rhs")
nipkow@9282
   405
    else (c_ty,rhs)
wenzelm@3767
   406
  end;
wenzelm@3767
   407
wenzelm@3767
   408
wenzelm@3767
   409
(* check_defn *)
wenzelm@3767
   410
wenzelm@3814
   411
fun err_in_defn sg name msg =
wenzelm@4974
   412
  (error_msg msg; error ("The error(s) above occurred in definition " ^
nipkow@9280
   413
                         quote (Sign.full_name sg name)));
wenzelm@3767
   414
nipkow@9282
   415
fun check_defn sg ((dep,axms), def as (name,tm)) =
wenzelm@3767
   416
  let
wenzelm@3767
   417
    fun show_const (c, ty) = quote (Pretty.string_of (Pretty.block
nipkow@9280
   418
      [Pretty.str (c ^ " ::"), Pretty.brk 1, Sign.pretty_typ sg ty]));
wenzelm@3767
   419
nipkow@9280
   420
    fun def_txt c_ty = "Definition of " ^ show_const c_ty;
wenzelm@3767
   421
    fun show_defn c (dfn, ty') = show_const (c, ty') ^ " in " ^ dfn;
wenzelm@3767
   422
    fun show_defns c = cat_lines o map (show_defn c);
wenzelm@3767
   423
nipkow@9282
   424
    val (c_ty as (c,ty),rhs) = dest_defn tm
nipkow@9280
   425
      handle TERM (msg, _) => err_in_defn sg name msg;
nipkow@9282
   426
    val cs = add_term_consts(rhs,[]);
nipkow@9280
   427
    val defns = clash_defns c_ty axms;
nipkow@9280
   428
    val cT = case Sign.const_type sg c of Some T => T | None =>
nipkow@9280
   429
              err_in_defn sg name ("Undeclared constant "^quote c);
wenzelm@3767
   430
  in
wenzelm@3767
   431
    if not (null defns) then
nipkow@9280
   432
      err_in_defn sg name (def_txt c_ty ^"\nclashes with "^ show_defns c defns)
nipkow@9280
   433
    else case overloaded_def(Sign.tsig_of sg,cT,ty) of
nipkow@9282
   434
           None => (add_dependencies(dep,c,cs)
nipkow@9282
   435
                    handle TERM(msg,_) => err_in_defn sg name msg,
nipkow@9282
   436
                    def::axms)
nipkow@9280
   437
         | Some true => (warning(def_txt c_ty
nipkow@9280
   438
             ^ "\nin definition " ^ quote(Sign.full_name sg name)
nipkow@9280
   439
       ^ "\nis strictly less general than the declared type of the constant.");
nipkow@9282
   440
                        (dep, def::axms))
nipkow@9280
   441
         | Some false =>
nipkow@9280
   442
           let val txt = Library.setmp show_sorts true def_txt c_ty
nipkow@9280
   443
           in err_in_defn sg name (txt ^
nipkow@9280
   444
"\nimposes additional class constraints on the declared type of the constant.")
nipkow@9280
   445
           end
wenzelm@3767
   446
  end;
wenzelm@3767
   447
wenzelm@3767
   448
wenzelm@3767
   449
(* add_defs *)
wenzelm@3767
   450
nipkow@9282
   451
fun update_deps(Theory{sign,axioms,oracles,parents,ancestors,...},deps) =
nipkow@9282
   452
  Theory{sign=sign, const_deps=deps, axioms=axioms, oracles=oracles,
nipkow@9282
   453
         parents=parents, ancestors=ancestors};
nipkow@9282
   454
wenzelm@3767
   455
fun ext_defns prep_axm raw_axms thy =
wenzelm@3767
   456
  let
nipkow@9280
   457
    val sg = sign_of thy
nipkow@9280
   458
    val axms = map (prep_axm sg) raw_axms;
wenzelm@3767
   459
    val all_axms = all_axioms_of thy;
nipkow@9282
   460
    val Theory{const_deps = deps, ...} = thy;
nipkow@9282
   461
    val (deps1,_) = foldl (check_defn sg) ((deps,all_axms), axms);
wenzelm@3767
   462
  in
nipkow@9282
   463
    add_axioms_i axms (update_deps(thy,deps1))
wenzelm@3767
   464
  end;
wenzelm@3767
   465
wenzelm@3767
   466
val add_defs_i = ext_defns cert_axm;
wenzelm@3767
   467
val add_defs = ext_defns read_axm;
wenzelm@3767
   468
wenzelm@3767
   469
wenzelm@3878
   470
wenzelm@3865
   471
(** additional theory data **)
wenzelm@3865
   472
wenzelm@4996
   473
val init_data = curry (ext_sign Sign.init_data);
wenzelm@4996
   474
fun print_data kind = Sign.print_data kind o sign_of;
wenzelm@4996
   475
fun get_data kind f = Sign.get_data kind f o sign_of;
wenzelm@4996
   476
fun put_data kind f = ext_sign (Sign.put_data kind f);
wenzelm@3865
   477
wenzelm@3865
   478
wenzelm@3767
   479
wenzelm@6661
   480
(** merge theories **)          (*exception ERROR*)
wenzelm@4019
   481
wenzelm@4019
   482
fun merge_sign (sg, thy) =
wenzelm@4627
   483
  Sign.nontriv_merge (sg, sign_of thy) handle TERM (msg, _) => error msg;
paulson@1526
   484
wenzelm@3878
   485
(*merge list of theories from left to right, preparing extend*)
wenzelm@3967
   486
fun prep_ext_merge thys =
wenzelm@3996
   487
  if null thys then
wenzelm@4019
   488
    error "Merge: no parent theories"
wenzelm@6188
   489
  else if exists is_draft thys then
wenzelm@4019
   490
    error "Attempt to merge draft theories"
wenzelm@3996
   491
  else
wenzelm@3996
   492
    let
wenzelm@3996
   493
      val sign' =
wenzelm@4019
   494
        foldl merge_sign (sign_of (hd thys), tl thys)
wenzelm@3996
   495
        |> Sign.prep_ext
wenzelm@3996
   496
        |> Sign.add_path "/";
wenzelm@3814
   497
nipkow@9282
   498
      val depss = map (#const_deps o rep_theory) thys;
nipkow@9282
   499
      val deps' = foldl (Symtab.merge op =) (hd depss, tl depss);
nipkow@9282
   500
wenzelm@4488
   501
      val axioms' = Symtab.empty;
wenzelm@4019
   502
wenzelm@3996
   503
      fun eq_ora ((_, (_, s1: stamp)), (_, (_, s2))) = s1 = s2;
wenzelm@3996
   504
      val oracles' =
wenzelm@3996
   505
        Symtab.make (gen_distinct eq_ora
wenzelm@3996
   506
          (flat (map (Symtab.dest o #oracles o rep_theory) thys)))
wenzelm@3996
   507
        handle Symtab.DUPS names => err_dup_oras names;
wenzelm@4019
   508
wenzelm@4019
   509
      val parents' = gen_distinct eq_thy thys;
wenzelm@4019
   510
      val ancestors' =
wenzelm@4019
   511
        gen_distinct eq_thy (parents' @ flat (map ancestors_of thys));
wenzelm@3996
   512
    in
nipkow@9282
   513
      make_theory sign' deps' axioms' oracles' parents' ancestors'
wenzelm@3996
   514
    end;
paulson@1526
   515
wenzelm@3885
   516
paulson@1526
   517
end;
paulson@1526
   518
wenzelm@3767
   519
structure BasicTheory: BASIC_THEORY = Theory;
wenzelm@3767
   520
open BasicTheory;