src/Pure/theory.ML
author wenzelm
Sat Jun 11 22:15:54 2005 +0200 (2005-06-11)
changeset 16369 96d73621fabb
parent 16339 b02b6da609c3
child 16443 82a116532e3e
permissions -rw-r--r--
renamed hide_classes/types/consts to hide_XXX_i;
added separate hide_classes/types/consts;
refer to name spaces values instead of names;
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
wenzelm@5025
     5
The abstract type "theory" of theories.
paulson@1526
     6
*)
wenzelm@16291
     7
wenzelm@3767
     8
signature BASIC_THEORY =
wenzelm@3767
     9
sig
paulson@1526
    10
  type theory
paulson@1526
    11
  exception THEORY of string * theory list
wenzelm@3996
    12
  val rep_theory: theory ->
wenzelm@3814
    13
    {sign: Sign.sg,
wenzelm@16291
    14
      defs: Defs.graph,
wenzelm@16339
    15
      axioms: term NameSpace.table,
wenzelm@16339
    16
      oracles: ((Sign.sg * Object.T -> term) * stamp) NameSpace.table,
wenzelm@4019
    17
      parents: theory list,
wenzelm@4019
    18
      ancestors: theory list}
wenzelm@3996
    19
  val sign_of: theory -> Sign.sg
wenzelm@6188
    20
  val is_draft: theory -> bool
wenzelm@3996
    21
  val syn_of: theory -> Syntax.syntax
wenzelm@3996
    22
  val parents_of: theory -> theory list
wenzelm@4019
    23
  val ancestors_of: theory -> theory list
wenzelm@3996
    24
  val subthy: theory * theory -> bool
wenzelm@3996
    25
  val eq_thy: theory * theory -> bool
wenzelm@3996
    26
  val cert_axm: Sign.sg -> string * term -> string * term
wenzelm@6311
    27
  val read_def_axm: Sign.sg * (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@6311
    28
    string list -> string * string -> string * term
wenzelm@3996
    29
  val read_axm: Sign.sg -> string * string -> string * term
wenzelm@3996
    30
  val inferT_axm: Sign.sg -> string * term -> string * term
wenzelm@3767
    31
end
wenzelm@3767
    32
wenzelm@3767
    33
signature THEORY =
wenzelm@3767
    34
sig
wenzelm@3767
    35
  include BASIC_THEORY
wenzelm@16339
    36
  val axioms_of: theory -> (string * term) list
wenzelm@16339
    37
  val all_axioms_of: theory -> (string * term) list
wenzelm@16339
    38
  val add_classes: (bstring * xstring list) list -> theory -> theory
wenzelm@16339
    39
  val add_classes_i: (bstring * class list) list -> theory -> theory
wenzelm@16339
    40
  val add_classrel: (xstring * xstring) list -> theory -> theory
wenzelm@3996
    41
  val add_classrel_i: (class * class) list -> theory -> theory
wenzelm@8897
    42
  val add_defsort: string -> theory -> theory
wenzelm@3996
    43
  val add_defsort_i: sort -> theory -> theory
wenzelm@3996
    44
  val add_types: (bstring * int * mixfix) list -> theory -> theory
wenzelm@4846
    45
  val add_nonterminals: bstring list -> theory -> theory
wenzelm@3996
    46
  val add_tyabbrs: (bstring * string list * string * mixfix) list
paulson@1526
    47
    -> theory -> theory
wenzelm@3996
    48
  val add_tyabbrs_i: (bstring * string list * typ * mixfix) list
paulson@1526
    49
    -> theory -> theory
wenzelm@8897
    50
  val add_arities: (xstring * string list * string) list -> theory -> theory
wenzelm@3996
    51
  val add_arities_i: (string * sort list * sort) list -> theory -> theory
wenzelm@3996
    52
  val add_consts: (bstring * string * mixfix) list -> theory -> theory
wenzelm@3996
    53
  val add_consts_i: (bstring * typ * mixfix) list -> theory -> theory
wenzelm@3996
    54
  val add_syntax: (bstring * string * mixfix) list -> theory -> theory
wenzelm@3996
    55
  val add_syntax_i: (bstring * typ * mixfix) list -> theory -> theory
wenzelm@3996
    56
  val add_modesyntax: string * bool -> (bstring * string * mixfix) list -> theory -> theory
wenzelm@3996
    57
  val add_modesyntax_i: string * bool -> (bstring * typ * mixfix) list -> theory -> theory
wenzelm@15747
    58
  val del_modesyntax: string * bool -> (bstring * string * mixfix) list -> theory -> theory
wenzelm@15747
    59
  val del_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@14645
    67
  val add_advanced_trfuns:
wenzelm@14645
    68
    (string * (Sign.sg -> Syntax.ast list -> Syntax.ast)) list *
wenzelm@14645
    69
    (string * (Sign.sg -> term list -> term)) list *
wenzelm@14645
    70
    (string * (Sign.sg -> term list -> term)) list *
wenzelm@14645
    71
    (string * (Sign.sg -> Syntax.ast list -> Syntax.ast)) list -> theory -> theory
wenzelm@14645
    72
  val add_advanced_trfunsT:
wenzelm@14645
    73
    (string * (Sign.sg -> bool -> typ -> term list -> term)) list -> theory -> theory
wenzelm@2693
    74
  val add_tokentrfuns:
wenzelm@6311
    75
    (string * string * (string -> string * real)) list -> theory -> theory
wenzelm@6311
    76
  val add_mode_tokentrfuns: string -> (string * (string -> string * real)) list
wenzelm@6311
    77
    -> theory -> theory
wenzelm@4617
    78
  val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
wenzelm@3996
    79
  val add_trrules_i: Syntax.ast Syntax.trrule list -> theory -> theory
wenzelm@3996
    80
  val add_axioms: (bstring * string) list -> theory -> theory
wenzelm@3996
    81
  val add_axioms_i: (bstring * term) list -> theory -> theory
wenzelm@4996
    82
  val add_oracle: bstring * (Sign.sg * Object.T -> term) -> theory -> theory
skalberg@14223
    83
  val add_finals: bool -> string list -> theory -> theory
skalberg@14223
    84
  val add_finals_i: bool -> term list -> theory -> theory
wenzelm@9320
    85
  val add_defs: bool -> (bstring * string) list -> theory -> theory
wenzelm@9320
    86
  val add_defs_i: bool -> (bstring * term) list -> theory -> theory
wenzelm@3996
    87
  val add_path: string -> theory -> theory
wenzelm@4846
    88
  val parent_path: theory -> theory
wenzelm@4846
    89
  val root_path: theory -> theory
wenzelm@11501
    90
  val absolute_path: theory -> theory
wenzelm@16134
    91
  val qualified_names: theory -> theory
wenzelm@16134
    92
  val no_base_names: theory -> theory
wenzelm@16134
    93
  val custom_accesses: (string list -> string list list) -> theory -> theory
wenzelm@16134
    94
  val set_policy: (string -> bstring -> string) * (string list -> string list list) ->
wenzelm@16134
    95
    theory -> theory
wenzelm@16134
    96
  val restore_naming: theory -> theory -> theory
wenzelm@16369
    97
  val hide_classes: bool -> xstring list -> theory -> theory
wenzelm@16369
    98
  val hide_classes_i: bool -> string list -> theory -> theory
wenzelm@16369
    99
  val hide_types: bool -> xstring list -> theory -> theory
wenzelm@16369
   100
  val hide_types_i: bool -> string list -> theory -> theory
wenzelm@16369
   101
  val hide_consts: bool -> xstring list -> theory -> theory
wenzelm@16369
   102
  val hide_consts_i: bool -> string list -> theory -> theory
wenzelm@3996
   103
  val add_name: string -> theory -> theory
wenzelm@5862
   104
  val copy: theory -> theory
wenzelm@6661
   105
  val prep_ext: theory -> theory
wenzelm@3996
   106
  val prep_ext_merge: theory list -> theory
paulson@4970
   107
  val requires: theory -> string -> string -> unit
wenzelm@6369
   108
  val assert_super: theory -> theory -> theory
wenzelm@3996
   109
  val pre_pure: theory
paulson@1526
   110
end;
paulson@1526
   111
wenzelm@6188
   112
signature PRIVATE_THEORY =
wenzelm@5642
   113
sig
wenzelm@5642
   114
  include THEORY
wenzelm@6546
   115
  val init_data: Object.kind -> (Object.T * (Object.T -> Object.T) * (Object.T -> Object.T) *
wenzelm@12311
   116
    (Object.T * Object.T -> Object.T) * (Sign.sg -> Object.T -> unit)) -> theory -> theory
wenzelm@5642
   117
  val print_data: Object.kind -> theory -> unit
wenzelm@5642
   118
  val get_data: Object.kind -> (Object.T -> 'a) -> theory -> 'a
wenzelm@5642
   119
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> theory -> theory
wenzelm@5642
   120
end;
paulson@1526
   121
wenzelm@6188
   122
structure Theory: PRIVATE_THEORY =
paulson@1526
   123
struct
wenzelm@2206
   124
wenzelm@3996
   125
wenzelm@2206
   126
(** datatype theory **)
paulson@1526
   127
paulson@1526
   128
datatype theory =
paulson@1526
   129
  Theory of {
paulson@1526
   130
    sign: Sign.sg,
wenzelm@16291
   131
    defs: Defs.graph,
wenzelm@16339
   132
    axioms: term NameSpace.table,
wenzelm@16339
   133
    oracles: ((Sign.sg * Object.T -> term) * stamp) NameSpace.table,
wenzelm@4019
   134
    parents: theory list,
wenzelm@4019
   135
    ancestors: theory list};
paulson@1526
   136
wenzelm@16291
   137
fun make_theory sign defs axioms oracles parents ancestors =
wenzelm@16291
   138
  Theory {sign = sign, defs = defs, axioms = axioms,
wenzelm@16190
   139
    oracles = oracles, parents = parents, ancestors = ancestors};
wenzelm@3996
   140
paulson@1526
   141
fun rep_theory (Theory args) = args;
paulson@1526
   142
wenzelm@3996
   143
val sign_of = #sign o rep_theory;
wenzelm@6188
   144
val is_draft = Sign.is_draft o sign_of;
wenzelm@14645
   145
val syn_of = Sign.syn_of o sign_of;
wenzelm@3996
   146
val parents_of = #parents o rep_theory;
wenzelm@4019
   147
val ancestors_of = #ancestors o rep_theory;
wenzelm@3996
   148
wenzelm@16339
   149
val axioms_of = Symtab.dest o #2 o #axioms o rep_theory;
wenzelm@16339
   150
fun all_axioms_of thy = List.concat (map axioms_of (thy :: ancestors_of thy));
wenzelm@16339
   151
paulson@1526
   152
(*errors involving theories*)
paulson@1526
   153
exception THEORY of string * theory list;
paulson@1526
   154
paulson@1526
   155
(*compare theories*)
paulson@1526
   156
val subthy = Sign.subsig o pairself sign_of;
paulson@1526
   157
val eq_thy = Sign.eq_sg o pairself sign_of;
paulson@1526
   158
wenzelm@6369
   159
(*check for some theory*)
paulson@4970
   160
fun requires thy name what =
wenzelm@10930
   161
  if Sign.exists_stamp name (sign_of thy) then ()
wenzelm@4846
   162
  else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what);
paulson@1526
   163
wenzelm@6369
   164
fun assert_super thy1 thy2 =
wenzelm@6369
   165
  if subthy (thy1, thy2) then thy2
wenzelm@6369
   166
  else raise THEORY ("Not a super theory", [thy1, thy2]);
wenzelm@6369
   167
wenzelm@4846
   168
(*partial Pure theory*)
nipkow@9282
   169
val pre_pure =
wenzelm@16339
   170
  make_theory Sign.pre_pure Defs.empty NameSpace.empty_table NameSpace.empty_table [] [];
paulson@1526
   171
paulson@1526
   172
paulson@1526
   173
paulson@1526
   174
(** extend theory **)
paulson@1526
   175
wenzelm@3814
   176
(* extend logical part of a theory *)
wenzelm@3814
   177
wenzelm@16339
   178
fun err_dup_axms dups = error ("Duplicate axiom(s): " ^ commas_quote dups);
wenzelm@16339
   179
fun err_dup_oras dups = error ("Duplicate oracle(s): " ^ commas_quote dups);
paulson@1526
   180
wenzelm@16339
   181
fun ext_theory thy ext_sg axms oras =
paulson@1526
   182
  let
wenzelm@16291
   183
    val Theory {sign, defs, axioms, oracles, parents, ancestors} = thy;
wenzelm@16291
   184
    val draft = Sign.is_draft sign;
wenzelm@16339
   185
    val naming = Sign.naming_of sign;
wenzelm@16339
   186
wenzelm@16339
   187
    val axioms' = NameSpace.extend_table naming
wenzelm@16339
   188
        (if draft then axioms else NameSpace.empty_table, axms)
wenzelm@16339
   189
      handle Symtab.DUPS dups => err_dup_axms dups;
wenzelm@16339
   190
    val oracles' = NameSpace.extend_table naming (oracles, oras)
wenzelm@16339
   191
      handle Symtab.DUPS dups => err_dup_oras dups;
wenzelm@16339
   192
wenzelm@4019
   193
    val (parents', ancestors') =
wenzelm@16291
   194
      if draft then (parents, ancestors) else ([thy], thy :: ancestors);
wenzelm@16291
   195
  in make_theory (ext_sg sign) defs axioms' oracles' parents' ancestors' end;
paulson@1526
   196
paulson@1526
   197
paulson@1526
   198
(* extend signature of a theory *)
paulson@1526
   199
obua@16158
   200
fun ext_sign ext_sg args thy = ext_theory thy (ext_sg args) [] [];
paulson@1526
   201
wenzelm@14645
   202
val add_classes            = ext_sign Sign.add_classes;
wenzelm@14645
   203
val add_classes_i          = ext_sign Sign.add_classes_i;
wenzelm@14645
   204
val add_classrel           = ext_sign Sign.add_classrel;
wenzelm@14645
   205
val add_classrel_i         = ext_sign Sign.add_classrel_i;
wenzelm@14645
   206
val add_defsort            = ext_sign Sign.add_defsort;
wenzelm@14645
   207
val add_defsort_i          = ext_sign Sign.add_defsort_i;
wenzelm@14645
   208
val add_types              = ext_sign Sign.add_types;
wenzelm@14645
   209
val add_nonterminals       = ext_sign Sign.add_nonterminals;
wenzelm@14645
   210
val add_tyabbrs            = ext_sign Sign.add_tyabbrs;
wenzelm@14645
   211
val add_tyabbrs_i          = ext_sign Sign.add_tyabbrs_i;
wenzelm@14645
   212
val add_arities            = ext_sign Sign.add_arities;
wenzelm@14645
   213
val add_arities_i          = ext_sign Sign.add_arities_i;
wenzelm@14645
   214
val add_consts             = ext_sign Sign.add_consts;
wenzelm@14645
   215
val add_consts_i           = ext_sign Sign.add_consts_i;
wenzelm@14645
   216
val add_syntax             = ext_sign Sign.add_syntax;
wenzelm@14645
   217
val add_syntax_i           = ext_sign Sign.add_syntax_i;
wenzelm@14645
   218
val add_modesyntax         = curry (ext_sign Sign.add_modesyntax);
wenzelm@14645
   219
val add_modesyntax_i       = curry (ext_sign Sign.add_modesyntax_i);
wenzelm@15747
   220
val del_modesyntax         = curry (ext_sign Sign.del_modesyntax);
wenzelm@15747
   221
val del_modesyntax_i       = curry (ext_sign Sign.del_modesyntax_i);
wenzelm@14645
   222
val add_trfuns             = ext_sign Sign.add_trfuns;
wenzelm@14645
   223
val add_trfunsT            = ext_sign Sign.add_trfunsT;
wenzelm@14645
   224
val add_advanced_trfuns    = ext_sign Sign.add_advanced_trfuns;
wenzelm@14645
   225
val add_advanced_trfunsT   = ext_sign Sign.add_advanced_trfunsT;
wenzelm@14645
   226
val add_tokentrfuns        = ext_sign Sign.add_tokentrfuns;
wenzelm@6311
   227
fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f));
wenzelm@14645
   228
val add_trrules            = ext_sign Sign.add_trrules;
wenzelm@14645
   229
val add_trrules_i          = ext_sign Sign.add_trrules_i;
wenzelm@14645
   230
val add_path               = ext_sign Sign.add_path;
wenzelm@14645
   231
val parent_path            = add_path "..";
wenzelm@14645
   232
val root_path              = add_path "/";
wenzelm@14645
   233
val absolute_path          = add_path "//";
wenzelm@16134
   234
val qualified_names        = ext_sign (K Sign.qualified_names) ();
wenzelm@16134
   235
val no_base_names          = ext_sign (K Sign.no_base_names) ();
wenzelm@16134
   236
val custom_accesses        = ext_sign Sign.custom_accesses;
wenzelm@16134
   237
val set_policy             = ext_sign Sign.set_policy;
wenzelm@16190
   238
val restore_naming         = ext_sign Sign.restore_naming o sign_of;
wenzelm@16369
   239
val hide_classes           = ext_sign o Sign.hide_classes;
wenzelm@16369
   240
val hide_classes_i         = ext_sign o Sign.hide_classes_i;
wenzelm@16369
   241
val hide_types             = ext_sign o Sign.hide_types;
wenzelm@16369
   242
val hide_types_i           = ext_sign o Sign.hide_types_i;
wenzelm@16369
   243
val hide_consts            = ext_sign o Sign.hide_consts;
wenzelm@16369
   244
val hide_consts_i          = ext_sign o Sign.hide_consts_i;
wenzelm@14645
   245
val add_name               = ext_sign Sign.add_name;
wenzelm@14645
   246
val copy                   = ext_sign (K Sign.copy) ();
wenzelm@14645
   247
val prep_ext               = ext_sign (K Sign.prep_ext) ();
wenzelm@3814
   248
wenzelm@3996
   249
wenzelm@6311
   250
wenzelm@3814
   251
(** add axioms **)
wenzelm@3814
   252
paulson@1526
   253
(* prepare axioms *)
paulson@1526
   254
paulson@1526
   255
fun err_in_axm name =
paulson@1526
   256
  error ("The error(s) above occurred in axiom " ^ quote name);
paulson@1526
   257
wenzelm@16291
   258
fun no_vars pp tm =
wenzelm@16291
   259
  (case (Term.term_vars tm, Term.term_tvars tm) of
berghofe@14184
   260
    ([], []) => tm
berghofe@14184
   261
  | (ts, ixns) => error (Pretty.string_of (Pretty.block (Pretty.breaks
berghofe@14184
   262
      (Pretty.str "Illegal schematic variable(s) in term:" ::
wenzelm@16291
   263
       map (Pretty.term pp) ts @ map (Pretty.typ pp o TVar) ixns)))));
paulson@1526
   264
paulson@1526
   265
fun cert_axm sg (name, raw_tm) =
paulson@1526
   266
  let
wenzelm@16291
   267
    val pp = Sign.pp sg;
wenzelm@16291
   268
    val (t, T, _) = Sign.certify_term pp sg raw_tm
wenzelm@2979
   269
      handle TYPE (msg, _, _) => error msg
wenzelm@16291
   270
        | TERM (msg, _) => error msg;
paulson@1526
   271
  in
wenzelm@9537
   272
    Term.no_dummy_patterns t handle TERM (msg, _) => error msg;
paulson@1526
   273
    assert (T = propT) "Term not of type prop";
wenzelm@16291
   274
    (name, no_vars pp t)
wenzelm@9629
   275
  end;
paulson@1526
   276
wenzelm@5057
   277
(*some duplication of code with read_def_cterm*)
wenzelm@6661
   278
fun read_def_axm (sg, types, sorts) used (name, str) =
wenzelm@3814
   279
  let
wenzelm@14914
   280
    val ts = Syntax.read (Sign.is_logtype sg) (Sign.syn_of sg) propT str;
wenzelm@14828
   281
    val (t, _) = Sign.infer_types (Sign.pp sg) sg types sorts used true (ts, propT);
wenzelm@9320
   282
  in cert_axm sg (name, t) end
paulson@1960
   283
  handle ERROR => err_in_axm name;
paulson@1526
   284
skalberg@15531
   285
fun read_axm sg name_str = read_def_axm (sg, K NONE, K NONE) [] name_str;
wenzelm@5057
   286
paulson@1526
   287
fun inferT_axm sg (name, pre_tm) =
wenzelm@16291
   288
  let
wenzelm@16291
   289
    val pp = Sign.pp sg;
wenzelm@16291
   290
    val (t, _) = Sign.infer_types pp sg (K NONE) (K NONE) [] true ([pre_tm], propT);
wenzelm@16291
   291
  in (name, no_vars pp t) end
paulson@1526
   292
  handle ERROR => err_in_axm name;
paulson@1526
   293
paulson@1526
   294
paulson@1526
   295
(* extend axioms of a theory *)
paulson@1526
   296
wenzelm@16291
   297
local
wenzelm@16291
   298
wenzelm@16291
   299
fun gen_add_axioms prep_axm raw_axms thy =
paulson@1526
   300
  let
wenzelm@16291
   301
    val sg = sign_of thy;
wenzelm@16339
   302
    val axms = map (apsnd (Term.compress_term o Logic.varify) o prep_axm sg) raw_axms;
wenzelm@16339
   303
  in ext_theory thy I axms [] end;
paulson@1526
   304
wenzelm@16291
   305
in
wenzelm@16291
   306
wenzelm@16291
   307
val add_axioms = gen_add_axioms read_axm;
wenzelm@16291
   308
val add_axioms_i = gen_add_axioms cert_axm;
wenzelm@16291
   309
wenzelm@16291
   310
end;
paulson@1526
   311
paulson@1526
   312
wenzelm@3814
   313
(* add oracle **)
wenzelm@3814
   314
wenzelm@16339
   315
fun add_oracle (bname, oracle) thy =
wenzelm@16339
   316
  ext_theory thy I [] [(bname, (oracle, stamp ()))];
wenzelm@3814
   317
wenzelm@3814
   318
wenzelm@3767
   319
wenzelm@3767
   320
(** add constant definitions **)
wenzelm@3767
   321
wenzelm@9320
   322
(* overloading *)
nipkow@9280
   323
wenzelm@16291
   324
datatype overloading = Clean | Implicit | Useless;
wenzelm@9320
   325
wenzelm@16291
   326
fun overloading sg overloaded declT defT =
wenzelm@16291
   327
  let
wenzelm@16291
   328
    val defT' = Term.incr_tvar (maxidx_of_typ declT + 1) (Type.varifyT defT);
wenzelm@16291
   329
  in
wenzelm@16291
   330
    if Sign.typ_instance sg (declT, defT') then Clean
wenzelm@16291
   331
    else if Sign.typ_instance sg (Type.strip_sorts declT, Type.strip_sorts defT') then Useless
wenzelm@16291
   332
    else if overloaded then Clean
wenzelm@16291
   333
    else Implicit
nipkow@9280
   334
  end;
nipkow@9280
   335
wenzelm@3767
   336
wenzelm@16291
   337
(* dest_def *)
wenzelm@16291
   338
wenzelm@16291
   339
fun dest_def pp tm =
wenzelm@3767
   340
  let
wenzelm@3787
   341
    fun err msg = raise TERM (msg, [tm]);
wenzelm@3767
   342
wenzelm@3767
   343
    val (lhs, rhs) = Logic.dest_equals (Logic.strip_imp_concl tm)
wenzelm@3767
   344
      handle TERM _ => err "Not a meta-equality (==)";
wenzelm@16291
   345
    val (head, args) = Term.strip_comb lhs;
wenzelm@16291
   346
    val (c, T) = Term.dest_Const head
wenzelm@3767
   347
      handle TERM _ => err "Head of lhs not a constant";
wenzelm@3767
   348
wenzelm@4141
   349
    fun dest_free (Free (x, _)) = x
wenzelm@4141
   350
      | dest_free (Const ("TYPE", Type ("itself", [TFree (x, _)]))) = x
wenzelm@4141
   351
      | dest_free _ = raise Match;
wenzelm@4141
   352
wenzelm@16291
   353
    val show_terms = commas_quote o map (Pretty.string_of_term pp);
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@16291
   357
    val lhs_nofrees = filter (not o can dest_free) args;
wenzelm@3767
   358
    val lhs_dups = duplicates args;
wenzelm@16291
   359
    val rhs_extras = term_frees rhs |> fold (remove op =) args;
wenzelm@16291
   360
    val rhs_extrasT = term_tfrees rhs |> fold (remove op =) (typ_tfrees T);
wenzelm@3767
   361
  in
wenzelm@16291
   362
    if not (null lhs_nofrees) then
wenzelm@16291
   363
      err ("Non-variables as arguments on lhs: " ^ show_terms lhs_nofrees)
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)
wenzelm@16291
   370
    else if exists_Const (equal (c, T)) rhs then
wenzelm@3767
   371
      err ("Constant to be defined occurs on rhs")
wenzelm@16291
   372
    else ((c, T), rhs)
wenzelm@3767
   373
  end;
wenzelm@3767
   374
wenzelm@3767
   375
wenzelm@16291
   376
(* check_def *)
wenzelm@16291
   377
wenzelm@16291
   378
fun pretty_const pp (c, T) =
wenzelm@16291
   379
 [Pretty.str c, Pretty.str " ::", Pretty.brk 1,
wenzelm@16291
   380
  Pretty.quote (Pretty.typ pp (Type.freeze_type T))];    (* FIXME zero indexes!? *)
wenzelm@3767
   381
wenzelm@16291
   382
(* FIXME move error messages to defs.ML !? *)
wenzelm@9320
   383
wenzelm@16291
   384
fun pretty_path pp path = fold_rev (fn (T, c, def) =>
wenzelm@16291
   385
  fn [] => [Pretty.block (pretty_const pp (c, T))]
wenzelm@16291
   386
   | prts => Pretty.block (pretty_const pp (c, T) @
wenzelm@16291
   387
      [Pretty.brk 1, Pretty.str ("depends via " ^ quote def ^ " on")]) :: prts) path [];
wenzelm@3767
   388
obua@16313
   389
fun chain_history_msg s = 
obua@16313
   390
    if Defs.chain_history () then s^": " 
obua@16313
   391
    else s^" (set DEFS_CHAIN_HISTORY=ON for full history): "
obua@16313
   392
wenzelm@16291
   393
fun defs_circular pp path =
obua@16313
   394
  Pretty.str (chain_history_msg "Cyclic dependency of definitions") :: pretty_path pp path
wenzelm@16291
   395
  |> Pretty.chunks |> Pretty.string_of;
wenzelm@16291
   396
wenzelm@16291
   397
fun defs_infinite_chain pp path =
obua@16313
   398
  Pretty.str (chain_history_msg "Infinite chain of definitions") :: pretty_path pp path
wenzelm@16291
   399
  |> Pretty.chunks |> Pretty.string_of;
wenzelm@16291
   400
wenzelm@16291
   401
fun defs_clash def1 def2 = "Type clash in definitions " ^ quote def1 ^ " and " ^ quote def2;
wenzelm@9320
   402
wenzelm@16291
   403
fun defs_final pp const =
wenzelm@16291
   404
  (Pretty.str "Attempt to define final constant" :: Pretty.brk 1 :: pretty_const pp const)
wenzelm@16291
   405
  |> Pretty.block |> Pretty.string_of;
wenzelm@3767
   406
wenzelm@16291
   407
(* FIXME move to defs.ML; avoid exceptions *)
wenzelm@16291
   408
fun declare sg c defs =
wenzelm@16291
   409
  let val T = Sign.the_const_type sg c
wenzelm@16291
   410
  in if_none (try (Defs.declare defs) (c, T)) defs end;
wenzelm@10494
   411
obua@16108
   412
wenzelm@16291
   413
fun check_def sg overloaded (bname, tm) defs =
wenzelm@16291
   414
  let
wenzelm@16291
   415
    val pp = Sign.pp sg;
wenzelm@16291
   416
    val name = Sign.full_name sg bname;
wenzelm@16291
   417
wenzelm@16291
   418
    fun err msg = error (Pretty.string_of (Pretty.chunks
wenzelm@16291
   419
     [Pretty.str msg,
wenzelm@16291
   420
      Pretty.block [Pretty.str ("The error(s) above occurred in definition " ^ quote name ^ ":"),
wenzelm@16291
   421
        Pretty.fbrk, Pretty.quote (Pretty.term pp tm)]]));
wenzelm@16291
   422
wenzelm@16291
   423
    fun show_def const txt =
wenzelm@16291
   424
      [Pretty.block (Pretty.str "Definition of " :: pretty_const pp const), Pretty.str txt]
wenzelm@16291
   425
      |> Pretty.chunks |> Pretty.string_of;
wenzelm@9320
   426
wenzelm@16291
   427
    val ((c, defT), rhs) = dest_def pp tm handle TERM (msg, _) => err msg;
wenzelm@16291
   428
    val rhs_consts = Term.term_constsT rhs;
wenzelm@16291
   429
    val declT = Sign.the_const_type sg c;
obua@16108
   430
wenzelm@16291
   431
    val _ =
wenzelm@16291
   432
      (case overloading sg overloaded declT defT of
wenzelm@16291
   433
        Clean => ()
wenzelm@16291
   434
      | Implicit => warning (show_def (c, defT)
wenzelm@16291
   435
          ("is strictly less general than the declared type (see " ^ quote name ^ ")"))
wenzelm@16291
   436
      | Useless => err (Library.setmp show_sorts true (show_def (c, defT))
wenzelm@16291
   437
          "imposes additional sort constraints on the declared type of the constant"));
obua@16108
   438
wenzelm@16291
   439
    val decl_defs = defs |> declare sg c |> fold (declare sg) (map #1 rhs_consts);
wenzelm@3767
   440
  in
wenzelm@16291
   441
    Defs.define decl_defs (c, defT) name rhs_consts
wenzelm@16291
   442
      handle Defs.DEFS msg => err ("DEFS: " ^ msg)   (* FIXME sys_error!? *)
wenzelm@16291
   443
        | Defs.CIRCULAR path => err (defs_circular pp path)
wenzelm@16291
   444
        | Defs.INFINITE_CHAIN path => err (defs_infinite_chain pp path)
wenzelm@16291
   445
        | Defs.CLASH (_, def1, def2) => err (defs_clash def1 def2)
wenzelm@16291
   446
        | Defs.FINAL const => err (defs_final pp const)
wenzelm@3767
   447
  end;
wenzelm@3767
   448
wenzelm@3767
   449
wenzelm@3767
   450
(* add_defs *)
wenzelm@3767
   451
wenzelm@16291
   452
local
wenzelm@9320
   453
wenzelm@16291
   454
fun gen_add_defs prep_axm overloaded raw_axms thy =
wenzelm@16291
   455
  let
wenzelm@16291
   456
    val Theory {sign, defs, axioms, oracles, parents, ancestors} = thy;
wenzelm@9320
   457
    val axms = map (prep_axm sign) raw_axms;
wenzelm@16291
   458
    val defs' = fold (check_def sign overloaded) axms defs;
wenzelm@3767
   459
  in
wenzelm@16291
   460
    make_theory sign defs' axioms oracles parents ancestors
wenzelm@9320
   461
    |> add_axioms_i axms
wenzelm@3767
   462
  end;
wenzelm@3767
   463
wenzelm@16291
   464
in
wenzelm@16291
   465
wenzelm@16291
   466
val add_defs_i = gen_add_defs cert_axm;
wenzelm@16291
   467
val add_defs = gen_add_defs read_axm;
wenzelm@16291
   468
wenzelm@16291
   469
end;
wenzelm@3767
   470
wenzelm@3767
   471
skalberg@14223
   472
(* add_finals *)
skalberg@14223
   473
wenzelm@16291
   474
local
wenzelm@16291
   475
wenzelm@16291
   476
fun gen_add_finals prep_term overloaded raw_terms thy =
skalberg@14223
   477
  let
wenzelm@16291
   478
    val Theory {sign, defs, axioms, oracles, parents, ancestors} = thy;
wenzelm@16291
   479
    fun finalize tm finals =
wenzelm@16291
   480
      let
wenzelm@16291
   481
        fun err msg = raise TERM (msg, [tm]);    (* FIXME error!? *)
wenzelm@16291
   482
        val (c, defT) =
wenzelm@16291
   483
          (case tm of Const x => x
wenzelm@16291
   484
          | Free _ => err "Attempt to finalize variable (or undeclared constant)"
wenzelm@16291
   485
          | _ => err "Attempt to finalize non-constant term");
wenzelm@16291
   486
        val declT = Sign.the_const_type sign c
wenzelm@16291
   487
          handle TYPE (msg, _, _) => err msg;
wenzelm@16291
   488
        val _ =
wenzelm@16291
   489
          (case overloading sign overloaded declT defT of
wenzelm@16291
   490
            Clean => ()
wenzelm@16291
   491
          | Implcit => warning ("Finalizing " ^ quote c ^
wenzelm@16291
   492
              " at a strictly less general type than declared")
wenzelm@16291
   493
          | Useless => err "Sort constraints stronger than declared");
wenzelm@16291
   494
      in
wenzelm@16291
   495
        Defs.finalize (if_none (try (Defs.declare finals) (c, declT)) finals) (c, defT)
wenzelm@16291
   496
      end;
wenzelm@16291
   497
    val defs' = fold finalize (map (prep_term sign) raw_terms) defs;
wenzelm@16291
   498
  in make_theory sign defs' axioms oracles parents ancestors end;
skalberg@14223
   499
wenzelm@16291
   500
fun read_term sg = Sign.simple_read_term sg TypeInfer.logicT;
wenzelm@16291
   501
fun cert_term sg = #1 o Sign.certify_term (Sign.pp sg) sg;
wenzelm@16291
   502
skalberg@14223
   503
in
wenzelm@16291
   504
wenzelm@16291
   505
val add_finals = gen_add_finals read_term;
wenzelm@16291
   506
val add_finals_i = gen_add_finals cert_term;
wenzelm@16291
   507
skalberg@14223
   508
end;
skalberg@14223
   509
skalberg@14223
   510
wenzelm@3878
   511
wenzelm@3865
   512
(** additional theory data **)
wenzelm@3865
   513
wenzelm@4996
   514
val init_data = curry (ext_sign Sign.init_data);
wenzelm@4996
   515
fun print_data kind = Sign.print_data kind o sign_of;
wenzelm@4996
   516
fun get_data kind f = Sign.get_data kind f o sign_of;
wenzelm@4996
   517
fun put_data kind f = ext_sign (Sign.put_data kind f);
wenzelm@3865
   518
wenzelm@3865
   519
wenzelm@3767
   520
wenzelm@6661
   521
(** merge theories **)          (*exception ERROR*)
wenzelm@4019
   522
wenzelm@3878
   523
(*merge list of theories from left to right, preparing extend*)
wenzelm@3967
   524
fun prep_ext_merge thys =
wenzelm@15703
   525
  let
wenzelm@16291
   526
    val sign' = Sign.prep_ext_merge (map sign_of thys);
wenzelm@3814
   527
wenzelm@16291
   528
    val defss = map (#defs o rep_theory) thys;
wenzelm@16291
   529
    val defs' = foldl (uncurry Defs.merge) (hd defss) (tl defss)
wenzelm@16291
   530
      handle Defs.CIRCULAR namess => error (defs_circular (Sign.pp sign') namess)
wenzelm@16291
   531
        | Defs.INFINITE_CHAIN namess => error (defs_infinite_chain (Sign.pp sign') namess);
wenzelm@15703
   532
wenzelm@16339
   533
    val axioms' = NameSpace.empty_table;
nipkow@9282
   534
wenzelm@16339
   535
    val oras_spaces = map (#1 o #oracles o rep_theory) thys;
wenzelm@16339
   536
    val oras_space' = Library.foldl NameSpace.merge (hd oras_spaces, tl oras_spaces);
wenzelm@15703
   537
    fun eq_ora ((_, (_, s1: stamp)), (_, (_, s2))) = s1 = s2;
wenzelm@16339
   538
    val oras' =
wenzelm@15703
   539
      Symtab.make (gen_distinct eq_ora
wenzelm@16339
   540
        (List.concat (map (Symtab.dest o #2 o #oracles o rep_theory) thys)))
wenzelm@15703
   541
      handle Symtab.DUPS names => err_dup_oras names;
wenzelm@16339
   542
    val oracles' = (oras_space', oras');
wenzelm@4019
   543
wenzelm@15703
   544
    val parents' = gen_distinct eq_thy thys;
wenzelm@15703
   545
    val ancestors' =
wenzelm@15703
   546
      gen_distinct eq_thy (parents' @ List.concat (map ancestors_of thys));
wenzelm@16291
   547
  in make_theory sign' defs' axioms' oracles' parents' ancestors' end;
paulson@1526
   548
wenzelm@3885
   549
paulson@1526
   550
end;
paulson@1526
   551
wenzelm@3767
   552
structure BasicTheory: BASIC_THEORY = Theory;
wenzelm@3767
   553
open BasicTheory;