src/HOL/Codatatype/Tools/bnf_fp_sugar.ML
author blanchet
Mon Sep 10 21:44:43 2012 +0200 (2012-09-10)
changeset 49266 70ffce5b65a4
parent 49264 9059e0dbdbc1
child 49267 c96a07255e10
permissions -rw-r--r--
generate "sel_coiters" and friends
blanchet@49112
     1
(*  Title:      HOL/Codatatype/Tools/bnf_fp_sugar.ML
blanchet@49112
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@49112
     3
    Copyright   2012
blanchet@49112
     4
blanchet@49112
     5
Sugar for constructing LFPs and GFPs.
blanchet@49112
     6
*)
blanchet@49112
     7
blanchet@49112
     8
signature BNF_FP_SUGAR =
blanchet@49112
     9
sig
blanchet@49205
    10
  (* TODO: programmatic interface *)
blanchet@49112
    11
end;
blanchet@49112
    12
blanchet@49112
    13
structure BNF_FP_Sugar : BNF_FP_SUGAR =
blanchet@49112
    14
struct
blanchet@49112
    15
blanchet@49119
    16
open BNF_Util
blanchet@49119
    17
open BNF_Wrap
blanchet@49214
    18
open BNF_Def
blanchet@49119
    19
open BNF_FP_Util
blanchet@49119
    20
open BNF_LFP
blanchet@49119
    21
open BNF_GFP
blanchet@49123
    22
open BNF_FP_Sugar_Tactics
blanchet@49119
    23
blanchet@49129
    24
val caseN = "case";
blanchet@49213
    25
val coitersN = "coiters";
blanchet@49213
    26
val corecsN = "corecs";
blanchet@49266
    27
val disc_coitersN = "disc_coiters";
blanchet@49266
    28
val disc_corecsN = "disc_corecs";
blanchet@49202
    29
val itersN = "iters";
blanchet@49202
    30
val recsN = "recs";
blanchet@49266
    31
val sel_coitersN = "sel_coiters";
blanchet@49266
    32
val sel_corecsN = "sel_corecs";
blanchet@49129
    33
blanchet@49266
    34
fun split_list11 xs =
blanchet@49266
    35
  (map #1 xs, map #2 xs, map #3 xs, map #4 xs, map #5 xs, map #6 xs, map #7 xs, map #8 xs,
blanchet@49266
    36
   map #9 xs, map #10 xs, map #11 xs);
blanchet@49214
    37
blanchet@49217
    38
fun strip_map_type (Type (@{type_name fun}, [T as Type _, T'])) = strip_map_type T' |>> cons T
blanchet@49217
    39
  | strip_map_type T = ([], T);
blanchet@49217
    40
blanchet@49214
    41
fun typ_subst inst (T as Type (s, Ts)) =
blanchet@49214
    42
    (case AList.lookup (op =) inst T of
blanchet@49214
    43
      NONE => Type (s, map (typ_subst inst) Ts)
blanchet@49214
    44
    | SOME T' => T')
blanchet@49214
    45
  | typ_subst inst T = the_default T (AList.lookup (op =) inst T);
blanchet@49205
    46
blanchet@49199
    47
fun retype_free (Free (s, _)) T = Free (s, T);
blanchet@49199
    48
blanchet@49212
    49
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs))
blanchet@49202
    50
blanchet@49234
    51
fun mk_id T = Const (@{const_name id}, T --> T);
blanchet@49234
    52
blanchet@49200
    53
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs));
blanchet@49200
    54
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs;
blanchet@49202
    55
fun mk_uncurried2_fun f xss =
blanchet@49200
    56
  mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss);
blanchet@49200
    57
blanchet@49233
    58
fun tick v f = Term.lambda v (HOLogic.mk_prod (v, f $ v));
blanchet@49233
    59
blanchet@49233
    60
fun tack z_name (c, v) f =
blanchet@49233
    61
  let val z = Free (z_name, mk_sumT (fastype_of v, fastype_of c)) in
blanchet@49255
    62
    Term.lambda z (mk_sum_case (Term.lambda v v, Term.lambda c (f $ c)) $ z)
blanchet@49233
    63
  end;
blanchet@49214
    64
blanchet@49124
    65
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
blanchet@49119
    66
blanchet@49119
    67
fun merge_type_arg_constrained ctxt (T, c) (T', c') =
blanchet@49119
    68
  if T = T' then
blanchet@49119
    69
    (case (c, c') of
blanchet@49119
    70
      (_, NONE) => (T, c)
blanchet@49119
    71
    | (NONE, _) => (T, c')
blanchet@49119
    72
    | _ =>
blanchet@49119
    73
      if c = c' then
blanchet@49119
    74
        (T, c)
blanchet@49119
    75
      else
blanchet@49119
    76
        error ("Inconsistent sort constraints for type variable " ^
blanchet@49119
    77
          quote (Syntax.string_of_typ ctxt T)))
blanchet@49119
    78
  else
blanchet@49119
    79
    cannot_merge_types ();
blanchet@49119
    80
blanchet@49119
    81
fun merge_type_args_constrained ctxt (cAs, cAs') =
blanchet@49119
    82
  if length cAs = length cAs' then map2 (merge_type_arg_constrained ctxt) cAs cAs'
blanchet@49119
    83
  else cannot_merge_types ();
blanchet@49119
    84
blanchet@49121
    85
fun type_args_constrained_of (((cAs, _), _), _) = cAs;
blanchet@49121
    86
val type_args_of = map fst o type_args_constrained_of;
blanchet@49129
    87
fun type_binder_of (((_, b), _), _) = b;
blanchet@49181
    88
fun mixfix_of ((_, mx), _) = mx;
blanchet@49121
    89
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
blanchet@49119
    90
blanchet@49121
    91
fun disc_of (((disc, _), _), _) = disc;
blanchet@49121
    92
fun ctr_of (((_, ctr), _), _) = ctr;
blanchet@49121
    93
fun args_of ((_, args), _) = args;
blanchet@49181
    94
fun ctr_mixfix_of (_, mx) = mx;
blanchet@49119
    95
blanchet@49208
    96
fun prepare_datatype prepare_typ lfp specs fake_lthy no_defs_lthy =
blanchet@49112
    97
  let
blanchet@49121
    98
    val constrained_As =
blanchet@49121
    99
      map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs
blanchet@49204
   100
      |> Library.foldr1 (merge_type_args_constrained no_defs_lthy);
blanchet@49121
   101
    val As = map fst constrained_As;
blanchet@49134
   102
    val As' = map dest_TFree As;
blanchet@49119
   103
blanchet@49121
   104
    val _ = (case duplicates (op =) As of [] => ()
blanchet@49204
   105
      | A :: _ => error ("Duplicate type parameter " ^
blanchet@49204
   106
          quote (Syntax.string_of_typ no_defs_lthy A)));
blanchet@49119
   107
blanchet@49119
   108
    (* TODO: use sort constraints on type args *)
blanchet@49119
   109
blanchet@49119
   110
    val N = length specs;
blanchet@49119
   111
blanchet@49182
   112
    fun mk_fake_T b =
blanchet@49121
   113
      Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
blanchet@49121
   114
        As);
blanchet@49121
   115
blanchet@49129
   116
    val bs = map type_binder_of specs;
blanchet@49204
   117
    val fakeTs = map mk_fake_T bs;
blanchet@49121
   118
blanchet@49181
   119
    val mixfixes = map mixfix_of specs;
blanchet@49119
   120
blanchet@49119
   121
    val _ = (case duplicates Binding.eq_name bs of [] => ()
blanchet@49119
   122
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
blanchet@49119
   123
blanchet@49121
   124
    val ctr_specss = map ctr_specs_of specs;
blanchet@49119
   125
blanchet@49129
   126
    val disc_binderss = map (map disc_of) ctr_specss;
blanchet@49129
   127
    val ctr_binderss = map (map ctr_of) ctr_specss;
blanchet@49121
   128
    val ctr_argsss = map (map args_of) ctr_specss;
blanchet@49181
   129
    val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
blanchet@49119
   130
blanchet@49129
   131
    val sel_bindersss = map (map (map fst)) ctr_argsss;
blanchet@49183
   132
    val fake_ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
blanchet@49121
   133
blanchet@49183
   134
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
blanchet@49167
   135
    val _ = (case subtract (op =) As' rhs_As' of
blanchet@49165
   136
        [] => ()
blanchet@49165
   137
      | A' :: _ => error ("Extra type variables on rhs: " ^
blanchet@49204
   138
          quote (Syntax.string_of_typ no_defs_lthy (TFree A'))));
blanchet@49165
   139
blanchet@49176
   140
    val ((Cs, Xs), _) =
blanchet@49204
   141
      no_defs_lthy
blanchet@49121
   142
      |> fold (fold (fn s => Variable.declare_typ (TFree (s, dummyS))) o type_args_of) specs
blanchet@49121
   143
      |> mk_TFrees N
blanchet@49176
   144
      ||>> mk_TFrees N;
blanchet@49119
   145
blanchet@49204
   146
    fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) =
blanchet@49146
   147
        s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
blanchet@49146
   148
          quote (Syntax.string_of_typ fake_lthy T)))
blanchet@49204
   149
      | eq_fpT _ _ = false;
blanchet@49146
   150
blanchet@49204
   151
    fun freeze_fp (T as Type (s, Us)) =
blanchet@49204
   152
        (case find_index (eq_fpT T) fakeTs of ~1 => Type (s, map freeze_fp Us) | j => nth Xs j)
blanchet@49204
   153
      | freeze_fp T = T;
blanchet@49121
   154
blanchet@49204
   155
    val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss;
blanchet@49255
   156
    val ctr_sum_prod_TsXs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssXs;
blanchet@49119
   157
blanchet@49255
   158
    val eqs = map dest_TFree Xs ~~ ctr_sum_prod_TsXs;
blanchet@49121
   159
blanchet@49226
   160
    val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects,
blanchet@49207
   161
        fp_iter_thms, fp_rec_thms), lthy)) =
blanchet@49208
   162
      fp_bnf (if lfp then bnf_lfp else bnf_gfp) bs mixfixes As' eqs no_defs_lthy;
blanchet@49121
   163
blanchet@49226
   164
    val add_nested_bnf_names =
blanchet@49226
   165
      let
blanchet@49226
   166
        fun add (Type (s, Ts)) ss =
blanchet@49226
   167
            let val (needs, ss') = fold_map add Ts ss in
blanchet@49226
   168
              if exists I needs then (true, insert (op =) s ss') else (false, ss')
blanchet@49226
   169
            end
blanchet@49226
   170
          | add T ss = (member (op =) As T, ss);
blanchet@49226
   171
      in snd oo add end;
blanchet@49226
   172
blanchet@49226
   173
    val nested_bnfs =
traytel@49236
   174
      map_filter (bnf_of lthy) (fold (fold (fold add_nested_bnf_names)) ctr_TsssXs []);
blanchet@49226
   175
blanchet@49167
   176
    val timer = time (Timer.startRealTimer ());
blanchet@49167
   177
blanchet@49176
   178
    fun mk_unf_or_fld get_T Ts t =
blanchet@49176
   179
      let val Type (_, Ts0) = get_T (fastype_of t) in
blanchet@49124
   180
        Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49121
   181
      end;
blanchet@49119
   182
blanchet@49126
   183
    val mk_unf = mk_unf_or_fld domain_type;
blanchet@49126
   184
    val mk_fld = mk_unf_or_fld range_type;
blanchet@49121
   185
blanchet@49203
   186
    val unfs = map (mk_unf As) unfs0;
blanchet@49203
   187
    val flds = map (mk_fld As) flds0;
blanchet@49124
   188
blanchet@49201
   189
    val fpTs = map (domain_type o fastype_of) unfs;
blanchet@49204
   190
blanchet@49201
   191
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs;
blanchet@49203
   192
    val ns = map length ctr_Tsss;
blanchet@49212
   193
    val kss = map (fn n => 1 upto n) ns;
blanchet@49203
   194
    val mss = map (map length) ctr_Tsss;
blanchet@49203
   195
    val Css = map2 replicate ns Cs;
blanchet@49203
   196
blanchet@49214
   197
    fun mk_iter_like Ts Us t =
blanchet@49121
   198
      let
blanchet@49214
   199
        val (binders, body) = strip_type (fastype_of t);
blanchet@49210
   200
        val (f_Us, prebody) = split_last binders;
blanchet@49210
   201
        val Type (_, Ts0) = if lfp then prebody else body;
blanchet@49210
   202
        val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us);
blanchet@49176
   203
      in
blanchet@49214
   204
        Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49176
   205
      end;
blanchet@49176
   206
blanchet@49210
   207
    val fp_iters as fp_iter1 :: _ = map (mk_iter_like As Cs) fp_iters0;
blanchet@49210
   208
    val fp_recs as fp_rec1 :: _ = map (mk_iter_like As Cs) fp_recs0;
blanchet@49210
   209
blanchet@49212
   210
    val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1)));
blanchet@49212
   211
    val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1)));
blanchet@49204
   212
blanchet@49204
   213
    fun dest_rec_pair (T as Type (@{type_name prod}, Us as [_, U])) =
blanchet@49204
   214
        if member (op =) Cs U then Us else [T]
blanchet@49204
   215
      | dest_rec_pair T = [T];
blanchet@49204
   216
blanchet@49256
   217
    val ((iter_only as (gss, _, _), rec_only as (hss, _, _)),
blanchet@49256
   218
         (zs, cs, cpss, coiter_only as ((pgss, cgsss), _), corec_only as ((phss, chsss), _))) =
blanchet@49208
   219
      if lfp then
blanchet@49208
   220
        let
blanchet@49208
   221
          val y_Tsss =
blanchet@49255
   222
            map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type)
blanchet@49212
   223
              ns mss fp_iter_fun_Ts;
blanchet@49208
   224
          val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css;
blanchet@49208
   225
blanchet@49208
   226
          val ((gss, ysss), _) =
blanchet@49208
   227
            lthy
blanchet@49208
   228
            |> mk_Freess "f" g_Tss
blanchet@49208
   229
            ||>> mk_Freesss "x" y_Tsss;
blanchet@49204
   230
blanchet@49208
   231
          val z_Tssss =
blanchet@49255
   232
            map3 (fn n => fn ms => map2 (map dest_rec_pair oo dest_tupleT) ms o
blanchet@49255
   233
              dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts;
blanchet@49208
   234
          val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css;
blanchet@49204
   235
blanchet@49208
   236
          val hss = map2 (map2 retype_free) gss h_Tss;
blanchet@49208
   237
          val (zssss, _) =
blanchet@49208
   238
            lthy
blanchet@49208
   239
            |> mk_Freessss "x" z_Tssss;
blanchet@49210
   240
        in
blanchet@49215
   241
          (((gss, g_Tss, map (map (map single)) ysss), (hss, h_Tss, zssss)),
blanchet@49256
   242
           ([], [], [], (([], []), ([], [])), (([], []), ([], []))))
blanchet@49210
   243
        end
blanchet@49208
   244
      else
blanchet@49210
   245
        let
blanchet@49221
   246
          (*avoid "'a itself" arguments in coiterators and corecursors*)
blanchet@49221
   247
          val mss' =  map (fn [0] => [1] | ms => ms) mss;
blanchet@49221
   248
blanchet@49211
   249
          val p_Tss =
blanchet@49210
   250
            map2 (fn C => fn n => replicate (Int.max (0, n - 1)) (C --> HOLogic.boolT)) Cs ns;
blanchet@49211
   251
blanchet@49254
   252
          fun zip_preds_getters [] [fs] = fs
blanchet@49254
   253
            | zip_preds_getters (p :: ps) (fs :: fss) = p :: fs @ zip_preds_getters ps fss;
blanchet@49215
   254
blanchet@49212
   255
          fun mk_types fun_Ts =
blanchet@49212
   256
            let
blanchet@49212
   257
              val f_sum_prod_Ts = map range_type fun_Ts;
blanchet@49255
   258
              val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts;
blanchet@49212
   259
              val f_Tsss =
blanchet@49221
   260
                map3 (fn C => map2 (map (curry (op -->) C) oo dest_tupleT)) Cs mss' f_prod_Tss;
blanchet@49254
   261
              val pf_Tss = map2 zip_preds_getters p_Tss f_Tsss
blanchet@49256
   262
            in (f_sum_prod_Ts, f_Tsss, pf_Tss) end;
blanchet@49176
   263
blanchet@49256
   264
          val (g_sum_prod_Ts, g_Tsss, pg_Tss) = mk_types fp_iter_fun_Ts;
blanchet@49256
   265
          val (h_sum_prod_Ts, h_Tsss, ph_Tss) = mk_types fp_rec_fun_Ts;
blanchet@49211
   266
blanchet@49233
   267
          val ((((Free (z, _), cs), pss), gsss), _) =
blanchet@49210
   268
            lthy
blanchet@49233
   269
            |> yield_singleton (mk_Frees "z") dummyT
blanchet@49233
   270
            ||>> mk_Frees "a" Cs
blanchet@49211
   271
            ||>> mk_Freess "p" p_Tss
blanchet@49210
   272
            ||>> mk_Freesss "g" g_Tsss;
blanchet@49210
   273
blanchet@49211
   274
          val hsss = map2 (map2 (map2 retype_free)) gsss h_Tsss;
blanchet@49211
   275
blanchet@49212
   276
          val cpss = map2 (fn c => map (fn p => p $ c)) cs pss;
blanchet@49212
   277
blanchet@49212
   278
          fun mk_terms fsss =
blanchet@49212
   279
            let
blanchet@49254
   280
              val pfss = map2 zip_preds_getters pss fsss;
blanchet@49212
   281
              val cfsss = map2 (fn c => map (map (fn f => f $ c))) cs fsss
blanchet@49212
   282
            in (pfss, cfsss) end;
blanchet@49210
   283
        in
blanchet@49212
   284
          ((([], [], []), ([], [], [])),
blanchet@49256
   285
           ([z], cs, cpss, (mk_terms gsss, (g_sum_prod_Ts, pg_Tss)),
blanchet@49256
   286
            (mk_terms hsss, (h_sum_prod_Ts, ph_Tss))))
blanchet@49210
   287
        end;
blanchet@49210
   288
blanchet@49212
   289
    fun pour_some_sugar_on_type (((((((((((((((((b, fpT), C), fld), unf), fp_iter), fp_rec),
blanchet@49212
   290
          fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_binders), ctr_mixfixes), ctr_Tss),
blanchet@49212
   291
        disc_binders), sel_binderss) no_defs_lthy =
blanchet@49176
   292
      let
blanchet@49201
   293
        val unfT = domain_type (fastype_of fld);
blanchet@49210
   294
        val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
blanchet@49255
   295
        val ctr_sum_prod_T = mk_sumTN_balanced ctr_prod_Ts;
blanchet@49134
   296
        val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
blanchet@49119
   297
blanchet@49176
   298
        val ((((u, v), fs), xss), _) =
blanchet@49204
   299
          no_defs_lthy
blanchet@49201
   300
          |> yield_singleton (mk_Frees "u") unfT
blanchet@49201
   301
          ||>> yield_singleton (mk_Frees "v") fpT
blanchet@49176
   302
          ||>> mk_Frees "f" case_Ts
blanchet@49124
   303
          ||>> mk_Freess "x" ctr_Tss;
blanchet@49121
   304
blanchet@49129
   305
        val ctr_rhss =
blanchet@49256
   306
          map2 (fn k => fn xs => fold_rev Term.lambda xs (fld $
blanchet@49256
   307
            mk_InN_balanced ctr_sum_prod_T n (HOLogic.mk_tuple xs) k)) ks xss;
blanchet@49121
   308
blanchet@49130
   309
        val case_binder = Binding.suffix_name ("_" ^ caseN) b;
blanchet@49129
   310
blanchet@49134
   311
        val case_rhs =
blanchet@49255
   312
          fold_rev Term.lambda (fs @ [v])
blanchet@49255
   313
            (mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (unf $ v));
blanchet@49129
   314
blanchet@49201
   315
        val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
blanchet@49169
   316
          |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
blanchet@49169
   317
               Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
blanchet@49201
   318
             (case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
blanchet@49121
   319
          ||> `Local_Theory.restore;
blanchet@49121
   320
blanchet@49121
   321
        (*transforms defined frees into consts (and more)*)
blanchet@49121
   322
        val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49121
   323
blanchet@49121
   324
        val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
blanchet@49130
   325
        val case_def = Morphism.thm phi raw_case_def;
blanchet@49130
   326
blanchet@49203
   327
        val ctrs0 = map (Morphism.term phi) raw_ctrs;
blanchet@49203
   328
        val casex0 = Morphism.term phi raw_case;
blanchet@49203
   329
blanchet@49203
   330
        val ctrs = map (mk_ctr As) ctrs0;
blanchet@49121
   331
blanchet@49135
   332
        fun exhaust_tac {context = ctxt, ...} =
blanchet@49123
   333
          let
blanchet@49135
   334
            val fld_iff_unf_thm =
blanchet@49135
   335
              let
blanchet@49135
   336
                val goal =
blanchet@49135
   337
                  fold_rev Logic.all [u, v]
blanchet@49135
   338
                    (mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u)));
blanchet@49135
   339
              in
blanchet@49135
   340
                Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49201
   341
                  mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT])
blanchet@49176
   342
                    (certify lthy fld) (certify lthy unf) fld_unf unf_fld)
blanchet@49135
   343
                |> Thm.close_derivation
blanchet@49135
   344
                |> Morphism.thm phi
blanchet@49135
   345
              end;
blanchet@49135
   346
blanchet@49135
   347
            val sumEN_thm' =
blanchet@49135
   348
              Local_Defs.unfold lthy @{thms all_unit_eq}
blanchet@49255
   349
                (Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) []
blanchet@49255
   350
                   (mk_sumEN_balanced n))
blanchet@49135
   351
              |> Morphism.thm phi;
blanchet@49123
   352
          in
blanchet@49161
   353
            mk_exhaust_tac ctxt n ctr_defs fld_iff_unf_thm sumEN_thm'
blanchet@49123
   354
          end;
blanchet@49121
   355
blanchet@49126
   356
        val inject_tacss =
blanchet@49205
   357
          map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} =>
blanchet@49205
   358
              mk_inject_tac ctxt ctr_def fld_inject]) ms ctr_defs;
blanchet@49126
   359
blanchet@49127
   360
        val half_distinct_tacss =
blanchet@49127
   361
          map (map (fn (def, def') => fn {context = ctxt, ...} =>
blanchet@49127
   362
            mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs);
blanchet@49127
   363
blanchet@49130
   364
        val case_tacs =
blanchet@49130
   365
          map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} =>
blanchet@49130
   366
            mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs;
blanchet@49121
   367
blanchet@49121
   368
        val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs];
blanchet@49134
   369
blanchet@49266
   370
        fun some_lfp_sugar ((selss, discIs, sel_thmss), no_defs_lthy) =
blanchet@49134
   371
          let
blanchet@49208
   372
            val fpT_to_C = fpT --> C;
blanchet@49199
   373
blanchet@49215
   374
            fun generate_iter_like (suf, fp_iter_like, (fss, f_Tss, xssss)) =
blanchet@49215
   375
              let
blanchet@49215
   376
                val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
blanchet@49215
   377
blanchet@49215
   378
                val binder = Binding.suffix_name ("_" ^ suf) b;
blanchet@49199
   379
blanchet@49215
   380
                val spec =
blanchet@49215
   381
                  mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binder, res_T)),
blanchet@49215
   382
                    Term.list_comb (fp_iter_like,
blanchet@49255
   383
                      map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss));
blanchet@49215
   384
              in (binder, spec) end;
blanchet@49199
   385
blanchet@49215
   386
            val iter_likes =
blanchet@49215
   387
              [(iterN, fp_iter, iter_only),
blanchet@49215
   388
               (recN, fp_rec, rec_only)];
blanchet@49215
   389
blanchet@49215
   390
            val (binders, specs) = map generate_iter_like iter_likes |> split_list;
blanchet@49215
   391
blanchet@49215
   392
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
blanchet@49201
   393
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49199
   394
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49215
   395
                #>> apsnd snd) binders specs
blanchet@49199
   396
              ||> `Local_Theory.restore;
blanchet@49201
   397
blanchet@49201
   398
            (*transforms defined frees into consts (and more)*)
blanchet@49201
   399
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49201
   400
blanchet@49215
   401
            val [iter_def, rec_def] = map (Morphism.thm phi) defs;
blanchet@49201
   402
blanchet@49215
   403
            val [iter, recx] = map (mk_iter_like As Cs o Morphism.term phi) csts;
blanchet@49134
   404
          in
blanchet@49266
   405
            ((ctrs, selss, iter, recx, v, xss, ctr_defs, discIs, sel_thmss, iter_def, rec_def),
blanchet@49266
   406
             lthy)
blanchet@49134
   407
          end;
blanchet@49134
   408
blanchet@49266
   409
        fun some_gfp_sugar ((selss, discIs, sel_thmss), no_defs_lthy) =
blanchet@49210
   410
          let
blanchet@49210
   411
            val B_to_fpT = C --> fpT;
blanchet@49211
   412
blanchet@49256
   413
            fun generate_coiter_like (suf, fp_iter_like, ((pfss, cfsss), (f_sum_prod_Ts, pf_Tss))) =
blanchet@49211
   414
              let
blanchet@49211
   415
                val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT;
blanchet@49210
   416
blanchet@49211
   417
                val binder = Binding.suffix_name ("_" ^ suf) b;
blanchet@49210
   418
blanchet@49256
   419
                fun mk_preds_getters_join c n cps sum_prod_T cfss =
blanchet@49211
   420
                  Term.lambda c (mk_IfN sum_prod_T cps
blanchet@49256
   421
                    (map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cfss) (1 upto n)));
blanchet@49210
   422
blanchet@49211
   423
                val spec =
blanchet@49212
   424
                  mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binder, res_T)),
blanchet@49211
   425
                    Term.list_comb (fp_iter_like,
blanchet@49256
   426
                      map5 mk_preds_getters_join cs ns cpss f_sum_prod_Ts cfsss));
blanchet@49211
   427
              in (binder, spec) end;
blanchet@49210
   428
blanchet@49212
   429
            val coiter_likes =
blanchet@49215
   430
              [(coiterN, fp_iter, coiter_only),
blanchet@49215
   431
               (corecN, fp_rec, corec_only)];
blanchet@49212
   432
blanchet@49211
   433
            val (binders, specs) = map generate_coiter_like coiter_likes |> split_list;
blanchet@49211
   434
blanchet@49211
   435
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
blanchet@49210
   436
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49210
   437
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49211
   438
                #>> apsnd snd) binders specs
blanchet@49210
   439
              ||> `Local_Theory.restore;
blanchet@49210
   440
blanchet@49210
   441
            (*transforms defined frees into consts (and more)*)
blanchet@49210
   442
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49210
   443
blanchet@49211
   444
            val [coiter_def, corec_def] = map (Morphism.thm phi) defs;
blanchet@49210
   445
blanchet@49211
   446
            val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts;
blanchet@49210
   447
          in
blanchet@49266
   448
            ((ctrs, selss, coiter, corec, v, xss, ctr_defs, discIs, sel_thmss, coiter_def,
blanchet@49266
   449
              corec_def), lthy)
blanchet@49210
   450
          end;
blanchet@49119
   451
      in
blanchet@49203
   452
        wrap_datatype tacss ((ctrs0, casex0), (disc_binders, sel_binderss)) lthy'
blanchet@49210
   453
        |> (if lfp then some_lfp_sugar else some_gfp_sugar)
blanchet@49119
   454
      end;
blanchet@49167
   455
blanchet@49226
   456
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
blanchet@49229
   457
    val map_ids = map map_id_of_bnf nested_bnfs;
blanchet@49226
   458
blanchet@49214
   459
    fun mk_map Ts Us t =
blanchet@49217
   460
      let val (Type (_, Ts0), Type (_, Us0)) = strip_map_type (fastype_of t) |>> List.last in
blanchet@49214
   461
        Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49214
   462
      end;
blanchet@49214
   463
blanchet@49234
   464
    fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) =
blanchet@49234
   465
      let
traytel@49236
   466
        val map0 = map_of_bnf (the (bnf_of lthy s));
blanchet@49234
   467
        val mapx = mk_map Ts Us map0;
blanchet@49234
   468
        val TUs = map dest_funT (fst (split_last (fst (strip_map_type (fastype_of mapx)))));
blanchet@49234
   469
        val args = map build_arg TUs;
blanchet@49234
   470
      in Term.list_comb (mapx, args) end;
blanchet@49234
   471
blanchet@49266
   472
    fun pour_more_sugar_on_lfps ((ctrss, _, iters, recs, vs, xsss, ctr_defss, _, _, iter_defs,
blanchet@49266
   473
        rec_defs), lthy) =
blanchet@49202
   474
      let
blanchet@49202
   475
        val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
blanchet@49212
   476
        val giters = map (lists_bmoc gss) iters;
blanchet@49212
   477
        val hrecs = map (lists_bmoc hss) recs;
blanchet@49201
   478
blanchet@49202
   479
        val (iter_thmss, rec_thmss) =
blanchet@49207
   480
          let
blanchet@49212
   481
            fun mk_goal_iter_like fss fiter_like xctr f xs fxs =
blanchet@49207
   482
              fold_rev (fold_rev Logic.all) (xs :: fss)
blanchet@49212
   483
                (mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs)));
blanchet@49204
   484
blanchet@49234
   485
            fun build_call fiter_likes maybe_tick (T, U) =
blanchet@49234
   486
              if T = U then
blanchet@49234
   487
                mk_id T
blanchet@49234
   488
              else
blanchet@49234
   489
                (case find_index (curry (op =) T) fpTs of
blanchet@49234
   490
                  ~1 => build_map (build_call fiter_likes maybe_tick) T U
blanchet@49234
   491
                | j => maybe_tick (nth vs j) (nth fiter_likes j));
blanchet@49233
   492
blanchet@49214
   493
            fun mk_U maybe_prodT =
blanchet@49214
   494
              typ_subst (map2 (fn fpT => fn C => (fpT, maybe_prodT fpT C)) fpTs Cs);
blanchet@49214
   495
blanchet@49214
   496
            fun repair_calls fiter_likes maybe_cons maybe_tick maybe_prodT (x as Free (_, T)) =
blanchet@49214
   497
              if member (op =) fpTs T then
blanchet@49233
   498
                maybe_cons x [build_call fiter_likes (K I) (T, mk_U (K I) T) $ x]
blanchet@49214
   499
              else if exists_subtype (member (op =) fpTs) T then
blanchet@49233
   500
                [build_call fiter_likes maybe_tick (T, mk_U maybe_prodT T) $ x]
blanchet@49214
   501
              else
blanchet@49214
   502
                [x];
blanchet@49214
   503
blanchet@49214
   504
            val gxsss = map (map (maps (repair_calls giters (K I) (K I) (K I)))) xsss;
blanchet@49214
   505
            val hxsss =
blanchet@49214
   506
              map (map (maps (repair_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss;
blanchet@49204
   507
blanchet@49212
   508
            val goal_iterss = map5 (map4 o mk_goal_iter_like gss) giters xctrss gss xsss gxsss;
blanchet@49212
   509
            val goal_recss = map5 (map4 o mk_goal_iter_like hss) hrecs xctrss hss xsss hxsss;
blanchet@49204
   510
blanchet@49203
   511
            val iter_tacss =
blanchet@49229
   512
              map2 (map o mk_iter_like_tac pre_map_defs map_ids iter_defs) fp_iter_thms ctr_defss;
blanchet@49203
   513
            val rec_tacss =
blanchet@49229
   514
              map2 (map o mk_iter_like_tac pre_map_defs map_ids rec_defs) fp_rec_thms ctr_defss;
blanchet@49202
   515
          in
blanchet@49266
   516
            (map2 (map2 (fn goal => fn tac =>
blanchet@49266
   517
                 Skip_Proof.prove lthy [] [] goal (tac o #context) |> Thm.close_derivation))
blanchet@49205
   518
               goal_iterss iter_tacss,
blanchet@49266
   519
             map2 (map2 (fn goal => fn tac =>
blanchet@49266
   520
                 Skip_Proof.prove lthy [] [] goal (tac o #context) |> Thm.close_derivation))
blanchet@49205
   521
               goal_recss rec_tacss)
blanchet@49202
   522
          end;
blanchet@49201
   523
blanchet@49226
   524
        val notes =
blanchet@49202
   525
          [(itersN, iter_thmss),
blanchet@49202
   526
           (recsN, rec_thmss)]
blanchet@49202
   527
          |> maps (fn (thmN, thmss) =>
blanchet@49202
   528
            map2 (fn b => fn thms =>
blanchet@49202
   529
                ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])]))
blanchet@49202
   530
              bs thmss);
blanchet@49202
   531
      in
blanchet@49202
   532
        lthy |> Local_Theory.notes notes |> snd
blanchet@49202
   533
      end;
blanchet@49202
   534
blanchet@49266
   535
    fun pour_more_sugar_on_gfps ((ctrss, selsss, coiters, corecs, vs, _, ctr_defss, discIss,
blanchet@49266
   536
        sel_thmsss, coiter_defs, corec_defs), lthy) =
blanchet@49212
   537
      let
blanchet@49233
   538
        val z = the_single zs;
blanchet@49233
   539
blanchet@49212
   540
        val gcoiters = map (lists_bmoc pgss) coiters;
blanchet@49212
   541
        val hcorecs = map (lists_bmoc phss) corecs;
blanchet@49212
   542
blanchet@49212
   543
        val (coiter_thmss, corec_thmss) =
blanchet@49212
   544
          let
blanchet@49232
   545
            fun mk_goal_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not);
blanchet@49212
   546
blanchet@49235
   547
            fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr m cfs' =
blanchet@49212
   548
              fold_rev (fold_rev Logic.all) ([c] :: pfss)
blanchet@49232
   549
                (Logic.list_implies (seq_conds mk_goal_cond n k cps,
blanchet@49235
   550
                   mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, take m cfs'))));
blanchet@49212
   551
blanchet@49234
   552
            fun build_call fiter_likes maybe_tack (T, U) =
blanchet@49234
   553
              if T = U then
blanchet@49234
   554
                mk_id T
blanchet@49234
   555
              else
blanchet@49234
   556
                (case find_index (curry (op =) U) fpTs of
blanchet@49234
   557
                  ~1 => build_map (build_call fiter_likes maybe_tack) T U
blanchet@49234
   558
                | j => maybe_tack (nth cs j, nth vs j) (nth fiter_likes j));
blanchet@49233
   559
blanchet@49232
   560
            fun mk_U maybe_sumT =
blanchet@49233
   561
              typ_subst (map2 (fn C => fn fpT => (maybe_sumT fpT C, fpT)) Cs fpTs);
blanchet@49212
   562
blanchet@49232
   563
            fun repair_calls fiter_likes maybe_sumT maybe_tack
blanchet@49232
   564
                (cf as Free (_, Type (_, [_, T])) $ _) =
blanchet@49232
   565
              if exists_subtype (member (op =) Cs) T then
blanchet@49233
   566
                build_call fiter_likes maybe_tack (T, mk_U maybe_sumT T) $ cf
blanchet@49232
   567
              else
blanchet@49232
   568
                cf;
blanchet@49232
   569
blanchet@49235
   570
            val cgsss' = map (map (map (repair_calls gcoiters (K I) (K I)))) cgsss;
blanchet@49235
   571
            val chsss' = map (map (map (repair_calls hcorecs (curry mk_sumT) (tack z)))) chsss;
blanchet@49212
   572
blanchet@49212
   573
            val goal_coiterss =
blanchet@49235
   574
              map8 (map4 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss mss cgsss';
blanchet@49233
   575
            val goal_corecss =
blanchet@49235
   576
              map8 (map4 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss mss chsss';
blanchet@49213
   577
blanchet@49213
   578
            val coiter_tacss =
blanchet@49229
   579
              map3 (map oo mk_coiter_like_tac coiter_defs map_ids) fp_iter_thms pre_map_defs
blanchet@49226
   580
                ctr_defss;
blanchet@49233
   581
            val corec_tacss =
blanchet@49233
   582
              map3 (map oo mk_coiter_like_tac corec_defs map_ids) fp_rec_thms pre_map_defs
blanchet@49233
   583
                ctr_defss;
blanchet@49212
   584
          in
blanchet@49213
   585
            (map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
blanchet@49213
   586
               goal_coiterss coiter_tacss,
blanchet@49233
   587
             map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
blanchet@49233
   588
               goal_corecss corec_tacss)
blanchet@49212
   589
          end;
blanchet@49212
   590
blanchet@49266
   591
        fun mk_disc_coiter_like_thms [_] = K []
blanchet@49266
   592
          | mk_disc_coiter_like_thms thms = map2 (curry (op RS)) thms;
blanchet@49266
   593
blanchet@49266
   594
        val disc_coiter_thmss = map2 mk_disc_coiter_like_thms coiter_thmss discIss;
blanchet@49266
   595
        val disc_corec_thmss = map2 mk_disc_coiter_like_thms corec_thmss discIss;
blanchet@49266
   596
blanchet@49266
   597
        fun mk_sel_coiter_like_thm coiter_like_thm sel sel_thm =
blanchet@49266
   598
          let
blanchet@49266
   599
            val (domT, ranT) = dest_funT (fastype_of sel);
blanchet@49266
   600
            val arg_cong' =
blanchet@49266
   601
              Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
blanchet@49266
   602
                [NONE, NONE, SOME (certify lthy sel)] arg_cong;
blanchet@49266
   603
            val sel_thm' = sel_thm RSN (2, trans);
blanchet@49266
   604
          in
blanchet@49266
   605
            (coiter_like_thm RS arg_cong') RS sel_thm'
blanchet@49266
   606
          end;
blanchet@49266
   607
blanchet@49266
   608
        val sel_coiter_thmsss =
blanchet@49266
   609
          map3 (map3 (map2 o mk_sel_coiter_like_thm)) coiter_thmss selsss sel_thmsss;
blanchet@49266
   610
        val sel_corec_thmsss =
blanchet@49266
   611
          map3 (map3 (map2 o mk_sel_coiter_like_thm)) coiter_thmss selsss sel_thmsss;
blanchet@49266
   612
blanchet@49212
   613
        val notes =
blanchet@49233
   614
          [(coitersN, coiter_thmss),
blanchet@49266
   615
           (disc_coitersN, disc_coiter_thmss),
blanchet@49266
   616
           (sel_coitersN, map flat sel_coiter_thmsss),
blanchet@49266
   617
           (corecsN, corec_thmss),
blanchet@49266
   618
           (disc_corecsN, disc_corec_thmss),
blanchet@49266
   619
           (sel_corecsN, map flat sel_corec_thmsss)]
blanchet@49212
   620
          |> maps (fn (thmN, thmss) =>
blanchet@49266
   621
            map_filter (fn (_, []) => NONE | (b, thms) =>
blanchet@49266
   622
              SOME ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []),
blanchet@49266
   623
                [(thms, [])])) (bs ~~ thmss));
blanchet@49212
   624
      in
blanchet@49230
   625
        lthy |> Local_Theory.notes notes |> snd
blanchet@49212
   626
      end;
blanchet@49212
   627
blanchet@49204
   628
    val lthy' = lthy
blanchet@49210
   629
      |> fold_map pour_some_sugar_on_type (bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~
blanchet@49212
   630
        fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_binderss ~~
blanchet@49212
   631
        ctr_mixfixess ~~ ctr_Tsss ~~ disc_binderss ~~ sel_bindersss)
blanchet@49266
   632
      |>> split_list11
blanchet@49212
   633
      |> (if lfp then pour_more_sugar_on_lfps else pour_more_sugar_on_gfps);
blanchet@49167
   634
blanchet@49167
   635
    val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
blanchet@49208
   636
      (if lfp then "" else "co") ^ "datatype"));
blanchet@49112
   637
  in
blanchet@49204
   638
    (timer; lthy')
blanchet@49112
   639
  end;
blanchet@49112
   640
blanchet@49199
   641
fun datatype_cmd info specs lthy =
blanchet@49121
   642
  let
blanchet@49209
   643
    (* TODO: cleaner handling of fake contexts, without "background_theory" *)
blanchet@49184
   644
    (*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a
blanchet@49184
   645
      locale and shadows an existing global type*)
blanchet@49179
   646
    val fake_thy = Theory.copy
blanchet@49184
   647
      #> fold (fn spec => perhaps (try (Sign.add_type lthy
blanchet@49184
   648
        (type_binder_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs;
blanchet@49179
   649
    val fake_lthy = Proof_Context.background_theory fake_thy lthy;
blanchet@49121
   650
  in
blanchet@49199
   651
    prepare_datatype Syntax.read_typ info specs fake_lthy lthy
blanchet@49121
   652
  end;
blanchet@49119
   653
blanchet@49129
   654
val parse_opt_binding_colon = Scan.optional (Parse.binding --| Parse.$$$ ":") no_binder
blanchet@49119
   655
blanchet@49112
   656
val parse_ctr_arg =
blanchet@49119
   657
  Parse.$$$ "(" |-- parse_opt_binding_colon -- Parse.typ --| Parse.$$$ ")" ||
blanchet@49129
   658
  (Parse.typ >> pair no_binder);
blanchet@49112
   659
blanchet@49112
   660
val parse_single_spec =
blanchet@49112
   661
  Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix --
blanchet@49119
   662
  (@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding --
blanchet@49119
   663
    Scan.repeat parse_ctr_arg -- Parse.opt_mixfix));
blanchet@49112
   664
blanchet@49112
   665
val _ =
blanchet@49112
   666
  Outer_Syntax.local_theory @{command_spec "data"} "define BNF-based inductive datatypes"
blanchet@49208
   667
    (Parse.and_list1 parse_single_spec >> datatype_cmd true);
blanchet@49112
   668
blanchet@49112
   669
val _ =
blanchet@49112
   670
  Outer_Syntax.local_theory @{command_spec "codata"} "define BNF-based coinductive datatypes"
blanchet@49208
   671
    (Parse.and_list1 parse_single_spec >> datatype_cmd false);
blanchet@49112
   672
blanchet@49112
   673
end;