src/HOL/Tools/Ctr_Sugar/ctr_sugar.ML
author blanchet
Wed Jul 30 09:40:28 2014 +0200 (2014-07-30)
changeset 57830 2d0f0d6fdf3e
parent 57633 4ff8c090d580
child 57882 38bf4de248a6
permissions -rw-r--r--
correctly resolve selector names in default value equations
blanchet@54701
     1
(*  Title:      HOL/Tools/Ctr_Sugar/ctr_sugar.ML
blanchet@49017
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@54397
     3
    Copyright   2012, 2013
blanchet@49017
     4
blanchet@51797
     5
Wrapping existing freely generated type's constructors.
blanchet@49017
     6
*)
blanchet@49017
     7
blanchet@54006
     8
signature CTR_SUGAR =
blanchet@49017
     9
sig
blanchet@51840
    10
  type ctr_sugar =
blanchet@51839
    11
    {ctrs: term list,
blanchet@52375
    12
     casex: term,
blanchet@51839
    13
     discs: term list,
blanchet@51819
    14
     selss: term list list,
blanchet@51819
    15
     exhaust: thm,
blanchet@52375
    16
     nchotomy: thm,
blanchet@51819
    17
     injects: thm list,
blanchet@51819
    18
     distincts: thm list,
blanchet@51819
    19
     case_thms: thm list,
blanchet@52375
    20
     case_cong: thm,
blanchet@52375
    21
     weak_case_cong: thm,
blanchet@52375
    22
     split: thm,
blanchet@52375
    23
     split_asm: thm,
blanchet@56858
    24
     disc_defs: thm list,
blanchet@51819
    25
     disc_thmss: thm list list,
blanchet@51819
    26
     discIs: thm list,
blanchet@56858
    27
     sel_defs: thm list,
blanchet@53475
    28
     sel_thmss: thm list list,
blanchet@54900
    29
     disc_excludesss: thm list list list,
blanchet@53475
    30
     disc_exhausts: thm list,
blanchet@53916
    31
     sel_exhausts: thm list,
blanchet@53475
    32
     collapses: thm list,
blanchet@53475
    33
     expands: thm list,
blanchet@53917
    34
     sel_splits: thm list,
blanchet@53917
    35
     sel_split_asms: thm list,
blanchet@54491
    36
     case_eq_ifs: thm list};
blanchet@51809
    37
blanchet@51840
    38
  val morph_ctr_sugar: morphism -> ctr_sugar -> ctr_sugar
blanchet@54256
    39
  val transfer_ctr_sugar: Proof.context -> ctr_sugar -> ctr_sugar
blanchet@53867
    40
  val ctr_sugar_of: Proof.context -> string -> ctr_sugar option
blanchet@53906
    41
  val ctr_sugars_of: Proof.context -> ctr_sugar list
blanchet@54403
    42
  val ctr_sugar_of_case: Proof.context -> string -> ctr_sugar option
blanchet@56345
    43
  val ctr_sugar_interpretation: (ctr_sugar -> theory -> theory) -> theory -> theory
blanchet@54399
    44
  val register_ctr_sugar: string -> ctr_sugar -> local_theory -> local_theory
blanchet@55444
    45
  val default_register_ctr_sugar_global: string -> ctr_sugar -> theory -> theory
blanchet@51823
    46
blanchet@49585
    47
  val mk_half_pairss: 'a list * 'a list -> ('a * 'a) list list
blanchet@49585
    48
  val join_halves: int -> 'a list list -> 'a list list -> 'a list * 'a list list list
blanchet@49585
    49
blanchet@49203
    50
  val mk_ctr: typ list -> term -> term
blanchet@53864
    51
  val mk_case: typ list -> typ -> term -> term
blanchet@49484
    52
  val mk_disc_or_sel: typ list -> term -> term
blanchet@49622
    53
  val name_of_ctr: term -> string
blanchet@51777
    54
  val name_of_disc: term -> string
blanchet@53888
    55
  val dest_ctr: Proof.context -> string -> term -> term * term list
blanchet@54970
    56
  val dest_case: Proof.context -> string -> typ list -> term ->
blanchet@54970
    57
    (ctr_sugar * term list * term list) option
blanchet@49585
    58
blanchet@57200
    59
  type ('c, 'a) ctr_spec = (binding * 'c) * 'a list
blanchet@55469
    60
blanchet@57200
    61
  val disc_of_ctr_spec: ('c, 'a) ctr_spec -> binding
blanchet@57200
    62
  val ctr_of_ctr_spec: ('c, 'a) ctr_spec -> 'c
blanchet@57200
    63
  val args_of_ctr_spec: ('c, 'a) ctr_spec -> 'a list
blanchet@55469
    64
blanchet@57830
    65
  val fake_local_theory_for_sel_defaults: (binding * typ) list -> Proof.context -> Proof.context
blanchet@55468
    66
  val free_constructors: ({prems: thm list, context: Proof.context} -> tactic) list list ->
blanchet@57200
    67
    (((bool * bool) * binding) * (term, binding) ctr_spec list) * term list -> local_theory ->
blanchet@51840
    68
    ctr_sugar * local_theory
blanchet@49286
    69
  val parse_bound_term: (binding * string) parser
blanchet@55469
    70
  val parse_ctr_options: (bool * bool) parser
blanchet@57200
    71
  val parse_ctr_spec: 'c parser -> 'a parser -> ('c, 'a) ctr_spec parser
blanchet@57200
    72
  val parse_sel_default_eqs: string list parser
blanchet@49017
    73
end;
blanchet@49017
    74
blanchet@54006
    75
structure Ctr_Sugar : CTR_SUGAR =
blanchet@49017
    76
struct
blanchet@49017
    77
blanchet@54008
    78
open Ctr_Sugar_Util
blanchet@54006
    79
open Ctr_Sugar_Tactics
blanchet@54615
    80
open Ctr_Sugar_Code
blanchet@49017
    81
blanchet@51840
    82
type ctr_sugar =
blanchet@51839
    83
  {ctrs: term list,
blanchet@52375
    84
   casex: term,
blanchet@51839
    85
   discs: term list,
blanchet@51819
    86
   selss: term list list,
blanchet@51819
    87
   exhaust: thm,
blanchet@52375
    88
   nchotomy: thm,
blanchet@51819
    89
   injects: thm list,
blanchet@51819
    90
   distincts: thm list,
blanchet@51819
    91
   case_thms: thm list,
blanchet@52375
    92
   case_cong: thm,
blanchet@52375
    93
   weak_case_cong: thm,
blanchet@52375
    94
   split: thm,
blanchet@52375
    95
   split_asm: thm,
blanchet@56858
    96
   disc_defs: thm list,
blanchet@51819
    97
   disc_thmss: thm list list,
blanchet@51819
    98
   discIs: thm list,
blanchet@56858
    99
   sel_defs: thm list,
blanchet@53475
   100
   sel_thmss: thm list list,
blanchet@54900
   101
   disc_excludesss: thm list list list,
blanchet@53475
   102
   disc_exhausts: thm list,
blanchet@53916
   103
   sel_exhausts: thm list,
blanchet@53475
   104
   collapses: thm list,
blanchet@53475
   105
   expands: thm list,
blanchet@53917
   106
   sel_splits: thm list,
blanchet@53917
   107
   sel_split_asms: thm list,
blanchet@54491
   108
   case_eq_ifs: thm list};
blanchet@51809
   109
blanchet@52375
   110
fun morph_ctr_sugar phi {ctrs, casex, discs, selss, exhaust, nchotomy, injects, distincts,
blanchet@56858
   111
    case_thms, case_cong, weak_case_cong, split, split_asm, disc_defs, disc_thmss, discIs, sel_defs,
blanchet@56858
   112
    sel_thmss, disc_excludesss, disc_exhausts, sel_exhausts, collapses, expands, sel_splits,
blanchet@56858
   113
    sel_split_asms, case_eq_ifs} =
blanchet@51839
   114
  {ctrs = map (Morphism.term phi) ctrs,
blanchet@52375
   115
   casex = Morphism.term phi casex,
blanchet@51839
   116
   discs = map (Morphism.term phi) discs,
blanchet@51823
   117
   selss = map (map (Morphism.term phi)) selss,
blanchet@51823
   118
   exhaust = Morphism.thm phi exhaust,
blanchet@52375
   119
   nchotomy = Morphism.thm phi nchotomy,
blanchet@51823
   120
   injects = map (Morphism.thm phi) injects,
blanchet@51823
   121
   distincts = map (Morphism.thm phi) distincts,
blanchet@51823
   122
   case_thms = map (Morphism.thm phi) case_thms,
blanchet@52375
   123
   case_cong = Morphism.thm phi case_cong,
blanchet@52375
   124
   weak_case_cong = Morphism.thm phi weak_case_cong,
blanchet@52375
   125
   split = Morphism.thm phi split,
blanchet@52375
   126
   split_asm = Morphism.thm phi split_asm,
blanchet@56858
   127
   disc_defs = map (Morphism.thm phi) disc_defs,
blanchet@51823
   128
   disc_thmss = map (map (Morphism.thm phi)) disc_thmss,
blanchet@51823
   129
   discIs = map (Morphism.thm phi) discIs,
blanchet@56858
   130
   sel_defs = map (Morphism.thm phi) sel_defs,
blanchet@53475
   131
   sel_thmss = map (map (Morphism.thm phi)) sel_thmss,
blanchet@54900
   132
   disc_excludesss = map (map (map (Morphism.thm phi))) disc_excludesss,
blanchet@53475
   133
   disc_exhausts = map (Morphism.thm phi) disc_exhausts,
blanchet@53916
   134
   sel_exhausts = map (Morphism.thm phi) sel_exhausts,
blanchet@53475
   135
   collapses = map (Morphism.thm phi) collapses,
blanchet@53475
   136
   expands = map (Morphism.thm phi) expands,
blanchet@53917
   137
   sel_splits = map (Morphism.thm phi) sel_splits,
blanchet@53917
   138
   sel_split_asms = map (Morphism.thm phi) sel_split_asms,
blanchet@54491
   139
   case_eq_ifs = map (Morphism.thm phi) case_eq_ifs};
blanchet@51823
   140
blanchet@53906
   141
val transfer_ctr_sugar =
wenzelm@54740
   142
  morph_ctr_sugar o Morphism.transfer_morphism o Proof_Context.theory_of;
blanchet@53867
   143
blanchet@53867
   144
structure Data = Generic_Data
blanchet@53867
   145
(
blanchet@53867
   146
  type T = ctr_sugar Symtab.table;
blanchet@53867
   147
  val empty = Symtab.empty;
blanchet@53867
   148
  val extend = I;
blanchet@55394
   149
  fun merge data : T = Symtab.merge (K true) data;
blanchet@53867
   150
);
blanchet@53867
   151
blanchet@53867
   152
fun ctr_sugar_of ctxt =
blanchet@53867
   153
  Symtab.lookup (Data.get (Context.Proof ctxt))
blanchet@53906
   154
  #> Option.map (transfer_ctr_sugar ctxt);
blanchet@53906
   155
blanchet@53906
   156
fun ctr_sugars_of ctxt =
blanchet@53906
   157
  Symtab.fold (cons o transfer_ctr_sugar ctxt o snd) (Data.get (Context.Proof ctxt)) [];
blanchet@53867
   158
blanchet@54403
   159
fun ctr_sugar_of_case ctxt s =
blanchet@54403
   160
  find_first (fn {casex = Const (s', _), ...} => s' = s | _ => false) (ctr_sugars_of ctxt);
blanchet@54403
   161
blanchet@56345
   162
structure Ctr_Sugar_Interpretation = Interpretation
blanchet@56345
   163
(
blanchet@56345
   164
  type T = ctr_sugar;
blanchet@56345
   165
  val eq: T * T -> bool = op = o pairself #ctrs;
blanchet@56345
   166
);
blanchet@56345
   167
blanchet@56376
   168
fun with_repaired_path f (ctr_sugar as {ctrs = ctr1 :: _, ...} : ctr_sugar) thy =
blanchet@56376
   169
  thy
blanchet@56767
   170
  |> Sign.root_path
blanchet@56376
   171
  |> Sign.add_path (Long_Name.qualifier (fst (dest_Type (body_type (fastype_of ctr1)))))
blanchet@56767
   172
  |> (fn thy => f (morph_ctr_sugar (Morphism.transfer_morphism thy) ctr_sugar) thy)
blanchet@56767
   173
  |> Sign.restore_naming thy;
blanchet@56376
   174
blanchet@56657
   175
fun ctr_sugar_interpretation f = Ctr_Sugar_Interpretation.interpretation (with_repaired_path f);
blanchet@56345
   176
blanchet@53867
   177
fun register_ctr_sugar key ctr_sugar =
blanchet@54285
   178
  Local_Theory.declaration {syntax = false, pervasive = true}
blanchet@56345
   179
    (fn phi => Data.map (Symtab.update (key, morph_ctr_sugar phi ctr_sugar)))
blanchet@56345
   180
  #> Local_Theory.background_theory (Ctr_Sugar_Interpretation.data ctr_sugar);
blanchet@53867
   181
blanchet@56345
   182
fun default_register_ctr_sugar_global key ctr_sugar thy =
blanchet@56345
   183
  let val tab = Data.get (Context.Theory thy) in
blanchet@56345
   184
    if Symtab.defined tab key then
blanchet@56345
   185
      thy
blanchet@56345
   186
    else
blanchet@56345
   187
      thy
blanchet@56345
   188
      |> Context.theory_map (Data.put (Symtab.update_new (key, ctr_sugar) tab))
blanchet@56345
   189
      |> Ctr_Sugar_Interpretation.data ctr_sugar
blanchet@56345
   190
  end;
blanchet@54400
   191
blanchet@49223
   192
val isN = "is_";
blanchet@49223
   193
val unN = "un_";
blanchet@57629
   194
val notN = "not_";
blanchet@57629
   195
blanchet@49223
   196
fun mk_unN 1 1 suf = unN ^ suf
blanchet@49223
   197
  | mk_unN _ l suf = unN ^ suf ^ string_of_int l;
blanchet@49046
   198
blanchet@49594
   199
val caseN = "case";
blanchet@49054
   200
val case_congN = "case_cong";
blanchet@54491
   201
val case_eq_ifN = "case_eq_if";
blanchet@49118
   202
val collapseN = "collapse";
blanchet@49122
   203
val disc_excludeN = "disc_exclude";
blanchet@49054
   204
val disc_exhaustN = "disc_exhaust";
blanchet@53694
   205
val discN = "disc";
blanchet@53700
   206
val discIN = "discI";
blanchet@49054
   207
val distinctN = "distinct";
blanchet@49075
   208
val exhaustN = "exhaust";
blanchet@49486
   209
val expandN = "expand";
blanchet@49075
   210
val injectN = "inject";
blanchet@49075
   211
val nchotomyN = "nchotomy";
blanchet@53694
   212
val selN = "sel";
blanchet@53916
   213
val sel_exhaustN = "sel_exhaust";
blanchet@53917
   214
val sel_splitN = "sel_split";
blanchet@53917
   215
val sel_split_asmN = "sel_split_asm";
blanchet@49054
   216
val splitN = "split";
blanchet@49633
   217
val splitsN = "splits";
blanchet@49054
   218
val split_asmN = "split_asm";
blanchet@49054
   219
val weak_case_cong_thmsN = "weak_case_cong";
blanchet@49019
   220
blanchet@53700
   221
val cong_attrs = @{attributes [cong]};
blanchet@53836
   222
val dest_attrs = @{attributes [dest]};
blanchet@53700
   223
val safe_elim_attrs = @{attributes [elim!]};
blanchet@53700
   224
val iff_attrs = @{attributes [iff]};
blanchet@54145
   225
val inductsimp_attrs = @{attributes [induct_simp]};
blanchet@54145
   226
val nitpicksimp_attrs = @{attributes [nitpick_simp]};
blanchet@49300
   227
val simp_attrs = @{attributes [simp]};
blanchet@54151
   228
val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs;
blanchet@54151
   229
val code_nitpicksimp_simp_attrs = code_nitpicksimp_attrs @ simp_attrs;
blanchet@49046
   230
blanchet@55480
   231
fun unflat_lookup eq xs ys = map (fn xs' => permute_like_unique eq xs xs' ys);
blanchet@49258
   232
blanchet@49585
   233
fun mk_half_pairss' _ ([], []) = []
blanchet@49591
   234
  | mk_half_pairss' indent (x :: xs, _ :: ys) =
blanchet@49585
   235
    indent @ fold_rev (cons o single o pair x) ys (mk_half_pairss' ([] :: indent) (xs, ys));
blanchet@49486
   236
blanchet@49585
   237
fun mk_half_pairss p = mk_half_pairss' [[]] p;
blanchet@49027
   238
blanchet@49486
   239
fun join_halves n half_xss other_half_xss =
blanchet@55342
   240
  (splice (flat half_xss) (flat other_half_xss),
blanchet@55342
   241
   map2 (map2 append) (Library.chop_groups n half_xss)
blanchet@55342
   242
     (transpose (Library.chop_groups n other_half_xss)));
blanchet@49027
   243
blanchet@49280
   244
fun mk_undefined T = Const (@{const_name undefined}, T);
blanchet@49055
   245
blanchet@49500
   246
fun mk_ctr Ts t =
blanchet@49500
   247
  let val Type (_, Ts0) = body_type (fastype_of t) in
blanchet@54435
   248
    subst_nonatomic_types (Ts0 ~~ Ts) t
blanchet@49203
   249
  end;
blanchet@49203
   250
blanchet@49536
   251
fun mk_case Ts T t =
blanchet@49536
   252
  let val (Type (_, Ts0), body) = strip_type (fastype_of t) |>> List.last in
blanchet@54435
   253
    subst_nonatomic_types ((body, T) :: (Ts0 ~~ Ts)) t
blanchet@49536
   254
  end;
blanchet@49536
   255
blanchet@53864
   256
fun mk_disc_or_sel Ts t =
blanchet@54435
   257
  subst_nonatomic_types (snd (Term.dest_Type (domain_type (fastype_of t))) ~~ Ts) t;
blanchet@53864
   258
blanchet@51777
   259
fun name_of_const what t =
blanchet@51777
   260
  (case head_of t of
blanchet@49622
   261
    Const (s, _) => s
blanchet@49622
   262
  | Free (s, _) => s
blanchet@51777
   263
  | _ => error ("Cannot extract name of " ^ what));
blanchet@51777
   264
blanchet@51777
   265
val name_of_ctr = name_of_const "constructor";
blanchet@51777
   266
blanchet@51777
   267
fun name_of_disc t =
blanchet@51777
   268
  (case head_of t of
blanchet@51777
   269
    Abs (_, _, @{const Not} $ (t' $ Bound 0)) =>
blanchet@51777
   270
    Long_Name.map_base_name (prefix notN) (name_of_disc t')
blanchet@51777
   271
  | Abs (_, _, Const (@{const_name HOL.eq}, _) $ Bound 0 $ t') =>
blanchet@57260
   272
    Long_Name.map_base_name (prefix isN) (name_of_disc t')
blanchet@51777
   273
  | Abs (_, _, @{const Not} $ (Const (@{const_name HOL.eq}, _) $ Bound 0 $ t')) =>
blanchet@57260
   274
    Long_Name.map_base_name (prefix (notN ^ isN)) (name_of_disc t')
blanchet@51777
   275
  | t' => name_of_const "destructor" t');
blanchet@49622
   276
blanchet@49622
   277
val base_name_of_ctr = Long_Name.base_name o name_of_ctr;
blanchet@49046
   278
blanchet@53888
   279
fun dest_ctr ctxt s t =
blanchet@55342
   280
  let val (f, args) = Term.strip_comb t in
blanchet@53888
   281
    (case ctr_sugar_of ctxt s of
blanchet@53888
   282
      SOME {ctrs, ...} =>
blanchet@53888
   283
      (case find_first (can (fo_match ctxt f)) ctrs of
blanchet@53888
   284
        SOME f' => (f', args)
blanchet@53888
   285
      | NONE => raise Fail "dest_ctr")
blanchet@53888
   286
    | NONE => raise Fail "dest_ctr")
blanchet@53888
   287
  end;
blanchet@53888
   288
blanchet@53870
   289
fun dest_case ctxt s Ts t =
blanchet@53870
   290
  (case Term.strip_comb t of
blanchet@53870
   291
    (Const (c, _), args as _ :: _) =>
blanchet@53870
   292
    (case ctr_sugar_of ctxt s of
blanchet@54970
   293
      SOME (ctr_sugar as {casex = Const (case_name, _), discs = discs0, selss = selss0, ...}) =>
blanchet@53870
   294
      if case_name = c then
blanchet@53924
   295
        let val n = length discs0 in
blanchet@53924
   296
          if n < length args then
blanchet@53924
   297
            let
blanchet@53924
   298
              val (branches, obj :: leftovers) = chop n args;
blanchet@53924
   299
              val discs = map (mk_disc_or_sel Ts) discs0;
blanchet@53924
   300
              val selss = map (map (mk_disc_or_sel Ts)) selss0;
blanchet@53924
   301
              val conds = map (rapp obj) discs;
blanchet@53924
   302
              val branch_argss = map (fn sels => map (rapp obj) sels @ leftovers) selss;
blanchet@53924
   303
              val branches' = map2 (curry Term.betapplys) branches branch_argss;
blanchet@53924
   304
            in
blanchet@54970
   305
              SOME (ctr_sugar, conds, branches')
blanchet@53924
   306
            end
blanchet@53924
   307
          else
blanchet@53924
   308
            NONE
blanchet@53870
   309
        end
blanchet@53870
   310
      else
blanchet@53870
   311
        NONE
blanchet@53870
   312
    | _ => NONE)
blanchet@53870
   313
  | _ => NONE);
blanchet@53870
   314
blanchet@57200
   315
fun const_or_free_name (Const (s, _)) = Long_Name.base_name s
blanchet@57200
   316
  | const_or_free_name (Free (s, _)) = s
blanchet@57200
   317
  | const_or_free_name t = raise TERM ("const_or_free_name", [t])
blanchet@49437
   318
blanchet@57200
   319
fun extract_sel_default ctxt t =
blanchet@57200
   320
  let
blanchet@57200
   321
    fun malformed () =
blanchet@57200
   322
      error ("Malformed selector default value equation: " ^ Syntax.string_of_term ctxt t);
blanchet@55469
   323
blanchet@57200
   324
    val ((sel, (ctr, vars)), rhs) =
blanchet@57200
   325
      fst (Term.replace_dummy_patterns (Syntax.check_term ctxt t) 0)
blanchet@57200
   326
      |> HOLogic.dest_eq
blanchet@57200
   327
      |>> (Term.dest_comb
blanchet@57200
   328
        #>> const_or_free_name
blanchet@57200
   329
        ##> (Term.strip_comb #>> (Term.dest_Const #> fst)))
blanchet@57200
   330
      handle TERM _ => malformed ();
blanchet@57200
   331
  in
blanchet@57200
   332
    if forall (is_Free orf is_Var) vars andalso not (has_duplicates (op aconv) vars) then
blanchet@57200
   333
      ((ctr, sel), fold_rev Term.lambda vars rhs)
blanchet@57200
   334
    else
blanchet@57200
   335
      malformed ()
blanchet@57200
   336
  end;
blanchet@55469
   337
blanchet@57830
   338
(* Ideally, we would enrich the context with constants rather than free variables. *)
blanchet@57830
   339
fun fake_local_theory_for_sel_defaults sel_bTs =
blanchet@57830
   340
  Proof_Context.allow_dummies
blanchet@57830
   341
  #> Proof_Context.add_fixes (map (fn (b, T) => (b, SOME T, NoSyn)) sel_bTs)
blanchet@57830
   342
  #> snd;
blanchet@57830
   343
blanchet@57200
   344
type ('c, 'a) ctr_spec = (binding * 'c) * 'a list;
blanchet@57200
   345
blanchet@57200
   346
fun disc_of_ctr_spec ((disc, _), _) = disc;
blanchet@57200
   347
fun ctr_of_ctr_spec ((_, ctr), _) = ctr;
blanchet@57200
   348
fun args_of_ctr_spec (_, args) = args;
blanchet@57200
   349
blanchet@57200
   350
fun prepare_free_constructors prep_term
blanchet@57200
   351
    ((((discs_sels, no_code), raw_case_binding), ctr_specs), sel_default_eqs) no_defs_lthy =
blanchet@49017
   352
  let
blanchet@49019
   353
    (* TODO: sanity checks on arguments *)
blanchet@49025
   354
blanchet@55469
   355
    val raw_ctrs = map ctr_of_ctr_spec ctr_specs;
blanchet@55469
   356
    val raw_disc_bindings = map disc_of_ctr_spec ctr_specs;
blanchet@55469
   357
    val raw_sel_bindingss = map args_of_ctr_spec ctr_specs;
blanchet@55469
   358
blanchet@49280
   359
    val n = length raw_ctrs;
blanchet@49054
   360
    val ks = 1 upto n;
blanchet@49054
   361
blanchet@49121
   362
    val _ = if n > 0 then () else error "No constructors specified";
blanchet@49121
   363
blanchet@49280
   364
    val ctrs0 = map (prep_term no_defs_lthy) raw_ctrs;
blanchet@49280
   365
blanchet@53908
   366
    val Type (fcT_name, As0) = body_type (fastype_of (hd ctrs0));
blanchet@53908
   367
    val fc_b_name = Long_Name.base_name fcT_name;
blanchet@53908
   368
    val fc_b = Binding.name fc_b_name;
blanchet@49055
   369
blanchet@55410
   370
    fun qualify mandatory = Binding.qualify mandatory fc_b_name;
blanchet@49633
   371
blanchet@54386
   372
    fun dest_TFree_or_TVar (TFree sS) = sS
blanchet@53268
   373
      | dest_TFree_or_TVar (TVar ((s, _), S)) = (s, S)
blanchet@53268
   374
      | dest_TFree_or_TVar _ = error "Invalid type argument";
blanchet@52965
   375
blanchet@53268
   376
    val (unsorted_As, B) =
blanchet@49055
   377
      no_defs_lthy
blanchet@53268
   378
      |> variant_tfrees (map (fst o dest_TFree_or_TVar) As0)
blanchet@49055
   379
      ||> the_single o fst o mk_TFrees 1;
blanchet@49055
   380
blanchet@53268
   381
    val As = map2 (resort_tfree o snd o dest_TFree_or_TVar) As0 unsorted_As;
blanchet@53268
   382
blanchet@53908
   383
    val fcT = Type (fcT_name, As);
blanchet@49055
   384
    val ctrs = map (mk_ctr As) ctrs0;
blanchet@49055
   385
    val ctr_Tss = map (binder_types o fastype_of) ctrs;
blanchet@49055
   386
blanchet@49055
   387
    val ms = map length ctr_Tss;
blanchet@49055
   388
blanchet@57091
   389
    fun can_definitely_rely_on_disc k =
blanchet@57091
   390
      not (Binding.is_empty (nth raw_disc_bindings (k - 1))) orelse nth ms (k - 1) = 0;
blanchet@51790
   391
    fun can_rely_on_disc k =
blanchet@51790
   392
      can_definitely_rely_on_disc k orelse (k = 1 andalso not (can_definitely_rely_on_disc 2));
blanchet@53925
   393
    fun should_omit_disc_binding k = n = 1 orelse (n = 2 andalso can_rely_on_disc (3 - k));
blanchet@51790
   394
blanchet@57090
   395
    val equal_binding = @{binding "="};
blanchet@57090
   396
blanchet@51790
   397
    fun is_disc_binding_valid b =
blanchet@51790
   398
      not (Binding.is_empty b orelse Binding.eq_name (b, equal_binding));
blanchet@51787
   399
blanchet@52322
   400
    val standard_disc_binding = Binding.name o prefix isN o base_name_of_ctr;
blanchet@49120
   401
blanchet@49336
   402
    val disc_bindings =
blanchet@55470
   403
      raw_disc_bindings
blanchet@49120
   404
      |> map4 (fn k => fn m => fn ctr => fn disc =>
blanchet@51790
   405
        qualify false
blanchet@51787
   406
          (if Binding.is_empty disc then
blanchet@57091
   407
             if m = 0 then equal_binding
blanchet@57091
   408
             else if should_omit_disc_binding k then disc
blanchet@57090
   409
             else standard_disc_binding ctr
blanchet@51790
   410
           else if Binding.eq_name (disc, standard_binding) then
blanchet@51790
   411
             standard_disc_binding ctr
blanchet@49302
   412
           else
blanchet@51790
   413
             disc)) ks ms ctrs0;
blanchet@49056
   414
blanchet@51787
   415
    fun standard_sel_binding m l = Binding.name o mk_unN m l o base_name_of_ctr;
blanchet@49120
   416
blanchet@49336
   417
    val sel_bindingss =
blanchet@55470
   418
      map3 (fn ctr => fn m => map2 (fn l => fn sel =>
blanchet@49633
   419
        qualify false
blanchet@51790
   420
          (if Binding.is_empty sel orelse Binding.eq_name (sel, standard_binding) then
blanchet@51787
   421
            standard_sel_binding m l ctr
blanchet@49302
   422
          else
blanchet@55470
   423
            sel)) (1 upto m) o pad_list Binding.empty m) ctrs0 ms raw_sel_bindingss;
blanchet@49020
   424
blanchet@49201
   425
    val case_Ts = map (fn Ts => Ts ---> B) ctr_Tss;
blanchet@49043
   426
blanchet@55409
   427
    val (((((((([exh_y], (xss, xss')), yss), fs), gs), [u', v']), [w]), (p, p')), names_lthy) =
blanchet@55409
   428
      no_defs_lthy
blanchet@55409
   429
      |> mk_Frees "y" [fcT] (* for compatibility with "datatype_realizer.ML" *)
blanchet@55409
   430
      ||>> mk_Freess' "x" ctr_Tss
blanchet@49025
   431
      ||>> mk_Freess "y" ctr_Tss
blanchet@49201
   432
      ||>> mk_Frees "f" case_Ts
blanchet@49201
   433
      ||>> mk_Frees "g" case_Ts
blanchet@53908
   434
      ||>> (apfst (map (rpair fcT)) oo Variable.variant_fixes) [fc_b_name, fc_b_name ^ "'"]
blanchet@52968
   435
      ||>> mk_Frees "z" [B]
blanchet@49043
   436
      ||>> yield_singleton (apfst (op ~~) oo mk_Frees' "P") HOLogic.boolT;
blanchet@49043
   437
blanchet@49498
   438
    val u = Free u';
blanchet@49498
   439
    val v = Free v';
blanchet@49463
   440
    val q = Free (fst p', mk_pred1T B);
blanchet@49020
   441
blanchet@49025
   442
    val xctrs = map2 (curry Term.list_comb) ctrs xss;
blanchet@49025
   443
    val yctrs = map2 (curry Term.list_comb) ctrs yss;
blanchet@49032
   444
blanchet@49043
   445
    val xfs = map2 (curry Term.list_comb) fs xss;
blanchet@49043
   446
    val xgs = map2 (curry Term.list_comb) gs xss;
blanchet@49043
   447
blanchet@52968
   448
    (* TODO: Eta-expension is for compatibility with the old datatype package (but it also provides
blanchet@52968
   449
       nicer names). Consider removing. *)
blanchet@57200
   450
    val eta_fs = map2 (fold_rev Term.lambda) xss xfs;
blanchet@57200
   451
    val eta_gs = map2 (fold_rev Term.lambda) xss xgs;
blanchet@52968
   452
blanchet@52968
   453
    val case_binding =
blanchet@52968
   454
      qualify false
blanchet@52968
   455
        (if Binding.is_empty raw_case_binding orelse
blanchet@52968
   456
            Binding.eq_name (raw_case_binding, standard_binding) then
blanchet@54493
   457
           Binding.prefix_name (caseN ^ "_") fc_b
blanchet@52968
   458
         else
blanchet@52968
   459
           raw_case_binding);
blanchet@52968
   460
blanchet@52968
   461
    fun mk_case_disj xctr xf xs =
blanchet@52968
   462
      list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (u, xctr), HOLogic.mk_eq (w, xf)));
blanchet@52968
   463
blanchet@53925
   464
    val case_rhs = fold_rev (fold_rev Term.lambda) [fs, [u]]
blanchet@53925
   465
      (Const (@{const_name The}, (B --> HOLogic.boolT) --> B) $
blanchet@53925
   466
         Term.lambda w (Library.foldr1 HOLogic.mk_disj (map3 mk_case_disj xctrs xfs xss)));
blanchet@52968
   467
blanchet@52968
   468
    val ((raw_case, (_, raw_case_def)), (lthy', lthy)) = no_defs_lthy
blanchet@54155
   469
      |> Local_Theory.define ((case_binding, NoSyn),
blanchet@54155
   470
        ((Binding.conceal (Thm.def_binding case_binding), []), case_rhs))
blanchet@52968
   471
      ||> `Local_Theory.restore;
blanchet@52968
   472
blanchet@52968
   473
    val phi = Proof_Context.export_morphism lthy lthy';
blanchet@52968
   474
blanchet@52968
   475
    val case_def = Morphism.thm phi raw_case_def;
blanchet@52968
   476
blanchet@52968
   477
    val case0 = Morphism.term phi raw_case;
blanchet@52968
   478
    val casex = mk_case As B case0;
blanchet@52968
   479
blanchet@51759
   480
    val fcase = Term.list_comb (casex, fs);
blanchet@51759
   481
blanchet@51759
   482
    val ufcase = fcase $ u;
blanchet@51759
   483
    val vfcase = fcase $ v;
blanchet@51759
   484
blanchet@51759
   485
    val eta_fcase = Term.list_comb (casex, eta_fs);
blanchet@51759
   486
    val eta_gcase = Term.list_comb (casex, eta_gs);
blanchet@49020
   487
blanchet@51759
   488
    val eta_ufcase = eta_fcase $ u;
blanchet@51759
   489
    val eta_vgcase = eta_gcase $ v;
blanchet@49486
   490
blanchet@49591
   491
    fun mk_uu_eq () = HOLogic.mk_eq (u, u);
blanchet@49486
   492
blanchet@49591
   493
    val uv_eq = mk_Trueprop_eq (u, v);
blanchet@49486
   494
blanchet@49486
   495
    val exist_xs_u_eq_ctrs =
blanchet@49486
   496
      map2 (fn xctr => fn xs => list_exists_free xs (HOLogic.mk_eq (u, xctr))) xctrs xss;
blanchet@49022
   497
blanchet@51743
   498
    val unique_disc_no_def = TrueI; (*arbitrary marker*)
blanchet@51743
   499
    val alternate_disc_no_def = FalseE; (*arbitrary marker*)
blanchet@51743
   500
blanchet@49486
   501
    fun alternate_disc_lhs get_udisc k =
blanchet@49116
   502
      HOLogic.mk_not
blanchet@51790
   503
        (let val b = nth disc_bindings (k - 1) in
blanchet@51790
   504
           if is_disc_binding_valid b then get_udisc b (k - 1) else nth exist_xs_u_eq_ctrs (k - 1)
blanchet@51790
   505
         end);
blanchet@49116
   506
blanchet@57094
   507
    val no_discs_sels =
blanchet@57094
   508
      not discs_sels andalso
blanchet@57094
   509
      forall (forall Binding.is_empty) (raw_disc_bindings :: raw_sel_bindingss) andalso
blanchet@57200
   510
      null sel_default_eqs;
blanchet@57094
   511
blanchet@53917
   512
    val (all_sels_distinct, discs, selss, disc_defs, sel_defs, sel_defss, lthy') =
blanchet@52969
   513
      if no_discs_sels then
blanchet@55407
   514
        (true, [], [], [], [], [], lthy')
blanchet@49278
   515
      else
blanchet@49278
   516
        let
blanchet@57830
   517
          val all_sel_bindings = flat sel_bindingss;
blanchet@57830
   518
          val num_all_sel_bindings = length all_sel_bindings;
blanchet@57830
   519
          val uniq_sel_bindings = distinct Binding.eq_name all_sel_bindings;
blanchet@57830
   520
          val all_sels_distinct = (length uniq_sel_bindings = num_all_sel_bindings);
blanchet@57200
   521
blanchet@57200
   522
          val sel_binding_index =
blanchet@57830
   523
            if all_sels_distinct then
blanchet@57830
   524
              1 upto num_all_sel_bindings
blanchet@57830
   525
            else
blanchet@57830
   526
              map (fn b => find_index (curry Binding.eq_name b) uniq_sel_bindings) all_sel_bindings;
blanchet@57200
   527
blanchet@57830
   528
          val all_proto_sels = flat (map3 (fn k => fn xs => map (pair k o pair xs)) ks xss xss);
blanchet@57200
   529
          val sel_infos =
blanchet@57200
   530
            AList.group (op =) (sel_binding_index ~~ all_proto_sels)
blanchet@57200
   531
            |> sort (int_ord o pairself fst)
blanchet@57200
   532
            |> map snd |> curry (op ~~) uniq_sel_bindings;
blanchet@57200
   533
          val sel_bindings = map fst sel_infos;
blanchet@57200
   534
blanchet@57200
   535
          val sel_defaults =
blanchet@57830
   536
            if null sel_default_eqs then
blanchet@57830
   537
              []
blanchet@57830
   538
            else
blanchet@57830
   539
              let
blanchet@57830
   540
                val sel_Ts = map (curry (op -->) fcT o fastype_of o snd o snd o hd o snd) sel_infos;
blanchet@57830
   541
                val fake_lthy =
blanchet@57830
   542
                  fake_local_theory_for_sel_defaults (sel_bindings ~~ sel_Ts) no_defs_lthy;
blanchet@57830
   543
              in
blanchet@57830
   544
                map (extract_sel_default fake_lthy o prep_term fake_lthy) sel_default_eqs
blanchet@57830
   545
              end;
blanchet@57200
   546
blanchet@53908
   547
          fun disc_free b = Free (Binding.name_of b, mk_pred1T fcT);
blanchet@49025
   548
blanchet@54634
   549
          fun disc_spec b exist_xs_u_eq_ctr = mk_Trueprop_eq (disc_free b $ u, exist_xs_u_eq_ctr);
blanchet@54634
   550
blanchet@49500
   551
          fun alternate_disc k =
blanchet@49500
   552
            Term.lambda u (alternate_disc_lhs (K o rapp u o disc_free) (3 - k));
blanchet@49278
   553
blanchet@49280
   554
          fun mk_sel_case_args b proto_sels T =
blanchet@57200
   555
            map3 (fn Const (c, _) => fn Ts => fn k =>
blanchet@49280
   556
              (case AList.lookup (op =) proto_sels k of
blanchet@49280
   557
                NONE =>
blanchet@57200
   558
                (case filter (curry (op =) (c, Binding.name_of b) o fst) sel_defaults of
blanchet@57200
   559
                  [] => fold_rev (Term.lambda o curry Free Name.uu) Ts (mk_undefined T)
blanchet@57200
   560
                | [(_, t)] => t
blanchet@57200
   561
                | _ => error "Multiple default values for selector/constructor pair")
blanchet@57200
   562
              | SOME (xs, x) => fold_rev Term.lambda xs x)) ctrs ctr_Tss ks;
blanchet@49258
   563
blanchet@54634
   564
          fun sel_spec b proto_sels =
blanchet@49278
   565
            let
blanchet@49278
   566
              val _ =
blanchet@49278
   567
                (case duplicates (op =) (map fst proto_sels) of
blanchet@49278
   568
                   k :: _ => error ("Duplicate selector name " ^ quote (Binding.name_of b) ^
blanchet@57200
   569
                     " for constructor " ^ quote (Syntax.string_of_term lthy (nth ctrs (k - 1))))
blanchet@49278
   570
                 | [] => ())
blanchet@49278
   571
              val T =
blanchet@49278
   572
                (case distinct (op =) (map (fastype_of o snd o snd) proto_sels) of
blanchet@49278
   573
                  [T] => T
blanchet@49278
   574
                | T :: T' :: _ => error ("Inconsistent range type for selector " ^
blanchet@57200
   575
                    quote (Binding.name_of b) ^ ": " ^ quote (Syntax.string_of_typ lthy T) ^
blanchet@57200
   576
                    " vs. " ^ quote (Syntax.string_of_typ lthy T')));
blanchet@49278
   577
            in
blanchet@54634
   578
              mk_Trueprop_eq (Free (Binding.name_of b, fcT --> T) $ u,
blanchet@54634
   579
                Term.list_comb (mk_case As T case0, mk_sel_case_args b proto_sels T) $ u)
blanchet@49278
   580
            end;
blanchet@49116
   581
blanchet@49336
   582
          fun unflat_selss xs = unflat_lookup Binding.eq_name sel_bindings xs sel_bindingss;
blanchet@49258
   583
blanchet@49278
   584
          val (((raw_discs, raw_disc_defs), (raw_sels, raw_sel_defs)), (lthy', lthy)) =
blanchet@52968
   585
            lthy
blanchet@51809
   586
            |> apfst split_list o fold_map3 (fn k => fn exist_xs_u_eq_ctr => fn b =>
blanchet@54634
   587
                if Binding.is_empty b then
blanchet@54634
   588
                  if n = 1 then pair (Term.lambda u (mk_uu_eq ()), unique_disc_no_def)
blanchet@54634
   589
                  else pair (alternate_disc k, alternate_disc_no_def)
blanchet@54634
   590
                else if Binding.eq_name (b, equal_binding) then
blanchet@54634
   591
                  pair (Term.lambda u exist_xs_u_eq_ctr, refl)
blanchet@54634
   592
                else
blanchet@54634
   593
                  Specification.definition (SOME (b, NONE, NoSyn),
blanchet@54634
   594
                    ((Thm.def_binding b, []), disc_spec b exist_xs_u_eq_ctr)) #>> apsnd snd)
blanchet@54634
   595
              ks exist_xs_u_eq_ctrs disc_bindings
blanchet@49278
   596
            ||>> apfst split_list o fold_map (fn (b, proto_sels) =>
blanchet@54634
   597
              Specification.definition (SOME (b, NONE, NoSyn),
blanchet@54634
   598
                ((Thm.def_binding b, []), sel_spec b proto_sels)) #>> apsnd snd) sel_infos
blanchet@49278
   599
            ||> `Local_Theory.restore;
blanchet@49022
   600
blanchet@49278
   601
          val phi = Proof_Context.export_morphism lthy lthy';
blanchet@49025
   602
blanchet@49278
   603
          val disc_defs = map (Morphism.thm phi) raw_disc_defs;
blanchet@49281
   604
          val sel_defs = map (Morphism.thm phi) raw_sel_defs;
blanchet@49281
   605
          val sel_defss = unflat_selss sel_defs;
blanchet@49278
   606
blanchet@49278
   607
          val discs0 = map (Morphism.term phi) raw_discs;
blanchet@49278
   608
          val selss0 = unflat_selss (map (Morphism.term phi) raw_sels);
blanchet@49028
   609
blanchet@49278
   610
          val discs = map (mk_disc_or_sel As) discs0;
blanchet@49278
   611
          val selss = map (map (mk_disc_or_sel As)) selss0;
blanchet@49278
   612
        in
blanchet@53917
   613
          (all_sels_distinct, discs, selss, disc_defs, sel_defs, sel_defss, lthy')
blanchet@49278
   614
        end;
blanchet@49025
   615
blanchet@49032
   616
    fun mk_imp_p Qs = Logic.list_implies (Qs, HOLogic.mk_Trueprop p);
blanchet@49029
   617
blanchet@49458
   618
    val exhaust_goal =
blanchet@55409
   619
      let fun mk_prem xctr xs = fold_rev Logic.all xs (mk_imp_p [mk_Trueprop_eq (exh_y, xctr)]) in
blanchet@55409
   620
        fold_rev Logic.all [p, exh_y] (mk_imp_p (map2 mk_prem xctrs xss))
blanchet@49020
   621
      end;
blanchet@49019
   622
blanchet@49484
   623
    val inject_goalss =
blanchet@49017
   624
      let
blanchet@49034
   625
        fun mk_goal _ _ [] [] = []
blanchet@49025
   626
          | mk_goal xctr yctr xs ys =
blanchet@49121
   627
            [fold_rev Logic.all (xs @ ys) (mk_Trueprop_eq (HOLogic.mk_eq (xctr, yctr),
blanchet@49121
   628
              Library.foldr1 HOLogic.mk_conj (map2 (curry HOLogic.mk_eq) xs ys)))];
blanchet@49017
   629
      in
blanchet@49034
   630
        map4 mk_goal xctrs yctrs xss yss
blanchet@49017
   631
      end;
blanchet@49017
   632
blanchet@49484
   633
    val half_distinct_goalss =
blanchet@49121
   634
      let
blanchet@49203
   635
        fun mk_goal ((xs, xc), (xs', xc')) =
blanchet@49121
   636
          fold_rev Logic.all (xs @ xs')
blanchet@49203
   637
            (HOLogic.mk_Trueprop (HOLogic.mk_not (HOLogic.mk_eq (xc, xc'))));
blanchet@49121
   638
      in
blanchet@49585
   639
        map (map mk_goal) (mk_half_pairss (`I (xss ~~ xctrs)))
blanchet@49121
   640
      end;
blanchet@49019
   641
blanchet@52968
   642
    val goalss = [exhaust_goal] :: inject_goalss @ half_distinct_goalss;
blanchet@49019
   643
blanchet@57633
   644
    fun after_qed ([exhaust_thm] :: thmss) lthy =
blanchet@49019
   645
      let
blanchet@57633
   646
        val ((inject_thms, inject_thmss), half_distinct_thmss) = chop n thmss |>> `flat;
blanchet@49438
   647
blanchet@53210
   648
        val rho_As = map (pairself (certifyT lthy)) (map Logic.varifyT_global As ~~ As);
blanchet@49486
   649
blanchet@49486
   650
        fun inst_thm t thm =
blanchet@49486
   651
          Drule.instantiate' [] [SOME (certify lthy t)]
blanchet@53210
   652
            (Thm.instantiate (rho_As, []) (Drule.zero_var_indexes thm));
blanchet@49486
   653
blanchet@49486
   654
        val uexhaust_thm = inst_thm u exhaust_thm;
blanchet@49032
   655
blanchet@49300
   656
        val exhaust_cases = map base_name_of_ctr ctrs;
blanchet@49300
   657
blanchet@49048
   658
        val other_half_distinct_thmss = map (map (fn thm => thm RS not_sym)) half_distinct_thmss;
blanchet@49048
   659
blanchet@49486
   660
        val (distinct_thms, (distinct_thmsss', distinct_thmsss)) =
blanchet@49585
   661
          join_halves n half_distinct_thmss other_half_distinct_thmss ||> `transpose;
blanchet@49019
   662
blanchet@49020
   663
        val nchotomy_thm =
blanchet@49020
   664
          let
blanchet@49020
   665
            val goal =
blanchet@49486
   666
              HOLogic.mk_Trueprop (HOLogic.mk_all (fst u', snd u',
blanchet@49486
   667
                Library.foldr1 HOLogic.mk_disj exist_xs_u_eq_ctrs));
blanchet@49020
   668
          in
wenzelm@51551
   669
            Goal.prove_sorry lthy [] [] goal (fn _ => mk_nchotomy_tac n exhaust_thm)
traytel@49667
   670
            |> Thm.close_derivation
blanchet@49020
   671
          end;
blanchet@49020
   672
blanchet@52968
   673
        val case_thms =
blanchet@52968
   674
          let
blanchet@52968
   675
            val goals =
blanchet@52968
   676
              map3 (fn xctr => fn xf => fn xs =>
blanchet@52968
   677
                fold_rev Logic.all (fs @ xs) (mk_Trueprop_eq (fcase $ xctr, xf))) xctrs xfs xss;
blanchet@52968
   678
          in
blanchet@52968
   679
            map4 (fn k => fn goal => fn injects => fn distinctss =>
blanchet@52968
   680
                Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@52968
   681
                  mk_case_tac ctxt n k case_def injects distinctss)
blanchet@52968
   682
                |> Thm.close_derivation)
blanchet@52968
   683
              ks goals inject_thmss distinct_thmsss
blanchet@52968
   684
          end;
blanchet@52968
   685
blanchet@53917
   686
        val (case_cong_thm, weak_case_cong_thm) =
blanchet@53917
   687
          let
blanchet@53917
   688
            fun mk_prem xctr xs xf xg =
blanchet@53917
   689
              fold_rev Logic.all xs (Logic.mk_implies (mk_Trueprop_eq (v, xctr),
blanchet@53917
   690
                mk_Trueprop_eq (xf, xg)));
blanchet@53917
   691
blanchet@53917
   692
            val goal =
blanchet@53917
   693
              Logic.list_implies (uv_eq :: map4 mk_prem xctrs xss xfs xgs,
blanchet@53917
   694
                 mk_Trueprop_eq (eta_ufcase, eta_vgcase));
blanchet@53917
   695
            val weak_goal = Logic.mk_implies (uv_eq, mk_Trueprop_eq (ufcase, vfcase));
blanchet@53917
   696
          in
blanchet@53917
   697
            (Goal.prove_sorry lthy [] [] goal (fn _ => mk_case_cong_tac lthy uexhaust_thm case_thms),
blanchet@53917
   698
             Goal.prove_sorry lthy [] [] weak_goal (K (etac arg_cong 1)))
blanchet@55409
   699
            |> pairself (singleton (Proof_Context.export names_lthy lthy) #>
blanchet@55409
   700
              Thm.close_derivation)
blanchet@53917
   701
          end;
blanchet@53917
   702
blanchet@53917
   703
        val split_lhs = q $ ufcase;
blanchet@53917
   704
blanchet@53917
   705
        fun mk_split_conjunct xctr xs f_xs =
blanchet@53917
   706
          list_all_free xs (HOLogic.mk_imp (HOLogic.mk_eq (u, xctr), q $ f_xs));
blanchet@53917
   707
        fun mk_split_disjunct xctr xs f_xs =
blanchet@53917
   708
          list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (u, xctr),
blanchet@53917
   709
            HOLogic.mk_not (q $ f_xs)));
blanchet@53917
   710
blanchet@53917
   711
        fun mk_split_goal xctrs xss xfs =
blanchet@53917
   712
          mk_Trueprop_eq (split_lhs, Library.foldr1 HOLogic.mk_conj
blanchet@53917
   713
            (map3 mk_split_conjunct xctrs xss xfs));
blanchet@53917
   714
        fun mk_split_asm_goal xctrs xss xfs =
blanchet@53917
   715
          mk_Trueprop_eq (split_lhs, HOLogic.mk_not (Library.foldr1 HOLogic.mk_disj
blanchet@53917
   716
            (map3 mk_split_disjunct xctrs xss xfs)));
blanchet@53917
   717
blanchet@53917
   718
        fun prove_split selss goal =
blanchet@53917
   719
          Goal.prove_sorry lthy [] [] goal (fn _ =>
blanchet@53917
   720
            mk_split_tac lthy uexhaust_thm case_thms selss inject_thmss distinct_thmsss)
blanchet@55409
   721
          |> singleton (Proof_Context.export names_lthy lthy)
blanchet@55409
   722
          |> Thm.close_derivation;
blanchet@53917
   723
blanchet@53917
   724
        fun prove_split_asm asm_goal split_thm =
blanchet@53917
   725
          Goal.prove_sorry lthy [] [] asm_goal (fn {context = ctxt, ...} =>
blanchet@53917
   726
            mk_split_asm_tac ctxt split_thm)
blanchet@55409
   727
          |> singleton (Proof_Context.export names_lthy lthy)
blanchet@55409
   728
          |> Thm.close_derivation;
blanchet@53917
   729
blanchet@53917
   730
        val (split_thm, split_asm_thm) =
blanchet@53917
   731
          let
blanchet@53917
   732
            val goal = mk_split_goal xctrs xss xfs;
blanchet@53917
   733
            val asm_goal = mk_split_asm_goal xctrs xss xfs;
blanchet@53917
   734
blanchet@53917
   735
            val thm = prove_split (replicate n []) goal;
blanchet@53917
   736
            val asm_thm = prove_split_asm asm_goal thm;
blanchet@53917
   737
          in
blanchet@53917
   738
            (thm, asm_thm)
blanchet@53917
   739
          end;
blanchet@53917
   740
blanchet@56858
   741
        val (sel_defs, all_sel_thms, sel_thmss, disc_defs, disc_thmss, nontriv_disc_thmss,
blanchet@56858
   742
             discI_thms, nontriv_discI_thms, disc_exclude_thms, disc_exclude_thmsss,
blanchet@56858
   743
             disc_exhaust_thms, sel_exhaust_thms, all_collapse_thms, safe_collapse_thms,
blanchet@56858
   744
             expand_thms, sel_split_thms, sel_split_asm_thms, case_eq_if_thms) =
blanchet@52969
   745
          if no_discs_sels then
blanchet@56858
   746
            ([], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [])
blanchet@49116
   747
          else
blanchet@49116
   748
            let
blanchet@53917
   749
              val udiscs = map (rapp u) discs;
blanchet@53917
   750
              val uselss = map (map (rapp u)) selss;
blanchet@53917
   751
              val usel_ctrs = map2 (curry Term.list_comb) ctrs uselss;
blanchet@53917
   752
              val usel_fs = map2 (curry Term.list_comb) fs uselss;
blanchet@53917
   753
blanchet@53917
   754
              val vdiscs = map (rapp v) discs;
blanchet@53917
   755
              val vselss = map (map (rapp v)) selss;
blanchet@53917
   756
blanchet@49364
   757
              fun make_sel_thm xs' case_thm sel_def =
blanchet@49364
   758
                zero_var_indexes (Drule.gen_all (Drule.rename_bvars' (map (SOME o fst) xs')
blanchet@54634
   759
                    (Drule.forall_intr_vars (case_thm RS (sel_def RS trans)))));
blanchet@49281
   760
blanchet@53704
   761
              val sel_thmss = map3 (map oo make_sel_thm) xss' case_thms sel_defss;
blanchet@53704
   762
blanchet@49281
   763
              fun has_undefined_rhs thm =
blanchet@49281
   764
                (case snd (HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of thm))) of
blanchet@49281
   765
                  Const (@{const_name undefined}, _) => true
blanchet@49281
   766
                | _ => false);
blanchet@49281
   767
blanchet@49281
   768
              val all_sel_thms =
blanchet@57200
   769
                (if all_sels_distinct andalso null sel_default_eqs then
blanchet@49285
   770
                   flat sel_thmss
blanchet@49285
   771
                 else
blanchet@49364
   772
                   map_product (fn s => fn (xs', c) => make_sel_thm xs' c s) sel_defs
blanchet@49364
   773
                     (xss' ~~ case_thms))
blanchet@49285
   774
                |> filter_out has_undefined_rhs;
blanchet@49278
   775
blanchet@49278
   776
              fun mk_unique_disc_def () =
blanchet@49278
   777
                let
blanchet@49278
   778
                  val m = the_single ms;
blanchet@49591
   779
                  val goal = mk_Trueprop_eq (mk_uu_eq (), the_single exist_xs_u_eq_ctrs);
blanchet@49278
   780
                in
wenzelm@51551
   781
                  Goal.prove_sorry lthy [] [] goal (fn _ => mk_unique_disc_def_tac m uexhaust_thm)
blanchet@55409
   782
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49692
   783
                  |> Thm.close_derivation
blanchet@49278
   784
                end;
blanchet@49278
   785
blanchet@49278
   786
              fun mk_alternate_disc_def k =
blanchet@49278
   787
                let
blanchet@49278
   788
                  val goal =
blanchet@49486
   789
                    mk_Trueprop_eq (alternate_disc_lhs (K (nth udiscs)) (3 - k),
blanchet@49486
   790
                      nth exist_xs_u_eq_ctrs (k - 1));
blanchet@49278
   791
                in
wenzelm@51551
   792
                  Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@54634
   793
                    mk_alternate_disc_def_tac ctxt k (nth disc_defs (2 - k))
blanchet@49486
   794
                      (nth distinct_thms (2 - k)) uexhaust_thm)
blanchet@55409
   795
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@49692
   796
                  |> Thm.close_derivation
blanchet@49278
   797
                end;
blanchet@49028
   798
blanchet@49278
   799
              val has_alternate_disc_def =
blanchet@49278
   800
                exists (fn def => Thm.eq_thm_prop (def, alternate_disc_no_def)) disc_defs;
blanchet@49278
   801
blanchet@49278
   802
              val disc_defs' =
blanchet@49278
   803
                map2 (fn k => fn def =>
blanchet@49278
   804
                  if Thm.eq_thm_prop (def, unique_disc_no_def) then mk_unique_disc_def ()
blanchet@49278
   805
                  else if Thm.eq_thm_prop (def, alternate_disc_no_def) then mk_alternate_disc_def k
blanchet@54634
   806
                  else def) ks disc_defs;
blanchet@49278
   807
blanchet@49278
   808
              val discD_thms = map (fn def => def RS iffD1) disc_defs';
blanchet@49278
   809
              val discI_thms =
blanchet@49278
   810
                map2 (fn m => fn def => funpow m (fn thm => exI RS thm) (def RS iffD2)) ms
blanchet@49278
   811
                  disc_defs';
blanchet@49278
   812
              val not_discI_thms =
blanchet@49278
   813
                map2 (fn m => fn def => funpow m (fn thm => allI RS thm)
blanchet@49504
   814
                    (unfold_thms lthy @{thms not_ex} (def RS @{thm ssubst[of _ _ Not]})))
blanchet@49278
   815
                  ms disc_defs';
blanchet@49278
   816
blanchet@49278
   817
              val (disc_thmss', disc_thmss) =
blanchet@49278
   818
                let
blanchet@49278
   819
                  fun mk_thm discI _ [] = refl RS discI
blanchet@49278
   820
                    | mk_thm _ not_discI [distinct] = distinct RS not_discI;
blanchet@49278
   821
                  fun mk_thms discI not_discI distinctss = map (mk_thm discI not_discI) distinctss;
blanchet@49278
   822
                in
blanchet@49278
   823
                  map3 mk_thms discI_thms not_discI_thms distinct_thmsss' |> `transpose
blanchet@49278
   824
                end;
blanchet@49278
   825
blanchet@55464
   826
              val nontriv_disc_thmss =
blanchet@55464
   827
                map2 (fn b => if is_disc_binding_valid b then I else K []) disc_bindings disc_thmss;
blanchet@53704
   828
blanchet@53704
   829
              fun is_discI_boring b =
blanchet@53704
   830
                (n = 1 andalso Binding.is_empty b) orelse Binding.eq_name (b, equal_binding);
blanchet@53704
   831
blanchet@53704
   832
              val nontriv_discI_thms =
blanchet@53704
   833
                flat (map2 (fn b => if is_discI_boring b then K [] else single) disc_bindings
blanchet@53704
   834
                  discI_thms);
blanchet@49028
   835
blanchet@49486
   836
              val (disc_exclude_thms, (disc_exclude_thmsss', disc_exclude_thmsss)) =
blanchet@49486
   837
                let
blanchet@49486
   838
                  fun mk_goal [] = []
blanchet@49486
   839
                    | mk_goal [((_, udisc), (_, udisc'))] =
blanchet@49486
   840
                      [Logic.all u (Logic.mk_implies (HOLogic.mk_Trueprop udisc,
blanchet@49486
   841
                         HOLogic.mk_Trueprop (HOLogic.mk_not udisc')))];
blanchet@49486
   842
traytel@49667
   843
                  fun prove tac goal =
wenzelm@51551
   844
                    Goal.prove_sorry lthy [] [] goal (K tac)
traytel@49667
   845
                    |> Thm.close_derivation;
blanchet@49486
   846
blanchet@49585
   847
                  val half_pairss = mk_half_pairss (`I (ms ~~ discD_thms ~~ udiscs));
blanchet@49486
   848
blanchet@49486
   849
                  val half_goalss = map mk_goal half_pairss;
blanchet@49486
   850
                  val half_thmss =
blanchet@49486
   851
                    map3 (fn [] => K (K []) | [goal] => fn [(((m, discD), _), _)] =>
wenzelm@51798
   852
                        fn disc_thm => [prove (mk_half_disc_exclude_tac lthy m discD disc_thm) goal])
blanchet@49486
   853
                      half_goalss half_pairss (flat disc_thmss');
blanchet@49278
   854
blanchet@49486
   855
                  val other_half_goalss = map (mk_goal o map swap) half_pairss;
blanchet@49486
   856
                  val other_half_thmss =
blanchet@49486
   857
                    map2 (map2 (prove o mk_other_half_disc_exclude_tac)) half_thmss
blanchet@49486
   858
                      other_half_goalss;
blanchet@49486
   859
                in
blanchet@49585
   860
                  join_halves n half_thmss other_half_thmss ||> `transpose
blanchet@49486
   861
                  |>> has_alternate_disc_def ? K []
blanchet@49486
   862
                end;
blanchet@49278
   863
blanchet@49486
   864
              val disc_exhaust_thm =
blanchet@49486
   865
                let
blanchet@49486
   866
                  fun mk_prem udisc = mk_imp_p [HOLogic.mk_Trueprop udisc];
blanchet@49486
   867
                  val goal = fold_rev Logic.all [p, u] (mk_imp_p (map mk_prem udiscs));
blanchet@49486
   868
                in
wenzelm@51551
   869
                  Goal.prove_sorry lthy [] [] goal (fn _ =>
blanchet@49486
   870
                    mk_disc_exhaust_tac n exhaust_thm discI_thms)
traytel@49667
   871
                  |> Thm.close_derivation
blanchet@49486
   872
                end;
blanchet@49028
   873
blanchet@53740
   874
              val (safe_collapse_thms, all_collapse_thms) =
blanchet@49486
   875
                let
blanchet@54008
   876
                  fun mk_goal m udisc usel_ctr =
blanchet@49486
   877
                    let
blanchet@49486
   878
                      val prem = HOLogic.mk_Trueprop udisc;
blanchet@53916
   879
                      val concl = mk_Trueprop_eq ((usel_ctr, u) |> m = 0 ? swap);
blanchet@49486
   880
                    in
blanchet@53740
   881
                      (prem aconv concl, Logic.all u (Logic.mk_implies (prem, concl)))
blanchet@49486
   882
                    end;
blanchet@54008
   883
                  val (trivs, goals) = map3 mk_goal ms udiscs usel_ctrs |> split_list;
blanchet@53740
   884
                  val thms =
blanchet@53740
   885
                    map5 (fn m => fn discD => fn sel_thms => fn triv => fn goal =>
blanchet@53740
   886
                        Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@53740
   887
                          mk_collapse_tac ctxt m discD sel_thms ORELSE HEADGOAL atac)
blanchet@53740
   888
                        |> Thm.close_derivation
blanchet@53740
   889
                        |> not triv ? perhaps (try (fn thm => refl RS thm)))
blanchet@53740
   890
                      ms discD_thms sel_thmss trivs goals;
blanchet@49486
   891
                in
blanchet@53740
   892
                  (map_filter (fn (true, _) => NONE | (false, thm) => SOME thm) (trivs ~~ thms),
blanchet@53740
   893
                   thms)
blanchet@49486
   894
                end;
blanchet@49025
   895
blanchet@53916
   896
              val swapped_all_collapse_thms =
blanchet@53916
   897
                map2 (fn m => fn thm => if m = 0 then thm else thm RS sym) ms all_collapse_thms;
blanchet@53916
   898
blanchet@53916
   899
              val sel_exhaust_thm =
blanchet@53916
   900
                let
blanchet@53916
   901
                  fun mk_prem usel_ctr = mk_imp_p [mk_Trueprop_eq (u, usel_ctr)];
blanchet@53916
   902
                  val goal = fold_rev Logic.all [p, u] (mk_imp_p (map mk_prem usel_ctrs));
blanchet@53916
   903
                in
blanchet@53916
   904
                  Goal.prove_sorry lthy [] [] goal (fn _ =>
blanchet@53916
   905
                    mk_sel_exhaust_tac n disc_exhaust_thm swapped_all_collapse_thms)
blanchet@53916
   906
                  |> Thm.close_derivation
blanchet@53916
   907
                end;
blanchet@53916
   908
blanchet@53919
   909
              val expand_thm =
blanchet@49486
   910
                let
blanchet@49486
   911
                  fun mk_prems k udisc usels vdisc vsels =
blanchet@49486
   912
                    (if k = n then [] else [mk_Trueprop_eq (udisc, vdisc)]) @
blanchet@49486
   913
                    (if null usels then
blanchet@49486
   914
                       []
blanchet@49486
   915
                     else
blanchet@49486
   916
                       [Logic.list_implies
blanchet@49486
   917
                          (if n = 1 then [] else map HOLogic.mk_Trueprop [udisc, vdisc],
blanchet@49486
   918
                             HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj
blanchet@49486
   919
                               (map2 (curry HOLogic.mk_eq) usels vsels)))]);
blanchet@49486
   920
blanchet@49591
   921
                  val goal =
blanchet@49591
   922
                    Library.foldr Logic.list_implies
blanchet@49591
   923
                      (map5 mk_prems ks udiscs uselss vdiscs vselss, uv_eq);
blanchet@49486
   924
                  val uncollapse_thms =
blanchet@53740
   925
                    map2 (fn thm => fn [] => thm | _ => thm RS sym) all_collapse_thms uselss;
blanchet@49486
   926
                in
blanchet@53919
   927
                  Goal.prove_sorry lthy [] [] goal (fn _ =>
blanchet@53919
   928
                    mk_expand_tac lthy n ms (inst_thm u disc_exhaust_thm)
blanchet@53919
   929
                      (inst_thm v disc_exhaust_thm) uncollapse_thms disc_exclude_thmsss
blanchet@53919
   930
                      disc_exclude_thmsss')
blanchet@55409
   931
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@53919
   932
                  |> Thm.close_derivation
blanchet@49486
   933
                end;
blanchet@49278
   934
blanchet@53917
   935
              val (sel_split_thm, sel_split_asm_thm) =
blanchet@53917
   936
                let
blanchet@53917
   937
                  val zss = map (K []) xss;
blanchet@53917
   938
                  val goal = mk_split_goal usel_ctrs zss usel_fs;
blanchet@53917
   939
                  val asm_goal = mk_split_asm_goal usel_ctrs zss usel_fs;
blanchet@53917
   940
blanchet@53917
   941
                  val thm = prove_split sel_thmss goal;
blanchet@53917
   942
                  val asm_thm = prove_split_asm asm_goal thm;
blanchet@53917
   943
                in
blanchet@53917
   944
                  (thm, asm_thm)
blanchet@53917
   945
                end;
blanchet@53917
   946
blanchet@54491
   947
              val case_eq_if_thm =
blanchet@49486
   948
                let
blanchet@53917
   949
                  val goal = mk_Trueprop_eq (ufcase, mk_IfN B udiscs usel_fs);
blanchet@49486
   950
                in
blanchet@53919
   951
                  Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} =>
blanchet@54491
   952
                    mk_case_eq_if_tac ctxt n uexhaust_thm case_thms disc_thmss' sel_thmss)
blanchet@55409
   953
                  |> singleton (Proof_Context.export names_lthy lthy)
blanchet@53919
   954
                  |> Thm.close_derivation
blanchet@49486
   955
                end;
blanchet@49116
   956
            in
blanchet@56858
   957
              (sel_defs, all_sel_thms, sel_thmss, disc_defs, disc_thmss, nontriv_disc_thmss,
blanchet@56858
   958
               discI_thms, nontriv_discI_thms, disc_exclude_thms, disc_exclude_thmsss,
blanchet@56858
   959
               [disc_exhaust_thm], [sel_exhaust_thm], all_collapse_thms, safe_collapse_thms,
blanchet@56858
   960
               [expand_thm], [sel_split_thm], [sel_split_asm_thm], [case_eq_if_thm])
blanchet@49116
   961
            end;
blanchet@49025
   962
blanchet@49437
   963
        val exhaust_case_names_attr = Attrib.internal (K (Rule_Cases.case_names exhaust_cases));
blanchet@53908
   964
        val cases_type_attr = Attrib.internal (K (Induct.cases_type fcT_name));
blanchet@49300
   965
blanchet@55464
   966
        val nontriv_disc_eq_thmss =
blanchet@55464
   967
          map (map (fn th => th RS @{thm eq_False[THEN iffD2]}
blanchet@55464
   968
            handle THM _ => th RS @{thm eq_True[THEN iffD2]})) nontriv_disc_thmss;
blanchet@55464
   969
blanchet@54151
   970
        val anonymous_notes =
blanchet@54151
   971
          [(map (fn th => th RS notE) distinct_thms, safe_elim_attrs),
blanchet@55464
   972
           (flat nontriv_disc_eq_thmss, code_nitpicksimp_attrs)]
blanchet@54151
   973
          |> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])]));
blanchet@54151
   974
blanchet@57038
   975
        (* "exhaust" is deliberately put first to avoid apparent circular dependencies in the proof
blanchet@57038
   976
           objects, which would confuse MaSh. *)
blanchet@49052
   977
        val notes =
blanchet@57038
   978
          [(exhaustN, [exhaust_thm], [exhaust_case_names_attr, cases_type_attr]),
blanchet@57038
   979
           (caseN, case_thms, code_nitpicksimp_simp_attrs),
blanchet@49594
   980
           (case_congN, [case_cong_thm], []),
blanchet@54491
   981
           (case_eq_ifN, case_eq_if_thms, []),
blanchet@53740
   982
           (collapseN, safe_collapse_thms, simp_attrs),
blanchet@55464
   983
           (discN, flat nontriv_disc_thmss, simp_attrs),
blanchet@53700
   984
           (discIN, nontriv_discI_thms, []),
blanchet@53836
   985
           (disc_excludeN, disc_exclude_thms, dest_attrs),
blanchet@49300
   986
           (disc_exhaustN, disc_exhaust_thms, [exhaust_case_names_attr]),
blanchet@54145
   987
           (distinctN, distinct_thms, simp_attrs @ inductsimp_attrs),
blanchet@49486
   988
           (expandN, expand_thms, []),
blanchet@54145
   989
           (injectN, inject_thms, iff_attrs @ inductsimp_attrs),
blanchet@49300
   990
           (nchotomyN, [nchotomy_thm], []),
blanchet@54145
   991
           (selN, all_sel_thms, code_nitpicksimp_simp_attrs),
blanchet@53916
   992
           (sel_exhaustN, sel_exhaust_thms, [exhaust_case_names_attr]),
blanchet@53917
   993
           (sel_splitN, sel_split_thms, []),
blanchet@53917
   994
           (sel_split_asmN, sel_split_asm_thms, []),
blanchet@49300
   995
           (splitN, [split_thm], []),
blanchet@49300
   996
           (split_asmN, [split_asm_thm], []),
blanchet@49633
   997
           (splitsN, [split_thm, split_asm_thm], []),
blanchet@49300
   998
           (weak_case_cong_thmsN, [weak_case_cong_thm], cong_attrs)]
blanchet@49300
   999
          |> filter_out (null o #2)
blanchet@49300
  1000
          |> map (fn (thmN, thms, attrs) =>
blanchet@49633
  1001
            ((qualify true (Binding.name thmN), attrs), [(thms, [])]));
blanchet@49300
  1002
blanchet@57629
  1003
        val (noted, lthy') =
blanchet@57629
  1004
          lthy
blanchet@57629
  1005
          |> Spec_Rules.add Spec_Rules.Equational ([casex], case_thms)
blanchet@57629
  1006
          |> fold (Spec_Rules.add Spec_Rules.Equational)
blanchet@57629
  1007
            (AList.group (eq_list (op aconv)) (map (`(single o lhs_head_of)) all_sel_thms))
blanchet@57629
  1008
          |> fold (Spec_Rules.add Spec_Rules.Equational)
blanchet@57629
  1009
            (filter_out (null o snd) (map single discs ~~ nontriv_disc_eq_thmss))
blanchet@57629
  1010
          |> Local_Theory.declaration {syntax = false, pervasive = true}
blanchet@57629
  1011
               (fn phi => Case_Translation.register
blanchet@57629
  1012
                  (Morphism.term phi casex) (map (Morphism.term phi) ctrs))
blanchet@57629
  1013
          |> Local_Theory.background_theory (fold (fold Code.del_eqn) [disc_defs, sel_defs])
blanchet@57629
  1014
          |> not no_code ?
blanchet@57629
  1015
             Local_Theory.declaration {syntax = false, pervasive = false}
blanchet@57629
  1016
               (fn phi => Context.mapping
blanchet@57629
  1017
                  (add_ctr_code fcT_name (map (Morphism.typ phi) As)
blanchet@57629
  1018
                     (map (dest_Const o Morphism.term phi) ctrs) (Morphism.fact phi inject_thms)
blanchet@57629
  1019
                     (Morphism.fact phi distinct_thms) (Morphism.fact phi case_thms))
blanchet@57629
  1020
                  I)
blanchet@57633
  1021
          |> Local_Theory.notes (anonymous_notes @ notes)
blanchet@57633
  1022
          (* for "datatype_realizer.ML": *)
blanchet@57633
  1023
          |>> name_noted_thms fcT_name exhaustN;
blanchet@57629
  1024
blanchet@53867
  1025
        val ctr_sugar =
blanchet@53867
  1026
          {ctrs = ctrs, casex = casex, discs = discs, selss = selss, exhaust = exhaust_thm,
blanchet@53867
  1027
           nchotomy = nchotomy_thm, injects = inject_thms, distincts = distinct_thms,
blanchet@53867
  1028
           case_thms = case_thms, case_cong = case_cong_thm, weak_case_cong = weak_case_cong_thm,
blanchet@56858
  1029
           split = split_thm, split_asm = split_asm_thm, disc_defs = disc_defs,
blanchet@56858
  1030
           disc_thmss = disc_thmss, discIs = discI_thms, sel_defs = sel_defs, sel_thmss = sel_thmss,
blanchet@56858
  1031
           disc_excludesss = disc_exclude_thmsss, disc_exhausts = disc_exhaust_thms,
blanchet@56858
  1032
           sel_exhausts = sel_exhaust_thms, collapses = all_collapse_thms, expands = expand_thms,
blanchet@56858
  1033
           sel_splits = sel_split_thms, sel_split_asms = sel_split_asm_thms,
blanchet@57629
  1034
           case_eq_ifs = case_eq_if_thms}
blanchet@57629
  1035
          |> morph_ctr_sugar (substitute_noted_thm noted);
blanchet@49019
  1036
      in
blanchet@57629
  1037
        (ctr_sugar, lthy' |> register_ctr_sugar fcT_name ctr_sugar)
blanchet@49019
  1038
      end;
blanchet@49017
  1039
  in
blanchet@49121
  1040
    (goalss, after_qed, lthy')
blanchet@49017
  1041
  end;
blanchet@49017
  1042
blanchet@55468
  1043
fun free_constructors tacss = (fn (goalss, after_qed, lthy) =>
wenzelm@51551
  1044
  map2 (map2 (Thm.close_derivation oo Goal.prove_sorry lthy [] [])) goalss tacss
blanchet@55468
  1045
  |> (fn thms => after_qed thms lthy)) oo prepare_free_constructors (K I);
blanchet@49280
  1046
blanchet@55468
  1047
val free_constructors_cmd = (fn (goalss, after_qed, lthy) =>
blanchet@49297
  1048
  Proof.theorem NONE (snd oo after_qed) (map (map (rpair [])) goalss) lthy) oo
blanchet@55468
  1049
  prepare_free_constructors Syntax.read_term;
blanchet@49297
  1050
blanchet@57091
  1051
val parse_bound_term = Parse.binding --| @{keyword ":"} -- Parse.term;
blanchet@49280
  1052
blanchet@55469
  1053
val parse_ctr_options =
blanchet@54626
  1054
  Scan.optional (@{keyword "("} |-- Parse.list1
blanchet@57094
  1055
        (Parse.reserved "discs_sels" >> K 0 || Parse.reserved "no_code" >> K 1) --|
blanchet@55410
  1056
      @{keyword ")"}
blanchet@55410
  1057
      >> (fn js => (member (op =) js 0, member (op =) js 1)))
blanchet@55410
  1058
    (false, false);
blanchet@49278
  1059
blanchet@55469
  1060
fun parse_ctr_spec parse_ctr parse_arg =
blanchet@57200
  1061
  parse_opt_binding_colon -- parse_ctr -- Scan.repeat parse_arg;
blanchet@55469
  1062
blanchet@57091
  1063
val parse_ctr_specs = Parse.enum1 "|" (parse_ctr_spec Parse.term Parse.binding);
blanchet@57200
  1064
val parse_sel_default_eqs = Scan.optional (@{keyword "where"} |-- Parse.enum1 "|" Parse.prop) [];
blanchet@55469
  1065
blanchet@49017
  1066
val _ =
blanchet@55468
  1067
  Outer_Syntax.local_theory_to_proof @{command_spec "free_constructors"}
blanchet@55468
  1068
    "register an existing freely generated type's constructors"
blanchet@57091
  1069
    (parse_ctr_options -- Parse.binding --| @{keyword "for"} -- parse_ctr_specs
blanchet@57200
  1070
       -- parse_sel_default_eqs
blanchet@55468
  1071
     >> free_constructors_cmd);
blanchet@49017
  1072
kuncar@56522
  1073
val _ = Context.>> (Context.map_theory Ctr_Sugar_Interpretation.init);
kuncar@56522
  1074
blanchet@49017
  1075
end;