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