src/HOL/Codatatype/Tools/bnf_fp_sugar.ML
author blanchet
Wed Sep 05 11:08:18 2012 +0200 (2012-09-05)
changeset 49146 e32b1f748854
parent 49135 de13b454fa31
child 49157 6407346b74c7
permissions -rw-r--r--
added a check
blanchet@49112
     1
(*  Title:      HOL/Codatatype/Tools/bnf_fp_sugar.ML
blanchet@49112
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@49112
     3
    Copyright   2012
blanchet@49112
     4
blanchet@49112
     5
Sugar for constructing LFPs and GFPs.
blanchet@49112
     6
*)
blanchet@49112
     7
blanchet@49112
     8
signature BNF_FP_SUGAR =
blanchet@49112
     9
sig
blanchet@49112
    10
end;
blanchet@49112
    11
blanchet@49112
    12
structure BNF_FP_Sugar : BNF_FP_SUGAR =
blanchet@49112
    13
struct
blanchet@49112
    14
blanchet@49119
    15
open BNF_Util
blanchet@49119
    16
open BNF_Wrap
blanchet@49119
    17
open BNF_FP_Util
blanchet@49119
    18
open BNF_LFP
blanchet@49119
    19
open BNF_GFP
blanchet@49123
    20
open BNF_FP_Sugar_Tactics
blanchet@49119
    21
blanchet@49129
    22
val caseN = "case";
blanchet@49129
    23
blanchet@49124
    24
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
blanchet@49119
    25
blanchet@49119
    26
fun merge_type_arg_constrained ctxt (T, c) (T', c') =
blanchet@49119
    27
  if T = T' then
blanchet@49119
    28
    (case (c, c') of
blanchet@49119
    29
      (_, NONE) => (T, c)
blanchet@49119
    30
    | (NONE, _) => (T, c')
blanchet@49119
    31
    | _ =>
blanchet@49119
    32
      if c = c' then
blanchet@49119
    33
        (T, c)
blanchet@49119
    34
      else
blanchet@49119
    35
        error ("Inconsistent sort constraints for type variable " ^
blanchet@49119
    36
          quote (Syntax.string_of_typ ctxt T)))
blanchet@49119
    37
  else
blanchet@49119
    38
    cannot_merge_types ();
blanchet@49119
    39
blanchet@49119
    40
fun merge_type_args_constrained ctxt (cAs, cAs') =
blanchet@49119
    41
  if length cAs = length cAs' then map2 (merge_type_arg_constrained ctxt) cAs cAs'
blanchet@49119
    42
  else cannot_merge_types ();
blanchet@49119
    43
blanchet@49121
    44
fun type_args_constrained_of (((cAs, _), _), _) = cAs;
blanchet@49121
    45
val type_args_of = map fst o type_args_constrained_of;
blanchet@49129
    46
fun type_binder_of (((_, b), _), _) = b;
blanchet@49121
    47
fun mixfix_of_typ ((_, mx), _) = mx;
blanchet@49121
    48
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
blanchet@49119
    49
blanchet@49121
    50
fun disc_of (((disc, _), _), _) = disc;
blanchet@49121
    51
fun ctr_of (((_, ctr), _), _) = ctr;
blanchet@49121
    52
fun args_of ((_, args), _) = args;
blanchet@49121
    53
fun mixfix_of_ctr (_, mx) = mx;
blanchet@49119
    54
blanchet@49134
    55
val uncurry_fs =
blanchet@49134
    56
  map2 (fn f => fn xs => HOLogic.tupled_lambda (HOLogic.mk_tuple xs) (Term.list_comb (f, xs)));
blanchet@49119
    57
blanchet@49134
    58
fun prepare_data prepare_typ gfp specs fake_lthy lthy =
blanchet@49112
    59
  let
blanchet@49121
    60
    val constrained_As =
blanchet@49121
    61
      map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs
blanchet@49119
    62
      |> Library.foldr1 (merge_type_args_constrained lthy);
blanchet@49121
    63
    val As = map fst constrained_As;
blanchet@49134
    64
    val As' = map dest_TFree As;
blanchet@49119
    65
blanchet@49121
    66
    val _ = (case duplicates (op =) As of [] => ()
blanchet@49119
    67
      | T :: _ => error ("Duplicate type parameter " ^ quote (Syntax.string_of_typ lthy T)));
blanchet@49119
    68
blanchet@49119
    69
    (* TODO: check that no type variables occur in the rhss that's not in the lhss *)
blanchet@49119
    70
    (* TODO: use sort constraints on type args *)
blanchet@49119
    71
blanchet@49119
    72
    val N = length specs;
blanchet@49119
    73
blanchet@49121
    74
    fun mk_T b =
blanchet@49121
    75
      Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
blanchet@49121
    76
        As);
blanchet@49121
    77
blanchet@49129
    78
    val bs = map type_binder_of specs;
blanchet@49121
    79
    val Ts = map mk_T bs;
blanchet@49121
    80
blanchet@49121
    81
    val mixfixes = map mixfix_of_typ specs;
blanchet@49119
    82
blanchet@49119
    83
    val _ = (case duplicates Binding.eq_name bs of [] => ()
blanchet@49119
    84
      | b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
blanchet@49119
    85
blanchet@49121
    86
    val ctr_specss = map ctr_specs_of specs;
blanchet@49119
    87
blanchet@49129
    88
    val disc_binderss = map (map disc_of) ctr_specss;
blanchet@49129
    89
    val ctr_binderss = map (map ctr_of) ctr_specss;
blanchet@49121
    90
    val ctr_argsss = map (map args_of) ctr_specss;
blanchet@49121
    91
    val ctr_mixfixess = map (map mixfix_of_ctr) ctr_specss;
blanchet@49119
    92
blanchet@49129
    93
    val sel_bindersss = map (map (map fst)) ctr_argsss;
blanchet@49121
    94
    val ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
blanchet@49121
    95
blanchet@49121
    96
    val (Bs, C) =
blanchet@49121
    97
      lthy
blanchet@49121
    98
      |> fold (fold (fn s => Variable.declare_typ (TFree (s, dummyS))) o type_args_of) specs
blanchet@49121
    99
      |> mk_TFrees N
blanchet@49121
   100
      ||> the_single o fst o mk_TFrees 1;
blanchet@49119
   101
blanchet@49146
   102
    fun is_same_rec (T as Type (s, Us)) (Type (s', Us')) =
blanchet@49146
   103
        s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
blanchet@49146
   104
          quote (Syntax.string_of_typ fake_lthy T)))
blanchet@49146
   105
      | is_same_rec _ _ = false
blanchet@49146
   106
blanchet@49146
   107
    fun freeze_rec (T as Type (s, Us)) =
blanchet@49146
   108
        (case find_index (is_same_rec T) Ts of
blanchet@49146
   109
          ~1 => Type (s, map freeze_rec Us)
blanchet@49121
   110
        | i => nth Bs i)
blanchet@49121
   111
      | freeze_rec T = T;
blanchet@49121
   112
blanchet@49121
   113
    val ctr_TsssBs = map (map (map freeze_rec)) ctr_Tsss;
blanchet@49121
   114
    val sum_prod_TsBs = map (mk_sumTN o map HOLogic.mk_tupleT) ctr_TsssBs;
blanchet@49119
   115
blanchet@49121
   116
    val eqs = map dest_TFree Bs ~~ sum_prod_TsBs;
blanchet@49121
   117
blanchet@49126
   118
    val ((raw_unfs, raw_flds, unf_flds, fld_unfs, fld_injects), lthy') =
blanchet@49134
   119
      fp_bnf (if gfp then bnf_gfp else bnf_lfp) bs As' eqs lthy;
blanchet@49121
   120
blanchet@49126
   121
    fun mk_unf_or_fld get_foldedT Ts t =
blanchet@49124
   122
      let val Type (_, Ts0) = get_foldedT (fastype_of t) in
blanchet@49124
   123
        Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49121
   124
      end;
blanchet@49119
   125
blanchet@49126
   126
    val mk_unf = mk_unf_or_fld domain_type;
blanchet@49126
   127
    val mk_fld = mk_unf_or_fld range_type;
blanchet@49121
   128
blanchet@49126
   129
    val unfs = map (mk_unf As) raw_unfs;
blanchet@49124
   130
    val flds = map (mk_fld As) raw_flds;
blanchet@49124
   131
blanchet@49135
   132
    fun pour_sugar_on_type ((((((((((b, T), fld), unf), fld_unf), unf_fld), fld_inject),
blanchet@49134
   133
        ctr_binders), ctr_Tss), disc_binders), sel_binderss) no_defs_lthy =
blanchet@49121
   134
      let
blanchet@49129
   135
        val n = length ctr_binders;
blanchet@49121
   136
        val ks = 1 upto n;
blanchet@49121
   137
        val ms = map length ctr_Tss;
blanchet@49121
   138
blanchet@49124
   139
        val unf_T = domain_type (fastype_of fld);
blanchet@49121
   140
        val prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
blanchet@49134
   141
        val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
blanchet@49119
   142
blanchet@49129
   143
        val ((((fs, u), v), xss), _) =
blanchet@49124
   144
          lthy
blanchet@49134
   145
          |> mk_Frees "f" case_Ts
blanchet@49129
   146
          ||>> yield_singleton (mk_Frees "u") unf_T
blanchet@49124
   147
          ||>> yield_singleton (mk_Frees "v") T
blanchet@49124
   148
          ||>> mk_Freess "x" ctr_Tss;
blanchet@49121
   149
blanchet@49129
   150
        val ctr_rhss =
blanchet@49121
   151
          map2 (fn k => fn xs =>
blanchet@49121
   152
            fold_rev Term.lambda xs (fld $ mk_InN prod_Ts (HOLogic.mk_tuple xs) k)) ks xss;
blanchet@49121
   153
blanchet@49130
   154
        val case_binder = Binding.suffix_name ("_" ^ caseN) b;
blanchet@49129
   155
blanchet@49134
   156
        val case_rhs =
blanchet@49134
   157
          fold_rev Term.lambda (fs @ [v]) (mk_sum_caseN (uncurry_fs fs xss) $ (unf $ v));
blanchet@49129
   158
blanchet@49130
   159
        val (((raw_ctrs, raw_ctr_defs), (raw_case, raw_case_def)), (lthy', lthy)) = no_defs_lthy
blanchet@49121
   160
          |> apfst split_list o fold_map2 (fn b => fn rhs =>
blanchet@49121
   161
               Local_Theory.define ((b, NoSyn), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
blanchet@49129
   162
             ctr_binders ctr_rhss
blanchet@49130
   163
          ||>> (Local_Theory.define ((case_binder, NoSyn), ((Thm.def_binding case_binder, []),
blanchet@49130
   164
             case_rhs)) #>> apsnd snd)
blanchet@49121
   165
          ||> `Local_Theory.restore;
blanchet@49121
   166
blanchet@49121
   167
        (*transforms defined frees into consts (and more)*)
blanchet@49121
   168
        val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49121
   169
blanchet@49121
   170
        val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
blanchet@49130
   171
        val case_def = Morphism.thm phi raw_case_def;
blanchet@49130
   172
blanchet@49123
   173
        val ctrs = map (Morphism.term phi) raw_ctrs;
blanchet@49130
   174
        val casex = Morphism.term phi raw_case;
blanchet@49121
   175
blanchet@49135
   176
        fun exhaust_tac {context = ctxt, ...} =
blanchet@49123
   177
          let
blanchet@49135
   178
            val fld_iff_unf_thm =
blanchet@49135
   179
              let
blanchet@49135
   180
                val goal =
blanchet@49135
   181
                  fold_rev Logic.all [u, v]
blanchet@49135
   182
                    (mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u)));
blanchet@49135
   183
              in
blanchet@49135
   184
                Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49135
   185
                  mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unf_T, T]) (certify lthy fld)
blanchet@49135
   186
                    (certify lthy unf) fld_unf unf_fld)
blanchet@49135
   187
                |> Thm.close_derivation
blanchet@49135
   188
                |> Morphism.thm phi
blanchet@49135
   189
              end;
blanchet@49135
   190
blanchet@49135
   191
            val sumEN_thm' =
blanchet@49135
   192
              Local_Defs.unfold lthy @{thms all_unit_eq}
blanchet@49135
   193
                (Drule.instantiate' (map (SOME o certifyT lthy) prod_Ts) [] (mk_sumEN n))
blanchet@49135
   194
              |> Morphism.thm phi;
blanchet@49123
   195
          in
blanchet@49135
   196
            mk_exhaust_tac ctxt n ms ctr_defs fld_iff_unf_thm sumEN_thm'
blanchet@49123
   197
          end;
blanchet@49121
   198
blanchet@49126
   199
        val inject_tacss =
blanchet@49126
   200
          map2 (fn 0 => K []
blanchet@49126
   201
                 | _ => fn ctr_def => [fn {context = ctxt, ...} =>
blanchet@49126
   202
                     mk_inject_tac ctxt ctr_def fld_inject])
blanchet@49126
   203
            ms ctr_defs;
blanchet@49126
   204
blanchet@49127
   205
        val half_distinct_tacss =
blanchet@49127
   206
          map (map (fn (def, def') => fn {context = ctxt, ...} =>
blanchet@49127
   207
            mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs);
blanchet@49127
   208
blanchet@49130
   209
        val case_tacs =
blanchet@49130
   210
          map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} =>
blanchet@49130
   211
            mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs;
blanchet@49121
   212
blanchet@49121
   213
        val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs];
blanchet@49134
   214
blanchet@49134
   215
        fun sugar_lfp lthy =
blanchet@49134
   216
          let
blanchet@49134
   217
(*###
blanchet@49146
   218
            val fld_iter = @{term True}; (*###*)
blanchet@49146
   219
blanchet@49146
   220
            val iter_Tss = map (fn Ts => Ts) (*###*) ctr_Tss;
blanchet@49134
   221
            val iter_Ts = map (fn Ts => Ts ---> C) iter_Tss;
blanchet@49134
   222
blanchet@49134
   223
            val iter_fs = map2 (fn Free (s, _) => fn T => Free (s, T)) fs iter_Ts
blanchet@49134
   224
blanchet@49146
   225
            val iter_rhs =
blanchet@49146
   226
              fold_rev Term.lambda fs (fld_iter $ mk_sum_caseN (uncurry_fs fs xss) $ (unf $ v));
blanchet@49146
   227
blanchet@49146
   228
blanchet@49134
   229
            val uncurried_fs =
blanchet@49134
   230
              map2 (fn f => fn xs =>
blanchet@49134
   231
                HOLogic.tupled_lambda (HOLogic.mk_tuple xs) (Term.list_comb (f, xs))) fs xss;
blanchet@49134
   232
*)
blanchet@49134
   233
          in
blanchet@49134
   234
            lthy
blanchet@49134
   235
          end;
blanchet@49134
   236
blanchet@49134
   237
        fun sugar_gfp lthy = lthy;
blanchet@49119
   238
      in
blanchet@49130
   239
        wrap_data tacss ((ctrs, casex), (disc_binders, sel_binderss)) lthy'
blanchet@49134
   240
        |> (if gfp then sugar_gfp else sugar_lfp)
blanchet@49119
   241
      end;
blanchet@49112
   242
  in
blanchet@49124
   243
    lthy'
blanchet@49135
   244
    |> fold pour_sugar_on_type (bs ~~ Ts ~~ flds ~~ unfs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~
blanchet@49129
   245
      ctr_binderss ~~ ctr_Tsss ~~ disc_binderss ~~ sel_bindersss)
blanchet@49112
   246
  end;
blanchet@49112
   247
blanchet@49121
   248
fun data_cmd info specs lthy =
blanchet@49121
   249
  let
blanchet@49121
   250
    val fake_lthy =
blanchet@49121
   251
      Proof_Context.theory_of lthy
blanchet@49121
   252
      |> Theory.copy
blanchet@49121
   253
      |> Sign.add_types_global (map (fn spec =>
blanchet@49129
   254
        (type_binder_of spec, length (type_args_constrained_of spec), mixfix_of_typ spec)) specs)
blanchet@49121
   255
      |> Proof_Context.init_global
blanchet@49121
   256
  in
blanchet@49121
   257
    prepare_data Syntax.read_typ info specs fake_lthy lthy
blanchet@49121
   258
  end;
blanchet@49119
   259
blanchet@49129
   260
val parse_opt_binding_colon = Scan.optional (Parse.binding --| Parse.$$$ ":") no_binder
blanchet@49119
   261
blanchet@49112
   262
val parse_ctr_arg =
blanchet@49119
   263
  Parse.$$$ "(" |-- parse_opt_binding_colon -- Parse.typ --| Parse.$$$ ")" ||
blanchet@49129
   264
  (Parse.typ >> pair no_binder);
blanchet@49112
   265
blanchet@49112
   266
val parse_single_spec =
blanchet@49112
   267
  Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix --
blanchet@49119
   268
  (@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding --
blanchet@49119
   269
    Scan.repeat parse_ctr_arg -- Parse.opt_mixfix));
blanchet@49112
   270
blanchet@49112
   271
val _ =
blanchet@49112
   272
  Outer_Syntax.local_theory @{command_spec "data"} "define BNF-based inductive datatypes"
blanchet@49134
   273
    (Parse.and_list1 parse_single_spec >> data_cmd false);
blanchet@49112
   274
blanchet@49112
   275
val _ =
blanchet@49112
   276
  Outer_Syntax.local_theory @{command_spec "codata"} "define BNF-based coinductive datatypes"
blanchet@49134
   277
    (Parse.and_list1 parse_single_spec >> data_cmd true);
blanchet@49112
   278
blanchet@49112
   279
end;