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