src/HOL/Nominal/nominal_fresh_fun.ML
author wenzelm
Thu Mar 20 00:20:44 2008 +0100 (2008-03-20)
changeset 26343 0dd2eab7b296
parent 26337 44473c957672
child 27187 17b63e145986
permissions -rw-r--r--
simplified get_thm(s): back to plain name argument;
narboux@22729
     1
(*  Title:      HOL/Nominal/nominal_fresh_fun.ML
narboux@22729
     2
    ID:         $Id$
narboux@22729
     3
    Authors:    Stefan Berghofer, Julien Narboux, TU Muenchen
narboux@22729
     4
urbanc@24558
     5
Provides a tactic to generate fresh names and
urbanc@24558
     6
a tactic to analyse instances of the fresh_fun.
urbanc@24558
     7
narboux@22729
     8
*)
narboux@22729
     9
urbanc@24558
    10
(* First some functions that should be in the library *)
narboux@22729
    11
urbanc@24558
    12
(* A tactical which applies a list of int -> tactic to the          *) 
urbanc@24558
    13
(* corresponding subgoals present after the application of          *) 
urbanc@24558
    14
(* another tactic.                                                  *)
urbanc@24558
    15
(*                                                                  *)
urbanc@24558
    16
(*  T THENL [A,B,C] is equivalent to T THEN (C 3 THEN B 2 THEN A 1) *) 
narboux@22753
    17
narboux@22753
    18
infix 1 THENL
narboux@22792
    19
fun tac THENL tacs =
narboux@22753
    20
 tac THEN
narboux@22753
    21
  (EVERY (map  (fn (tac,i) => tac i) (rev tacs ~~ (length tacs downto 1))))
narboux@22753
    22
urbanc@24558
    23
(* A tactic which only succeeds when the argument *)
urbanc@24558
    24
(* tactic solves completely the specified subgoal *)
narboux@23054
    25
fun SOLVEI t = t THEN_ALL_NEW (fn i => no_tac);
narboux@23091
    26
narboux@23091
    27
(* A version of TRY for int -> tactic *)
narboux@23054
    28
fun TRY' tac i =  TRY (tac i);
narboux@23054
    29
narboux@22729
    30
fun gen_res_inst_tac_term instf tyinst tinst elim th i st =
narboux@22729
    31
  let
narboux@22729
    32
    val thy = theory_of_thm st;
narboux@22729
    33
    val cgoal = nth (cprems_of st) (i - 1);
narboux@22729
    34
    val {maxidx, ...} = rep_cterm cgoal;
narboux@22729
    35
    val j = maxidx + 1;
narboux@22729
    36
    val tyinst' = map (apfst (Logic.incr_tvar j)) tyinst;
narboux@22729
    37
    val ps = Logic.strip_params (term_of cgoal);
narboux@22729
    38
    val Ts = map snd ps;
narboux@22729
    39
    val tinst' = map (fn (t, u) =>
narboux@22729
    40
      (head_of (Logic.incr_indexes (Ts, j) t),
narboux@22729
    41
       list_abs (ps, u))) tinst;
narboux@22729
    42
    val th' = instf
narboux@22729
    43
      (map (pairself (ctyp_of thy)) tyinst')
narboux@22729
    44
      (map (pairself (cterm_of thy)) tinst')
narboux@22729
    45
      (Thm.lift_rule cgoal th)
narboux@22729
    46
  in
narboux@22729
    47
    compose_tac (elim, th', nprems_of th) i st
narboux@22729
    48
  end handle Subscript => Seq.empty;
narboux@22729
    49
narboux@22729
    50
val res_inst_tac_term = 
narboux@22729
    51
  gen_res_inst_tac_term (curry Thm.instantiate);
narboux@22729
    52
narboux@22729
    53
val res_inst_tac_term' = 
narboux@22729
    54
  gen_res_inst_tac_term (K Drule.cterm_instantiate) [];
narboux@22729
    55
narboux@22729
    56
fun cut_inst_tac_term' tinst th =
narboux@22729
    57
  res_inst_tac_term' tinst false (Tactic.make_elim_preserve th);
narboux@22729
    58
wenzelm@26337
    59
fun get_dyn_thm thy name atom_name =
wenzelm@26343
    60
  PureThy.get_thm thy name handle ERROR _ =>
wenzelm@26337
    61
    raise ERROR ("The atom type "^atom_name^" is not defined.");
narboux@22729
    62
urbanc@24558
    63
(* End of function waiting to be in the library :o) *)
narboux@22729
    64
urbanc@24558
    65
(* The theorems needed that are known at compile time. *)
urbanc@24558
    66
val at_exists_fresh' = @{thm "at_exists_fresh'"};
urbanc@24558
    67
val fresh_fun_app'   = @{thm "fresh_fun_app'"};
urbanc@24558
    68
val fresh_prod       = @{thm "fresh_prod"};
narboux@22729
    69
urbanc@24558
    70
(* A tactic to generate a name fresh for  all the free *) 
urbanc@24558
    71
(* variables and parameters of the goal                *)
narboux@22729
    72
narboux@22729
    73
fun generate_fresh_tac atom_name i thm =
narboux@22729
    74
 let 
narboux@22729
    75
   val thy = theory_of_thm thm;
narboux@22729
    76
(* the parsing function returns a qualified name, we get back the base name *)
narboux@22729
    77
   val atom_basename = Sign.base_name atom_name;
narboux@22729
    78
   val goal = List.nth(prems_of thm, i-1);
narboux@22729
    79
   val ps = Logic.strip_params goal;
narboux@22729
    80
   val Ts = rev (map snd ps);
wenzelm@24271
    81
   fun is_of_fs_name T = Sign.of_sort thy (T, Sign.intern_sort thy ["fs_"^atom_basename]); 
narboux@22729
    82
(* rebuild de bruijn indices *)
narboux@22729
    83
   val bvs = map_index (Bound o fst) ps;
narboux@22729
    84
(* select variables of the right class *)
narboux@22729
    85
   val vs = filter (fn t => is_of_fs_name (fastype_of1 (Ts, t)))
narboux@22729
    86
     (term_frees goal @ bvs);
narboux@22729
    87
(* build the tuple *)
narboux@23368
    88
   val s = (Library.foldr1 (fn (v, s) =>
narboux@23368
    89
     HOLogic.pair_const (fastype_of1 (Ts, v)) (fastype_of1 (Ts, s)) $ v $ s) vs) handle _ => HOLogic.unit ;
narboux@22729
    90
   val fs_name_thm = get_dyn_thm thy ("fs_"^atom_basename^"1") atom_basename;
narboux@22729
    91
   val at_name_inst_thm = get_dyn_thm thy ("at_"^atom_basename^"_inst") atom_basename;
narboux@22729
    92
   val exists_fresh' = at_name_inst_thm RS at_exists_fresh';
narboux@22729
    93
(* find the variable we want to instantiate *)
narboux@22729
    94
   val x = hd (term_vars (prop_of exists_fresh'));
narboux@22729
    95
 in 
narboux@22729
    96
   (cut_inst_tac_term' [(x,s)] exists_fresh' 1 THEN
narboux@22729
    97
   rtac fs_name_thm 1 THEN
narboux@22729
    98
   etac exE 1) thm
narboux@22729
    99
  handle Empty  => all_tac thm (* if we collected no variables then we do nothing *)
narboux@22729
   100
  end;
narboux@22729
   101
narboux@22729
   102
fun get_inner_fresh_fun (Bound j) = NONE
narboux@22729
   103
  | get_inner_fresh_fun (v as Free _) = NONE 
narboux@22729
   104
  | get_inner_fresh_fun (v as Var _)  = NONE
narboux@22729
   105
  | get_inner_fresh_fun (Const _) = NONE
narboux@22729
   106
  | get_inner_fresh_fun (Abs (_, _, t)) = get_inner_fresh_fun t 
urbanc@24558
   107
  | get_inner_fresh_fun (Const ("Nominal.fresh_fun",Type("fun",[Type ("fun",[Type (T,_),_]),_])) $ u) 
urbanc@24558
   108
                           = SOME T 
narboux@22729
   109
  | get_inner_fresh_fun (t $ u) = 
narboux@22729
   110
     let val a = get_inner_fresh_fun u in
narboux@22729
   111
     if a = NONE then get_inner_fresh_fun t else a 
narboux@22729
   112
     end;
narboux@22729
   113
urbanc@24558
   114
(* This tactic generates a fresh name of the atom type *) 
urbanc@24558
   115
(* given by the innermost fresh_fun                    *)
narboux@22729
   116
narboux@22729
   117
fun generate_fresh_fun_tac i thm =
narboux@22729
   118
  let
narboux@22729
   119
    val goal = List.nth(prems_of thm, i-1);
narboux@22729
   120
    val atom_name_opt = get_inner_fresh_fun goal;
narboux@22729
   121
  in
narboux@22729
   122
  case atom_name_opt of 
narboux@22729
   123
    NONE => all_tac thm
narboux@22729
   124
  | SOME atom_name  => generate_fresh_tac atom_name i thm               
narboux@22729
   125
  end
narboux@22729
   126
urbanc@24558
   127
(* Two substitution tactics which looks for the innermost occurence in 
narboux@23091
   128
   one assumption or in the conclusion *)
narboux@22729
   129
narboux@23065
   130
val search_fun     = curry (Seq.flat o (uncurry EqSubst.searchf_bt_unify_valid));
narboux@23065
   131
val search_fun_asm = EqSubst.skip_first_asm_occs_search EqSubst.searchf_bt_unify_valid;
narboux@23054
   132
narboux@23091
   133
fun subst_inner_tac           ctx = EqSubst.eqsubst_tac' ctx search_fun;
narboux@23091
   134
fun subst_inner_asm_tac_aux i ctx = EqSubst.eqsubst_asm_tac' ctx search_fun_asm i;
narboux@23054
   135
narboux@23091
   136
(* A tactic to substitute in the first assumption 
narboux@23091
   137
   which contains an occurence. *)
narboux@22729
   138
urbanc@24558
   139
fun subst_inner_asm_tac ctx th =  
urbanc@24558
   140
   curry (curry (FIRST' (map uncurry (map uncurry (map subst_inner_asm_tac_aux 
urbanc@24558
   141
                                                             (1 upto Thm.nprems_of th)))))) ctx th;
narboux@23091
   142
narboux@23091
   143
fun fresh_fun_tac no_asm i thm = 
narboux@22729
   144
  (* Find the variable we instantiate *)
narboux@22729
   145
  let
narboux@22729
   146
    val thy = theory_of_thm thm;
narboux@22729
   147
    val ctx = Context.init_proof thy;
narboux@22729
   148
    val ss = simpset_of thy;
wenzelm@26343
   149
    val abs_fresh = PureThy.get_thms thy "abs_fresh";
wenzelm@26343
   150
    val fresh_perm_app = PureThy.get_thms thy "fresh_perm_app";
narboux@22729
   151
    val ss' = ss addsimps fresh_prod::abs_fresh;
narboux@23054
   152
    val ss'' = ss' addsimps fresh_perm_app;
narboux@22729
   153
    val x = hd (tl (term_vars (prop_of exI)));
narboux@22787
   154
    val goal = nth (prems_of thm) (i-1);
narboux@22729
   155
    val atom_name_opt = get_inner_fresh_fun goal;
narboux@22729
   156
    val n = List.length (Logic.strip_params goal);
urbanc@24558
   157
    (* Here we rely on the fact that the variable introduced by generate_fresh_tac *)
urbanc@24558
   158
    (* is the last one in the list, the inner one *)
narboux@22729
   159
  in
narboux@22729
   160
  case atom_name_opt of 
narboux@22729
   161
    NONE => all_tac thm
narboux@22729
   162
  | SOME atom_name  =>    
narboux@22729
   163
  let 
narboux@22729
   164
    val atom_basename = Sign.base_name atom_name;
narboux@22729
   165
    val pt_name_inst = get_dyn_thm thy ("pt_"^atom_basename^"_inst") atom_basename;
narboux@22729
   166
    val at_name_inst = get_dyn_thm thy ("at_"^atom_basename^"_inst") atom_basename;
narboux@22787
   167
    fun inst_fresh vars params i st =
narboux@22787
   168
   let val vars' = term_vars (prop_of st);
narboux@22787
   169
       val thy = theory_of_thm st;
narboux@22787
   170
   in case vars' \\ vars of 
narboux@22787
   171
     [x] => Seq.single (Thm.instantiate ([],[(cterm_of thy x,cterm_of thy (list_abs (params,Bound 0)))]) st)
narboux@22787
   172
    | _ => error "fresh_fun_simp: Too many variables, please report."
narboux@22787
   173
  end
narboux@22729
   174
  in
narboux@23091
   175
  ((fn st =>
narboux@22787
   176
  let 
narboux@22787
   177
    val vars = term_vars (prop_of st);
narboux@22787
   178
    val params = Logic.strip_params (nth (prems_of st) (i-1))
narboux@23091
   179
    (* The tactics which solve the subgoals generated 
narboux@23091
   180
       by the conditionnal rewrite rule. *)
narboux@23054
   181
    val post_rewrite_tacs =  
narboux@23054
   182
          [rtac pt_name_inst,
narboux@23054
   183
           rtac at_name_inst,
narboux@23054
   184
           TRY' (SOLVEI (NominalPermeq.finite_guess_tac ss'')),
narboux@23054
   185
           inst_fresh vars params THEN'
narboux@23054
   186
           (TRY' (SOLVEI (NominalPermeq.fresh_guess_tac ss''))) THEN'
narboux@23054
   187
           (TRY' (SOLVEI (asm_full_simp_tac ss'')))] 
narboux@23054
   188
  in 
narboux@23094
   189
   ((if no_asm then no_tac else
narboux@23094
   190
    (subst_inner_asm_tac ctx fresh_fun_app' i THENL post_rewrite_tacs)) 
narboux@23091
   191
    ORELSE
narboux@23091
   192
    (subst_inner_tac     ctx fresh_fun_app' i THENL post_rewrite_tacs)) st
narboux@22787
   193
  end)) thm
narboux@22787
   194
  
narboux@22729
   195
  end
narboux@22729
   196
  end
narboux@22729
   197
narboux@23091
   198
(* syntax for options, given "(no_asm)" will give back true, without
narboux@23091
   199
   gives back false *)
narboux@23091
   200
val options_syntax =
narboux@23091
   201
    (Args.parens (Args.$$$ "no_asm") >> (K true)) ||
narboux@23091
   202
     (Scan.succeed false);
narboux@23091
   203
narboux@22729
   204
val setup_generate_fresh =
narboux@22729
   205
  Method.goal_args_ctxt' Args.tyname (fn ctxt => generate_fresh_tac) 
narboux@22729
   206
narboux@22729
   207
val setup_fresh_fun_simp =
narboux@23091
   208
  Method.simple_args options_syntax 
narboux@23091
   209
  (fn b => fn _ => Method.SIMPLE_METHOD (fresh_fun_tac b 1))