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