src/HOL/Codatatype/Tools/bnf_fp_sugar.ML
author blanchet
Fri, 14 Sep 2012 12:09:27 +0200
changeset 49363 8fc53d925629
parent 49362 1271aca16aed
child 49366 3edd1c90f6e6
permissions -rw-r--r--
distinguish between nested and nesting BNFs
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     1
(*  Title:      HOL/Codatatype/Tools/bnf_fp_sugar.ML
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     2
    Author:     Jasmin Blanchette, TU Muenchen
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     3
    Copyright   2012
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     4
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     5
Sugar for constructing LFPs and GFPs.
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     6
*)
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     7
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     8
signature BNF_FP_SUGAR =
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
     9
sig
49297
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
    10
  val datatyp: bool ->
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
    11
    (mixfix list -> (string * sort) list option -> binding list -> typ list * typ list list ->
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
    12
      BNF_Def.BNF list -> local_theory ->
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
    13
      (term list * term list * term list * term list * thm * thm list * thm list * thm list *
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
    14
         thm list * thm list) * local_theory) ->
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    15
    bool * ((((typ * sort) list * binding) * mixfix) * ((((binding * binding) *
49297
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
    16
      (binding * typ) list) * (binding * term) list) * mixfix) list) list ->
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
    17
    local_theory -> local_theory
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
    18
  val parse_datatype_cmd: bool ->
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
    19
    (mixfix list -> (string * sort) list option -> binding list -> typ list * typ list list ->
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
    20
      BNF_Def.BNF list -> local_theory ->
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
    21
      (term list * term list * term list * term list * thm * thm list * thm list * thm list *
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
    22
         thm list * thm list) * local_theory) ->
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
    23
    (local_theory -> local_theory) parser
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    24
end;
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    25
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    26
structure BNF_FP_Sugar : BNF_FP_SUGAR =
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    27
struct
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    28
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    29
open BNF_Util
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    30
open BNF_Wrap
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    31
open BNF_Def
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    32
open BNF_FP_Util
49123
263b0e330d8b more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents: 49121
diff changeset
    33
open BNF_FP_Sugar_Tactics
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    34
49300
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
    35
val simp_attrs = @{attributes [simp]};
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
    36
49266
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
    37
fun split_list11 xs =
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
    38
  (map #1 xs, map #2 xs, map #3 xs, map #4 xs, map #5 xs, map #6 xs, map #7 xs, map #8 xs,
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
    39
   map #9 xs, map #10 xs, map #11 xs);
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    40
49217
0c9546fc789f fixed handling of map of "fun"
blanchet
parents: 49216
diff changeset
    41
fun strip_map_type (Type (@{type_name fun}, [T as Type _, T'])) = strip_map_type T' |>> cons T
0c9546fc789f fixed handling of map of "fun"
blanchet
parents: 49216
diff changeset
    42
  | strip_map_type T = ([], T);
0c9546fc789f fixed handling of map of "fun"
blanchet
parents: 49216
diff changeset
    43
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
    44
fun resort_tfree S (TFree (s, _)) = TFree (s, S);
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
    45
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    46
fun typ_subst inst (T as Type (s, Ts)) =
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    47
    (case AList.lookup (op =) inst T of
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    48
      NONE => Type (s, map (typ_subst inst) Ts)
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    49
    | SOME T' => T')
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    50
  | typ_subst inst T = the_default T (AList.lookup (op =) inst T);
49205
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
    51
49297
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
    52
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs));
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
    53
49234
blanchet
parents: 49233
diff changeset
    54
fun mk_id T = Const (@{const_name id}, T --> T);
blanchet
parents: 49233
diff changeset
    55
49200
73f9aede57a4 correctly curry recursor arguments
blanchet
parents: 49199
diff changeset
    56
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs));
73f9aede57a4 correctly curry recursor arguments
blanchet
parents: 49199
diff changeset
    57
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs;
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
    58
fun mk_uncurried2_fun f xss =
49200
73f9aede57a4 correctly curry recursor arguments
blanchet
parents: 49199
diff changeset
    59
  mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss);
73f9aede57a4 correctly curry recursor arguments
blanchet
parents: 49199
diff changeset
    60
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
    61
fun tick v f = Term.lambda v (HOLogic.mk_prod (v, f $ v));
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
    62
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
    63
fun tack z_name (c, v) f =
49273
f839ce127a2e reverted "id" change: The problem is rather that the "%c. f c" argument sometimes gets eta-reduced
blanchet
parents: 49268
diff changeset
    64
  let val z = Free (z_name, mk_sumT (fastype_of v, fastype_of c)) in
f839ce127a2e reverted "id" change: The problem is rather that the "%c. f c" argument sometimes gets eta-reduced
blanchet
parents: 49268
diff changeset
    65
    Term.lambda z (mk_sum_case (Term.lambda v v, Term.lambda c (f $ c)) $ z)
f839ce127a2e reverted "id" change: The problem is rather that the "%c. f c" argument sometimes gets eta-reduced
blanchet
parents: 49268
diff changeset
    66
  end;
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    67
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
    68
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    69
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    70
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types ();
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    71
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    72
fun merge_type_args (As, As') =
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    73
  if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types ();
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    74
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    75
fun type_args_constrained_of (((cAs, _), _), _) = cAs;
49336
blanchet
parents: 49330
diff changeset
    76
fun type_binding_of (((_, b), _), _) = b;
49181
blanchet
parents: 49180
diff changeset
    77
fun mixfix_of ((_, mx), _) = mx;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    78
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    79
49286
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
    80
fun disc_of ((((disc, _), _), _), _) = disc;
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
    81
fun ctr_of ((((_, ctr), _), _), _) = ctr;
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
    82
fun args_of (((_, args), _), _) = args;
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
    83
fun defaults_of ((_, ds), _) = ds;
49181
blanchet
parents: 49180
diff changeset
    84
fun ctr_mixfix_of (_, mx) = mx;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    85
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
    86
fun define_datatype prepare_constraint prepare_typ prepare_term lfp construct (no_dests, specs)
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    87
    no_defs_lthy0 =
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    88
  let
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    89
    (* TODO: sanity checks on arguments *)
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    90
49286
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
    91
    val _ = if not lfp andalso no_dests then error "Cannot define destructor-less codatatypes"
49278
718e4ad1517e added no_dests option
blanchet
parents: 49277
diff changeset
    92
      else ();
718e4ad1517e added no_dests option
blanchet
parents: 49277
diff changeset
    93
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    94
    val N = length specs;
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
    95
    val fp_bs = map type_binding_of specs;
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
    96
    val fp_common_name = mk_common_name fp_bs;
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    97
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    98
    fun prepare_type_arg (ty, c) =
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
    99
      let val TFree (s, _) = prepare_typ no_defs_lthy0 ty in
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   100
        TFree (s, prepare_constraint no_defs_lthy0 c)
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   101
      end;
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   102
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   103
    val Ass0 = map (map prepare_type_arg o type_args_constrained_of) specs;
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   104
    val unsorted_Ass0 = map (map (resort_tfree HOLogic.typeS)) Ass0;
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   105
    val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   106
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   107
    val (((Bs, Cs), vs'), no_defs_lthy) =
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   108
      no_defs_lthy0
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   109
      |> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   110
      |> mk_TFrees N
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   111
      ||>> mk_TFrees N
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   112
      ||>> Variable.variant_fixes (map Binding.name_of fp_bs);
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   113
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   114
    (* TODO: cleaner handling of fake contexts, without "background_theory" *)
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   115
    (*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   116
      locale and shadows an existing global type*)
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   117
    val fake_thy =
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   118
      Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy
49336
blanchet
parents: 49330
diff changeset
   119
        (type_binding_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs;
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   120
    val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   121
49182
b8517107ffc5 read the real types off the constant types, rather than using the fake parser types (second step of sugar localization)
blanchet
parents: 49181
diff changeset
   122
    fun mk_fake_T b =
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   123
      Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   124
        unsorted_As);
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   125
49302
f5bd87aac224 added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents: 49300
diff changeset
   126
    val fake_Ts = map mk_fake_T fp_bs;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   127
49181
blanchet
parents: 49180
diff changeset
   128
    val mixfixes = map mixfix_of specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   129
49302
f5bd87aac224 added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents: 49300
diff changeset
   130
    val _ = (case duplicates Binding.eq_name fp_bs of [] => ()
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   131
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   132
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   133
    val ctr_specss = map ctr_specs_of specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   134
49336
blanchet
parents: 49330
diff changeset
   135
    val disc_bindingss = map (map disc_of) ctr_specss;
blanchet
parents: 49330
diff changeset
   136
    val ctr_bindingss =
49302
f5bd87aac224 added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents: 49300
diff changeset
   137
      map2 (fn fp_b => map (Binding.qualify false (Binding.name_of fp_b) o ctr_of))
f5bd87aac224 added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents: 49300
diff changeset
   138
        fp_bs ctr_specss;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   139
    val ctr_argsss = map (map args_of) ctr_specss;
49181
blanchet
parents: 49180
diff changeset
   140
    val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   141
49336
blanchet
parents: 49330
diff changeset
   142
    val sel_bindingsss = map (map (map fst)) ctr_argsss;
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   143
    val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
49286
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   144
    val raw_sel_defaultsss = map (map defaults_of) ctr_specss;
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   145
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
   146
    val (As :: _) :: fake_ctr_Tsss =
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   147
      burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0);
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   148
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   149
    val _ = (case duplicates (op =) unsorted_As of [] => ()
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   150
      | A :: _ => error ("Duplicate type parameter " ^
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   151
          quote (Syntax.string_of_typ no_defs_lthy A)));
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   152
49183
0cc46e2dee7e careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents: 49182
diff changeset
   153
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   154
    val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of
49165
c6ccaf6df93c check type variables on rhs
blanchet
parents: 49161
diff changeset
   155
        [] => ()
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   156
      | A' :: _ => error ("Extra type variable on right-hand side: " ^
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   157
          quote (Syntax.string_of_typ no_defs_lthy (TFree A'))));
49165
c6ccaf6df93c check type variables on rhs
blanchet
parents: 49161
diff changeset
   158
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   159
    fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) =
49146
e32b1f748854 added a check
blanchet
parents: 49135
diff changeset
   160
        s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
e32b1f748854 added a check
blanchet
parents: 49135
diff changeset
   161
          quote (Syntax.string_of_typ fake_lthy T)))
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   162
      | eq_fpT _ _ = false;
49146
e32b1f748854 added a check
blanchet
parents: 49135
diff changeset
   163
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   164
    fun freeze_fp (T as Type (s, Us)) =
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   165
        (case find_index (eq_fpT T) fake_Ts of ~1 => Type (s, map freeze_fp Us) | j => nth Bs j)
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   166
      | freeze_fp T = T;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   167
49297
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
   168
    val ctr_TsssBs = map (map (map freeze_fp)) fake_ctr_Tsss;
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
   169
    val ctr_sum_prod_TsBs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssBs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   170
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   171
    val fp_eqs =
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   172
      map dest_TFree Bs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsBs;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   173
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   174
    val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, fp_induct, unf_flds, fld_unfs, fld_injects,
49207
4634c217b77b completed iter/rec proofs
blanchet
parents: 49205
diff changeset
   175
        fp_iter_thms, fp_rec_thms), lthy)) =
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
   176
      fp_bnf construct fp_bs mixfixes (map dest_TFree unsorted_As) fp_eqs no_defs_lthy0;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   177
49363
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   178
    fun add_nesty_bnf_names Us =
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   179
      let
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   180
        fun add (Type (s, Ts)) ss =
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   181
            let val (needs, ss') = fold_map add Ts ss in
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   182
              if exists I needs then (true, insert (op =) s ss') else (false, ss')
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   183
            end
49363
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   184
          | add T ss = (member (op =) Us T, ss);
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   185
      in snd oo add end;
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   186
49363
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   187
    fun nesty_bnfs Us =
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   188
      map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssBs []);
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   189
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   190
    val nesting_bnfs = nesty_bnfs As;
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   191
    val nested_bnfs = nesty_bnfs Bs;
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   192
49167
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   193
    val timer = time (Timer.startRealTimer ());
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   194
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   195
    fun mk_unf_or_fld get_T Ts t =
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   196
      let val Type (_, Ts0) = get_T (fastype_of t) in
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
   197
        Term.subst_atomic_types (Ts0 ~~ Ts) t
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   198
      end;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   199
49126
1bbd7a37fc29 implemented "mk_inject_tac"
blanchet
parents: 49125
diff changeset
   200
    val mk_unf = mk_unf_or_fld domain_type;
1bbd7a37fc29 implemented "mk_inject_tac"
blanchet
parents: 49125
diff changeset
   201
    val mk_fld = mk_unf_or_fld range_type;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   202
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   203
    val unfs = map (mk_unf As) unfs0;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   204
    val flds = map (mk_fld As) flds0;
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
   205
49201
blanchet
parents: 49200
diff changeset
   206
    val fpTs = map (domain_type o fastype_of) unfs;
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   207
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   208
    val exists_fp_subtype = exists_subtype (member (op =) fpTs);
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   209
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   210
    val vs = map2 (curry Free) vs' fpTs;
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   211
49297
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
   212
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Bs ~~ fpTs)))) ctr_TsssBs;
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   213
    val ns = map length ctr_Tsss;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   214
    val kss = map (fn n => 1 upto n) ns;
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   215
    val mss = map (map length) ctr_Tsss;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   216
    val Css = map2 replicate ns Cs;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   217
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   218
    fun mk_iter_like Ts Us t =
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   219
      let
49336
blanchet
parents: 49330
diff changeset
   220
        val (bindings, body) = strip_type (fastype_of t);
blanchet
parents: 49330
diff changeset
   221
        val (f_Us, prebody) = split_last bindings;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   222
        val Type (_, Ts0) = if lfp then prebody else body;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   223
        val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us);
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   224
      in
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   225
        Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   226
      end;
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   227
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   228
    val fp_iters as fp_iter1 :: _ = map (mk_iter_like As Cs) fp_iters0;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   229
    val fp_recs as fp_rec1 :: _ = map (mk_iter_like As Cs) fp_recs0;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   230
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   231
    val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1)));
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   232
    val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1)));
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   233
49256
df98aeb80a19 avoid type inference + tuning
blanchet
parents: 49255
diff changeset
   234
    val ((iter_only as (gss, _, _), rec_only as (hss, _, _)),
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   235
         (zs, cs, cpss, coiter_only as ((pgss, crgsss), _), corec_only as ((phss, cshsss), _))) =
49208
blanchet
parents: 49207
diff changeset
   236
      if lfp then
blanchet
parents: 49207
diff changeset
   237
        let
blanchet
parents: 49207
diff changeset
   238
          val y_Tsss =
49255
2ecc533d6697 use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents: 49254
diff changeset
   239
            map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type)
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   240
              ns mss fp_iter_fun_Ts;
49208
blanchet
parents: 49207
diff changeset
   241
          val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css;
blanchet
parents: 49207
diff changeset
   242
blanchet
parents: 49207
diff changeset
   243
          val ((gss, ysss), _) =
blanchet
parents: 49207
diff changeset
   244
            lthy
blanchet
parents: 49207
diff changeset
   245
            |> mk_Freess "f" g_Tss
blanchet
parents: 49207
diff changeset
   246
            ||>> mk_Freesss "x" y_Tsss;
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   247
          val yssss = map (map (map single)) ysss;
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   248
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   249
          fun dest_rec_prodT (T as Type (@{type_name prod}, Us as [_, U])) =
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   250
              if member (op =) Cs U then Us else [T]
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   251
            | dest_rec_prodT T = [T];
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   252
49208
blanchet
parents: 49207
diff changeset
   253
          val z_Tssss =
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   254
            map3 (fn n => fn ms => map2 (map dest_rec_prodT oo dest_tupleT) ms o
49255
2ecc533d6697 use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents: 49254
diff changeset
   255
              dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts;
49208
blanchet
parents: 49207
diff changeset
   256
          val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css;
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   257
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   258
          val hss = map2 (map2 retype_free) h_Tss gss;
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   259
          val zssss_hd = map2 (map2 (map2 (retype_free o hd))) z_Tssss ysss;
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   260
          val (zssss_tl, _) =
49208
blanchet
parents: 49207
diff changeset
   261
            lthy
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   262
            |> mk_Freessss "y" (map (map (map tl)) z_Tssss);
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   263
          val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   264
        in
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   265
          (((gss, g_Tss, yssss), (hss, h_Tss, zssss)),
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   266
           ([], [], [], (([], []), ([], [])), (([], []), ([], []))))
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   267
        end
49208
blanchet
parents: 49207
diff changeset
   268
      else
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   269
        let
49221
6d8d5fe9f3a2 fixed bug with one-value types with phantom type arguments
blanchet
parents: 49220
diff changeset
   270
          (*avoid "'a itself" arguments in coiterators and corecursors*)
6d8d5fe9f3a2 fixed bug with one-value types with phantom type arguments
blanchet
parents: 49220
diff changeset
   271
          val mss' =  map (fn [0] => [1] | ms => ms) mss;
6d8d5fe9f3a2 fixed bug with one-value types with phantom type arguments
blanchet
parents: 49220
diff changeset
   272
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   273
          val p_Tss = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_predT) ns Cs;
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   274
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   275
          fun zip_predss_getterss qss fss = maps (op @) (qss ~~ fss);
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   276
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   277
          fun zip_preds_predsss_gettersss [] [qss] [fss] = zip_predss_getterss qss fss
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   278
            | zip_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) =
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   279
              p :: zip_predss_getterss qss fss @ zip_preds_predsss_gettersss ps qsss fsss;
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   280
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   281
          fun mk_types maybe_dest_sumT fun_Ts =
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   282
            let
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   283
              val f_sum_prod_Ts = map range_type fun_Ts;
49255
2ecc533d6697 use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents: 49254
diff changeset
   284
              val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts;
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   285
              val f_Tssss =
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   286
                map3 (fn C => map2 (map (map (curry (op -->) C) o maybe_dest_sumT) oo dest_tupleT))
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   287
                  Cs mss' f_prod_Tss;
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   288
              val q_Tssss =
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   289
                map (map (map (fn [_] => [] | [_, C] => [mk_predT (domain_type C)]))) f_Tssss;
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   290
              val pf_Tss = map3 zip_preds_predsss_gettersss p_Tss q_Tssss f_Tssss;
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   291
            in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end;
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   292
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   293
          val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_iter_fun_Ts;
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   294
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   295
          val ((((Free (z, _), cs), pss), gssss), _) =
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   296
            lthy
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   297
            |> yield_singleton (mk_Frees "z") dummyT
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   298
            ||>> mk_Frees "a" Cs
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   299
            ||>> mk_Freess "p" p_Tss
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   300
            ||>> mk_Freessss "g" g_Tssss;
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   301
          val rssss = map (map (map (fn [] => []))) r_Tssss;
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   302
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   303
          fun dest_corec_sumT (T as Type (@{type_name sum}, Us as [_, U])) =
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   304
              if member (op =) Cs U then Us else [T]
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   305
            | dest_corec_sumT T = [T];
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   306
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   307
          val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   308
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   309
          val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss;
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   310
          val ((sssss, hssss_tl), _) =
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   311
            lthy
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   312
            |> mk_Freessss "q" s_Tssss
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   313
            ||>> mk_Freessss "h" (map (map (map tl)) h_Tssss);
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   314
          val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl;
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   315
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   316
          val cpss = map2 (fn c => map (fn p => p $ c)) cs pss;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   317
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   318
          fun mk_preds_getters_join [] [cf] = cf
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   319
            | mk_preds_getters_join [cq] [cf, cf'] =
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   320
              mk_If cq (mk_Inl (fastype_of cf') cf) (mk_Inr (fastype_of cf) cf');
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   321
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   322
          fun mk_terms qssss fssss =
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   323
            let
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   324
              val pfss = map3 zip_preds_predsss_gettersss pss qssss fssss;
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   325
              val cqssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs qssss;
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   326
              val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss;
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   327
              val cqfsss = map2 (map2 (map2 mk_preds_getters_join)) cqssss cfssss;
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   328
            in (pfss, cqfsss) end;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   329
        in
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   330
          ((([], [], []), ([], [], [])),
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   331
           ([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)),
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   332
            (mk_terms sssss hssss, (h_sum_prod_Ts, ph_Tss))))
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   333
        end;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   334
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   335
    fun define_ctrs_case_for_type (((((((((((((((((((fp_b, fpT), C), v), fld), unf), fp_iter),
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   336
          fp_rec), fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_bindings), ctr_mixfixes),
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   337
        ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy =
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   338
      let
49201
blanchet
parents: 49200
diff changeset
   339
        val unfT = domain_type (fastype_of fld);
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   340
        val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
49255
2ecc533d6697 use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents: 49254
diff changeset
   341
        val ctr_sum_prod_T = mk_sumTN_balanced ctr_prod_Ts;
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   342
        val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   343
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   344
        val (((u, fs), xss), _) =
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   345
          no_defs_lthy
49201
blanchet
parents: 49200
diff changeset
   346
          |> yield_singleton (mk_Frees "u") unfT
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   347
          ||>> mk_Frees "f" case_Ts
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
   348
          ||>> mk_Freess "x" ctr_Tss;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   349
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   350
        val ctr_rhss =
49256
df98aeb80a19 avoid type inference + tuning
blanchet
parents: 49255
diff changeset
   351
          map2 (fn k => fn xs => fold_rev Term.lambda xs (fld $
df98aeb80a19 avoid type inference + tuning
blanchet
parents: 49255
diff changeset
   352
            mk_InN_balanced ctr_sum_prod_T n (HOLogic.mk_tuple xs) k)) ks xss;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   353
49336
blanchet
parents: 49330
diff changeset
   354
        val case_binding = Binding.suffix_name ("_" ^ caseN) fp_b;
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   355
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   356
        val case_rhs =
49255
2ecc533d6697 use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents: 49254
diff changeset
   357
          fold_rev Term.lambda (fs @ [v])
2ecc533d6697 use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents: 49254
diff changeset
   358
            (mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (unf $ v));
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   359
49201
blanchet
parents: 49200
diff changeset
   360
        val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
49169
937a0fadddfb honor mixfix specifications
blanchet
parents: 49167
diff changeset
   361
          |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
49302
f5bd87aac224 added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents: 49300
diff changeset
   362
              Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
49336
blanchet
parents: 49330
diff changeset
   363
            (case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   364
          ||> `Local_Theory.restore;
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   365
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   366
        val phi = Proof_Context.export_morphism lthy lthy';
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   367
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   368
        val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
49130
3c26e17b2849 implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents: 49129
diff changeset
   369
        val case_def = Morphism.thm phi raw_case_def;
3c26e17b2849 implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents: 49129
diff changeset
   370
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   371
        val ctrs0 = map (Morphism.term phi) raw_ctrs;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   372
        val casex0 = Morphism.term phi raw_case;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   373
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   374
        val ctrs = map (mk_ctr As) ctrs0;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   375
49135
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   376
        fun exhaust_tac {context = ctxt, ...} =
49123
263b0e330d8b more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents: 49121
diff changeset
   377
          let
49135
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   378
            val fld_iff_unf_thm =
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   379
              let
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   380
                val goal =
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   381
                  fold_rev Logic.all [u, v]
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   382
                    (mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u)));
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   383
              in
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   384
                Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
49201
blanchet
parents: 49200
diff changeset
   385
                  mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT])
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   386
                    (certify lthy fld) (certify lthy unf) fld_unf unf_fld)
49135
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   387
                |> Thm.close_derivation
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   388
                |> Morphism.thm phi
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   389
              end;
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   390
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   391
            val sumEN_thm' =
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   392
              Local_Defs.unfold lthy @{thms all_unit_eq}
49255
2ecc533d6697 use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents: 49254
diff changeset
   393
                (Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) []
2ecc533d6697 use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents: 49254
diff changeset
   394
                   (mk_sumEN_balanced n))
49135
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   395
              |> Morphism.thm phi;
49123
263b0e330d8b more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents: 49121
diff changeset
   396
          in
49161
a8e74375d971 fixed (n + 1)st bug in "mk_exhaust_tac" -- arose with uncurried constructors
blanchet
parents: 49157
diff changeset
   397
            mk_exhaust_tac ctxt n ctr_defs fld_iff_unf_thm sumEN_thm'
49123
263b0e330d8b more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents: 49121
diff changeset
   398
          end;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   399
49126
1bbd7a37fc29 implemented "mk_inject_tac"
blanchet
parents: 49125
diff changeset
   400
        val inject_tacss =
49205
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   401
          map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} =>
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   402
              mk_inject_tac ctxt ctr_def fld_inject]) ms ctr_defs;
49126
1bbd7a37fc29 implemented "mk_inject_tac"
blanchet
parents: 49125
diff changeset
   403
49127
f7326a0d7f19 implemented "mk_half_distinct_tac"
blanchet
parents: 49126
diff changeset
   404
        val half_distinct_tacss =
f7326a0d7f19 implemented "mk_half_distinct_tac"
blanchet
parents: 49126
diff changeset
   405
          map (map (fn (def, def') => fn {context = ctxt, ...} =>
f7326a0d7f19 implemented "mk_half_distinct_tac"
blanchet
parents: 49126
diff changeset
   406
            mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs);
f7326a0d7f19 implemented "mk_half_distinct_tac"
blanchet
parents: 49126
diff changeset
   407
49130
3c26e17b2849 implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents: 49129
diff changeset
   408
        val case_tacs =
3c26e17b2849 implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents: 49129
diff changeset
   409
          map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} =>
3c26e17b2849 implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents: 49129
diff changeset
   410
            mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   411
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   412
        val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs];
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   413
49287
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   414
        fun define_iter_rec ((selss0, discIs, sel_thmss), no_defs_lthy) =
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   415
          let
49208
blanchet
parents: 49207
diff changeset
   416
            val fpT_to_C = fpT --> C;
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   417
49215
blanchet
parents: 49214
diff changeset
   418
            fun generate_iter_like (suf, fp_iter_like, (fss, f_Tss, xssss)) =
blanchet
parents: 49214
diff changeset
   419
              let
blanchet
parents: 49214
diff changeset
   420
                val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
49336
blanchet
parents: 49330
diff changeset
   421
                val binding = Binding.suffix_name ("_" ^ suf) fp_b;
49215
blanchet
parents: 49214
diff changeset
   422
                val spec =
49336
blanchet
parents: 49330
diff changeset
   423
                  mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binding, res_T)),
49215
blanchet
parents: 49214
diff changeset
   424
                    Term.list_comb (fp_iter_like,
49255
2ecc533d6697 use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents: 49254
diff changeset
   425
                      map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss));
49336
blanchet
parents: 49330
diff changeset
   426
              in (binding, spec) end;
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   427
49300
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   428
            val iter_like_infos =
49215
blanchet
parents: 49214
diff changeset
   429
              [(iterN, fp_iter, iter_only),
blanchet
parents: 49214
diff changeset
   430
               (recN, fp_rec, rec_only)];
blanchet
parents: 49214
diff changeset
   431
49336
blanchet
parents: 49330
diff changeset
   432
            val (bindings, specs) = map generate_iter_like iter_like_infos |> split_list;
49215
blanchet
parents: 49214
diff changeset
   433
blanchet
parents: 49214
diff changeset
   434
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
49201
blanchet
parents: 49200
diff changeset
   435
              |> apfst split_list o fold_map2 (fn b => fn spec =>
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   436
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
49336
blanchet
parents: 49330
diff changeset
   437
                #>> apsnd snd) bindings specs
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   438
              ||> `Local_Theory.restore;
49201
blanchet
parents: 49200
diff changeset
   439
blanchet
parents: 49200
diff changeset
   440
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet
parents: 49200
diff changeset
   441
49215
blanchet
parents: 49214
diff changeset
   442
            val [iter_def, rec_def] = map (Morphism.thm phi) defs;
49201
blanchet
parents: 49200
diff changeset
   443
49215
blanchet
parents: 49214
diff changeset
   444
            val [iter, recx] = map (mk_iter_like As Cs o Morphism.term phi) csts;
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   445
          in
49267
c96a07255e10 correctly generate sel_coiter and sel_corec theorems
blanchet
parents: 49266
diff changeset
   446
            ((ctrs, selss0, iter, recx, v, xss, ctr_defs, discIs, sel_thmss, iter_def, rec_def),
49266
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   447
             lthy)
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   448
          end;
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   449
49287
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   450
        fun define_coiter_corec ((selss0, discIs, sel_thmss), no_defs_lthy) =
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   451
          let
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   452
            val B_to_fpT = C --> fpT;
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   453
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   454
            fun mk_preds_getterss_join c n cps sum_prod_T cqfss =
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   455
              Term.lambda c (mk_IfN sum_prod_T cps
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   456
                (map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n)));
49275
ce87d6a901eb split sum types in corecursor definition
blanchet
parents: 49274
diff changeset
   457
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   458
            fun generate_coiter_like (suf, fp_iter_like, ((pfss, cqfsss), (f_sum_prod_Ts,
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   459
                pf_Tss))) =
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   460
              let
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   461
                val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT;
49336
blanchet
parents: 49330
diff changeset
   462
                val binding = Binding.suffix_name ("_" ^ suf) fp_b;
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   463
                val spec =
49336
blanchet
parents: 49330
diff changeset
   464
                  mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binding, res_T)),
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   465
                    Term.list_comb (fp_iter_like,
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   466
                      map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss));
49336
blanchet
parents: 49330
diff changeset
   467
              in (binding, spec) end;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   468
49300
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   469
            val coiter_like_infos =
49215
blanchet
parents: 49214
diff changeset
   470
              [(coiterN, fp_iter, coiter_only),
blanchet
parents: 49214
diff changeset
   471
               (corecN, fp_rec, corec_only)];
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   472
49336
blanchet
parents: 49330
diff changeset
   473
            val (bindings, specs) = map generate_coiter_like coiter_like_infos |> split_list;
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   474
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   475
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   476
              |> apfst split_list o fold_map2 (fn b => fn spec =>
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   477
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
49336
blanchet
parents: 49330
diff changeset
   478
                #>> apsnd snd) bindings specs
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   479
              ||> `Local_Theory.restore;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   480
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   481
            val phi = Proof_Context.export_morphism lthy lthy';
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   482
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   483
            val [coiter_def, corec_def] = map (Morphism.thm phi) defs;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   484
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   485
            val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   486
          in
49267
c96a07255e10 correctly generate sel_coiter and sel_corec theorems
blanchet
parents: 49266
diff changeset
   487
            ((ctrs, selss0, coiter, corec, v, xss, ctr_defs, discIs, sel_thmss, coiter_def,
49266
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   488
              corec_def), lthy)
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   489
          end;
49286
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   490
49287
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   491
        fun wrap lthy =
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   492
          let val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss in
49336
blanchet
parents: 49330
diff changeset
   493
            wrap_datatype tacss (((no_dests, ctrs0), casex0), (disc_bindings, (sel_bindingss,
49287
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   494
              sel_defaultss))) lthy
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   495
          end;
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   496
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   497
        val define_iter_likes = if lfp then define_iter_rec else define_coiter_corec;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   498
      in
49287
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   499
        ((wrap, define_iter_likes), lthy')
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   500
      end;
49167
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   501
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   502
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   503
    val pre_set_defss = map set_defs_of_bnf pre_bnfs;
49363
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   504
    val nesting_map_ids = map map_id_of_bnf nesting_bnfs;
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   505
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   506
    fun mk_map Ts Us t =
49217
0c9546fc789f fixed handling of map of "fun"
blanchet
parents: 49216
diff changeset
   507
      let val (Type (_, Ts0), Type (_, Us0)) = strip_map_type (fastype_of t) |>> List.last in
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   508
        Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   509
      end;
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   510
49234
blanchet
parents: 49233
diff changeset
   511
    fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) =
blanchet
parents: 49233
diff changeset
   512
      let
49236
632f68beff2a full name of a type as key in bnf table
traytel
parents: 49235
diff changeset
   513
        val map0 = map_of_bnf (the (bnf_of lthy s));
49234
blanchet
parents: 49233
diff changeset
   514
        val mapx = mk_map Ts Us map0;
blanchet
parents: 49233
diff changeset
   515
        val TUs = map dest_funT (fst (split_last (fst (strip_map_type (fastype_of mapx)))));
blanchet
parents: 49233
diff changeset
   516
        val args = map build_arg TUs;
blanchet
parents: 49233
diff changeset
   517
      in Term.list_comb (mapx, args) end;
blanchet
parents: 49233
diff changeset
   518
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   519
    fun derive_induct_iter_rec_thms_for_types ((ctrss, _, iters, recs, vs, xsss, ctr_defss, _, _,
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   520
        iter_defs, rec_defs), lthy) =
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   521
      let
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   522
        fun mk_sets_nested bnf =
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   523
          let
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   524
            val Type (T_name, Us) = T_of_bnf bnf;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   525
            val lives = lives_of_bnf bnf;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   526
            val sets = sets_of_bnf bnf;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   527
            fun mk_set U =
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   528
              (case find_index (curry (op =) U) lives of
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   529
                ~1 => Term.dummy
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   530
              | i => nth sets i);
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   531
          in
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   532
            (T_name, map mk_set Us)
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   533
          end;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   534
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   535
        val setss_nested = map mk_sets_nested nested_bnfs;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   536
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   537
        val (induct_thms, induct_thm) =
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   538
          let
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   539
            val ((phis, phis'), names_lthy) =
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   540
              lthy
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   541
              |> mk_Frees' "P" (map mk_predT fpTs);
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   542
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   543
            fun mk_set Ts t =
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   544
              let val Type (_, Ts0) = domain_type (fastype_of t) in
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   545
                Term.subst_atomic_types (Ts0 ~~ Ts) t
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   546
              end;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   547
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   548
            fun mk_prem_prems names_lthy (x as Free (s, T as Type (T_name, Ts0))) =
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   549
                (case find_index (curry (op =) T) fpTs of
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   550
                  ~1 =>
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   551
                  (case AList.lookup (op =) setss_nested T_name of
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   552
                    NONE => []
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   553
                  | SOME raw_sets0 =>
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   554
                    let
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   555
                      val (Ts, raw_sets) =
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   556
                        split_list (filter (exists_fp_subtype o fst) (Ts0 ~~ raw_sets0));
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   557
                      val sets = map (mk_set Ts0) raw_sets;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   558
                      val (ys, names_lthy') = names_lthy |> mk_Frees s Ts;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   559
                      val heads =
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   560
                        map2 (fn y => fn set => HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x)))
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   561
                          ys sets;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   562
                      val bodies = flat (map (mk_prem_prems names_lthy') ys);
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   563
                    in
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   564
                      map2 (curry Logic.mk_implies) heads bodies
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   565
                    end)
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   566
                | i => [HOLogic.mk_Trueprop (nth phis i $ x)])
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   567
              | mk_prem_prems _ _ = [];
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   568
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   569
            fun close_prem_prem (Free x') t =
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   570
              fold_rev Logic.all (map Free (drop (N + 1) (rev (Term.add_frees t (x' :: phis'))))) t;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   571
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   572
            fun mk_prem phi ctr ctr_Ts =
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   573
              let
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   574
                val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   575
                val prem_prems =
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   576
                  maps (fn x => map (close_prem_prem x) (mk_prem_prems names_lthy' x)) xs;
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   577
              in
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   578
                fold_rev Logic.all xs
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   579
                  (Logic.list_implies (prem_prems,
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   580
                     HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))))
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   581
              end;
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   582
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   583
            val goal =
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   584
              fold_rev (fold_rev Logic.all) [phis, vs]
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   585
                (Library.foldr Logic.list_implies (map3 (map2 o mk_prem) phis ctrss ctr_Tsss,
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   586
                   HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   587
                     (map2 (curry (op $)) phis vs))));
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   588
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   589
            val induct_thm =
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   590
              Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   591
                mk_induct_tac ctxt);
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   592
          in
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   593
            `(conj_dests N) induct_thm
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   594
          end;
49201
blanchet
parents: 49200
diff changeset
   595
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   596
        val (iter_thmss, rec_thmss) =
49207
4634c217b77b completed iter/rec proofs
blanchet
parents: 49205
diff changeset
   597
          let
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   598
            val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   599
            val giters = map (lists_bmoc gss) iters;
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   600
            val hrecs = map (lists_bmoc hss) recs;
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   601
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   602
            fun mk_goal_iter_like fss fiter_like xctr f xs fxs =
49207
4634c217b77b completed iter/rec proofs
blanchet
parents: 49205
diff changeset
   603
              fold_rev (fold_rev Logic.all) (xs :: fss)
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   604
                (mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs)));
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   605
49234
blanchet
parents: 49233
diff changeset
   606
            fun build_call fiter_likes maybe_tick (T, U) =
blanchet
parents: 49233
diff changeset
   607
              if T = U then
blanchet
parents: 49233
diff changeset
   608
                mk_id T
blanchet
parents: 49233
diff changeset
   609
              else
blanchet
parents: 49233
diff changeset
   610
                (case find_index (curry (op =) T) fpTs of
blanchet
parents: 49233
diff changeset
   611
                  ~1 => build_map (build_call fiter_likes maybe_tick) T U
blanchet
parents: 49233
diff changeset
   612
                | j => maybe_tick (nth vs j) (nth fiter_likes j));
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   613
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   614
            fun mk_U maybe_mk_prodT =
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   615
              typ_subst (map2 (fn fpT => fn C => (fpT, maybe_mk_prodT fpT C)) fpTs Cs);
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   616
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   617
            fun intr_calls fiter_likes maybe_cons maybe_tick maybe_mk_prodT (x as Free (_, T)) =
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   618
              if member (op =) fpTs T then
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   619
                maybe_cons x [build_call fiter_likes (K I) (T, mk_U (K I) T) $ x]
49362
1271aca16aed make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents: 49361
diff changeset
   620
              else if exists_fp_subtype T then
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   621
                [build_call fiter_likes maybe_tick (T, mk_U maybe_mk_prodT T) $ x]
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   622
              else
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   623
                [x];
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   624
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   625
            val gxsss = map (map (maps (intr_calls giters (K I) (K I) (K I)))) xsss;
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   626
            val hxsss = map (map (maps (intr_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss;
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   627
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   628
            val goal_iterss = map5 (map4 o mk_goal_iter_like gss) giters xctrss gss xsss gxsss;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   629
            val goal_recss = map5 (map4 o mk_goal_iter_like hss) hrecs xctrss hss xsss hxsss;
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   630
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   631
            val iter_tacss =
49363
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   632
              map2 (map o mk_iter_like_tac pre_map_defs nesting_map_ids iter_defs) fp_iter_thms
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   633
                ctr_defss;
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   634
            val rec_tacss =
49363
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   635
              map2 (map o mk_iter_like_tac pre_map_defs nesting_map_ids rec_defs) fp_rec_thms
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   636
                ctr_defss;
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   637
          in
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   638
            (map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
49205
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   639
               goal_iterss iter_tacss,
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   640
             map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
49205
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   641
               goal_recss rec_tacss)
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   642
          end;
49201
blanchet
parents: 49200
diff changeset
   643
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   644
        val common_notes =
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   645
          (if N > 1 then [(inductN, [induct_thm], [])] (* FIXME: attribs *) else [])
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   646
          |> map (fn (thmN, thms, attrs) =>
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   647
              ((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])]));
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   648
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   649
        val notes =
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   650
          [(inductN, map single induct_thms, []), (* FIXME: attribs *)
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   651
           (itersN, iter_thmss, simp_attrs),
49300
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   652
           (recsN, rec_thmss, Code.add_default_eqn_attrib :: simp_attrs)]
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   653
          |> maps (fn (thmN, thmss, attrs) =>
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   654
            map2 (fn b => fn thms =>
49300
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   655
              ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs),
49302
f5bd87aac224 added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents: 49300
diff changeset
   656
                [(thms, [])])) fp_bs thmss);
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   657
      in
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   658
        lthy |> Local_Theory.notes (common_notes @ notes) |> snd
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   659
      end;
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   660
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   661
    fun derive_coinduct_coiter_corec_thms_for_types ((ctrss, selsss, coiters, corecs, vs, _,
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   662
        ctr_defss, discIss, sel_thmsss, coiter_defs, corec_defs), lthy) =
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   663
      let
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   664
        val (coinduct_thms, coinduct_thm) =
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   665
          let
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   666
            val coinduct_thm = fp_induct;
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   667
          in
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   668
            `(conj_dests N) coinduct_thm
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   669
          end;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   670
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   671
        val (coiter_thmss, corec_thmss) =
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   672
          let
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   673
            val z = the_single zs;
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   674
            val gcoiters = map (lists_bmoc pgss) coiters;
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   675
            val hcorecs = map (lists_bmoc phss) corecs;
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   676
49232
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   677
            fun mk_goal_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not);
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   678
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   679
            fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr m cfs' =
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   680
              fold_rev (fold_rev Logic.all) ([c] :: pfss)
49232
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   681
                (Logic.list_implies (seq_conds mk_goal_cond n k cps,
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   682
                   mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, take m cfs'))));
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   683
49234
blanchet
parents: 49233
diff changeset
   684
            fun build_call fiter_likes maybe_tack (T, U) =
blanchet
parents: 49233
diff changeset
   685
              if T = U then
blanchet
parents: 49233
diff changeset
   686
                mk_id T
blanchet
parents: 49233
diff changeset
   687
              else
blanchet
parents: 49233
diff changeset
   688
                (case find_index (curry (op =) U) fpTs of
blanchet
parents: 49233
diff changeset
   689
                  ~1 => build_map (build_call fiter_likes maybe_tack) T U
blanchet
parents: 49233
diff changeset
   690
                | j => maybe_tack (nth cs j, nth vs j) (nth fiter_likes j));
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   691
49274
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   692
            fun mk_U maybe_mk_sumT =
ddd606ec45b9 first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents: 49273
diff changeset
   693
              typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs);
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   694
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   695
            fun intr_calls fiter_likes maybe_mk_sumT maybe_tack cqf =
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   696
              let val T = fastype_of cqf in
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   697
                if exists_subtype (member (op =) Cs) T then
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   698
                  build_call fiter_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cqf
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   699
                else
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   700
                  cqf
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   701
              end;
49232
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   702
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   703
            val crgsss' = map (map (map (intr_calls gcoiters (K I) (K I)))) crgsss;
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   704
            val cshsss' = map (map (map (intr_calls hcorecs (curry mk_sumT) (tack z)))) cshsss;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   705
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   706
            val goal_coiterss =
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   707
              map8 (map4 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss mss crgsss';
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   708
            val goal_corecss =
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   709
              map8 (map4 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss mss cshsss';
49213
975ccb0130cb some work on coiter tactic
blanchet
parents: 49212
diff changeset
   710
975ccb0130cb some work on coiter tactic
blanchet
parents: 49212
diff changeset
   711
            val coiter_tacss =
49363
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   712
              map3 (map oo mk_coiter_like_tac coiter_defs nesting_map_ids) fp_iter_thms pre_map_defs
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   713
                ctr_defss;
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   714
            val corec_tacss =
49363
8fc53d925629 distinguish between nested and nesting BNFs
blanchet
parents: 49362
diff changeset
   715
              map3 (map oo mk_coiter_like_tac corec_defs nesting_map_ids) fp_rec_thms pre_map_defs
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   716
                ctr_defss;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   717
          in
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   718
            (map2 (map2 (fn goal => fn tac =>
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   719
                 Skip_Proof.prove lthy [] [] goal (tac o #context) |> Thm.close_derivation))
49213
975ccb0130cb some work on coiter tactic
blanchet
parents: 49212
diff changeset
   720
               goal_coiterss coiter_tacss,
49276
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   721
             map2 (map2 (fn goal => fn tac =>
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   722
                 Skip_Proof.prove lthy [] [] goal (tac o #context)
59fa53ed7507 finished splitting sum types for corecursors
blanchet
parents: 49275
diff changeset
   723
                 |> Local_Defs.unfold lthy @{thms sum_case_if} |> Thm.close_derivation))
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   724
               goal_corecss corec_tacss)
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   725
          end;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   726
49266
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   727
        fun mk_disc_coiter_like_thms [_] = K []
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   728
          | mk_disc_coiter_like_thms thms = map2 (curry (op RS)) thms;
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   729
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   730
        val disc_coiter_thmss = map2 mk_disc_coiter_like_thms coiter_thmss discIss;
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   731
        val disc_corec_thmss = map2 mk_disc_coiter_like_thms corec_thmss discIss;
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   732
49267
c96a07255e10 correctly generate sel_coiter and sel_corec theorems
blanchet
parents: 49266
diff changeset
   733
        fun mk_sel_coiter_like_thm coiter_like_thm sel0 sel_thm =
49266
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   734
          let
49267
c96a07255e10 correctly generate sel_coiter and sel_corec theorems
blanchet
parents: 49266
diff changeset
   735
            val (domT, ranT) = dest_funT (fastype_of sel0);
49266
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   736
            val arg_cong' =
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   737
              Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT])
49267
c96a07255e10 correctly generate sel_coiter and sel_corec theorems
blanchet
parents: 49266
diff changeset
   738
                [NONE, NONE, SOME (certify lthy sel0)] arg_cong
c96a07255e10 correctly generate sel_coiter and sel_corec theorems
blanchet
parents: 49266
diff changeset
   739
              |> Thm.varifyT_global;
49266
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   740
            val sel_thm' = sel_thm RSN (2, trans);
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   741
          in
49267
c96a07255e10 correctly generate sel_coiter and sel_corec theorems
blanchet
parents: 49266
diff changeset
   742
            coiter_like_thm RS arg_cong' RS sel_thm'
49266
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   743
          end;
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   744
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   745
        val sel_coiter_thmsss =
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   746
          map3 (map3 (map2 o mk_sel_coiter_like_thm)) coiter_thmss selsss sel_thmsss;
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   747
        val sel_corec_thmsss =
49267
c96a07255e10 correctly generate sel_coiter and sel_corec theorems
blanchet
parents: 49266
diff changeset
   748
          map3 (map3 (map2 o mk_sel_coiter_like_thm)) corec_thmss selsss sel_thmsss;
49266
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   749
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   750
        val common_notes =
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   751
          (if N > 1 then [(coinductN, [coinduct_thm], [])] (* FIXME: attribs *) else [])
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   752
          |> map (fn (thmN, thms, attrs) =>
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   753
              ((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])]));
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   754
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   755
        val notes =
49342
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   756
          [(coinductN, map single coinduct_thms, []), (* FIXME: attribs *)
8ea4bad49ed5 rough and ready induction
blanchet
parents: 49338
diff changeset
   757
           (coitersN, coiter_thmss, []),
49300
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   758
           (disc_coitersN, disc_coiter_thmss, []),
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   759
           (sel_coitersN, map flat sel_coiter_thmsss, []),
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   760
           (corecsN, corec_thmss, []),
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   761
           (disc_corecsN, disc_corec_thmss, []),
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   762
           (sel_corecsN, map flat sel_corec_thmsss, [])]
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   763
          |> maps (fn (thmN, thmss, attrs) =>
49266
70ffce5b65a4 generate "sel_coiters" and friends
blanchet
parents: 49264
diff changeset
   764
            map_filter (fn (_, []) => NONE | (b, thms) =>
49300
c707df2e2083 added attributes to theorems
blanchet
parents: 49298
diff changeset
   765
              SOME ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs),
49302
f5bd87aac224 added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents: 49300
diff changeset
   766
                [(thms, [])])) (fp_bs ~~ thmss));
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   767
      in
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   768
        lthy |> Local_Theory.notes (common_notes @ notes) |> snd
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   769
      end;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   770
49287
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   771
    fun wrap_types_and_define_iter_likes ((wraps, define_iter_likess), lthy) =
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   772
      fold_map2 (curry (op o)) define_iter_likess wraps lthy |>> split_list11
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   773
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   774
    val lthy' = lthy
49361
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   775
      |> fold_map define_ctrs_case_for_type (fp_bs ~~ fpTs ~~ Cs ~~ vs ~~ flds ~~ unfs ~~
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   776
        fp_iters ~~ fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   777
        ctr_bindingss ~~ ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~
cc1d39529dd1 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents: 49342
diff changeset
   778
        raw_sel_defaultsss)
49287
ebe2a5cec4bf allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents: 49286
diff changeset
   779
      |>> split_list |> wrap_types_and_define_iter_likes
49337
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   780
      |> (if lfp then derive_induct_iter_rec_thms_for_types
538687a77075 set up things for (co)induction sugar
blanchet
parents: 49336
diff changeset
   781
          else derive_coinduct_coiter_corec_thms_for_types);
49167
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   782
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   783
    val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
49208
blanchet
parents: 49207
diff changeset
   784
      (if lfp then "" else "co") ^ "datatype"));
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   785
  in
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
   786
    timer; lthy'
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   787
  end;
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   788
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   789
val datatyp = define_datatype (K I) (K I) (K I);
49297
47fbf2e3e89c provide a programmatic interface for FP sugar
blanchet
parents: 49287
diff changeset
   790
49298
36e551d3af3b support for sort constraints in new (co)data commands
blanchet
parents: 49297
diff changeset
   791
val datatype_cmd = define_datatype Typedecl.read_constraint Syntax.parse_typ Syntax.read_term;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   792
49329
82452dc63ed5 desambiguate grammar (e.g. for Nil's mixfix ("[]"))
blanchet
parents: 49311
diff changeset
   793
val parse_binding_colon = Parse.binding --| @{keyword ":"};
49336
blanchet
parents: 49330
diff changeset
   794
val parse_opt_binding_colon = Scan.optional parse_binding_colon no_binding;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   795
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   796
val parse_ctr_arg =
49329
82452dc63ed5 desambiguate grammar (e.g. for Nil's mixfix ("[]"))
blanchet
parents: 49311
diff changeset
   797
  @{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"} ||
49336
blanchet
parents: 49330
diff changeset
   798
  (Parse.typ >> pair no_binding);
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   799
49286
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   800
val parse_defaults =
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   801
  @{keyword "("} |-- @{keyword "defaults"} |-- Scan.repeat parse_bound_term --| @{keyword ")"};
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   802
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   803
val parse_single_spec =
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   804
  Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix --
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   805
  (@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding --
49286
dde4967c9233 added "defaults" option
blanchet
parents: 49280
diff changeset
   806
    Scan.repeat parse_ctr_arg -- Scan.optional parse_defaults [] -- Parse.opt_mixfix));
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   807
49278
718e4ad1517e added no_dests option
blanchet
parents: 49277
diff changeset
   808
val parse_datatype = parse_wrap_options -- Parse.and_list1 parse_single_spec;
718e4ad1517e added no_dests option
blanchet
parents: 49277
diff changeset
   809
49308
6190b701e4f4 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents: 49302
diff changeset
   810
fun parse_datatype_cmd lfp construct = parse_datatype >> datatype_cmd lfp construct;
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   811
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   812
end;