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