src/HOL/Codatatype/Tools/bnf_fp_sugar.ML
author blanchet
Sat Sep 08 21:04:26 2012 +0200 (2012-09-08)
changeset 49203 262ab1ac38b9
parent 49202 f493cd25737f
child 49204 0b735fb2602e
permissions -rw-r--r--
repaired constant types
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@49112
    10
end;
blanchet@49112
    11
blanchet@49112
    12
structure BNF_FP_Sugar : BNF_FP_SUGAR =
blanchet@49112
    13
struct
blanchet@49112
    14
blanchet@49119
    15
open BNF_Util
blanchet@49119
    16
open BNF_Wrap
blanchet@49119
    17
open BNF_FP_Util
blanchet@49119
    18
open BNF_LFP
blanchet@49119
    19
open BNF_GFP
blanchet@49123
    20
open BNF_FP_Sugar_Tactics
blanchet@49119
    21
blanchet@49129
    22
val caseN = "case";
blanchet@49202
    23
val itersN = "iters";
blanchet@49202
    24
val recsN = "recs";
blanchet@49129
    25
blanchet@49199
    26
fun retype_free (Free (s, _)) T = Free (s, T);
blanchet@49199
    27
blanchet@49202
    28
fun flat_list_comb (f, xss) = fold (fn xs => fn t => Term.list_comb (t, xs)) xss f
blanchet@49202
    29
blanchet@49200
    30
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs));
blanchet@49200
    31
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs;
blanchet@49202
    32
fun mk_uncurried2_fun f xss =
blanchet@49200
    33
  mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss);
blanchet@49200
    34
blanchet@49124
    35
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
blanchet@49119
    36
blanchet@49119
    37
fun merge_type_arg_constrained ctxt (T, c) (T', c') =
blanchet@49119
    38
  if T = T' then
blanchet@49119
    39
    (case (c, c') of
blanchet@49119
    40
      (_, NONE) => (T, c)
blanchet@49119
    41
    | (NONE, _) => (T, c')
blanchet@49119
    42
    | _ =>
blanchet@49119
    43
      if c = c' then
blanchet@49119
    44
        (T, c)
blanchet@49119
    45
      else
blanchet@49119
    46
        error ("Inconsistent sort constraints for type variable " ^
blanchet@49119
    47
          quote (Syntax.string_of_typ ctxt T)))
blanchet@49119
    48
  else
blanchet@49119
    49
    cannot_merge_types ();
blanchet@49119
    50
blanchet@49119
    51
fun merge_type_args_constrained ctxt (cAs, cAs') =
blanchet@49119
    52
  if length cAs = length cAs' then map2 (merge_type_arg_constrained ctxt) cAs cAs'
blanchet@49119
    53
  else cannot_merge_types ();
blanchet@49119
    54
blanchet@49121
    55
fun type_args_constrained_of (((cAs, _), _), _) = cAs;
blanchet@49121
    56
val type_args_of = map fst o type_args_constrained_of;
blanchet@49129
    57
fun type_binder_of (((_, b), _), _) = b;
blanchet@49181
    58
fun mixfix_of ((_, mx), _) = mx;
blanchet@49121
    59
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
blanchet@49119
    60
blanchet@49121
    61
fun disc_of (((disc, _), _), _) = disc;
blanchet@49121
    62
fun ctr_of (((_, ctr), _), _) = ctr;
blanchet@49121
    63
fun args_of ((_, args), _) = args;
blanchet@49181
    64
fun ctr_mixfix_of (_, mx) = mx;
blanchet@49119
    65
blanchet@49199
    66
fun prepare_datatype prepare_typ gfp specs fake_lthy lthy =
blanchet@49112
    67
  let
blanchet@49121
    68
    val constrained_As =
blanchet@49121
    69
      map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs
blanchet@49119
    70
      |> Library.foldr1 (merge_type_args_constrained lthy);
blanchet@49121
    71
    val As = map fst constrained_As;
blanchet@49134
    72
    val As' = map dest_TFree As;
blanchet@49119
    73
blanchet@49121
    74
    val _ = (case duplicates (op =) As of [] => ()
blanchet@49165
    75
      | A :: _ => error ("Duplicate type parameter " ^ quote (Syntax.string_of_typ lthy A)));
blanchet@49119
    76
blanchet@49119
    77
    (* TODO: use sort constraints on type args *)
blanchet@49119
    78
blanchet@49119
    79
    val N = length specs;
blanchet@49119
    80
blanchet@49182
    81
    fun mk_fake_T b =
blanchet@49121
    82
      Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
blanchet@49121
    83
        As);
blanchet@49121
    84
blanchet@49129
    85
    val bs = map type_binder_of specs;
blanchet@49182
    86
    val fake_Ts = map mk_fake_T bs;
blanchet@49121
    87
blanchet@49181
    88
    val mixfixes = map mixfix_of specs;
blanchet@49119
    89
blanchet@49119
    90
    val _ = (case duplicates Binding.eq_name bs of [] => ()
blanchet@49119
    91
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
blanchet@49119
    92
blanchet@49121
    93
    val ctr_specss = map ctr_specs_of specs;
blanchet@49119
    94
blanchet@49129
    95
    val disc_binderss = map (map disc_of) ctr_specss;
blanchet@49129
    96
    val ctr_binderss = map (map ctr_of) ctr_specss;
blanchet@49121
    97
    val ctr_argsss = map (map args_of) ctr_specss;
blanchet@49181
    98
    val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
blanchet@49119
    99
blanchet@49129
   100
    val sel_bindersss = map (map (map fst)) ctr_argsss;
blanchet@49183
   101
    val fake_ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
blanchet@49121
   102
blanchet@49183
   103
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
blanchet@49167
   104
    val _ = (case subtract (op =) As' rhs_As' of
blanchet@49165
   105
        [] => ()
blanchet@49165
   106
      | A' :: _ => error ("Extra type variables on rhs: " ^
blanchet@49165
   107
          quote (Syntax.string_of_typ lthy (TFree A'))));
blanchet@49165
   108
blanchet@49176
   109
    val ((Cs, Xs), _) =
blanchet@49121
   110
      lthy
blanchet@49121
   111
      |> fold (fold (fn s => Variable.declare_typ (TFree (s, dummyS))) o type_args_of) specs
blanchet@49121
   112
      |> mk_TFrees N
blanchet@49176
   113
      ||>> mk_TFrees N;
blanchet@49119
   114
blanchet@49201
   115
    fun is_same_fpT (T as Type (s, Us)) (Type (s', Us')) =
blanchet@49146
   116
        s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
blanchet@49146
   117
          quote (Syntax.string_of_typ fake_lthy T)))
blanchet@49201
   118
      | is_same_fpT _ _ = false;
blanchet@49146
   119
blanchet@49201
   120
    fun freeze_fpXs (T as Type (s, Us)) =
blanchet@49201
   121
        (case find_index (is_same_fpT T) fake_Ts of
blanchet@49201
   122
          ~1 => Type (s, map freeze_fpXs Us)
blanchet@49176
   123
        | i => nth Xs i)
blanchet@49201
   124
      | freeze_fpXs T = T;
blanchet@49121
   125
blanchet@49201
   126
    val ctr_TsssXs = map (map (map freeze_fpXs)) fake_ctr_Tsss;
blanchet@49176
   127
    val sum_prod_TsXs = map (mk_sumTN o map HOLogic.mk_tupleT) ctr_TsssXs;
blanchet@49119
   128
blanchet@49176
   129
    val eqs = map dest_TFree Xs ~~ sum_prod_TsXs;
blanchet@49121
   130
blanchet@49203
   131
    val ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects), lthy') =
blanchet@49169
   132
      fp_bnf (if gfp then bnf_gfp else bnf_lfp) bs mixfixes As' eqs lthy;
blanchet@49121
   133
blanchet@49167
   134
    val timer = time (Timer.startRealTimer ());
blanchet@49167
   135
blanchet@49176
   136
    fun mk_unf_or_fld get_T Ts t =
blanchet@49176
   137
      let val Type (_, Ts0) = get_T (fastype_of t) in
blanchet@49124
   138
        Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49121
   139
      end;
blanchet@49119
   140
blanchet@49126
   141
    val mk_unf = mk_unf_or_fld domain_type;
blanchet@49126
   142
    val mk_fld = mk_unf_or_fld range_type;
blanchet@49121
   143
blanchet@49203
   144
    val unfs = map (mk_unf As) unfs0;
blanchet@49203
   145
    val flds = map (mk_fld As) flds0;
blanchet@49124
   146
blanchet@49201
   147
    val fpTs = map (domain_type o fastype_of) unfs;
blanchet@49201
   148
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs;
blanchet@49182
   149
blanchet@49203
   150
    val ns = map length ctr_Tsss;
blanchet@49203
   151
    val mss = map (map length) ctr_Tsss;
blanchet@49203
   152
    val Css = map2 replicate ns Cs;
blanchet@49203
   153
    val Cs' = flat Css;
blanchet@49203
   154
blanchet@49203
   155
    fun mk_iter_or_rec Ts Us c =
blanchet@49121
   156
      let
blanchet@49201
   157
        val (binders, body) = strip_type (fastype_of c);
blanchet@49203
   158
        val (fst_binders, last_binder) = split_last binders;
blanchet@49203
   159
        val Type (_, Ts0) = if gfp then body else last_binder;
blanchet@49203
   160
        val Us0 = map (if gfp then domain_type else body_type) fst_binders;
blanchet@49176
   161
      in
blanchet@49201
   162
        Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) c
blanchet@49176
   163
      end;
blanchet@49176
   164
blanchet@49203
   165
    val fp_iters = map (mk_iter_or_rec As Cs) fp_iters0;
blanchet@49203
   166
    val fp_recs = map (mk_iter_or_rec As Cs) fp_recs0;
blanchet@49176
   167
blanchet@49201
   168
    fun pour_sugar_on_type ((((((((((((((b, fpT), C), fld), unf), fp_iter), fp_rec), fld_unf),
blanchet@49176
   169
          unf_fld), fld_inject), ctr_binders), ctr_mixfixes), ctr_Tss), disc_binders), sel_binderss)
blanchet@49176
   170
        no_defs_lthy =
blanchet@49176
   171
      let
blanchet@49176
   172
        val n = length ctr_Tss;
blanchet@49121
   173
        val ks = 1 upto n;
blanchet@49121
   174
        val ms = map length ctr_Tss;
blanchet@49121
   175
blanchet@49201
   176
        val unfT = domain_type (fastype_of fld);
blanchet@49121
   177
        val prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
blanchet@49134
   178
        val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
blanchet@49119
   179
blanchet@49176
   180
        val ((((u, v), fs), xss), _) =
blanchet@49124
   181
          lthy
blanchet@49201
   182
          |> yield_singleton (mk_Frees "u") unfT
blanchet@49201
   183
          ||>> yield_singleton (mk_Frees "v") fpT
blanchet@49176
   184
          ||>> mk_Frees "f" case_Ts
blanchet@49124
   185
          ||>> mk_Freess "x" ctr_Tss;
blanchet@49121
   186
blanchet@49129
   187
        val ctr_rhss =
blanchet@49121
   188
          map2 (fn k => fn xs =>
blanchet@49121
   189
            fold_rev Term.lambda xs (fld $ mk_InN prod_Ts (HOLogic.mk_tuple xs) k)) ks xss;
blanchet@49121
   190
blanchet@49130
   191
        val case_binder = Binding.suffix_name ("_" ^ caseN) b;
blanchet@49129
   192
blanchet@49134
   193
        val case_rhs =
blanchet@49176
   194
          fold_rev Term.lambda (fs @ [v]) (mk_sum_caseN (map2 mk_uncurried_fun fs xss) $ (unf $ v));
blanchet@49129
   195
blanchet@49201
   196
        val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
blanchet@49169
   197
          |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
blanchet@49169
   198
               Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
blanchet@49201
   199
             (case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
blanchet@49121
   200
          ||> `Local_Theory.restore;
blanchet@49121
   201
blanchet@49121
   202
        (*transforms defined frees into consts (and more)*)
blanchet@49121
   203
        val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49121
   204
blanchet@49121
   205
        val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
blanchet@49130
   206
        val case_def = Morphism.thm phi raw_case_def;
blanchet@49130
   207
blanchet@49203
   208
        val ctrs0 = map (Morphism.term phi) raw_ctrs;
blanchet@49203
   209
        val casex0 = Morphism.term phi raw_case;
blanchet@49203
   210
blanchet@49203
   211
        val ctrs = map (mk_ctr As) ctrs0;
blanchet@49121
   212
blanchet@49135
   213
        fun exhaust_tac {context = ctxt, ...} =
blanchet@49123
   214
          let
blanchet@49135
   215
            val fld_iff_unf_thm =
blanchet@49135
   216
              let
blanchet@49135
   217
                val goal =
blanchet@49135
   218
                  fold_rev Logic.all [u, v]
blanchet@49135
   219
                    (mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u)));
blanchet@49135
   220
              in
blanchet@49135
   221
                Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49201
   222
                  mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT])
blanchet@49176
   223
                    (certify lthy fld) (certify lthy unf) fld_unf unf_fld)
blanchet@49135
   224
                |> Thm.close_derivation
blanchet@49135
   225
                |> Morphism.thm phi
blanchet@49135
   226
              end;
blanchet@49135
   227
blanchet@49135
   228
            val sumEN_thm' =
blanchet@49135
   229
              Local_Defs.unfold lthy @{thms all_unit_eq}
blanchet@49135
   230
                (Drule.instantiate' (map (SOME o certifyT lthy) prod_Ts) [] (mk_sumEN n))
blanchet@49135
   231
              |> Morphism.thm phi;
blanchet@49123
   232
          in
blanchet@49161
   233
            mk_exhaust_tac ctxt n ctr_defs fld_iff_unf_thm sumEN_thm'
blanchet@49123
   234
          end;
blanchet@49121
   235
blanchet@49126
   236
        val inject_tacss =
blanchet@49126
   237
          map2 (fn 0 => K []
blanchet@49126
   238
                 | _ => fn ctr_def => [fn {context = ctxt, ...} =>
blanchet@49126
   239
                     mk_inject_tac ctxt ctr_def fld_inject])
blanchet@49126
   240
            ms ctr_defs;
blanchet@49126
   241
blanchet@49127
   242
        val half_distinct_tacss =
blanchet@49127
   243
          map (map (fn (def, def') => fn {context = ctxt, ...} =>
blanchet@49127
   244
            mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs);
blanchet@49127
   245
blanchet@49130
   246
        val case_tacs =
blanchet@49130
   247
          map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} =>
blanchet@49130
   248
            mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs;
blanchet@49121
   249
blanchet@49121
   250
        val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs];
blanchet@49134
   251
blanchet@49176
   252
        (* (co)iterators, (co)recursors, (co)induction *)
blanchet@49176
   253
blanchet@49201
   254
        val is_fpT = member (op =) fpTs;
blanchet@49176
   255
blanchet@49200
   256
        fun dest_rec_pair (T as Type (@{type_name prod}, Us as [_, U])) =
blanchet@49200
   257
            if member (op =) Cs U then Us else [T]
blanchet@49200
   258
          | dest_rec_pair T = [T];
blanchet@49200
   259
blanchet@49199
   260
        fun sugar_datatype no_defs_lthy =
blanchet@49134
   261
          let
blanchet@49176
   262
            val fp_y_Ts = map domain_type (fst (split_last (binder_types (fastype_of fp_iter))));
blanchet@49176
   263
            val y_prod_Tss = map2 dest_sumTN ns fp_y_Ts;
blanchet@49176
   264
            val y_Tsss = map2 (map2 dest_tupleT) mss y_prod_Tss;
blanchet@49176
   265
            val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css;
blanchet@49201
   266
            val iter_T = flat g_Tss ---> fpT --> C;
blanchet@49146
   267
blanchet@49199
   268
            val fp_z_Ts = map domain_type (fst (split_last (binder_types (fastype_of fp_rec))));
blanchet@49199
   269
            val z_prod_Tss = map2 dest_sumTN ns fp_z_Ts;
blanchet@49199
   270
            val z_Tsss = map2 (map2 dest_tupleT) mss z_prod_Tss;
blanchet@49200
   271
            val z_Tssss = map (map (map dest_rec_pair)) z_Tsss;
blanchet@49200
   272
            val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css;
blanchet@49201
   273
            val rec_T = flat h_Tss ---> fpT --> C;
blanchet@49199
   274
blanchet@49176
   275
            val ((gss, ysss), _) =
blanchet@49199
   276
              no_defs_lthy
blanchet@49176
   277
              |> mk_Freess "f" g_Tss
blanchet@49177
   278
              ||>> mk_Freesss "x" y_Tsss;
blanchet@49134
   279
blanchet@49199
   280
            val hss = map2 (map2 retype_free) gss h_Tss;
blanchet@49200
   281
            val (zssss, _) =
blanchet@49199
   282
              no_defs_lthy
blanchet@49200
   283
              |> mk_Freessss "x" z_Tssss;
blanchet@49199
   284
blanchet@49199
   285
            val iter_binder = Binding.suffix_name ("_" ^ iterN) b;
blanchet@49199
   286
            val rec_binder = Binding.suffix_name ("_" ^ recN) b;
blanchet@49199
   287
blanchet@49199
   288
            val iter_free = Free (Binding.name_of iter_binder, iter_T);
blanchet@49199
   289
            val rec_free = Free (Binding.name_of rec_binder, rec_T);
blanchet@49199
   290
blanchet@49199
   291
            val iter_spec =
blanchet@49202
   292
              mk_Trueprop_eq (flat_list_comb (iter_free, gss),
blanchet@49199
   293
                Term.list_comb (fp_iter, map2 (mk_sum_caseN oo map2 mk_uncurried_fun) gss ysss));
blanchet@49199
   294
            val rec_spec =
blanchet@49202
   295
              mk_Trueprop_eq (flat_list_comb (rec_free, hss),
blanchet@49202
   296
                Term.list_comb (fp_rec, map2 (mk_sum_caseN oo map2 mk_uncurried2_fun) hss zssss));
blanchet@49199
   297
blanchet@49199
   298
            val (([raw_iter, raw_rec], [raw_iter_def, raw_rec_def]), (lthy', lthy)) = no_defs_lthy
blanchet@49201
   299
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49199
   300
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49201
   301
                #>> apsnd snd) [iter_binder, rec_binder] [iter_spec, rec_spec]
blanchet@49199
   302
              ||> `Local_Theory.restore;
blanchet@49201
   303
blanchet@49201
   304
            (*transforms defined frees into consts (and more)*)
blanchet@49201
   305
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49201
   306
blanchet@49201
   307
            val iter_def = Morphism.thm phi raw_iter_def;
blanchet@49201
   308
            val rec_def = Morphism.thm phi raw_rec_def;
blanchet@49201
   309
blanchet@49203
   310
            val iter0 = Morphism.term phi raw_iter;
blanchet@49203
   311
            val rec0 = Morphism.term phi raw_rec;
blanchet@49203
   312
blanchet@49203
   313
            val iter = mk_iter_or_rec As Cs' iter0;
blanchet@49203
   314
            val recx = mk_iter_or_rec As Cs' rec0;
blanchet@49134
   315
          in
blanchet@49202
   316
            ([[ctrs], [[iter]], [[recx]], xss, gss, hss], lthy)
blanchet@49134
   317
          end;
blanchet@49134
   318
blanchet@49202
   319
        fun sugar_codatatype no_defs_lthy = ([], no_defs_lthy);
blanchet@49119
   320
      in
blanchet@49203
   321
        wrap_datatype tacss ((ctrs0, casex0), (disc_binders, sel_binderss)) lthy'
blanchet@49199
   322
        |> (if gfp then sugar_codatatype else sugar_datatype)
blanchet@49119
   323
      end;
blanchet@49167
   324
blanchet@49202
   325
    fun pour_more_sugar_on_datatypes ([[ctrss], [[iters]], [[recs]], xsss, gsss, hsss], lthy) =
blanchet@49202
   326
      let
blanchet@49202
   327
        val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
blanchet@49202
   328
        val giters = map2 (curry flat_list_comb) iters gsss;
blanchet@49202
   329
        val hrecs = map2 (curry flat_list_comb) recs hsss;
blanchet@49201
   330
blanchet@49202
   331
        val (iter_thmss, rec_thmss) =
blanchet@49202
   332
          let
blanchet@49202
   333
            fun mk_goal_iter_or_rec fc xctr =
blanchet@49202
   334
              mk_Trueprop_eq (fc $ xctr, fc $ xctr);
blanchet@49201
   335
blanchet@49202
   336
            val goal_iterss = map2 (fn giter => map (mk_goal_iter_or_rec giter)) giters xctrss;
blanchet@49203
   337
            val goal_recss = map2 (fn hrec => map (mk_goal_iter_or_rec hrec)) hrecs xctrss;
blanchet@49203
   338
            val iter_tacss =
blanchet@49203
   339
              map (map (K (fn _ => Skip_Proof.cheat_tac (Proof_Context.theory_of lthy)))) goal_iterss;
blanchet@49203
   340
              (* ### map (map mk_iter_or_rec_tac); (* needs ctr_def, iter_def, fld_iter *) *)
blanchet@49203
   341
            val rec_tacss =
blanchet@49203
   342
              map (map (K (fn _ => Skip_Proof.cheat_tac (Proof_Context.theory_of lthy)))) goal_recss;
blanchet@49202
   343
          in
blanchet@49202
   344
            (map2 (map2 (Skip_Proof.prove lthy [] [])) goal_iterss iter_tacss,
blanchet@49202
   345
             map2 (map2 (Skip_Proof.prove lthy [] [])) goal_recss rec_tacss)
blanchet@49202
   346
          end;
blanchet@49201
   347
blanchet@49202
   348
        val notes =
blanchet@49202
   349
          [(itersN, iter_thmss),
blanchet@49202
   350
           (recsN, rec_thmss)]
blanchet@49202
   351
          |> maps (fn (thmN, thmss) =>
blanchet@49202
   352
            map2 (fn b => fn thms =>
blanchet@49202
   353
                ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])]))
blanchet@49202
   354
              bs thmss);
blanchet@49202
   355
      in
blanchet@49202
   356
        lthy |> Local_Theory.notes notes |> snd
blanchet@49202
   357
      end;
blanchet@49202
   358
blanchet@49202
   359
    val lthy'' = lthy'
blanchet@49202
   360
      |> fold_map pour_sugar_on_type (bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~ fp_recs ~~
blanchet@49176
   361
        fld_unfs ~~ unf_flds ~~ fld_injects ~~ ctr_binderss ~~ ctr_mixfixess ~~ ctr_Tsss ~~
blanchet@49202
   362
        disc_binderss ~~ sel_bindersss)
blanchet@49202
   363
      |> (if gfp then snd else pour_more_sugar_on_datatypes o apfst transpose);
blanchet@49167
   364
blanchet@49167
   365
    val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
blanchet@49167
   366
      (if gfp then "co" else "") ^ "datatype"));
blanchet@49112
   367
  in
blanchet@49167
   368
    (timer; lthy'')
blanchet@49112
   369
  end;
blanchet@49112
   370
blanchet@49199
   371
fun datatype_cmd info specs lthy =
blanchet@49121
   372
  let
blanchet@49184
   373
    (*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a
blanchet@49184
   374
      locale and shadows an existing global type*)
blanchet@49179
   375
    val fake_thy = Theory.copy
blanchet@49184
   376
      #> fold (fn spec => perhaps (try (Sign.add_type lthy
blanchet@49184
   377
        (type_binder_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs;
blanchet@49179
   378
    val fake_lthy = Proof_Context.background_theory fake_thy lthy;
blanchet@49121
   379
  in
blanchet@49199
   380
    prepare_datatype Syntax.read_typ info specs fake_lthy lthy
blanchet@49121
   381
  end;
blanchet@49119
   382
blanchet@49129
   383
val parse_opt_binding_colon = Scan.optional (Parse.binding --| Parse.$$$ ":") no_binder
blanchet@49119
   384
blanchet@49112
   385
val parse_ctr_arg =
blanchet@49119
   386
  Parse.$$$ "(" |-- parse_opt_binding_colon -- Parse.typ --| Parse.$$$ ")" ||
blanchet@49129
   387
  (Parse.typ >> pair no_binder);
blanchet@49112
   388
blanchet@49112
   389
val parse_single_spec =
blanchet@49112
   390
  Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix --
blanchet@49119
   391
  (@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding --
blanchet@49119
   392
    Scan.repeat parse_ctr_arg -- Parse.opt_mixfix));
blanchet@49112
   393
blanchet@49112
   394
val _ =
blanchet@49112
   395
  Outer_Syntax.local_theory @{command_spec "data"} "define BNF-based inductive datatypes"
blanchet@49199
   396
    (Parse.and_list1 parse_single_spec >> datatype_cmd false);
blanchet@49112
   397
blanchet@49112
   398
val _ =
blanchet@49112
   399
  Outer_Syntax.local_theory @{command_spec "codata"} "define BNF-based coinductive datatypes"
blanchet@49199
   400
    (Parse.and_list1 parse_single_spec >> datatype_cmd true);
blanchet@49112
   401
blanchet@49112
   402
end;