src/HOL/Nominal/nominal_fresh_fun.ML
author wenzelm
Thu Mar 06 12:10:19 2014 +0100 (2014-03-06)
changeset 55951 c07d184aebe9
parent 51717 9e7d1c139569
child 55952 2f85cc6c27d4
permissions -rw-r--r--
tuned signature -- more uniform check_type_name/read_type_name;
proper reports for read_type_name (lost in 710bc66f432c);
narboux@22729
     1
(*  Title:      HOL/Nominal/nominal_fresh_fun.ML
wenzelm@29265
     2
    Authors:    Stefan Berghofer and Julien Narboux, TU Muenchen
narboux@22729
     3
urbanc@24558
     4
Provides a tactic to generate fresh names and
urbanc@24558
     5
a tactic to analyse instances of the fresh_fun.
narboux@22729
     6
*)
narboux@22729
     7
wenzelm@43278
     8
(* FIXME proper ML structure *)
narboux@22729
     9
wenzelm@43278
    10
(* FIXME res_inst_tac mostly obsolete, cf. Subgoal.FOCUS *)
wenzelm@43278
    11
wenzelm@43278
    12
(* FIXME proper SUBGOAL/CSUBGOAL instead of cprems_of etc. *)
narboux@22729
    13
fun gen_res_inst_tac_term instf tyinst tinst elim th i st =
narboux@22729
    14
  let
narboux@22729
    15
    val thy = theory_of_thm st;
narboux@22729
    16
    val cgoal = nth (cprems_of st) (i - 1);
narboux@22729
    17
    val {maxidx, ...} = rep_cterm cgoal;
narboux@22729
    18
    val j = maxidx + 1;
narboux@22729
    19
    val tyinst' = map (apfst (Logic.incr_tvar j)) tyinst;
narboux@22729
    20
    val ps = Logic.strip_params (term_of cgoal);
narboux@22729
    21
    val Ts = map snd ps;
narboux@22729
    22
    val tinst' = map (fn (t, u) =>
narboux@22729
    23
      (head_of (Logic.incr_indexes (Ts, j) t),
wenzelm@46219
    24
       fold_rev Term.abs ps u)) tinst;
narboux@22729
    25
    val th' = instf
narboux@22729
    26
      (map (pairself (ctyp_of thy)) tyinst')
narboux@22729
    27
      (map (pairself (cterm_of thy)) tinst')
narboux@22729
    28
      (Thm.lift_rule cgoal th)
narboux@22729
    29
  in
narboux@22729
    30
    compose_tac (elim, th', nprems_of th) i st
wenzelm@43278
    31
  end handle General.Subscript => Seq.empty;
wenzelm@43278
    32
(* FIXME proper SUBGOAL/CSUBGOAL instead of cprems_of etc. *)
narboux@22729
    33
wenzelm@33034
    34
val res_inst_tac_term =
narboux@22729
    35
  gen_res_inst_tac_term (curry Thm.instantiate);
narboux@22729
    36
wenzelm@33034
    37
val res_inst_tac_term' =
narboux@22729
    38
  gen_res_inst_tac_term (K Drule.cterm_instantiate) [];
narboux@22729
    39
narboux@22729
    40
fun cut_inst_tac_term' tinst th =
wenzelm@42806
    41
  res_inst_tac_term' tinst false (Rule_Insts.make_elim_preserve th);
narboux@22729
    42
wenzelm@26337
    43
fun get_dyn_thm thy name atom_name =
wenzelm@39557
    44
  Global_Theory.get_thm thy name handle ERROR _ =>
wenzelm@27187
    45
    error ("The atom type "^atom_name^" is not defined.");
narboux@22729
    46
urbanc@24558
    47
(* The theorems needed that are known at compile time. *)
urbanc@24558
    48
val at_exists_fresh' = @{thm "at_exists_fresh'"};
urbanc@24558
    49
val fresh_fun_app'   = @{thm "fresh_fun_app'"};
urbanc@24558
    50
val fresh_prod       = @{thm "fresh_prod"};
narboux@22729
    51
wenzelm@33034
    52
(* A tactic to generate a name fresh for  all the free *)
urbanc@24558
    53
(* variables and parameters of the goal                *)
narboux@22729
    54
narboux@22729
    55
fun generate_fresh_tac atom_name i thm =
wenzelm@33034
    56
 let
narboux@22729
    57
   val thy = theory_of_thm thm;
narboux@22729
    58
(* the parsing function returns a qualified name, we get back the base name *)
wenzelm@30364
    59
   val atom_basename = Long_Name.base_name atom_name;
wenzelm@42364
    60
   val goal = nth (prems_of thm) (i - 1);
narboux@22729
    61
   val ps = Logic.strip_params goal;
narboux@22729
    62
   val Ts = rev (map snd ps);
wenzelm@35667
    63
   fun is_of_fs_name T = Sign.of_sort thy (T, [Sign.intern_class thy ("fs_"^atom_basename)]);
narboux@22729
    64
(* rebuild de bruijn indices *)
narboux@22729
    65
   val bvs = map_index (Bound o fst) ps;
narboux@22729
    66
(* select variables of the right class *)
narboux@22729
    67
   val vs = filter (fn t => is_of_fs_name (fastype_of1 (Ts, t)))
wenzelm@44121
    68
     (Misc_Legacy.term_frees goal @ bvs);
narboux@22729
    69
(* build the tuple *)
narboux@23368
    70
   val s = (Library.foldr1 (fn (v, s) =>
wenzelm@41519
    71
       HOLogic.pair_const (fastype_of1 (Ts, v)) (fastype_of1 (Ts, s)) $ v $ s) vs)
wenzelm@41519
    72
     handle TERM _ => HOLogic.unit;
narboux@22729
    73
   val fs_name_thm = get_dyn_thm thy ("fs_"^atom_basename^"1") atom_basename;
narboux@22729
    74
   val at_name_inst_thm = get_dyn_thm thy ("at_"^atom_basename^"_inst") atom_basename;
narboux@22729
    75
   val exists_fresh' = at_name_inst_thm RS at_exists_fresh';
narboux@22729
    76
(* find the variable we want to instantiate *)
wenzelm@44121
    77
   val x = hd (Misc_Legacy.term_vars (prop_of exists_fresh'));
wenzelm@33034
    78
 in
narboux@22729
    79
   (cut_inst_tac_term' [(x,s)] exists_fresh' 1 THEN
narboux@22729
    80
   rtac fs_name_thm 1 THEN
narboux@22729
    81
   etac exE 1) thm
wenzelm@47060
    82
  handle List.Empty  => all_tac thm (* if we collected no variables then we do nothing *)
narboux@22729
    83
  end;
narboux@22729
    84
narboux@22729
    85
fun get_inner_fresh_fun (Bound j) = NONE
wenzelm@33034
    86
  | get_inner_fresh_fun (v as Free _) = NONE
narboux@22729
    87
  | get_inner_fresh_fun (v as Var _)  = NONE
narboux@22729
    88
  | get_inner_fresh_fun (Const _) = NONE
wenzelm@33034
    89
  | get_inner_fresh_fun (Abs (_, _, t)) = get_inner_fresh_fun t
wenzelm@33034
    90
  | get_inner_fresh_fun (Const ("Nominal.fresh_fun",Type("fun",[Type ("fun",[Type (T,_),_]),_])) $ u)
wenzelm@33034
    91
                           = SOME T
wenzelm@33034
    92
  | get_inner_fresh_fun (t $ u) =
narboux@22729
    93
     let val a = get_inner_fresh_fun u in
wenzelm@33034
    94
     if a = NONE then get_inner_fresh_fun t else a
narboux@22729
    95
     end;
narboux@22729
    96
wenzelm@33034
    97
(* This tactic generates a fresh name of the atom type *)
urbanc@24558
    98
(* given by the innermost fresh_fun                    *)
narboux@22729
    99
narboux@22729
   100
fun generate_fresh_fun_tac i thm =
narboux@22729
   101
  let
wenzelm@42364
   102
    val goal = nth (prems_of thm) (i - 1);
narboux@22729
   103
    val atom_name_opt = get_inner_fresh_fun goal;
narboux@22729
   104
  in
wenzelm@33034
   105
  case atom_name_opt of
narboux@22729
   106
    NONE => all_tac thm
wenzelm@33034
   107
  | SOME atom_name  => generate_fresh_tac atom_name i thm
narboux@22729
   108
  end
narboux@22729
   109
wenzelm@33034
   110
(* Two substitution tactics which looks for the innermost occurence in
narboux@23091
   111
   one assumption or in the conclusion *)
narboux@22729
   112
wenzelm@33034
   113
val search_fun = curry (Seq.flat o uncurry EqSubst.searchf_bt_unify_valid);
narboux@23065
   114
val search_fun_asm = EqSubst.skip_first_asm_occs_search EqSubst.searchf_bt_unify_valid;
narboux@23054
   115
wenzelm@33034
   116
fun subst_inner_tac ctxt = EqSubst.eqsubst_tac' ctxt search_fun;
wenzelm@33034
   117
fun subst_inner_asm_tac_aux i ctxt = EqSubst.eqsubst_asm_tac' ctxt search_fun_asm i;
narboux@23054
   118
wenzelm@33034
   119
(* A tactic to substitute in the first assumption
narboux@23091
   120
   which contains an occurence. *)
narboux@22729
   121
wenzelm@33034
   122
fun subst_inner_asm_tac ctxt th =
wenzelm@33034
   123
  curry (curry (FIRST' (map uncurry (map uncurry (map subst_inner_asm_tac_aux
wenzelm@33034
   124
            (1 upto Thm.nprems_of th)))))) ctxt th;
narboux@23091
   125
wenzelm@51669
   126
fun fresh_fun_tac ctxt no_asm i thm =
narboux@22729
   127
  (* Find the variable we instantiate *)
narboux@22729
   128
  let
narboux@22729
   129
    val thy = theory_of_thm thm;
wenzelm@39557
   130
    val abs_fresh = Global_Theory.get_thms thy "abs_fresh";
wenzelm@39557
   131
    val fresh_perm_app = Global_Theory.get_thms thy "fresh_perm_app";
wenzelm@51717
   132
    val simp_ctxt =
wenzelm@51717
   133
      ctxt addsimps (fresh_prod :: abs_fresh)
wenzelm@51717
   134
      addsimps fresh_perm_app;
wenzelm@44121
   135
    val x = hd (tl (Misc_Legacy.term_vars (prop_of exI)));
narboux@22787
   136
    val goal = nth (prems_of thm) (i-1);
narboux@22729
   137
    val atom_name_opt = get_inner_fresh_fun goal;
wenzelm@33034
   138
    val n = length (Logic.strip_params goal);
urbanc@24558
   139
    (* Here we rely on the fact that the variable introduced by generate_fresh_tac *)
urbanc@24558
   140
    (* is the last one in the list, the inner one *)
narboux@22729
   141
  in
wenzelm@33034
   142
  case atom_name_opt of
narboux@22729
   143
    NONE => all_tac thm
wenzelm@33034
   144
  | SOME atom_name =>
wenzelm@33034
   145
  let
wenzelm@30364
   146
    val atom_basename = Long_Name.base_name atom_name;
narboux@22729
   147
    val pt_name_inst = get_dyn_thm thy ("pt_"^atom_basename^"_inst") atom_basename;
narboux@22729
   148
    val at_name_inst = get_dyn_thm thy ("at_"^atom_basename^"_inst") atom_basename;
narboux@22787
   149
    fun inst_fresh vars params i st =
wenzelm@44121
   150
   let val vars' = Misc_Legacy.term_vars (prop_of st);
narboux@22787
   151
       val thy = theory_of_thm st;
haftmann@33040
   152
   in case subtract (op =) vars vars' of
wenzelm@46219
   153
     [x] =>
wenzelm@46219
   154
      Seq.single (Thm.instantiate ([],[(cterm_of thy x,cterm_of thy (fold_rev Term.abs params (Bound 0)))]) st)
narboux@22787
   155
    | _ => error "fresh_fun_simp: Too many variables, please report."
wenzelm@46219
   156
   end
narboux@22729
   157
  in
narboux@23091
   158
  ((fn st =>
wenzelm@33034
   159
  let
wenzelm@44121
   160
    val vars = Misc_Legacy.term_vars (prop_of st);
narboux@22787
   161
    val params = Logic.strip_params (nth (prems_of st) (i-1))
wenzelm@33034
   162
    (* The tactics which solve the subgoals generated
narboux@23091
   163
       by the conditionnal rewrite rule. *)
wenzelm@33034
   164
    val post_rewrite_tacs =
narboux@23054
   165
          [rtac pt_name_inst,
narboux@23054
   166
           rtac at_name_inst,
wenzelm@51717
   167
           TRY o SOLVED' (NominalPermeq.finite_guess_tac simp_ctxt),
narboux@23054
   168
           inst_fresh vars params THEN'
wenzelm@51717
   169
           (TRY o SOLVED' (NominalPermeq.fresh_guess_tac simp_ctxt)) THEN'
wenzelm@51717
   170
           (TRY o SOLVED' (asm_full_simp_tac simp_ctxt))]
wenzelm@33034
   171
  in
narboux@23094
   172
   ((if no_asm then no_tac else
wenzelm@33034
   173
    (subst_inner_asm_tac ctxt fresh_fun_app' i THEN (RANGE post_rewrite_tacs i)))
narboux@23091
   174
    ORELSE
wenzelm@33034
   175
    (subst_inner_tac ctxt fresh_fun_app' i THEN (RANGE post_rewrite_tacs i))) st
narboux@22787
   176
  end)) thm
wenzelm@33034
   177
narboux@22729
   178
  end
narboux@22729
   179
  end
narboux@22729
   180
narboux@23091
   181
(* syntax for options, given "(no_asm)" will give back true, without
narboux@23091
   182
   gives back false *)
narboux@23091
   183
val options_syntax =
narboux@23091
   184
    (Args.parens (Args.$$$ "no_asm") >> (K true)) ||
narboux@23091
   185
     (Scan.succeed false);
narboux@23091
   186
wenzelm@30549
   187
fun setup_generate_fresh x =
wenzelm@55951
   188
  (Args.goal_spec -- Args.type_name {proper = false, strict = true} >>
wenzelm@30549
   189
    (fn (quant, s) => K (SIMPLE_METHOD'' quant (generate_fresh_tac s)))) x;
narboux@22729
   190
wenzelm@30549
   191
fun setup_fresh_fun_simp x =
wenzelm@51669
   192
  (Scan.lift options_syntax >> (fn b => fn ctxt => SIMPLE_METHOD' (fresh_fun_tac ctxt b))) x;
wenzelm@30549
   193