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