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