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