src/HOL/BNF/Tools/bnf_wrap.ML
author blanchet
Thu Apr 25 09:25:50 2013 +0200 (2013-04-25)
changeset 51771 e11b1ee200f5
parent 51770 78162d9e977d
child 51777 48a0ae342ea0
permissions -rw-r--r--
start making "wrap_data" more robust
blanchet@49509
     1
(*  Title:      HOL/BNF/Tools/bnf_wrap.ML
blanchet@49017
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@49017
     3
    Copyright   2012
blanchet@49017
     4
blanchet@49074
     5
Wrapping existing datatypes.
blanchet@49017
     6
*)
blanchet@49017
     7
blanchet@49074
     8
signature BNF_WRAP =
blanchet@49017
     9
sig
blanchet@49633
    10
  val rep_compat_prefix: string
blanchet@49633
    11
blanchet@49585
    12
  val mk_half_pairss: 'a list * 'a list -> ('a * 'a) list list
blanchet@49585
    13
  val join_halves: int -> 'a list list -> 'a list list -> 'a list * 'a list list list
blanchet@49585
    14
blanchet@49203
    15
  val mk_ctr: typ list -> term -> term
blanchet@49484
    16
  val mk_disc_or_sel: typ list -> term -> term
blanchet@49585
    17
blanchet@49622
    18
  val name_of_ctr: term -> string
blanchet@49585
    19
blanchet@49199
    20
  val wrap_datatype: ({prems: thm list, context: Proof.context} -> tactic) list list ->
blanchet@49633
    21
    (((bool * bool) * term list) * term) *
blanchet@49280
    22
      (binding list * (binding list list * (binding * term) list list)) -> local_theory ->
blanchet@49591
    23
    (term list * term list list * thm * thm list * thm list * thm list * thm list list * thm list *
blanchet@49484
    24
     thm list list) * local_theory
blanchet@49633
    25
  val parse_wrap_options: (bool * bool) parser
blanchet@49286
    26
  val parse_bound_term: (binding * string) parser
blanchet@49017
    27
end;
blanchet@49017
    28
blanchet@49074
    29
structure BNF_Wrap : BNF_WRAP =
blanchet@49017
    30
struct
blanchet@49017
    31
blanchet@49017
    32
open BNF_Util
blanchet@49074
    33
open BNF_Wrap_Tactics
blanchet@49017
    34
blanchet@49633
    35
val rep_compat_prefix = "new";
blanchet@49633
    36
blanchet@49223
    37
val isN = "is_";
blanchet@49223
    38
val unN = "un_";
blanchet@49223
    39
fun mk_unN 1 1 suf = unN ^ suf
blanchet@49223
    40
  | mk_unN _ l suf = unN ^ suf ^ string_of_int l;
blanchet@49046
    41
blanchet@49594
    42
val caseN = "case";
blanchet@49054
    43
val case_congN = "case_cong";
blanchet@49594
    44
val case_convN = "case_conv";
blanchet@49118
    45
val collapseN = "collapse";
blanchet@49122
    46
val disc_excludeN = "disc_exclude";
blanchet@49054
    47
val disc_exhaustN = "disc_exhaust";
blanchet@49054
    48
val discsN = "discs";
blanchet@49054
    49
val distinctN = "distinct";
blanchet@49075
    50
val exhaustN = "exhaust";
blanchet@49486
    51
val expandN = "expand";
blanchet@49075
    52
val injectN = "inject";
blanchet@49075
    53
val nchotomyN = "nchotomy";
blanchet@49054
    54
val selsN = "sels";
blanchet@49054
    55
val splitN = "split";
blanchet@49633
    56
val splitsN = "splits";
blanchet@49054
    57
val split_asmN = "split_asm";
blanchet@49054
    58
val weak_case_cong_thmsN = "weak_case_cong";
blanchet@49019
    59
blanchet@49336
    60
val std_binding = @{binding _};
blanchet@49300
    61
blanchet@49300
    62
val induct_simp_attrs = @{attributes [induct_simp]};
blanchet@49300
    63
val cong_attrs = @{attributes [cong]};
blanchet@49300
    64
val iff_attrs = @{attributes [iff]};
blanchet@49300
    65
val safe_elim_attrs = @{attributes [elim!]};
blanchet@49300
    66
val simp_attrs = @{attributes [simp]};
blanchet@49046
    67
blanchet@49259
    68
fun unflat_lookup eq ys zs = map (map (fn x => nth zs (find_index (curry eq x) ys)));
blanchet@49258
    69
blanchet@49585
    70
fun mk_half_pairss' _ ([], []) = []
blanchet@49591
    71
  | mk_half_pairss' indent (x :: xs, _ :: ys) =
blanchet@49585
    72
    indent @ fold_rev (cons o single o pair x) ys (mk_half_pairss' ([] :: indent) (xs, ys));
blanchet@49486
    73
blanchet@49585
    74
fun mk_half_pairss p = mk_half_pairss' [[]] p;
blanchet@49027
    75
blanchet@49486
    76
fun join_halves n half_xss other_half_xss =
blanchet@49486
    77
  let
blanchet@49486
    78
    val xsss =
blanchet@49486
    79
      map2 (map2 append) (Library.chop_groups n half_xss)
blanchet@49486
    80
        (transpose (Library.chop_groups n other_half_xss))
blanchet@49668
    81
    val xs = splice (flat half_xss) (flat other_half_xss);
blanchet@49585
    82
  in (xs, xsss) end;
blanchet@49027
    83
blanchet@49280
    84
fun mk_undefined T = Const (@{const_name undefined}, T);
blanchet@49055
    85
blanchet@49500
    86
fun mk_ctr Ts t =
blanchet@49500
    87
  let val Type (_, Ts0) = body_type (fastype_of t) in
blanchet@49500
    88
    Term.subst_atomic_types (Ts0 ~~ Ts) t
blanchet@49203
    89
  end;
blanchet@49203
    90
blanchet@49484
    91
fun mk_disc_or_sel Ts t =
blanchet@49484
    92
  Term.subst_atomic_types (snd (Term.dest_Type (domain_type (fastype_of t))) ~~ Ts) t;
blanchet@49484
    93
blanchet@49536
    94
fun mk_case Ts T t =
blanchet@49536
    95
  let val (Type (_, Ts0), body) = strip_type (fastype_of t) |>> List.last in
blanchet@49536
    96
    Term.subst_atomic_types ((body, T) :: (Ts0 ~~ Ts)) t
blanchet@49536
    97
  end;
blanchet@49536
    98
blanchet@49622
    99
fun name_of_ctr c =
blanchet@49622
   100
  (case head_of c of
blanchet@49622
   101
    Const (s, _) => s
blanchet@49622
   102
  | Free (s, _) => s
blanchet@49622
   103
  | _ => error "Cannot extract name of constructor");
blanchet@49622
   104
blanchet@49622
   105
val base_name_of_ctr = Long_Name.base_name o name_of_ctr;
blanchet@49046
   106
blanchet@49437
   107
fun eta_expand_arg xs f_xs = fold_rev Term.lambda xs f_xs;
blanchet@49437
   108
blanchet@49633
   109
fun prepare_wrap_datatype prep_term ((((no_dests, rep_compat), raw_ctrs), raw_case),
blanchet@49336
   110
    (raw_disc_bindings, (raw_sel_bindingss, raw_sel_defaultss))) no_defs_lthy =
blanchet@49017
   111
  let
blanchet@49019
   112
    (* TODO: sanity checks on arguments *)
blanchet@49025
   113
blanchet@49280
   114
    val n = length raw_ctrs;
blanchet@49054
   115
    val ks = 1 upto n;
blanchet@49054
   116
blanchet@49121
   117
    val _ = if n > 0 then () else error "No constructors specified";
blanchet@49121
   118
blanchet@49280
   119
    val ctrs0 = map (prep_term no_defs_lthy) raw_ctrs;
blanchet@49280
   120
    val case0 = prep_term no_defs_lthy raw_case;
blanchet@49280
   121
    val sel_defaultss =
blanchet@49280
   122
      pad_list [] n (map (map (apsnd (prep_term no_defs_lthy))) raw_sel_defaultss);
blanchet@49280
   123
blanchet@51771
   124
    val case0T = fastype_of case0;
blanchet@51771
   125
    val Type (dataT_name, As0) =
blanchet@51771
   126
      domain_type (snd (strip_typeN (length (binder_types case0T) - 1) case0T));
blanchet@49302
   127
    val data_b = Binding.qualified_name dataT_name;
blanchet@49498
   128
    val data_b_name = Binding.name_of data_b;
blanchet@49055
   129
blanchet@49633
   130
    fun qualify mandatory =
blanchet@49633
   131
      Binding.qualify mandatory data_b_name o
blanchet@49633
   132
      (rep_compat ? Binding.qualify false rep_compat_prefix);
blanchet@49633
   133
blanchet@49055
   134
    val (As, B) =
blanchet@49055
   135
      no_defs_lthy
blanchet@49298
   136
      |> mk_TFrees' (map Type.sort_of_atyp As0)
blanchet@49055
   137
      ||> the_single o fst o mk_TFrees 1;
blanchet@49055
   138
blanchet@49300
   139
    val dataT = Type (dataT_name, As);
blanchet@49055
   140
    val ctrs = map (mk_ctr As) ctrs0;
blanchet@49055
   141
    val ctr_Tss = map (binder_types o fastype_of) ctrs;
blanchet@49055
   142
blanchet@49055
   143
    val ms = map length ctr_Tss;
blanchet@49055
   144
traytel@49434
   145
    val raw_disc_bindings' = pad_list Binding.empty n raw_disc_bindings;
blanchet@49120
   146
blanchet@49174
   147
    fun can_really_rely_on_disc k =
traytel@49434
   148
      not (Binding.eq_name (nth raw_disc_bindings' (k - 1), Binding.empty)) orelse
traytel@49434
   149
      nth ms (k - 1) = 0;
blanchet@49174
   150
    fun can_rely_on_disc k =
blanchet@49174
   151
      can_really_rely_on_disc k orelse (k = 1 andalso not (can_really_rely_on_disc 2));
blanchet@49336
   152
    fun can_omit_disc_binding k m =
blanchet@49174
   153
      n = 1 orelse m = 0 orelse (n = 2 andalso can_rely_on_disc (3 - k));
blanchet@49120
   154
blanchet@49633
   155
    val std_disc_binding = qualify false o Binding.name o prefix isN o base_name_of_ctr;
blanchet@49120
   156
blanchet@49336
   157
    val disc_bindings =
blanchet@49336
   158
      raw_disc_bindings'
blanchet@49120
   159
      |> map4 (fn k => fn m => fn ctr => fn disc =>
blanchet@49633
   160
        Option.map (qualify false)
traytel@49434
   161
          (if Binding.eq_name (disc, Binding.empty) then
blanchet@49336
   162
             if can_omit_disc_binding k m then NONE else SOME (std_disc_binding ctr)
blanchet@49336
   163
           else if Binding.eq_name (disc, std_binding) then
blanchet@49336
   164
             SOME (std_disc_binding ctr)
blanchet@49302
   165
           else
blanchet@49302
   166
             SOME disc)) ks ms ctrs0;
blanchet@49056
   167
blanchet@49336
   168
    val no_discs = map is_none disc_bindings;
blanchet@49116
   169
blanchet@49336
   170
    fun std_sel_binding m l = Binding.name o mk_unN m l o base_name_of_ctr;
blanchet@49120
   171
blanchet@49336
   172
    val sel_bindingss =
blanchet@49336
   173
      pad_list [] n raw_sel_bindingss
blanchet@49056
   174
      |> map3 (fn ctr => fn m => map2 (fn l => fn sel =>
blanchet@49633
   175
        qualify false
traytel@49434
   176
          (if Binding.eq_name (sel, Binding.empty) orelse Binding.eq_name (sel, std_binding) then
blanchet@49336
   177
            std_sel_binding m l ctr
blanchet@49302
   178
          else
traytel@49434
   179
            sel)) (1 upto m) o pad_list Binding.empty m) ctrs0 ms;
blanchet@49020
   180
blanchet@49536
   181
    val casex = mk_case As B case0;
blanchet@49201
   182
    val case_Ts = map (fn Ts => Ts ---> B) ctr_Tss;
blanchet@49043
   183
blanchet@49498
   184
    val (((((((xss, xss'), yss), fs), gs), [u', v']), (p, p')), names_lthy) = no_defs_lthy |>
blanchet@49364
   185
      mk_Freess' "x" ctr_Tss
blanchet@49025
   186
      ||>> mk_Freess "y" ctr_Tss
blanchet@49201
   187
      ||>> mk_Frees "f" case_Ts
blanchet@49201
   188
      ||>> mk_Frees "g" case_Ts
blanchet@49498
   189
      ||>> (apfst (map (rpair dataT)) oo Variable.variant_fixes) [data_b_name, data_b_name ^ "'"]
blanchet@49043
   190
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "P") HOLogic.boolT;
blanchet@49043
   191
blanchet@49498
   192
    val u = Free u';
blanchet@49498
   193
    val v = Free v';
blanchet@49463
   194
    val q = Free (fst p', mk_pred1T B);
blanchet@49020
   195
blanchet@49025
   196
    val xctrs = map2 (curry Term.list_comb) ctrs xss;
blanchet@49025
   197
    val yctrs = map2 (curry Term.list_comb) ctrs yss;
blanchet@49032
   198
blanchet@49043
   199
    val xfs = map2 (curry Term.list_comb) fs xss;
blanchet@49043
   200
    val xgs = map2 (curry Term.list_comb) gs xss;
blanchet@49043
   201
blanchet@51759
   202
    val fcase = Term.list_comb (casex, fs);
blanchet@51759
   203
    val gcase = Term.list_comb (casex, gs);
blanchet@51759
   204
blanchet@51759
   205
    val ufcase = fcase $ u;
blanchet@51759
   206
    val vfcase = fcase $ v;
blanchet@51759
   207
blanchet@51759
   208
    (* TODO: Eta-expension is for compatibility with the old datatype package (but it also provides
blanchet@51759
   209
       nicer names). Consider removing. *)
blanchet@49437
   210
    val eta_fs = map2 eta_expand_arg xss xfs;
blanchet@49437
   211
    val eta_gs = map2 eta_expand_arg xss xgs;
blanchet@49043
   212
blanchet@51759
   213
    val eta_fcase = Term.list_comb (casex, eta_fs);
blanchet@51759
   214
    val eta_gcase = Term.list_comb (casex, eta_gs);
blanchet@49020
   215
blanchet@51759
   216
    val eta_ufcase = eta_fcase $ u;
blanchet@51759
   217
    val eta_vgcase = eta_gcase $ v;
blanchet@49486
   218
blanchet@49591
   219
    fun mk_uu_eq () = HOLogic.mk_eq (u, u);
blanchet@49486
   220
blanchet@49591
   221
    val uv_eq = mk_Trueprop_eq (u, v);
blanchet@49486
   222
blanchet@49486
   223
    val exist_xs_u_eq_ctrs =
blanchet@49486
   224
      map2 (fn xctr => fn xs => list_exists_free xs (HOLogic.mk_eq (u, xctr))) xctrs xss;
blanchet@49022
   225
blanchet@51743
   226
    val unique_disc_no_def = TrueI; (*arbitrary marker*)
blanchet@51743
   227
    val alternate_disc_no_def = FalseE; (*arbitrary marker*)
blanchet@51743
   228
blanchet@49486
   229
    fun alternate_disc_lhs get_udisc k =
blanchet@49116
   230
      HOLogic.mk_not
blanchet@49336
   231
        (case nth disc_bindings (k - 1) of
blanchet@49486
   232
          NONE => nth exist_xs_u_eq_ctrs (k - 1)
blanchet@49486
   233
        | SOME b => get_udisc b (k - 1));
blanchet@49116
   234
blanchet@49486
   235
    val (all_sels_distinct, discs, selss, udiscs, uselss, vdiscs, vselss, disc_defs, sel_defs,
blanchet@49486
   236
         sel_defss, lthy') =
blanchet@49278
   237
      if no_dests then
blanchet@49486
   238
        (true, [], [], [], [], [], [], [], [], [], no_defs_lthy)
blanchet@49278
   239
      else
blanchet@49278
   240
        let
blanchet@49463
   241
          fun disc_free b = Free (Binding.name_of b, mk_pred1T dataT);
blanchet@49025
   242
blanchet@49486
   243
          fun disc_spec b exist_xs_u_eq_ctr = mk_Trueprop_eq (disc_free b $ u, exist_xs_u_eq_ctr);
blanchet@49278
   244
blanchet@49500
   245
          fun alternate_disc k =
blanchet@49500
   246
            Term.lambda u (alternate_disc_lhs (K o rapp u o disc_free) (3 - k));
blanchet@49278
   247
blanchet@49280
   248
          fun mk_sel_case_args b proto_sels T =
blanchet@49280
   249
            map2 (fn Ts => fn k =>
blanchet@49280
   250
              (case AList.lookup (op =) proto_sels k of
blanchet@49280
   251
                NONE =>
blanchet@49364
   252
                (case AList.lookup Binding.eq_name (rev (nth sel_defaultss (k - 1))) b of
blanchet@49364
   253
                  NONE => fold_rev (Term.lambda o curry Free Name.uu) Ts (mk_undefined T)
blanchet@51380
   254
                | SOME t => t |> Type.constraint (Ts ---> T) |> Syntax.check_term no_defs_lthy)
blanchet@49280
   255
              | SOME (xs, x) => fold_rev Term.lambda xs x)) ctr_Tss ks;
blanchet@49258
   256
blanchet@49278
   257
          fun sel_spec b proto_sels =
blanchet@49278
   258
            let
blanchet@49278
   259
              val _ =
blanchet@49278
   260
                (case duplicates (op =) (map fst proto_sels) of
blanchet@49278
   261
                   k :: _ => error ("Duplicate selector name " ^ quote (Binding.name_of b) ^
blanchet@49278
   262
                     " for constructor " ^
blanchet@49278
   263
                     quote (Syntax.string_of_term no_defs_lthy (nth ctrs (k - 1))))
blanchet@49278
   264
                 | [] => ())
blanchet@49278
   265
              val T =
blanchet@49278
   266
                (case distinct (op =) (map (fastype_of o snd o snd) proto_sels) of
blanchet@49278
   267
                  [T] => T
blanchet@49278
   268
                | T :: T' :: _ => error ("Inconsistent range type for selector " ^
blanchet@49278
   269
                    quote (Binding.name_of b) ^ ": " ^ quote (Syntax.string_of_typ no_defs_lthy T) ^
blanchet@49278
   270
                    " vs. " ^ quote (Syntax.string_of_typ no_defs_lthy T')));
blanchet@49278
   271
            in
blanchet@49486
   272
              mk_Trueprop_eq (Free (Binding.name_of b, dataT --> T) $ u,
blanchet@49536
   273
                Term.list_comb (mk_case As T case0, mk_sel_case_args b proto_sels T) $ u)
blanchet@49278
   274
            end;
blanchet@49116
   275
blanchet@49336
   276
          val sel_bindings = flat sel_bindingss;
blanchet@49336
   277
          val uniq_sel_bindings = distinct Binding.eq_name sel_bindings;
blanchet@49336
   278
          val all_sels_distinct = (length uniq_sel_bindings = length sel_bindings);
blanchet@49285
   279
blanchet@49336
   280
          val sel_binding_index =
blanchet@49336
   281
            if all_sels_distinct then 1 upto length sel_bindings
blanchet@49336
   282
            else map (fn b => find_index (curry Binding.eq_name b) uniq_sel_bindings) sel_bindings;
blanchet@49285
   283
blanchet@49285
   284
          val proto_sels = flat (map3 (fn k => fn xs => map (fn x => (k, (xs, x)))) ks xss xss);
blanchet@49300
   285
          val sel_infos =
blanchet@49336
   286
            AList.group (op =) (sel_binding_index ~~ proto_sels)
blanchet@49285
   287
            |> sort (int_ord o pairself fst)
blanchet@49336
   288
            |> map snd |> curry (op ~~) uniq_sel_bindings;
blanchet@49336
   289
          val sel_bindings = map fst sel_infos;
blanchet@49258
   290
blanchet@49336
   291
          fun unflat_selss xs = unflat_lookup Binding.eq_name sel_bindings xs sel_bindingss;
blanchet@49258
   292
blanchet@49278
   293
          val (((raw_discs, raw_disc_defs), (raw_sels, raw_sel_defs)), (lthy', lthy)) =
blanchet@49278
   294
            no_defs_lthy
blanchet@49486
   295
            |> apfst split_list o fold_map4 (fn k => fn m => fn exist_xs_u_eq_ctr =>
blanchet@49278
   296
              fn NONE =>
blanchet@49591
   297
                 if n = 1 then pair (Term.lambda u (mk_uu_eq ()), unique_disc_no_def)
blanchet@49486
   298
                 else if m = 0 then pair (Term.lambda u exist_xs_u_eq_ctr, refl)
blanchet@49278
   299
                 else pair (alternate_disc k, alternate_disc_no_def)
blanchet@49278
   300
               | SOME b => Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49486
   301
                   ((Thm.def_binding b, []), disc_spec b exist_xs_u_eq_ctr)) #>> apsnd snd)
blanchet@49486
   302
              ks ms exist_xs_u_eq_ctrs disc_bindings
blanchet@49278
   303
            ||>> apfst split_list o fold_map (fn (b, proto_sels) =>
blanchet@49278
   304
              Specification.definition (SOME (b, NONE, NoSyn),
blanchet@49300
   305
                ((Thm.def_binding b, []), sel_spec b proto_sels)) #>> apsnd snd) sel_infos
blanchet@49278
   306
            ||> `Local_Theory.restore;
blanchet@49022
   307
blanchet@49278
   308
          val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49025
   309
blanchet@49278
   310
          val disc_defs = map (Morphism.thm phi) raw_disc_defs;
blanchet@49281
   311
          val sel_defs = map (Morphism.thm phi) raw_sel_defs;
blanchet@49281
   312
          val sel_defss = unflat_selss sel_defs;
blanchet@49278
   313
blanchet@49278
   314
          val discs0 = map (Morphism.term phi) raw_discs;
blanchet@49278
   315
          val selss0 = unflat_selss (map (Morphism.term phi) raw_sels);
blanchet@49028
   316
blanchet@49278
   317
          val discs = map (mk_disc_or_sel As) discs0;
blanchet@49278
   318
          val selss = map (map (mk_disc_or_sel As)) selss0;
blanchet@49486
   319
blanchet@49500
   320
          val udiscs = map (rapp u) discs;
blanchet@49500
   321
          val uselss = map (map (rapp u)) selss;
blanchet@49486
   322
blanchet@49500
   323
          val vdiscs = map (rapp v) discs;
blanchet@49500
   324
          val vselss = map (map (rapp v)) selss;
blanchet@49278
   325
        in
blanchet@49486
   326
          (all_sels_distinct, discs, selss, udiscs, uselss, vdiscs, vselss, disc_defs, sel_defs,
blanchet@49486
   327
           sel_defss, lthy')
blanchet@49278
   328
        end;
blanchet@49025
   329
blanchet@49032
   330
    fun mk_imp_p Qs = Logic.list_implies (Qs, HOLogic.mk_Trueprop p);
blanchet@49029
   331
blanchet@49458
   332
    val exhaust_goal =
blanchet@49486
   333
      let fun mk_prem xctr xs = fold_rev Logic.all xs (mk_imp_p [mk_Trueprop_eq (u, xctr)]) in
blanchet@49486
   334
        fold_rev Logic.all [p, u] (mk_imp_p (map2 mk_prem xctrs xss))
blanchet@49020
   335
      end;
blanchet@49019
   336
blanchet@49484
   337
    val inject_goalss =
blanchet@49017
   338
      let
blanchet@49034
   339
        fun mk_goal _ _ [] [] = []
blanchet@49025
   340
          | mk_goal xctr yctr xs ys =
blanchet@49121
   341
            [fold_rev Logic.all (xs @ ys) (mk_Trueprop_eq (HOLogic.mk_eq (xctr, yctr),
blanchet@49121
   342
              Library.foldr1 HOLogic.mk_conj (map2 (curry HOLogic.mk_eq) xs ys)))];
blanchet@49017
   343
      in
blanchet@49034
   344
        map4 mk_goal xctrs yctrs xss yss
blanchet@49017
   345
      end;
blanchet@49017
   346
blanchet@49484
   347
    val half_distinct_goalss =
blanchet@49121
   348
      let
blanchet@49203
   349
        fun mk_goal ((xs, xc), (xs', xc')) =
blanchet@49121
   350
          fold_rev Logic.all (xs @ xs')
blanchet@49203
   351
            (HOLogic.mk_Trueprop (HOLogic.mk_not (HOLogic.mk_eq (xc, xc'))));
blanchet@49121
   352
      in
blanchet@49585
   353
        map (map mk_goal) (mk_half_pairss (`I (xss ~~ xctrs)))
blanchet@49121
   354
      end;
blanchet@49019
   355
blanchet@49458
   356
    val cases_goal =
blanchet@49121
   357
      map3 (fn xs => fn xctr => fn xf =>
blanchet@51770
   358
        fold_rev Logic.all (fs @ xs) (mk_Trueprop_eq (fcase $ xctr, xf))) xss xctrs xfs;
blanchet@49025
   359
blanchet@49484
   360
    val goalss = [exhaust_goal] :: inject_goalss @ half_distinct_goalss @ [cases_goal];
blanchet@49019
   361
blanchet@49019
   362
    fun after_qed thmss lthy =
blanchet@49019
   363
      let
blanchet@49048
   364
        val ([exhaust_thm], (inject_thmss, (half_distinct_thmss, [case_thms]))) =
blanchet@49048
   365
          (hd thmss, apsnd (chop (n * n)) (chop n (tl thmss)));
blanchet@49019
   366
blanchet@49438
   367
        val inject_thms = flat inject_thmss;
blanchet@49438
   368
blanchet@49486
   369
        val Tinst = map (pairself (certifyT lthy)) (map Logic.varifyT_global As ~~ As);
blanchet@49486
   370
blanchet@49486
   371
        fun inst_thm t thm =
blanchet@49486
   372
          Drule.instantiate' [] [SOME (certify lthy t)]
blanchet@49486
   373
            (Thm.instantiate (Tinst, []) (Drule.zero_var_indexes thm));
blanchet@49486
   374
blanchet@49486
   375
        val uexhaust_thm = inst_thm u exhaust_thm;
blanchet@49032
   376
blanchet@49300
   377
        val exhaust_cases = map base_name_of_ctr ctrs;
blanchet@49300
   378
blanchet@49048
   379
        val other_half_distinct_thmss = map (map (fn thm => thm RS not_sym)) half_distinct_thmss;
blanchet@49048
   380
blanchet@49486
   381
        val (distinct_thms, (distinct_thmsss', distinct_thmsss)) =
blanchet@49585
   382
          join_halves n half_distinct_thmss other_half_distinct_thmss ||> `transpose;
blanchet@49019
   383
blanchet@49020
   384
        val nchotomy_thm =
blanchet@49020
   385
          let
blanchet@49020
   386
            val goal =
blanchet@49486
   387
              HOLogic.mk_Trueprop (HOLogic.mk_all (fst u', snd u',
blanchet@49486
   388
                Library.foldr1 HOLogic.mk_disj exist_xs_u_eq_ctrs));
blanchet@49020
   389
          in
wenzelm@51551
   390
            Goal.prove_sorry lthy [] [] goal (fn _ => mk_nchotomy_tac n exhaust_thm)
traytel@49667
   391
            |> Thm.close_derivation
blanchet@49020
   392
          end;
blanchet@49020
   393
blanchet@49484
   394
        val (all_sel_thms, sel_thmss, disc_thmss, disc_thms, discI_thms, disc_exclude_thms,
blanchet@49594
   395
             disc_exhaust_thms, collapse_thms, expand_thms, case_conv_thms) =
blanchet@49278
   396
          if no_dests then
blanchet@49486
   397
            ([], [], [], [], [], [], [], [], [], [])
blanchet@49116
   398
          else
blanchet@49116
   399
            let
blanchet@49364
   400
              fun make_sel_thm xs' case_thm sel_def =
blanchet@49364
   401
                zero_var_indexes (Drule.gen_all (Drule.rename_bvars' (map (SOME o fst) xs')
blanchet@49364
   402
                    (Drule.forall_intr_vars (case_thm RS (sel_def RS trans)))));
blanchet@49281
   403
blanchet@49281
   404
              fun has_undefined_rhs thm =
blanchet@49281
   405
                (case snd (HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of thm))) of
blanchet@49281
   406
                  Const (@{const_name undefined}, _) => true
blanchet@49281
   407
                | _ => false);
blanchet@49281
   408
blanchet@49364
   409
              val sel_thmss = map3 (map oo make_sel_thm) xss' case_thms sel_defss;
blanchet@49281
   410
blanchet@49281
   411
              val all_sel_thms =
blanchet@49285
   412
                (if all_sels_distinct andalso forall null sel_defaultss then
blanchet@49285
   413
                   flat sel_thmss
blanchet@49285
   414
                 else
blanchet@49364
   415
                   map_product (fn s => fn (xs', c) => make_sel_thm xs' c s) sel_defs
blanchet@49364
   416
                     (xss' ~~ case_thms))
blanchet@49285
   417
                |> filter_out has_undefined_rhs;
blanchet@49278
   418
blanchet@49278
   419
              fun mk_unique_disc_def () =
blanchet@49278
   420
                let
blanchet@49278
   421
                  val m = the_single ms;
blanchet@49591
   422
                  val goal = mk_Trueprop_eq (mk_uu_eq (), the_single exist_xs_u_eq_ctrs);
blanchet@49278
   423
                in
wenzelm@51551
   424
                  Goal.prove_sorry lthy [] [] goal (fn _ => mk_unique_disc_def_tac m uexhaust_thm)
blanchet@49692
   425
                  |> Thm.close_derivation
blanchet@49278
   426
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49278
   427
                end;
blanchet@49278
   428
blanchet@49278
   429
              fun mk_alternate_disc_def k =
blanchet@49278
   430
                let
blanchet@49278
   431
                  val goal =
blanchet@49486
   432
                    mk_Trueprop_eq (alternate_disc_lhs (K (nth udiscs)) (3 - k),
blanchet@49486
   433
                      nth exist_xs_u_eq_ctrs (k - 1));
blanchet@49278
   434
                in
wenzelm@51551
   435
                  Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49278
   436
                    mk_alternate_disc_def_tac ctxt k (nth disc_defs (2 - k))
blanchet@49486
   437
                      (nth distinct_thms (2 - k)) uexhaust_thm)
blanchet@49692
   438
                  |> Thm.close_derivation
blanchet@49278
   439
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49278
   440
                end;
blanchet@49028
   441
blanchet@49278
   442
              val has_alternate_disc_def =
blanchet@49278
   443
                exists (fn def => Thm.eq_thm_prop (def, alternate_disc_no_def)) disc_defs;
blanchet@49278
   444
blanchet@49278
   445
              val disc_defs' =
blanchet@49278
   446
                map2 (fn k => fn def =>
blanchet@49278
   447
                  if Thm.eq_thm_prop (def, unique_disc_no_def) then mk_unique_disc_def ()
blanchet@49278
   448
                  else if Thm.eq_thm_prop (def, alternate_disc_no_def) then mk_alternate_disc_def k
blanchet@49278
   449
                  else def) ks disc_defs;
blanchet@49278
   450
blanchet@49278
   451
              val discD_thms = map (fn def => def RS iffD1) disc_defs';
blanchet@49278
   452
              val discI_thms =
blanchet@49278
   453
                map2 (fn m => fn def => funpow m (fn thm => exI RS thm) (def RS iffD2)) ms
blanchet@49278
   454
                  disc_defs';
blanchet@49278
   455
              val not_discI_thms =
blanchet@49278
   456
                map2 (fn m => fn def => funpow m (fn thm => allI RS thm)
blanchet@49504
   457
                    (unfold_thms lthy @{thms not_ex} (def RS @{thm ssubst[of _ _ Not]})))
blanchet@49278
   458
                  ms disc_defs';
blanchet@49278
   459
blanchet@49278
   460
              val (disc_thmss', disc_thmss) =
blanchet@49278
   461
                let
blanchet@49278
   462
                  fun mk_thm discI _ [] = refl RS discI
blanchet@49278
   463
                    | mk_thm _ not_discI [distinct] = distinct RS not_discI;
blanchet@49278
   464
                  fun mk_thms discI not_discI distinctss = map (mk_thm discI not_discI) distinctss;
blanchet@49278
   465
                in
blanchet@49278
   466
                  map3 mk_thms discI_thms not_discI_thms distinct_thmsss' |> `transpose
blanchet@49278
   467
                end;
blanchet@49278
   468
blanchet@49278
   469
              val disc_thms = flat (map2 (fn true => K [] | false => I) no_discs disc_thmss);
blanchet@49028
   470
blanchet@49486
   471
              val (disc_exclude_thms, (disc_exclude_thmsss', disc_exclude_thmsss)) =
blanchet@49486
   472
                let
blanchet@49486
   473
                  fun mk_goal [] = []
blanchet@49486
   474
                    | mk_goal [((_, udisc), (_, udisc'))] =
blanchet@49486
   475
                      [Logic.all u (Logic.mk_implies (HOLogic.mk_Trueprop udisc,
blanchet@49486
   476
                         HOLogic.mk_Trueprop (HOLogic.mk_not udisc')))];
blanchet@49486
   477
traytel@49667
   478
                  fun prove tac goal =
wenzelm@51551
   479
                    Goal.prove_sorry lthy [] [] goal (K tac)
traytel@49667
   480
                    |> Thm.close_derivation;
blanchet@49486
   481
blanchet@49585
   482
                  val half_pairss = mk_half_pairss (`I (ms ~~ discD_thms ~~ udiscs));
blanchet@49486
   483
blanchet@49486
   484
                  val half_goalss = map mk_goal half_pairss;
blanchet@49486
   485
                  val half_thmss =
blanchet@49486
   486
                    map3 (fn [] => K (K []) | [goal] => fn [(((m, discD), _), _)] =>
blanchet@49486
   487
                        fn disc_thm => [prove (mk_half_disc_exclude_tac m discD disc_thm) goal])
blanchet@49486
   488
                      half_goalss half_pairss (flat disc_thmss');
blanchet@49278
   489
blanchet@49486
   490
                  val other_half_goalss = map (mk_goal o map swap) half_pairss;
blanchet@49486
   491
                  val other_half_thmss =
blanchet@49486
   492
                    map2 (map2 (prove o mk_other_half_disc_exclude_tac)) half_thmss
blanchet@49486
   493
                      other_half_goalss;
blanchet@49486
   494
                in
blanchet@49585
   495
                  join_halves n half_thmss other_half_thmss ||> `transpose
blanchet@49486
   496
                  |>> has_alternate_disc_def ? K []
blanchet@49486
   497
                end;
blanchet@49278
   498
blanchet@49486
   499
              val disc_exhaust_thm =
blanchet@49486
   500
                let
blanchet@49486
   501
                  fun mk_prem udisc = mk_imp_p [HOLogic.mk_Trueprop udisc];
blanchet@49486
   502
                  val goal = fold_rev Logic.all [p, u] (mk_imp_p (map mk_prem udiscs));
blanchet@49486
   503
                in
wenzelm@51551
   504
                  Goal.prove_sorry lthy [] [] goal (fn _ =>
blanchet@49486
   505
                    mk_disc_exhaust_tac n exhaust_thm discI_thms)
traytel@49667
   506
                  |> Thm.close_derivation
blanchet@49486
   507
                end;
blanchet@49028
   508
blanchet@49486
   509
              val (collapse_thms, collapse_thm_opts) =
blanchet@49486
   510
                let
blanchet@49486
   511
                  fun mk_goal ctr udisc usels =
blanchet@49486
   512
                    let
blanchet@49486
   513
                      val prem = HOLogic.mk_Trueprop udisc;
blanchet@49486
   514
                      val concl =
blanchet@49486
   515
                        mk_Trueprop_eq ((null usels ? swap) (Term.list_comb (ctr, usels), u));
blanchet@49486
   516
                    in
blanchet@49486
   517
                      if prem aconv concl then NONE
blanchet@49486
   518
                      else SOME (Logic.all u (Logic.mk_implies (prem, concl)))
blanchet@49486
   519
                    end;
blanchet@49486
   520
                  val goals = map3 mk_goal ctrs udiscs uselss;
blanchet@49486
   521
                in
blanchet@49486
   522
                  map4 (fn m => fn discD => fn sel_thms => Option.map (fn goal =>
wenzelm@51551
   523
                    Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49486
   524
                      mk_collapse_tac ctxt m discD sel_thms)
traytel@49667
   525
                    |> Thm.close_derivation
blanchet@49486
   526
                    |> perhaps (try (fn thm => refl RS thm)))) ms discD_thms sel_thmss goals
blanchet@49486
   527
                  |> `(map_filter I)
blanchet@49486
   528
                end;
blanchet@49025
   529
blanchet@49486
   530
              val expand_thms =
blanchet@49486
   531
                let
blanchet@49486
   532
                  fun mk_prems k udisc usels vdisc vsels =
blanchet@49486
   533
                    (if k = n then [] else [mk_Trueprop_eq (udisc, vdisc)]) @
blanchet@49486
   534
                    (if null usels then
blanchet@49486
   535
                       []
blanchet@49486
   536
                     else
blanchet@49486
   537
                       [Logic.list_implies
blanchet@49486
   538
                          (if n = 1 then [] else map HOLogic.mk_Trueprop [udisc, vdisc],
blanchet@49486
   539
                             HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
blanchet@49486
   540
                               (map2 (curry HOLogic.mk_eq) usels vsels)))]);
blanchet@49486
   541
blanchet@49591
   542
                  val goal =
blanchet@49591
   543
                    Library.foldr Logic.list_implies
blanchet@49591
   544
                      (map5 mk_prems ks udiscs uselss vdiscs vselss, uv_eq);
blanchet@49486
   545
                  val uncollapse_thms =
blanchet@51742
   546
                    map2 (fn NONE => K asm_rl | SOME thm => fn [] => thm | _ => thm RS sym)
blanchet@51742
   547
                      collapse_thm_opts uselss;
blanchet@49486
   548
                in
wenzelm@51551
   549
                  [Goal.prove_sorry lthy [] [] goal (fn _ =>
wenzelm@51717
   550
                     mk_expand_tac lthy n ms (inst_thm u disc_exhaust_thm)
blanchet@49486
   551
                       (inst_thm v disc_exhaust_thm) uncollapse_thms disc_exclude_thmsss
blanchet@49486
   552
                       disc_exclude_thmsss')]
blanchet@49692
   553
                  |> map Thm.close_derivation
blanchet@49486
   554
                  |> Proof_Context.export names_lthy lthy
blanchet@49486
   555
                end;
blanchet@49278
   556
blanchet@49594
   557
              val case_conv_thms =
blanchet@49486
   558
                let
blanchet@49486
   559
                  fun mk_body f usels = Term.list_comb (f, usels);
blanchet@51770
   560
                  val goal = mk_Trueprop_eq (ufcase, mk_IfN B udiscs (map2 mk_body fs uselss));
blanchet@49486
   561
                in
wenzelm@51551
   562
                  [Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@49594
   563
                     mk_case_conv_tac ctxt n uexhaust_thm case_thms disc_thmss' sel_thmss)]
blanchet@49692
   564
                  |> map Thm.close_derivation
blanchet@49486
   565
                  |> Proof_Context.export names_lthy lthy
blanchet@49486
   566
                end;
blanchet@49116
   567
            in
blanchet@49484
   568
              (all_sel_thms, sel_thmss, disc_thmss, disc_thms, discI_thms, disc_exclude_thms,
blanchet@49594
   569
               [disc_exhaust_thm], collapse_thms, expand_thms, case_conv_thms)
blanchet@49116
   570
            end;
blanchet@49025
   571
blanchet@49033
   572
        val (case_cong_thm, weak_case_cong_thm) =
blanchet@49032
   573
          let
blanchet@51763
   574
            fun mk_prem xctr xs xf xg =
blanchet@49486
   575
              fold_rev Logic.all xs (Logic.mk_implies (mk_Trueprop_eq (v, xctr),
blanchet@51763
   576
                mk_Trueprop_eq (xf, xg)));
blanchet@49033
   577
blanchet@49032
   578
            val goal =
blanchet@51763
   579
              Logic.list_implies (uv_eq :: map4 mk_prem xctrs xss xfs xgs,
blanchet@51759
   580
                 mk_Trueprop_eq (eta_ufcase, eta_vgcase));
blanchet@49591
   581
            val weak_goal = Logic.mk_implies (uv_eq, mk_Trueprop_eq (ufcase, vfcase));
blanchet@49032
   582
          in
wenzelm@51717
   583
            (Goal.prove_sorry lthy [] [] goal (fn _ => mk_case_cong_tac lthy uexhaust_thm case_thms),
wenzelm@51551
   584
             Goal.prove_sorry lthy [] [] weak_goal (K (etac arg_cong 1)))
blanchet@49692
   585
            |> pairself (Thm.close_derivation #> singleton (Proof_Context.export names_lthy lthy))
blanchet@49032
   586
          end;
blanchet@49025
   587
blanchet@49044
   588
        val (split_thm, split_asm_thm) =
blanchet@49043
   589
          let
blanchet@49044
   590
            fun mk_conjunct xctr xs f_xs =
blanchet@49486
   591
              list_all_free xs (HOLogic.mk_imp (HOLogic.mk_eq (u, xctr), q $ f_xs));
blanchet@49044
   592
            fun mk_disjunct xctr xs f_xs =
blanchet@49486
   593
              list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (u, xctr),
blanchet@49044
   594
                HOLogic.mk_not (q $ f_xs)));
blanchet@49044
   595
blanchet@51770
   596
            val lhs = q $ ufcase;
blanchet@49044
   597
blanchet@49043
   598
            val goal =
blanchet@49044
   599
              mk_Trueprop_eq (lhs, Library.foldr1 HOLogic.mk_conj (map3 mk_conjunct xctrs xss xfs));
blanchet@49458
   600
            val asm_goal =
blanchet@49044
   601
              mk_Trueprop_eq (lhs, HOLogic.mk_not (Library.foldr1 HOLogic.mk_disj
blanchet@49044
   602
                (map3 mk_disjunct xctrs xss xfs)));
blanchet@49044
   603
blanchet@49044
   604
            val split_thm =
wenzelm@51551
   605
              Goal.prove_sorry lthy [] [] goal
wenzelm@51717
   606
                (fn _ => mk_split_tac lthy uexhaust_thm case_thms inject_thmss distinct_thmsss)
blanchet@49692
   607
              |> Thm.close_derivation
blanchet@49692
   608
              |> singleton (Proof_Context.export names_lthy lthy);
blanchet@49044
   609
            val split_asm_thm =
wenzelm@51551
   610
              Goal.prove_sorry lthy [] [] asm_goal (fn {context = ctxt, ...} =>
blanchet@49044
   611
                mk_split_asm_tac ctxt split_thm)
blanchet@49692
   612
              |> Thm.close_derivation
blanchet@49692
   613
              |> singleton (Proof_Context.export names_lthy lthy);
blanchet@49043
   614
          in
blanchet@49044
   615
            (split_thm, split_asm_thm)
blanchet@49043
   616
          end;
blanchet@49025
   617
blanchet@49437
   618
        val exhaust_case_names_attr = Attrib.internal (K (Rule_Cases.case_names exhaust_cases));
blanchet@49300
   619
        val cases_type_attr = Attrib.internal (K (Induct.cases_type dataT_name));
blanchet@49300
   620
blanchet@49052
   621
        val notes =
blanchet@49594
   622
          [(caseN, case_thms, simp_attrs),
blanchet@49594
   623
           (case_congN, [case_cong_thm], []),
blanchet@49594
   624
           (case_convN, case_conv_thms, []),
blanchet@49300
   625
           (collapseN, collapse_thms, simp_attrs),
blanchet@49300
   626
           (discsN, disc_thms, simp_attrs),
blanchet@49300
   627
           (disc_excludeN, disc_exclude_thms, []),
blanchet@49300
   628
           (disc_exhaustN, disc_exhaust_thms, [exhaust_case_names_attr]),
blanchet@49300
   629
           (distinctN, distinct_thms, simp_attrs @ induct_simp_attrs),
blanchet@49300
   630
           (exhaustN, [exhaust_thm], [exhaust_case_names_attr, cases_type_attr]),
blanchet@49486
   631
           (expandN, expand_thms, []),
blanchet@49438
   632
           (injectN, inject_thms, iff_attrs @ induct_simp_attrs),
blanchet@49300
   633
           (nchotomyN, [nchotomy_thm], []),
blanchet@49300
   634
           (selsN, all_sel_thms, simp_attrs),
blanchet@49300
   635
           (splitN, [split_thm], []),
blanchet@49300
   636
           (split_asmN, [split_asm_thm], []),
blanchet@49633
   637
           (splitsN, [split_thm, split_asm_thm], []),
blanchet@49300
   638
           (weak_case_cong_thmsN, [weak_case_cong_thm], cong_attrs)]
blanchet@49300
   639
          |> filter_out (null o #2)
blanchet@49300
   640
          |> map (fn (thmN, thms, attrs) =>
blanchet@49633
   641
            ((qualify true (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49300
   642
blanchet@49300
   643
        val notes' =
blanchet@49300
   644
          [(map (fn th => th RS notE) distinct_thms, safe_elim_attrs)]
blanchet@49300
   645
          |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
blanchet@49019
   646
      in
blanchet@49591
   647
        ((discs, selss, exhaust_thm, inject_thms, distinct_thms, case_thms, disc_thmss, discI_thms,
traytel@51695
   648
          sel_thmss),
traytel@51695
   649
          lthy
traytel@51697
   650
          |> not rep_compat ?
traytel@51697
   651
             (Local_Theory.declaration {syntax = false, pervasive = true}
traytel@51697
   652
               (fn phi => Case_Translation.register
traytel@51697
   653
                 (Morphism.term phi casex) (map (Morphism.term phi) ctrs)))
traytel@51695
   654
          |> Local_Theory.notes (notes' @ notes) |> snd)
blanchet@49019
   655
      end;
blanchet@49017
   656
  in
blanchet@49121
   657
    (goalss, after_qed, lthy')
blanchet@49017
   658
  end;
blanchet@49017
   659
blanchet@49199
   660
fun wrap_datatype tacss = (fn (goalss, after_qed, lthy) =>
wenzelm@51551
   661
  map2 (map2 (Thm.close_derivation oo Goal.prove_sorry lthy [] [])) goalss tacss
blanchet@49280
   662
  |> (fn thms => after_qed thms lthy)) oo prepare_wrap_datatype (K I);
blanchet@49280
   663
blanchet@49297
   664
val wrap_datatype_cmd = (fn (goalss, after_qed, lthy) =>
blanchet@49297
   665
  Proof.theorem NONE (snd oo after_qed) (map (map (rpair [])) goalss) lthy) oo
traytel@51696
   666
  prepare_wrap_datatype Syntax.read_term;
blanchet@49297
   667
blanchet@49280
   668
fun parse_bracket_list parser = @{keyword "["} |-- Parse.list parser --|  @{keyword "]"};
blanchet@49111
   669
blanchet@49280
   670
val parse_bindings = parse_bracket_list Parse.binding;
blanchet@49280
   671
val parse_bindingss = parse_bracket_list parse_bindings;
blanchet@49280
   672
blanchet@49280
   673
val parse_bound_term = (Parse.binding --| @{keyword ":"}) -- Parse.term;
blanchet@49280
   674
val parse_bound_terms = parse_bracket_list parse_bound_term;
blanchet@49280
   675
val parse_bound_termss = parse_bracket_list parse_bound_terms;
blanchet@49017
   676
blanchet@49278
   677
val parse_wrap_options =
blanchet@49633
   678
  Scan.optional (@{keyword "("} |-- Parse.list1 ((@{keyword "no_dests"} >> K (true, false)) ||
blanchet@49633
   679
      (@{keyword "rep_compat"} >> K (false, true))) --| @{keyword ")"}
blanchet@49633
   680
    >> (pairself (exists I) o split_list)) (false, false);
blanchet@49278
   681
blanchet@49017
   682
val _ =
wenzelm@50214
   683
  Outer_Syntax.local_theory_to_proof @{command_spec "wrap_data"} "wrap an existing datatype"
blanchet@49278
   684
    ((parse_wrap_options -- (@{keyword "["} |-- Parse.list Parse.term --| @{keyword "]"}) --
blanchet@49280
   685
      Parse.term -- Scan.optional (parse_bindings -- Scan.optional (parse_bindingss --
blanchet@49280
   686
        Scan.optional parse_bound_termss []) ([], [])) ([], ([], [])))
blanchet@49199
   687
     >> wrap_datatype_cmd);
blanchet@49017
   688
blanchet@49017
   689
end;