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