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