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