src/Pure/theory.ML
author wenzelm
Mon May 22 22:29:19 2006 +0200 (2006-05-22)
changeset 19700 e02af528ceef
parent 19693 ab816ca8df06
child 19708 a508bde37a81
permissions -rw-r--r--
Defs.specifications_of: lhs/rhs now use typargs;
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@16443
     5
Logical theory content: axioms, definitions, oracles.
paulson@1526
     6
*)
wenzelm@16291
     7
wenzelm@3767
     8
signature BASIC_THEORY =
wenzelm@3767
     9
sig
paulson@1526
    10
  type theory
wenzelm@16443
    11
  type theory_ref
wenzelm@16495
    12
  val sign_of: theory -> theory    (*obsolete*)
wenzelm@3996
    13
  val rep_theory: theory ->
wenzelm@16443
    14
   {axioms: term NameSpace.table,
wenzelm@17706
    15
    defs: Defs.T,
wenzelm@16443
    16
    oracles: ((theory * Object.T -> term) * stamp) NameSpace.table}
wenzelm@3996
    17
  val parents_of: theory -> theory list
wenzelm@4019
    18
  val ancestors_of: theory -> theory list
wenzelm@16443
    19
  val eq_thy: theory * theory -> bool
wenzelm@3996
    20
  val subthy: theory * theory -> bool
wenzelm@16443
    21
  val cert_axm: theory -> string * term -> string * term
wenzelm@16443
    22
  val read_def_axm: theory * (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@6311
    23
    string list -> string * string -> string * term
wenzelm@16443
    24
  val read_axm: theory -> string * string -> string * term
wenzelm@16443
    25
  val inferT_axm: theory -> string * term -> string * term
wenzelm@3767
    26
end
wenzelm@3767
    27
wenzelm@3767
    28
signature THEORY =
wenzelm@3767
    29
sig
wenzelm@3767
    30
  include BASIC_THEORY
wenzelm@16443
    31
  include SIGN_THEORY
wenzelm@16495
    32
  val begin_theory: string -> theory list -> theory
wenzelm@16495
    33
  val end_theory: theory -> theory
wenzelm@16495
    34
  val checkpoint: theory -> theory
wenzelm@16495
    35
  val copy: theory -> theory
wenzelm@16536
    36
  val init_data: theory -> theory
wenzelm@16443
    37
  val axiom_space: theory -> NameSpace.T
wenzelm@16443
    38
  val oracle_space: theory -> NameSpace.T
wenzelm@16339
    39
  val axioms_of: theory -> (string * term) list
wenzelm@16339
    40
  val all_axioms_of: theory -> (string * term) list
wenzelm@17706
    41
  val defs_of : theory -> Defs.T
wenzelm@19570
    42
  val definitions_of: theory -> string ->
wenzelm@19570
    43
    {module: string, name: string, lhs: typ, rhs: (string * typ) list} list
wenzelm@16443
    44
  val self_ref: theory -> theory_ref
wenzelm@16443
    45
  val deref: theory_ref -> theory
wenzelm@16443
    46
  val merge: theory * theory -> theory                     (*exception TERM*)
wenzelm@16443
    47
  val merge_refs: theory_ref * theory_ref -> theory_ref    (*exception TERM*)
wenzelm@16443
    48
  val requires: theory -> string -> string -> unit
wenzelm@16443
    49
  val assert_super: theory -> theory -> theory
wenzelm@3996
    50
  val add_axioms: (bstring * string) list -> theory -> theory
wenzelm@3996
    51
  val add_axioms_i: (bstring * term) list -> theory -> theory
wenzelm@19630
    52
  val add_defs: bool -> bool -> (bstring * string) list -> theory -> theory
wenzelm@19630
    53
  val add_defs_i: bool -> bool -> (bstring * term) list -> theory -> theory
wenzelm@16443
    54
  val add_finals: bool -> string list -> theory -> theory
wenzelm@16443
    55
  val add_finals_i: bool -> term list -> theory -> theory
wenzelm@16443
    56
  val add_oracle: bstring * (theory * Object.T -> term) -> theory -> theory
wenzelm@16495
    57
end
paulson@1526
    58
wenzelm@16443
    59
structure Theory: THEORY =
wenzelm@16443
    60
struct
wenzelm@16443
    61
wenzelm@16443
    62
(** type theory **)
wenzelm@16443
    63
wenzelm@16443
    64
(* context operations *)
wenzelm@16443
    65
wenzelm@16443
    66
type theory = Context.theory;
wenzelm@16443
    67
type theory_ref = Context.theory_ref;
wenzelm@16443
    68
wenzelm@16443
    69
val eq_thy = Context.eq_thy;
wenzelm@16443
    70
val subthy = Context.subthy;
paulson@1526
    71
wenzelm@16443
    72
val parents_of = Context.parents_of;
wenzelm@16443
    73
val ancestors_of = Context.ancestors_of;
wenzelm@16443
    74
wenzelm@16443
    75
val self_ref = Context.self_ref;
wenzelm@16443
    76
val deref = Context.deref;
wenzelm@16443
    77
val merge = Context.merge;
wenzelm@16443
    78
val merge_refs = Context.merge_refs;
wenzelm@16443
    79
wenzelm@16495
    80
val begin_theory = Sign.local_path oo Context.begin_thy Sign.pp;
wenzelm@16495
    81
val end_theory = Context.finish_thy;
wenzelm@16495
    82
val checkpoint = Context.checkpoint_thy;
wenzelm@16495
    83
val copy = Context.copy_thy;
wenzelm@16495
    84
wenzelm@16443
    85
wenzelm@16443
    86
(* signature operations *)
wenzelm@16443
    87
wenzelm@16443
    88
val sign_of = I;
wenzelm@16443
    89
wenzelm@16443
    90
structure SignTheory: SIGN_THEORY = Sign;
wenzelm@16443
    91
open SignTheory;
wenzelm@16443
    92
wenzelm@2206
    93
wenzelm@3996
    94
wenzelm@16443
    95
(** datatype thy **)
wenzelm@16443
    96
wenzelm@16443
    97
datatype thy = Thy of
wenzelm@16443
    98
 {axioms: term NameSpace.table,
wenzelm@17706
    99
  defs: Defs.T,
wenzelm@16443
   100
  oracles: ((theory * Object.T -> term) * stamp) NameSpace.table};
wenzelm@16443
   101
wenzelm@16443
   102
fun make_thy (axioms, defs, oracles) =
wenzelm@16443
   103
  Thy {axioms = axioms, defs = defs, oracles = oracles};
paulson@1526
   104
wenzelm@16443
   105
fun err_dup_axms dups = error ("Duplicate axiom(s): " ^ commas_quote dups);
wenzelm@16443
   106
fun err_dup_oras dups = error ("Duplicate oracle(s): " ^ commas_quote dups);
wenzelm@3996
   107
wenzelm@16443
   108
structure ThyData = TheoryDataFun
wenzelm@16443
   109
(struct
wenzelm@16536
   110
  val name = "Pure/theory";
wenzelm@16443
   111
  type T = thy;
wenzelm@16443
   112
  val empty = make_thy (NameSpace.empty_table, Defs.empty, NameSpace.empty_table);
wenzelm@16443
   113
  val copy = I;
wenzelm@16443
   114
wenzelm@16443
   115
  fun extend (Thy {axioms, defs, oracles}) = make_thy (NameSpace.empty_table, defs, oracles);
wenzelm@16443
   116
wenzelm@16443
   117
  fun merge pp (thy1, thy2) =
wenzelm@16443
   118
    let
wenzelm@16443
   119
      val Thy {axioms = _, defs = defs1, oracles = oracles1} = thy1;
wenzelm@16443
   120
      val Thy {axioms = _, defs = defs2, oracles = oracles2} = thy2;
paulson@1526
   121
wenzelm@16443
   122
      val axioms = NameSpace.empty_table;
wenzelm@19693
   123
      val defs = Defs.merge pp (defs1, defs2);
haftmann@17496
   124
      val oracles = NameSpace.merge_tables (eq_snd (op =)) (oracles1, oracles2)
wenzelm@16443
   125
        handle Symtab.DUPS dups => err_dup_oras dups;
wenzelm@16443
   126
    in make_thy (axioms, defs, oracles) end;
wenzelm@16443
   127
wenzelm@16443
   128
  fun print _ _ = ();
wenzelm@16443
   129
end);
wenzelm@16443
   130
wenzelm@16536
   131
val init_data = ThyData.init;
wenzelm@16443
   132
wenzelm@16443
   133
fun rep_theory thy = ThyData.get thy |> (fn Thy args => args);
wenzelm@16443
   134
wenzelm@16443
   135
fun map_thy f = ThyData.map (fn (Thy {axioms, defs, oracles}) =>
wenzelm@16443
   136
  make_thy (f (axioms, defs, oracles)));
wenzelm@16443
   137
wenzelm@16443
   138
fun map_axioms f = map_thy (fn (axioms, defs, oracles) => (f axioms, defs, oracles));
wenzelm@16443
   139
fun map_defs f = map_thy (fn (axioms, defs, oracles) => (axioms, f defs, oracles));
wenzelm@16443
   140
fun map_oracles f = map_thy (fn (axioms, defs, oracles) => (axioms, defs, f oracles));
wenzelm@16443
   141
wenzelm@16443
   142
wenzelm@16443
   143
(* basic operations *)
wenzelm@16443
   144
wenzelm@16443
   145
val axiom_space = #1 o #axioms o rep_theory;
wenzelm@16443
   146
val oracle_space = #1 o #oracles o rep_theory;
wenzelm@3996
   147
wenzelm@16339
   148
val axioms_of = Symtab.dest o #2 o #axioms o rep_theory;
wenzelm@19482
   149
fun all_axioms_of thy = maps axioms_of (thy :: ancestors_of thy);
wenzelm@16339
   150
wenzelm@16803
   151
val defs_of = #defs o rep_theory;
obua@16743
   152
wenzelm@19570
   153
fun definitions_of thy c =
wenzelm@19700
   154
  let
wenzelm@19700
   155
    val inst = Consts.instance (Sign.consts_of thy);
wenzelm@19700
   156
    val defs = defs_of thy;
wenzelm@19700
   157
  in
wenzelm@19700
   158
    Defs.specifications_of defs c
wenzelm@19700
   159
    |> map_filter (fn (_, {is_def, module, name, lhs, rhs}) =>
wenzelm@19700
   160
      if is_def then SOME {module = module, name = name, lhs = inst (c, lhs),
wenzelm@19700
   161
        rhs = map (fn (d, Us) => (d, inst (d, Us))) rhs}
wenzelm@19700
   162
      else NONE)
wenzelm@19700
   163
  end;
wenzelm@19570
   164
paulson@4970
   165
fun requires thy name what =
wenzelm@16443
   166
  if Context.exists_name name thy then ()
wenzelm@4846
   167
  else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what);
paulson@1526
   168
wenzelm@6369
   169
fun assert_super thy1 thy2 =
wenzelm@6369
   170
  if subthy (thy1, thy2) then thy2
wenzelm@6369
   171
  else raise THEORY ("Not a super theory", [thy1, thy2]);
wenzelm@6369
   172
wenzelm@3996
   173
wenzelm@6311
   174
wenzelm@3814
   175
(** add axioms **)
wenzelm@3814
   176
paulson@1526
   177
(* prepare axioms *)
paulson@1526
   178
wenzelm@18678
   179
fun err_in_axm msg name =
wenzelm@18678
   180
  cat_error msg ("The error(s) above occurred in axiom " ^ quote name);
paulson@1526
   181
wenzelm@16443
   182
fun cert_axm thy (name, raw_tm) =
paulson@1526
   183
  let
wenzelm@18968
   184
    val (t, T, _) = Sign.certify_prop thy raw_tm
wenzelm@2979
   185
      handle TYPE (msg, _, _) => error msg
wenzelm@16291
   186
        | TERM (msg, _) => error msg;
paulson@1526
   187
  in
wenzelm@9537
   188
    Term.no_dummy_patterns t handle TERM (msg, _) => error msg;
wenzelm@18968
   189
    (name, Sign.no_vars (Sign.pp thy) t)
wenzelm@9629
   190
  end;
paulson@1526
   191
wenzelm@16443
   192
fun read_def_axm (thy, types, sorts) used (name, str) =
wenzelm@3814
   193
  let
wenzelm@18857
   194
    val ts = Syntax.read (Context.Theory thy) (Sign.is_logtype thy) (Sign.syn_of thy) propT str;
wenzelm@18968
   195
    val (t, _) =
wenzelm@18968
   196
      Sign.infer_types (Sign.pp thy) thy (Sign.consts_of thy) types sorts used true (ts, propT);
wenzelm@16443
   197
  in cert_axm thy (name, t) end
wenzelm@18678
   198
  handle ERROR msg => err_in_axm msg name;
paulson@1526
   199
wenzelm@16443
   200
fun read_axm thy name_str = read_def_axm (thy, K NONE, K NONE) [] name_str;
wenzelm@5057
   201
wenzelm@16443
   202
fun inferT_axm thy (name, pre_tm) =
wenzelm@16291
   203
  let
wenzelm@16443
   204
    val pp = Sign.pp thy;
wenzelm@18968
   205
    val (t, _) =
wenzelm@18968
   206
      Sign.infer_types pp thy (Sign.consts_of thy) (K NONE) (K NONE) [] true ([pre_tm], propT);
wenzelm@18943
   207
  in (name, Sign.no_vars pp t) end
wenzelm@18678
   208
  handle ERROR msg => err_in_axm msg name;
paulson@1526
   209
paulson@1526
   210
wenzelm@16443
   211
(* add_axioms(_i) *)
paulson@1526
   212
wenzelm@16291
   213
local
wenzelm@16291
   214
wenzelm@16443
   215
fun gen_add_axioms prep_axm raw_axms thy = thy |> map_axioms (fn axioms =>
paulson@1526
   216
  let
wenzelm@16991
   217
    val axms = map (apsnd (Compress.term thy o Logic.varify) o prep_axm thy) raw_axms;
wenzelm@16443
   218
    val axioms' = NameSpace.extend_table (Sign.naming_of thy) (axioms, axms)
wenzelm@16443
   219
      handle Symtab.DUPS dups => err_dup_axms dups;
wenzelm@16443
   220
  in axioms' end);
paulson@1526
   221
wenzelm@16291
   222
in
wenzelm@16291
   223
wenzelm@16291
   224
val add_axioms = gen_add_axioms read_axm;
wenzelm@16291
   225
val add_axioms_i = gen_add_axioms cert_axm;
wenzelm@16291
   226
wenzelm@16291
   227
end;
paulson@1526
   228
paulson@1526
   229
wenzelm@3767
   230
wenzelm@3767
   231
(** add constant definitions **)
wenzelm@3767
   232
wenzelm@17706
   233
fun prep_const thy (c, T) = (c, Compress.typ thy (Type.varifyT T));
wenzelm@17706
   234
wenzelm@17706
   235
wenzelm@16944
   236
(* check_overloading *)
nipkow@9280
   237
wenzelm@16944
   238
fun check_overloading thy overloaded (c, T) =
wenzelm@16291
   239
  let
wenzelm@16944
   240
    val declT =
wenzelm@16944
   241
      (case Sign.const_constraint thy c of
wenzelm@16944
   242
        NONE => error ("Undeclared constant " ^ quote c)
wenzelm@16944
   243
      | SOME declT => declT);
wenzelm@16944
   244
    val T' = Type.varifyT T;
wenzelm@16944
   245
wenzelm@16944
   246
    fun message txt =
wenzelm@16944
   247
      [Pretty.block [Pretty.str "Specification of constant ",
wenzelm@16944
   248
        Pretty.str c, Pretty.str " ::", Pretty.brk 1, Pretty.quote (Sign.pretty_typ thy T)],
wenzelm@16944
   249
        Pretty.str txt] |> Pretty.chunks |> Pretty.string_of;
wenzelm@16291
   250
  in
wenzelm@16944
   251
    if Sign.typ_instance thy (declT, T') then ()
wenzelm@16944
   252
    else if Type.raw_instance (declT, T') then
wenzelm@16944
   253
      error (Library.setmp show_sorts true
wenzelm@16944
   254
        message "imposes additional sort constraints on the constant declaration")
wenzelm@16944
   255
    else if overloaded then ()
wenzelm@16944
   256
    else warning (message "is strictly less general than the declared type");
wenzelm@16944
   257
    (c, T)
nipkow@9280
   258
  end;
nipkow@9280
   259
wenzelm@3767
   260
wenzelm@16291
   261
(* check_def *)
wenzelm@16291
   262
wenzelm@19630
   263
fun check_def thy unchecked overloaded (bname, tm) defs =
wenzelm@16291
   264
  let
wenzelm@17706
   265
    val name = Sign.full_name thy bname;
wenzelm@19693
   266
    val (lhs_const, rhs) = Sign.cert_def (Sign.pp thy) tm;
wenzelm@16944
   267
    val rhs_consts = fold_aterms (fn Const const => insert (op =) const | _ => I) rhs [];
wenzelm@18943
   268
    val _ = check_overloading thy overloaded lhs_const;
wenzelm@3767
   269
  in
wenzelm@19693
   270
    defs |> Defs.define (Sign.pp thy) (Sign.consts_of thy) unchecked true (Context.theory_name thy)
wenzelm@19570
   271
      name (prep_const thy lhs_const) (map (prep_const thy) rhs_consts)
wenzelm@16883
   272
  end
wenzelm@18678
   273
  handle ERROR msg => cat_error msg (Pretty.string_of (Pretty.block
wenzelm@16883
   274
   [Pretty.str ("The error(s) above occurred in definition " ^ quote bname ^ ":"),
wenzelm@19693
   275
    Pretty.fbrk, Pretty.quote (Sign.pretty_term thy tm)]));
wenzelm@3767
   276
wenzelm@3767
   277
wenzelm@16443
   278
(* add_defs(_i) *)
wenzelm@3767
   279
wenzelm@16291
   280
local
wenzelm@9320
   281
wenzelm@19630
   282
fun gen_add_defs prep_axm unchecked overloaded raw_axms thy =
wenzelm@16443
   283
  let val axms = map (prep_axm thy) raw_axms in
wenzelm@16443
   284
    thy
wenzelm@19630
   285
    |> map_defs (fold (check_def thy unchecked overloaded) axms)
wenzelm@9320
   286
    |> add_axioms_i axms
wenzelm@3767
   287
  end;
wenzelm@3767
   288
wenzelm@16291
   289
in
wenzelm@16291
   290
wenzelm@16291
   291
val add_defs_i = gen_add_defs cert_axm;
wenzelm@16291
   292
val add_defs = gen_add_defs read_axm;
wenzelm@16291
   293
wenzelm@16291
   294
end;
wenzelm@3767
   295
wenzelm@3767
   296
wenzelm@16443
   297
(* add_finals(_i) *)
skalberg@14223
   298
wenzelm@16291
   299
local
wenzelm@16291
   300
wenzelm@17706
   301
fun gen_add_finals prep_term overloaded args thy =
skalberg@14223
   302
  let
wenzelm@17706
   303
    fun const_of (Const const) = const
wenzelm@17706
   304
      | const_of (Free _) = error "Attempt to finalize variable (or undeclared constant)"
wenzelm@17706
   305
      | const_of _ = error "Attempt to finalize non-constant term";
wenzelm@19693
   306
    fun specify (c, T) = Defs.define (Sign.pp thy) (Sign.consts_of thy) false false
wenzelm@19693
   307
      (Context.theory_name thy) (c ^ " axiom") (prep_const thy (c, T)) [];
wenzelm@17706
   308
    val finalize = specify o check_overloading thy overloaded o
wenzelm@18943
   309
      const_of o Sign.no_vars (Sign.pp thy) o prep_term thy;
wenzelm@17706
   310
  in thy |> map_defs (fold finalize args) end;
wenzelm@16291
   311
skalberg@14223
   312
in
wenzelm@16291
   313
wenzelm@17706
   314
val add_finals = gen_add_finals Sign.read_term;
wenzelm@17706
   315
val add_finals_i = gen_add_finals Sign.cert_term;
wenzelm@16291
   316
skalberg@14223
   317
end;
skalberg@14223
   318
skalberg@14223
   319
wenzelm@3878
   320
wenzelm@16443
   321
(** add oracle **)
wenzelm@3814
   322
wenzelm@16443
   323
fun add_oracle (bname, oracle) thy = thy |> map_oracles (fn oracles =>
wenzelm@16443
   324
  NameSpace.extend_table (Sign.naming_of thy) (oracles, [(bname, (oracle, stamp ()))])
wenzelm@16443
   325
    handle Symtab.DUPS dups => err_dup_oras dups);
wenzelm@3885
   326
paulson@1526
   327
end;
paulson@1526
   328
wenzelm@3767
   329
structure BasicTheory: BASIC_THEORY = Theory;
wenzelm@3767
   330
open BasicTheory;