src/HOL/Codatatype/Tools/bnf_fp_sugar.ML
author blanchet
Sun, 09 Sep 2012 19:05:53 +0200
changeset 49234 4626ff7cbd2c
parent 49233 7f412734fbb3
child 49235 f9fc2b64c599
permissions -rw-r--r--
tuning
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
49205
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
    10
  (* TODO: programmatic interface *)
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    11
end;
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    12
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    13
structure BNF_FP_Sugar : BNF_FP_SUGAR =
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    14
struct
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    15
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    16
open BNF_Util
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    17
open BNF_Wrap
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    18
open BNF_Def
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    19
open BNF_FP_Util
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    20
open BNF_LFP
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    21
open BNF_GFP
49123
263b0e330d8b more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents: 49121
diff changeset
    22
open BNF_FP_Sugar_Tactics
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    23
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
    24
val caseN = "case";
49213
975ccb0130cb some work on coiter tactic
blanchet
parents: 49212
diff changeset
    25
val coitersN = "coiters";
975ccb0130cb some work on coiter tactic
blanchet
parents: 49212
diff changeset
    26
val corecsN = "corecs";
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
    27
val itersN = "iters";
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
    28
val recsN = "recs";
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
    29
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    30
fun split_list8 xs =
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    31
  (map #1 xs, map #2 xs, map #3 xs, map #4 xs, map #5 xs, map #6 xs, map #7 xs, map #8 xs);
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    32
49217
0c9546fc789f fixed handling of map of "fun"
blanchet
parents: 49216
diff changeset
    33
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
    34
  | strip_map_type T = ([], T);
0c9546fc789f fixed handling of map of "fun"
blanchet
parents: 49216
diff changeset
    35
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    36
fun typ_subst inst (T as Type (s, Ts)) =
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    37
    (case AList.lookup (op =) inst T of
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    38
      NONE => Type (s, map (typ_subst inst) Ts)
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    39
    | SOME T' => T')
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    40
  | 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
    41
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
    42
fun retype_free (Free (s, _)) T = Free (s, T);
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
    43
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
    44
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
    45
49234
blanchet
parents: 49233
diff changeset
    46
fun mk_id T = Const (@{const_name id}, T --> T);
blanchet
parents: 49233
diff changeset
    47
49200
73f9aede57a4 correctly curry recursor arguments
blanchet
parents: 49199
diff changeset
    48
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
    49
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
    50
fun mk_uncurried2_fun f xss =
49200
73f9aede57a4 correctly curry recursor arguments
blanchet
parents: 49199
diff changeset
    51
  mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss);
73f9aede57a4 correctly curry recursor arguments
blanchet
parents: 49199
diff changeset
    52
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
    53
fun tick v f = Term.lambda v (HOLogic.mk_prod (v, f $ v));
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
    54
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
    55
fun tack z_name (c, v) f =
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
    56
  let val z = Free (z_name, mk_sumT (fastype_of v, fastype_of c)) in
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
    57
    Term.lambda z (mk_sum_case (Term.lambda v v) (Term.lambda c (f $ c)) $ z)
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
    58
  end;
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
    59
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
    60
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
    61
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    62
fun merge_type_arg_constrained ctxt (T, c) (T', c') =
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    63
  if T = T' then
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    64
    (case (c, c') of
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    65
      (_, NONE) => (T, c)
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    66
    | (NONE, _) => (T, c')
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    67
    | _ =>
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    68
      if c = c' then
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    69
        (T, c)
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    70
      else
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    71
        error ("Inconsistent sort constraints for type variable " ^
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    72
          quote (Syntax.string_of_typ ctxt T)))
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    73
  else
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    74
    cannot_merge_types ();
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    75
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    76
fun merge_type_args_constrained ctxt (cAs, cAs') =
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    77
  if length cAs = length cAs' then map2 (merge_type_arg_constrained ctxt) cAs cAs'
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    78
  else cannot_merge_types ();
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    79
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    80
fun type_args_constrained_of (((cAs, _), _), _) = cAs;
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    81
val type_args_of = map fst o type_args_constrained_of;
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
    82
fun type_binder_of (((_, b), _), _) = b;
49181
blanchet
parents: 49180
diff changeset
    83
fun mixfix_of ((_, mx), _) = mx;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    84
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    85
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    86
fun disc_of (((disc, _), _), _) = disc;
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    87
fun ctr_of (((_, ctr), _), _) = ctr;
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    88
fun args_of ((_, args), _) = args;
49181
blanchet
parents: 49180
diff changeset
    89
fun ctr_mixfix_of (_, mx) = mx;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    90
49208
blanchet
parents: 49207
diff changeset
    91
fun prepare_datatype prepare_typ lfp specs fake_lthy no_defs_lthy =
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
    92
  let
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    93
    val constrained_As =
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    94
      map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
    95
      |> Library.foldr1 (merge_type_args_constrained no_defs_lthy);
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    96
    val As = map fst constrained_As;
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
    97
    val As' = map dest_TFree As;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
    98
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
    99
    val _ = (case duplicates (op =) As of [] => ()
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   100
      | A :: _ => error ("Duplicate type parameter " ^
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   101
          quote (Syntax.string_of_typ no_defs_lthy A)));
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   102
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   103
    (* TODO: use sort constraints on type args *)
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   104
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   105
    val N = length specs;
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   106
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
   107
    fun mk_fake_T b =
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   108
      Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   109
        As);
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   110
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   111
    val bs = map type_binder_of specs;
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   112
    val fakeTs = map mk_fake_T bs;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   113
49181
blanchet
parents: 49180
diff changeset
   114
    val mixfixes = map mixfix_of specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   115
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   116
    val _ = (case duplicates Binding.eq_name bs of [] => ()
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   117
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   118
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   119
    val ctr_specss = map ctr_specs_of specs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   120
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   121
    val disc_binderss = map (map disc_of) ctr_specss;
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   122
    val ctr_binderss = map (map ctr_of) ctr_specss;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   123
    val ctr_argsss = map (map args_of) ctr_specss;
49181
blanchet
parents: 49180
diff changeset
   124
    val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   125
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   126
    val sel_bindersss = map (map (map fst)) ctr_argsss;
49183
0cc46e2dee7e careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents: 49182
diff changeset
   127
    val fake_ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   128
49183
0cc46e2dee7e careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents: 49182
diff changeset
   129
    val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
49167
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   130
    val _ = (case subtract (op =) As' rhs_As' of
49165
c6ccaf6df93c check type variables on rhs
blanchet
parents: 49161
diff changeset
   131
        [] => ()
c6ccaf6df93c check type variables on rhs
blanchet
parents: 49161
diff changeset
   132
      | A' :: _ => error ("Extra type variables on rhs: " ^
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   133
          quote (Syntax.string_of_typ no_defs_lthy (TFree A'))));
49165
c6ccaf6df93c check type variables on rhs
blanchet
parents: 49161
diff changeset
   134
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   135
    val ((Cs, Xs), _) =
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   136
      no_defs_lthy
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   137
      |> fold (fold (fn s => Variable.declare_typ (TFree (s, dummyS))) o type_args_of) specs
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   138
      |> mk_TFrees N
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   139
      ||>> mk_TFrees N;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   140
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   141
    fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) =
49146
e32b1f748854 added a check
blanchet
parents: 49135
diff changeset
   142
        s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
e32b1f748854 added a check
blanchet
parents: 49135
diff changeset
   143
          quote (Syntax.string_of_typ fake_lthy T)))
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   144
      | eq_fpT _ _ = false;
49146
e32b1f748854 added a check
blanchet
parents: 49135
diff changeset
   145
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   146
    fun freeze_fp (T as Type (s, Us)) =
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   147
        (case find_index (eq_fpT T) fakeTs of ~1 => Type (s, map freeze_fp Us) | j => nth Xs j)
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   148
      | freeze_fp T = T;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   149
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   150
    val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss;
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   151
    val sum_prod_TsXs = map (mk_sumTN o map HOLogic.mk_tupleT) ctr_TsssXs;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   152
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   153
    val eqs = map dest_TFree Xs ~~ sum_prod_TsXs;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   154
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   155
    val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects,
49207
4634c217b77b completed iter/rec proofs
blanchet
parents: 49205
diff changeset
   156
        fp_iter_thms, fp_rec_thms), lthy)) =
49208
blanchet
parents: 49207
diff changeset
   157
      fp_bnf (if lfp then bnf_lfp else bnf_gfp) bs mixfixes As' eqs no_defs_lthy;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   158
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   159
    val add_nested_bnf_names =
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   160
      let
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   161
        fun add (Type (s, Ts)) ss =
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   162
            let val (needs, ss') = fold_map add Ts ss in
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   163
              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
   164
            end
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   165
          | add T ss = (member (op =) As T, ss);
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   166
      in snd oo add end;
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   167
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   168
    val nested_bnfs =
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   169
      map_filter (bnf_of lthy o Long_Name.base_name)
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   170
        (fold (fold (fold add_nested_bnf_names)) ctr_TsssXs []);
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   171
49167
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   172
    val timer = time (Timer.startRealTimer ());
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   173
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   174
    fun mk_unf_or_fld get_T Ts t =
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   175
      let val Type (_, Ts0) = get_T (fastype_of t) in
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
   176
        Term.subst_atomic_types (Ts0 ~~ Ts) t
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   177
      end;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   178
49126
1bbd7a37fc29 implemented "mk_inject_tac"
blanchet
parents: 49125
diff changeset
   179
    val mk_unf = mk_unf_or_fld domain_type;
1bbd7a37fc29 implemented "mk_inject_tac"
blanchet
parents: 49125
diff changeset
   180
    val mk_fld = mk_unf_or_fld range_type;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   181
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   182
    val unfs = map (mk_unf As) unfs0;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   183
    val flds = map (mk_fld As) flds0;
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
   184
49201
blanchet
parents: 49200
diff changeset
   185
    val fpTs = map (domain_type o fastype_of) unfs;
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   186
49201
blanchet
parents: 49200
diff changeset
   187
    val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs;
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   188
    val ns = map length ctr_Tsss;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   189
    val kss = map (fn n => 1 upto n) ns;
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   190
    val mss = map (map length) ctr_Tsss;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   191
    val Css = map2 replicate ns Cs;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   192
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   193
    fun mk_iter_like Ts Us t =
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   194
      let
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   195
        val (binders, body) = strip_type (fastype_of t);
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   196
        val (f_Us, prebody) = split_last binders;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   197
        val Type (_, Ts0) = if lfp then prebody else body;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   198
        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
   199
      in
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   200
        Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   201
      end;
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   202
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   203
    val fp_iters as fp_iter1 :: _ = map (mk_iter_like As Cs) fp_iters0;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   204
    val fp_recs as fp_rec1 :: _ = map (mk_iter_like As Cs) fp_recs0;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   205
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   206
    val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1)));
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   207
    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
   208
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   209
    fun dest_rec_pair (T as Type (@{type_name prod}, Us as [_, U])) =
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   210
        if member (op =) Cs U then Us else [T]
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   211
      | dest_rec_pair T = [T];
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   212
49215
blanchet
parents: 49214
diff changeset
   213
    val ((iter_only as (gss, g_Tss, yssss), rec_only as (hss, h_Tss, zssss)),
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   214
         (zs, cs, cpss, p_Tss, coiter_only as ((pgss, cgsss), g_sum_prod_Ts, g_prod_Tss, g_Tsss),
49215
blanchet
parents: 49214
diff changeset
   215
          corec_only as ((phss, chsss), h_sum_prod_Ts, h_prod_Tss, h_Tsss))) =
49208
blanchet
parents: 49207
diff changeset
   216
      if lfp then
blanchet
parents: 49207
diff changeset
   217
        let
blanchet
parents: 49207
diff changeset
   218
          val y_Tsss =
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   219
            map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN n o domain_type)
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   220
              ns mss fp_iter_fun_Ts;
49208
blanchet
parents: 49207
diff changeset
   221
          val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css;
blanchet
parents: 49207
diff changeset
   222
blanchet
parents: 49207
diff changeset
   223
          val ((gss, ysss), _) =
blanchet
parents: 49207
diff changeset
   224
            lthy
blanchet
parents: 49207
diff changeset
   225
            |> mk_Freess "f" g_Tss
blanchet
parents: 49207
diff changeset
   226
            ||>> mk_Freesss "x" y_Tsss;
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   227
49208
blanchet
parents: 49207
diff changeset
   228
          val z_Tssss =
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   229
            map3 (fn n => fn ms => map2 (map dest_rec_pair oo dest_tupleT) ms o dest_sumTN n
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   230
              o domain_type) ns mss fp_rec_fun_Ts;
49208
blanchet
parents: 49207
diff changeset
   231
          val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css;
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   232
49208
blanchet
parents: 49207
diff changeset
   233
          val hss = map2 (map2 retype_free) gss h_Tss;
blanchet
parents: 49207
diff changeset
   234
          val (zssss, _) =
blanchet
parents: 49207
diff changeset
   235
            lthy
blanchet
parents: 49207
diff changeset
   236
            |> mk_Freessss "x" z_Tssss;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   237
        in
49215
blanchet
parents: 49214
diff changeset
   238
          (((gss, g_Tss, map (map (map single)) ysss), (hss, h_Tss, zssss)),
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   239
           ([], [], [], [], (([], []), [], [], []), (([], []), [], [], [])))
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   240
        end
49208
blanchet
parents: 49207
diff changeset
   241
      else
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   242
        let
49221
6d8d5fe9f3a2 fixed bug with one-value types with phantom type arguments
blanchet
parents: 49220
diff changeset
   243
          (*avoid "'a itself" arguments in coiterators and corecursors*)
6d8d5fe9f3a2 fixed bug with one-value types with phantom type arguments
blanchet
parents: 49220
diff changeset
   244
          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
   245
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   246
          val p_Tss =
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   247
            map2 (fn C => fn n => replicate (Int.max (0, n - 1)) (C --> HOLogic.boolT)) Cs ns;
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   248
49215
blanchet
parents: 49214
diff changeset
   249
          fun popescu_zip [] [fs] = fs
blanchet
parents: 49214
diff changeset
   250
            | popescu_zip (p :: ps) (fs :: fss) = p :: fs @ popescu_zip ps fss;
blanchet
parents: 49214
diff changeset
   251
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   252
          fun mk_types fun_Ts =
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   253
            let
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   254
              val f_sum_prod_Ts = map range_type fun_Ts;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   255
              val f_prod_Tss = map2 dest_sumTN ns f_sum_prod_Ts;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   256
              val f_Tsss =
49221
6d8d5fe9f3a2 fixed bug with one-value types with phantom type arguments
blanchet
parents: 49220
diff changeset
   257
                map3 (fn C => map2 (map (curry (op -->) C) oo dest_tupleT)) Cs mss' f_prod_Tss;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   258
              val pf_Tss = map2 popescu_zip p_Tss f_Tsss
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   259
            in (f_sum_prod_Ts, f_prod_Tss, f_Tsss, pf_Tss) end;
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   260
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   261
          val (g_sum_prod_Ts, g_prod_Tss, g_Tsss, pg_Tss) = mk_types fp_iter_fun_Ts;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   262
          val (h_sum_prod_Ts, h_prod_Tss, h_Tsss, ph_Tss) = mk_types fp_rec_fun_Ts;
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   263
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   264
          val ((((Free (z, _), cs), pss), gsss), _) =
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   265
            lthy
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   266
            |> yield_singleton (mk_Frees "z") dummyT
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   267
            ||>> mk_Frees "a" Cs
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   268
            ||>> mk_Freess "p" p_Tss
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   269
            ||>> mk_Freesss "g" g_Tsss;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   270
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   271
          val hsss = map2 (map2 (map2 retype_free)) gsss h_Tsss;
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   272
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   273
          val cpss = map2 (fn c => map (fn p => p $ c)) cs pss;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   274
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   275
          fun mk_terms fsss =
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   276
            let
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   277
              val pfss = map2 popescu_zip pss fsss;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   278
              val cfsss = map2 (fn c => map (map (fn f => f $ c))) cs fsss
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   279
            in (pfss, cfsss) end;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   280
        in
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   281
          ((([], [], []), ([], [], [])),
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   282
           ([z], cs, cpss, p_Tss, (mk_terms gsss, g_sum_prod_Ts, g_prod_Tss, pg_Tss),
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   283
            (mk_terms hsss, h_sum_prod_Ts, h_prod_Tss, ph_Tss)))
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   284
        end;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   285
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   286
    fun pour_some_sugar_on_type (((((((((((((((((b, fpT), C), fld), unf), fp_iter), fp_rec),
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   287
          fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_binders), ctr_mixfixes), ctr_Tss),
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   288
        disc_binders), sel_binderss) no_defs_lthy =
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   289
      let
49201
blanchet
parents: 49200
diff changeset
   290
        val unfT = domain_type (fastype_of fld);
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   291
        val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   292
        val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   293
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   294
        val ((((u, v), fs), xss), _) =
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   295
          no_defs_lthy
49201
blanchet
parents: 49200
diff changeset
   296
          |> yield_singleton (mk_Frees "u") unfT
blanchet
parents: 49200
diff changeset
   297
          ||>> yield_singleton (mk_Frees "v") fpT
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   298
          ||>> mk_Frees "f" case_Ts
49124
968e1b7de057 more work on FP sugar
blanchet
parents: 49123
diff changeset
   299
          ||>> mk_Freess "x" ctr_Tss;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   300
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   301
        val ctr_rhss =
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   302
          map2 (fn k => fn xs =>
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   303
            fold_rev Term.lambda xs (fld $ mk_InN ctr_prod_Ts (HOLogic.mk_tuple xs) k)) ks xss;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   304
49130
3c26e17b2849 implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents: 49129
diff changeset
   305
        val case_binder = Binding.suffix_name ("_" ^ caseN) b;
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   306
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   307
        val case_rhs =
49176
6d29d2db5f88 construct high-level iterator RHS
blanchet
parents: 49169
diff changeset
   308
          fold_rev Term.lambda (fs @ [v]) (mk_sum_caseN (map2 mk_uncurried_fun fs xss) $ (unf $ v));
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   309
49201
blanchet
parents: 49200
diff changeset
   310
        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
   311
          |> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
937a0fadddfb honor mixfix specifications
blanchet
parents: 49167
diff changeset
   312
               Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
49201
blanchet
parents: 49200
diff changeset
   313
             (case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   314
          ||> `Local_Theory.restore;
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   315
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   316
        (*transforms defined frees into consts (and more)*)
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   317
        val phi = Proof_Context.export_morphism lthy lthy';
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   318
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   319
        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
   320
        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
   321
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   322
        val ctrs0 = map (Morphism.term phi) raw_ctrs;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   323
        val casex0 = Morphism.term phi raw_case;
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   324
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   325
        val ctrs = map (mk_ctr As) ctrs0;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   326
49135
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   327
        fun exhaust_tac {context = ctxt, ...} =
49123
263b0e330d8b more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents: 49121
diff changeset
   328
          let
49135
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   329
            val fld_iff_unf_thm =
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   330
              let
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   331
                val goal =
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   332
                  fold_rev Logic.all [u, v]
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   333
                    (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
   334
              in
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   335
                Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
49201
blanchet
parents: 49200
diff changeset
   336
                  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
   337
                    (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
   338
                |> Thm.close_derivation
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   339
                |> Morphism.thm phi
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   340
              end;
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   341
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   342
            val sumEN_thm' =
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   343
              Local_Defs.unfold lthy @{thms all_unit_eq}
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   344
                (Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) [] (mk_sumEN n))
49135
de13b454fa31 fixed some type issues in sugar "exhaust_tac"
blanchet
parents: 49134
diff changeset
   345
              |> Morphism.thm phi;
49123
263b0e330d8b more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents: 49121
diff changeset
   346
          in
49161
a8e74375d971 fixed (n + 1)st bug in "mk_exhaust_tac" -- arose with uncurried constructors
blanchet
parents: 49157
diff changeset
   347
            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
   348
          end;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   349
49126
1bbd7a37fc29 implemented "mk_inject_tac"
blanchet
parents: 49125
diff changeset
   350
        val inject_tacss =
49205
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   351
          map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} =>
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   352
              mk_inject_tac ctxt ctr_def fld_inject]) ms ctr_defs;
49126
1bbd7a37fc29 implemented "mk_inject_tac"
blanchet
parents: 49125
diff changeset
   353
49127
f7326a0d7f19 implemented "mk_half_distinct_tac"
blanchet
parents: 49126
diff changeset
   354
        val half_distinct_tacss =
f7326a0d7f19 implemented "mk_half_distinct_tac"
blanchet
parents: 49126
diff changeset
   355
          map (map (fn (def, def') => fn {context = ctxt, ...} =>
f7326a0d7f19 implemented "mk_half_distinct_tac"
blanchet
parents: 49126
diff changeset
   356
            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
   357
49130
3c26e17b2849 implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents: 49129
diff changeset
   358
        val case_tacs =
3c26e17b2849 implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents: 49129
diff changeset
   359
          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
   360
            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
   361
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   362
        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
   363
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   364
        fun some_lfp_sugar no_defs_lthy =
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   365
          let
49208
blanchet
parents: 49207
diff changeset
   366
            val fpT_to_C = fpT --> C;
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   367
49215
blanchet
parents: 49214
diff changeset
   368
            fun generate_iter_like (suf, fp_iter_like, (fss, f_Tss, xssss)) =
blanchet
parents: 49214
diff changeset
   369
              let
blanchet
parents: 49214
diff changeset
   370
                val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
blanchet
parents: 49214
diff changeset
   371
blanchet
parents: 49214
diff changeset
   372
                val binder = Binding.suffix_name ("_" ^ suf) b;
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   373
49215
blanchet
parents: 49214
diff changeset
   374
                val spec =
blanchet
parents: 49214
diff changeset
   375
                  mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binder, res_T)),
blanchet
parents: 49214
diff changeset
   376
                    Term.list_comb (fp_iter_like,
blanchet
parents: 49214
diff changeset
   377
                      map2 (mk_sum_caseN oo map2 mk_uncurried2_fun) fss xssss));
blanchet
parents: 49214
diff changeset
   378
              in (binder, spec) end;
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   379
49215
blanchet
parents: 49214
diff changeset
   380
            val iter_likes =
blanchet
parents: 49214
diff changeset
   381
              [(iterN, fp_iter, iter_only),
blanchet
parents: 49214
diff changeset
   382
               (recN, fp_rec, rec_only)];
blanchet
parents: 49214
diff changeset
   383
blanchet
parents: 49214
diff changeset
   384
            val (binders, specs) = map generate_iter_like iter_likes |> split_list;
blanchet
parents: 49214
diff changeset
   385
blanchet
parents: 49214
diff changeset
   386
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
49201
blanchet
parents: 49200
diff changeset
   387
              |> apfst split_list o fold_map2 (fn b => fn spec =>
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   388
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
49215
blanchet
parents: 49214
diff changeset
   389
                #>> apsnd snd) binders specs
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   390
              ||> `Local_Theory.restore;
49201
blanchet
parents: 49200
diff changeset
   391
blanchet
parents: 49200
diff changeset
   392
            (*transforms defined frees into consts (and more)*)
blanchet
parents: 49200
diff changeset
   393
            val phi = Proof_Context.export_morphism lthy lthy';
blanchet
parents: 49200
diff changeset
   394
49215
blanchet
parents: 49214
diff changeset
   395
            val [iter_def, rec_def] = map (Morphism.thm phi) defs;
49201
blanchet
parents: 49200
diff changeset
   396
49215
blanchet
parents: 49214
diff changeset
   397
            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
   398
          in
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   399
            ((ctrs, iter, recx, v, xss, ctr_defs, iter_def, rec_def), lthy)
49134
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   400
          end;
846264f80f16 optionally provide extra dead variables to the FP constructions
blanchet
parents: 49130
diff changeset
   401
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   402
        fun some_gfp_sugar no_defs_lthy =
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   403
          let
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   404
            val B_to_fpT = C --> fpT;
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   405
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   406
            fun generate_coiter_like (suf, fp_iter_like, ((pfss, cfsss), f_sum_prod_Ts, f_prod_Tss,
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   407
                pf_Tss)) =
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   408
              let
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   409
                val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   410
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   411
                val binder = Binding.suffix_name ("_" ^ suf) b;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   412
49215
blanchet
parents: 49214
diff changeset
   413
                fun mk_popescu_join c n cps sum_prod_T prod_Ts cfss =
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   414
                  Term.lambda c (mk_IfN sum_prod_T cps
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   415
                    (map2 (mk_InN prod_Ts) (map HOLogic.mk_tuple cfss) (1 upto n)));
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   416
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   417
                val spec =
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   418
                  mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binder, res_T)),
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   419
                    Term.list_comb (fp_iter_like,
49215
blanchet
parents: 49214
diff changeset
   420
                      map6 mk_popescu_join cs ns cpss f_sum_prod_Ts f_prod_Tss cfsss));
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   421
              in (binder, spec) end;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   422
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   423
            val coiter_likes =
49215
blanchet
parents: 49214
diff changeset
   424
              [(coiterN, fp_iter, coiter_only),
blanchet
parents: 49214
diff changeset
   425
               (corecN, fp_rec, corec_only)];
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   426
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   427
            val (binders, specs) = map generate_coiter_like coiter_likes |> split_list;
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   428
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   429
            val ((csts, defs), (lthy', lthy)) = no_defs_lthy
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   430
              |> apfst split_list o fold_map2 (fn b => fn spec =>
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   431
                Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   432
                #>> apsnd snd) binders specs
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   433
              ||> `Local_Theory.restore;
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   434
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   435
            (*transforms defined frees into consts (and more)*)
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   436
            val phi = Proof_Context.export_morphism lthy lthy';
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   437
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   438
            val [coiter_def, corec_def] = map (Morphism.thm phi) defs;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   439
49211
239a4fa29ddf define corecursors
blanchet
parents: 49210
diff changeset
   440
            val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts;
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   441
          in
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   442
            ((ctrs, coiter, corec, v, xss, ctr_defs, coiter_def, corec_def), lthy)
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   443
          end;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   444
      in
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   445
        wrap_datatype tacss ((ctrs0, casex0), (disc_binders, sel_binderss)) lthy'
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   446
        |> (if lfp then some_lfp_sugar else some_gfp_sugar)
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   447
      end;
49167
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   448
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   449
    val pre_map_defs = map map_def_of_bnf pre_bnfs;
49229
d5717b5e2217 use map_id, not map_id', to allow better composition
blanchet
parents: 49226
diff changeset
   450
    val map_ids = map map_id_of_bnf nested_bnfs;
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   451
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   452
    fun mk_map Ts Us t =
49217
0c9546fc789f fixed handling of map of "fun"
blanchet
parents: 49216
diff changeset
   453
      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
   454
        Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   455
      end;
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   456
49234
blanchet
parents: 49233
diff changeset
   457
    fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) =
blanchet
parents: 49233
diff changeset
   458
      let
blanchet
parents: 49233
diff changeset
   459
        val map0 = map_of_bnf (the (bnf_of lthy (Long_Name.base_name s)));
blanchet
parents: 49233
diff changeset
   460
        val mapx = mk_map Ts Us map0;
blanchet
parents: 49233
diff changeset
   461
        val TUs = map dest_funT (fst (split_last (fst (strip_map_type (fastype_of mapx)))));
blanchet
parents: 49233
diff changeset
   462
        val args = map build_arg TUs;
blanchet
parents: 49233
diff changeset
   463
      in Term.list_comb (mapx, args) end;
blanchet
parents: 49233
diff changeset
   464
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   465
    fun pour_more_sugar_on_lfps ((ctrss, iters, recs, vs, xsss, ctr_defss, iter_defs, rec_defs),
49205
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   466
        lthy) =
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   467
      let
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   468
        val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   469
        val giters = map (lists_bmoc gss) iters;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   470
        val hrecs = map (lists_bmoc hss) recs;
49201
blanchet
parents: 49200
diff changeset
   471
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   472
        val (iter_thmss, rec_thmss) =
49207
4634c217b77b completed iter/rec proofs
blanchet
parents: 49205
diff changeset
   473
          let
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   474
            fun mk_goal_iter_like fss fiter_like xctr f xs fxs =
49207
4634c217b77b completed iter/rec proofs
blanchet
parents: 49205
diff changeset
   475
              fold_rev (fold_rev Logic.all) (xs :: fss)
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   476
                (mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs)));
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   477
49234
blanchet
parents: 49233
diff changeset
   478
            fun build_call fiter_likes maybe_tick (T, U) =
blanchet
parents: 49233
diff changeset
   479
              if T = U then
blanchet
parents: 49233
diff changeset
   480
                mk_id T
blanchet
parents: 49233
diff changeset
   481
              else
blanchet
parents: 49233
diff changeset
   482
                (case find_index (curry (op =) T) fpTs of
blanchet
parents: 49233
diff changeset
   483
                  ~1 => build_map (build_call fiter_likes maybe_tick) T U
blanchet
parents: 49233
diff changeset
   484
                | j => maybe_tick (nth vs j) (nth fiter_likes j));
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   485
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   486
            fun mk_U maybe_prodT =
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   487
              typ_subst (map2 (fn fpT => fn C => (fpT, maybe_prodT fpT C)) fpTs Cs);
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   488
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   489
            fun repair_calls fiter_likes maybe_cons maybe_tick maybe_prodT (x as Free (_, T)) =
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   490
              if member (op =) fpTs T then
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   491
                maybe_cons x [build_call fiter_likes (K I) (T, mk_U (K I) T) $ x]
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   492
              else if exists_subtype (member (op =) fpTs) T then
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   493
                [build_call fiter_likes maybe_tick (T, mk_U maybe_prodT T) $ x]
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   494
              else
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   495
                [x];
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   496
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   497
            val gxsss = map (map (maps (repair_calls giters (K I) (K I) (K I)))) xsss;
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   498
            val hxsss =
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   499
              map (map (maps (repair_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss;
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   500
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   501
            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
   502
            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
   503
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   504
            val iter_tacss =
49229
d5717b5e2217 use map_id, not map_id', to allow better composition
blanchet
parents: 49226
diff changeset
   505
              map2 (map o mk_iter_like_tac pre_map_defs map_ids iter_defs) fp_iter_thms ctr_defss;
49203
262ab1ac38b9 repaired constant types
blanchet
parents: 49202
diff changeset
   506
            val rec_tacss =
49229
d5717b5e2217 use map_id, not map_id', to allow better composition
blanchet
parents: 49226
diff changeset
   507
              map2 (map o mk_iter_like_tac pre_map_defs map_ids rec_defs) fp_rec_thms ctr_defss;
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   508
          in
49205
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   509
            (map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   510
               goal_iterss iter_tacss,
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   511
             map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
674f04c737e0 implemented "mk_iter_or_rec_tac"
blanchet
parents: 49204
diff changeset
   512
               goal_recss rec_tacss)
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   513
          end;
49201
blanchet
parents: 49200
diff changeset
   514
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   515
        val notes =
49202
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   516
          [(itersN, iter_thmss),
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   517
           (recsN, rec_thmss)]
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   518
          |> maps (fn (thmN, thmss) =>
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   519
            map2 (fn b => fn thms =>
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   520
                ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])]))
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   521
              bs thmss);
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   522
      in
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   523
        lthy |> Local_Theory.notes notes |> snd
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   524
      end;
f493cd25737f some work towards iterator and recursor properties
blanchet
parents: 49201
diff changeset
   525
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   526
    fun pour_more_sugar_on_gfps ((ctrss, coiters, corecs, vs, xsss, ctr_defss, coiter_defs,
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   527
        corec_defs), lthy) =
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   528
      let
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   529
        val z = the_single zs;
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   530
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   531
        val gcoiters = map (lists_bmoc pgss) coiters;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   532
        val hcorecs = map (lists_bmoc phss) corecs;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   533
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   534
        val (coiter_thmss, corec_thmss) =
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   535
          let
49232
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   536
            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
   537
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   538
            fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr cfs' =
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   539
              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
   540
                (Logic.list_implies (seq_conds mk_goal_cond n k cps,
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   541
                   mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, cfs'))));
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   542
49234
blanchet
parents: 49233
diff changeset
   543
            fun build_call fiter_likes maybe_tack (T, U) =
blanchet
parents: 49233
diff changeset
   544
              if T = U then
blanchet
parents: 49233
diff changeset
   545
                mk_id T
blanchet
parents: 49233
diff changeset
   546
              else
blanchet
parents: 49233
diff changeset
   547
                (case find_index (curry (op =) U) fpTs of
blanchet
parents: 49233
diff changeset
   548
                  ~1 => build_map (build_call fiter_likes maybe_tack) T U
blanchet
parents: 49233
diff changeset
   549
                | 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
   550
49232
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   551
            fun mk_U maybe_sumT =
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   552
              typ_subst (map2 (fn C => fn fpT => (maybe_sumT fpT C, fpT)) Cs fpTs);
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   553
49232
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   554
            fun repair_calls fiter_likes maybe_sumT maybe_tack
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   555
                (cf as Free (_, Type (_, [_, T])) $ _) =
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   556
              if exists_subtype (member (op =) Cs) T then
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   557
                build_call fiter_likes maybe_tack (T, mk_U maybe_sumT T) $ cf
49232
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   558
              else
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   559
                cf;
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   560
9ea11f0c53e4 fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents: 49230
diff changeset
   561
            val cgsss = map (map (map (repair_calls gcoiters (K I) (K I)))) cgsss;
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   562
            val chsss = map (map (map (repair_calls hcorecs (curry mk_sumT) (tack z)))) chsss;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   563
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   564
            val goal_coiterss =
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   565
              map7 (map3 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss cgsss;
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   566
            val goal_corecss =
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   567
              map7 (map3 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss chsss;
49213
975ccb0130cb some work on coiter tactic
blanchet
parents: 49212
diff changeset
   568
975ccb0130cb some work on coiter tactic
blanchet
parents: 49212
diff changeset
   569
            val coiter_tacss =
49229
d5717b5e2217 use map_id, not map_id', to allow better composition
blanchet
parents: 49226
diff changeset
   570
              map3 (map oo mk_coiter_like_tac coiter_defs map_ids) fp_iter_thms pre_map_defs
49226
510c6d4a73ec fixed and enabled iterator/recursor theorems
blanchet
parents: 49224
diff changeset
   571
                ctr_defss;
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   572
            val corec_tacss =
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   573
              map3 (map oo mk_coiter_like_tac corec_defs map_ids) fp_rec_thms pre_map_defs
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   574
                ctr_defss;
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   575
          in
49213
975ccb0130cb some work on coiter tactic
blanchet
parents: 49212
diff changeset
   576
            (map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
975ccb0130cb some work on coiter tactic
blanchet
parents: 49212
diff changeset
   577
               goal_coiterss coiter_tacss,
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   578
             map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   579
               goal_corecss corec_tacss)
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   580
          end;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   581
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   582
        val notes =
49233
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   583
          [(coitersN, coiter_thmss),
7f412734fbb3 fixed and reenabled "corecs" theorems
blanchet
parents: 49232
diff changeset
   584
           (corecsN, corec_thmss)]
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   585
          |> maps (fn (thmN, thmss) =>
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   586
            map2 (fn b => fn thms =>
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   587
                ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])]))
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   588
              bs thmss);
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   589
      in
49230
0e551c2d5d8b reactivated generation of "coiters" theorems
blanchet
parents: 49229
diff changeset
   590
        lthy |> Local_Theory.notes notes |> snd
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   591
      end;
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   592
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   593
    val lthy' = lthy
49210
656fb50d33f0 define coiterators
blanchet
parents: 49209
diff changeset
   594
      |> fold_map pour_some_sugar_on_type (bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   595
        fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_binderss ~~
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   596
        ctr_mixfixess ~~ ctr_Tsss ~~ disc_binderss ~~ sel_bindersss)
49214
2a3cb4c71b87 construct the right iterator theorem in the recursive case
blanchet
parents: 49213
diff changeset
   597
      |>> split_list8
49212
ca59649170b0 more sugar on codatatypes
blanchet
parents: 49211
diff changeset
   598
      |> (if lfp then pour_more_sugar_on_lfps else pour_more_sugar_on_gfps);
49167
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   599
68623861e0f2 print timing information
blanchet
parents: 49165
diff changeset
   600
    val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
49208
blanchet
parents: 49207
diff changeset
   601
      (if lfp then "" else "co") ^ "datatype"));
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   602
  in
49204
0b735fb2602e generate iter/rec goals
blanchet
parents: 49203
diff changeset
   603
    (timer; lthy')
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   604
  end;
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   605
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   606
fun datatype_cmd info specs lthy =
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   607
  let
49209
blanchet
parents: 49208
diff changeset
   608
    (* TODO: cleaner handling of fake contexts, without "background_theory" *)
49184
83fdea0c4779 gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents: 49183
diff changeset
   609
    (*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a
83fdea0c4779 gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents: 49183
diff changeset
   610
      locale and shadows an existing global type*)
49179
f9d48d479c84 don't throw away the context when hacking the theory (first step to localize the sugar code)
blanchet
parents: 49177
diff changeset
   611
    val fake_thy = Theory.copy
49184
83fdea0c4779 gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents: 49183
diff changeset
   612
      #> fold (fn spec => perhaps (try (Sign.add_type lthy
83fdea0c4779 gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents: 49183
diff changeset
   613
        (type_binder_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs;
49179
f9d48d479c84 don't throw away the context when hacking the theory (first step to localize the sugar code)
blanchet
parents: 49177
diff changeset
   614
    val fake_lthy = Proof_Context.background_theory fake_thy lthy;
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   615
  in
49199
7c9a3c67c55d added high-level recursor, not yet curried
blanchet
parents: 49184
diff changeset
   616
    prepare_datatype Syntax.read_typ info specs fake_lthy lthy
49121
9e0acaa470ab more work on FP sugar
blanchet
parents: 49119
diff changeset
   617
  end;
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   618
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   619
val parse_opt_binding_colon = Scan.optional (Parse.binding --| Parse.$$$ ":") no_binder
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   620
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   621
val parse_ctr_arg =
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   622
  Parse.$$$ "(" |-- parse_opt_binding_colon -- Parse.typ --| Parse.$$$ ")" ||
49129
b5413cb7d860 define "case" constant
blanchet
parents: 49127
diff changeset
   623
  (Parse.typ >> pair no_binder);
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   624
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   625
val parse_single_spec =
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   626
  Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix --
49119
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   627
  (@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding --
1f605c36869c more work on FP sugar
blanchet
parents: 49112
diff changeset
   628
    Scan.repeat parse_ctr_arg -- Parse.opt_mixfix));
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   629
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   630
val _ =
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   631
  Outer_Syntax.local_theory @{command_spec "data"} "define BNF-based inductive datatypes"
49208
blanchet
parents: 49207
diff changeset
   632
    (Parse.and_list1 parse_single_spec >> datatype_cmd true);
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   633
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   634
val _ =
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   635
  Outer_Syntax.local_theory @{command_spec "codata"} "define BNF-based coinductive datatypes"
49208
blanchet
parents: 49207
diff changeset
   636
    (Parse.and_list1 parse_single_spec >> datatype_cmd false);
49112
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   637
4de4635d8f93 started work on sugared "(co)data" commands
blanchet
parents:
diff changeset
   638
end;