src/HOL/BNF/Tools/bnf_fp_def_sugar.ML
author blanchet
Tue Apr 23 17:15:44 2013 +0200 (2013-04-23)
changeset 51745 a06a3c777add
parent 51551 88d1d19fb74f
child 51746 5af40820948b
permissions -rw-r--r--
simplify "Inl () = Inr ()" as well (not entirely clear why this is necessary)
blanchet@49636
     1
(*  Title:      HOL/BNF/Tools/bnf_fp_def_sugar.ML
blanchet@49112
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@49112
     3
    Copyright   2012
blanchet@49112
     4
blanchet@49389
     5
Sugared datatype and codatatype constructions.
blanchet@49112
     6
*)
blanchet@49112
     7
blanchet@49636
     8
signature BNF_FP_DEF_SUGAR =
blanchet@49112
     9
sig
blanchet@49536
    10
  val datatypes: bool ->
blanchet@49308
    11
    (mixfix list -> (string * sort) list option -> binding list -> typ list * typ list list ->
blanchet@49591
    12
      BNF_Def.BNF list -> local_theory -> BNF_FP.fp_result * local_theory) ->
blanchet@49633
    13
    (bool * bool) * ((((typ * sort) list * binding) * mixfix) * ((((binding * binding) *
blanchet@49297
    14
      (binding * typ) list) * (binding * term) list) * mixfix) list) list ->
blanchet@49297
    15
    local_theory -> local_theory
blanchet@49308
    16
  val parse_datatype_cmd: bool ->
blanchet@49308
    17
    (mixfix list -> (string * sort) list option -> binding list -> typ list * typ list list ->
blanchet@49591
    18
      BNF_Def.BNF list -> local_theory -> BNF_FP.fp_result * local_theory) ->
blanchet@49308
    19
    (local_theory -> local_theory) parser
blanchet@49112
    20
end;
blanchet@49112
    21
blanchet@49636
    22
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR =
blanchet@49112
    23
struct
blanchet@49112
    24
blanchet@49119
    25
open BNF_Util
blanchet@49119
    26
open BNF_Wrap
blanchet@49214
    27
open BNF_Def
blanchet@49457
    28
open BNF_FP
blanchet@49636
    29
open BNF_FP_Def_Sugar_Tactics
blanchet@49119
    30
blanchet@49622
    31
(* This function could produce clashes in contrived examples (e.g., "x.A", "x.x_A", "y.A") *)
blanchet@49622
    32
fun quasi_unambiguous_case_names names =
blanchet@49622
    33
  let
blanchet@49622
    34
    val ps = map (`Long_Name.base_name) names;
blanchet@49622
    35
    val dups = Library.duplicates (op =) (map fst ps);
blanchet@49622
    36
    fun underscore s =
blanchet@49622
    37
      let val ss = space_explode Long_Name.separator s in
blanchet@49622
    38
        space_implode "_" (drop (length ss - 2) ss)
blanchet@49622
    39
      end;
blanchet@49622
    40
  in
blanchet@49622
    41
    map (fn (base, full) => if member (op =) dups base then underscore full else base) ps
blanchet@49622
    42
  end;
blanchet@49622
    43
blanchet@49591
    44
val mp_conj = @{thm mp_conj};
blanchet@49591
    45
blanchet@49300
    46
val simp_attrs = @{attributes [simp]};
blanchet@49585
    47
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs;
blanchet@49300
    48
traytel@50170
    49
fun split_list4 [] = ([], [], [], [])
traytel@50170
    50
  | split_list4 ((x1, x2, x3, x4) :: xs) =
traytel@50170
    51
    let val (xs1, xs2, xs3, xs4) = split_list4 xs;
traytel@50170
    52
    in (x1 :: xs1, x2 :: xs2, x3 :: xs3, x4 :: xs4) end;
blanchet@49214
    53
blanchet@49342
    54
fun resort_tfree S (TFree (s, _)) = TFree (s, S);
blanchet@49342
    55
blanchet@49214
    56
fun typ_subst inst (T as Type (s, Ts)) =
blanchet@49214
    57
    (case AList.lookup (op =) inst T of
blanchet@49214
    58
      NONE => Type (s, map (typ_subst inst) Ts)
blanchet@49214
    59
    | SOME T' => T')
blanchet@49214
    60
  | typ_subst inst T = the_default T (AList.lookup (op =) inst T);
blanchet@49205
    61
blanchet@49583
    62
fun variant_types ss Ss ctxt =
blanchet@49583
    63
  let
blanchet@49583
    64
    val (tfrees, _) =
blanchet@49583
    65
      fold_map2 (fn s => fn S => Name.variant s #> apfst (rpair S)) ss Ss (Variable.names_of ctxt);
blanchet@49583
    66
    val ctxt' = fold (Variable.declare_constraints o Logic.mk_type o TFree) tfrees ctxt;
blanchet@49583
    67
  in (tfrees, ctxt') end;
blanchet@49583
    68
blanchet@49297
    69
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs));
blanchet@49202
    70
blanchet@49200
    71
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs));
blanchet@49200
    72
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs;
blanchet@49200
    73
blanchet@49585
    74
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) =
blanchet@49585
    75
  Abs ("x", T1, Abs ("y", T2, Var (x, T2 --> T1 --> T3) $ Bound 0 $ Bound 1));
blanchet@49585
    76
blanchet@49585
    77
fun flip_rels lthy n thm =
blanchet@49585
    78
  let
blanchet@49585
    79
    val Rs = Term.add_vars (prop_of thm) [];
blanchet@49585
    80
    val Rs' = rev (drop (length Rs - n) Rs);
blanchet@49585
    81
    val cRs = map (fn f => (certify lthy (Var f), certify lthy (mk_flip f))) Rs';
blanchet@49585
    82
  in
blanchet@49585
    83
    Drule.cterm_instantiate cRs thm
blanchet@49585
    84
  end;
blanchet@49585
    85
blanchet@49536
    86
fun mk_ctor_or_dtor get_T Ts t =
blanchet@49536
    87
  let val Type (_, Ts0) = get_T (fastype_of t) in
blanchet@49536
    88
    Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49536
    89
  end;
blanchet@49536
    90
blanchet@49536
    91
val mk_ctor = mk_ctor_or_dtor range_type;
blanchet@49536
    92
val mk_dtor = mk_ctor_or_dtor domain_type;
blanchet@49536
    93
blanchet@49536
    94
fun mk_rec_like lfp Ts Us t =
blanchet@49536
    95
  let
blanchet@49536
    96
    val (bindings, body) = strip_type (fastype_of t);
blanchet@49536
    97
    val (f_Us, prebody) = split_last bindings;
blanchet@49536
    98
    val Type (_, Ts0) = if lfp then prebody else body;
blanchet@49536
    99
    val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us);
blanchet@49536
   100
  in
blanchet@49536
   101
    Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49536
   102
  end;
blanchet@49536
   103
blanchet@49536
   104
fun mk_map live Ts Us t =
blanchet@49536
   105
  let val (Type (_, Ts0), Type (_, Us0)) = strip_typeN (live + 1) (fastype_of t) |>> List.last in
blanchet@49536
   106
    Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49536
   107
  end;
blanchet@49536
   108
blanchet@49591
   109
fun mk_rel live Ts Us t =
blanchet@49591
   110
  let val [Type (_, Ts0), Type (_, Us0)] = binder_types (snd (strip_typeN live (fastype_of t))) in
blanchet@49591
   111
    Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
blanchet@49591
   112
  end;
blanchet@49591
   113
blanchet@49585
   114
fun liveness_of_fp_bnf n bnf =
blanchet@49585
   115
  (case T_of_bnf bnf of
blanchet@49585
   116
    Type (_, Ts) => map (not o member (op =) (deads_of_bnf bnf)) Ts
blanchet@49585
   117
  | _ => replicate n false);
blanchet@49536
   118
blanchet@49124
   119
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
blanchet@49119
   120
blanchet@49298
   121
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types ();
blanchet@49119
   122
blanchet@49298
   123
fun merge_type_args (As, As') =
blanchet@49298
   124
  if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types ();
blanchet@49119
   125
blanchet@49591
   126
fun reassoc_conjs thm =
blanchet@49591
   127
  reassoc_conjs (thm RS @{thm conj_assoc[THEN iffD1]})
blanchet@49591
   128
  handle THM _ => thm;
blanchet@49591
   129
blanchet@49121
   130
fun type_args_constrained_of (((cAs, _), _), _) = cAs;
blanchet@49336
   131
fun type_binding_of (((_, b), _), _) = b;
blanchet@49181
   132
fun mixfix_of ((_, mx), _) = mx;
blanchet@49121
   133
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
blanchet@49119
   134
blanchet@49286
   135
fun disc_of ((((disc, _), _), _), _) = disc;
blanchet@49286
   136
fun ctr_of ((((_, ctr), _), _), _) = ctr;
blanchet@49286
   137
fun args_of (((_, args), _), _) = args;
blanchet@49286
   138
fun defaults_of ((_, ds), _) = ds;
blanchet@49181
   139
fun ctr_mixfix_of (_, mx) = mx;
blanchet@49119
   140
blanchet@49633
   141
fun define_datatypes prepare_constraint prepare_typ prepare_term lfp construct_fp
blanchet@49633
   142
    (wrap_opts as (no_dests, rep_compat), specs) no_defs_lthy0 =
blanchet@49112
   143
  let
blanchet@49298
   144
    (* TODO: sanity checks on arguments *)
blanchet@49478
   145
    (* TODO: integration with function package ("size") *)
blanchet@49298
   146
blanchet@49286
   147
    val _ = if not lfp andalso no_dests then error "Cannot define destructor-less codatatypes"
blanchet@49278
   148
      else ();
blanchet@49278
   149
blanchet@49633
   150
    fun qualify mandatory fp_b_name =
blanchet@49633
   151
      Binding.qualify mandatory fp_b_name o (rep_compat ? Binding.qualify false rep_compat_prefix);
blanchet@49633
   152
blanchet@49367
   153
    val nn = length specs;
blanchet@49361
   154
    val fp_bs = map type_binding_of specs;
blanchet@49498
   155
    val fp_b_names = map Binding.name_of fp_bs;
blanchet@49498
   156
    val fp_common_name = mk_common_name fp_b_names;
blanchet@49298
   157
blanchet@49298
   158
    fun prepare_type_arg (ty, c) =
blanchet@49298
   159
      let val TFree (s, _) = prepare_typ no_defs_lthy0 ty in
blanchet@49298
   160
        TFree (s, prepare_constraint no_defs_lthy0 c)
blanchet@49298
   161
      end;
blanchet@49298
   162
blanchet@49298
   163
    val Ass0 = map (map prepare_type_arg o type_args_constrained_of) specs;
blanchet@49298
   164
    val unsorted_Ass0 = map (map (resort_tfree HOLogic.typeS)) Ass0;
blanchet@49298
   165
    val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0;
blanchet@49119
   166
blanchet@49585
   167
    val (((Bs0, Cs), Xs), no_defs_lthy) =
blanchet@49298
   168
      no_defs_lthy0
blanchet@49298
   169
      |> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As
blanchet@49585
   170
      |> mk_TFrees (length unsorted_As)
blanchet@49585
   171
      ||>> mk_TFrees nn
blanchet@49585
   172
      ||>> apfst (map TFree) o
blanchet@49585
   173
        variant_types (map (prefix "'") fp_b_names) (replicate nn HOLogic.typeS);
blanchet@49119
   174
blanchet@49298
   175
    (* TODO: cleaner handling of fake contexts, without "background_theory" *)
blanchet@49298
   176
    (*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a
blanchet@49298
   177
      locale and shadows an existing global type*)
blanchet@49298
   178
    val fake_thy =
blanchet@49298
   179
      Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy
blanchet@49336
   180
        (type_binding_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs;
blanchet@49298
   181
    val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy;
blanchet@49119
   182
blanchet@49182
   183
    fun mk_fake_T b =
blanchet@49121
   184
      Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
blanchet@49298
   185
        unsorted_As);
blanchet@49121
   186
blanchet@49302
   187
    val fake_Ts = map mk_fake_T fp_bs;
blanchet@49121
   188
blanchet@49181
   189
    val mixfixes = map mixfix_of specs;
blanchet@49119
   190
blanchet@49302
   191
    val _ = (case duplicates Binding.eq_name fp_bs of [] => ()
blanchet@49119
   192
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
blanchet@49119
   193
blanchet@49121
   194
    val ctr_specss = map ctr_specs_of specs;
blanchet@49119
   195
blanchet@49336
   196
    val disc_bindingss = map (map disc_of) ctr_specss;
blanchet@49336
   197
    val ctr_bindingss =
blanchet@49633
   198
      map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss;
blanchet@49121
   199
    val ctr_argsss = map (map args_of) ctr_specss;
blanchet@49181
   200
    val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
blanchet@49119
   201
blanchet@49336
   202
    val sel_bindingsss = map (map (map fst)) ctr_argsss;
blanchet@49298
   203
    val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
blanchet@49286
   204
    val raw_sel_defaultsss = map (map defaults_of) ctr_specss;
blanchet@49286
   205
blanchet@49308
   206
    val (As :: _) :: fake_ctr_Tsss =
blanchet@49298
   207
      burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0);
blanchet@49298
   208
blanchet@49298
   209
    val _ = (case duplicates (op =) unsorted_As of [] => ()
blanchet@49298
   210
      | A :: _ => error ("Duplicate type parameter " ^
blanchet@49298
   211
          quote (Syntax.string_of_typ no_defs_lthy A)));
blanchet@49298
   212
blanchet@49183
   213
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
blanchet@49298
   214
    val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of
blanchet@49165
   215
        [] => ()
blanchet@49342
   216
      | A' :: _ => error ("Extra type variable on right-hand side: " ^
blanchet@49204
   217
          quote (Syntax.string_of_typ no_defs_lthy (TFree A'))));
blanchet@49165
   218
blanchet@49591
   219
    fun eq_fpT_check (T as Type (s, Us)) (Type (s', Us')) =
blanchet@49146
   220
        s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
blanchet@49146
   221
          quote (Syntax.string_of_typ fake_lthy T)))
blanchet@49591
   222
      | eq_fpT_check _ _ = false;
blanchet@49146
   223
blanchet@49204
   224
    fun freeze_fp (T as Type (s, Us)) =
blanchet@49591
   225
        (case find_index (eq_fpT_check T) fake_Ts of
blanchet@49591
   226
          ~1 => Type (s, map freeze_fp Us)
blanchet@49591
   227
        | kk => nth Xs kk)
blanchet@49204
   228
      | freeze_fp T = T;
blanchet@49121
   229
blanchet@49536
   230
    val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss;
blanchet@49536
   231
    val ctr_sum_prod_TsXs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssXs;
blanchet@49119
   232
blanchet@49298
   233
    val fp_eqs =
blanchet@49536
   234
      map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs;
blanchet@49121
   235
blanchet@49585
   236
    (* TODO: clean up list *)
blanchet@49585
   237
    val (pre_bnfs, ((fp_bnfs as any_fp_bnf :: _, dtors0, ctors0, fp_folds0, fp_recs0, fp_induct,
blanchet@49591
   238
           fp_strong_induct, dtor_ctors, ctor_dtors, ctor_injects, fp_map_thms, fp_set_thmss,
blanchet@49591
   239
           fp_rel_thms, fp_fold_thms, fp_rec_thms), lthy)) =
blanchet@49585
   240
      fp_bnf construct_fp fp_bs mixfixes (map dest_TFree unsorted_As) fp_eqs no_defs_lthy0;
blanchet@49585
   241
blanchet@49585
   242
    val timer = time (Timer.startRealTimer ());
blanchet@49121
   243
blanchet@49670
   244
    fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) =
blanchet@49670
   245
      let
blanchet@49670
   246
        val bnf = the (bnf_of lthy s);
blanchet@49670
   247
        val live = live_of_bnf bnf;
blanchet@49670
   248
        val mapx = mk_map live Ts Us (map_of_bnf bnf);
blanchet@49670
   249
        val TUs' = map dest_funT (fst (strip_typeN live (fastype_of mapx)));
blanchet@49670
   250
      in Term.list_comb (mapx, map build_arg TUs') end;
blanchet@49670
   251
blanchet@49670
   252
    fun build_rel_step build_arg (Type (s, Ts)) =
blanchet@49670
   253
      let
blanchet@49670
   254
        val bnf = the (bnf_of lthy s);
blanchet@49670
   255
        val live = live_of_bnf bnf;
blanchet@49670
   256
        val rel = mk_rel live Ts Ts (rel_of_bnf bnf);
blanchet@49670
   257
        val Ts' = map domain_type (fst (strip_typeN live (fastype_of rel)));
blanchet@49670
   258
      in Term.list_comb (rel, map build_arg Ts') end;
blanchet@49670
   259
blanchet@49363
   260
    fun add_nesty_bnf_names Us =
blanchet@49226
   261
      let
blanchet@49226
   262
        fun add (Type (s, Ts)) ss =
blanchet@49226
   263
            let val (needs, ss') = fold_map add Ts ss in
blanchet@49226
   264
              if exists I needs then (true, insert (op =) s ss') else (false, ss')
blanchet@49226
   265
            end
blanchet@49363
   266
          | add T ss = (member (op =) Us T, ss);
blanchet@49226
   267
      in snd oo add end;
blanchet@49226
   268
blanchet@49363
   269
    fun nesty_bnfs Us =
blanchet@49536
   270
      map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssXs []);
blanchet@49363
   271
blanchet@49363
   272
    val nesting_bnfs = nesty_bnfs As;
blanchet@49536
   273
    val nested_bnfs = nesty_bnfs Xs;
blanchet@49226
   274
blanchet@49585
   275
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
blanchet@49585
   276
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
blanchet@49585
   277
    val pre_rel_defs = map rel_def_of_bnf pre_bnfs;
blanchet@49683
   278
    val nested_map_comps'' = map ((fn thm => thm RS sym) o map_comp_of_bnf) nested_bnfs;
blanchet@49670
   279
    val nested_map_comp's = map map_comp'_of_bnf nested_bnfs;
blanchet@49670
   280
    val nested_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nested_bnfs;
blanchet@49671
   281
    val nesting_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nesting_bnfs;
blanchet@49585
   282
    val nested_set_natural's = maps set_natural'_of_bnf nested_bnfs;
blanchet@49585
   283
    val nesting_set_natural's = maps set_natural'_of_bnf nesting_bnfs;
blanchet@49585
   284
blanchet@49585
   285
    val live = live_of_bnf any_fp_bnf;
blanchet@49585
   286
blanchet@49585
   287
    val Bs =
blanchet@49585
   288
      map3 (fn alive => fn A as TFree (_, S) => fn B => if alive then resort_tfree S B else A)
blanchet@49585
   289
        (liveness_of_fp_bnf (length As) any_fp_bnf) As Bs0;
blanchet@49585
   290
blanchet@49585
   291
    val B_ify = Term.typ_subst_atomic (As ~~ Bs);
blanchet@49167
   292
blanchet@49501
   293
    val ctors = map (mk_ctor As) ctors0;
blanchet@49501
   294
    val dtors = map (mk_dtor As) dtors0;
blanchet@49124
   295
blanchet@49501
   296
    val fpTs = map (domain_type o fastype_of) dtors;
blanchet@49362
   297
blanchet@49362
   298
    val exists_fp_subtype = exists_subtype (member (op =) fpTs);
blanchet@49670
   299
    val exists_Cs_subtype = exists_subtype (member (op =) Cs);
blanchet@49362
   300
blanchet@49536
   301
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs;
blanchet@49203
   302
    val ns = map length ctr_Tsss;
blanchet@49212
   303
    val kss = map (fn n => 1 upto n) ns;
blanchet@49203
   304
    val mss = map (map length) ctr_Tsss;
blanchet@49203
   305
    val Css = map2 replicate ns Cs;
blanchet@49203
   306
blanchet@49585
   307
    val fp_folds as any_fp_fold :: _ = map (mk_rec_like lfp As Cs) fp_folds0;
blanchet@49585
   308
    val fp_recs as any_fp_rec :: _ = map (mk_rec_like lfp As Cs) fp_recs0;
blanchet@49210
   309
blanchet@49585
   310
    val fp_fold_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_fold)));
blanchet@49585
   311
    val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_rec)));
blanchet@49204
   312
blanchet@49504
   313
    val (((fold_only as (gss, _, _), rec_only as (hss, _, _)),
blanchet@49683
   314
          (cs, cpss, unfold_only as ((pgss, crssss, cgssss), (_, g_Tsss, _)),
blanchet@49683
   315
           corec_only as ((phss, csssss, chssss), (_, h_Tsss, _)))), names_lthy0) =
blanchet@49208
   316
      if lfp then
blanchet@49208
   317
        let
blanchet@49208
   318
          val y_Tsss =
blanchet@49255
   319
            map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type)
blanchet@49504
   320
              ns mss fp_fold_fun_Ts;
blanchet@49208
   321
          val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css;
blanchet@49208
   322
blanchet@49484
   323
          val ((gss, ysss), lthy) =
blanchet@49208
   324
            lthy
blanchet@49208
   325
            |> mk_Freess "f" g_Tss
blanchet@49208
   326
            ||>> mk_Freesss "x" y_Tsss;
blanchet@49670
   327
blanchet@49670
   328
          fun proj_recT proj (Type (s as @{type_name prod}, Ts as [T, U])) =
blanchet@49670
   329
              if member (op =) fpTs T then proj (T, U) else Type (s, map (proj_recT proj) Ts)
blanchet@49670
   330
            | proj_recT proj (Type (s, Ts)) = Type (s, map (proj_recT proj) Ts)
blanchet@49670
   331
            | proj_recT _ T = T;
blanchet@49274
   332
blanchet@49670
   333
          fun unzip_recT T =
blanchet@49670
   334
            if exists_fp_subtype T then [proj_recT fst T, proj_recT snd T] else [T];
blanchet@49204
   335
blanchet@49670
   336
          val z_Tsss =
blanchet@49670
   337
            map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type)
blanchet@49670
   338
              ns mss fp_rec_fun_Ts;
blanchet@49670
   339
          val z_Tssss = map (map (map unzip_recT)) z_Tsss;
blanchet@49208
   340
          val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css;
blanchet@49204
   341
blanchet@49298
   342
          val hss = map2 (map2 retype_free) h_Tss gss;
blanchet@49670
   343
          val zsss = map2 (map2 (map2 retype_free)) z_Tsss ysss;
blanchet@49210
   344
        in
blanchet@49670
   345
          ((((gss, g_Tss, ysss), (hss, h_Tss, zsss)),
blanchet@49683
   346
            ([], [], (([], [], []), ([], [], [])), (([], [], []), ([], [], [])))), lthy)
blanchet@49210
   347
        end
blanchet@49208
   348
      else
blanchet@49210
   349
        let
blanchet@49221
   350
          (*avoid "'a itself" arguments in coiterators and corecursors*)
blanchet@49221
   351
          val mss' =  map (fn [0] => [1] | ms => ms) mss;
blanchet@49221
   352
blanchet@49463
   353
          val p_Tss = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs;
blanchet@49275
   354
blanchet@49587
   355
          fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss);
blanchet@49211
   356
blanchet@49587
   357
          fun flat_preds_predsss_gettersss [] [qss] [fss] = flat_predss_getterss qss fss
blanchet@49587
   358
            | flat_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) =
blanchet@49587
   359
              p :: flat_predss_getterss qss fss @ flat_preds_predsss_gettersss ps qsss fsss;
blanchet@49274
   360
blanchet@49681
   361
          fun mk_types maybe_unzipT fun_Ts =
blanchet@49212
   362
            let
blanchet@49212
   363
              val f_sum_prod_Ts = map range_type fun_Ts;
blanchet@49255
   364
              val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts;
blanchet@49681
   365
              val f_Tsss = map2 (map2 dest_tupleT) mss' f_prod_Tss;
blanchet@49275
   366
              val f_Tssss =
blanchet@49681
   367
                map2 (fn C => map (map (map (curry (op -->) C) o maybe_unzipT))) Cs f_Tsss;
blanchet@49275
   368
              val q_Tssss =
blanchet@49463
   369
                map (map (map (fn [_] => [] | [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss;
blanchet@49587
   370
              val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss;
blanchet@49681
   371
            in (q_Tssss, f_sum_prod_Ts, f_Tsss, f_Tssss, pf_Tss) end;
blanchet@49176
   372
blanchet@49681
   373
          val (r_Tssss, g_sum_prod_Ts, g_Tsss, g_Tssss, pg_Tss) = mk_types single fp_fold_fun_Ts;
blanchet@49211
   374
blanchet@49683
   375
          val (((cs, pss), gssss), lthy) =
blanchet@49210
   376
            lthy
blanchet@49683
   377
            |> mk_Frees "a" Cs
blanchet@49211
   378
            ||>> mk_Freess "p" p_Tss
blanchet@49275
   379
            ||>> mk_Freessss "g" g_Tssss;
blanchet@49275
   380
          val rssss = map (map (map (fn [] => []))) r_Tssss;
blanchet@49274
   381
blanchet@49681
   382
          fun proj_corecT proj (Type (s as @{type_name sum}, Ts as [T, U])) =
blanchet@49681
   383
              if member (op =) fpTs T then proj (T, U) else Type (s, map (proj_corecT proj) Ts)
blanchet@49681
   384
            | proj_corecT proj (Type (s, Ts)) = Type (s, map (proj_corecT proj) Ts)
blanchet@49681
   385
            | proj_corecT _ T = T;
blanchet@49274
   386
blanchet@49681
   387
          fun unzip_corecT T =
blanchet@49681
   388
            if exists_fp_subtype T then [proj_corecT fst T, proj_corecT snd T] else [T];
blanchet@49681
   389
blanchet@49681
   390
          val (s_Tssss, h_sum_prod_Ts, h_Tsss, h_Tssss, ph_Tss) =
blanchet@49681
   391
            mk_types unzip_corecT fp_rec_fun_Ts;
blanchet@49210
   392
blanchet@49298
   393
          val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss;
blanchet@49484
   394
          val ((sssss, hssss_tl), lthy) =
blanchet@49275
   395
            lthy
blanchet@49275
   396
            |> mk_Freessss "q" s_Tssss
blanchet@49275
   397
            ||>> mk_Freessss "h" (map (map (map tl)) h_Tssss);
blanchet@49275
   398
          val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl;
blanchet@49211
   399
blanchet@49681
   400
          val cpss = map2 (map o rapp) cs pss;
blanchet@49212
   401
blanchet@49683
   402
          fun mk_terms qssss fssss =
blanchet@49212
   403
            let
blanchet@49587
   404
              val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss;
blanchet@49681
   405
              val cqssss = map2 (map o map o map o rapp) cs qssss;
blanchet@49681
   406
              val cfssss = map2 (map o map o map o rapp) cs fssss;
blanchet@49683
   407
            in (pfss, cqssss, cfssss) end;
blanchet@49210
   408
        in
blanchet@49484
   409
          (((([], [], []), ([], [], [])),
blanchet@49683
   410
            (cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, g_Tsss, pg_Tss)),
blanchet@49683
   411
             (mk_terms sssss hssss, (h_sum_prod_Ts, h_Tsss, ph_Tss)))), lthy)
blanchet@49210
   412
        end;
blanchet@49210
   413
blanchet@49585
   414
    fun define_ctrs_case_for_type (((((((((((((((((((((((((fp_bnf, fp_b), fpT), C), ctor), dtor),
blanchet@49585
   415
            fp_fold), fp_rec), ctor_dtor), dtor_ctor), ctor_inject), pre_map_def), pre_set_defs),
blanchet@49585
   416
          pre_rel_def), fp_map_thm), fp_set_thms), fp_rel_thm), n), ks), ms), ctr_bindings),
blanchet@49585
   417
        ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy =
blanchet@49176
   418
      let
blanchet@49498
   419
        val fp_b_name = Binding.name_of fp_b;
blanchet@49498
   420
blanchet@49501
   421
        val dtorT = domain_type (fastype_of ctor);
blanchet@49210
   422
        val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
blanchet@49255
   423
        val ctr_sum_prod_T = mk_sumTN_balanced ctr_prod_Ts;
blanchet@49134
   424
        val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
blanchet@49119
   425
blanchet@49593
   426
        val (((((w, fs), xss), yss), u'), names_lthy) =
blanchet@49204
   427
          no_defs_lthy
blanchet@49501
   428
          |> yield_singleton (mk_Frees "w") dtorT
blanchet@49176
   429
          ||>> mk_Frees "f" case_Ts
blanchet@49370
   430
          ||>> mk_Freess "x" ctr_Tss
blanchet@49585
   431
          ||>> mk_Freess "y" (map (map B_ify) ctr_Tss)
blanchet@49498
   432
          ||>> yield_singleton Variable.variant_fixes fp_b_name;
blanchet@49370
   433
blanchet@49498
   434
        val u = Free (u', fpT);
blanchet@49121
   435
blanchet@49585
   436
        val tuple_xs = map HOLogic.mk_tuple xss;
blanchet@49585
   437
        val tuple_ys = map HOLogic.mk_tuple yss;
blanchet@49585
   438
blanchet@49129
   439
        val ctr_rhss =
blanchet@49585
   440
          map3 (fn k => fn xs => fn tuple_x => fold_rev Term.lambda xs (ctor $
blanchet@49585
   441
            mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs;
blanchet@49121
   442
blanchet@49633
   443
        val case_binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ caseN) fp_b);
blanchet@49129
   444
blanchet@49134
   445
        val case_rhs =
blanchet@49498
   446
          fold_rev Term.lambda (fs @ [u])
blanchet@49501
   447
            (mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u));
blanchet@49129
   448
blanchet@49201
   449
        val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
blanchet@49169
   450
          |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
blanchet@49302
   451
              Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
blanchet@49336
   452
            (case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
blanchet@49121
   453
          ||> `Local_Theory.restore;
blanchet@49121
   454
blanchet@49121
   455
        val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49121
   456
blanchet@49121
   457
        val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
blanchet@49585
   458
        val ctr_defs' =
blanchet@49585
   459
          map2 (fn m => fn def => mk_unabs_def m (def RS meta_eq_to_obj_eq)) ms ctr_defs;
blanchet@49130
   460
        val case_def = Morphism.thm phi raw_case_def;
blanchet@49130
   461
blanchet@49203
   462
        val ctrs0 = map (Morphism.term phi) raw_ctrs;
blanchet@49203
   463
        val casex0 = Morphism.term phi raw_case;
blanchet@49203
   464
blanchet@49203
   465
        val ctrs = map (mk_ctr As) ctrs0;
blanchet@49121
   466
blanchet@49585
   467
        fun wrap lthy =
blanchet@49123
   468
          let
traytel@50170
   469
            fun exhaust_tac {context = ctxt, prems = _} =
blanchet@49135
   470
              let
blanchet@49585
   471
                val ctor_iff_dtor_thm =
blanchet@49585
   472
                  let
blanchet@49585
   473
                    val goal =
blanchet@49585
   474
                      fold_rev Logic.all [w, u]
blanchet@49585
   475
                        (mk_Trueprop_eq (HOLogic.mk_eq (u, ctor $ w), HOLogic.mk_eq (dtor $ u, w)));
blanchet@49585
   476
                  in
wenzelm@51551
   477
                    Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49585
   478
                      mk_ctor_iff_dtor_tac ctxt (map (SOME o certifyT lthy) [dtorT, fpT])
blanchet@49585
   479
                        (certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor)
blanchet@49585
   480
                    |> Thm.close_derivation
blanchet@49585
   481
                    |> Morphism.thm phi
blanchet@49585
   482
                  end;
blanchet@49585
   483
blanchet@49585
   484
                val sumEN_thm' =
blanchet@49585
   485
                  unfold_thms lthy @{thms all_unit_eq}
blanchet@49585
   486
                    (Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) []
blanchet@49585
   487
                       (mk_sumEN_balanced n))
blanchet@49585
   488
                  |> Morphism.thm phi;
blanchet@49135
   489
              in
blanchet@49585
   490
                mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm'
blanchet@49135
   491
              end;
blanchet@49135
   492
blanchet@49585
   493
            val inject_tacss =
blanchet@49585
   494
              map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} =>
blanchet@49585
   495
                  mk_inject_tac ctxt ctr_def ctor_inject]) ms ctr_defs;
blanchet@49585
   496
blanchet@49585
   497
            val half_distinct_tacss =
blanchet@49585
   498
              map (map (fn (def, def') => fn {context = ctxt, ...} =>
blanchet@49585
   499
                mk_half_distinct_tac ctxt ctor_inject [def, def'])) (mk_half_pairss (`I ctr_defs));
blanchet@49585
   500
blanchet@49585
   501
            val case_tacs =
blanchet@49585
   502
              map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} =>
blanchet@49585
   503
                mk_case_tac ctxt n k m case_def ctr_def dtor_ctor) ks ms ctr_defs;
blanchet@49585
   504
blanchet@49585
   505
            val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs];
blanchet@49585
   506
blanchet@49585
   507
            val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss
blanchet@49123
   508
          in
blanchet@49633
   509
            wrap_datatype tacss (((wrap_opts, ctrs0), casex0), (disc_bindings, (sel_bindingss,
blanchet@49585
   510
              sel_defaultss))) lthy
blanchet@49123
   511
          end;
blanchet@49121
   512
blanchet@49585
   513
        fun derive_maps_sets_rels (wrap_res, lthy) =
blanchet@49585
   514
          let
blanchet@49585
   515
            val rel_flip = rel_flip_of_bnf fp_bnf;
blanchet@49585
   516
            val nones = replicate live NONE;
blanchet@49585
   517
blanchet@49585
   518
            val ctor_cong =
blanchet@49585
   519
              if lfp then Drule.dummy_thm
blanchet@49585
   520
              else cterm_instantiate_pos [NONE, NONE, SOME (certify lthy ctor)] arg_cong;
blanchet@49585
   521
blanchet@49585
   522
            fun mk_cIn ify =
blanchet@49585
   523
              certify lthy o (not lfp ? curry (op $) (map_types ify ctor)) oo
blanchet@49585
   524
              mk_InN_balanced (ify ctr_sum_prod_T) n;
blanchet@49585
   525
blanchet@49585
   526
            val cxIns = map2 (mk_cIn I) tuple_xs ks;
blanchet@49585
   527
            val cyIns = map2 (mk_cIn B_ify) tuple_ys ks;
blanchet@49585
   528
blanchet@49682
   529
            fun mk_map_thm ctr_def' cxIn =
blanchet@49585
   530
              fold_thms lthy [ctr_def']
blanchet@49585
   531
                (unfold_thms lthy (pre_map_def ::
blanchet@49585
   532
                     (if lfp then [] else [ctor_dtor, dtor_ctor]) @ sum_prod_thms_map)
blanchet@49585
   533
                   (cterm_instantiate_pos (nones @ [SOME cxIn])
blanchet@49585
   534
                      (if lfp then fp_map_thm else fp_map_thm RS ctor_cong)))
blanchet@49593
   535
              |> singleton (Proof_Context.export names_lthy no_defs_lthy);
blanchet@49585
   536
blanchet@49682
   537
            fun mk_set_thm fp_set_thm ctr_def' cxIn =
blanchet@49585
   538
              fold_thms lthy [ctr_def']
blanchet@49585
   539
                (unfold_thms lthy (pre_set_defs @ nested_set_natural's @ nesting_set_natural's @
blanchet@49585
   540
                     (if lfp then [] else [dtor_ctor]) @ sum_prod_thms_set)
blanchet@49585
   541
                   (cterm_instantiate_pos [SOME cxIn] fp_set_thm))
blanchet@49593
   542
              |> singleton (Proof_Context.export names_lthy no_defs_lthy);
blanchet@49585
   543
blanchet@49682
   544
            fun mk_set_thms fp_set_thm = map2 (mk_set_thm fp_set_thm) ctr_defs' cxIns;
blanchet@49585
   545
blanchet@49682
   546
            val map_thms = map2 mk_map_thm ctr_defs' cxIns;
blanchet@49585
   547
            val set_thmss = map mk_set_thms fp_set_thms;
blanchet@49127
   548
blanchet@49682
   549
            val rel_infos = (ctr_defs' ~~ cxIns, ctr_defs' ~~ cyIns);
blanchet@49585
   550
blanchet@49682
   551
            fun mk_rel_thm postproc ctr_defs' cxIn cyIn =
blanchet@49585
   552
              fold_thms lthy ctr_defs'
blanchet@51745
   553
                 (unfold_thms lthy (@{thm Inl_Inr_False} :: pre_rel_def ::
blanchet@51745
   554
                      (if lfp then [] else [dtor_ctor]) @ sum_prod_thms_rel)
blanchet@49585
   555
                    (cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm))
blanchet@49593
   556
              |> postproc
blanchet@49593
   557
              |> singleton (Proof_Context.export names_lthy no_defs_lthy);
blanchet@49585
   558
blanchet@49682
   559
            fun mk_rel_inject_thm ((ctr_def', cxIn), (_, cyIn)) =
blanchet@49682
   560
              mk_rel_thm (unfold_thms lthy @{thms eq_sym_Unity_conv}) [ctr_def'] cxIn cyIn;
blanchet@49585
   561
blanchet@49592
   562
            val rel_inject_thms = map mk_rel_inject_thm (op ~~ rel_infos);
blanchet@49585
   563
blanchet@49682
   564
            fun mk_half_rel_distinct_thm ((xctr_def', cxIn), (yctr_def', cyIn)) =
blanchet@49585
   565
              mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def']
blanchet@49682
   566
                cxIn cyIn;
blanchet@49121
   567
blanchet@49592
   568
            fun mk_other_half_rel_distinct_thm thm =
blanchet@49585
   569
              flip_rels lthy live thm RS (rel_flip RS sym RS @{thm arg_cong[of _ _ Not]} RS iffD2);
blanchet@49585
   570
blanchet@49592
   571
            val half_rel_distinct_thmss =
blanchet@49592
   572
              map (map mk_half_rel_distinct_thm) (mk_half_pairss rel_infos);
blanchet@49592
   573
            val other_half_rel_distinct_thmss =
blanchet@49592
   574
              map (map mk_other_half_rel_distinct_thm) half_rel_distinct_thmss;
blanchet@49592
   575
            val (rel_distinct_thms, _) =
blanchet@49592
   576
              join_halves n half_rel_distinct_thmss other_half_rel_distinct_thmss;
blanchet@49134
   577
blanchet@49585
   578
            val notes =
blanchet@49594
   579
              [(mapN, map_thms, code_simp_attrs),
blanchet@49592
   580
               (rel_distinctN, rel_distinct_thms, code_simp_attrs),
blanchet@49592
   581
               (rel_injectN, rel_inject_thms, code_simp_attrs),
blanchet@49585
   582
               (setsN, flat set_thmss, code_simp_attrs)]
blanchet@49585
   583
              |> filter_out (null o #2)
blanchet@49585
   584
              |> map (fn (thmN, thms, attrs) =>
blanchet@49633
   585
                ((qualify true fp_b_name (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49585
   586
          in
blanchet@49585
   587
            (wrap_res, lthy |> Local_Theory.notes notes |> snd)
blanchet@49585
   588
          end;
blanchet@49585
   589
blanchet@49585
   590
        fun define_fold_rec no_defs_lthy =
blanchet@49134
   591
          let
blanchet@49208
   592
            val fpT_to_C = fpT --> C;
blanchet@49199
   593
blanchet@49681
   594
            fun build_prod_proj mk_proj (T, U) =
blanchet@49670
   595
              if T = U then
blanchet@49670
   596
                id_const T
blanchet@49670
   597
              else
blanchet@49670
   598
                (case (T, U) of
blanchet@49670
   599
                  (Type (s, _), Type (s', _)) =>
blanchet@49681
   600
                  if s = s' then build_map (build_prod_proj mk_proj) T U else mk_proj T
blanchet@49670
   601
                | _ => mk_proj T);
blanchet@49670
   602
blanchet@49681
   603
            (* TODO: Avoid these complications; cf. corec case *)
blanchet@49672
   604
            fun mk_U proj (Type (s as @{type_name prod}, Ts as [T', U])) =
blanchet@49672
   605
                if member (op =) fpTs T' then proj (T', U) else Type (s, map (mk_U proj) Ts)
blanchet@49670
   606
              | mk_U proj (Type (s, Ts)) = Type (s, map (mk_U proj) Ts)
blanchet@49670
   607
              | mk_U _ T = T;
blanchet@49670
   608
blanchet@49670
   609
            fun unzip_rec (x as Free (_, T)) =
blanchet@49670
   610
              if exists_fp_subtype T then
blanchet@49681
   611
                [build_prod_proj fst_const (T, mk_U fst T) $ x,
blanchet@49681
   612
                 build_prod_proj snd_const (T, mk_U snd T) $ x]
blanchet@49670
   613
              else
blanchet@49670
   614
                [x];
blanchet@49670
   615
blanchet@49670
   616
            fun mk_rec_like_arg f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f (maps unzip_rec xs);
blanchet@49670
   617
blanchet@49670
   618
            fun generate_rec_like (suf, fp_rec_like, (fss, f_Tss, xsss)) =
blanchet@49215
   619
              let
blanchet@49215
   620
                val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
blanchet@49633
   621
                val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b);
blanchet@49215
   622
                val spec =
blanchet@49336
   623
                  mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binding, res_T)),
blanchet@49504
   624
                    Term.list_comb (fp_rec_like,
blanchet@49670
   625
                      map2 (mk_sum_caseN_balanced oo map2 mk_rec_like_arg) fss xsss));
blanchet@49336
   626
              in (binding, spec) end;
blanchet@49199
   627
blanchet@49504
   628
            val rec_like_infos =
blanchet@49504
   629
              [(foldN, fp_fold, fold_only),
blanchet@49215
   630
               (recN, fp_rec, rec_only)];
blanchet@49215
   631
blanchet@49504
   632
            val (bindings, specs) = map generate_rec_like rec_like_infos |> split_list;
blanchet@49215
   633
blanchet@49215
   634
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
blanchet@49201
   635
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49199
   636
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49336
   637
                #>> apsnd snd) bindings specs
blanchet@49199
   638
              ||> `Local_Theory.restore;
blanchet@49201
   639
blanchet@49201
   640
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49201
   641
blanchet@49504
   642
            val [fold_def, rec_def] = map (Morphism.thm phi) defs;
blanchet@49201
   643
blanchet@49536
   644
            val [foldx, recx] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts;
blanchet@49134
   645
          in
blanchet@49693
   646
            ((foldx, recx, fold_def, rec_def), lthy')
blanchet@49134
   647
          end;
blanchet@49134
   648
blanchet@49585
   649
        fun define_unfold_corec no_defs_lthy =
blanchet@49210
   650
          let
blanchet@49210
   651
            val B_to_fpT = C --> fpT;
blanchet@49211
   652
blanchet@49683
   653
            fun build_sum_inj mk_inj (T, U) =
blanchet@49683
   654
              if T = U then
blanchet@49683
   655
                id_const T
blanchet@49683
   656
              else
blanchet@49683
   657
                (case (T, U) of
blanchet@49683
   658
                  (Type (s, _), Type (s', _)) =>
blanchet@49683
   659
                  if s = s' then build_map (build_sum_inj mk_inj) T U
blanchet@49683
   660
                  else uncurry mk_inj (dest_sumT U)
blanchet@49683
   661
                | _ => uncurry mk_inj (dest_sumT U));
blanchet@49683
   662
blanchet@49683
   663
            fun build_dtor_corec_like_arg _ [] [cf] = cf
blanchet@49683
   664
              | build_dtor_corec_like_arg T [cq] [cf, cf'] =
blanchet@49683
   665
                mk_If cq (build_sum_inj Inl_const (fastype_of cf, T) $ cf)
blanchet@49683
   666
                  (build_sum_inj Inr_const (fastype_of cf', T) $ cf')
blanchet@49683
   667
blanchet@49683
   668
            val crgsss = map3 (map3 (map3 build_dtor_corec_like_arg)) g_Tsss crssss cgssss;
blanchet@49683
   669
            val cshsss = map3 (map3 (map3 build_dtor_corec_like_arg)) h_Tsss csssss chssss;
blanchet@49683
   670
blanchet@49276
   671
            fun mk_preds_getterss_join c n cps sum_prod_T cqfss =
blanchet@49276
   672
              Term.lambda c (mk_IfN sum_prod_T cps
blanchet@49276
   673
                (map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n)));
blanchet@49275
   674
blanchet@49683
   675
            fun generate_corec_like (suf, fp_rec_like, (cqfsss, ((pfss, _, _), (f_sum_prod_Ts, _,
blanchet@49683
   676
                pf_Tss)))) =
blanchet@49211
   677
              let
blanchet@49211
   678
                val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT;
blanchet@49633
   679
                val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b);
blanchet@49211
   680
                val spec =
blanchet@49336
   681
                  mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binding, res_T)),
blanchet@49504
   682
                    Term.list_comb (fp_rec_like,
blanchet@49276
   683
                      map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss));
blanchet@49336
   684
              in (binding, spec) end;
blanchet@49210
   685
blanchet@49504
   686
            val corec_like_infos =
blanchet@49683
   687
              [(unfoldN, fp_fold, (crgsss, unfold_only)),
blanchet@49683
   688
               (corecN, fp_rec, (cshsss, corec_only))];
blanchet@49212
   689
blanchet@49504
   690
            val (bindings, specs) = map generate_corec_like corec_like_infos |> split_list;
blanchet@49211
   691
blanchet@49211
   692
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
blanchet@49210
   693
              |> apfst split_list o fold_map2 (fn b => fn spec =>
blanchet@49210
   694
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
blanchet@49336
   695
                #>> apsnd snd) bindings specs
blanchet@49210
   696
              ||> `Local_Theory.restore;
blanchet@49210
   697
blanchet@49210
   698
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49210
   699
blanchet@49504
   700
            val [unfold_def, corec_def] = map (Morphism.thm phi) defs;
blanchet@49210
   701
blanchet@49536
   702
            val [unfold, corec] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts;
blanchet@49210
   703
          in
blanchet@49693
   704
            ((unfold, corec, unfold_def, corec_def), lthy')
blanchet@49287
   705
          end;
blanchet@49287
   706
blanchet@49504
   707
        val define_rec_likes = if lfp then define_fold_rec else define_unfold_corec;
blanchet@49585
   708
blanchet@49585
   709
        fun massage_res ((wrap_res, rec_like_res), lthy) =
blanchet@49585
   710
          (((ctrs, xss, ctr_defs, wrap_res), rec_like_res), lthy);
blanchet@49119
   711
      in
blanchet@49585
   712
        (wrap #> (live > 0 ? derive_maps_sets_rels) ##>> define_rec_likes #> massage_res, lthy')
blanchet@49119
   713
      end;
blanchet@49167
   714
blanchet@49585
   715
    fun wrap_types_and_more (wrap_types_and_mores, lthy) =
blanchet@49585
   716
      fold_map I wrap_types_and_mores lthy
blanchet@49585
   717
      |>> apsnd split_list4 o apfst split_list4 o split_list;
blanchet@49226
   718
blanchet@49585
   719
    (* TODO: Add map, sets, rel simps *)
blanchet@49479
   720
    val mk_simp_thmss =
blanchet@49591
   721
      map3 (fn (_, _, _, injects, distincts, cases, _, _, _) => fn rec_likes => fn fold_likes =>
blanchet@49505
   722
        injects @ distincts @ cases @ rec_likes @ fold_likes);
blanchet@49479
   723
blanchet@49585
   724
    fun derive_induct_fold_rec_thms_for_types (((ctrss, xsss, ctr_defss, wrap_ress), (folds, recs,
blanchet@49585
   725
        fold_defs, rec_defs)), lthy) =
blanchet@49202
   726
      let
blanchet@49591
   727
        val (((ps, ps'), us'), names_lthy) =
blanchet@49370
   728
          lthy
blanchet@49463
   729
          |> mk_Frees' "P" (map mk_pred1T fpTs)
blanchet@49498
   730
          ||>> Variable.variant_fixes fp_b_names;
blanchet@49370
   731
blanchet@49498
   732
        val us = map2 (curry Free) us' fpTs;
blanchet@49370
   733
blanchet@49362
   734
        fun mk_sets_nested bnf =
blanchet@49362
   735
          let
blanchet@49362
   736
            val Type (T_name, Us) = T_of_bnf bnf;
blanchet@49362
   737
            val lives = lives_of_bnf bnf;
blanchet@49362
   738
            val sets = sets_of_bnf bnf;
blanchet@49362
   739
            fun mk_set U =
blanchet@49362
   740
              (case find_index (curry (op =) U) lives of
blanchet@49362
   741
                ~1 => Term.dummy
blanchet@49362
   742
              | i => nth sets i);
blanchet@49362
   743
          in
blanchet@49362
   744
            (T_name, map mk_set Us)
blanchet@49362
   745
          end;
blanchet@49362
   746
blanchet@49362
   747
        val setss_nested = map mk_sets_nested nested_bnfs;
blanchet@49362
   748
blanchet@49337
   749
        val (induct_thms, induct_thm) =
blanchet@49337
   750
          let
blanchet@49362
   751
            fun mk_set Ts t =
blanchet@49362
   752
              let val Type (_, Ts0) = domain_type (fastype_of t) in
blanchet@49362
   753
                Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49362
   754
              end;
blanchet@49362
   755
blanchet@49375
   756
            fun mk_raw_prem_prems names_lthy (x as Free (s, T as Type (T_name, Ts0))) =
blanchet@49361
   757
                (case find_index (curry (op =) T) fpTs of
blanchet@49362
   758
                  ~1 =>
blanchet@49362
   759
                  (case AList.lookup (op =) setss_nested T_name of
blanchet@49362
   760
                    NONE => []
blanchet@49362
   761
                  | SOME raw_sets0 =>
blanchet@49362
   762
                    let
blanchet@49362
   763
                      val (Ts, raw_sets) =
blanchet@49362
   764
                        split_list (filter (exists_fp_subtype o fst) (Ts0 ~~ raw_sets0));
blanchet@49362
   765
                      val sets = map (mk_set Ts0) raw_sets;
blanchet@49362
   766
                      val (ys, names_lthy') = names_lthy |> mk_Frees s Ts;
blanchet@49375
   767
                      val xysets = map (pair x) (ys ~~ sets);
blanchet@49375
   768
                      val ppremss = map (mk_raw_prem_prems names_lthy') ys;
blanchet@49362
   769
                    in
blanchet@49375
   770
                      flat (map2 (map o apfst o cons) xysets ppremss)
blanchet@49362
   771
                    end)
blanchet@49591
   772
                | kk => [([], (kk + 1, x))])
blanchet@49375
   773
              | mk_raw_prem_prems _ _ = [];
blanchet@49342
   774
blanchet@49378
   775
            fun close_prem_prem xs t =
blanchet@49378
   776
              fold_rev Logic.all (map Free (drop (nn + length xs)
blanchet@49591
   777
                (rev (Term.add_frees t (map dest_Free xs @ ps'))))) t;
blanchet@49362
   778
blanchet@49378
   779
            fun mk_prem_prem xs (xysets, (j, x)) =
blanchet@49378
   780
              close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) =>
blanchet@49376
   781
                  HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets,
blanchet@49591
   782
                HOLogic.mk_Trueprop (nth ps (j - 1) $ x)));
blanchet@49375
   783
blanchet@49372
   784
            fun mk_raw_prem phi ctr ctr_Ts =
blanchet@49362
   785
              let
blanchet@49362
   786
                val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts;
blanchet@49376
   787
                val pprems = maps (mk_raw_prem_prems names_lthy') xs;
blanchet@49378
   788
              in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end;
blanchet@49342
   789
blanchet@49376
   790
            fun mk_prem (xs, raw_pprems, concl) =
blanchet@49378
   791
              fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl));
blanchet@49368
   792
blanchet@49591
   793
            val raw_premss = map3 (map2 o mk_raw_prem) ps ctrss ctr_Tsss;
blanchet@49389
   794
blanchet@49361
   795
            val goal =
blanchet@49372
   796
              Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss,
blanchet@49591
   797
                HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) ps us)));
blanchet@49368
   798
blanchet@49429
   799
            val kksss = map (map (map (fst o snd) o #2)) raw_premss;
blanchet@49368
   800
blanchet@49501
   801
            val ctor_induct' = fp_induct OF (map mk_sumEN_tupled_balanced mss);
blanchet@49342
   802
blanchet@49591
   803
            val thm =
wenzelm@51551
   804
              Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49590
   805
                mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct'
blanchet@49389
   806
                  nested_set_natural's pre_set_defss)
blanchet@49368
   807
              |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49591
   808
              |> Thm.close_derivation;
blanchet@49337
   809
          in
blanchet@49591
   810
            `(conj_dests nn) thm
blanchet@49337
   811
          end;
blanchet@49201
   812
blanchet@49622
   813
        val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss);
blanchet@49437
   814
blanchet@49504
   815
        val (fold_thmss, rec_thmss) =
blanchet@49207
   816
          let
blanchet@49337
   817
            val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
blanchet@49504
   818
            val gfolds = map (lists_bmoc gss) folds;
blanchet@49337
   819
            val hrecs = map (lists_bmoc hss) recs;
blanchet@49337
   820
blanchet@49504
   821
            fun mk_goal fss frec_like xctr f xs fxs =
blanchet@49207
   822
              fold_rev (fold_rev Logic.all) (xs :: fss)
blanchet@49504
   823
                (mk_Trueprop_eq (frec_like $ xctr, Term.list_comb (f, fxs)));
blanchet@49204
   824
blanchet@49682
   825
            fun build_rec_like frec_likes (T, U) =
blanchet@49234
   826
              if T = U then
blanchet@49368
   827
                id_const T
blanchet@49234
   828
              else
blanchet@49234
   829
                (case find_index (curry (op =) T) fpTs of
blanchet@49682
   830
                  ~1 => build_map (build_rec_like frec_likes) T U
blanchet@49682
   831
                | kk => nth frec_likes kk);
blanchet@49233
   832
blanchet@49682
   833
            val mk_U = typ_subst (map2 pair fpTs Cs);
blanchet@49214
   834
blanchet@49682
   835
            fun intr_rec_likes frec_likes maybe_cons (x as Free (_, T)) =
blanchet@49670
   836
              if exists_fp_subtype T then
blanchet@49682
   837
                maybe_cons x [build_rec_like frec_likes (T, mk_U T) $ x]
blanchet@49214
   838
              else
blanchet@49214
   839
                [x];
blanchet@49214
   840
blanchet@49682
   841
            val gxsss = map (map (maps (intr_rec_likes gfolds (K I)))) xsss;
blanchet@49682
   842
            val hxsss = map (map (maps (intr_rec_likes hrecs cons))) xsss;
blanchet@49204
   843
blanchet@49504
   844
            val fold_goalss = map5 (map4 o mk_goal gss) gfolds xctrss gss xsss gxsss;
blanchet@49484
   845
            val rec_goalss = map5 (map4 o mk_goal hss) hrecs xctrss hss xsss hxsss;
blanchet@49204
   846
blanchet@49504
   847
            val fold_tacss =
blanchet@49670
   848
              map2 (map o mk_rec_like_tac pre_map_defs [] nesting_map_ids'' fold_defs) fp_fold_thms
blanchet@49363
   849
                ctr_defss;
blanchet@49203
   850
            val rec_tacss =
blanchet@49670
   851
              map2 (map o mk_rec_like_tac pre_map_defs nested_map_comp's
blanchet@49670
   852
                (nested_map_ids'' @ nesting_map_ids'') rec_defs) fp_rec_thms ctr_defss;
blanchet@49484
   853
blanchet@49591
   854
            fun prove goal tac =
wenzelm@51551
   855
              Goal.prove_sorry lthy [] [] goal (tac o #context)
blanchet@49591
   856
              |> Thm.close_derivation;
blanchet@49202
   857
          in
blanchet@49595
   858
            (map2 (map2 prove) fold_goalss fold_tacss, map2 (map2 prove) rec_goalss rec_tacss)
blanchet@49202
   859
          end;
blanchet@49201
   860
blanchet@49504
   861
        val simp_thmss = mk_simp_thmss wrap_ress rec_thmss fold_thmss;
blanchet@49438
   862
blanchet@49437
   863
        val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases));
blanchet@49437
   864
        fun induct_type_attr T_name = Attrib.internal (K (Induct.induct_type T_name));
blanchet@49437
   865
blanchet@49337
   866
        val common_notes =
blanchet@49437
   867
          (if nn > 1 then [(inductN, [induct_thm], [induct_case_names_attr])] else [])
blanchet@49337
   868
          |> map (fn (thmN, thms, attrs) =>
blanchet@49633
   869
            ((qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49337
   870
blanchet@49226
   871
        val notes =
blanchet@49633
   872
          [(foldN, fold_thmss, K code_simp_attrs),
blanchet@49633
   873
           (inductN, map single induct_thms,
blanchet@49437
   874
            fn T_name => [induct_case_names_attr, induct_type_attr T_name]),
blanchet@49622
   875
           (recN, rec_thmss, K code_simp_attrs),
blanchet@49585
   876
           (simpsN, simp_thmss, K [])]
blanchet@49300
   877
          |> maps (fn (thmN, thmss, attrs) =>
blanchet@49633
   878
            map3 (fn fp_b_name => fn Type (T_name, _) => fn thms =>
blanchet@49633
   879
              ((qualify true fp_b_name (Binding.name thmN), attrs T_name),
blanchet@49633
   880
               [(thms, [])])) fp_b_names fpTs thmss);
blanchet@49202
   881
      in
blanchet@49337
   882
        lthy |> Local_Theory.notes (common_notes @ notes) |> snd
blanchet@49202
   883
      end;
blanchet@49202
   884
blanchet@49585
   885
    fun derive_coinduct_unfold_corec_thms_for_types (((ctrss, _, ctr_defss, wrap_ress), (unfolds,
blanchet@49585
   886
        corecs, unfold_defs, corec_defs)), lthy) =
blanchet@49212
   887
      let
blanchet@49591
   888
        val nesting_rel_eqs = map rel_eq_of_bnf nesting_bnfs;
blanchet@49591
   889
blanchet@49484
   890
        val discss = map (map (mk_disc_or_sel As) o #1) wrap_ress;
blanchet@49591
   891
        val selsss = map (map (map (mk_disc_or_sel As)) o #2) wrap_ress;
blanchet@49591
   892
        val exhaust_thms = map #3 wrap_ress;
blanchet@49591
   893
        val disc_thmsss = map #7 wrap_ress;
blanchet@49591
   894
        val discIss = map #8 wrap_ress;
blanchet@49591
   895
        val sel_thmsss = map #9 wrap_ress;
blanchet@49438
   896
blanchet@49591
   897
        val (((rs, us'), vs'), names_lthy) =
blanchet@49370
   898
          lthy
blanchet@49591
   899
          |> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs)
blanchet@49591
   900
          ||>> Variable.variant_fixes fp_b_names
blanchet@49591
   901
          ||>> Variable.variant_fixes (map (suffix "'") fp_b_names);
blanchet@49370
   902
blanchet@49498
   903
        val us = map2 (curry Free) us' fpTs;
blanchet@49591
   904
        val udiscss = map2 (map o rapp) us discss;
blanchet@49591
   905
        val uselsss = map2 (map o map o rapp) us selsss;
blanchet@49370
   906
blanchet@49591
   907
        val vs = map2 (curry Free) vs' fpTs;
blanchet@49591
   908
        val vdiscss = map2 (map o rapp) vs discss;
blanchet@49591
   909
        val vselsss = map2 (map o map o rapp) vs selsss;
blanchet@49591
   910
blanchet@49591
   911
        val ((coinduct_thms, coinduct_thm), (strong_coinduct_thms, strong_coinduct_thm)) =
blanchet@49337
   912
          let
blanchet@49591
   913
            val uvrs = map3 (fn r => fn u => fn v => r $ u $ v) rs us vs;
blanchet@49591
   914
            val uv_eqs = map2 (curry HOLogic.mk_eq) us vs;
blanchet@49591
   915
            val strong_rs =
blanchet@49591
   916
              map4 (fn u => fn v => fn uvr => fn uv_eq =>
blanchet@49591
   917
                fold_rev Term.lambda [u, v] (HOLogic.mk_disj (uvr, uv_eq))) us vs uvrs uv_eqs;
blanchet@49591
   918
blanchet@49591
   919
            fun build_rel rs' T =
blanchet@49591
   920
              (case find_index (curry (op =) T) fpTs of
blanchet@49591
   921
                ~1 =>
blanchet@49683
   922
                if exists_fp_subtype T then build_rel_step (build_rel rs') T else HOLogic.eq_const T
blanchet@49591
   923
              | kk => nth rs' kk);
blanchet@49591
   924
blanchet@49591
   925
            fun build_rel_app rs' usel vsel =
blanchet@49591
   926
              fold rapp [usel, vsel] (build_rel rs' (fastype_of usel));
blanchet@49591
   927
blanchet@49591
   928
            fun mk_prem_ctr_concls rs' n k udisc usels vdisc vsels =
blanchet@49591
   929
              (if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @
blanchet@49591
   930
              (if null usels then
blanchet@49591
   931
                 []
blanchet@49591
   932
               else
blanchet@49591
   933
                 [Library.foldr HOLogic.mk_imp (if n = 1 then [] else [udisc, vdisc],
blanchet@49591
   934
                    Library.foldr1 HOLogic.mk_conj (map2 (build_rel_app rs') usels vsels))]);
blanchet@49591
   935
blanchet@49591
   936
            fun mk_prem_concl rs' n udiscs uselss vdiscs vselss =
blanchet@49591
   937
              Library.foldr1 HOLogic.mk_conj
blanchet@49591
   938
                (flat (map5 (mk_prem_ctr_concls rs' n) (1 upto n) udiscs uselss vdiscs vselss))
blanchet@49591
   939
              handle List.Empty => @{term True};
blanchet@49591
   940
blanchet@49591
   941
            fun mk_prem rs' uvr u v n udiscs uselss vdiscs vselss =
blanchet@49591
   942
              fold_rev Logic.all [u, v] (Logic.mk_implies (HOLogic.mk_Trueprop uvr,
blanchet@49591
   943
                HOLogic.mk_Trueprop (mk_prem_concl rs' n udiscs uselss vdiscs vselss)));
blanchet@49591
   944
blanchet@49591
   945
            val concl =
blanchet@49591
   946
              HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
blanchet@49591
   947
                (map3 (fn uvr => fn u => fn v => HOLogic.mk_imp (uvr, HOLogic.mk_eq (u, v)))
blanchet@49591
   948
                   uvrs us vs));
blanchet@49591
   949
blanchet@49591
   950
            fun mk_goal rs' =
blanchet@49591
   951
              Logic.list_implies (map8 (mk_prem rs') uvrs us vs ns udiscss uselsss vdiscss vselsss,
blanchet@49591
   952
                concl);
blanchet@49591
   953
blanchet@49591
   954
            val goal = mk_goal rs;
blanchet@49591
   955
            val strong_goal = mk_goal strong_rs;
blanchet@49591
   956
blanchet@49591
   957
            fun prove dtor_coinduct' goal =
wenzelm@51551
   958
              Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49591
   959
                mk_coinduct_tac ctxt nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs dtor_ctors
blanchet@49591
   960
                  exhaust_thms ctr_defss disc_thmsss sel_thmsss)
blanchet@49591
   961
              |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49591
   962
              |> Thm.close_derivation;
blanchet@49591
   963
blanchet@49590
   964
            fun postproc nn thm =
blanchet@49590
   965
              Thm.permute_prems 0 nn
blanchet@49591
   966
                (if nn = 1 then thm RS mp
blanchet@49591
   967
                 else funpow nn (fn thm => reassoc_conjs (thm RS mp_conj)) thm)
blanchet@49591
   968
              |> Drule.zero_var_indexes
blanchet@49591
   969
              |> `(conj_dests nn);
blanchet@49337
   970
          in
blanchet@49591
   971
            (postproc nn (prove fp_induct goal), postproc nn (prove fp_strong_induct strong_goal))
blanchet@49337
   972
          end;
blanchet@49212
   973
blanchet@49484
   974
        fun mk_maybe_not pos = not pos ? HOLogic.mk_not;
blanchet@49484
   975
blanchet@49504
   976
        val gunfolds = map (lists_bmoc pgss) unfolds;
blanchet@49484
   977
        val hcorecs = map (lists_bmoc phss) corecs;
blanchet@49484
   978
blanchet@49504
   979
        val (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) =
blanchet@49212
   980
          let
blanchet@49504
   981
            fun mk_goal pfss c cps fcorec_like n k ctr m cfs' =
blanchet@49212
   982
              fold_rev (fold_rev Logic.all) ([c] :: pfss)
blanchet@49484
   983
                (Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps,
blanchet@49504
   984
                   mk_Trueprop_eq (fcorec_like $ c, Term.list_comb (ctr, take m cfs'))));
blanchet@49212
   985
blanchet@49683
   986
            fun build_corec_like fcorec_likes (T, U) =
blanchet@49234
   987
              if T = U then
blanchet@49368
   988
                id_const T
blanchet@49234
   989
              else
blanchet@49234
   990
                (case find_index (curry (op =) U) fpTs of
blanchet@49683
   991
                  ~1 => build_map (build_corec_like fcorec_likes) T U
blanchet@49683
   992
                | kk => nth fcorec_likes kk);
blanchet@49683
   993
blanchet@49683
   994
            val mk_U = typ_subst (map2 pair Cs fpTs);
blanchet@49233
   995
blanchet@49683
   996
            fun intr_corec_likes fcorec_likes [] [cf] =
blanchet@49683
   997
                let val T = fastype_of cf in
blanchet@49683
   998
                  if exists_Cs_subtype T then build_corec_like fcorec_likes (T, mk_U T) $ cf else cf
blanchet@49683
   999
                end
blanchet@49683
  1000
              | intr_corec_likes fcorec_likes [cq] [cf, cf'] =
blanchet@49683
  1001
                mk_If cq (intr_corec_likes fcorec_likes [] [cf])
blanchet@49683
  1002
                  (intr_corec_likes fcorec_likes [] [cf']);
blanchet@49683
  1003
blanchet@49683
  1004
            val crgsss = map2 (map2 (map2 (intr_corec_likes gunfolds))) crssss cgssss;
blanchet@49683
  1005
            val cshsss = map2 (map2 (map2 (intr_corec_likes hcorecs))) csssss chssss;
blanchet@49212
  1006
blanchet@49683
  1007
            val unfold_goalss =
blanchet@49683
  1008
              map8 (map4 oooo mk_goal pgss) cs cpss gunfolds ns kss ctrss mss crgsss;
blanchet@49683
  1009
            val corec_goalss =
blanchet@49683
  1010
              map8 (map4 oooo mk_goal phss) cs cpss hcorecs ns kss ctrss mss cshsss;
blanchet@49683
  1011
blanchet@49683
  1012
            fun mk_map_if_distrib bnf =
blanchet@49683
  1013
              let
blanchet@49683
  1014
                val mapx = map_of_bnf bnf;
blanchet@49683
  1015
                val live = live_of_bnf bnf;
blanchet@49683
  1016
                val ((Ts, T), U) = strip_typeN (live + 1) (fastype_of mapx) |>> split_last;
blanchet@49683
  1017
                val fs = Variable.variant_frees lthy [mapx] (map (pair "f") Ts);
blanchet@49683
  1018
                val t = Term.list_comb (mapx, map (Var o apfst (rpair 0)) fs);
blanchet@49683
  1019
              in
blanchet@49683
  1020
                Drule.instantiate' (map (SOME o certifyT lthy) [U, T]) [SOME (certify lthy t)]
blanchet@49683
  1021
                  @{thm if_distrib}
blanchet@49276
  1022
              end;
blanchet@49232
  1023
blanchet@49683
  1024
            val nested_map_if_distribs = map mk_map_if_distrib nested_bnfs;
blanchet@49213
  1025
blanchet@49504
  1026
            val unfold_tacss =
blanchet@49683
  1027
              map3 (map oo mk_corec_like_tac unfold_defs [] [] nesting_map_ids'' [])
blanchet@49683
  1028
                fp_fold_thms pre_map_defs ctr_defss;
blanchet@49233
  1029
            val corec_tacss =
blanchet@49683
  1030
              map3 (map oo mk_corec_like_tac corec_defs nested_map_comps'' nested_map_comp's
blanchet@49683
  1031
                  (nested_map_ids'' @ nesting_map_ids'') nested_map_if_distribs)
blanchet@49683
  1032
                fp_rec_thms pre_map_defs ctr_defss;
blanchet@49479
  1033
blanchet@49484
  1034
            fun prove goal tac =
wenzelm@51551
  1035
              Goal.prove_sorry lthy [] [] goal (tac o #context) |> Thm.close_derivation;
blanchet@49484
  1036
blanchet@49504
  1037
            val unfold_thmss = map2 (map2 prove) unfold_goalss unfold_tacss;
blanchet@49683
  1038
            val corec_thmss = map2 (map2 prove) corec_goalss corec_tacss;
blanchet@49479
  1039
blanchet@49479
  1040
            val filter_safesss =
blanchet@49479
  1041
              map2 (map_filter (fn (safes, thm) => if forall I safes then SOME thm else NONE) oo
blanchet@49683
  1042
                curry (op ~~)) (map2 (map2 (map2 (member (op =)))) cgssss crgsss);
blanchet@49479
  1043
blanchet@49683
  1044
            val safe_unfold_thmss = filter_safesss unfold_thmss;
blanchet@49683
  1045
            val safe_corec_thmss = filter_safesss corec_thmss;
blanchet@49479
  1046
          in
blanchet@49504
  1047
            (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss)
blanchet@49212
  1048
          end;
blanchet@49212
  1049
blanchet@49504
  1050
        val (disc_unfold_iff_thmss, disc_corec_iff_thmss) =
blanchet@49482
  1051
          let
blanchet@49504
  1052
            fun mk_goal c cps fcorec_like n k disc =
blanchet@49504
  1053
              mk_Trueprop_eq (disc $ (fcorec_like $ c),
blanchet@49484
  1054
                if n = 1 then @{const True}
blanchet@49484
  1055
                else Library.foldr1 HOLogic.mk_conj (seq_conds mk_maybe_not n k cps));
blanchet@49484
  1056
blanchet@49504
  1057
            val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss;
blanchet@49484
  1058
            val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss;
blanchet@49484
  1059
blanchet@49484
  1060
            fun mk_case_split' cp =
blanchet@49484
  1061
              Drule.instantiate' [] [SOME (certify lthy cp)] @{thm case_split};
blanchet@49484
  1062
blanchet@49484
  1063
            val case_splitss' = map (map mk_case_split') cpss;
blanchet@49482
  1064
blanchet@49504
  1065
            val unfold_tacss =
blanchet@49504
  1066
              map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' unfold_thmss disc_thmsss;
blanchet@49484
  1067
            val corec_tacss =
blanchet@49504
  1068
              map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' corec_thmss disc_thmsss;
blanchet@49484
  1069
blanchet@49484
  1070
            fun prove goal tac =
wenzelm@51551
  1071
              Goal.prove_sorry lthy [] [] goal (tac o #context)
blanchet@49591
  1072
              |> singleton (Proof_Context.export names_lthy0 no_defs_lthy)
blanchet@49591
  1073
              |> Thm.close_derivation;
blanchet@49484
  1074
blanchet@49484
  1075
            fun proves [_] [_] = []
blanchet@49484
  1076
              | proves goals tacs = map2 prove goals tacs;
blanchet@49482
  1077
          in
blanchet@49504
  1078
            (map2 proves unfold_goalss unfold_tacss,
blanchet@49484
  1079
             map2 proves corec_goalss corec_tacss)
blanchet@49482
  1080
          end;
blanchet@49482
  1081
blanchet@49605
  1082
        val is_triv_discI = is_triv_implies orf is_concl_refl;
blanchet@49605
  1083
blanchet@49504
  1084
        fun mk_disc_corec_like_thms corec_likes discIs =
blanchet@49605
  1085
          map (op RS) (filter_out (is_triv_discI o snd) (corec_likes ~~ discIs));
blanchet@49266
  1086
blanchet@49504
  1087
        val disc_unfold_thmss = map2 mk_disc_corec_like_thms unfold_thmss discIss;
blanchet@49504
  1088
        val disc_corec_thmss = map2 mk_disc_corec_like_thms corec_thmss discIss;
blanchet@49266
  1089
blanchet@49504
  1090
        fun mk_sel_corec_like_thm corec_like_thm sel sel_thm =
blanchet@49266
  1091
          let
blanchet@49479
  1092
            val (domT, ranT) = dest_funT (fastype_of sel);
blanchet@49266
  1093
            val arg_cong' =
blanchet@49266
  1094
              Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
blanchet@49479
  1095
                [NONE, NONE, SOME (certify lthy sel)] arg_cong
blanchet@49267
  1096
              |> Thm.varifyT_global;
blanchet@49266
  1097
            val sel_thm' = sel_thm RSN (2, trans);
blanchet@49266
  1098
          in
blanchet@49504
  1099
            corec_like_thm RS arg_cong' RS sel_thm'
blanchet@49266
  1100
          end;
blanchet@49266
  1101
blanchet@49504
  1102
        fun mk_sel_corec_like_thms corec_likess =
blanchet@49504
  1103
          map3 (map3 (map2 o mk_sel_corec_like_thm)) corec_likess selsss sel_thmsss |> map flat;
blanchet@49479
  1104
blanchet@49504
  1105
        val sel_unfold_thmss = mk_sel_corec_like_thms unfold_thmss;
blanchet@49504
  1106
        val sel_corec_thmss = mk_sel_corec_like_thms corec_thmss;
blanchet@49479
  1107
blanchet@49587
  1108
        fun flat_corec_like_thms corec_likes disc_corec_likes sel_corec_likes =
blanchet@49504
  1109
          corec_likes @ disc_corec_likes @ sel_corec_likes;
blanchet@49479
  1110
blanchet@49479
  1111
        val simp_thmss =
blanchet@49479
  1112
          mk_simp_thmss wrap_ress
blanchet@49587
  1113
            (map3 flat_corec_like_thms safe_corec_thmss disc_corec_thmss sel_corec_thmss)
blanchet@49587
  1114
            (map3 flat_corec_like_thms safe_unfold_thmss disc_unfold_thmss sel_unfold_thmss);
blanchet@49479
  1115
blanchet@49479
  1116
        val anonymous_notes =
blanchet@49504
  1117
          [(flat safe_unfold_thmss @ flat safe_corec_thmss, simp_attrs)]
blanchet@49479
  1118
          |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
blanchet@49266
  1119
blanchet@49342
  1120
        val common_notes =
blanchet@49591
  1121
          (if nn > 1 then
blanchet@49591
  1122
             (* FIXME: attribs *)
blanchet@49591
  1123
             [(coinductN, [coinduct_thm], []),
blanchet@49591
  1124
              (strong_coinductN, [strong_coinduct_thm], [])]
blanchet@49591
  1125
           else
blanchet@49591
  1126
             [])
blanchet@49342
  1127
          |> map (fn (thmN, thms, attrs) =>
blanchet@49633
  1128
            ((qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49342
  1129
blanchet@49212
  1130
        val notes =
blanchet@49342
  1131
          [(coinductN, map single coinduct_thms, []), (* FIXME: attribs *)
blanchet@49594
  1132
           (corecN, corec_thmss, []),
blanchet@49594
  1133
           (disc_corecN, disc_corec_thmss, simp_attrs),
blanchet@49594
  1134
           (disc_corec_iffN, disc_corec_iff_thmss, simp_attrs),
blanchet@49594
  1135
           (disc_unfoldN, disc_unfold_thmss, simp_attrs),
blanchet@49594
  1136
           (disc_unfold_iffN, disc_unfold_iff_thmss, simp_attrs),
blanchet@49594
  1137
           (sel_corecN, sel_corec_thmss, simp_attrs),
blanchet@49594
  1138
           (sel_unfoldN, sel_unfold_thmss, simp_attrs),
blanchet@49585
  1139
           (simpsN, simp_thmss, []),
blanchet@49591
  1140
           (strong_coinductN, map single strong_coinduct_thms, []), (* FIXME: attribs *)
blanchet@49594
  1141
           (unfoldN, unfold_thmss, [])]
blanchet@49300
  1142
          |> maps (fn (thmN, thmss, attrs) =>
blanchet@49633
  1143
            map_filter (fn (_, []) => NONE | (fp_b_name, thms) =>
blanchet@49633
  1144
              SOME ((qualify true fp_b_name (Binding.name thmN), attrs),
blanchet@49633
  1145
                [(thms, [])])) (fp_b_names ~~ thmss));
blanchet@49212
  1146
      in
blanchet@49479
  1147
        lthy |> Local_Theory.notes (anonymous_notes @ common_notes @ notes) |> snd
blanchet@49212
  1148
      end;
blanchet@49212
  1149
blanchet@49204
  1150
    val lthy' = lthy
blanchet@49585
  1151
      |> fold_map define_ctrs_case_for_type (fp_bnfs ~~ fp_bs ~~ fpTs ~~ Cs ~~ ctors ~~ dtors ~~
blanchet@49585
  1152
        fp_folds ~~ fp_recs ~~ ctor_dtors ~~ dtor_ctors ~~ ctor_injects ~~ pre_map_defs ~~
blanchet@49585
  1153
        pre_set_defss ~~ pre_rel_defs ~~ fp_map_thms ~~ fp_set_thmss ~~ fp_rel_thms ~~ ns ~~ kss ~~
blanchet@49585
  1154
        mss ~~ ctr_bindingss ~~ ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~
blanchet@49585
  1155
        raw_sel_defaultsss)
blanchet@49585
  1156
      |> wrap_types_and_more
blanchet@49585
  1157
      |> (if lfp then derive_induct_fold_rec_thms_for_types
blanchet@49585
  1158
          else derive_coinduct_unfold_corec_thms_for_types);
blanchet@49167
  1159
blanchet@49167
  1160
    val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
blanchet@49208
  1161
      (if lfp then "" else "co") ^ "datatype"));
blanchet@49112
  1162
  in
blanchet@49308
  1163
    timer; lthy'
blanchet@49112
  1164
  end;
blanchet@49112
  1165
blanchet@49536
  1166
val datatypes = define_datatypes (K I) (K I) (K I);
blanchet@49297
  1167
blanchet@51380
  1168
val datatype_cmd = define_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.parse_term;
blanchet@49119
  1169
blanchet@49112
  1170
val parse_ctr_arg =
blanchet@49329
  1171
  @{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"} ||
traytel@49434
  1172
  (Parse.typ >> pair Binding.empty);
blanchet@49112
  1173
blanchet@49286
  1174
val parse_defaults =
blanchet@49286
  1175
  @{keyword "("} |-- @{keyword "defaults"} |-- Scan.repeat parse_bound_term --| @{keyword ")"};
blanchet@49286
  1176
blanchet@49112
  1177
val parse_single_spec =
blanchet@49112
  1178
  Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix --
blanchet@49119
  1179
  (@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding --
blanchet@49286
  1180
    Scan.repeat parse_ctr_arg -- Scan.optional parse_defaults [] -- Parse.opt_mixfix));
blanchet@49112
  1181
blanchet@49278
  1182
val parse_datatype = parse_wrap_options -- Parse.and_list1 parse_single_spec;
blanchet@49278
  1183
blanchet@49585
  1184
fun parse_datatype_cmd lfp construct_fp = parse_datatype >> datatype_cmd lfp construct_fp;
blanchet@49112
  1185
blanchet@49112
  1186
end;