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