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