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