src/Pure/theory.ML
author wenzelm
Sat Mar 15 18:08:00 2008 +0100 (2008-03-15)
changeset 26279 e8440c90c474
parent 25059 e6e0ee56a672
child 26631 d6b6c74a8bcf
permissions -rw-r--r--
removed obsolete fact_index.ML;
added facts.ML;
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
wenzelm@16443
    10
  val eq_thy: theory * theory -> bool
wenzelm@3996
    11
  val subthy: theory * theory -> bool
wenzelm@3767
    12
end
wenzelm@3767
    13
wenzelm@3767
    14
signature THEORY =
wenzelm@3767
    15
sig
wenzelm@3767
    16
  include BASIC_THEORY
wenzelm@16443
    17
  include SIGN_THEORY
wenzelm@24666
    18
  val assert_super: theory -> theory -> theory
wenzelm@22684
    19
  val parents_of: theory -> theory list
wenzelm@22684
    20
  val ancestors_of: theory -> theory list
wenzelm@24666
    21
  val check_thy: theory -> theory_ref
wenzelm@24666
    22
  val deref: theory_ref -> theory
wenzelm@24666
    23
  val merge: theory * theory -> theory
wenzelm@24666
    24
  val merge_refs: theory_ref * theory_ref -> theory_ref
wenzelm@24666
    25
  val merge_list: theory list -> theory
wenzelm@16495
    26
  val checkpoint: theory -> theory
wenzelm@16495
    27
  val copy: theory -> theory
wenzelm@24666
    28
  val requires: theory -> string -> string -> unit
wenzelm@16443
    29
  val axiom_space: theory -> NameSpace.T
wenzelm@22684
    30
  val axiom_table: theory -> term Symtab.table
wenzelm@16443
    31
  val oracle_space: theory -> NameSpace.T
wenzelm@22684
    32
  val oracle_table: theory -> ((theory * Object.T -> term) * stamp) Symtab.table
wenzelm@16339
    33
  val axioms_of: theory -> (string * term) list
wenzelm@16339
    34
  val all_axioms_of: theory -> (string * term) list
wenzelm@24666
    35
  val defs_of: theory -> Defs.T
wenzelm@24666
    36
  val at_begin: (theory -> theory option) -> theory -> theory
wenzelm@24666
    37
  val at_end: (theory -> theory option) -> theory -> theory
wenzelm@24666
    38
  val begin_theory: string -> theory list -> theory
wenzelm@24666
    39
  val end_theory: theory -> theory
wenzelm@3996
    40
  val add_axioms: (bstring * string) list -> theory -> theory
wenzelm@3996
    41
  val add_axioms_i: (bstring * term) list -> theory -> theory
wenzelm@19708
    42
  val add_deps: string -> string * typ -> (string * typ) list -> theory -> theory
wenzelm@19630
    43
  val add_defs: bool -> bool -> (bstring * string) list -> theory -> theory
wenzelm@19630
    44
  val add_defs_i: bool -> bool -> (bstring * term) list -> theory -> theory
wenzelm@16443
    45
  val add_finals: bool -> string list -> theory -> theory
wenzelm@16443
    46
  val add_finals_i: bool -> term list -> theory -> theory
wenzelm@25017
    47
  val specify_const: Markup.property list -> bstring * typ * mixfix -> (string * typ) list ->
wenzelm@25017
    48
   theory -> term * theory
wenzelm@16443
    49
  val add_oracle: bstring * (theory * Object.T -> term) -> theory -> theory
wenzelm@16495
    50
end
paulson@1526
    51
wenzelm@24666
    52
structure Theory: THEORY =
wenzelm@16443
    53
struct
wenzelm@16443
    54
wenzelm@19708
    55
wenzelm@24666
    56
(** theory context operations **)
wenzelm@16443
    57
wenzelm@16443
    58
val eq_thy = Context.eq_thy;
wenzelm@16443
    59
val subthy = Context.subthy;
paulson@1526
    60
haftmann@24626
    61
fun assert_super thy1 thy2 =
haftmann@24626
    62
  if subthy (thy1, thy2) then thy2
haftmann@24626
    63
  else raise THEORY ("Not a super theory", [thy1, thy2]);
haftmann@24626
    64
wenzelm@16443
    65
val parents_of = Context.parents_of;
wenzelm@16443
    66
val ancestors_of = Context.ancestors_of;
wenzelm@16443
    67
wenzelm@24137
    68
val check_thy = Context.check_thy;
wenzelm@16443
    69
val deref = Context.deref;
wenzelm@24666
    70
wenzelm@16443
    71
val merge = Context.merge;
wenzelm@16443
    72
val merge_refs = Context.merge_refs;
wenzelm@16443
    73
wenzelm@23600
    74
fun merge_list [] = raise THEORY ("Empty merge of theories", [])
wenzelm@21608
    75
  | merge_list (thy :: thys) = Library.foldl merge (thy, thys);
wenzelm@21608
    76
wenzelm@16495
    77
val checkpoint = Context.checkpoint_thy;
wenzelm@16495
    78
val copy = Context.copy_thy;
wenzelm@16495
    79
wenzelm@24666
    80
fun requires thy name what =
wenzelm@24666
    81
  if Context.exists_name name thy then ()
wenzelm@24666
    82
  else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what);
wenzelm@24666
    83
wenzelm@24666
    84
wenzelm@24666
    85
wenzelm@25059
    86
(** datatype thy **)
wenzelm@24666
    87
wenzelm@24666
    88
type wrapper = (theory -> theory option) * stamp;
wenzelm@24666
    89
wenzelm@24666
    90
fun apply_wrappers (wrappers: wrapper list) =
wenzelm@25059
    91
  perhaps (perhaps_loop (perhaps_apply (map fst wrappers)));
wenzelm@24666
    92
wenzelm@24666
    93
datatype thy = Thy of
wenzelm@24666
    94
 {axioms: term NameSpace.table,
wenzelm@24666
    95
  defs: Defs.T,
wenzelm@24666
    96
  oracles: ((theory * Object.T -> term) * stamp) NameSpace.table,
wenzelm@24666
    97
  wrappers: wrapper list * wrapper list};
wenzelm@24666
    98
wenzelm@24666
    99
fun make_thy (axioms, defs, oracles, wrappers) =
wenzelm@24666
   100
  Thy {axioms = axioms, defs = defs, oracles = oracles, wrappers = wrappers};
wenzelm@24666
   101
wenzelm@24666
   102
fun err_dup_axm dup = error ("Duplicate axiom: " ^ quote dup);
wenzelm@24666
   103
fun err_dup_ora dup = error ("Duplicate oracle: " ^ quote dup);
wenzelm@24666
   104
wenzelm@24666
   105
structure ThyData = TheoryDataFun
wenzelm@24666
   106
(
wenzelm@24666
   107
  type T = thy;
wenzelm@24666
   108
  val empty = make_thy (NameSpace.empty_table, Defs.empty, NameSpace.empty_table, ([], []));
wenzelm@24666
   109
  val copy = I;
wenzelm@24666
   110
wenzelm@24666
   111
  fun extend (Thy {axioms, defs, oracles, wrappers}) =
wenzelm@24666
   112
    make_thy (NameSpace.empty_table, defs, oracles, wrappers);
wenzelm@24666
   113
wenzelm@24666
   114
  fun merge pp (thy1, thy2) =
wenzelm@24666
   115
    let
wenzelm@24666
   116
      val Thy {axioms = _, defs = defs1, oracles = oracles1, wrappers = (bgs1, ens1)} = thy1;
wenzelm@24666
   117
      val Thy {axioms = _, defs = defs2, oracles = oracles2, wrappers = (bgs2, ens2)} = thy2;
wenzelm@24666
   118
wenzelm@24666
   119
      val axioms' = NameSpace.empty_table;
wenzelm@24666
   120
      val defs' = Defs.merge pp (defs1, defs2);
wenzelm@24666
   121
      val oracles' = NameSpace.merge_tables (eq_snd (op =)) (oracles1, oracles2)
wenzelm@24666
   122
        handle Symtab.DUP dup => err_dup_ora dup;
wenzelm@24666
   123
      val bgs' = Library.merge (eq_snd op =) (bgs1, bgs2);
wenzelm@24666
   124
      val ens' = Library.merge (eq_snd op =) (ens1, ens2);
wenzelm@24666
   125
    in make_thy (axioms', defs', oracles', (bgs', ens')) end;
wenzelm@24666
   126
);
wenzelm@24666
   127
wenzelm@24666
   128
fun rep_theory thy = ThyData.get thy |> (fn Thy args => args);
wenzelm@24666
   129
wenzelm@24666
   130
fun map_thy f = ThyData.map (fn (Thy {axioms, defs, oracles, wrappers}) =>
wenzelm@24666
   131
  make_thy (f (axioms, defs, oracles, wrappers)));
wenzelm@24666
   132
wenzelm@24666
   133
wenzelm@24666
   134
fun map_axioms f = map_thy
wenzelm@24666
   135
  (fn (axioms, defs, oracles, wrappers) => (f axioms, defs, oracles, wrappers));
wenzelm@24666
   136
wenzelm@24666
   137
fun map_defs f = map_thy
wenzelm@24666
   138
  (fn (axioms, defs, oracles, wrappers) => (axioms, f defs, oracles, wrappers));
wenzelm@24666
   139
wenzelm@24666
   140
fun map_oracles f = map_thy
wenzelm@24666
   141
  (fn (axioms, defs, oracles, wrappers) => (axioms, defs, f oracles, wrappers));
wenzelm@24666
   142
wenzelm@24666
   143
fun map_wrappers f = map_thy
wenzelm@24666
   144
  (fn (axioms, defs, oracles, wrappers) => (axioms, defs, oracles, f wrappers));
wenzelm@24666
   145
wenzelm@24666
   146
wenzelm@24666
   147
(* basic operations *)
wenzelm@24666
   148
wenzelm@24666
   149
val axiom_space = #1 o #axioms o rep_theory;
wenzelm@24666
   150
val axiom_table = #2 o #axioms o rep_theory;
wenzelm@24666
   151
wenzelm@24666
   152
val oracle_space = #1 o #oracles o rep_theory;
wenzelm@24666
   153
val oracle_table = #2 o #oracles o rep_theory;
wenzelm@24666
   154
wenzelm@24666
   155
val axioms_of = Symtab.dest o #2 o #axioms o rep_theory;
wenzelm@24666
   156
fun all_axioms_of thy = maps axioms_of (thy :: ancestors_of thy);
wenzelm@24666
   157
wenzelm@24666
   158
val defs_of = #defs o rep_theory;
wenzelm@24666
   159
wenzelm@24666
   160
wenzelm@24666
   161
(* begin/end theory *)
wenzelm@24666
   162
wenzelm@24666
   163
val begin_wrappers = rev o #1 o #wrappers o rep_theory;
wenzelm@24666
   164
val end_wrappers = rev o #2 o #wrappers o rep_theory;
wenzelm@24666
   165
wenzelm@24666
   166
fun at_begin f = map_wrappers (apfst (cons (f, stamp ())));
wenzelm@24666
   167
fun at_end f = map_wrappers (apsnd (cons (f, stamp ())));
wenzelm@24666
   168
wenzelm@24666
   169
fun begin_theory name imports =
wenzelm@24666
   170
  let
wenzelm@24666
   171
    val thy = Context.begin_thy Sign.pp name imports;
wenzelm@24666
   172
    val wrappers = begin_wrappers thy;
wenzelm@24666
   173
  in thy |> Sign.local_path |> apply_wrappers wrappers end;
wenzelm@24666
   174
wenzelm@24666
   175
fun end_theory thy =
wenzelm@24666
   176
  thy |> apply_wrappers (end_wrappers thy) |> Context.finish_thy;
wenzelm@24666
   177
wenzelm@16443
   178
wenzelm@16443
   179
(* signature operations *)
wenzelm@16443
   180
wenzelm@16443
   181
structure SignTheory: SIGN_THEORY = Sign;
wenzelm@16443
   182
open SignTheory;
wenzelm@16443
   183
wenzelm@2206
   184
wenzelm@3996
   185
wenzelm@24666
   186
(** add axioms **)
wenzelm@3814
   187
paulson@1526
   188
(* prepare axioms *)
paulson@1526
   189
wenzelm@18678
   190
fun err_in_axm msg name =
wenzelm@18678
   191
  cat_error msg ("The error(s) above occurred in axiom " ^ quote name);
paulson@1526
   192
wenzelm@16443
   193
fun cert_axm thy (name, raw_tm) =
paulson@1526
   194
  let
wenzelm@18968
   195
    val (t, T, _) = Sign.certify_prop thy raw_tm
wenzelm@2979
   196
      handle TYPE (msg, _, _) => error msg
wenzelm@16291
   197
        | TERM (msg, _) => error msg;
paulson@1526
   198
  in
wenzelm@9537
   199
    Term.no_dummy_patterns t handle TERM (msg, _) => error msg;
wenzelm@18968
   200
    (name, Sign.no_vars (Sign.pp thy) t)
wenzelm@9629
   201
  end;
paulson@1526
   202
wenzelm@22684
   203
fun read_axm thy (name, str) =
wenzelm@24708
   204
  cert_axm thy (name, Syntax.read_prop_global thy str)
wenzelm@22689
   205
    handle ERROR msg => err_in_axm msg name;
paulson@1526
   206
paulson@1526
   207
wenzelm@16443
   208
(* add_axioms(_i) *)
paulson@1526
   209
wenzelm@16291
   210
local
wenzelm@16291
   211
wenzelm@16443
   212
fun gen_add_axioms prep_axm raw_axms thy = thy |> map_axioms (fn axioms =>
paulson@1526
   213
  let
wenzelm@16991
   214
    val axms = map (apsnd (Compress.term thy o Logic.varify) o prep_axm thy) raw_axms;
haftmann@23086
   215
    val axioms' = NameSpace.extend_table (Sign.naming_of thy) axms axioms
wenzelm@23655
   216
      handle Symtab.DUP dup => err_dup_axm dup;
wenzelm@16443
   217
  in axioms' end);
paulson@1526
   218
wenzelm@16291
   219
in
wenzelm@16291
   220
wenzelm@16291
   221
val add_axioms = gen_add_axioms read_axm;
wenzelm@16291
   222
val add_axioms_i = gen_add_axioms cert_axm;
wenzelm@16291
   223
wenzelm@16291
   224
end;
paulson@1526
   225
paulson@1526
   226
wenzelm@3767
   227
wenzelm@3767
   228
(** add constant definitions **)
wenzelm@3767
   229
wenzelm@19708
   230
(* dependencies *)
wenzelm@19708
   231
wenzelm@19708
   232
fun dependencies thy unchecked is_def name lhs rhs =
wenzelm@19708
   233
  let
wenzelm@19708
   234
    val pp = Sign.pp thy;
wenzelm@19708
   235
    val consts = Sign.consts_of thy;
wenzelm@19727
   236
    fun prep const =
wenzelm@19727
   237
      let val Const (c, T) = Sign.no_vars pp (Const const)
wenzelm@19806
   238
      in (c, Consts.typargs consts (c, Compress.typ thy (Logic.varifyT T))) end;
wenzelm@19708
   239
wenzelm@19708
   240
    val lhs_vars = Term.add_tfreesT (#2 lhs) [];
wenzelm@19708
   241
    val rhs_extras = fold (#2 #> Term.fold_atyps (fn TFree v =>
wenzelm@19708
   242
      if member (op =) lhs_vars v then I else insert (op =) v | _ => I)) rhs [];
wenzelm@19708
   243
    val _ =
wenzelm@19708
   244
      if null rhs_extras then ()
wenzelm@19708
   245
      else error ("Specification depends on extra type variables: " ^
wenzelm@19708
   246
        commas_quote (map (Pretty.string_of_typ pp o TFree) rhs_extras) ^
wenzelm@19708
   247
        "\nThe error(s) above occurred in " ^ quote name);
haftmann@24199
   248
  in Defs.define pp unchecked is_def name (prep lhs) (map prep rhs) end;
wenzelm@19708
   249
wenzelm@19708
   250
fun add_deps a raw_lhs raw_rhs thy =
wenzelm@19708
   251
  let
wenzelm@19708
   252
    val lhs :: rhs = map (dest_Const o Sign.cert_term thy o Const) (raw_lhs :: raw_rhs);
wenzelm@19708
   253
    val name = if a = "" then (#1 lhs ^ " axiom") else a;
wenzelm@19708
   254
  in thy |> map_defs (dependencies thy false false name lhs rhs) end;
wenzelm@17706
   255
wenzelm@25017
   256
fun specify_const tags decl deps thy =
wenzelm@25017
   257
  let val (t as Const const, thy') = Sign.declare_const tags decl thy
wenzelm@25017
   258
  in (t, add_deps "" const deps thy') end;
wenzelm@25017
   259
wenzelm@17706
   260
wenzelm@16944
   261
(* check_overloading *)
nipkow@9280
   262
wenzelm@16944
   263
fun check_overloading thy overloaded (c, T) =
wenzelm@16291
   264
  let
wenzelm@24763
   265
    val declT = Sign.the_const_constraint thy c
wenzelm@24763
   266
      handle TYPE (msg, _, _) => error msg;
wenzelm@19806
   267
    val T' = Logic.varifyT T;
wenzelm@16944
   268
wenzelm@16944
   269
    fun message txt =
wenzelm@16944
   270
      [Pretty.block [Pretty.str "Specification of constant ",
wenzelm@16944
   271
        Pretty.str c, Pretty.str " ::", Pretty.brk 1, Pretty.quote (Sign.pretty_typ thy T)],
wenzelm@16944
   272
        Pretty.str txt] |> Pretty.chunks |> Pretty.string_of;
wenzelm@16291
   273
  in
wenzelm@16944
   274
    if Sign.typ_instance thy (declT, T') then ()
wenzelm@16944
   275
    else if Type.raw_instance (declT, T') then
wenzelm@16944
   276
      error (Library.setmp show_sorts true
wenzelm@16944
   277
        message "imposes additional sort constraints on the constant declaration")
wenzelm@16944
   278
    else if overloaded then ()
wenzelm@16944
   279
    else warning (message "is strictly less general than the declared type");
wenzelm@16944
   280
    (c, T)
nipkow@9280
   281
  end;
nipkow@9280
   282
wenzelm@3767
   283
wenzelm@16291
   284
(* check_def *)
wenzelm@16291
   285
wenzelm@19630
   286
fun check_def thy unchecked overloaded (bname, tm) defs =
wenzelm@16291
   287
  let
wenzelm@24981
   288
    val ctxt = ProofContext.init thy;
wenzelm@17706
   289
    val name = Sign.full_name thy bname;
wenzelm@24981
   290
    val (lhs_const, rhs) = Sign.cert_def ctxt tm;
wenzelm@16944
   291
    val rhs_consts = fold_aterms (fn Const const => insert (op =) const | _ => I) rhs [];
wenzelm@18943
   292
    val _ = check_overloading thy overloaded lhs_const;
wenzelm@19708
   293
  in defs |> dependencies thy unchecked true name lhs_const rhs_consts end
wenzelm@18678
   294
  handle ERROR msg => cat_error msg (Pretty.string_of (Pretty.block
wenzelm@16883
   295
   [Pretty.str ("The error(s) above occurred in definition " ^ quote bname ^ ":"),
wenzelm@19693
   296
    Pretty.fbrk, Pretty.quote (Sign.pretty_term thy tm)]));
wenzelm@3767
   297
wenzelm@3767
   298
wenzelm@16443
   299
(* add_defs(_i) *)
wenzelm@3767
   300
wenzelm@16291
   301
local
wenzelm@9320
   302
wenzelm@19630
   303
fun gen_add_defs prep_axm unchecked overloaded raw_axms thy =
wenzelm@16443
   304
  let val axms = map (prep_axm thy) raw_axms in
wenzelm@16443
   305
    thy
wenzelm@19630
   306
    |> map_defs (fold (check_def thy unchecked overloaded) axms)
wenzelm@9320
   307
    |> add_axioms_i axms
wenzelm@3767
   308
  end;
wenzelm@3767
   309
wenzelm@16291
   310
in
wenzelm@16291
   311
wenzelm@16291
   312
val add_defs_i = gen_add_defs cert_axm;
wenzelm@16291
   313
val add_defs = gen_add_defs read_axm;
wenzelm@16291
   314
wenzelm@16291
   315
end;
wenzelm@3767
   316
wenzelm@3767
   317
wenzelm@16443
   318
(* add_finals(_i) *)
skalberg@14223
   319
wenzelm@16291
   320
local
wenzelm@16291
   321
wenzelm@17706
   322
fun gen_add_finals prep_term overloaded args thy =
skalberg@14223
   323
  let
wenzelm@17706
   324
    fun const_of (Const const) = const
wenzelm@17706
   325
      | const_of (Free _) = error "Attempt to finalize variable (or undeclared constant)"
wenzelm@17706
   326
      | const_of _ = error "Attempt to finalize non-constant term";
wenzelm@19708
   327
    fun specify (c, T) = dependencies thy false false (c ^ " axiom") (c, T) [];
wenzelm@24708
   328
    val finalize = specify o check_overloading thy overloaded o const_of o
wenzelm@24708
   329
      Sign.cert_term thy o prep_term thy;
wenzelm@17706
   330
  in thy |> map_defs (fold finalize args) end;
wenzelm@16291
   331
skalberg@14223
   332
in
wenzelm@16291
   333
wenzelm@24708
   334
val add_finals = gen_add_finals Syntax.read_term_global;
wenzelm@24708
   335
val add_finals_i = gen_add_finals (K I);
wenzelm@16291
   336
skalberg@14223
   337
end;
skalberg@14223
   338
skalberg@14223
   339
wenzelm@3878
   340
wenzelm@16443
   341
(** add oracle **)
wenzelm@3814
   342
wenzelm@16443
   343
fun add_oracle (bname, oracle) thy = thy |> map_oracles (fn oracles =>
haftmann@23086
   344
  NameSpace.extend_table (Sign.naming_of thy) [(bname, (oracle, stamp ()))] oracles
wenzelm@23655
   345
    handle Symtab.DUP dup => err_dup_ora dup);
wenzelm@3885
   346
paulson@1526
   347
end;
paulson@1526
   348
wenzelm@3767
   349
structure BasicTheory: BASIC_THEORY = Theory;
wenzelm@3767
   350
open BasicTheory;