src/Pure/Isar/local_defs.ML
author wenzelm
Thu Oct 11 21:10:41 2007 +0200 (2007-10-11 ago)
changeset 24985 0e5177e2c076
parent 24981 4ec3f95190bf
child 25025 17c845095a47
permissions -rw-r--r--
added export_cterm;
tuned;
wenzelm@18830
     1
(*  Title:      Pure/Isar/local_defs.ML
wenzelm@18830
     2
    ID:         $Id$
wenzelm@18830
     3
    Author:     Makarius
wenzelm@18830
     4
wenzelm@18840
     5
Local definitions.
wenzelm@18830
     6
*)
wenzelm@18830
     7
wenzelm@18830
     8
signature LOCAL_DEFS =
wenzelm@18830
     9
sig
wenzelm@20306
    10
  val cert_def: Proof.context -> term -> (string * typ) * term
wenzelm@18830
    11
  val abs_def: term -> (string * typ) * term
wenzelm@20306
    12
  val mk_def: Proof.context -> (string * term) list -> term list
wenzelm@21684
    13
  val expand: cterm list -> thm -> thm
wenzelm@20224
    14
  val def_export: Assumption.export
wenzelm@20887
    15
  val add_defs: ((string * mixfix) * ((bstring * attribute list) * term)) list -> Proof.context ->
wenzelm@20887
    16
    (term * (bstring * thm)) list * Proof.context
wenzelm@21591
    17
  val export: Proof.context -> Proof.context -> thm -> thm list * thm
wenzelm@24985
    18
  val export_cterm: Proof.context -> Proof.context -> cterm -> cterm * thm
wenzelm@21844
    19
  val trans_terms: Proof.context -> thm list -> thm
wenzelm@21844
    20
  val trans_props: Proof.context -> thm list -> thm
wenzelm@21506
    21
  val print_rules: Proof.context -> unit
wenzelm@18840
    22
  val defn_add: attribute
wenzelm@18840
    23
  val defn_del: attribute
wenzelm@23541
    24
  val meta_rewrite_conv: Proof.context -> conv
wenzelm@21506
    25
  val meta_rewrite_rule: Proof.context -> thm -> thm
wenzelm@20306
    26
  val unfold: Proof.context -> thm list -> thm -> thm
wenzelm@20306
    27
  val unfold_goals: Proof.context -> thm list -> thm -> thm
wenzelm@20306
    28
  val unfold_tac: Proof.context -> thm list -> tactic
wenzelm@20306
    29
  val fold: Proof.context -> thm list -> thm -> thm
wenzelm@20306
    30
  val fold_tac: Proof.context -> thm list -> tactic
wenzelm@20306
    31
  val derived_def: Proof.context -> bool -> term ->
wenzelm@20909
    32
    ((string * typ) * term) * (Proof.context -> thm -> thm)
wenzelm@18830
    33
end;
wenzelm@18830
    34
wenzelm@18830
    35
structure LocalDefs: LOCAL_DEFS =
wenzelm@18830
    36
struct
wenzelm@18830
    37
wenzelm@18840
    38
(** primitive definitions **)
wenzelm@18840
    39
wenzelm@18830
    40
(* prepare defs *)
wenzelm@18830
    41
wenzelm@18830
    42
fun cert_def ctxt eq =
wenzelm@18830
    43
  let
wenzelm@24981
    44
    val display_term = quote o Syntax.string_of_term ctxt;
wenzelm@18950
    45
    fun err msg = cat_error msg ("The error(s) above occurred in definition: " ^ display_term eq);
wenzelm@18950
    46
    val ((lhs, _), eq') = eq
wenzelm@24981
    47
      |> Sign.no_vars (Syntax.pp ctxt)
wenzelm@24981
    48
      |> PrimitiveDefs.dest_def ctxt Term.is_Free (Variable.is_fixed ctxt) (K true)
wenzelm@18950
    49
      handle TERM (msg, _) => err msg | ERROR msg => err msg;
wenzelm@18950
    50
  in (Term.dest_Free (Term.head_of lhs), eq') end;
wenzelm@18830
    51
wenzelm@24261
    52
val abs_def = PrimitiveDefs.abs_def #>> Term.dest_Free;
wenzelm@18830
    53
wenzelm@18875
    54
fun mk_def ctxt args =
wenzelm@18875
    55
  let
wenzelm@18875
    56
    val (xs, rhss) = split_list args;
wenzelm@18875
    57
    val (bind, _) = ProofContext.bind_fixes xs ctxt;
wenzelm@18875
    58
    val lhss = map (fn (x, rhs) => bind (Free (x, Term.fastype_of rhs))) args;
wenzelm@18875
    59
  in map Logic.mk_equals (lhss ~~ rhss) end;
wenzelm@18875
    60
wenzelm@18830
    61
wenzelm@18830
    62
(* export defs *)
wenzelm@18830
    63
wenzelm@20021
    64
val head_of_def =
wenzelm@20887
    65
  #1 o Term.dest_Free o Term.head_of o #1 o Logic.dest_equals o Term.strip_all_body;
wenzelm@20021
    66
wenzelm@18830
    67
wenzelm@18875
    68
(*
wenzelm@20887
    69
  [x, x == a]
wenzelm@18896
    70
       :
wenzelm@18896
    71
      B x
wenzelm@18896
    72
  -----------
wenzelm@20887
    73
      B a
wenzelm@18875
    74
*)
wenzelm@21684
    75
fun expand defs =
wenzelm@21684
    76
  Drule.implies_intr_list defs
wenzelm@21684
    77
  #> Drule.generalize ([], map (head_of_def o Thm.term_of) defs)
wenzelm@21684
    78
  #> funpow (length defs) (fn th => Drule.reflexive_thm RS th);
wenzelm@21684
    79
wenzelm@21801
    80
val expand_term = Envir.expand_term_frees o map (abs_def o Thm.term_of);
wenzelm@21684
    81
wenzelm@21684
    82
fun def_export _ defs = (expand defs, expand_term defs);
wenzelm@18830
    83
wenzelm@18830
    84
wenzelm@18830
    85
(* add defs *)
wenzelm@18830
    86
wenzelm@20887
    87
fun add_defs defs ctxt =
wenzelm@18830
    88
  let
wenzelm@20887
    89
    val ((xs, mxs), specs) = defs |> split_list |>> split_list;
wenzelm@20887
    90
    val ((names, atts), rhss) = specs |> split_list |>> split_list;
wenzelm@20887
    91
    val names' = map2 Thm.def_name_optional xs names;
wenzelm@20887
    92
    val eqs = mk_def ctxt (xs ~~ rhss);
wenzelm@20887
    93
    val lhss = map (fst o Logic.dest_equals) eqs;
wenzelm@18830
    94
  in
wenzelm@18830
    95
    ctxt
wenzelm@20887
    96
    |> ProofContext.add_fixes_i (map2 (fn x => fn mx => (x, NONE, mx)) xs mxs) |> #2
wenzelm@20980
    97
    |> fold Variable.declare_term eqs
wenzelm@20887
    98
    |> ProofContext.add_assms_i def_export
wenzelm@20887
    99
      (map2 (fn a => fn eq => (a, [(eq, [])])) (names' ~~ atts) eqs)
wenzelm@20887
   100
    |>> map2 (fn lhs => fn (name, [th]) => (lhs, (name, th))) lhss
wenzelm@18830
   101
  end;
wenzelm@18830
   102
wenzelm@18840
   103
wenzelm@24985
   104
(* specific export -- result based on educated guessing *)
wenzelm@21568
   105
wenzelm@24985
   106
(*
wenzelm@24985
   107
  [xs, xs == as]
wenzelm@24985
   108
        :
wenzelm@24985
   109
       B xs
wenzelm@24985
   110
  --------------
wenzelm@24985
   111
       B as
wenzelm@24985
   112
*)
wenzelm@24985
   113
fun export inner outer =    (*beware of closure sizes*)
wenzelm@21568
   114
  let
wenzelm@22671
   115
    val exp = Assumption.export false inner outer;
wenzelm@22671
   116
    val prems = Assumption.prems_of inner;
wenzelm@22671
   117
  in fn th =>
wenzelm@22671
   118
    let
wenzelm@22671
   119
      val th' = exp th;
wenzelm@22691
   120
      val still_fixed = map #1 (Thm.fold_terms Term.add_frees th' []);
wenzelm@22671
   121
      val defs = prems |> filter_out (fn prem =>
wenzelm@22671
   122
        (case try (head_of_def o Thm.prop_of) prem of
wenzelm@22671
   123
          SOME x => member (op =) still_fixed x
wenzelm@22671
   124
        | NONE => true));
wenzelm@22671
   125
    in (map Drule.abs_def defs, th') end
wenzelm@22671
   126
  end;
wenzelm@21568
   127
wenzelm@24985
   128
(*
wenzelm@24985
   129
  [xs, xs == as]
wenzelm@24985
   130
        :
wenzelm@24985
   131
     TERM b xs
wenzelm@24985
   132
  --------------  and  --------------
wenzelm@24985
   133
     TERM b as          b xs == b as
wenzelm@24985
   134
*)
wenzelm@24985
   135
fun export_cterm inner outer ct =
wenzelm@24985
   136
  let val (defs, ct') = export inner outer (Drule.mk_term ct) ||> Drule.dest_term
wenzelm@24985
   137
  in (ct', MetaSimplifier.rewrite true defs ct) end;
wenzelm@24985
   138
wenzelm@21568
   139
wenzelm@21844
   140
(* basic transitivity reasoning -- modulo beta-eta *)
wenzelm@21844
   141
wenzelm@21844
   142
local
wenzelm@21844
   143
wenzelm@21844
   144
val is_trivial = Pattern.aeconv o Logic.dest_equals o Thm.prop_of;
wenzelm@21844
   145
wenzelm@21844
   146
fun trans_list _ _ [] = raise Empty
wenzelm@21844
   147
  | trans_list trans ctxt (th :: raw_eqs) =
wenzelm@21844
   148
      (case filter_out is_trivial raw_eqs of
wenzelm@21844
   149
        [] => th
wenzelm@21844
   150
      | eqs =>
wenzelm@22568
   151
          let val ((_, th' :: eqs'), ctxt') = Variable.import_thms true (th :: eqs) ctxt
wenzelm@21844
   152
          in singleton (Variable.export ctxt' ctxt) (fold trans eqs' th') end);
wenzelm@21844
   153
wenzelm@21844
   154
in
wenzelm@21844
   155
wenzelm@21844
   156
val trans_terms = trans_list (fn eq2 => fn eq1 => eq2 COMP (eq1 COMP Drule.transitive_thm));
wenzelm@21844
   157
val trans_props = trans_list (fn eq => fn th => th COMP (eq COMP Drule.equal_elim_rule1));
wenzelm@21844
   158
wenzelm@21844
   159
end;
wenzelm@21844
   160
wenzelm@21844
   161
wenzelm@18840
   162
wenzelm@18840
   163
(** defived definitions **)
wenzelm@18840
   164
wenzelm@18840
   165
(* transformation rules *)
wenzelm@18840
   166
wenzelm@18859
   167
structure Rules = GenericDataFun
wenzelm@18840
   168
(
wenzelm@18840
   169
  type T = thm list;
wenzelm@18840
   170
  val empty = []
wenzelm@18840
   171
  val extend = I;
wenzelm@24039
   172
  fun merge _ = Thm.merge_thms;
wenzelm@18840
   173
);
wenzelm@18840
   174
wenzelm@22846
   175
fun print_rules ctxt =
wenzelm@22846
   176
  Pretty.writeln (Pretty.big_list "definitional transformations:"
wenzelm@22846
   177
    (map (ProofContext.pretty_thm ctxt) (Rules.get (Context.Proof ctxt))));
wenzelm@18840
   178
wenzelm@24039
   179
val defn_add = Thm.declaration_attribute (Rules.map o Thm.add_thm);
wenzelm@24039
   180
val defn_del = Thm.declaration_attribute (Rules.map o Thm.del_thm);
wenzelm@18840
   181
wenzelm@18840
   182
wenzelm@18875
   183
(* meta rewrite rules *)
wenzelm@18840
   184
wenzelm@18840
   185
val equals_ss =
wenzelm@18840
   186
  MetaSimplifier.theory_context ProtoPure.thy MetaSimplifier.empty_ss
wenzelm@18840
   187
    addeqcongs [Drule.equals_cong];    (*protect meta-level equality*)
wenzelm@18840
   188
wenzelm@23541
   189
fun meta_rewrite_conv ctxt =
wenzelm@18840
   190
  MetaSimplifier.rewrite_cterm (false, false, false) (K (K NONE))
wenzelm@21506
   191
    (equals_ss addsimps (Rules.get (Context.Proof ctxt)));
wenzelm@18840
   192
wenzelm@23541
   193
val meta_rewrite_rule = Conv.fconv_rule o meta_rewrite_conv;
wenzelm@18840
   194
wenzelm@18875
   195
wenzelm@18875
   196
(* rewriting with object-level rules *)
wenzelm@18875
   197
wenzelm@21506
   198
fun meta f ctxt = f o map (meta_rewrite_rule ctxt);
wenzelm@18840
   199
wenzelm@21708
   200
val unfold       = meta MetaSimplifier.rewrite_rule;
wenzelm@21708
   201
val unfold_goals = meta MetaSimplifier.rewrite_goals_rule;
wenzelm@21708
   202
val unfold_tac   = meta MetaSimplifier.rewrite_goals_tac;
wenzelm@21708
   203
val fold         = meta MetaSimplifier.fold_rule;
wenzelm@21708
   204
val fold_tac     = meta MetaSimplifier.fold_goals_tac;
wenzelm@18840
   205
wenzelm@18840
   206
wenzelm@18840
   207
(* derived defs -- potentially within the object-logic *)
wenzelm@18840
   208
wenzelm@18950
   209
fun derived_def ctxt conditional prop =
wenzelm@18840
   210
  let
wenzelm@18840
   211
    val ((c, T), rhs) = prop
wenzelm@20049
   212
      |> Thm.cterm_of (ProofContext.theory_of ctxt)
wenzelm@23541
   213
      |> meta_rewrite_conv ctxt
wenzelm@18840
   214
      |> (snd o Logic.dest_equals o Thm.prop_of)
wenzelm@21568
   215
      |> conditional ? Logic.strip_imp_concl
wenzelm@18950
   216
      |> (abs_def o #2 o cert_def ctxt);
wenzelm@20909
   217
    fun prove ctxt' def =
wenzelm@18840
   218
      let
wenzelm@18840
   219
        val frees = Term.fold_aterms (fn Free (x, _) =>
wenzelm@20909
   220
          if Variable.is_fixed ctxt' x then I else insert (op =) x | _ => I) prop [];
wenzelm@18840
   221
      in
wenzelm@20909
   222
        Goal.prove ctxt' frees [] prop (K (ALLGOALS
wenzelm@23541
   223
          (CONVERSION (meta_rewrite_conv ctxt') THEN'
wenzelm@23541
   224
            MetaSimplifier.rewrite_goal_tac [def] THEN'
wenzelm@21708
   225
            resolve_tac [Drule.reflexive_thm])))
wenzelm@18840
   226
        handle ERROR msg => cat_error msg "Failed to prove definitional specification."
wenzelm@18840
   227
      end;
wenzelm@18840
   228
  in (((c, T), rhs), prove) end;
wenzelm@18840
   229
wenzelm@18830
   230
end;