src/HOL/Tools/datatype_package.ML
author wenzelm
Wed Apr 13 18:45:09 2005 +0200 (2005-04-13)
changeset 15704 93163972dbdc
parent 15703 727ef1b8b3ee
child 16122 864fda4a4056
permissions -rw-r--r--
*** MESSAGE REFERS TO PREVIOUS VERSION ***
Attrib.src;
Args.maybe;
berghofe@5177
     1
(*  Title:      HOL/Tools/datatype_package.ML
berghofe@5177
     2
    ID:         $Id$
wenzelm@11539
     3
    Author:     Stefan Berghofer, TU Muenchen
berghofe@5177
     4
wenzelm@6360
     5
Datatype package for Isabelle/HOL.
berghofe@5177
     6
*)
berghofe@5177
     7
wenzelm@6360
     8
signature BASIC_DATATYPE_PACKAGE =
wenzelm@6360
     9
sig
wenzelm@6360
    10
  val induct_tac : string -> int -> tactic
nipkow@9747
    11
  val induct_thm_tac : thm -> string -> int -> tactic
wenzelm@8437
    12
  val case_tac : string -> int -> tactic
berghofe@7015
    13
  val distinct_simproc : simproc
wenzelm@6360
    14
end;
wenzelm@6360
    15
berghofe@5177
    16
signature DATATYPE_PACKAGE =
berghofe@5177
    17
sig
wenzelm@6360
    18
  include BASIC_DATATYPE_PACKAGE
berghofe@5661
    19
  val quiet_mode : bool ref
berghofe@5661
    20
  val add_datatype : bool -> string list -> (string list * bstring * mixfix *
berghofe@5661
    21
    (bstring * string list * mixfix) list) list -> theory -> theory *
berghofe@5177
    22
      {distinct : thm list list,
berghofe@5177
    23
       inject : thm list list,
berghofe@5177
    24
       exhaustion : thm list,
berghofe@5177
    25
       rec_thms : thm list,
berghofe@5177
    26
       case_thms : thm list list,
berghofe@5177
    27
       split_thms : (thm * thm) list,
berghofe@5177
    28
       induction : thm,
berghofe@5177
    29
       size : thm list,
berghofe@5177
    30
       simps : thm list}
berghofe@14887
    31
  val add_datatype_i : bool -> bool -> string list -> (string list * bstring * mixfix *
berghofe@5661
    32
    (bstring * typ list * mixfix) list) list -> theory -> theory *
berghofe@5177
    33
      {distinct : thm list list,
berghofe@5177
    34
       inject : thm list list,
berghofe@5177
    35
       exhaustion : thm list,
berghofe@5177
    36
       rec_thms : thm list,
berghofe@5177
    37
       case_thms : thm list list,
berghofe@5177
    38
       split_thms : (thm * thm) list,
berghofe@5177
    39
       induction : thm,
berghofe@5177
    40
       size : thm list,
berghofe@5177
    41
       simps : thm list}
wenzelm@12708
    42
  val rep_datatype_i : string list option -> (thm list * theory attribute list) list list ->
wenzelm@12708
    43
    (thm list * theory attribute list) list list -> (thm list * theory attribute list) ->
wenzelm@12708
    44
    theory -> theory *
wenzelm@6385
    45
      {distinct : thm list list,
wenzelm@6385
    46
       inject : thm list list,
wenzelm@6385
    47
       exhaustion : thm list,
wenzelm@6385
    48
       rec_thms : thm list,
wenzelm@6385
    49
       case_thms : thm list list,
wenzelm@6385
    50
       split_thms : (thm * thm) list,
wenzelm@6385
    51
       induction : thm,
wenzelm@6385
    52
       size : thm list,
wenzelm@6385
    53
       simps : thm list}
wenzelm@15703
    54
  val rep_datatype : string list option -> (thmref * Attrib.src list) list list ->
wenzelm@15703
    55
    (thmref * Attrib.src list) list list -> thmref * Attrib.src list -> theory -> theory *
berghofe@5177
    56
      {distinct : thm list list,
berghofe@5177
    57
       inject : thm list list,
berghofe@5177
    58
       exhaustion : thm list,
berghofe@5177
    59
       rec_thms : thm list,
berghofe@5177
    60
       case_thms : thm list list,
berghofe@5177
    61
       split_thms : (thm * thm) list,
berghofe@5177
    62
       induction : thm,
berghofe@5177
    63
       size : thm list,
berghofe@5177
    64
       simps : thm list}
berghofe@5177
    65
  val get_datatypes : theory -> DatatypeAux.datatype_info Symtab.table
wenzelm@10121
    66
  val get_datatypes_sg : Sign.sg -> DatatypeAux.datatype_info Symtab.table
wenzelm@6441
    67
  val print_datatypes : theory -> unit
berghofe@7015
    68
  val datatype_info_sg : Sign.sg -> string -> DatatypeAux.datatype_info option
berghofe@7015
    69
  val datatype_info : theory -> string -> DatatypeAux.datatype_info option
berghofe@7015
    70
  val datatype_info_sg_err : Sign.sg -> string -> DatatypeAux.datatype_info
berghofe@7015
    71
  val datatype_info_err : theory -> string -> DatatypeAux.datatype_info
berghofe@5177
    72
  val constrs_of : theory -> string -> term list option
berghofe@7015
    73
  val constrs_of_sg : Sign.sg -> string -> term list option
berghofe@5177
    74
  val case_const_of : theory -> string -> term option
wenzelm@10121
    75
  val weak_case_congs_of : theory -> thm list
wenzelm@10121
    76
  val weak_case_congs_of_sg : Sign.sg -> thm list
wenzelm@6360
    77
  val setup: (theory -> theory) list
berghofe@5177
    78
end;
berghofe@5177
    79
berghofe@5177
    80
structure DatatypePackage : DATATYPE_PACKAGE =
berghofe@5177
    81
struct
berghofe@5177
    82
berghofe@5177
    83
open DatatypeAux;
berghofe@5177
    84
berghofe@5661
    85
val quiet_mode = quiet_mode;
berghofe@5661
    86
wenzelm@6360
    87
berghofe@5177
    88
(* data kind 'HOL/datatypes' *)
berghofe@5177
    89
berghofe@5177
    90
structure DatatypesArgs =
berghofe@5177
    91
struct
berghofe@5177
    92
  val name = "HOL/datatypes";
berghofe@5177
    93
  type T = datatype_info Symtab.table;
berghofe@5177
    94
berghofe@5177
    95
  val empty = Symtab.empty;
wenzelm@6556
    96
  val copy = I;
berghofe@5177
    97
  val prep_ext = I;
berghofe@5177
    98
  val merge: T * T -> T = Symtab.merge (K true);
berghofe@5177
    99
berghofe@5177
   100
  fun print sg tab =
berghofe@5177
   101
    Pretty.writeln (Pretty.strs ("datatypes:" ::
wenzelm@6851
   102
      map #1 (Sign.cond_extern_table sg Sign.typeK tab)));
berghofe@5177
   103
end;
berghofe@5177
   104
berghofe@5177
   105
structure DatatypesData = TheoryDataFun(DatatypesArgs);
berghofe@5177
   106
val get_datatypes_sg = DatatypesData.get_sg;
berghofe@5177
   107
val get_datatypes = DatatypesData.get;
berghofe@5177
   108
val put_datatypes = DatatypesData.put;
wenzelm@6441
   109
val print_datatypes = DatatypesData.print;
berghofe@5177
   110
berghofe@5177
   111
berghofe@5177
   112
(** theory information about datatypes **)
berghofe@5177
   113
berghofe@7015
   114
fun datatype_info_sg sg name = Symtab.lookup (get_datatypes_sg sg, name);
berghofe@7015
   115
berghofe@7015
   116
fun datatype_info_sg_err sg name = (case datatype_info_sg sg name of
skalberg@15531
   117
      SOME info => info
skalberg@15531
   118
    | NONE => error ("Unknown datatype " ^ quote name));
berghofe@5177
   119
wenzelm@6394
   120
val datatype_info = datatype_info_sg o Theory.sign_of;
berghofe@5177
   121
berghofe@7015
   122
fun datatype_info_err thy name = (case datatype_info thy name of
skalberg@15531
   123
      SOME info => info
skalberg@15531
   124
    | NONE => error ("Unknown datatype " ^ quote name));
berghofe@5177
   125
berghofe@7015
   126
fun constrs_of_sg sg tname = (case datatype_info_sg sg tname of
skalberg@15531
   127
   SOME {index, descr, ...} =>
skalberg@15570
   128
     let val (_, _, constrs) = valOf (assoc (descr, index))
skalberg@15570
   129
     in SOME (map (fn (cname, _) => Const (cname, valOf (Sign.const_type sg cname))) constrs)
berghofe@7015
   130
     end
skalberg@15531
   131
 | _ => NONE);
berghofe@7015
   132
berghofe@7015
   133
val constrs_of = constrs_of_sg o Theory.sign_of;
berghofe@7015
   134
berghofe@7015
   135
fun case_const_of thy tname = (case datatype_info thy tname of
skalberg@15570
   136
   SOME {case_name, ...} => SOME (Const (case_name, valOf (Sign.const_type
berghofe@7015
   137
     (Theory.sign_of thy) case_name)))
skalberg@15531
   138
 | _ => NONE);
berghofe@5177
   139
wenzelm@10121
   140
val weak_case_congs_of_sg = map (#weak_case_cong o #2) o Symtab.dest o get_datatypes_sg;
wenzelm@10121
   141
val weak_case_congs_of = weak_case_congs_of_sg o Theory.sign_of;
wenzelm@10121
   142
berghofe@5177
   143
fun find_tname var Bi =
berghofe@5177
   144
  let val frees = map dest_Free (term_frees Bi)
berghofe@14412
   145
      val params = rename_wrt_term Bi (Logic.strip_params Bi);
berghofe@5177
   146
  in case assoc (frees @ params, var) of
skalberg@15531
   147
       NONE => error ("No such variable in subgoal: " ^ quote var)
skalberg@15531
   148
     | SOME(Type (tn, _)) => tn
berghofe@5177
   149
     | _ => error ("Cannot determine type of " ^ quote var)
berghofe@5177
   150
  end;
berghofe@5177
   151
wenzelm@8279
   152
fun infer_tname state i aterm =
berghofe@5177
   153
  let
wenzelm@8279
   154
    val sign = Thm.sign_of_thm state;
wenzelm@8279
   155
    val (_, _, Bi, _) = Thm.dest_state (state, i)
berghofe@5177
   156
    val params = Logic.strip_params Bi;   (*params of subgoal i*)
berghofe@5177
   157
    val params = rev (rename_wrt_term Bi params);   (*as they are printed*)
berghofe@5177
   158
    val (types, sorts) = types_sorts state;
skalberg@15531
   159
    fun types' (a, ~1) = (case assoc (params, a) of NONE => types(a, ~1) | sm => sm)
berghofe@5177
   160
      | types' ixn = types ixn;
wenzelm@8100
   161
    val (ct, _) = read_def_cterm (sign, types', sorts) [] false (aterm, TypeInfer.logicT);
berghofe@5177
   162
  in case #T (rep_cterm ct) of
berghofe@5177
   163
       Type (tn, _) => tn
berghofe@5177
   164
     | _ => error ("Cannot determine type of " ^ quote aterm)
berghofe@5177
   165
  end;
berghofe@5177
   166
berghofe@5177
   167
(*Warn if the (induction) variable occurs Free among the premises, which
berghofe@5177
   168
  usually signals a mistake.  But calls the tactic either way!*)
wenzelm@8405
   169
fun occs_in_prems tacf vars =
berghofe@5177
   170
  SUBGOAL (fn (Bi, i) =>
wenzelm@8405
   171
           (if  exists (fn Free (a, _) => a mem vars)
skalberg@15574
   172
                      (foldr add_term_frees [] (#2 (strip_context Bi)))
wenzelm@8405
   173
             then warning "Induction variable occurs also among premises!"
wenzelm@8405
   174
             else ();
wenzelm@8405
   175
            tacf i));
berghofe@5177
   176
wenzelm@8689
   177
berghofe@5177
   178
(* generic induction tactic for datatypes *)
berghofe@5177
   179
wenzelm@8689
   180
local
wenzelm@8689
   181
skalberg@15531
   182
fun prep_var (Var (ixn, _), SOME x) = SOME (ixn, x)
skalberg@15531
   183
  | prep_var _ = NONE;
wenzelm@8689
   184
skalberg@15570
   185
fun prep_inst (concl, xs) =	(*exception UnequalLengths *)
wenzelm@11725
   186
  let val vs = InductAttrib.vars_of concl
skalberg@15570
   187
  in List.mapPartial prep_var (Library.drop (length vs - length xs, vs) ~~ xs) end;
wenzelm@8689
   188
wenzelm@8689
   189
in
wenzelm@8689
   190
ballarin@14174
   191
fun gen_induct_tac inst_tac (varss, opt_rule) i state =
berghofe@5177
   192
  let
wenzelm@8689
   193
    val (_, _, Bi, _) = Thm.dest_state (state, i);
wenzelm@8689
   194
    val {sign, ...} = Thm.rep_thm state;
wenzelm@8672
   195
    val (rule, rule_name) =
wenzelm@8672
   196
      (case opt_rule of
skalberg@15531
   197
        SOME r => (r, "Induction rule")
skalberg@15531
   198
      | NONE =>
skalberg@15570
   199
          let val tn = find_tname (hd (List.mapPartial I (List.concat varss))) Bi
wenzelm@8672
   200
          in (#induction (datatype_info_sg_err sign tn), "Induction rule for type " ^ tn) end);
wenzelm@8672
   201
wenzelm@11725
   202
    val concls = HOLogic.dest_concls (Thm.concl_of rule);
skalberg@15570
   203
    val insts = List.concat (map prep_inst (concls ~~ varss)) handle UnequalLengths =>
wenzelm@8689
   204
      error (rule_name ^ " has different numbers of variables");
ballarin@14174
   205
  in occs_in_prems (inst_tac insts rule) (map #2 insts) i state end;
wenzelm@8689
   206
ballarin@14174
   207
fun induct_tac s =
berghofe@15444
   208
  gen_induct_tac Tactic.res_inst_tac'
skalberg@15531
   209
    (map (Library.single o SOME) (Syntax.read_idents s), NONE);
wenzelm@8689
   210
nipkow@9747
   211
fun induct_thm_tac th s =
berghofe@15444
   212
  gen_induct_tac Tactic.res_inst_tac'
skalberg@15531
   213
    ([map SOME (Syntax.read_idents s)], SOME th);
nipkow@9747
   214
wenzelm@8689
   215
end;
berghofe@5177
   216
wenzelm@8279
   217
wenzelm@8437
   218
(* generic case tactic for datatypes *)
berghofe@5177
   219
ballarin@14174
   220
fun case_inst_tac inst_tac t rule i state =
wenzelm@8672
   221
  let
wenzelm@8672
   222
    val _ $ Var (ixn, _) $ _ = HOLogic.dest_Trueprop
wenzelm@8672
   223
      (hd (Logic.strip_assums_hyp (hd (Thm.prems_of rule))));
berghofe@15444
   224
  in inst_tac [(ixn, t)] rule i state end;
wenzelm@8672
   225
skalberg@15531
   226
fun gen_case_tac inst_tac (t, SOME rule) i state =
ballarin@14174
   227
      case_inst_tac inst_tac t rule i state
skalberg@15531
   228
  | gen_case_tac inst_tac (t, NONE) i state =
wenzelm@8672
   229
      let val tn = infer_tname state i t in
berghofe@15444
   230
        if tn = HOLogic.boolN then inst_tac [(("P", 0), t)] case_split_thm i state
ballarin@14174
   231
        else case_inst_tac inst_tac t
ballarin@14174
   232
               (#exhaustion (datatype_info_sg_err (Thm.sign_of_thm state) tn))
ballarin@14174
   233
               i state
berghofe@14471
   234
      end handle THM _ => Seq.empty;
wenzelm@8672
   235
skalberg@15531
   236
fun case_tac t = gen_case_tac Tactic.res_inst_tac' (t, NONE);
wenzelm@8672
   237
wenzelm@8279
   238
wenzelm@8279
   239
wenzelm@8541
   240
(** Isar tactic emulations **)
wenzelm@8541
   241
wenzelm@8672
   242
local
wenzelm@8672
   243
wenzelm@8689
   244
val rule_spec = Scan.lift (Args.$$$ "rule" -- Args.$$$ ":");
wenzelm@8689
   245
val opt_rule = Scan.option (rule_spec |-- Attrib.local_thm);
wenzelm@8689
   246
wenzelm@15703
   247
val varss =
wenzelm@15703
   248
  Args.and_list (Scan.repeat (Scan.unless rule_spec (Scan.lift (Args.maybe Args.name))));
wenzelm@8672
   249
berghofe@15444
   250
val inst_tac = Method.bires_inst_tac false;
ballarin@14174
   251
ballarin@14174
   252
fun induct_meth ctxt (varss, opt_rule) =
ballarin@14174
   253
  gen_induct_tac (inst_tac ctxt) (varss, opt_rule);
ballarin@14174
   254
fun case_meth ctxt (varss, opt_rule) =
ballarin@14174
   255
  gen_case_tac (inst_tac ctxt) (varss, opt_rule);
ballarin@14174
   256
wenzelm@8672
   257
in
wenzelm@8541
   258
wenzelm@8541
   259
val tactic_emulations =
ballarin@14174
   260
 [("induct_tac", Method.goal_args_ctxt' (varss -- opt_rule) induct_meth,
ballarin@14174
   261
    "induct_tac emulation (dynamic instantiation)"),
ballarin@14174
   262
  ("case_tac", Method.goal_args_ctxt' (Scan.lift Args.name -- opt_rule) case_meth,
ballarin@14174
   263
    "case_tac emulation (dynamic instantiation)")];
wenzelm@8672
   264
wenzelm@8672
   265
end;
wenzelm@8541
   266
wenzelm@8541
   267
berghofe@5177
   268
wenzelm@8437
   269
(** induct method setup **)
wenzelm@8437
   270
wenzelm@8437
   271
(* case names *)
wenzelm@8437
   272
wenzelm@8437
   273
local
wenzelm@8437
   274
wenzelm@8437
   275
fun dt_recs (DtTFree _) = []
skalberg@15570
   276
  | dt_recs (DtType (_, dts)) = List.concat (map dt_recs dts)
wenzelm@8437
   277
  | dt_recs (DtRec i) = [i];
wenzelm@8437
   278
wenzelm@8437
   279
fun dt_cases (descr: descr) (_, args, constrs) =
wenzelm@8437
   280
  let
skalberg@15570
   281
    fun the_bname i = Sign.base_name (#1 (valOf (assoc (descr, i))));
skalberg@15570
   282
    val bnames = map the_bname (distinct (List.concat (map dt_recs args)));
wenzelm@8437
   283
  in map (fn (c, _) => space_implode "_" (Sign.base_name c :: bnames)) constrs end;
wenzelm@8437
   284
wenzelm@8437
   285
wenzelm@8437
   286
fun induct_cases descr =
skalberg@15570
   287
  DatatypeProp.indexify_names (List.concat (map (dt_cases descr) (map #2 descr)));
wenzelm@8437
   288
skalberg@15570
   289
fun exhaust_cases descr i = dt_cases descr (valOf (assoc (descr, i)));
wenzelm@8437
   290
wenzelm@8437
   291
in
wenzelm@8437
   292
wenzelm@8437
   293
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr);
wenzelm@8437
   294
wenzelm@8437
   295
fun mk_case_names_exhausts descr new =
wenzelm@8437
   296
  map (RuleCases.case_names o exhaust_cases descr o #1)
skalberg@15570
   297
    (List.filter (fn ((_, (name, _, _))) => name mem_string new) descr);
wenzelm@8437
   298
wenzelm@8437
   299
end;
wenzelm@8437
   300
oheimb@11345
   301
fun add_rules simps case_thms size_thms rec_thms inject distinct
oheimb@11345
   302
                  weak_case_congs cong_att =
oheimb@11345
   303
  (#1 o PureThy.add_thmss [(("simps", simps), []),
skalberg@15570
   304
    (("", List.concat case_thms @ size_thms @ 
skalberg@15570
   305
          List.concat distinct  @ rec_thms), [Simplifier.simp_add_global]),
berghofe@12448
   306
    (("", size_thms @ rec_thms), [RecfunCodegen.add]),
skalberg@15570
   307
    (("", List.concat inject),               [iff_add_global]),
skalberg@15570
   308
    (("", List.concat distinct RL [notE]),   [Classical.safe_elim_global]),
oheimb@11345
   309
    (("", weak_case_congs),           [cong_att])]);
oheimb@11345
   310
wenzelm@8437
   311
wenzelm@8437
   312
(* add_cases_induct *)
wenzelm@8306
   313
wenzelm@11805
   314
fun add_cases_induct infos induction =
wenzelm@8306
   315
  let
wenzelm@11805
   316
    val n = length (HOLogic.dest_concls (Thm.concl_of induction));
wenzelm@11805
   317
    fun proj i thm =
wenzelm@11805
   318
      if n = 1 then thm
wenzelm@11805
   319
      else (if i + 1 < n then (fn th => th RS conjunct1) else I)
wenzelm@11805
   320
        (Library.funpow i (fn th => th RS conjunct2) thm)
wenzelm@11805
   321
        |> Drule.zero_var_indexes
wenzelm@11805
   322
        |> RuleCases.save thm;
wenzelm@8405
   323
wenzelm@11805
   324
    fun named_rules (name, {index, exhaustion, ...}: datatype_info) =
wenzelm@11805
   325
      [(("", proj index induction), [InductAttrib.induct_type_global name]),
wenzelm@11805
   326
       (("", exhaustion), [InductAttrib.cases_type_global name])];
wenzelm@11805
   327
    fun unnamed_rule i =
wenzelm@11805
   328
      (("", proj i induction), [InductAttrib.induct_type_global ""]);
skalberg@15570
   329
    val rules = List.concat (map named_rules infos) @ map unnamed_rule (length infos upto n - 1);
wenzelm@11805
   330
  in #1 o PureThy.add_thms rules end;
wenzelm@8306
   331
berghofe@5177
   332
wenzelm@8405
   333
berghofe@7015
   334
(**** simplification procedure for showing distinctness of constructors ****)
berghofe@7015
   335
berghofe@7060
   336
fun stripT (i, Type ("fun", [_, T])) = stripT (i + 1, T)
berghofe@7060
   337
  | stripT p = p;
berghofe@7060
   338
berghofe@7060
   339
fun stripC (i, f $ x) = stripC (i + 1, f)
berghofe@7060
   340
  | stripC p = p;
berghofe@7060
   341
berghofe@7015
   342
val distinctN = "constr_distinct";
berghofe@7015
   343
berghofe@7015
   344
exception ConstrDistinct of term;
berghofe@7015
   345
berghofe@7015
   346
fun distinct_proc sg _ (t as Const ("op =", _) $ t1 $ t2) =
berghofe@7060
   347
  (case (stripC (0, t1), stripC (0, t2)) of
berghofe@7060
   348
     ((i, Const (cname1, T1)), (j, Const (cname2, T2))) =>
berghofe@7060
   349
         (case (stripT (0, T1), stripT (0, T2)) of
berghofe@7060
   350
            ((i', Type (tname1, _)), (j', Type (tname2, _))) =>
berghofe@7060
   351
                if tname1 = tname2 andalso not (cname1 = cname2) andalso i = i' andalso j = j' then
berghofe@7015
   352
                   (case (constrs_of_sg sg tname1) of
skalberg@15531
   353
                      SOME constrs => let val cnames = map (fst o dest_Const) constrs
berghofe@7015
   354
                        in if cname1 mem cnames andalso cname2 mem cnames then
berghofe@7015
   355
                             let val eq_t = Logic.mk_equals (t, Const ("False", HOLogic.boolT));
berghofe@7015
   356
                                 val eq_ct = cterm_of sg eq_t;
berghofe@7015
   357
                                 val Datatype_thy = theory "Datatype";
berghofe@7015
   358
                                 val [In0_inject, In1_inject, In0_not_In1, In1_not_In0] =
skalberg@15531
   359
                                   map (get_thm Datatype_thy o rpair NONE)
berghofe@7015
   360
                                     ["In0_inject", "In1_inject", "In0_not_In1", "In1_not_In0"]
berghofe@7015
   361
                             in (case (#distinct (datatype_info_sg_err sg tname1)) of
skalberg@15531
   362
                                 QuickAndDirty => SOME (Thm.invoke_oracle
berghofe@7015
   363
                                   Datatype_thy distinctN (sg, ConstrDistinct eq_t))
skalberg@15531
   364
                               | FewConstrs thms => SOME (Tactic.prove sg [] [] eq_t (K
wenzelm@13480
   365
                                   (EVERY [rtac eq_reflection 1, rtac iffI 1, rtac notE 1,
wenzelm@13480
   366
                                    atac 2, resolve_tac thms 1, etac FalseE 1])))
skalberg@15531
   367
                               | ManyConstrs (thm, ss) => SOME (Tactic.prove sg [] [] eq_t (K
wenzelm@13480
   368
                                   (EVERY [rtac eq_reflection 1, rtac iffI 1, dtac thm 1,
berghofe@7015
   369
                                    full_simp_tac ss 1,
berghofe@7015
   370
                                    REPEAT (dresolve_tac [In0_inject, In1_inject] 1),
berghofe@7015
   371
                                    eresolve_tac [In0_not_In1 RS notE, In1_not_In0 RS notE] 1,
wenzelm@13480
   372
                                    etac FalseE 1]))))
berghofe@7015
   373
                             end
skalberg@15531
   374
                           else NONE
berghofe@7015
   375
                        end
skalberg@15531
   376
                    | NONE => NONE)
skalberg@15531
   377
                else NONE
skalberg@15531
   378
          | _ => NONE)
skalberg@15531
   379
   | _ => NONE)
skalberg@15531
   380
  | distinct_proc sg _ _ = NONE;
berghofe@7015
   381
wenzelm@13462
   382
val distinct_simproc =
wenzelm@13462
   383
  Simplifier.simproc (Theory.sign_of HOL.thy) distinctN ["s = t"] distinct_proc;
berghofe@7015
   384
berghofe@7015
   385
val dist_ss = HOL_ss addsimprocs [distinct_simproc];
berghofe@7015
   386
berghofe@7015
   387
val simproc_setup =
berghofe@7015
   388
  [Theory.add_oracle (distinctN, fn (_, ConstrDistinct t) => t),
berghofe@7015
   389
   fn thy => (simpset_ref_of thy := simpset_of thy addsimprocs [distinct_simproc]; thy)];
berghofe@7015
   390
berghofe@7015
   391
berghofe@14799
   392
(**** translation rules for case ****)
berghofe@14799
   393
berghofe@14799
   394
fun case_tr sg [t, u] =
berghofe@14799
   395
    let
berghofe@14799
   396
      fun case_error s name ts = raise TERM ("Error in case expression" ^
skalberg@15570
   397
        getOpt (Option.map (curry op ^ " for datatype ") name, "") ^ ":\n" ^ s, ts);
berghofe@14799
   398
      fun dest_case1 (Const ("_case1", _) $ t $ u) = (case strip_comb t of
berghofe@14799
   399
            (Const (s, _), ts) => (Sign.intern_const sg s, ts)
berghofe@14799
   400
          | (Free (s, _), ts) => (Sign.intern_const sg s, ts)
skalberg@15531
   401
          | _ => case_error "Head is not a constructor" NONE [t, u], u)
berghofe@14799
   402
        | dest_case1 t = raise TERM ("dest_case1", [t]);
berghofe@14799
   403
      fun dest_case2 (Const ("_case2", _) $ t $ u) = t :: dest_case2 u
berghofe@14799
   404
        | dest_case2 t = [t];
berghofe@14799
   405
      val cases as ((cname, _), _) :: _ = map dest_case1 (dest_case2 u);
berghofe@14799
   406
      val tab = Symtab.dest (get_datatypes_sg sg);
berghofe@14799
   407
      val (cases', default) = (case split_last cases of
skalberg@15531
   408
          (cases', (("dummy_pattern", []), t)) => (cases', SOME t)
skalberg@15531
   409
        | _ => (cases, NONE))
berghofe@14799
   410
      fun abstr (Free (x, T), body) = Term.absfree (x, T, body)
berghofe@14799
   411
        | abstr (Const ("_constrain", _) $ Free (x, T) $ tT, body) =
berghofe@14799
   412
            Syntax.const Syntax.constrainAbsC $ Term.absfree (x, T, body) $ tT
berghofe@14799
   413
        | abstr (Const ("Pair", _) $ x $ y, body) =
berghofe@14799
   414
            Syntax.const "split" $ abstr (x, abstr (y, body))
skalberg@15531
   415
        | abstr (t, _) = case_error "Illegal pattern" NONE [t];
berghofe@14799
   416
    in case find_first (fn (_, {descr, index, ...}) =>
skalberg@15570
   417
      exists (equal cname o fst) (#3 (snd (List.nth (descr, index))))) tab of
skalberg@15531
   418
        NONE => case_error ("Not a datatype constructor: " ^ cname) NONE [u]
skalberg@15531
   419
      | SOME (tname, {descr, case_name, index, ...}) =>
berghofe@14799
   420
        let
berghofe@14799
   421
          val _ = if exists (equal "dummy_pattern" o fst o fst) cases' then
skalberg@15531
   422
            case_error "Illegal occurrence of '_' dummy pattern" (SOME tname) [u] else ();
skalberg@15570
   423
          val (_, (_, dts, constrs)) = List.nth (descr, index);
berghofe@14799
   424
          val sorts = map (rpair [] o dest_DtTFree) dts;
berghofe@14799
   425
          fun find_case (cases, (s, dt)) =
berghofe@14799
   426
            (case find_first (equal s o fst o fst) cases' of
skalberg@15531
   427
               NONE => (case default of
skalberg@15531
   428
                   NONE => case_error ("No clause for constructor " ^ s) (SOME tname) [u]
skalberg@15531
   429
                 | SOME t => (cases, list_abs (map (rpair dummyT) (DatatypeProp.make_tnames
berghofe@14799
   430
                     (map (typ_of_dtyp descr sorts) dt)), t)))
skalberg@15531
   431
             | SOME (c as ((_, vs), t)) =>
berghofe@14799
   432
                 if length dt <> length vs then
berghofe@14799
   433
                    case_error ("Wrong number of arguments for constructor " ^ s)
skalberg@15531
   434
                      (SOME tname) vs
skalberg@15574
   435
                 else (cases \ c, foldr abstr t vs))
berghofe@14799
   436
          val (cases'', fs) = foldl_map find_case (cases', constrs)
berghofe@14799
   437
        in case (cases'', length constrs = length cases', default) of
skalberg@15531
   438
            ([], true, SOME _) =>
skalberg@15531
   439
              case_error "Extra '_' dummy pattern" (SOME tname) [u]
berghofe@14799
   440
          | (_ :: _, _, _) =>
berghofe@14799
   441
              let val extra = distinct (map (fst o fst) cases'')
berghofe@14799
   442
              in case extra \\ map fst constrs of
berghofe@14799
   443
                  [] => case_error ("More than one clause for constructor(s) " ^
skalberg@15531
   444
                    commas extra) (SOME tname) [u]
berghofe@14799
   445
                | extra' => case_error ("Illegal constructor(s): " ^ commas extra')
skalberg@15531
   446
                    (SOME tname) [u]
berghofe@14799
   447
              end
berghofe@14799
   448
          | _ => list_comb (Syntax.const case_name, fs) $ t
berghofe@14799
   449
        end
berghofe@14799
   450
    end
berghofe@14799
   451
  | case_tr sg ts = raise TERM ("case_tr", ts);
berghofe@14799
   452
berghofe@14799
   453
fun case_tr' constrs sg ts =
berghofe@14799
   454
  if length ts <> length constrs + 1 then raise Match else
berghofe@14799
   455
  let
berghofe@14799
   456
    val (fs, x) = split_last ts;
berghofe@14799
   457
    fun strip_abs 0 t = ([], t)
berghofe@14799
   458
      | strip_abs i (Abs p) =
berghofe@14799
   459
        let val (x, u) = Syntax.atomic_abs_tr' p
berghofe@14799
   460
        in apfst (cons x) (strip_abs (i-1) u) end
berghofe@14799
   461
      | strip_abs i (Const ("split", _) $ t) = (case strip_abs (i+1) t of
berghofe@14799
   462
          (v :: v' :: vs, u) => (Syntax.const "Pair" $ v $ v' :: vs, u));
berghofe@14799
   463
    fun is_dependent i t =
berghofe@14799
   464
      let val k = length (strip_abs_vars t) - i
berghofe@14799
   465
      in k < 0 orelse exists (fn j => j >= k)
berghofe@14799
   466
        (loose_bnos (strip_abs_body t))
berghofe@14799
   467
      end;
berghofe@14799
   468
    val cases = map (fn ((cname, dts), t) =>
berghofe@14799
   469
      (Sign.cond_extern sg Sign.constK cname,
berghofe@14799
   470
       strip_abs (length dts) t, is_dependent (length dts) t))
berghofe@14799
   471
      (constrs ~~ fs);
berghofe@14799
   472
    fun count_cases (cs, (_, _, true)) = cs
berghofe@14799
   473
      | count_cases (cs, (cname, (_, body), false)) = (case assoc (cs, body) of
skalberg@15531
   474
          NONE => (body, [cname]) :: cs
skalberg@15531
   475
        | SOME cnames => overwrite (cs, (body, cnames @ [cname])));
berghofe@14799
   476
    val cases' = sort (int_ord o Library.swap o pairself (length o snd))
skalberg@15570
   477
      (Library.foldl count_cases ([], cases));
berghofe@14799
   478
    fun mk_case1 (cname, (vs, body), _) = Syntax.const "_case1" $
berghofe@14799
   479
      list_comb (Syntax.const cname, vs) $ body;
berghofe@14799
   480
  in
berghofe@14799
   481
    Syntax.const "_case_syntax" $ x $
berghofe@14799
   482
      foldr1 (fn (t, u) => Syntax.const "_case2" $ t $ u) (map mk_case1
berghofe@14799
   483
        (case cases' of
berghofe@14799
   484
           [] => cases
berghofe@14799
   485
         | (default, cnames) :: _ =>
berghofe@14799
   486
           if length cnames = 1 then cases
berghofe@14799
   487
           else if length cnames = length constrs then
berghofe@14799
   488
             [hd cases, ("dummy_pattern", ([], default), false)]
berghofe@14799
   489
           else
berghofe@14799
   490
             filter_out (fn (cname, _, _) => cname mem cnames) cases @
berghofe@14799
   491
             [("dummy_pattern", ([], default), false)]))
berghofe@14799
   492
  end;
berghofe@14799
   493
skalberg@15570
   494
fun make_case_tr' case_names descr = List.concat (map
berghofe@14799
   495
  (fn ((_, (_, _, constrs)), case_name) => map (rpair (case_tr' constrs))
berghofe@14799
   496
    (NameSpace.accesses' case_name)) (descr ~~ case_names));
berghofe@14799
   497
berghofe@14799
   498
val trfun_setup =
berghofe@14799
   499
  [Theory.add_advanced_trfuns ([], [("_case_syntax", case_tr)], [], [])];
berghofe@14799
   500
berghofe@14799
   501
berghofe@5177
   502
(* prepare types *)
berghofe@5177
   503
berghofe@5177
   504
fun read_typ sign ((Ts, sorts), str) =
berghofe@5177
   505
  let
berghofe@5177
   506
    val T = Type.no_tvars (Sign.read_typ (sign, (curry assoc)
berghofe@5177
   507
      (map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg
berghofe@5177
   508
  in (Ts @ [T], add_typ_tfrees (T, sorts)) end;
berghofe@5177
   509
berghofe@5177
   510
fun cert_typ sign ((Ts, sorts), raw_T) =
berghofe@5177
   511
  let
berghofe@5177
   512
    val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle
berghofe@5177
   513
      TYPE (msg, _, _) => error msg;
berghofe@5177
   514
    val sorts' = add_typ_tfrees (T, sorts)
berghofe@5177
   515
  in (Ts @ [T],
berghofe@5177
   516
      case duplicates (map fst sorts') of
berghofe@5177
   517
         [] => sorts'
berghofe@5177
   518
       | dups => error ("Inconsistent sort constraints for " ^ commas dups))
berghofe@5177
   519
  end;
berghofe@5177
   520
berghofe@5177
   521
berghofe@5177
   522
(**** make datatype info ****)
berghofe@5177
   523
berghofe@5177
   524
fun make_dt_info descr induct reccomb_names rec_thms
wenzelm@10121
   525
    (((((((((i, (_, (tname, _, _))), case_name), case_thms),
wenzelm@10121
   526
      exhaustion_thm), distinct_thm), inject), nchotomy), case_cong), weak_case_cong) =
wenzelm@10121
   527
  (tname,
wenzelm@10121
   528
   {index = i,
wenzelm@10121
   529
    descr = descr,
wenzelm@10121
   530
    rec_names = reccomb_names,
wenzelm@10121
   531
    rec_rewrites = rec_thms,
wenzelm@10121
   532
    case_name = case_name,
wenzelm@10121
   533
    case_rewrites = case_thms,
wenzelm@10121
   534
    induction = induct,
wenzelm@10121
   535
    exhaustion = exhaustion_thm,
wenzelm@10121
   536
    distinct = distinct_thm,
wenzelm@10121
   537
    inject = inject,
wenzelm@10121
   538
    nchotomy = nchotomy,
wenzelm@10121
   539
    case_cong = case_cong,
wenzelm@10121
   540
    weak_case_cong = weak_case_cong});
berghofe@5177
   541
berghofe@5177
   542
berghofe@5177
   543
(********************* axiomatic introduction of datatypes ********************)
berghofe@5177
   544
wenzelm@8437
   545
fun add_and_get_axioms_atts label tnames attss ts thy =
skalberg@15574
   546
  foldr (fn (((tname, atts), t), (thy', axs)) =>
berghofe@5177
   547
    let
wenzelm@8437
   548
      val (thy'', [ax]) = thy' |>
berghofe@5661
   549
        Theory.add_path tname |>
wenzelm@8437
   550
        PureThy.add_axioms_i [((label, t), atts)];
berghofe@5661
   551
    in (Theory.parent_path thy'', ax::axs)
skalberg@15574
   552
    end) (thy, []) (tnames ~~ attss ~~ ts);
wenzelm@8437
   553
wenzelm@8437
   554
fun add_and_get_axioms label tnames =
wenzelm@8437
   555
  add_and_get_axioms_atts label tnames (replicate (length tnames) []);
berghofe@5177
   556
berghofe@5177
   557
fun add_and_get_axiomss label tnames tss thy =
skalberg@15574
   558
  foldr (fn ((tname, ts), (thy', axss)) =>
berghofe@5177
   559
    let
wenzelm@8437
   560
      val (thy'', [axs]) = thy' |>
berghofe@5661
   561
        Theory.add_path tname |>
berghofe@5177
   562
        PureThy.add_axiomss_i [((label, ts), [])];
berghofe@5661
   563
    in (Theory.parent_path thy'', axs::axss)
skalberg@15574
   564
    end) (thy, []) (tnames ~~ tss);
berghofe@5177
   565
wenzelm@8437
   566
fun add_datatype_axm flat_names new_type_names descr sorts types_syntax constr_syntax dt_info
wenzelm@8437
   567
    case_names_induct case_names_exhausts thy =
berghofe@5177
   568
  let
skalberg@15570
   569
    val descr' = List.concat descr;
berghofe@5177
   570
    val recTs = get_rec_types descr' sorts;
skalberg@15574
   571
    val used = foldr add_typ_tfree_names [] recTs;
skalberg@15570
   572
    val newTs = Library.take (length (hd descr), recTs);
berghofe@5177
   573
berghofe@7015
   574
    val no_size = exists (fn (_, (_, _, constrs)) => exists (fn (_, cargs) => exists
berghofe@13641
   575
      (fn dt => is_rec_type dt andalso not (null (fst (strip_dtyp dt))))
berghofe@13641
   576
        cargs) constrs) descr';
berghofe@7015
   577
berghofe@5177
   578
    (**** declare new types and constants ****)
berghofe@5177
   579
berghofe@5177
   580
    val tyvars = map (fn (_, (_, Ts, _)) => map dest_DtTFree Ts) (hd descr);
berghofe@5177
   581
berghofe@5177
   582
    val constr_decls = map (fn (((_, (_, _, constrs)), T), constr_syntax') =>
berghofe@5177
   583
      map (fn ((_, cargs), (cname, mx)) =>
berghofe@5177
   584
        (cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx))
berghofe@5177
   585
          (constrs ~~ constr_syntax')) ((hd descr) ~~ newTs ~~ constr_syntax);
berghofe@5177
   586
berghofe@15457
   587
    val (rec_result_Ts, reccomb_fn_Ts) = DatatypeProp.make_primrec_Ts descr sorts used;
berghofe@5177
   588
berghofe@5177
   589
    val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec";
berghofe@5177
   590
    val reccomb_names = if length descr' = 1 then [big_reccomb_name] else
berghofe@5177
   591
      (map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int)
berghofe@5177
   592
        (1 upto (length descr')));
berghofe@5177
   593
berghofe@9739
   594
    val size_names = DatatypeProp.indexify_names
skalberg@15570
   595
      (map (fn T => name_of_typ T ^ "_size") (Library.drop (length (hd descr), recTs)));
berghofe@5177
   596
wenzelm@12338
   597
    val freeT = TFree (variant used "'t", HOLogic.typeS);
berghofe@5177
   598
    val case_fn_Ts = map (fn (i, (_, _, constrs)) =>
berghofe@5177
   599
      map (fn (_, cargs) =>
berghofe@5177
   600
        let val Ts = map (typ_of_dtyp descr' sorts) cargs
berghofe@5177
   601
        in Ts ---> freeT end) constrs) (hd descr);
berghofe@5177
   602
berghofe@5177
   603
    val case_names = map (fn s => (s ^ "_case")) new_type_names;
berghofe@5177
   604
berghofe@6305
   605
    val thy2' = thy |>
berghofe@5177
   606
berghofe@5177
   607
      (** new types **)
berghofe@5177
   608
skalberg@15570
   609
      curry (Library.foldr (fn (((name, mx), tvs), thy') => thy' |>
wenzelm@6385
   610
          TypedefPackage.add_typedecls [(name, tvs, mx)]))
wenzelm@6385
   611
        (types_syntax ~~ tyvars) |>
berghofe@5661
   612
      add_path flat_names (space_implode "_" new_type_names) |>
berghofe@5177
   613
berghofe@5177
   614
      (** primrec combinators **)
berghofe@5177
   615
berghofe@5177
   616
      Theory.add_consts_i (map (fn ((name, T), T') =>
berghofe@5177
   617
        (name, reccomb_fn_Ts @ [T] ---> T', NoSyn))
berghofe@5177
   618
          (reccomb_names ~~ recTs ~~ rec_result_Ts)) |>
berghofe@5177
   619
berghofe@5177
   620
      (** case combinators **)
berghofe@5177
   621
berghofe@5177
   622
      Theory.add_consts_i (map (fn ((name, T), Ts) =>
berghofe@5177
   623
        (name, Ts @ [T] ---> freeT, NoSyn))
berghofe@14799
   624
          (case_names ~~ newTs ~~ case_fn_Ts));
berghofe@6305
   625
wenzelm@6394
   626
    val reccomb_names' = map (Sign.intern_const (Theory.sign_of thy2')) reccomb_names;
wenzelm@6394
   627
    val case_names' = map (Sign.intern_const (Theory.sign_of thy2')) case_names;
berghofe@6305
   628
berghofe@6305
   629
    val thy2 = thy2' |>
berghofe@5177
   630
berghofe@5177
   631
      (** size functions **)
berghofe@5177
   632
berghofe@7015
   633
      (if no_size then I else Theory.add_consts_i (map (fn (s, T) =>
berghofe@5177
   634
        (Sign.base_name s, T --> HOLogic.natT, NoSyn))
skalberg@15570
   635
          (size_names ~~ Library.drop (length (hd descr), recTs)))) |>
berghofe@5661
   636
berghofe@5661
   637
      (** constructors **)
berghofe@5661
   638
berghofe@5661
   639
      parent_path flat_names |>
skalberg@15570
   640
      curry (Library.foldr (fn (((((_, (_, _, constrs)), T), tname),
berghofe@5661
   641
        constr_syntax'), thy') => thy' |>
berghofe@5661
   642
          add_path flat_names tname |>
berghofe@5661
   643
            Theory.add_consts_i (map (fn ((_, cargs), (cname, mx)) =>
berghofe@5661
   644
              (cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx))
berghofe@5661
   645
                (constrs ~~ constr_syntax')) |>
berghofe@5661
   646
          parent_path flat_names))
berghofe@5661
   647
            (hd descr ~~ newTs ~~ new_type_names ~~ constr_syntax);
berghofe@5177
   648
berghofe@5177
   649
    (**** introduction of axioms ****)
berghofe@5177
   650
berghofe@5661
   651
    val rec_axs = DatatypeProp.make_primrecs new_type_names descr sorts thy2;
berghofe@9739
   652
    val size_axs = if no_size then [] else DatatypeProp.make_size descr sorts thy2;
berghofe@5661
   653
wenzelm@8437
   654
    val (thy3, (([induct], [rec_thms]), inject)) =
wenzelm@8437
   655
      thy2 |>
berghofe@5661
   656
      Theory.add_path (space_implode "_" new_type_names) |>
wenzelm@10911
   657
      PureThy.add_axioms_i [(("induct", DatatypeProp.make_ind descr sorts),
berghofe@13340
   658
        [case_names_induct])] |>>>
wenzelm@8437
   659
      PureThy.add_axiomss_i [(("recs", rec_axs), [])] |>>
wenzelm@8437
   660
      (if no_size then I else #1 o PureThy.add_axiomss_i [(("size", size_axs), [])]) |>>
wenzelm@8437
   661
      Theory.parent_path |>>>
berghofe@5177
   662
      add_and_get_axiomss "inject" new_type_names
berghofe@5177
   663
        (DatatypeProp.make_injs descr sorts);
skalberg@15531
   664
    val size_thms = if no_size then [] else get_thms thy3 ("size", NONE);
berghofe@5177
   665
    val (thy4, distinct) = add_and_get_axiomss "distinct" new_type_names
berghofe@5177
   666
      (DatatypeProp.make_distincts new_type_names descr sorts thy3) thy3;
wenzelm@8437
   667
wenzelm@8437
   668
    val exhaust_ts = DatatypeProp.make_casedists descr sorts;
wenzelm@8437
   669
    val (thy5, exhaustion) = add_and_get_axioms_atts "exhaust" new_type_names
wenzelm@8437
   670
      (map Library.single case_names_exhausts) exhaust_ts thy4;
berghofe@5177
   671
    val (thy6, case_thms) = add_and_get_axiomss "cases" new_type_names
berghofe@5177
   672
      (DatatypeProp.make_cases new_type_names descr sorts thy5) thy5;
berghofe@5177
   673
    val (split_ts, split_asm_ts) = ListPair.unzip
berghofe@5177
   674
      (DatatypeProp.make_splits new_type_names descr sorts thy6);
berghofe@5177
   675
    val (thy7, split) = add_and_get_axioms "split" new_type_names split_ts thy6;
berghofe@5177
   676
    val (thy8, split_asm) = add_and_get_axioms "split_asm" new_type_names
berghofe@5177
   677
      split_asm_ts thy7;
berghofe@5177
   678
    val (thy9, nchotomys) = add_and_get_axioms "nchotomy" new_type_names
berghofe@5177
   679
      (DatatypeProp.make_nchotomys descr sorts) thy8;
berghofe@5177
   680
    val (thy10, case_congs) = add_and_get_axioms "case_cong" new_type_names
berghofe@5177
   681
      (DatatypeProp.make_case_congs new_type_names descr sorts thy9) thy9;
nipkow@8601
   682
    val (thy11, weak_case_congs) = add_and_get_axioms "weak_case_cong" new_type_names
nipkow@8601
   683
      (DatatypeProp.make_weak_case_congs new_type_names descr sorts thy10) thy10;
wenzelm@8405
   684
berghofe@6305
   685
    val dt_infos = map (make_dt_info descr' induct reccomb_names' rec_thms)
berghofe@6305
   686
      ((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names' ~~ case_thms ~~
berghofe@7015
   687
        exhaustion ~~ replicate (length (hd descr)) QuickAndDirty ~~ inject ~~
wenzelm@10121
   688
          nchotomys ~~ case_congs ~~ weak_case_congs);
berghofe@5177
   689
skalberg@15570
   690
    val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms;
wenzelm@9386
   691
    val split_thms = split ~~ split_asm;
berghofe@5177
   692
nipkow@8601
   693
    val thy12 = thy11 |>
berghofe@14799
   694
      Theory.add_advanced_trfuns ([], [], make_case_tr' case_names' (hd descr), []) |>
berghofe@5661
   695
      Theory.add_path (space_implode "_" new_type_names) |>
oheimb@11345
   696
      add_rules simps case_thms size_thms rec_thms inject distinct
oheimb@11345
   697
                weak_case_congs Simplifier.cong_add_global |> 
skalberg@15574
   698
      put_datatypes (foldr Symtab.update dt_info dt_infos) |>
wenzelm@11805
   699
      add_cases_induct dt_infos induct |>
wenzelm@9386
   700
      Theory.parent_path |>
berghofe@13466
   701
      (#1 o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms)) |>
berghofe@13466
   702
      DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos);
berghofe@5177
   703
  in
nipkow@8601
   704
    (thy12,
berghofe@5177
   705
     {distinct = distinct,
berghofe@5177
   706
      inject = inject,
berghofe@5177
   707
      exhaustion = exhaustion,
berghofe@5177
   708
      rec_thms = rec_thms,
berghofe@5177
   709
      case_thms = case_thms,
wenzelm@9386
   710
      split_thms = split_thms,
berghofe@5177
   711
      induction = induct,
berghofe@5177
   712
      size = size_thms,
berghofe@5177
   713
      simps = simps})
berghofe@5177
   714
  end;
berghofe@5177
   715
berghofe@5177
   716
berghofe@5177
   717
(******************* definitional introduction of datatypes *******************)
berghofe@5177
   718
wenzelm@8437
   719
fun add_datatype_def flat_names new_type_names descr sorts types_syntax constr_syntax dt_info
wenzelm@8437
   720
    case_names_induct case_names_exhausts thy =
berghofe@5177
   721
  let
wenzelm@6360
   722
    val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names);
berghofe@5177
   723
berghofe@7015
   724
    val (thy2, inject, distinct, dist_rewrites, simproc_dists, induct) = thy |>
berghofe@5661
   725
      DatatypeRepProofs.representation_proofs flat_names dt_info new_type_names descr sorts
wenzelm@8437
   726
        types_syntax constr_syntax case_names_induct;
berghofe@5177
   727
wenzelm@8437
   728
    val (thy3, casedist_thms) = DatatypeAbsProofs.prove_casedist_thms new_type_names descr
wenzelm@8437
   729
      sorts induct case_names_exhausts thy2;
berghofe@8478
   730
    val (thy4, (reccomb_names, rec_thms)) = DatatypeAbsProofs.prove_primrec_thms
berghofe@7015
   731
      flat_names new_type_names descr sorts dt_info inject dist_rewrites dist_ss induct thy3;
wenzelm@8437
   732
    val (thy6, (case_thms, case_names)) = DatatypeAbsProofs.prove_case_thms
berghofe@5661
   733
      flat_names new_type_names descr sorts reccomb_names rec_thms thy4;
berghofe@5177
   734
    val (thy7, split_thms) = DatatypeAbsProofs.prove_split_thms new_type_names
berghofe@5177
   735
      descr sorts inject dist_rewrites casedist_thms case_thms thy6;
berghofe@5177
   736
    val (thy8, nchotomys) = DatatypeAbsProofs.prove_nchotomys new_type_names
berghofe@5177
   737
      descr sorts casedist_thms thy7;
berghofe@5177
   738
    val (thy9, case_congs) = DatatypeAbsProofs.prove_case_congs new_type_names
berghofe@5177
   739
      descr sorts nchotomys case_thms thy8;
nipkow@8601
   740
    val (thy10, weak_case_congs) = DatatypeAbsProofs.prove_weak_case_congs new_type_names
nipkow@8601
   741
      descr sorts thy9;
nipkow@8601
   742
    val (thy11, size_thms) = DatatypeAbsProofs.prove_size_thms flat_names new_type_names
nipkow@8601
   743
      descr sorts reccomb_names rec_thms thy10;
berghofe@5177
   744
skalberg@15570
   745
    val dt_infos = map (make_dt_info (List.concat descr) induct reccomb_names rec_thms)
berghofe@5177
   746
      ((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names ~~ case_thms ~~
wenzelm@10121
   747
        casedist_thms ~~ simproc_dists ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs);
berghofe@5177
   748
skalberg@15570
   749
    val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms;
berghofe@5177
   750
nipkow@8601
   751
    val thy12 = thy11 |>
berghofe@14799
   752
      Theory.add_advanced_trfuns ([], [], make_case_tr' case_names (hd descr), []) |>
berghofe@5661
   753
      Theory.add_path (space_implode "_" new_type_names) |>
oheimb@11345
   754
      add_rules simps case_thms size_thms rec_thms inject distinct
oheimb@11345
   755
                weak_case_congs (Simplifier.change_global_ss (op addcongs)) |> 
skalberg@15574
   756
      put_datatypes (foldr Symtab.update dt_info dt_infos) |>
wenzelm@11805
   757
      add_cases_induct dt_infos induct |>
wenzelm@9386
   758
      Theory.parent_path |>
berghofe@13466
   759
      (#1 o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms)) |>
berghofe@13466
   760
      DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos);
berghofe@5177
   761
  in
nipkow@8601
   762
    (thy12,
berghofe@5177
   763
     {distinct = distinct,
berghofe@5177
   764
      inject = inject,
berghofe@5177
   765
      exhaustion = casedist_thms,
berghofe@5177
   766
      rec_thms = rec_thms,
berghofe@5177
   767
      case_thms = case_thms,
berghofe@5177
   768
      split_thms = split_thms,
berghofe@5177
   769
      induction = induct,
berghofe@5177
   770
      size = size_thms,
berghofe@5177
   771
      simps = simps})
berghofe@5177
   772
  end;
berghofe@5177
   773
berghofe@5177
   774
wenzelm@6385
   775
(*********************** declare existing type as datatype *********************)
berghofe@5177
   776
wenzelm@6385
   777
fun gen_rep_datatype apply_theorems alt_names raw_distinct raw_inject raw_induction thy0 =
berghofe@5177
   778
  let
wenzelm@12922
   779
    val _ = Theory.requires thy0 "Inductive" "datatype representations";
wenzelm@12922
   780
wenzelm@6385
   781
    fun app_thmss srcs thy = foldl_map (fn (thy, x) => apply_theorems x thy) (thy, srcs);
skalberg@15570
   782
    fun app_thm src thy = apsnd hd (apply_theorems [src] thy);
wenzelm@6385
   783
wenzelm@6385
   784
    val (((thy1, induction), inject), distinct) = thy0
wenzelm@6385
   785
      |> app_thmss raw_distinct
wenzelm@6385
   786
      |> apfst (app_thmss raw_inject)
wenzelm@6385
   787
      |> apfst (apfst (app_thm raw_induction));
wenzelm@6394
   788
    val sign = Theory.sign_of thy1;
berghofe@5177
   789
berghofe@5177
   790
    val induction' = freezeT induction;
berghofe@5177
   791
berghofe@5177
   792
    fun err t = error ("Ill-formed predicate in induction rule: " ^
berghofe@5177
   793
      Sign.string_of_term sign t);
berghofe@5177
   794
berghofe@5177
   795
    fun get_typ (t as _ $ Var (_, Type (tname, Ts))) =
berghofe@7015
   796
          ((tname, map dest_TFree Ts) handle TERM _ => err t)
berghofe@5177
   797
      | get_typ t = err t;
berghofe@5177
   798
wenzelm@8437
   799
    val dtnames = map get_typ (HOLogic.dest_conj (HOLogic.dest_Trueprop (Thm.concl_of induction')));
skalberg@15570
   800
    val new_type_names = getOpt (alt_names, map fst dtnames);
berghofe@5177
   801
berghofe@5177
   802
    fun get_constr t = (case Logic.strip_assums_concl t of
berghofe@5177
   803
        _ $ (_ $ t') => (case head_of t' of
berghofe@5177
   804
            Const (cname, cT) => (case strip_type cT of
berghofe@5177
   805
                (Ts, Type (tname, _)) => (tname, (cname, map (dtyp_of_typ dtnames) Ts))
berghofe@5177
   806
              | _ => err t)
berghofe@5177
   807
          | _ => err t)
berghofe@5177
   808
      | _ => err t);
berghofe@5177
   809
berghofe@5177
   810
    fun make_dt_spec [] _ _ = []
berghofe@5177
   811
      | make_dt_spec ((tname, tvs)::dtnames') i constrs =
berghofe@5177
   812
          let val (constrs', constrs'') = take_prefix (equal tname o fst) constrs
berghofe@5177
   813
          in (i, (tname, map DtTFree tvs, map snd constrs'))::
berghofe@5177
   814
            (make_dt_spec dtnames' (i + 1) constrs'')
berghofe@5177
   815
          end;
berghofe@5177
   816
berghofe@5177
   817
    val descr = make_dt_spec dtnames 0 (map get_constr (prems_of induction'));
berghofe@5177
   818
    val sorts = add_term_tfrees (concl_of induction', []);
wenzelm@6385
   819
    val dt_info = get_datatypes thy1;
berghofe@5177
   820
wenzelm@8437
   821
    val case_names_induct = mk_case_names_induct descr;
wenzelm@8437
   822
    val case_names_exhausts = mk_case_names_exhausts descr (map #1 dtnames);
wenzelm@8437
   823
    
wenzelm@8437
   824
wenzelm@6427
   825
    val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names);
berghofe@5177
   826
wenzelm@6385
   827
    val (thy2, casedist_thms) = thy1 |>
wenzelm@8437
   828
      DatatypeAbsProofs.prove_casedist_thms new_type_names [descr] sorts induction
wenzelm@8437
   829
        case_names_exhausts;
berghofe@8478
   830
    val (thy3, (reccomb_names, rec_thms)) = DatatypeAbsProofs.prove_primrec_thms
berghofe@7015
   831
      false new_type_names [descr] sorts dt_info inject distinct dist_ss induction thy2;
wenzelm@8437
   832
    val (thy4, (case_thms, case_names)) = DatatypeAbsProofs.prove_case_thms false
berghofe@5177
   833
      new_type_names [descr] sorts reccomb_names rec_thms thy3;
berghofe@5177
   834
    val (thy5, split_thms) = DatatypeAbsProofs.prove_split_thms
berghofe@5177
   835
      new_type_names [descr] sorts inject distinct casedist_thms case_thms thy4;
berghofe@5177
   836
    val (thy6, nchotomys) = DatatypeAbsProofs.prove_nchotomys new_type_names
berghofe@5177
   837
      [descr] sorts casedist_thms thy5;
berghofe@5177
   838
    val (thy7, case_congs) = DatatypeAbsProofs.prove_case_congs new_type_names
berghofe@5177
   839
      [descr] sorts nchotomys case_thms thy6;
nipkow@8601
   840
    val (thy8, weak_case_congs) = DatatypeAbsProofs.prove_weak_case_congs new_type_names
nipkow@8601
   841
      [descr] sorts thy7;
nipkow@8601
   842
    val (thy9, size_thms) =
wenzelm@10930
   843
      if Sign.exists_stamp "NatArith" (Theory.sign_of thy8) then
berghofe@5661
   844
        DatatypeAbsProofs.prove_size_thms false new_type_names
nipkow@8601
   845
          [descr] sorts reccomb_names rec_thms thy8
nipkow@8601
   846
      else (thy8, []);
berghofe@5177
   847
wenzelm@9149
   848
    val (thy10, [induction']) = thy9 |>
wenzelm@9149
   849
      (#1 o store_thmss "inject" new_type_names inject) |>
wenzelm@9149
   850
      (#1 o store_thmss "distinct" new_type_names distinct) |>
wenzelm@9149
   851
      Theory.add_path (space_implode "_" new_type_names) |>
wenzelm@9149
   852
      PureThy.add_thms [(("induct", induction), [case_names_induct])];
wenzelm@9149
   853
wenzelm@9149
   854
    val dt_infos = map (make_dt_info descr induction' reccomb_names rec_thms)
wenzelm@10121
   855
      ((0 upto length descr - 1) ~~ descr ~~ case_names ~~ case_thms ~~ casedist_thms ~~
wenzelm@10121
   856
        map FewConstrs distinct ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs);
berghofe@5177
   857
skalberg@15570
   858
    val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms;
berghofe@5177
   859
wenzelm@9149
   860
    val thy11 = thy10 |>
berghofe@14799
   861
      Theory.add_advanced_trfuns ([], [], make_case_tr' case_names descr, []) |>
oheimb@11345
   862
      add_rules simps case_thms size_thms rec_thms inject distinct
oheimb@11345
   863
                weak_case_congs (Simplifier.change_global_ss (op addcongs)) |> 
skalberg@15574
   864
      put_datatypes (foldr Symtab.update dt_info dt_infos) |>
wenzelm@11805
   865
      add_cases_induct dt_infos induction' |>
wenzelm@9386
   866
      Theory.parent_path |>
berghofe@13466
   867
      (#1 o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms)) |>
berghofe@13466
   868
      DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos);
berghofe@5177
   869
  in
wenzelm@9149
   870
    (thy11,
berghofe@5177
   871
     {distinct = distinct,
berghofe@5177
   872
      inject = inject,
berghofe@5177
   873
      exhaustion = casedist_thms,
berghofe@5177
   874
      rec_thms = rec_thms,
berghofe@5177
   875
      case_thms = case_thms,
berghofe@5177
   876
      split_thms = split_thms,
wenzelm@8437
   877
      induction = induction',
berghofe@5177
   878
      size = size_thms,
berghofe@5177
   879
      simps = simps})
berghofe@5177
   880
  end;
berghofe@5177
   881
wenzelm@6385
   882
val rep_datatype = gen_rep_datatype IsarThy.apply_theorems;
wenzelm@6385
   883
val rep_datatype_i = gen_rep_datatype IsarThy.apply_theorems_i;
wenzelm@6385
   884
berghofe@5177
   885
wenzelm@11958
   886
berghofe@5177
   887
(******************************** add datatype ********************************)
berghofe@5177
   888
berghofe@14887
   889
fun gen_add_datatype prep_typ err flat_names new_type_names dts thy =
berghofe@5177
   890
  let
wenzelm@12922
   891
    val _ = Theory.requires thy "Datatype_Universe" "datatype definitions";
berghofe@5177
   892
berghofe@5177
   893
    (* this theory is used just for parsing *)
berghofe@5177
   894
berghofe@5177
   895
    val tmp_thy = thy |>
wenzelm@5892
   896
      Theory.copy |>
berghofe@5177
   897
      Theory.add_types (map (fn (tvs, tname, mx, _) =>
berghofe@5177
   898
        (tname, length tvs, mx)) dts);
berghofe@5177
   899
wenzelm@6394
   900
    val sign = Theory.sign_of tmp_thy;
berghofe@5177
   901
berghofe@5661
   902
    val (tyvars, _, _, _)::_ = dts;
berghofe@5177
   903
    val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) =>
berghofe@5177
   904
      let val full_tname = Sign.full_name sign (Syntax.type_name tname mx)
berghofe@5177
   905
      in (case duplicates tvs of
berghofe@5661
   906
            [] => if eq_set (tyvars, tvs) then ((full_tname, tvs), (tname, mx))
berghofe@5661
   907
                  else error ("Mutually recursive datatypes must have same type parameters")
berghofe@5177
   908
          | dups => error ("Duplicate parameter(s) for datatype " ^ full_tname ^
berghofe@5177
   909
              " : " ^ commas dups))
berghofe@5177
   910
      end) dts);
berghofe@5177
   911
berghofe@5177
   912
    val _ = (case duplicates (map fst new_dts) @ duplicates new_type_names of
berghofe@5177
   913
      [] => () | dups => error ("Duplicate datatypes: " ^ commas dups));
berghofe@5177
   914
berghofe@5177
   915
    fun prep_dt_spec ((dts', constr_syntax, sorts, i), (tvs, tname, mx, constrs)) =
berghofe@5177
   916
      let
berghofe@5661
   917
        fun prep_constr ((constrs, constr_syntax', sorts'), (cname, cargs, mx')) =
berghofe@5279
   918
          let
skalberg@15570
   919
            val (cargs', sorts'') = Library.foldl (prep_typ sign) (([], sorts'), cargs);
skalberg@15574
   920
            val _ = (case foldr add_typ_tfree_names [] cargs' \\ tvs of
berghofe@5279
   921
                [] => ()
berghofe@5279
   922
              | vs => error ("Extra type variables on rhs: " ^ commas vs))
berghofe@5661
   923
          in (constrs @ [((if flat_names then Sign.full_name sign else
berghofe@5661
   924
                Sign.full_name_path sign tname) (Syntax.const_name cname mx'),
berghofe@5177
   925
                   map (dtyp_of_typ new_dts) cargs')],
berghofe@5177
   926
              constr_syntax' @ [(cname, mx')], sorts'')
berghofe@5177
   927
          end handle ERROR =>
berghofe@5177
   928
            error ("The error above occured in constructor " ^ cname ^
berghofe@5177
   929
              " of datatype " ^ tname);
berghofe@5177
   930
berghofe@5177
   931
        val (constrs', constr_syntax', sorts') =
skalberg@15570
   932
          Library.foldl prep_constr (([], [], sorts), constrs)
berghofe@5177
   933
wenzelm@8405
   934
      in
berghofe@5177
   935
        case duplicates (map fst constrs') of
berghofe@5177
   936
           [] =>
berghofe@5177
   937
             (dts' @ [(i, (Sign.full_name sign (Syntax.type_name tname mx),
berghofe@5177
   938
                map DtTFree tvs, constrs'))],
berghofe@5177
   939
              constr_syntax @ [constr_syntax'], sorts', i + 1)
berghofe@5177
   940
         | dups => error ("Duplicate constructors " ^ commas dups ^
berghofe@5177
   941
             " in datatype " ^ tname)
berghofe@5177
   942
      end;
berghofe@5177
   943
skalberg@15570
   944
    val (dts', constr_syntax, sorts', i) = Library.foldl prep_dt_spec (([], [], [], 0), dts);
berghofe@7015
   945
    val sorts = sorts' @ (map (rpair (Sign.defaultS sign)) (tyvars \\ map fst sorts'));
berghofe@5177
   946
    val dt_info = get_datatypes thy;
berghofe@7015
   947
    val (descr, _) = unfold_datatypes sign dts' sorts dt_info dts' i;
berghofe@14887
   948
    val _ = check_nonempty descr handle (exn as Datatype_Empty s) =>
wenzelm@15661
   949
      if err then error ("Nonemptiness check failed for datatype " ^ s)
berghofe@14887
   950
      else raise exn;
berghofe@5177
   951
skalberg@15570
   952
    val descr' = List.concat descr;
wenzelm@8437
   953
    val case_names_induct = mk_case_names_induct descr';
wenzelm@8437
   954
    val case_names_exhausts = mk_case_names_exhausts descr' (map #1 new_dts);
berghofe@5177
   955
  in
berghofe@5177
   956
    (if (!quick_and_dirty) then add_datatype_axm else add_datatype_def)
wenzelm@8437
   957
      flat_names new_type_names descr sorts types_syntax constr_syntax dt_info
wenzelm@8437
   958
      case_names_induct case_names_exhausts thy
berghofe@5177
   959
  end;
berghofe@5177
   960
berghofe@5177
   961
val add_datatype_i = gen_add_datatype cert_typ;
berghofe@14887
   962
val add_datatype = gen_add_datatype read_typ true;
berghofe@5177
   963
wenzelm@6360
   964
wenzelm@6360
   965
(** package setup **)
wenzelm@6360
   966
wenzelm@6360
   967
(* setup theory *)
wenzelm@6360
   968
berghofe@14799
   969
val setup = [DatatypesData.init, Method.add_methods tactic_emulations] @ simproc_setup @ trfun_setup;
wenzelm@6360
   970
wenzelm@6360
   971
wenzelm@6360
   972
(* outer syntax *)
wenzelm@6360
   973
wenzelm@6723
   974
local structure P = OuterParse and K = OuterSyntax.Keyword in
wenzelm@6360
   975
wenzelm@6360
   976
val datatype_decl =
wenzelm@6723
   977
  Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") -- P.type_args -- P.name -- P.opt_infix --
wenzelm@12876
   978
    (P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix));
wenzelm@6360
   979
wenzelm@6360
   980
fun mk_datatype args =
wenzelm@6360
   981
  let
skalberg@15531
   982
    val names = map (fn ((((NONE, _), t), _), _) => t | ((((SOME t, _), _), _), _) => t) args;
wenzelm@12876
   983
    val specs = map (fn ((((_, vs), t), mx), cons) =>
wenzelm@12876
   984
      (vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args;
wenzelm@6360
   985
  in #1 o add_datatype false names specs end;
wenzelm@6360
   986
wenzelm@6360
   987
val datatypeP =
wenzelm@6723
   988
  OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl
wenzelm@6723
   989
    (P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype));
wenzelm@6360
   990
wenzelm@6385
   991
wenzelm@6385
   992
val rep_datatype_decl =
wenzelm@6723
   993
  Scan.option (Scan.repeat1 P.name) --
wenzelm@11958
   994
    Scan.optional (P.$$$ "distinct" |-- P.!!! (P.and_list1 P.xthms1)) [[]] --
wenzelm@11958
   995
    Scan.optional (P.$$$ "inject" |-- P.!!! (P.and_list1 P.xthms1)) [[]] --
wenzelm@6723
   996
    (P.$$$ "induction" |-- P.!!! P.xthm);
wenzelm@6385
   997
wenzelm@6385
   998
fun mk_rep_datatype (((opt_ts, dss), iss), ind) = #1 o rep_datatype opt_ts dss iss ind;
wenzelm@6385
   999
wenzelm@6385
  1000
val rep_datatypeP =
wenzelm@6723
  1001
  OuterSyntax.command "rep_datatype" "represent existing types inductively" K.thy_decl
wenzelm@6385
  1002
    (rep_datatype_decl >> (Toplevel.theory o mk_rep_datatype));
wenzelm@6385
  1003
wenzelm@6385
  1004
wenzelm@6479
  1005
val _ = OuterSyntax.add_keywords ["distinct", "inject", "induction"];
wenzelm@6385
  1006
val _ = OuterSyntax.add_parsers [datatypeP, rep_datatypeP];
wenzelm@6385
  1007
wenzelm@6385
  1008
end;
wenzelm@6385
  1009
wenzelm@6360
  1010
berghofe@5177
  1011
end;
berghofe@5177
  1012
wenzelm@6360
  1013
structure BasicDatatypePackage: BASIC_DATATYPE_PACKAGE = DatatypePackage;
wenzelm@6360
  1014
open BasicDatatypePackage;
wenzelm@15704
  1015