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