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