src/Pure/theory.ML
author wenzelm
Sat Mar 27 16:01:45 2010 +0100 (2010-03-27 ago)
changeset 35987 7c728daf4876
parent 35985 0bbf0d2348f9
child 35988 76ca601c941e
permissions -rw-r--r--
disallow sort constraints in primitive Theory.add_axiom/add_def -- handled in Thm.add_axiom/add_def;
paulson@1526
     1
(*  Title:      Pure/theory.ML
paulson@1526
     2
    Author:     Lawrence C Paulson and Markus Wenzel
paulson@1526
     3
wenzelm@28290
     4
Logical theory content: axioms, definitions, and begin/end wrappers.
paulson@1526
     5
*)
wenzelm@16291
     6
wenzelm@26668
     7
signature THEORY =
wenzelm@3767
     8
sig
wenzelm@16443
     9
  val eq_thy: theory * theory -> bool
wenzelm@3996
    10
  val subthy: theory * theory -> bool
wenzelm@24666
    11
  val assert_super: theory -> theory -> theory
wenzelm@22684
    12
  val parents_of: theory -> theory list
wenzelm@22684
    13
  val ancestors_of: theory -> theory list
wenzelm@24666
    14
  val check_thy: theory -> theory_ref
wenzelm@24666
    15
  val deref: theory_ref -> theory
wenzelm@24666
    16
  val merge: theory * theory -> theory
wenzelm@24666
    17
  val merge_refs: theory_ref * theory_ref -> theory_ref
wenzelm@24666
    18
  val merge_list: theory list -> theory
wenzelm@16495
    19
  val checkpoint: theory -> theory
wenzelm@16495
    20
  val copy: theory -> theory
wenzelm@24666
    21
  val requires: theory -> string -> string -> unit
wenzelm@33095
    22
  val axiom_space: theory -> Name_Space.T
wenzelm@22684
    23
  val axiom_table: theory -> term Symtab.table
wenzelm@16339
    24
  val axioms_of: theory -> (string * term) list
wenzelm@16339
    25
  val all_axioms_of: theory -> (string * term) list
wenzelm@24666
    26
  val defs_of: theory -> Defs.T
wenzelm@24666
    27
  val at_begin: (theory -> theory option) -> theory -> theory
wenzelm@24666
    28
  val at_end: (theory -> theory option) -> theory -> theory
wenzelm@24666
    29
  val begin_theory: string -> theory list -> theory
wenzelm@24666
    30
  val end_theory: theory -> theory
wenzelm@35857
    31
  val add_axiom: binding * term -> theory -> theory
wenzelm@19708
    32
  val add_deps: string -> string * typ -> (string * typ) list -> theory -> theory
wenzelm@35985
    33
  val add_def: bool -> bool -> binding * term -> theory -> theory
haftmann@29581
    34
  val add_finals_i: bool -> term list -> theory -> theory
wenzelm@16443
    35
  val add_finals: bool -> string list -> theory -> theory
wenzelm@33173
    36
  val specify_const: (binding * typ) * mixfix -> theory -> term * theory
wenzelm@16495
    37
end
paulson@1526
    38
wenzelm@24666
    39
structure Theory: THEORY =
wenzelm@16443
    40
struct
wenzelm@16443
    41
wenzelm@19708
    42
wenzelm@24666
    43
(** theory context operations **)
wenzelm@16443
    44
wenzelm@16443
    45
val eq_thy = Context.eq_thy;
wenzelm@16443
    46
val subthy = Context.subthy;
paulson@1526
    47
haftmann@24626
    48
fun assert_super thy1 thy2 =
haftmann@24626
    49
  if subthy (thy1, thy2) then thy2
haftmann@24626
    50
  else raise THEORY ("Not a super theory", [thy1, thy2]);
haftmann@24626
    51
wenzelm@16443
    52
val parents_of = Context.parents_of;
wenzelm@16443
    53
val ancestors_of = Context.ancestors_of;
wenzelm@16443
    54
wenzelm@24137
    55
val check_thy = Context.check_thy;
wenzelm@16443
    56
val deref = Context.deref;
wenzelm@24666
    57
wenzelm@16443
    58
val merge = Context.merge;
wenzelm@16443
    59
val merge_refs = Context.merge_refs;
wenzelm@16443
    60
wenzelm@23600
    61
fun merge_list [] = raise THEORY ("Empty merge of theories", [])
wenzelm@21608
    62
  | merge_list (thy :: thys) = Library.foldl merge (thy, thys);
wenzelm@21608
    63
wenzelm@16495
    64
val checkpoint = Context.checkpoint_thy;
wenzelm@16495
    65
val copy = Context.copy_thy;
wenzelm@16495
    66
wenzelm@24666
    67
fun requires thy name what =
wenzelm@29092
    68
  if exists (fn thy' => Context.theory_name thy' = name) (thy :: ancestors_of thy) then ()
wenzelm@24666
    69
  else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what);
wenzelm@24666
    70
wenzelm@24666
    71
wenzelm@24666
    72
wenzelm@25059
    73
(** datatype thy **)
wenzelm@24666
    74
wenzelm@24666
    75
type wrapper = (theory -> theory option) * stamp;
wenzelm@24666
    76
wenzelm@24666
    77
fun apply_wrappers (wrappers: wrapper list) =
wenzelm@25059
    78
  perhaps (perhaps_loop (perhaps_apply (map fst wrappers)));
wenzelm@24666
    79
wenzelm@24666
    80
datatype thy = Thy of
wenzelm@33095
    81
 {axioms: term Name_Space.table,
wenzelm@24666
    82
  defs: Defs.T,
wenzelm@24666
    83
  wrappers: wrapper list * wrapper list};
wenzelm@24666
    84
wenzelm@28290
    85
fun make_thy (axioms, defs, wrappers) = Thy {axioms = axioms, defs = defs, wrappers = wrappers};
wenzelm@24666
    86
wenzelm@34259
    87
structure ThyData = Theory_Data_PP
wenzelm@24666
    88
(
wenzelm@24666
    89
  type T = thy;
wenzelm@33159
    90
  val empty_axioms = Name_Space.empty_table "axiom" : term Name_Space.table;
wenzelm@33096
    91
  val empty = make_thy (empty_axioms, Defs.empty, ([], []));
wenzelm@24666
    92
wenzelm@33096
    93
  fun extend (Thy {axioms = _, defs, wrappers}) = make_thy (empty_axioms, defs, wrappers);
wenzelm@24666
    94
wenzelm@24666
    95
  fun merge pp (thy1, thy2) =
wenzelm@24666
    96
    let
wenzelm@28290
    97
      val Thy {axioms = _, defs = defs1, wrappers = (bgs1, ens1)} = thy1;
wenzelm@28290
    98
      val Thy {axioms = _, defs = defs2, wrappers = (bgs2, ens2)} = thy2;
wenzelm@24666
    99
wenzelm@33096
   100
      val axioms' = empty_axioms;
wenzelm@24666
   101
      val defs' = Defs.merge pp (defs1, defs2);
wenzelm@24666
   102
      val bgs' = Library.merge (eq_snd op =) (bgs1, bgs2);
wenzelm@24666
   103
      val ens' = Library.merge (eq_snd op =) (ens1, ens2);
wenzelm@28290
   104
    in make_thy (axioms', defs', (bgs', ens')) end;
wenzelm@24666
   105
);
wenzelm@24666
   106
wenzelm@24666
   107
fun rep_theory thy = ThyData.get thy |> (fn Thy args => args);
wenzelm@24666
   108
wenzelm@28290
   109
fun map_thy f = ThyData.map (fn (Thy {axioms, defs, wrappers}) =>
wenzelm@28290
   110
  make_thy (f (axioms, defs, wrappers)));
wenzelm@24666
   111
wenzelm@24666
   112
wenzelm@28290
   113
fun map_axioms f = map_thy (fn (axioms, defs, wrappers) => (f axioms, defs, wrappers));
wenzelm@28290
   114
fun map_defs f = map_thy (fn (axioms, defs, wrappers) => (axioms, f defs, wrappers));
wenzelm@28290
   115
fun map_wrappers f = map_thy (fn (axioms, defs, wrappers) => (axioms, defs, f wrappers));
wenzelm@24666
   116
wenzelm@24666
   117
wenzelm@24666
   118
(* basic operations *)
wenzelm@24666
   119
wenzelm@24666
   120
val axiom_space = #1 o #axioms o rep_theory;
wenzelm@24666
   121
val axiom_table = #2 o #axioms o rep_theory;
wenzelm@24666
   122
wenzelm@24666
   123
val axioms_of = Symtab.dest o #2 o #axioms o rep_theory;
wenzelm@24666
   124
fun all_axioms_of thy = maps axioms_of (thy :: ancestors_of thy);
wenzelm@24666
   125
wenzelm@24666
   126
val defs_of = #defs o rep_theory;
wenzelm@24666
   127
wenzelm@24666
   128
wenzelm@24666
   129
(* begin/end theory *)
wenzelm@24666
   130
wenzelm@24666
   131
val begin_wrappers = rev o #1 o #wrappers o rep_theory;
wenzelm@24666
   132
val end_wrappers = rev o #2 o #wrappers o rep_theory;
wenzelm@24666
   133
wenzelm@24666
   134
fun at_begin f = map_wrappers (apfst (cons (f, stamp ())));
wenzelm@24666
   135
fun at_end f = map_wrappers (apsnd (cons (f, stamp ())));
wenzelm@24666
   136
wenzelm@24666
   137
fun begin_theory name imports =
wenzelm@24666
   138
  let
wenzelm@26939
   139
    val thy = Context.begin_thy Syntax.pp_global name imports;
wenzelm@24666
   140
    val wrappers = begin_wrappers thy;
wenzelm@33168
   141
  in
wenzelm@33168
   142
    thy
wenzelm@33168
   143
    |> Sign.local_path
wenzelm@33168
   144
    |> Sign.map_naming (Name_Space.set_theory_name name)
wenzelm@33168
   145
    |> apply_wrappers wrappers
wenzelm@33168
   146
  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@35985
   153
(** primitive specifications **)
wenzelm@3814
   154
wenzelm@35985
   155
(* raw axioms *)
paulson@1526
   156
haftmann@29581
   157
fun cert_axm thy (b, raw_tm) =
paulson@1526
   158
  let
wenzelm@32789
   159
    val t = Sign.cert_prop thy raw_tm
wenzelm@2979
   160
      handle TYPE (msg, _, _) => error msg
wenzelm@16291
   161
        | TERM (msg, _) => error msg;
wenzelm@35987
   162
    val _ = Term.no_dummy_patterns t handle TERM (msg, _) => error msg;
wenzelm@35987
   163
wenzelm@35987
   164
    val bad_sorts =
wenzelm@35987
   165
      rev ((fold_types o fold_atyps_sorts) (fn (_, []) => I | (T, _) => insert (op =) T) t []);
wenzelm@35987
   166
    val _ = null bad_sorts orelse
wenzelm@35987
   167
      error ("Illegal sort constraints in primitive specification: " ^
wenzelm@35987
   168
        commas (map (setmp_CRITICAL show_sorts true (Syntax.string_of_typ_global thy)) bad_sorts));
paulson@1526
   169
  in
haftmann@29581
   170
    (b, Sign.no_vars (Syntax.pp_global thy) t)
wenzelm@35987
   171
  end handle ERROR msg =>
wenzelm@35987
   172
    cat_error msg ("The error(s) above occurred in axiom " ^ quote (Binding.str_of b));
paulson@1526
   173
wenzelm@35857
   174
fun add_axiom raw_axm thy = thy |> map_axioms (fn axioms =>
paulson@1526
   175
  let
wenzelm@35857
   176
    val axm = apsnd Logic.varify_global (cert_axm thy raw_axm);
wenzelm@35857
   177
    val (_, axioms') = Name_Space.define true (Sign.naming_of thy) axm axioms;
wenzelm@16443
   178
  in axioms' end);
paulson@1526
   179
paulson@1526
   180
wenzelm@19708
   181
(* dependencies *)
wenzelm@19708
   182
wenzelm@33701
   183
fun dependencies thy unchecked def description lhs rhs =
wenzelm@19708
   184
  let
wenzelm@26939
   185
    val pp = Syntax.pp_global thy;
wenzelm@19708
   186
    val consts = Sign.consts_of thy;
wenzelm@19727
   187
    fun prep const =
wenzelm@19727
   188
      let val Const (c, T) = Sign.no_vars pp (Const const)
wenzelm@35845
   189
      in (c, Consts.typargs consts (c, Logic.varifyT_global T)) end;
wenzelm@19708
   190
wenzelm@19708
   191
    val lhs_vars = Term.add_tfreesT (#2 lhs) [];
wenzelm@19708
   192
    val rhs_extras = fold (#2 #> Term.fold_atyps (fn TFree v =>
wenzelm@19708
   193
      if member (op =) lhs_vars v then I else insert (op =) v | _ => I)) rhs [];
wenzelm@19708
   194
    val _ =
wenzelm@19708
   195
      if null rhs_extras then ()
wenzelm@19708
   196
      else error ("Specification depends on extra type variables: " ^
wenzelm@19708
   197
        commas_quote (map (Pretty.string_of_typ pp o TFree) rhs_extras) ^
wenzelm@33701
   198
        "\nThe error(s) above occurred in " ^ quote description);
wenzelm@33701
   199
  in Defs.define pp unchecked def description (prep lhs) (map prep rhs) end;
wenzelm@19708
   200
wenzelm@19708
   201
fun add_deps a raw_lhs raw_rhs thy =
wenzelm@19708
   202
  let
wenzelm@19708
   203
    val lhs :: rhs = map (dest_Const o Sign.cert_term thy o Const) (raw_lhs :: raw_rhs);
wenzelm@33701
   204
    val description = if a = "" then #1 lhs ^ " axiom" else a;
wenzelm@33701
   205
  in thy |> map_defs (dependencies thy false NONE description lhs rhs) end;
wenzelm@17706
   206
wenzelm@33173
   207
fun specify_const decl thy =
wenzelm@33173
   208
  let val (t as Const const, thy') = Sign.declare_const decl thy
wenzelm@28112
   209
  in (t, add_deps "" const [] thy') end;
wenzelm@25017
   210
wenzelm@17706
   211
wenzelm@35985
   212
(* overloading *)
nipkow@9280
   213
wenzelm@16944
   214
fun check_overloading thy overloaded (c, T) =
wenzelm@16291
   215
  let
wenzelm@24763
   216
    val declT = Sign.the_const_constraint thy c
wenzelm@24763
   217
      handle TYPE (msg, _, _) => error msg;
wenzelm@35845
   218
    val T' = Logic.varifyT_global T;
wenzelm@16944
   219
wenzelm@16944
   220
    fun message txt =
wenzelm@16944
   221
      [Pretty.block [Pretty.str "Specification of constant ",
wenzelm@26939
   222
        Pretty.str c, Pretty.str " ::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ_global thy T)],
wenzelm@16944
   223
        Pretty.str txt] |> Pretty.chunks |> Pretty.string_of;
wenzelm@16291
   224
  in
wenzelm@16944
   225
    if Sign.typ_instance thy (declT, T') then ()
wenzelm@16944
   226
    else if Type.raw_instance (declT, T') then
wenzelm@32966
   227
      error (setmp_CRITICAL show_sorts true
wenzelm@16944
   228
        message "imposes additional sort constraints on the constant declaration")
wenzelm@16944
   229
    else if overloaded then ()
wenzelm@16944
   230
    else warning (message "is strictly less general than the declared type");
wenzelm@16944
   231
    (c, T)
nipkow@9280
   232
  end;
nipkow@9280
   233
wenzelm@3767
   234
wenzelm@35985
   235
(* definitional axioms *)
wenzelm@35985
   236
wenzelm@35985
   237
local
wenzelm@16291
   238
haftmann@29581
   239
fun check_def thy unchecked overloaded (b, tm) defs =
wenzelm@16291
   240
  let
wenzelm@24981
   241
    val ctxt = ProofContext.init thy;
haftmann@29581
   242
    val name = Sign.full_name thy b;
wenzelm@24981
   243
    val (lhs_const, rhs) = Sign.cert_def ctxt tm;
wenzelm@16944
   244
    val rhs_consts = fold_aterms (fn Const const => insert (op =) const | _ => I) rhs [];
wenzelm@18943
   245
    val _ = check_overloading thy overloaded lhs_const;
wenzelm@33701
   246
  in defs |> dependencies thy unchecked (SOME name) name lhs_const rhs_consts end
wenzelm@18678
   247
  handle ERROR msg => cat_error msg (Pretty.string_of (Pretty.block
wenzelm@30218
   248
   [Pretty.str ("The error(s) above occurred in definition " ^ quote (Binding.str_of b) ^ ":"),
wenzelm@26939
   249
    Pretty.fbrk, Pretty.quote (Syntax.pretty_term_global thy tm)]));
wenzelm@3767
   250
wenzelm@16291
   251
in
wenzelm@16291
   252
wenzelm@35985
   253
fun add_def unchecked overloaded raw_axm thy =
wenzelm@35985
   254
  let val axm = cert_axm thy raw_axm in
wenzelm@35985
   255
    thy
wenzelm@35985
   256
    |> map_defs (check_def thy unchecked overloaded axm)
wenzelm@35985
   257
    |> add_axiom axm
wenzelm@35985
   258
  end;
wenzelm@16291
   259
wenzelm@16291
   260
end;
wenzelm@3767
   261
wenzelm@3767
   262
wenzelm@16443
   263
(* add_finals(_i) *)
skalberg@14223
   264
wenzelm@16291
   265
local
wenzelm@16291
   266
wenzelm@17706
   267
fun gen_add_finals prep_term overloaded args thy =
skalberg@14223
   268
  let
wenzelm@17706
   269
    fun const_of (Const const) = const
wenzelm@17706
   270
      | const_of (Free _) = error "Attempt to finalize variable (or undeclared constant)"
wenzelm@17706
   271
      | const_of _ = error "Attempt to finalize non-constant term";
wenzelm@33701
   272
    fun specify (c, T) = dependencies thy false NONE (c ^ " axiom") (c, T) [];
wenzelm@24708
   273
    val finalize = specify o check_overloading thy overloaded o const_of o
wenzelm@24708
   274
      Sign.cert_term thy o prep_term thy;
wenzelm@17706
   275
  in thy |> map_defs (fold finalize args) end;
wenzelm@16291
   276
skalberg@14223
   277
in
wenzelm@16291
   278
haftmann@29581
   279
val add_finals_i = gen_add_finals (K I);
wenzelm@24708
   280
val add_finals = gen_add_finals Syntax.read_term_global;
wenzelm@16291
   281
skalberg@14223
   282
end;
skalberg@14223
   283
paulson@1526
   284
end;