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