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