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