src/HOL/Tools/BNF/bnf_fp_n2m.ML
author traytel
Tue Feb 25 18:14:26 2014 +0100 (2014-02-25)
changeset 55803 74d3fe9031d8
parent 55575 a5e33e18fb5c
child 55810 63d63d854fae
permissions -rw-r--r--
joint work with blanchet: intermediate typedef for the input to fp-operations
blanchet@55061
     1
(*  Title:      HOL/Tools/BNF/bnf_fp_n2m.ML
blanchet@53303
     2
    Author:     Dmitriy Traytel, TU Muenchen
blanchet@53303
     3
    Copyright   2013
blanchet@53303
     4
blanchet@53303
     5
Flattening of nested to mutual (co)recursion.
blanchet@53303
     6
*)
blanchet@53303
     7
blanchet@53303
     8
signature BNF_FP_N2M =
blanchet@53303
     9
sig
blanchet@55575
    10
  val construct_mutualized_fp: BNF_Util.fp_kind -> typ list -> BNF_FP_Def_Sugar.fp_sugar list ->
blanchet@53303
    11
    binding list -> (string * sort) list -> typ list * typ list list -> BNF_Def.bnf list ->
traytel@55803
    12
    BNF_Comp.absT_info list -> local_theory -> BNF_FP_Util.fp_result * local_theory
blanchet@53303
    13
end;
blanchet@53303
    14
blanchet@53303
    15
structure BNF_FP_N2M : BNF_FP_N2M =
blanchet@53303
    16
struct
blanchet@53303
    17
blanchet@53303
    18
open BNF_Def
blanchet@53303
    19
open BNF_Util
traytel@55803
    20
open BNF_Comp
blanchet@53303
    21
open BNF_FP_Util
blanchet@53303
    22
open BNF_FP_Def_Sugar
blanchet@53303
    23
open BNF_Tactics
blanchet@53303
    24
open BNF_FP_N2M_Tactics
blanchet@53303
    25
blanchet@53303
    26
fun force_typ ctxt T =
blanchet@54233
    27
  map_types Type_Infer.paramify_vars
blanchet@53303
    28
  #> Type.constraint T
blanchet@53303
    29
  #> Syntax.check_term ctxt
blanchet@53303
    30
  #> singleton (Variable.polymorphic ctxt);
blanchet@53303
    31
blanchet@53303
    32
fun mk_prod_map f g =
blanchet@53303
    33
  let
blanchet@53303
    34
    val ((fAT, fBT), fT) = `dest_funT (fastype_of f);
blanchet@53303
    35
    val ((gAT, gBT), gT) = `dest_funT (fastype_of g);
blanchet@53303
    36
  in
blanchet@53303
    37
    Const (@{const_name map_pair},
blanchet@53303
    38
      fT --> gT --> HOLogic.mk_prodT (fAT, gAT) --> HOLogic.mk_prodT (fBT, gBT)) $ f $ g
blanchet@53303
    39
  end;
blanchet@53303
    40
blanchet@53303
    41
fun mk_sum_map f g =
blanchet@53303
    42
  let
blanchet@53303
    43
    val ((fAT, fBT), fT) = `dest_funT (fastype_of f);
blanchet@53303
    44
    val ((gAT, gBT), gT) = `dest_funT (fastype_of g);
blanchet@53303
    45
  in
blanchet@53303
    46
    Const (@{const_name sum_map}, fT --> gT --> mk_sumT (fAT, gAT) --> mk_sumT (fBT, gBT)) $ f $ g
blanchet@53303
    47
  end;
blanchet@53303
    48
traytel@55803
    49
fun construct_mutualized_fp fp fpTs (fp_sugars : fp_sugar list) bs resBs (resDs, Dss) bnfs
traytel@55803
    50
    absT_infos lthy =
blanchet@53303
    51
  let
traytel@55803
    52
    fun of_fp_res get =
blanchet@55539
    53
      map (fn {fp_res, fp_res_index, ...} => nth (get fp_res) fp_res_index) fp_sugars;
blanchet@53303
    54
blanchet@53303
    55
    fun mk_co_algT T U = fp_case fp (T --> U) (U --> T);
blanchet@53303
    56
    fun co_swap pair = fp_case fp I swap pair;
traytel@55803
    57
    val mk_co_comp = HOLogic.mk_comp o co_swap;
traytel@55803
    58
blanchet@53303
    59
    val dest_co_algT = co_swap o dest_funT;
blanchet@53303
    60
    val co_alg_argT = fp_case fp range_type domain_type;
blanchet@53303
    61
    val co_alg_funT = fp_case fp domain_type range_type;
blanchet@55414
    62
    val mk_co_product = curry (fp_case fp mk_convol mk_case_sum);
blanchet@53303
    63
    val mk_map_co_product = fp_case fp mk_prod_map mk_sum_map;
blanchet@53303
    64
    val co_proj1_const = fp_case fp (fst_const o fst) (uncurry Inl_const o dest_sumT o snd);
blanchet@53303
    65
    val mk_co_productT = curry (fp_case fp HOLogic.mk_prodT mk_sumT);
blanchet@53303
    66
    val dest_co_productT = fp_case fp HOLogic.dest_prodT dest_sumT;
traytel@55803
    67
    val rewrite_comp_comp = fp_case fp @{thm rewriteL_comp_comp} @{thm rewriteR_comp_comp};
traytel@55803
    68
traytel@55803
    69
    val fp_absT_infos = map #absT_info fp_sugars;
traytel@55803
    70
    val fp_bnfs = of_fp_res #bnfs;
traytel@55803
    71
    val pre_bnfs = map #pre_bnf fp_sugars;
traytel@55803
    72
    val nesty_bnfss = map (fn sugar => #nested_bnfs sugar @ #nesting_bnfs sugar) fp_sugars;
traytel@55803
    73
    val fp_nesty_bnfss = fp_bnfs :: nesty_bnfss;
traytel@55803
    74
    val fp_nesty_bnfs = distinct (op = o pairself T_of_bnf) (flat fp_nesty_bnfss);
traytel@55803
    75
traytel@55803
    76
    val fp_absTs = map #absT fp_absT_infos;
traytel@55803
    77
    val fp_repTs = map #repT fp_absT_infos;
traytel@55803
    78
    val fp_abss = map #abs fp_absT_infos;
traytel@55803
    79
    val fp_reps = map #rep fp_absT_infos;
traytel@55803
    80
    val fp_type_definitions = map #type_definition fp_absT_infos;
traytel@55803
    81
traytel@55803
    82
    val absTs = map #absT absT_infos;
traytel@55803
    83
    val repTs = map #repT absT_infos;
traytel@55803
    84
    val absTs' = map (Logic.type_map (singleton (Variable.polymorphic lthy))) absTs;
traytel@55803
    85
    val repTs' = map (Logic.type_map (singleton (Variable.polymorphic lthy))) repTs;
traytel@55803
    86
    val abss = map #abs absT_infos;
traytel@55803
    87
    val reps = map #rep absT_infos;
traytel@55803
    88
    val abs_inverses = map #abs_inverse absT_infos;
traytel@55803
    89
    val type_definitions = map #type_definition absT_infos;
traytel@55803
    90
traytel@55803
    91
    val n = length bnfs;
traytel@55803
    92
    val deads = fold (union (op =)) Dss resDs;
traytel@55803
    93
    val As = subtract (op =) deads (map TFree resBs);
traytel@55803
    94
    val names_lthy = fold Variable.declare_typ (As @ deads) lthy;
traytel@55803
    95
    val m = length As;
traytel@55803
    96
    val live = m + n;
traytel@55803
    97
traytel@55803
    98
    val ((Xs, Bs), names_lthy) = names_lthy
traytel@55803
    99
      |> mk_TFrees n
traytel@55803
   100
      ||>> mk_TFrees m;
traytel@55803
   101
traytel@55803
   102
    val allAs = As @ Xs;
traytel@55803
   103
    val allBs = Bs @ Xs;
traytel@55803
   104
    val phiTs = map2 mk_pred2T As Bs;
traytel@55803
   105
    val thetaBs = As ~~ Bs;
traytel@55803
   106
    val fpTs' = map (Term.typ_subst_atomic thetaBs) fpTs;
traytel@55803
   107
    val fold_thetaAs = Xs ~~ fpTs;
traytel@55803
   108
    val fold_thetaBs = Xs ~~ fpTs';
traytel@55803
   109
    val rec_theta = Xs ~~ map2 mk_co_productT fpTs Xs;
traytel@55803
   110
    val pre_phiTs = map2 mk_pred2T fpTs fpTs';
blanchet@53303
   111
blanchet@53303
   112
    val ((ctors, dtors), (xtor's, xtors)) =
blanchet@53303
   113
      let
traytel@55803
   114
        val ctors = map2 (force_typ names_lthy o (fn T => dummyT --> T)) fpTs (of_fp_res #ctors);
traytel@55803
   115
        val dtors = map2 (force_typ names_lthy o (fn T => T --> dummyT)) fpTs (of_fp_res #dtors);
blanchet@53303
   116
      in
traytel@55803
   117
        ((ctors, dtors), `(map (Term.subst_atomic_types thetaBs)) (fp_case fp ctors dtors))
blanchet@53303
   118
      end;
blanchet@53303
   119
traytel@55803
   120
    val absATs = map (domain_type o fastype_of) ctors;
traytel@55803
   121
    val absBTs = map (Term.typ_subst_atomic thetaBs) absATs;
blanchet@53303
   122
    val xTs = map (domain_type o fastype_of) xtors;
blanchet@53303
   123
    val yTs = map (domain_type o fastype_of) xtor's;
blanchet@53303
   124
traytel@55803
   125
    fun abs_of allAs Ds bnf = mk_abs (mk_T_of_bnf Ds allAs bnf) o #abs;
traytel@55803
   126
    fun rep_of absAT = mk_rep absAT o #rep;
traytel@55803
   127
traytel@55803
   128
    val absAs = map3 (abs_of allAs) Dss bnfs absT_infos;
traytel@55803
   129
    val absBs = map3 (abs_of allBs) Dss bnfs absT_infos;
traytel@55803
   130
    val fp_repAs = map2 rep_of absATs fp_absT_infos;
traytel@55803
   131
    val fp_repBs = map2 rep_of absBTs fp_absT_infos;
traytel@55803
   132
blanchet@53303
   133
    val (((((phis, phis'), pre_phis), xs), ys), names_lthy) = names_lthy
blanchet@53303
   134
      |> mk_Frees' "R" phiTs
blanchet@53303
   135
      ||>> mk_Frees "S" pre_phiTs
blanchet@53303
   136
      ||>> mk_Frees "x" xTs
blanchet@53303
   137
      ||>> mk_Frees "y" yTs;
blanchet@53303
   138
blanchet@53303
   139
    val rels =
blanchet@53303
   140
      let
blanchet@53303
   141
        fun find_rel T As Bs = fp_nesty_bnfss
blanchet@55394
   142
          |> map (filter_out (curry (op = o pairself name_of_bnf) BNF_Comp.DEADID_bnf))
blanchet@53303
   143
          |> get_first (find_first (fn bnf => Type.could_unify (T_of_bnf bnf, T)))
blanchet@53303
   144
          |> Option.map (fn bnf =>
blanchet@53303
   145
            let val live = live_of_bnf bnf;
blanchet@53303
   146
            in (mk_rel live As Bs (rel_of_bnf bnf), live) end)
blanchet@53303
   147
          |> the_default (HOLogic.eq_const T, 0);
blanchet@53303
   148
blanchet@53303
   149
        fun mk_rel (T as Type (_, Ts)) (Type (_, Us)) =
blanchet@53303
   150
              let
blanchet@53303
   151
                val (rel, live) = find_rel T Ts Us;
blanchet@53303
   152
                val (Ts', Us') = fastype_of rel |> strip_typeN live |> fst |> map_split dest_pred2T;
blanchet@53303
   153
                val rels = map2 mk_rel Ts' Us';
blanchet@53303
   154
              in
blanchet@53303
   155
                Term.list_comb (rel, rels)
blanchet@53303
   156
              end
traytel@54244
   157
          | mk_rel (T as TFree _) _ = (nth phis (find_index (curry op = T) As)
traytel@54244
   158
              handle General.Subscript => HOLogic.eq_const T)
blanchet@53303
   159
          | mk_rel _ _ = raise Fail "fpTs contains schematic type variables";
blanchet@53303
   160
      in
traytel@54298
   161
        map2 (fold_rev Term.absfree phis' oo mk_rel) fpTs fpTs'
blanchet@53303
   162
      end;
blanchet@53303
   163
blanchet@53303
   164
    val pre_rels = map2 (fn Ds => mk_rel_of_bnf Ds (As @ fpTs) (Bs @ fpTs')) Dss bnfs;
blanchet@53303
   165
blanchet@55539
   166
    val rel_unfolds = maps (no_refl o single o rel_def_of_bnf) pre_bnfs;
traytel@55803
   167
    val rel_xtor_co_inducts = of_fp_res (split_conj_thm o #rel_xtor_co_induct_thm)
blanchet@55539
   168
      |> map (unfold_thms lthy (id_apply :: rel_unfolds));
blanchet@53303
   169
blanchet@53303
   170
    val rel_defs = map rel_def_of_bnf bnfs;
blanchet@53303
   171
    val rel_monos = map rel_mono_of_bnf bnfs;
blanchet@53303
   172
traytel@55803
   173
    fun cast castA castB pre_rel =
traytel@55803
   174
      let
traytel@55803
   175
        val castAB = mk_vimage2p (Term.subst_atomic_types fold_thetaAs castA)
traytel@55803
   176
          (Term.subst_atomic_types fold_thetaBs castB);
traytel@55803
   177
      in
traytel@55803
   178
        fold_rev (fold_rev Term.absdummy) [phiTs, pre_phiTs]
traytel@55803
   179
          (castAB $ Term.list_comb (pre_rel, map Bound (live - 1 downto 0)))
traytel@55803
   180
      end;
traytel@55803
   181
traytel@55803
   182
    val castAs = map2 (curry HOLogic.mk_comp) absAs fp_repAs;
traytel@55803
   183
    val castBs = map2 (curry HOLogic.mk_comp) absBs fp_repBs;
traytel@55803
   184
blanchet@53303
   185
    val rel_xtor_co_induct_thm =
traytel@55803
   186
      mk_rel_xtor_co_induct_thm fp (map3 cast castAs castBs pre_rels) pre_phis rels phis xs ys xtors
traytel@55803
   187
        xtor's (mk_rel_xtor_co_induct_tactic fp abs_inverses rel_xtor_co_inducts rel_defs rel_monos)
traytel@55803
   188
        lthy;
blanchet@53303
   189
blanchet@53303
   190
    val rel_eqs = no_refl (map rel_eq_of_bnf fp_nesty_bnfs);
blanchet@53303
   191
    val map_id0s = no_refl (map map_id0_of_bnf bnfs);
blanchet@53303
   192
blanchet@53303
   193
    val xtor_co_induct_thm =
blanchet@53303
   194
      (case fp of
blanchet@53303
   195
        Least_FP =>
blanchet@53303
   196
          let
blanchet@53303
   197
            val (Ps, names_lthy) = names_lthy
blanchet@53303
   198
              |> mk_Frees "P" (map (fn T => T --> HOLogic.boolT) fpTs);
blanchet@53303
   199
            fun mk_Grp_id P =
blanchet@53303
   200
              let val T = domain_type (fastype_of P);
blanchet@53303
   201
              in mk_Grp (HOLogic.Collect_const T $ P) (HOLogic.id_const T) end;
blanchet@53303
   202
            val cts = map (SOME o certify lthy) (map HOLogic.eq_const As @ map mk_Grp_id Ps);
traytel@55803
   203
            fun mk_fp_type_copy_thms thm = map (curry op RS thm)
traytel@55803
   204
              @{thms type_copy_Abs_o_Rep type_copy_vimage2p_Grp_Rep};
traytel@55803
   205
            fun mk_type_copy_thms thm = map (curry op RS thm)
traytel@55803
   206
              @{thms type_copy_Rep_o_Abs type_copy_vimage2p_Grp_Abs};
blanchet@53303
   207
          in
blanchet@53303
   208
            cterm_instantiate_pos cts rel_xtor_co_induct_thm
blanchet@53303
   209
            |> singleton (Proof_Context.export names_lthy lthy)
blanchet@53303
   210
            |> unfold_thms lthy (@{thms eq_le_Grp_id_iff all_simps(1,2)[symmetric]} @ rel_eqs)
blanchet@53303
   211
            |> funpow n (fn thm => thm RS spec)
blanchet@53303
   212
            |> unfold_thms lthy (@{thm eq_alt} :: map rel_Grp_of_bnf bnfs @ map_id0s)
traytel@55803
   213
            |> unfold_thms lthy (@{thms vimage2p_comp comp_apply comp_id
traytel@55803
   214
               Grp_id_mono_subst eqTrueI[OF subset_UNIV] simp_thms(22)} @
traytel@55803
   215
               maps mk_fp_type_copy_thms fp_type_definitions @
traytel@55803
   216
               maps mk_type_copy_thms type_definitions)
blanchet@53303
   217
            |> unfold_thms lthy @{thms subset_iff mem_Collect_eq
blanchet@53303
   218
               atomize_conjL[symmetric] atomize_all[symmetric] atomize_imp[symmetric]}
blanchet@53303
   219
          end
blanchet@53303
   220
      | Greatest_FP =>
blanchet@53303
   221
          let
blanchet@53303
   222
            val cts = NONE :: map (SOME o certify lthy) (map HOLogic.eq_const As);
blanchet@53303
   223
          in
blanchet@53303
   224
            cterm_instantiate_pos cts rel_xtor_co_induct_thm
blanchet@53303
   225
            |> unfold_thms lthy (@{thms le_fun_def le_bool_def all_simps(1,2)[symmetric]} @ rel_eqs)
blanchet@53303
   226
            |> funpow (2 * n) (fn thm => thm RS spec)
wenzelm@54742
   227
            |> Conv.fconv_rule (Object_Logic.atomize lthy)
blanchet@53303
   228
            |> funpow n (fn thm => thm RS mp)
blanchet@53303
   229
          end);
blanchet@53303
   230
blanchet@53303
   231
    val fold_preTs = map2 (fn Ds => mk_T_of_bnf Ds allAs) Dss bnfs;
blanchet@53303
   232
    val rec_preTs = map (Term.typ_subst_atomic rec_theta) fold_preTs;
blanchet@53303
   233
blanchet@53303
   234
    val fold_strTs = map2 mk_co_algT fold_preTs Xs;
blanchet@53303
   235
    val rec_strTs = map2 mk_co_algT rec_preTs Xs;
blanchet@53303
   236
    val resTs = map2 mk_co_algT fpTs Xs;
blanchet@53303
   237
blanchet@53303
   238
    val (((fold_strs, fold_strs'), (rec_strs, rec_strs')), names_lthy) = names_lthy
blanchet@53303
   239
      |> mk_Frees' "s" fold_strTs
blanchet@53303
   240
      ||>> mk_Frees' "s" rec_strTs;
blanchet@53303
   241
traytel@55803
   242
    val co_iters = of_fp_res #xtor_co_iterss;
blanchet@55539
   243
    val ns = map (length o #Ts o #fp_res) fp_sugars;
blanchet@55539
   244
blanchet@53303
   245
    fun substT rho (Type (@{type_name "fun"}, [T, U])) = substT rho T --> substT rho U
blanchet@53303
   246
      | substT rho (Type (s, Ts)) = Type (s, map (typ_subst_nonatomic rho) Ts)
blanchet@53303
   247
      | substT _ T = T;
blanchet@55539
   248
traytel@55803
   249
    val typ_subst_nonatomic_sorted = fold_rev (typ_subst_nonatomic o single);
traytel@55803
   250
blanchet@53303
   251
    fun force_iter is_rec i TU TU_rec raw_iters =
blanchet@53303
   252
      let
traytel@55803
   253
        val thy = Proof_Context.theory_of lthy;
traytel@55803
   254
blanchet@53303
   255
        val approx_fold = un_fold_of raw_iters
blanchet@53303
   256
          |> force_typ names_lthy
blanchet@53303
   257
            (replicate (nth ns i) dummyT ---> (if is_rec then TU_rec else TU));
traytel@55803
   258
        val subst = Term.typ_subst_atomic fold_thetaAs;
traytel@55803
   259
traytel@55803
   260
        fun mk_fp_absT_repT fp_repT fp_absT = mk_absT thy fp_repT fp_absT ooo mk_repT;
traytel@55803
   261
        val mk_fp_absT_repTs = map5 mk_fp_absT_repT fp_repTs fp_absTs absTs repTs;
traytel@55803
   262
traytel@55803
   263
        val fold_preTs' = mk_fp_absT_repTs (map subst fold_preTs);
traytel@55803
   264
traytel@55803
   265
        val fold_pre_deads_only_Ts =
traytel@55803
   266
          map (typ_subst_nonatomic_sorted (map (rpair dummyT) (As @ fpTs))) fold_preTs';
traytel@55803
   267
traytel@55478
   268
        val TUs = map_split dest_co_algT (binder_fun_types (fastype_of approx_fold))
traytel@55478
   269
          |>> map subst
traytel@55478
   270
          |> uncurry (map2 mk_co_algT);
traytel@55803
   271
        val cands = map2 mk_co_algT fold_preTs' Xs;
traytel@55803
   272
traytel@55803
   273
        val js = find_indices Type.could_unify TUs cands;
blanchet@53303
   274
        val Tpats = map (fn j => mk_co_algT (nth fold_pre_deads_only_Ts j) (nth Xs j)) js;
blanchet@53303
   275
        val iter = raw_iters |> (if is_rec then co_rec_of else un_fold_of);
blanchet@53303
   276
      in
blanchet@53303
   277
        force_typ names_lthy (Tpats ---> TU) iter
blanchet@53303
   278
      end;
blanchet@53303
   279
traytel@55803
   280
    fun mk_co_comp_abs_rep fp_absT absT fp_abs fp_rep abs rep t =
traytel@55803
   281
      fp_case fp (HOLogic.mk_comp (HOLogic.mk_comp (t, mk_abs absT abs), mk_rep fp_absT fp_rep))
traytel@55803
   282
        (HOLogic.mk_comp (mk_abs fp_absT fp_abs, HOLogic.mk_comp (mk_rep absT rep, t)));
traytel@55803
   283
blanchet@53303
   284
    fun mk_iter b_opt is_rec iters lthy TU =
blanchet@53303
   285
      let
traytel@55803
   286
        val thy = Proof_Context.theory_of lthy;
traytel@55803
   287
blanchet@53303
   288
        val x = co_alg_argT TU;
blanchet@53303
   289
        val i = find_index (fn T => x = T) Xs;
blanchet@53303
   290
        val TUiter =
blanchet@53303
   291
          (case find_first (fn f => body_fun_type (fastype_of f) = TU) iters of
blanchet@53303
   292
            NONE => nth co_iters i
blanchet@53303
   293
              |> force_iter is_rec i
blanchet@53303
   294
                (TU |> (is_none b_opt andalso not is_rec) ? substT (fpTs ~~ Xs))
blanchet@53303
   295
                (TU |> (is_none b_opt) ? substT (map2 mk_co_productT fpTs Xs ~~ Xs))
blanchet@53303
   296
          | SOME f => f);
traytel@55803
   297
blanchet@53303
   298
        val TUs = binder_fun_types (fastype_of TUiter);
blanchet@53303
   299
        val iter_preTs = if is_rec then rec_preTs else fold_preTs;
blanchet@53303
   300
        val iter_strs = if is_rec then rec_strs else fold_strs;
traytel@55803
   301
blanchet@53303
   302
        fun mk_s TU' =
blanchet@53303
   303
          let
traytel@55803
   304
            fun mk_absT_fp_repT repT absT = mk_absT thy repT absT ooo mk_repT;
traytel@55803
   305
blanchet@53303
   306
            val i = find_index (fn T => co_alg_argT TU' = T) Xs;
traytel@55803
   307
            val fp_abs = nth fp_abss i;
traytel@55803
   308
            val fp_rep = nth fp_reps i;
traytel@55803
   309
            val abs = nth abss i;
traytel@55803
   310
            val rep = nth reps i;
blanchet@54233
   311
            val sF = co_alg_funT TU';
traytel@55803
   312
            val sF' =
traytel@55803
   313
              mk_absT_fp_repT (nth repTs' i) (nth absTs' i) (nth fp_absTs i) (nth fp_repTs i) sF
traytel@55803
   314
                handle Term.TYPE _ => sF;
blanchet@53303
   315
            val F = nth iter_preTs i;
blanchet@53303
   316
            val s = nth iter_strs i;
blanchet@53303
   317
          in
traytel@55803
   318
            if sF = F then s
traytel@55803
   319
            else if sF' = F then mk_co_comp_abs_rep sF sF' fp_abs fp_rep abs rep s
blanchet@53303
   320
            else
blanchet@53303
   321
              let
traytel@55803
   322
                val smapT = replicate live dummyT ---> mk_co_algT sF' F;
blanchet@53303
   323
                fun hidden_to_unit t =
blanchet@53303
   324
                  Term.subst_TVars (map (rpair HOLogic.unitT) (Term.add_tvar_names t [])) t;
blanchet@53303
   325
                val smap = map_of_bnf (nth bnfs i)
blanchet@53303
   326
                  |> force_typ names_lthy smapT
blanchet@53303
   327
                  |> hidden_to_unit;
blanchet@53303
   328
                val smap_argTs = strip_typeN live (fastype_of smap) |> fst;
blanchet@54233
   329
                fun mk_smap_arg TU =
blanchet@53303
   330
                  (if domain_type TU = range_type TU then
blanchet@53303
   331
                    HOLogic.id_const (domain_type TU)
blanchet@53303
   332
                  else if is_rec then
blanchet@53303
   333
                    let
blanchet@53303
   334
                      val (TY, (U, X)) = TU |> dest_co_algT ||> dest_co_productT;
blanchet@53303
   335
                      val T = mk_co_algT TY U;
blanchet@53303
   336
                    in
blanchet@53303
   337
                      (case try (force_typ lthy T o build_map lthy co_proj1_const o dest_funT) T of
blanchet@53303
   338
                        SOME f => mk_co_product f
blanchet@53303
   339
                          (fst (fst (mk_iter NONE is_rec iters lthy (mk_co_algT TY X))))
blanchet@53303
   340
                      | NONE => mk_map_co_product
blanchet@53303
   341
                          (build_map lthy co_proj1_const
blanchet@53303
   342
                            (dest_funT (mk_co_algT (dest_co_productT TY |> fst) U)))
blanchet@53303
   343
                          (HOLogic.id_const X))
blanchet@53303
   344
                    end
blanchet@53303
   345
                  else
blanchet@53303
   346
                    fst (fst (mk_iter NONE is_rec iters lthy TU)))
blanchet@53303
   347
                val smap_args = map mk_smap_arg smap_argTs;
blanchet@53303
   348
              in
traytel@55803
   349
                mk_co_comp_abs_rep sF sF' fp_abs fp_rep abs rep
traytel@55803
   350
                  (mk_co_comp (s, Term.list_comb (smap, smap_args)))
traytel@55803
   351
              end
blanchet@53303
   352
          end;
blanchet@53303
   353
        val t = Term.list_comb (TUiter, map mk_s TUs);
blanchet@53303
   354
      in
blanchet@53303
   355
        (case b_opt of
blanchet@53303
   356
          NONE => ((t, Drule.dummy_thm), lthy)
blanchet@54233
   357
        | SOME b => Local_Theory.define ((b, NoSyn), ((Binding.conceal (Thm.def_binding b), []),
blanchet@53303
   358
            fold_rev Term.absfree (if is_rec then rec_strs' else fold_strs') t)) lthy |>> apsnd snd)
blanchet@53303
   359
      end;
blanchet@53303
   360
blanchet@53303
   361
    fun mk_iters is_rec name lthy =
blanchet@53303
   362
      fold2 (fn TU => fn b => fn ((iters, defs), lthy) =>
blanchet@53303
   363
        mk_iter (SOME b) is_rec iters lthy TU |>> (fn (f, d) => (f :: iters, d :: defs)))
blanchet@53303
   364
      resTs (map (Binding.suffix_name ("_" ^ name)) bs) (([], []), lthy)
blanchet@53303
   365
      |>> apfst rev o apsnd rev;
blanchet@53303
   366
    val foldN = fp_case fp ctor_foldN dtor_unfoldN;
blanchet@53303
   367
    val recN = fp_case fp ctor_recN dtor_corecN;
traytel@53331
   368
    val (((raw_un_folds, raw_un_fold_defs), (raw_co_recs, raw_co_rec_defs)), (lthy, raw_lthy)) =
blanchet@53303
   369
      lthy
blanchet@53303
   370
      |> mk_iters false foldN
blanchet@53303
   371
      ||>> mk_iters true recN
traytel@53331
   372
      ||> `Local_Theory.restore;
blanchet@53303
   373
traytel@53331
   374
    val phi = Proof_Context.export_morphism raw_lthy lthy;
blanchet@53303
   375
blanchet@53303
   376
    val un_folds = map (Morphism.term phi) raw_un_folds;
blanchet@53303
   377
    val co_recs = map (Morphism.term phi) raw_co_recs;
blanchet@53303
   378
blanchet@53303
   379
    val (xtor_un_fold_thms, xtor_co_rec_thms) =
blanchet@53303
   380
      let
blanchet@53303
   381
        val folds = map (fn f => Term.list_comb (f, fold_strs)) raw_un_folds;
blanchet@53303
   382
        val recs = map (fn r => Term.list_comb (r, rec_strs)) raw_co_recs;
blanchet@53303
   383
        val fold_mapTs = co_swap (As @ fpTs, As @ Xs);
blanchet@53303
   384
        val rec_mapTs = co_swap (As @ fpTs, As @ map2 mk_co_productT fpTs Xs);
blanchet@53303
   385
        val pre_fold_maps =
blanchet@53303
   386
          map2 (fn Ds => fn bnf =>
blanchet@53303
   387
            Term.list_comb (uncurry (mk_map_of_bnf Ds) fold_mapTs bnf,
blanchet@53303
   388
              map HOLogic.id_const As @ folds))
blanchet@53303
   389
          Dss bnfs;
blanchet@53303
   390
        val pre_rec_maps =
blanchet@53303
   391
          map2 (fn Ds => fn bnf =>
blanchet@53303
   392
            Term.list_comb (uncurry (mk_map_of_bnf Ds) rec_mapTs bnf,
blanchet@53303
   393
              map HOLogic.id_const As @ map2 (mk_co_product o HOLogic.id_const) fpTs recs))
blanchet@53303
   394
          Dss bnfs;
blanchet@53303
   395
traytel@55803
   396
        fun mk_goals f xtor s smap fp_abs fp_rep abs rep =
traytel@55803
   397
          let
traytel@55803
   398
            val lhs = mk_co_comp (f, xtor);
traytel@55803
   399
            val rhs = mk_co_comp (s, smap);
traytel@55803
   400
          in
traytel@55803
   401
            HOLogic.mk_eq (lhs,
traytel@55803
   402
              mk_co_comp_abs_rep (co_alg_funT (fastype_of lhs)) (co_alg_funT (fastype_of rhs))
traytel@55803
   403
                fp_abs fp_rep abs rep rhs)
traytel@55803
   404
          end;
blanchet@53303
   405
traytel@55803
   406
        val fold_goals =
traytel@55803
   407
          map8 mk_goals folds xtors fold_strs pre_fold_maps fp_abss fp_reps abss reps;
traytel@55803
   408
        val rec_goals = map8 mk_goals recs xtors rec_strs pre_rec_maps fp_abss fp_reps abss reps;
blanchet@53303
   409
blanchet@53303
   410
        fun mk_thms ss goals tac =
blanchet@53303
   411
          Library.foldr1 HOLogic.mk_conj goals
blanchet@53303
   412
          |> HOLogic.mk_Trueprop
blanchet@53303
   413
          |> fold_rev Logic.all ss
traytel@53331
   414
          |> (fn goal => Goal.prove_sorry raw_lthy [] [] goal tac)
blanchet@53303
   415
          |> Thm.close_derivation
blanchet@53303
   416
          |> Morphism.thm phi
blanchet@53303
   417
          |> split_conj_thm
blanchet@53303
   418
          |> map (fn thm => thm RS @{thm comp_eq_dest});
blanchet@53303
   419
blanchet@53303
   420
        val pre_map_defs = no_refl (map map_def_of_bnf bnfs);
blanchet@53303
   421
        val fp_pre_map_defs = no_refl (map map_def_of_bnf pre_bnfs);
blanchet@53303
   422
traytel@55803
   423
        val unfold_map = map (unfold_thms lthy (id_apply :: pre_map_defs));
traytel@55803
   424
traytel@55803
   425
        val fp_xtor_co_iterss = of_fp_res #xtor_co_iter_thmss;
traytel@55803
   426
        val fp_xtor_un_folds = map (mk_pointfree lthy o un_fold_of) fp_xtor_co_iterss;
traytel@55803
   427
        val fp_xtor_co_recs = map (mk_pointfree lthy o co_rec_of) fp_xtor_co_iterss;
blanchet@53303
   428
traytel@55803
   429
        val fp_co_iter_o_mapss = of_fp_res #xtor_co_iter_o_map_thmss;
traytel@55803
   430
        val fp_fold_o_maps = map un_fold_of fp_co_iter_o_mapss;
traytel@55803
   431
        val fp_rec_o_maps = map co_rec_of fp_co_iter_o_mapss;
traytel@55803
   432
        val fold_thms = fp_case fp @{thm comp_assoc} @{thm comp_assoc[symmetric]} ::
traytel@55803
   433
          map (fn thm => thm RS rewrite_comp_comp) @{thms map_pair.comp sum_map.comp} @
traytel@55803
   434
          @{thms id_apply comp_id id_comp map_pair.comp map_pair.id sum_map.comp sum_map.id};
blanchet@53303
   435
        val rec_thms = fold_thms @ fp_case fp
blanchet@53303
   436
          @{thms fst_convol map_pair_o_convol convol_o}
blanchet@55414
   437
          @{thms case_sum_o_inj(1) case_sum_o_sum_map o_case_sum};
traytel@55803
   438
traytel@55803
   439
        val eq_thm_prop_untyped = op Term.aconv_untyped o pairself Thm.full_prop_of;
traytel@55803
   440
blanchet@53303
   441
        val map_thms = no_refl (maps (fn bnf =>
traytel@55803
   442
           let val map_comp0 = map_comp0_of_bnf bnf RS sym
traytel@55803
   443
           in [map_comp0, map_comp0 RS rewrite_comp_comp, map_id0_of_bnf bnf] end) fp_nesty_bnfs) @
traytel@55803
   444
          remove eq_thm_prop_untyped (fp_case fp @{thm comp_assoc[symmetric]} @{thm comp_assoc})
traytel@55803
   445
          (map2 (fn thm => fn bnf =>
traytel@55803
   446
            @{thm type_copy_map_comp0_undo} OF
traytel@55803
   447
              (replicate 3 thm @ unfold_map [map_comp0_of_bnf bnf]) RS
traytel@55803
   448
              rewrite_comp_comp)
traytel@55803
   449
          type_definitions bnfs);
traytel@55803
   450
traytel@55803
   451
        fun mk_Rep_o_Abs thm = thm RS @{thm type_copy_Rep_o_Abs} RS rewrite_comp_comp;
traytel@55803
   452
traytel@55803
   453
        val fp_Rep_o_Abss = map mk_Rep_o_Abs fp_type_definitions;
traytel@55803
   454
        val Rep_o_Abss = map mk_Rep_o_Abs type_definitions;
blanchet@53303
   455
blanchet@53303
   456
        fun mk_tac defs o_map_thms xtor_thms thms {context = ctxt, prems = _} =
traytel@55803
   457
          unfold_thms_tac ctxt (flat [thms, defs, pre_map_defs, fp_pre_map_defs,
traytel@55803
   458
            xtor_thms, o_map_thms, map_thms, fp_Rep_o_Abss, Rep_o_Abss]) THEN
blanchet@53303
   459
          CONJ_WRAP (K (HEADGOAL (rtac refl))) bnfs;
blanchet@53303
   460
blanchet@53303
   461
        val fold_tac = mk_tac raw_un_fold_defs fp_fold_o_maps fp_xtor_un_folds fold_thms;
blanchet@53303
   462
        val rec_tac = mk_tac raw_co_rec_defs fp_rec_o_maps fp_xtor_co_recs rec_thms;
blanchet@53303
   463
      in
blanchet@53303
   464
        (mk_thms fold_strs fold_goals fold_tac, mk_thms rec_strs rec_goals rec_tac)
blanchet@53303
   465
      end;
blanchet@53303
   466
blanchet@53303
   467
    (* These results are half broken. This is deliberate. We care only about those fields that are
blanchet@55531
   468
       used by "primrec", "primcorecursive", and "datatype_compat". *)
blanchet@53303
   469
    val fp_res =
blanchet@53303
   470
      ({Ts = fpTs,
traytel@55803
   471
        bnfs = of_fp_res #bnfs,
blanchet@53303
   472
        dtors = dtors,
blanchet@53303
   473
        ctors = ctors,
blanchet@53303
   474
        xtor_co_iterss = transpose [un_folds, co_recs],
blanchet@53303
   475
        xtor_co_induct = xtor_co_induct_thm,
traytel@55803
   476
        dtor_ctors = of_fp_res #dtor_ctors (*too general types*),
traytel@55803
   477
        ctor_dtors = of_fp_res #ctor_dtors (*too general types*),
traytel@55803
   478
        ctor_injects = of_fp_res #ctor_injects (*too general types*),
traytel@55803
   479
        dtor_injects = of_fp_res #dtor_injects (*too general types*),
traytel@55803
   480
        xtor_map_thms = of_fp_res #xtor_map_thms (*too general types and terms*),
traytel@55803
   481
        xtor_set_thmss = of_fp_res #xtor_set_thmss (*too general types and terms*),
traytel@55803
   482
        xtor_rel_thms = of_fp_res #xtor_rel_thms (*too general types and terms*),
blanchet@53303
   483
        xtor_co_iter_thmss = transpose [xtor_un_fold_thms, xtor_co_rec_thms],
traytel@55803
   484
        xtor_co_iter_o_map_thmss = of_fp_res #xtor_co_iter_o_map_thmss
blanchet@55539
   485
          (*theorem about old constant*),
blanchet@53303
   486
        rel_xtor_co_induct_thm = rel_xtor_co_induct_thm}
wenzelm@54740
   487
       |> morph_fp_result (Morphism.term_morphism "BNF" (singleton (Variable.polymorphic lthy))));
blanchet@53303
   488
  in
blanchet@53303
   489
    (fp_res, lthy)
blanchet@54242
   490
  end;
blanchet@53303
   491
blanchet@53303
   492
end;