src/Pure/theory.ML
author skalberg
Thu Oct 09 18:13:32 2003 +0200 (2003-10-09)
changeset 14223 0ee05eef881b
parent 14204 2fa6ecb87d47
child 14645 83776a9f0a9c
permissions -rw-r--r--
Added support for making constants final, that is, ensuring that no
definition can be given later (useful for constants whose behaviour is
fixed axiomatically rather than definitionally).
paulson@1526
     1
(*  Title:      Pure/theory.ML
paulson@1526
     2
    ID:         $Id$
paulson@1526
     3
    Author:     Lawrence C Paulson and Markus Wenzel
wenzelm@12785
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
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,
skalberg@14223
    16
      final_consts: typ list Symtab.table,
wenzelm@3996
    17
      axioms: term Symtab.table,
wenzelm@4996
    18
      oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table,
wenzelm@4019
    19
      parents: theory list,
wenzelm@4019
    20
      ancestors: theory list}
wenzelm@3996
    21
  val sign_of: theory -> Sign.sg
wenzelm@6188
    22
  val is_draft: theory -> bool
wenzelm@3996
    23
  val syn_of: theory -> Syntax.syntax
wenzelm@3996
    24
  val parents_of: theory -> theory list
wenzelm@4019
    25
  val ancestors_of: theory -> theory list
wenzelm@3996
    26
  val subthy: theory * theory -> bool
wenzelm@3996
    27
  val eq_thy: theory * theory -> bool
wenzelm@3996
    28
  val cert_axm: Sign.sg -> string * term -> string * term
wenzelm@6311
    29
  val read_def_axm: Sign.sg * (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@6311
    30
    string list -> string * string -> string * term
wenzelm@3996
    31
  val read_axm: Sign.sg -> string * string -> string * term
wenzelm@3996
    32
  val inferT_axm: Sign.sg -> string * term -> string * term
wenzelm@3767
    33
end
wenzelm@3767
    34
wenzelm@3767
    35
signature THEORY =
wenzelm@3767
    36
sig
wenzelm@3767
    37
  include BASIC_THEORY
wenzelm@3996
    38
  val axiomK: string
wenzelm@3996
    39
  val oracleK: string
wenzelm@4912
    40
  (*theory extension primitives*)
wenzelm@3996
    41
  val add_classes: (bclass * xclass list) list -> theory -> theory
wenzelm@3996
    42
  val add_classes_i: (bclass * class list) list -> theory -> theory
wenzelm@3996
    43
  val add_classrel: (xclass * xclass) list -> theory -> theory
wenzelm@3996
    44
  val add_classrel_i: (class * class) list -> theory -> theory
wenzelm@8897
    45
  val add_defsort: string -> theory -> theory
wenzelm@3996
    46
  val add_defsort_i: sort -> theory -> theory
wenzelm@3996
    47
  val add_types: (bstring * int * mixfix) list -> theory -> theory
wenzelm@4846
    48
  val add_nonterminals: bstring list -> theory -> theory
wenzelm@3996
    49
  val add_tyabbrs: (bstring * string list * string * mixfix) list
paulson@1526
    50
    -> theory -> theory
wenzelm@3996
    51
  val add_tyabbrs_i: (bstring * string list * typ * mixfix) list
paulson@1526
    52
    -> theory -> theory
wenzelm@8897
    53
  val add_arities: (xstring * string list * string) list -> theory -> theory
wenzelm@3996
    54
  val add_arities_i: (string * sort list * sort) list -> theory -> theory
wenzelm@3996
    55
  val add_consts: (bstring * string * mixfix) list -> theory -> theory
wenzelm@3996
    56
  val add_consts_i: (bstring * typ * mixfix) list -> theory -> theory
wenzelm@3996
    57
  val add_syntax: (bstring * string * mixfix) list -> theory -> theory
wenzelm@3996
    58
  val add_syntax_i: (bstring * typ * mixfix) list -> theory -> theory
wenzelm@3996
    59
  val add_modesyntax: string * bool -> (bstring * string * mixfix) list -> theory -> theory
wenzelm@3996
    60
  val add_modesyntax_i: string * bool -> (bstring * typ * mixfix) list -> theory -> theory
wenzelm@3996
    61
  val add_trfuns:
wenzelm@4344
    62
    (string * (Syntax.ast list -> Syntax.ast)) list *
wenzelm@4344
    63
    (string * (term list -> term)) list *
wenzelm@4344
    64
    (string * (term list -> term)) list *
wenzelm@4344
    65
    (string * (Syntax.ast list -> Syntax.ast)) list -> theory -> theory
wenzelm@3996
    66
  val add_trfunsT:
wenzelm@4344
    67
    (string * (bool -> typ -> term list -> term)) list -> theory -> theory
wenzelm@2693
    68
  val add_tokentrfuns:
wenzelm@6311
    69
    (string * string * (string -> string * real)) list -> theory -> theory
wenzelm@6311
    70
  val add_mode_tokentrfuns: string -> (string * (string -> string * real)) list
wenzelm@6311
    71
    -> theory -> theory
wenzelm@4617
    72
  val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@3996
    73
  val add_trrules_i: Syntax.ast Syntax.trrule list -> theory -> theory
wenzelm@3996
    74
  val add_axioms: (bstring * string) list -> theory -> theory
wenzelm@3996
    75
  val add_axioms_i: (bstring * term) list -> theory -> theory
wenzelm@4996
    76
  val add_oracle: bstring * (Sign.sg * Object.T -> term) -> theory -> theory
skalberg@14223
    77
  val add_finals: bool -> string list -> theory -> theory
skalberg@14223
    78
  val add_finals_i: bool -> term list -> theory -> theory
wenzelm@9320
    79
  val add_defs: bool -> (bstring * string) list -> theory -> theory
wenzelm@9320
    80
  val add_defs_i: bool -> (bstring * term) list -> theory -> theory
wenzelm@3996
    81
  val add_path: string -> theory -> theory
wenzelm@4846
    82
  val parent_path: theory -> theory
wenzelm@4846
    83
  val root_path: theory -> theory
wenzelm@11501
    84
  val absolute_path: theory -> theory
wenzelm@12588
    85
  val hide_space: bool -> string * xstring list -> theory -> theory
wenzelm@12588
    86
  val hide_space_i: bool -> string * string list -> theory -> theory
wenzelm@12588
    87
  val hide_classes: bool -> string list -> theory -> theory
wenzelm@12588
    88
  val hide_types: bool -> string list -> theory -> theory
wenzelm@12588
    89
  val hide_consts: bool -> string list -> theory -> theory
wenzelm@3996
    90
  val add_name: string -> theory -> theory
wenzelm@5862
    91
  val copy: theory -> theory
wenzelm@6661
    92
  val prep_ext: theory -> theory
wenzelm@3996
    93
  val prep_ext_merge: theory list -> theory
paulson@4970
    94
  val requires: theory -> string -> string -> unit
wenzelm@6369
    95
  val assert_super: theory -> theory -> theory
wenzelm@3996
    96
  val pre_pure: theory
paulson@1526
    97
end;
paulson@1526
    98
wenzelm@6188
    99
signature PRIVATE_THEORY =
wenzelm@5642
   100
sig
wenzelm@5642
   101
  include THEORY
wenzelm@6546
   102
  val init_data: Object.kind -> (Object.T * (Object.T -> Object.T) * (Object.T -> Object.T) *
wenzelm@12311
   103
    (Object.T * Object.T -> Object.T) * (Sign.sg -> Object.T -> unit)) -> theory -> theory
wenzelm@5642
   104
  val print_data: Object.kind -> theory -> unit
wenzelm@5642
   105
  val get_data: Object.kind -> (Object.T -> 'a) -> theory -> 'a
wenzelm@5642
   106
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> theory -> theory
wenzelm@5642
   107
end;
paulson@1526
   108
wenzelm@5642
   109
wenzelm@6188
   110
structure Theory: PRIVATE_THEORY =
paulson@1526
   111
struct
wenzelm@2206
   112
wenzelm@3996
   113
wenzelm@2206
   114
(** datatype theory **)
paulson@1526
   115
wenzelm@9320
   116
(*Note: dependencies are only tracked for non-overloaded constant definitions*)
wenzelm@9320
   117
paulson@1526
   118
datatype theory =
paulson@1526
   119
  Theory of {
paulson@1526
   120
    sign: Sign.sg,
wenzelm@9320
   121
    const_deps: unit Graph.T,
skalberg@14223
   122
    final_consts: typ list Symtab.table,
wenzelm@3996
   123
    axioms: term Symtab.table,
wenzelm@4996
   124
    oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table,
wenzelm@4019
   125
    parents: theory list,
wenzelm@4019
   126
    ancestors: theory list};
paulson@1526
   127
skalberg@14223
   128
fun make_theory sign const_deps final_consts axioms oracles parents ancestors =
skalberg@14223
   129
  Theory {sign = sign, const_deps = const_deps, final_consts = final_consts, axioms = axioms,
skalberg@14223
   130
    oracles = oracles,  parents = parents, ancestors = ancestors};
wenzelm@3996
   131
paulson@1526
   132
fun rep_theory (Theory args) = args;
paulson@1526
   133
wenzelm@3996
   134
val sign_of = #sign o rep_theory;
wenzelm@6188
   135
val is_draft = Sign.is_draft o sign_of;
wenzelm@3996
   136
val syn_of = #syn o Sign.rep_sg o sign_of;
wenzelm@3996
   137
val parents_of = #parents o rep_theory;
wenzelm@4019
   138
val ancestors_of = #ancestors o rep_theory;
wenzelm@3996
   139
paulson@1526
   140
(*errors involving theories*)
paulson@1526
   141
exception THEORY of string * theory list;
paulson@1526
   142
paulson@1526
   143
(*compare theories*)
paulson@1526
   144
val subthy = Sign.subsig o pairself sign_of;
paulson@1526
   145
val eq_thy = Sign.eq_sg o pairself sign_of;
paulson@1526
   146
wenzelm@6369
   147
(*check for some theory*)
paulson@4970
   148
fun requires thy name what =
wenzelm@10930
   149
  if Sign.exists_stamp name (sign_of thy) then ()
wenzelm@4846
   150
  else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what);
paulson@1526
   151
wenzelm@6369
   152
fun assert_super thy1 thy2 =
wenzelm@6369
   153
  if subthy (thy1, thy2) then thy2
wenzelm@6369
   154
  else raise THEORY ("Not a super theory", [thy1, thy2]);
wenzelm@6369
   155
wenzelm@4846
   156
(*partial Pure theory*)
nipkow@9282
   157
val pre_pure =
skalberg@14223
   158
  make_theory Sign.pre_pure Graph.empty Symtab.empty Symtab.empty Symtab.empty [] [];
paulson@1526
   159
paulson@1526
   160
paulson@1526
   161
paulson@1526
   162
(** extend theory **)
paulson@1526
   163
wenzelm@8725
   164
(*name spaces*)
wenzelm@3996
   165
val axiomK = "axiom";
wenzelm@3814
   166
val oracleK = "oracle";
wenzelm@3814
   167
wenzelm@3814
   168
wenzelm@3814
   169
(* extend logical part of a theory *)
wenzelm@3814
   170
paulson@1526
   171
fun err_dup_axms names =
wenzelm@10494
   172
  error ("Duplicate axiom name(s): " ^ commas_quote names);
paulson@1526
   173
wenzelm@3814
   174
fun err_dup_oras names =
wenzelm@10494
   175
  error ("Duplicate oracles: " ^ commas_quote names);
wenzelm@3814
   176
wenzelm@9320
   177
fun ext_theory thy ext_sg ext_deps new_axms new_oras =
paulson@1526
   178
  let
skalberg@14223
   179
    val Theory {sign, const_deps, final_consts, axioms, oracles, parents, ancestors} = thy;
paulson@1526
   180
    val draft = Sign.is_draft sign;
wenzelm@3996
   181
    val axioms' =
wenzelm@4488
   182
      Symtab.extend (if draft then axioms else Symtab.empty, new_axms)
paulson@1526
   183
        handle Symtab.DUPS names => err_dup_axms names;
wenzelm@3814
   184
    val oracles' =
wenzelm@4488
   185
      Symtab.extend (oracles, new_oras)
wenzelm@3814
   186
        handle Symtab.DUPS names => err_dup_oras names;
wenzelm@4019
   187
    val (parents', ancestors') =
wenzelm@4019
   188
      if draft then (parents, ancestors) else ([thy], thy :: ancestors);
paulson@1526
   189
  in
skalberg@14223
   190
    make_theory (ext_sg sign) (ext_deps const_deps) final_consts axioms' oracles' parents' ancestors'
paulson@1526
   191
  end;
paulson@1526
   192
paulson@1526
   193
paulson@1526
   194
(* extend signature of a theory *)
paulson@1526
   195
wenzelm@9320
   196
fun ext_sign extfun decls thy = ext_theory thy (extfun decls) I [] [];
paulson@1526
   197
wenzelm@4996
   198
val add_classes      = ext_sign Sign.add_classes;
wenzelm@4996
   199
val add_classes_i    = ext_sign Sign.add_classes_i;
wenzelm@4996
   200
val add_classrel     = ext_sign Sign.add_classrel;
wenzelm@4996
   201
val add_classrel_i   = ext_sign Sign.add_classrel_i;
wenzelm@4996
   202
val add_defsort      = ext_sign Sign.add_defsort;
wenzelm@4996
   203
val add_defsort_i    = ext_sign Sign.add_defsort_i;
wenzelm@4996
   204
val add_types        = ext_sign Sign.add_types;
wenzelm@4996
   205
val add_nonterminals = ext_sign Sign.add_nonterminals;
wenzelm@4996
   206
val add_tyabbrs      = ext_sign Sign.add_tyabbrs;
wenzelm@4996
   207
val add_tyabbrs_i    = ext_sign Sign.add_tyabbrs_i;
wenzelm@4996
   208
val add_arities      = ext_sign Sign.add_arities;
wenzelm@4996
   209
val add_arities_i    = ext_sign Sign.add_arities_i;
wenzelm@4996
   210
val add_consts       = ext_sign Sign.add_consts;
wenzelm@4996
   211
val add_consts_i     = ext_sign Sign.add_consts_i;
wenzelm@4996
   212
val add_syntax       = ext_sign Sign.add_syntax;
wenzelm@4996
   213
val add_syntax_i     = ext_sign Sign.add_syntax_i;
wenzelm@4996
   214
val add_modesyntax   = curry (ext_sign Sign.add_modesyntax);
wenzelm@4996
   215
val add_modesyntax_i = curry (ext_sign Sign.add_modesyntax_i);
wenzelm@4996
   216
val add_trfuns       = ext_sign Sign.add_trfuns;
wenzelm@4996
   217
val add_trfunsT      = ext_sign Sign.add_trfunsT;
wenzelm@4996
   218
val add_tokentrfuns  = ext_sign Sign.add_tokentrfuns;
wenzelm@6311
   219
fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f));
wenzelm@4996
   220
val add_trrules      = ext_sign Sign.add_trrules;
wenzelm@4996
   221
val add_trrules_i    = ext_sign Sign.add_trrules_i;
wenzelm@4996
   222
val add_path         = ext_sign Sign.add_path;
wenzelm@4846
   223
val parent_path      = add_path "..";
wenzelm@4846
   224
val root_path        = add_path "/";
wenzelm@11501
   225
val absolute_path    = add_path "//";
wenzelm@4996
   226
val add_space        = ext_sign Sign.add_space;
wenzelm@12588
   227
val hide_space       = ext_sign o Sign.hide_space;
wenzelm@12588
   228
val hide_space_i     = ext_sign o Sign.hide_space_i;
wenzelm@12588
   229
fun hide_classes b   = curry (hide_space_i b) Sign.classK;
wenzelm@12588
   230
fun hide_types b     = curry (hide_space_i b) Sign.typeK;
wenzelm@12588
   231
fun hide_consts b    = curry (hide_space_i b) 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
berghofe@14184
   245
fun no_vars sg tm = (case (term_vars tm, term_tvars tm) of
berghofe@14184
   246
    ([], []) => tm
berghofe@14184
   247
  | (ts, ixns) => error (Pretty.string_of (Pretty.block (Pretty.breaks
berghofe@14184
   248
      (Pretty.str "Illegal schematic variable(s) in term:" ::
berghofe@14184
   249
       map (Sign.pretty_term sg) ts @
berghofe@14184
   250
       map (Sign.pretty_typ sg o TVar) ixns)))));
paulson@1526
   251
paulson@1526
   252
fun cert_axm sg (name, raw_tm) =
paulson@1526
   253
  let
paulson@1526
   254
    val (t, T, _) = Sign.certify_term sg raw_tm
wenzelm@2979
   255
      handle TYPE (msg, _, _) => error msg
wenzelm@3996
   256
           | TERM (msg, _) => error msg;
paulson@1526
   257
  in
wenzelm@9537
   258
    Term.no_dummy_patterns t handle TERM (msg, _) => error msg;
paulson@1526
   259
    assert (T = propT) "Term not of type prop";
berghofe@14184
   260
    (name, no_vars sg t)
wenzelm@9629
   261
  end;
paulson@1526
   262
wenzelm@5057
   263
(*some duplication of code with read_def_cterm*)
wenzelm@6661
   264
fun read_def_axm (sg, types, sorts) used (name, str) =
wenzelm@3814
   265
  let
wenzelm@3814
   266
    val ts = Syntax.read (#syn (Sign.rep_sg sg)) propT str;
wenzelm@5057
   267
    val (t, _) = Sign.infer_types sg types sorts used true (ts, propT);
wenzelm@9320
   268
  in cert_axm sg (name, t) end
paulson@1960
   269
  handle ERROR => err_in_axm name;
paulson@1526
   270
wenzelm@5057
   271
fun read_axm sg name_str = read_def_axm (sg, K None, K None) [] name_str;
wenzelm@5057
   272
paulson@1526
   273
fun inferT_axm sg (name, pre_tm) =
wenzelm@3814
   274
  let
wenzelm@4251
   275
    val (t, _) = Sign.infer_types sg (K None) (K None) [] true ([pre_tm], propT);
berghofe@14184
   276
  in (name, no_vars sg t) end
paulson@1526
   277
  handle ERROR => err_in_axm name;
paulson@1526
   278
paulson@1526
   279
paulson@1526
   280
(* extend axioms of a theory *)
paulson@1526
   281
wenzelm@3814
   282
fun ext_axms prep_axm raw_axms (thy as Theory {sign, ...}) =
paulson@1526
   283
  let
wenzelm@3814
   284
    val raw_axms' = map (apfst (Sign.full_name sign)) raw_axms;
wenzelm@3814
   285
    val axioms =
wenzelm@3814
   286
      map (apsnd (Term.compress_term o Logic.varify) o prep_axm sign) raw_axms';
wenzelm@4996
   287
    val ext_sg = Sign.add_space (axiomK, map fst axioms);
wenzelm@9320
   288
  in ext_theory thy ext_sg I axioms [] end;
paulson@1526
   289
paulson@1526
   290
val add_axioms = ext_axms read_axm;
paulson@1526
   291
val add_axioms_i = ext_axms cert_axm;
paulson@1526
   292
paulson@1526
   293
wenzelm@3814
   294
(* add oracle **)
wenzelm@3814
   295
wenzelm@3814
   296
fun add_oracle (raw_name, oracle) (thy as Theory {sign, ...}) =
wenzelm@3814
   297
  let
wenzelm@3814
   298
    val name = Sign.full_name sign raw_name;
wenzelm@4996
   299
    val ext_sg = Sign.add_space (oracleK, [name]);
wenzelm@9320
   300
  in ext_theory thy ext_sg I [] [(name, (oracle, stamp ()))] end;
wenzelm@3814
   301
wenzelm@3814
   302
wenzelm@3767
   303
wenzelm@3767
   304
(** add constant definitions **)
wenzelm@3767
   305
wenzelm@3767
   306
(* clash_types, clash_consts *)
wenzelm@3767
   307
wenzelm@3767
   308
(*check if types have common instance (ignoring sorts)*)
wenzelm@3767
   309
wenzelm@3767
   310
fun clash_types ty1 ty2 =
wenzelm@3767
   311
  let
wenzelm@3767
   312
    val ty1' = Type.varifyT ty1;
wenzelm@3767
   313
    val ty2' = incr_tvar (maxidx_of_typ ty1' + 1) (Type.varifyT ty2);
wenzelm@9320
   314
  in Type.raw_unify (ty1', ty2') 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) =
skalberg@14204
   323
  let val (c, ty') = dest_Const (head_of (fst (Logic.dest_equals (Logic.strip_imp_concl 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@9320
   331
(* overloading *)
nipkow@9280
   332
wenzelm@9320
   333
datatype overloading = NoOverloading | Useless | Plain;
wenzelm@9320
   334
wenzelm@9320
   335
fun overloading sg declT defT =
wenzelm@10403
   336
  let val T = Term.incr_tvar (maxidx_of_typ declT + 1) (Type.varifyT defT) in
wenzelm@10403
   337
    if Sign.typ_instance sg (declT, T) then NoOverloading
wenzelm@10403
   338
    else if Sign.typ_instance sg (Type.rem_sorts declT, Type.rem_sorts T) then Useless
wenzelm@9320
   339
    else Plain
nipkow@9280
   340
  end;
nipkow@9280
   341
nipkow@9280
   342
wenzelm@3767
   343
(* dest_defn *)
wenzelm@3767
   344
wenzelm@3767
   345
fun dest_defn tm =
wenzelm@3767
   346
  let
wenzelm@3787
   347
    fun err msg = raise TERM (msg, [tm]);
wenzelm@3767
   348
wenzelm@3767
   349
    val (lhs, rhs) = Logic.dest_equals (Logic.strip_imp_concl tm)
wenzelm@3767
   350
      handle TERM _ => err "Not a meta-equality (==)";
wenzelm@3767
   351
    val (head, args) = strip_comb lhs;
wenzelm@9320
   352
    val c_ty as (c, ty) = dest_Const head
wenzelm@3767
   353
      handle TERM _ => err "Head of lhs not a constant";
wenzelm@3767
   354
wenzelm@4141
   355
    fun dest_free (Free (x, _)) = x
wenzelm@4141
   356
      | dest_free (Const ("TYPE", Type ("itself", [TFree (x, _)]))) = x
wenzelm@4141
   357
      | dest_free _ = raise Match;
wenzelm@4141
   358
wenzelm@4141
   359
    val show_frees = commas_quote o map dest_free;
wenzelm@3767
   360
    val show_tfrees = commas_quote o map fst;
wenzelm@3767
   361
wenzelm@3767
   362
    val lhs_dups = duplicates args;
wenzelm@3767
   363
    val rhs_extras = gen_rems (op =) (term_frees rhs, args);
wenzelm@3767
   364
    val rhs_extrasT = gen_rems (op =) (term_tfrees rhs, typ_tfrees ty);
wenzelm@3767
   365
  in
wenzelm@4141
   366
    if not (forall (can dest_free) args) then
wenzelm@3767
   367
      err "Arguments (on lhs) must be variables"
wenzelm@3767
   368
    else if not (null lhs_dups) then
wenzelm@3767
   369
      err ("Duplicate variables on lhs: " ^ show_frees lhs_dups)
wenzelm@3767
   370
    else if not (null rhs_extras) then
wenzelm@3767
   371
      err ("Extra variables on rhs: " ^ show_frees rhs_extras)
wenzelm@3767
   372
    else if not (null rhs_extrasT) then
wenzelm@3767
   373
      err ("Extra type variables on rhs: " ^ show_tfrees rhs_extrasT)
nipkow@9282
   374
    else if exists_Const (fn c_ty' => c_ty' = c_ty) rhs then
wenzelm@3767
   375
      err ("Constant to be defined occurs on rhs")
wenzelm@9320
   376
    else (c_ty, rhs)
wenzelm@3767
   377
  end;
wenzelm@3767
   378
wenzelm@3767
   379
wenzelm@3767
   380
(* check_defn *)
wenzelm@3767
   381
wenzelm@3814
   382
fun err_in_defn sg name msg =
wenzelm@9320
   383
  (error_msg msg;
wenzelm@9320
   384
    error ("The error(s) above occurred in definition " ^ quote (Sign.full_name sg name)));
wenzelm@9320
   385
wenzelm@9332
   386
fun cycle_msg namess = "Cyclic dependency of constants:\n" ^
wenzelm@9332
   387
  cat_lines (map (space_implode " -> " o map quote o rev) namess);
wenzelm@3767
   388
wenzelm@9320
   389
fun add_deps (c, cs) deps =
wenzelm@9320
   390
  let fun declare (G, x) = Graph.new_node (x, ()) G handle Graph.DUP _ => G
wenzelm@9320
   391
  in foldl declare (deps, c :: cs) |> Graph.add_deps_acyclic (c, cs) end;
wenzelm@9320
   392
skalberg@14223
   393
fun check_defn sg overloaded final_consts ((deps, axms), def as (name, tm)) =
skalberg@14223
   394
  let
skalberg@14223
   395
    fun is_final (c, ty) =
skalberg@14223
   396
      case Symtab.lookup(final_consts,c) of
skalberg@14223
   397
        Some [] => true
skalberg@14223
   398
      | Some tys => exists (curry (Sign.typ_instance sg) ty) tys
skalberg@14223
   399
      | None => false;
wenzelm@9320
   400
wenzelm@10494
   401
    fun pretty_const (c, ty) = [Pretty.str c, Pretty.str " ::", Pretty.brk 1,
wenzelm@10494
   402
      Pretty.quote (Sign.pretty_typ sg (#1 (Type.freeze_thaw_type ty)))];
wenzelm@3767
   403
wenzelm@10494
   404
    fun def_txt (c_ty, txt) = Pretty.block
wenzelm@10494
   405
      (Pretty.str "Definition of " :: pretty_const c_ty @
wenzelm@10494
   406
        (if txt = "" then [] else [Pretty.str txt]));
wenzelm@10494
   407
wenzelm@10494
   408
    fun show_defn c (dfn, ty') = Pretty.block
wenzelm@10494
   409
      (Pretty.str "  " :: pretty_const (c, ty') @ [Pretty.str " in ", Pretty.str dfn]);
wenzelm@3767
   410
wenzelm@9320
   411
    val (c_ty as (c, ty), rhs) = dest_defn tm
nipkow@9280
   412
      handle TERM (msg, _) => err_in_defn sg name msg;
wenzelm@9320
   413
    val c_decl =
wenzelm@9320
   414
      (case Sign.const_type sg c of Some T => T
wenzelm@9320
   415
      | None => err_in_defn sg name ("Undeclared constant " ^ quote c));
wenzelm@9320
   416
wenzelm@9320
   417
    val clashed = clash_defns c_ty axms;
wenzelm@3767
   418
  in
wenzelm@9320
   419
    if not (null clashed) then
wenzelm@10494
   420
      err_in_defn sg name (Pretty.string_of (Pretty.chunks
wenzelm@10494
   421
        (def_txt (c_ty, " clashes with") :: map (show_defn c) clashed)))
skalberg@14223
   422
    else if is_final c_ty then
skalberg@14223
   423
      err_in_defn sg name (Pretty.string_of (Pretty.block
skalberg@14223
   424
        ([Pretty.str "The constant",Pretty.brk 1] @
skalberg@14223
   425
	 pretty_const c_ty @
skalberg@14223
   426
	 [Pretty.brk 1,Pretty.str "has been declared final"])))
wenzelm@9320
   427
    else
wenzelm@9320
   428
      (case overloading sg c_decl ty of
wenzelm@9320
   429
        NoOverloading =>
nipkow@13646
   430
          (add_deps (c, Term.term_consts rhs) deps
wenzelm@9320
   431
              handle Graph.CYCLES namess => err_in_defn sg name (cycle_msg namess),
wenzelm@9320
   432
            def :: axms)
wenzelm@9320
   433
      | Useless =>
wenzelm@10494
   434
           err_in_defn sg name (Pretty.string_of (Pretty.chunks
wenzelm@10494
   435
             [Library.setmp show_sorts true def_txt (c_ty, ""), Pretty.str
wenzelm@10494
   436
                 "imposes additional sort constraints on the declared type of the constant"]))
wenzelm@9320
   437
      | Plain =>
wenzelm@10494
   438
         (if not overloaded then warning (Pretty.string_of (Pretty.chunks
wenzelm@10494
   439
           [def_txt (c_ty, ""), Pretty.str ("is strictly less general than the declared type (see "
wenzelm@10494
   440
               ^ quote (Sign.full_name sg name) ^ ")")]))
wenzelm@9320
   441
         else (); (deps, def :: axms)))
wenzelm@3767
   442
  end;
wenzelm@3767
   443
wenzelm@3767
   444
wenzelm@3767
   445
(* add_defs *)
wenzelm@3767
   446
wenzelm@9320
   447
fun ext_defns prep_axm overloaded raw_axms thy =
wenzelm@3767
   448
  let
skalberg@14223
   449
    val Theory {sign, const_deps, final_consts, axioms, oracles, parents, ancestors} = thy;
wenzelm@9320
   450
    val all_axioms = flat (map (Symtab.dest o #axioms o rep_theory) (thy :: ancestors));
wenzelm@9320
   451
wenzelm@9320
   452
    val axms = map (prep_axm sign) raw_axms;
skalberg@14223
   453
    val (const_deps', _) = foldl (check_defn sign overloaded final_consts) ((const_deps, all_axioms), axms);
wenzelm@3767
   454
  in
skalberg@14223
   455
    make_theory sign const_deps' final_consts axioms oracles parents ancestors
wenzelm@9320
   456
    |> add_axioms_i axms
wenzelm@3767
   457
  end;
wenzelm@3767
   458
wenzelm@3767
   459
val add_defs_i = ext_defns cert_axm;
wenzelm@3767
   460
val add_defs = ext_defns read_axm;
wenzelm@3767
   461
wenzelm@3767
   462
skalberg@14223
   463
(* add_finals *)
skalberg@14223
   464
skalberg@14223
   465
fun ext_finals prep_term overloaded raw_terms thy =
skalberg@14223
   466
  let
skalberg@14223
   467
    val Theory {sign, const_deps, final_consts, axioms, oracles, parents, ancestors} = thy;
skalberg@14223
   468
    fun mk_final (finals,tm) =
skalberg@14223
   469
      let
skalberg@14223
   470
        fun err msg = raise TERM(msg,[tm]);
skalberg@14223
   471
        val (c,ty) = dest_Const tm
skalberg@14223
   472
          handle TERM _ => err "Can only make constants final";
skalberg@14223
   473
        val c_decl =
skalberg@14223
   474
          (case Sign.const_type sign c of Some T => T
skalberg@14223
   475
          | None => err ("Undeclared constant " ^ quote c));
skalberg@14223
   476
        val simple =
skalberg@14223
   477
	  case overloading sign c_decl ty of
skalberg@14223
   478
	    NoOverloading => true
skalberg@14223
   479
	  | Useless => err "Sort restrictions too strong"
skalberg@14223
   480
	  | Plain => if overloaded then false
skalberg@14223
   481
		     else err "Type is more general than declared";
skalberg@14223
   482
        val typ_instance = Sign.typ_instance sign;
skalberg@14223
   483
      in
skalberg@14223
   484
        if simple then
skalberg@14223
   485
	  (case Symtab.lookup(finals,c) of
skalberg@14223
   486
	    Some [] => err "Constant already final"
skalberg@14223
   487
	  | _ => Symtab.update((c,[]),finals))
skalberg@14223
   488
	else
skalberg@14223
   489
	  (case Symtab.lookup(finals,c) of
skalberg@14223
   490
	    Some [] => err "Constant already completely final"
skalberg@14223
   491
          | Some tys => if exists (curry typ_instance ty) tys
skalberg@14223
   492
			then err "Instance of constant is already final"
skalberg@14223
   493
			else Symtab.update((c,ty::gen_rem typ_instance (tys,ty)),finals)
skalberg@14223
   494
	  | None => Symtab.update((c,[ty]),finals))
skalberg@14223
   495
      end;
skalberg@14223
   496
    val consts = map (prep_term sign) raw_terms;
skalberg@14223
   497
    val final_consts' = foldl mk_final (final_consts,consts);
skalberg@14223
   498
  in
skalberg@14223
   499
    make_theory sign const_deps final_consts' axioms oracles parents ancestors
skalberg@14223
   500
  end;
skalberg@14223
   501
skalberg@14223
   502
local
skalberg@14223
   503
  fun read_term sg = Sign.simple_read_term sg TypeInfer.logicT;
skalberg@14223
   504
  val cert_term = #1 oo Sign.certify_term;
skalberg@14223
   505
in
skalberg@14223
   506
val add_finals = ext_finals read_term;
skalberg@14223
   507
val add_finals_i = ext_finals cert_term;
skalberg@14223
   508
end;
skalberg@14223
   509
skalberg@14223
   510
fun merge_final sg =
skalberg@14223
   511
  let
skalberg@14223
   512
    fun merge_single (tys,ty) =
skalberg@14223
   513
      if exists (curry (Sign.typ_instance sg) ty) tys
skalberg@14223
   514
      then tys
skalberg@14223
   515
      else (ty::gen_rem (Sign.typ_instance sg) (tys,ty));
skalberg@14223
   516
    fun merge ([],_) = []
skalberg@14223
   517
      | merge (_,[]) = []
skalberg@14223
   518
      | merge input = foldl merge_single input;
skalberg@14223
   519
  in
skalberg@14223
   520
    Some o merge
skalberg@14223
   521
  end;
skalberg@14223
   522
wenzelm@3878
   523
wenzelm@3865
   524
(** additional theory data **)
wenzelm@3865
   525
wenzelm@4996
   526
val init_data = curry (ext_sign Sign.init_data);
wenzelm@4996
   527
fun print_data kind = Sign.print_data kind o sign_of;
wenzelm@4996
   528
fun get_data kind f = Sign.get_data kind f o sign_of;
wenzelm@4996
   529
fun put_data kind f = ext_sign (Sign.put_data kind f);
wenzelm@3865
   530
wenzelm@3865
   531
wenzelm@3767
   532
wenzelm@6661
   533
(** merge theories **)          (*exception ERROR*)
wenzelm@4019
   534
wenzelm@4019
   535
fun merge_sign (sg, thy) =
wenzelm@4627
   536
  Sign.nontriv_merge (sg, sign_of thy) handle TERM (msg, _) => error msg;
paulson@1526
   537
wenzelm@3878
   538
(*merge list of theories from left to right, preparing extend*)
wenzelm@3967
   539
fun prep_ext_merge thys =
wenzelm@3996
   540
  if null thys then
wenzelm@4019
   541
    error "Merge: no parent theories"
wenzelm@6188
   542
  else if exists is_draft thys then
wenzelm@4019
   543
    error "Attempt to merge draft theories"
wenzelm@3996
   544
  else
wenzelm@3996
   545
    let
wenzelm@3996
   546
      val sign' =
wenzelm@4019
   547
        foldl merge_sign (sign_of (hd thys), tl thys)
wenzelm@3996
   548
        |> Sign.prep_ext
wenzelm@3996
   549
        |> Sign.add_path "/";
wenzelm@3814
   550
nipkow@9282
   551
      val depss = map (#const_deps o rep_theory) thys;
wenzelm@9320
   552
      val deps' = foldl (Graph.merge_acyclic (K true)) (hd depss, tl depss)
wenzelm@9320
   553
        handle Graph.CYCLES namess => error (cycle_msg namess);
nipkow@9282
   554
skalberg@14223
   555
      val final_constss = map (#final_consts o rep_theory) thys;
skalberg@14223
   556
      val final_consts' = foldl (Symtab.join (merge_final sign')) (hd final_constss,
skalberg@14223
   557
								   tl final_constss);
wenzelm@4488
   558
      val axioms' = Symtab.empty;
wenzelm@4019
   559
wenzelm@3996
   560
      fun eq_ora ((_, (_, s1: stamp)), (_, (_, s2))) = s1 = s2;
wenzelm@3996
   561
      val oracles' =
wenzelm@3996
   562
        Symtab.make (gen_distinct eq_ora
wenzelm@3996
   563
          (flat (map (Symtab.dest o #oracles o rep_theory) thys)))
wenzelm@3996
   564
        handle Symtab.DUPS names => err_dup_oras names;
wenzelm@4019
   565
wenzelm@4019
   566
      val parents' = gen_distinct eq_thy thys;
wenzelm@4019
   567
      val ancestors' =
wenzelm@4019
   568
        gen_distinct eq_thy (parents' @ flat (map ancestors_of thys));
wenzelm@3996
   569
    in
skalberg@14223
   570
      make_theory sign' deps' final_consts' axioms' oracles' parents' ancestors'
wenzelm@3996
   571
    end;
paulson@1526
   572
wenzelm@3885
   573
paulson@1526
   574
end;
paulson@1526
   575
wenzelm@3767
   576
structure BasicTheory: BASIC_THEORY = Theory;
wenzelm@3767
   577
open BasicTheory;