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