src/HOLCF/Tools/Domain/domain_take_proofs.ML
author huffman
Mon Mar 08 07:37:11 2010 -0800 (2010-03-08)
changeset 35651 5dd352a85464
parent 35650 64fff18d7f08
child 35654 7a15e181bf3b
permissions -rw-r--r--
add type take_info
huffman@35514
     1
(*  Title:      HOLCF/Tools/domain/domain_take_proofs.ML
huffman@35514
     2
    Author:     Brian Huffman
huffman@35514
     3
huffman@35514
     4
Defines take functions for the given domain equation
huffman@35514
     5
and proves related theorems.
huffman@35514
     6
*)
huffman@35514
     7
huffman@35514
     8
signature DOMAIN_TAKE_PROOFS =
huffman@35514
     9
sig
huffman@35514
    10
  type iso_info =
huffman@35514
    11
    {
huffman@35514
    12
      absT : typ,
huffman@35514
    13
      repT : typ,
huffman@35514
    14
      abs_const : term,
huffman@35514
    15
      rep_const : term,
huffman@35514
    16
      abs_inverse : thm,
huffman@35514
    17
      rep_inverse : thm
huffman@35514
    18
    }
huffman@35651
    19
  type take_info =
huffman@35514
    20
    { take_consts : term list,
huffman@35514
    21
      take_defs : thm list,
huffman@35514
    22
      chain_take_thms : thm list,
huffman@35514
    23
      take_0_thms : thm list,
huffman@35514
    24
      take_Suc_thms : thm list,
huffman@35515
    25
      deflation_take_thms : thm list,
huffman@35515
    26
      finite_consts : term list,
huffman@35515
    27
      finite_defs : thm list
huffman@35651
    28
    }
huffman@35651
    29
  val define_take_functions :
huffman@35651
    30
    (binding * iso_info) list -> theory -> take_info * theory
huffman@35514
    31
huffman@35514
    32
  val map_of_typ :
huffman@35514
    33
    theory -> (typ * term) list -> typ -> term
huffman@35514
    34
huffman@35514
    35
  val add_map_function :
huffman@35514
    36
    (string * string * thm) -> theory -> theory
huffman@35514
    37
huffman@35514
    38
  val get_map_tab : theory -> string Symtab.table
huffman@35514
    39
  val get_deflation_thms : theory -> thm list
huffman@35514
    40
end;
huffman@35514
    41
huffman@35514
    42
structure Domain_Take_Proofs : DOMAIN_TAKE_PROOFS =
huffman@35514
    43
struct
huffman@35514
    44
huffman@35514
    45
type iso_info =
huffman@35514
    46
  {
huffman@35514
    47
    absT : typ,
huffman@35514
    48
    repT : typ,
huffman@35514
    49
    abs_const : term,
huffman@35514
    50
    rep_const : term,
huffman@35514
    51
    abs_inverse : thm,
huffman@35514
    52
    rep_inverse : thm
huffman@35514
    53
  };
huffman@35514
    54
huffman@35651
    55
type take_info =
huffman@35651
    56
  { take_consts : term list,
huffman@35651
    57
    take_defs : thm list,
huffman@35651
    58
    chain_take_thms : thm list,
huffman@35651
    59
    take_0_thms : thm list,
huffman@35651
    60
    take_Suc_thms : thm list,
huffman@35651
    61
    deflation_take_thms : thm list,
huffman@35651
    62
    finite_consts : term list,
huffman@35651
    63
    finite_defs : thm list
huffman@35651
    64
  };
huffman@35651
    65
huffman@35514
    66
val beta_ss =
huffman@35514
    67
  HOL_basic_ss
huffman@35514
    68
    addsimps simp_thms
huffman@35514
    69
    addsimps [@{thm beta_cfun}]
huffman@35514
    70
    addsimprocs [@{simproc cont_proc}];
huffman@35514
    71
huffman@35514
    72
val beta_tac = simp_tac beta_ss;
huffman@35514
    73
huffman@35514
    74
(******************************************************************************)
huffman@35514
    75
(******************************** theory data *********************************)
huffman@35514
    76
(******************************************************************************)
huffman@35514
    77
huffman@35514
    78
structure MapData = Theory_Data
huffman@35514
    79
(
huffman@35514
    80
  (* constant names like "foo_map" *)
huffman@35514
    81
  type T = string Symtab.table;
huffman@35514
    82
  val empty = Symtab.empty;
huffman@35514
    83
  val extend = I;
huffman@35514
    84
  fun merge data = Symtab.merge (K true) data;
huffman@35514
    85
);
huffman@35514
    86
huffman@35514
    87
structure DeflMapData = Theory_Data
huffman@35514
    88
(
huffman@35514
    89
  (* theorems like "deflation a ==> deflation (foo_map$a)" *)
huffman@35514
    90
  type T = thm list;
huffman@35514
    91
  val empty = [];
huffman@35514
    92
  val extend = I;
huffman@35514
    93
  val merge = Thm.merge_thms;
huffman@35514
    94
);
huffman@35514
    95
huffman@35514
    96
fun add_map_function (tname, map_name, deflation_map_thm) =
huffman@35514
    97
    MapData.map (Symtab.insert (K true) (tname, map_name))
huffman@35514
    98
    #> DeflMapData.map (Thm.add_thm deflation_map_thm);
huffman@35514
    99
huffman@35514
   100
val get_map_tab = MapData.get;
huffman@35514
   101
val get_deflation_thms = DeflMapData.get;
huffman@35514
   102
huffman@35514
   103
(******************************************************************************)
huffman@35514
   104
(************************** building types and terms **************************)
huffman@35514
   105
(******************************************************************************)
huffman@35514
   106
huffman@35514
   107
open HOLCF_Library;
huffman@35514
   108
huffman@35514
   109
infixr 6 ->>;
huffman@35514
   110
infix -->>;
huffman@35515
   111
infix 9 `;
huffman@35514
   112
huffman@35514
   113
fun mapT (T as Type (_, Ts)) =
huffman@35514
   114
    (map (fn T => T ->> T) Ts) -->> (T ->> T)
huffman@35514
   115
  | mapT T = T ->> T;
huffman@35514
   116
huffman@35514
   117
fun mk_deflation t =
huffman@35514
   118
  Const (@{const_name deflation}, Term.fastype_of t --> boolT) $ t;
huffman@35514
   119
huffman@35514
   120
fun mk_eqs (t, u) = HOLogic.mk_Trueprop (HOLogic.mk_eq (t, u));
huffman@35514
   121
huffman@35514
   122
(******************************************************************************)
huffman@35514
   123
(****************************** isomorphism info ******************************)
huffman@35514
   124
(******************************************************************************)
huffman@35514
   125
huffman@35514
   126
fun deflation_abs_rep (info : iso_info) : thm =
huffman@35514
   127
  let
huffman@35514
   128
    val abs_iso = #abs_inverse info;
huffman@35514
   129
    val rep_iso = #rep_inverse info;
huffman@35514
   130
    val thm = @{thm deflation_abs_rep} OF [abs_iso, rep_iso];
huffman@35514
   131
  in
huffman@35514
   132
    Drule.export_without_context thm
huffman@35514
   133
  end
huffman@35514
   134
huffman@35514
   135
(******************************************************************************)
huffman@35514
   136
(********************* building map functions over types **********************)
huffman@35514
   137
(******************************************************************************)
huffman@35514
   138
huffman@35514
   139
fun map_of_typ (thy : theory) (sub : (typ * term) list) (T : typ) : term =
huffman@35514
   140
  let
huffman@35514
   141
    val map_tab = get_map_tab thy;
huffman@35514
   142
    fun auto T = T ->> T;
huffman@35514
   143
    fun map_of T =
huffman@35514
   144
        case AList.lookup (op =) sub T of
huffman@35514
   145
          SOME m => (m, true) | NONE => map_of' T
huffman@35514
   146
    and map_of' (T as (Type (c, Ts))) =
huffman@35514
   147
        (case Symtab.lookup map_tab c of
huffman@35514
   148
          SOME map_name =>
huffman@35514
   149
          let
huffman@35514
   150
            val map_type = map auto Ts -->> auto T;
huffman@35514
   151
            val (ms, bs) = map_split map_of Ts;
huffman@35514
   152
          in
huffman@35514
   153
            if exists I bs
huffman@35514
   154
            then (list_ccomb (Const (map_name, map_type), ms), true)
huffman@35514
   155
            else (mk_ID T, false)
huffman@35514
   156
          end
huffman@35514
   157
        | NONE => (mk_ID T, false))
huffman@35514
   158
      | map_of' T = (mk_ID T, false);
huffman@35514
   159
  in
huffman@35514
   160
    fst (map_of T)
huffman@35514
   161
  end;
huffman@35514
   162
huffman@35514
   163
huffman@35514
   164
(******************************************************************************)
huffman@35514
   165
(********************* declaring definitions and theorems *********************)
huffman@35514
   166
(******************************************************************************)
huffman@35514
   167
huffman@35514
   168
fun define_const
huffman@35514
   169
    (bind : binding, rhs : term)
huffman@35514
   170
    (thy : theory)
huffman@35514
   171
    : (term * thm) * theory =
huffman@35514
   172
  let
huffman@35514
   173
    val typ = Term.fastype_of rhs;
huffman@35514
   174
    val (const, thy) = Sign.declare_const ((bind, typ), NoSyn) thy;
huffman@35514
   175
    val eqn = Logic.mk_equals (const, rhs);
huffman@35514
   176
    val def = Thm.no_attributes (Binding.suffix_name "_def" bind, eqn);
huffman@35514
   177
    val (def_thm, thy) = yield_singleton (PureThy.add_defs false) def thy;
huffman@35514
   178
  in
huffman@35514
   179
    ((const, def_thm), thy)
huffman@35514
   180
  end;
huffman@35514
   181
huffman@35650
   182
fun add_qualified_def name (path, eqn) thy =
huffman@35650
   183
    thy
huffman@35650
   184
    |> Sign.add_path path
huffman@35650
   185
    |> yield_singleton (PureThy.add_defs false)
huffman@35650
   186
        (Thm.no_attributes (Binding.name name, eqn))
huffman@35650
   187
    ||> Sign.parent_path;
huffman@35650
   188
huffman@35514
   189
fun add_qualified_thm name (path, thm) thy =
huffman@35514
   190
    thy
huffman@35514
   191
    |> Sign.add_path path
huffman@35514
   192
    |> yield_singleton PureThy.add_thms
huffman@35514
   193
        (Thm.no_attributes (Binding.name name, thm))
huffman@35514
   194
    ||> Sign.parent_path;
huffman@35514
   195
huffman@35573
   196
fun add_qualified_simp_thm name (path, thm) thy =
huffman@35573
   197
    thy
huffman@35573
   198
    |> Sign.add_path path
huffman@35573
   199
    |> yield_singleton PureThy.add_thms
huffman@35573
   200
        ((Binding.name name, thm), [Simplifier.simp_add])
huffman@35573
   201
    ||> Sign.parent_path;
huffman@35573
   202
huffman@35514
   203
(******************************************************************************)
huffman@35514
   204
(************************** defining take functions ***************************)
huffman@35514
   205
(******************************************************************************)
huffman@35514
   206
huffman@35514
   207
fun define_take_functions
huffman@35514
   208
    (spec : (binding * iso_info) list)
huffman@35514
   209
    (thy : theory) =
huffman@35514
   210
  let
huffman@35514
   211
huffman@35514
   212
    (* retrieve components of spec *)
huffman@35514
   213
    val dom_binds = map fst spec;
huffman@35514
   214
    val iso_infos = map snd spec;
huffman@35514
   215
    val dom_eqns = map (fn x => (#absT x, #repT x)) iso_infos;
huffman@35514
   216
    val rep_abs_consts = map (fn x => (#rep_const x, #abs_const x)) iso_infos;
huffman@35514
   217
    val dnames = map Binding.name_of dom_binds;
huffman@35514
   218
huffman@35514
   219
    (* get table of map functions *)
huffman@35514
   220
    val map_tab = MapData.get thy;
huffman@35514
   221
huffman@35514
   222
    fun mk_projs []      t = []
huffman@35514
   223
      | mk_projs (x::[]) t = [(x, t)]
huffman@35514
   224
      | mk_projs (x::xs) t = (x, mk_fst t) :: mk_projs xs (mk_snd t);
huffman@35514
   225
huffman@35514
   226
    fun mk_cfcomp2 ((rep_const, abs_const), f) =
huffman@35514
   227
        mk_cfcomp (abs_const, mk_cfcomp (f, rep_const));
huffman@35514
   228
huffman@35514
   229
    (* define take functional *)
huffman@35514
   230
    val newTs : typ list = map fst dom_eqns;
huffman@35514
   231
    val copy_arg_type = mk_tupleT (map (fn T => T ->> T) newTs);
huffman@35514
   232
    val copy_arg = Free ("f", copy_arg_type);
huffman@35514
   233
    val copy_args = map snd (mk_projs dom_binds copy_arg);
huffman@35514
   234
    fun one_copy_rhs (rep_abs, (lhsT, rhsT)) =
huffman@35514
   235
      let
huffman@35514
   236
        val body = map_of_typ thy (newTs ~~ copy_args) rhsT;
huffman@35514
   237
      in
huffman@35514
   238
        mk_cfcomp2 (rep_abs, body)
huffman@35514
   239
      end;
huffman@35514
   240
    val take_functional =
huffman@35514
   241
        big_lambda copy_arg
huffman@35514
   242
          (mk_tuple (map one_copy_rhs (rep_abs_consts ~~ dom_eqns)));
huffman@35514
   243
    val take_rhss =
huffman@35514
   244
      let
huffman@35557
   245
        val n = Free ("n", HOLogic.natT);
huffman@35557
   246
        val rhs = mk_iterate (n, take_functional);
huffman@35514
   247
      in
huffman@35557
   248
        map (lambda n o snd) (mk_projs dom_binds rhs)
huffman@35514
   249
      end;
huffman@35514
   250
huffman@35514
   251
    (* define take constants *)
huffman@35514
   252
    fun define_take_const ((tbind, take_rhs), (lhsT, rhsT)) thy =
huffman@35514
   253
      let
huffman@35514
   254
        val take_type = HOLogic.natT --> lhsT ->> lhsT;
huffman@35514
   255
        val take_bind = Binding.suffix_name "_take" tbind;
huffman@35514
   256
        val (take_const, thy) =
huffman@35514
   257
          Sign.declare_const ((take_bind, take_type), NoSyn) thy;
huffman@35514
   258
        val take_eqn = Logic.mk_equals (take_const, take_rhs);
huffman@35514
   259
        val (take_def_thm, thy) =
huffman@35650
   260
            add_qualified_def "take_def"
huffman@35650
   261
             (Binding.name_of tbind, take_eqn) thy;
huffman@35514
   262
      in ((take_const, take_def_thm), thy) end;
huffman@35514
   263
    val ((take_consts, take_defs), thy) = thy
huffman@35514
   264
      |> fold_map define_take_const (dom_binds ~~ take_rhss ~~ dom_eqns)
huffman@35514
   265
      |>> ListPair.unzip;
huffman@35514
   266
huffman@35514
   267
    (* prove chain_take lemmas *)
huffman@35514
   268
    fun prove_chain_take (take_const, dname) thy =
huffman@35514
   269
      let
huffman@35514
   270
        val goal = mk_trp (mk_chain take_const);
huffman@35514
   271
        val rules = take_defs @ @{thms chain_iterate ch2ch_fst ch2ch_snd};
huffman@35514
   272
        val tac = simp_tac (HOL_basic_ss addsimps rules) 1;
huffman@35572
   273
        val thm = Goal.prove_global thy [] [] goal (K tac);
huffman@35514
   274
      in
huffman@35573
   275
        add_qualified_simp_thm "chain_take" (dname, thm) thy
huffman@35514
   276
      end;
huffman@35514
   277
    val (chain_take_thms, thy) =
huffman@35514
   278
      fold_map prove_chain_take (take_consts ~~ dnames) thy;
huffman@35514
   279
huffman@35514
   280
    (* prove take_0 lemmas *)
huffman@35514
   281
    fun prove_take_0 ((take_const, dname), (lhsT, rhsT)) thy =
huffman@35514
   282
      let
huffman@35514
   283
        val lhs = take_const $ @{term "0::nat"};
huffman@35514
   284
        val goal = mk_eqs (lhs, mk_bottom (lhsT ->> lhsT));
huffman@35514
   285
        val rules = take_defs @ @{thms iterate_0 fst_strict snd_strict};
huffman@35514
   286
        val tac = simp_tac (HOL_basic_ss addsimps rules) 1;
huffman@35514
   287
        val take_0_thm = Goal.prove_global thy [] [] goal (K tac);
huffman@35514
   288
      in
huffman@35514
   289
        add_qualified_thm "take_0" (dname, take_0_thm) thy
huffman@35514
   290
      end;
huffman@35514
   291
    val (take_0_thms, thy) =
huffman@35514
   292
      fold_map prove_take_0 (take_consts ~~ dnames ~~ dom_eqns) thy;
huffman@35514
   293
huffman@35514
   294
    (* prove take_Suc lemmas *)
huffman@35557
   295
    val n = Free ("n", natT);
huffman@35557
   296
    val take_is = map (fn t => t $ n) take_consts;
huffman@35514
   297
    fun prove_take_Suc
huffman@35514
   298
          (((take_const, rep_abs), dname), (lhsT, rhsT)) thy =
huffman@35514
   299
      let
huffman@35557
   300
        val lhs = take_const $ (@{term Suc} $ n);
huffman@35514
   301
        val body = map_of_typ thy (newTs ~~ take_is) rhsT;
huffman@35514
   302
        val rhs = mk_cfcomp2 (rep_abs, body);
huffman@35514
   303
        val goal = mk_eqs (lhs, rhs);
huffman@35514
   304
        val simps = @{thms iterate_Suc fst_conv snd_conv}
huffman@35514
   305
        val rules = take_defs @ simps;
huffman@35514
   306
        val tac = simp_tac (beta_ss addsimps rules) 1;
huffman@35514
   307
        val take_Suc_thm = Goal.prove_global thy [] [] goal (K tac);
huffman@35514
   308
      in
huffman@35514
   309
        add_qualified_thm "take_Suc" (dname, take_Suc_thm) thy
huffman@35514
   310
      end;
huffman@35514
   311
    val (take_Suc_thms, thy) =
huffman@35514
   312
      fold_map prove_take_Suc
huffman@35514
   313
        (take_consts ~~ rep_abs_consts ~~ dnames ~~ dom_eqns) thy;
huffman@35514
   314
huffman@35514
   315
    (* prove deflation theorems for take functions *)
huffman@35514
   316
    val deflation_abs_rep_thms = map deflation_abs_rep iso_infos;
huffman@35514
   317
    val deflation_take_thm =
huffman@35514
   318
      let
huffman@35557
   319
        val n = Free ("n", natT);
huffman@35557
   320
        fun mk_goal take_const = mk_deflation (take_const $ n);
huffman@35514
   321
        val goal = mk_trp (foldr1 mk_conj (map mk_goal take_consts));
huffman@35514
   322
        val adm_rules =
huffman@35514
   323
          @{thms adm_conj adm_subst [OF _ adm_deflation]
huffman@35514
   324
                 cont2cont_fst cont2cont_snd cont_id};
huffman@35514
   325
        val bottom_rules =
huffman@35514
   326
          take_0_thms @ @{thms deflation_UU simp_thms};
huffman@35514
   327
        val deflation_rules =
huffman@35514
   328
          @{thms conjI deflation_ID}
huffman@35514
   329
          @ deflation_abs_rep_thms
huffman@35514
   330
          @ DeflMapData.get thy;
huffman@35514
   331
      in
huffman@35514
   332
        Goal.prove_global thy [] [] goal (fn _ =>
huffman@35514
   333
         EVERY
huffman@35514
   334
          [rtac @{thm nat.induct} 1,
huffman@35514
   335
           simp_tac (HOL_basic_ss addsimps bottom_rules) 1,
huffman@35514
   336
           asm_simp_tac (HOL_basic_ss addsimps take_Suc_thms) 1,
huffman@35514
   337
           REPEAT (etac @{thm conjE} 1
huffman@35514
   338
                   ORELSE resolve_tac deflation_rules 1
huffman@35514
   339
                   ORELSE atac 1)])
huffman@35514
   340
      end;
huffman@35514
   341
    fun conjuncts [] thm = []
huffman@35514
   342
      | conjuncts (n::[]) thm = [(n, thm)]
huffman@35514
   343
      | conjuncts (n::ns) thm = let
huffman@35514
   344
          val thmL = thm RS @{thm conjunct1};
huffman@35514
   345
          val thmR = thm RS @{thm conjunct2};
huffman@35514
   346
        in (n, thmL):: conjuncts ns thmR end;
huffman@35514
   347
    val (deflation_take_thms, thy) =
huffman@35514
   348
      fold_map (add_qualified_thm "deflation_take")
huffman@35514
   349
        (map (apsnd Drule.export_without_context)
huffman@35514
   350
          (conjuncts dnames deflation_take_thm)) thy;
huffman@35514
   351
huffman@35514
   352
    (* prove strictness of take functions *)
huffman@35572
   353
    fun prove_take_strict (deflation_take, dname) thy =
huffman@35514
   354
      let
huffman@35572
   355
        val take_strict_thm =
huffman@35572
   356
            Drule.export_without_context
huffman@35572
   357
            (@{thm deflation_strict} OF [deflation_take]);
huffman@35514
   358
      in
huffman@35514
   359
        add_qualified_thm "take_strict" (dname, take_strict_thm) thy
huffman@35514
   360
      end;
huffman@35514
   361
    val (take_strict_thms, thy) =
huffman@35572
   362
      fold_map prove_take_strict
huffman@35572
   363
        (deflation_take_thms ~~ dnames) thy;
huffman@35514
   364
huffman@35514
   365
    (* prove take/take rules *)
huffman@35514
   366
    fun prove_take_take ((chain_take, deflation_take), dname) thy =
huffman@35514
   367
      let
huffman@35514
   368
        val take_take_thm =
huffman@35557
   369
            Drule.export_without_context
huffman@35557
   370
            (@{thm deflation_chain_min} OF [chain_take, deflation_take]);
huffman@35514
   371
      in
huffman@35514
   372
        add_qualified_thm "take_take" (dname, take_take_thm) thy
huffman@35514
   373
      end;
huffman@35514
   374
    val (take_take_thms, thy) =
huffman@35514
   375
      fold_map prove_take_take
huffman@35514
   376
        (chain_take_thms ~~ deflation_take_thms ~~ dnames) thy;
huffman@35514
   377
huffman@35572
   378
    (* prove take_below rules *)
huffman@35572
   379
    fun prove_take_below (deflation_take, dname) thy =
huffman@35572
   380
      let
huffman@35572
   381
        val take_below_thm =
huffman@35572
   382
            Drule.export_without_context
huffman@35572
   383
            (@{thm deflation.below} OF [deflation_take]);
huffman@35572
   384
      in
huffman@35572
   385
        add_qualified_thm "take_below" (dname, take_below_thm) thy
huffman@35572
   386
      end;
huffman@35572
   387
    val (take_below_thms, thy) =
huffman@35572
   388
      fold_map prove_take_below
huffman@35572
   389
        (deflation_take_thms ~~ dnames) thy;
huffman@35572
   390
huffman@35515
   391
    (* define finiteness predicates *)
huffman@35515
   392
    fun define_finite_const ((tbind, take_const), (lhsT, rhsT)) thy =
huffman@35515
   393
      let
huffman@35515
   394
        val finite_type = lhsT --> boolT;
huffman@35515
   395
        val finite_bind = Binding.suffix_name "_finite" tbind;
huffman@35515
   396
        val (finite_const, thy) =
huffman@35515
   397
          Sign.declare_const ((finite_bind, finite_type), NoSyn) thy;
huffman@35515
   398
        val x = Free ("x", lhsT);
huffman@35557
   399
        val n = Free ("n", natT);
huffman@35515
   400
        val finite_rhs =
huffman@35515
   401
          lambda x (HOLogic.exists_const natT $
huffman@35557
   402
            (lambda n (mk_eq (mk_capply (take_const $ n, x), x))));
huffman@35515
   403
        val finite_eqn = Logic.mk_equals (finite_const, finite_rhs);
huffman@35515
   404
        val (finite_def_thm, thy) =
huffman@35650
   405
            add_qualified_def "finite_def"
huffman@35650
   406
             (Binding.name_of tbind, finite_eqn) thy;
huffman@35515
   407
      in ((finite_const, finite_def_thm), thy) end;
huffman@35515
   408
    val ((finite_consts, finite_defs), thy) = thy
huffman@35515
   409
      |> fold_map define_finite_const (dom_binds ~~ take_consts ~~ dom_eqns)
huffman@35515
   410
      |>> ListPair.unzip;
huffman@35515
   411
huffman@35514
   412
    val result =
huffman@35514
   413
      {
huffman@35514
   414
        take_consts = take_consts,
huffman@35514
   415
        take_defs = take_defs,
huffman@35514
   416
        chain_take_thms = chain_take_thms,
huffman@35514
   417
        take_0_thms = take_0_thms,
huffman@35514
   418
        take_Suc_thms = take_Suc_thms,
huffman@35515
   419
        deflation_take_thms = deflation_take_thms,
huffman@35515
   420
        finite_consts = finite_consts,
huffman@35515
   421
        finite_defs = finite_defs
huffman@35514
   422
      };
huffman@35514
   423
huffman@35514
   424
  in
huffman@35514
   425
    (result, thy)
huffman@35514
   426
  end;
huffman@35514
   427
huffman@35514
   428
end;