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