src/HOL/Tools/datatype_package.ML
author wenzelm
Thu Oct 19 21:23:47 2000 +0200 (2000-10-19)
changeset 10279 b223a9a3350e
parent 10214 77349ed89f45
child 10525 3e21ab3e5114
permissions -rw-r--r--
InductAttrib;
berghofe@5177
     1
(*  Title:      HOL/Tools/datatype_package.ML
berghofe@5177
     2
    ID:         $Id$
berghofe@5177
     3
    Author:     Stefan Berghofer
berghofe@5177
     4
    Copyright   1998  TU Muenchen
berghofe@5177
     5
wenzelm@6360
     6
Datatype package for Isabelle/HOL.
berghofe@5177
     7
*)
berghofe@5177
     8
wenzelm@6360
     9
signature BASIC_DATATYPE_PACKAGE =
wenzelm@6360
    10
sig
wenzelm@6360
    11
  val induct_tac : string -> int -> tactic
nipkow@9747
    12
  val induct_thm_tac : thm -> string -> int -> tactic
wenzelm@8437
    13
  val case_tac : string -> int -> tactic
berghofe@7015
    14
  val distinct_simproc : simproc
wenzelm@6360
    15
end;
wenzelm@6360
    16
berghofe@5177
    17
signature DATATYPE_PACKAGE =
berghofe@5177
    18
sig
wenzelm@6360
    19
  include BASIC_DATATYPE_PACKAGE
berghofe@5661
    20
  val quiet_mode : bool ref
berghofe@5661
    21
  val add_datatype : bool -> string list -> (string list * bstring * mixfix *
berghofe@5661
    22
    (bstring * string list * mixfix) list) list -> theory -> theory *
berghofe@5177
    23
      {distinct : thm list list,
berghofe@5177
    24
       inject : thm list list,
berghofe@5177
    25
       exhaustion : thm list,
berghofe@5177
    26
       rec_thms : thm list,
berghofe@5177
    27
       case_thms : thm list list,
berghofe@5177
    28
       split_thms : (thm * thm) list,
berghofe@5177
    29
       induction : thm,
berghofe@5177
    30
       size : thm list,
berghofe@5177
    31
       simps : thm list}
berghofe@5661
    32
  val add_datatype_i : bool -> string list -> (string list * bstring * mixfix *
berghofe@5661
    33
    (bstring * typ list * mixfix) list) list -> theory -> theory *
berghofe@5177
    34
      {distinct : thm list list,
berghofe@5177
    35
       inject : thm list list,
berghofe@5177
    36
       exhaustion : thm list,
berghofe@5177
    37
       rec_thms : thm list,
berghofe@5177
    38
       case_thms : thm list list,
berghofe@5177
    39
       split_thms : (thm * thm) list,
berghofe@5177
    40
       induction : thm,
berghofe@5177
    41
       size : thm list,
berghofe@5177
    42
       simps : thm list}
wenzelm@6385
    43
  val rep_datatype_i : string list option -> (thm * theory attribute list) list list ->
wenzelm@6385
    44
    (thm * theory attribute list) list list -> (thm * theory attribute list) -> theory -> 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,
wenzelm@6385
    53
       simps : thm list}
wenzelm@6385
    54
  val rep_datatype : string list option -> (xstring * Args.src list) list list ->
wenzelm@6385
    55
    (xstring * Args.src list) list list -> xstring * Args.src list -> theory -> 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,
berghofe@5177
    64
       simps : thm list}
berghofe@5177
    65
  val get_datatypes : theory -> DatatypeAux.datatype_info Symtab.table
wenzelm@10121
    66
  val get_datatypes_sg : Sign.sg -> DatatypeAux.datatype_info Symtab.table
wenzelm@6441
    67
  val print_datatypes : theory -> unit
berghofe@7015
    68
  val datatype_info_sg : Sign.sg -> string -> DatatypeAux.datatype_info option
berghofe@7015
    69
  val datatype_info : theory -> string -> DatatypeAux.datatype_info option
berghofe@7015
    70
  val datatype_info_sg_err : Sign.sg -> string -> DatatypeAux.datatype_info
berghofe@7015
    71
  val datatype_info_err : theory -> string -> DatatypeAux.datatype_info
berghofe@5177
    72
  val constrs_of : theory -> string -> term list option
berghofe@7015
    73
  val constrs_of_sg : Sign.sg -> string -> term list option
berghofe@5177
    74
  val case_const_of : theory -> string -> term option
wenzelm@10121
    75
  val weak_case_congs_of : theory -> thm list
wenzelm@10121
    76
  val weak_case_congs_of_sg : Sign.sg -> thm list
wenzelm@6360
    77
  val setup: (theory -> theory) list
berghofe@5177
    78
end;
berghofe@5177
    79
berghofe@5177
    80
structure DatatypePackage : DATATYPE_PACKAGE =
berghofe@5177
    81
struct
berghofe@5177
    82
berghofe@5177
    83
open DatatypeAux;
berghofe@5177
    84
berghofe@5661
    85
val quiet_mode = quiet_mode;
berghofe@5661
    86
wenzelm@6360
    87
berghofe@5177
    88
(* data kind 'HOL/datatypes' *)
berghofe@5177
    89
berghofe@5177
    90
structure DatatypesArgs =
berghofe@5177
    91
struct
berghofe@5177
    92
  val name = "HOL/datatypes";
berghofe@5177
    93
  type T = datatype_info Symtab.table;
berghofe@5177
    94
berghofe@5177
    95
  val empty = Symtab.empty;
wenzelm@6556
    96
  val copy = I;
berghofe@5177
    97
  val prep_ext = I;
berghofe@5177
    98
  val merge: T * T -> T = Symtab.merge (K true);
berghofe@5177
    99
berghofe@5177
   100
  fun print sg tab =
berghofe@5177
   101
    Pretty.writeln (Pretty.strs ("datatypes:" ::
wenzelm@6851
   102
      map #1 (Sign.cond_extern_table sg Sign.typeK tab)));
berghofe@5177
   103
end;
berghofe@5177
   104
berghofe@5177
   105
structure DatatypesData = TheoryDataFun(DatatypesArgs);
berghofe@5177
   106
val get_datatypes_sg = DatatypesData.get_sg;
berghofe@5177
   107
val get_datatypes = DatatypesData.get;
berghofe@5177
   108
val put_datatypes = DatatypesData.put;
wenzelm@6441
   109
val print_datatypes = DatatypesData.print;
berghofe@5177
   110
berghofe@5177
   111
berghofe@5177
   112
(** theory information about datatypes **)
berghofe@5177
   113
berghofe@7015
   114
fun datatype_info_sg sg name = Symtab.lookup (get_datatypes_sg sg, name);
berghofe@7015
   115
berghofe@7015
   116
fun datatype_info_sg_err sg name = (case datatype_info_sg sg name of
berghofe@7015
   117
      Some info => info
berghofe@7015
   118
    | None => error ("Unknown datatype " ^ quote name));
berghofe@5177
   119
wenzelm@6394
   120
val datatype_info = datatype_info_sg o Theory.sign_of;
berghofe@5177
   121
berghofe@7015
   122
fun datatype_info_err thy name = (case datatype_info thy name of
berghofe@7015
   123
      Some info => info
berghofe@7015
   124
    | None => error ("Unknown datatype " ^ quote name));
berghofe@5177
   125
berghofe@7015
   126
fun constrs_of_sg sg tname = (case datatype_info_sg sg tname of
berghofe@7015
   127
   Some {index, descr, ...} =>
berghofe@7015
   128
     let val (_, _, constrs) = the (assoc (descr, index))
berghofe@7015
   129
     in Some (map (fn (cname, _) => Const (cname, the (Sign.const_type sg cname))) constrs)
berghofe@7015
   130
     end
berghofe@7015
   131
 | _ => None);
berghofe@7015
   132
berghofe@7015
   133
val constrs_of = constrs_of_sg o Theory.sign_of;
berghofe@7015
   134
berghofe@7015
   135
fun case_const_of thy tname = (case datatype_info thy tname of
berghofe@7015
   136
   Some {case_name, ...} => Some (Const (case_name, the (Sign.const_type
berghofe@7015
   137
     (Theory.sign_of thy) case_name)))
berghofe@7015
   138
 | _ => None);
berghofe@5177
   139
wenzelm@10121
   140
val weak_case_congs_of_sg = map (#weak_case_cong o #2) o Symtab.dest o get_datatypes_sg;
wenzelm@10121
   141
val weak_case_congs_of = weak_case_congs_of_sg o Theory.sign_of;
wenzelm@10121
   142
berghofe@5177
   143
fun find_tname var Bi =
berghofe@5177
   144
  let val frees = map dest_Free (term_frees Bi)
berghofe@5177
   145
      val params = Logic.strip_params Bi;
berghofe@5177
   146
  in case assoc (frees @ params, var) of
berghofe@5177
   147
       None => error ("No such variable in subgoal: " ^ quote var)
berghofe@5177
   148
     | Some(Type (tn, _)) => tn
berghofe@5177
   149
     | _ => error ("Cannot determine type of " ^ quote var)
berghofe@5177
   150
  end;
berghofe@5177
   151
wenzelm@8279
   152
fun infer_tname state i aterm =
berghofe@5177
   153
  let
wenzelm@8279
   154
    val sign = Thm.sign_of_thm state;
wenzelm@8279
   155
    val (_, _, Bi, _) = Thm.dest_state (state, i)
berghofe@5177
   156
    val params = Logic.strip_params Bi;   (*params of subgoal i*)
berghofe@5177
   157
    val params = rev (rename_wrt_term Bi params);   (*as they are printed*)
berghofe@5177
   158
    val (types, sorts) = types_sorts state;
berghofe@5177
   159
    fun types' (a, ~1) = (case assoc (params, a) of None => types(a, ~1) | sm => sm)
berghofe@5177
   160
      | types' ixn = types ixn;
wenzelm@8100
   161
    val (ct, _) = read_def_cterm (sign, types', sorts) [] false (aterm, TypeInfer.logicT);
berghofe@5177
   162
  in case #T (rep_cterm ct) of
berghofe@5177
   163
       Type (tn, _) => tn
berghofe@5177
   164
     | _ => error ("Cannot determine type of " ^ quote aterm)
berghofe@5177
   165
  end;
berghofe@5177
   166
berghofe@5177
   167
(*Warn if the (induction) variable occurs Free among the premises, which
berghofe@5177
   168
  usually signals a mistake.  But calls the tactic either way!*)
wenzelm@8405
   169
fun occs_in_prems tacf vars =
berghofe@5177
   170
  SUBGOAL (fn (Bi, i) =>
wenzelm@8405
   171
           (if  exists (fn Free (a, _) => a mem vars)
wenzelm@8405
   172
                      (foldr add_term_frees (#2 (strip_context Bi), []))
wenzelm@8405
   173
             then warning "Induction variable occurs also among premises!"
wenzelm@8405
   174
             else ();
wenzelm@8405
   175
            tacf i));
berghofe@5177
   176
wenzelm@8689
   177
berghofe@5177
   178
(* generic induction tactic for datatypes *)
berghofe@5177
   179
wenzelm@8689
   180
local
wenzelm@8689
   181
wenzelm@8689
   182
fun prep_var (Var (ixn, _), Some x) = Some (implode (tl (explode (Syntax.string_of_vname ixn))), x)
wenzelm@8689
   183
  | prep_var _ = None;
wenzelm@8689
   184
wenzelm@8689
   185
fun prep_inst (concl, xs) =	(*exception LIST*)
wenzelm@8689
   186
  let val vs = InductMethod.vars_of concl
wenzelm@8689
   187
  in mapfilter prep_var (Library.drop (length vs - length xs, vs) ~~ xs) end;
wenzelm@8689
   188
wenzelm@8689
   189
in
wenzelm@8689
   190
wenzelm@8689
   191
fun gen_induct_tac (varss, opt_rule) i state =
berghofe@5177
   192
  let
wenzelm@8689
   193
    val (_, _, Bi, _) = Thm.dest_state (state, i);
wenzelm@8689
   194
    val {sign, ...} = Thm.rep_thm state;
wenzelm@8672
   195
    val (rule, rule_name) =
wenzelm@8672
   196
      (case opt_rule of
wenzelm@8672
   197
        Some r => (r, "Induction rule")
wenzelm@8672
   198
      | None =>
wenzelm@8689
   199
          let val tn = find_tname (hd (mapfilter I (flat varss))) Bi
wenzelm@8672
   200
          in (#induction (datatype_info_sg_err sign tn), "Induction rule for type " ^ tn) end);
wenzelm@8672
   201
wenzelm@8697
   202
    val concls = InductMethod.concls_of rule;
wenzelm@8697
   203
    val insts = flat (map prep_inst (concls ~~ varss)) handle LIST _ =>
wenzelm@8689
   204
      error (rule_name ^ " has different numbers of variables");
wenzelm@8689
   205
  in occs_in_prems (Tactic.res_inst_tac insts rule) (map #2 insts) i state end;
wenzelm@8689
   206
wenzelm@8689
   207
fun induct_tac s = gen_induct_tac (map (Library.single o Some) (Syntax.read_idents s), None);
wenzelm@8689
   208
nipkow@9747
   209
fun induct_thm_tac th s =
nipkow@9747
   210
  gen_induct_tac ([map Some (Syntax.read_idents s)], Some th);
nipkow@9747
   211
wenzelm@8689
   212
end;
berghofe@5177
   213
wenzelm@8279
   214
wenzelm@8437
   215
(* generic case tactic for datatypes *)
berghofe@5177
   216
wenzelm@8672
   217
fun case_inst_tac t rule i state =
wenzelm@8672
   218
  let
wenzelm@8672
   219
    val _ $ Var (ixn, _) $ _ = HOLogic.dest_Trueprop
wenzelm@8672
   220
      (hd (Logic.strip_assums_hyp (hd (Thm.prems_of rule))));
wenzelm@8672
   221
    val exh_vname = implode (tl (explode (Syntax.string_of_vname ixn)));
wenzelm@8672
   222
  in Tactic.res_inst_tac [(exh_vname, t)] rule i state end;
wenzelm@8672
   223
wenzelm@8672
   224
fun gen_case_tac (t, Some rule) i state = case_inst_tac t rule i state
wenzelm@8672
   225
  | gen_case_tac (t, None) i state =
wenzelm@8672
   226
      let val tn = infer_tname state i t in
wenzelm@8672
   227
        if tn = HOLogic.boolN then Tactic.res_inst_tac [("P", t)] case_split_thm i state
wenzelm@8672
   228
        else case_inst_tac t (#exhaustion (datatype_info_sg_err (Thm.sign_of_thm state) tn)) i state
wenzelm@8672
   229
      end;
wenzelm@8672
   230
wenzelm@8672
   231
fun case_tac t = gen_case_tac (t, None);
wenzelm@8672
   232
wenzelm@8279
   233
wenzelm@8279
   234
wenzelm@8541
   235
(** Isar tactic emulations **)
wenzelm@8541
   236
wenzelm@8672
   237
local
wenzelm@8672
   238
wenzelm@8689
   239
val rule_spec = Scan.lift (Args.$$$ "rule" -- Args.$$$ ":");
wenzelm@8689
   240
val opt_rule = Scan.option (rule_spec |-- Attrib.local_thm);
wenzelm@8689
   241
wenzelm@8689
   242
val varss = Args.and_list (Scan.repeat (Scan.unless rule_spec (Scan.lift Args.name_dummy)));
wenzelm@8672
   243
wenzelm@8672
   244
in
wenzelm@8541
   245
wenzelm@8541
   246
val tactic_emulations =
wenzelm@9704
   247
 [("induct_tac", Method.goal_args' (varss -- opt_rule) gen_induct_tac,
wenzelm@8672
   248
    "induct_tac emulation (dynamic instantiation!)"),
wenzelm@9704
   249
  ("case_tac", Method.goal_args' (Scan.lift Args.name -- opt_rule) gen_case_tac,
wenzelm@8672
   250
    "case_tac emulation (dynamic instantiation!)")];
wenzelm@8672
   251
wenzelm@8672
   252
end;
wenzelm@8541
   253
wenzelm@8541
   254
berghofe@5177
   255
wenzelm@8437
   256
(** induct method setup **)
wenzelm@8437
   257
wenzelm@8437
   258
(* case names *)
wenzelm@8437
   259
wenzelm@8437
   260
local
wenzelm@8437
   261
wenzelm@8437
   262
fun dt_recs (DtTFree _) = []
wenzelm@8437
   263
  | dt_recs (DtType (_, dts)) = flat (map dt_recs dts)
wenzelm@8437
   264
  | dt_recs (DtRec i) = [i];
wenzelm@8437
   265
wenzelm@8437
   266
fun dt_cases (descr: descr) (_, args, constrs) =
wenzelm@8437
   267
  let
wenzelm@8437
   268
    fun the_bname i = Sign.base_name (#1 (the (assoc (descr, i))));
wenzelm@8437
   269
    val bnames = map the_bname (distinct (flat (map dt_recs args)));
wenzelm@8437
   270
  in map (fn (c, _) => space_implode "_" (Sign.base_name c :: bnames)) constrs end;
wenzelm@8437
   271
wenzelm@8437
   272
wenzelm@8437
   273
fun induct_cases descr =
wenzelm@8437
   274
  DatatypeProp.indexify_names (flat (map (dt_cases descr) (map #2 descr)));
wenzelm@8437
   275
wenzelm@8437
   276
fun exhaust_cases descr i = dt_cases descr (the (assoc (descr, i)));
wenzelm@8437
   277
wenzelm@8437
   278
in
wenzelm@8437
   279
wenzelm@8437
   280
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr);
wenzelm@8437
   281
wenzelm@8437
   282
fun mk_case_names_exhausts descr new =
wenzelm@8437
   283
  map (RuleCases.case_names o exhaust_cases descr o #1)
wenzelm@8437
   284
    (filter (fn ((_, (name, _, _))) => name mem_string new) descr);
wenzelm@8437
   285
wenzelm@8437
   286
end;
wenzelm@8437
   287
wenzelm@8437
   288
wenzelm@8437
   289
(* add_cases_induct *)
wenzelm@8306
   290
wenzelm@8306
   291
fun add_cases_induct infos =
wenzelm@8306
   292
  let
wenzelm@8325
   293
    fun proj _ 1 thm = thm
wenzelm@8325
   294
      | proj i n thm =
wenzelm@8325
   295
          (if i + 1 < n then (fn th => th RS conjunct1) else I)
wenzelm@8325
   296
            (Library.funpow i (fn th => th RS conjunct2) thm)
wenzelm@8672
   297
          |> Drule.standard
wenzelm@8672
   298
          |> RuleCases.name (RuleCases.get thm);
wenzelm@8405
   299
wenzelm@8325
   300
    fun add (ths, (name, {index, descr, induction, exhaustion, ...}: datatype_info)) =
wenzelm@10279
   301
      (("", proj index (length descr) induction), [InductAttrib.induct_type_global name]) ::
wenzelm@10279
   302
      (("", exhaustion), [InductAttrib.cases_type_global name]) :: ths;
wenzelm@8437
   303
  in #1 o PureThy.add_thms (foldl add ([], infos)) end;
wenzelm@8306
   304
berghofe@5177
   305
wenzelm@8405
   306
berghofe@7015
   307
(**** simplification procedure for showing distinctness of constructors ****)
berghofe@7015
   308
berghofe@7060
   309
fun stripT (i, Type ("fun", [_, T])) = stripT (i + 1, T)
berghofe@7060
   310
  | stripT p = p;
berghofe@7060
   311
berghofe@7060
   312
fun stripC (i, f $ x) = stripC (i + 1, f)
berghofe@7060
   313
  | stripC p = p;
berghofe@7060
   314
berghofe@7015
   315
val distinctN = "constr_distinct";
berghofe@7015
   316
berghofe@7015
   317
exception ConstrDistinct of term;
berghofe@7015
   318
berghofe@7015
   319
fun distinct_proc sg _ (t as Const ("op =", _) $ t1 $ t2) =
berghofe@7060
   320
  (case (stripC (0, t1), stripC (0, t2)) of
berghofe@7060
   321
     ((i, Const (cname1, T1)), (j, Const (cname2, T2))) =>
berghofe@7060
   322
         (case (stripT (0, T1), stripT (0, T2)) of
berghofe@7060
   323
            ((i', Type (tname1, _)), (j', Type (tname2, _))) =>
berghofe@7060
   324
                if tname1 = tname2 andalso not (cname1 = cname2) andalso i = i' andalso j = j' then
berghofe@7015
   325
                   (case (constrs_of_sg sg tname1) of
berghofe@7015
   326
                      Some constrs => let val cnames = map (fst o dest_Const) constrs
berghofe@7015
   327
                        in if cname1 mem cnames andalso cname2 mem cnames then
berghofe@7015
   328
                             let val eq_t = Logic.mk_equals (t, Const ("False", HOLogic.boolT));
berghofe@7015
   329
                                 val eq_ct = cterm_of sg eq_t;
berghofe@7015
   330
                                 val Datatype_thy = theory "Datatype";
berghofe@7015
   331
                                 val [In0_inject, In1_inject, In0_not_In1, In1_not_In0] =
berghofe@7015
   332
                                   map (get_thm Datatype_thy)
berghofe@7015
   333
                                     ["In0_inject", "In1_inject", "In0_not_In1", "In1_not_In0"]
berghofe@7015
   334
                             in (case (#distinct (datatype_info_sg_err sg tname1)) of
berghofe@7015
   335
                                 QuickAndDirty => Some (Thm.invoke_oracle
berghofe@7015
   336
                                   Datatype_thy distinctN (sg, ConstrDistinct eq_t))
berghofe@7015
   337
                               | FewConstrs thms => Some (prove_goalw_cterm [] eq_ct (K
berghofe@7015
   338
                                   [rtac eq_reflection 1, rtac iffI 1, rtac notE 1,
berghofe@7015
   339
                                    atac 2, resolve_tac thms 1, etac FalseE 1]))
berghofe@7015
   340
                               | ManyConstrs (thm, ss) => Some (prove_goalw_cterm [] eq_ct (K
berghofe@7015
   341
                                   [rtac eq_reflection 1, rtac iffI 1, dtac thm 1,
berghofe@7015
   342
                                    full_simp_tac ss 1,
berghofe@7015
   343
                                    REPEAT (dresolve_tac [In0_inject, In1_inject] 1),
berghofe@7015
   344
                                    eresolve_tac [In0_not_In1 RS notE, In1_not_In0 RS notE] 1,
berghofe@7015
   345
                                    etac FalseE 1])))
berghofe@7015
   346
                             end
berghofe@7015
   347
                           else None
berghofe@7015
   348
                        end
berghofe@7015
   349
                    | None => None)
berghofe@7015
   350
                else None
berghofe@7015
   351
          | _ => None)
berghofe@7015
   352
   | _ => None)
berghofe@7015
   353
  | distinct_proc sg _ _ = None;
berghofe@7015
   354
wenzelm@8100
   355
val distinct_pats = [Thm.read_cterm (Theory.sign_of HOL.thy) ("s = t", HOLogic.termT)];
berghofe@7049
   356
val distinct_simproc = mk_simproc distinctN distinct_pats distinct_proc;
berghofe@7015
   357
berghofe@7015
   358
val dist_ss = HOL_ss addsimprocs [distinct_simproc];
berghofe@7015
   359
berghofe@7015
   360
val simproc_setup =
berghofe@7015
   361
  [Theory.add_oracle (distinctN, fn (_, ConstrDistinct t) => t),
berghofe@7015
   362
   fn thy => (simpset_ref_of thy := simpset_of thy addsimprocs [distinct_simproc]; thy)];
berghofe@7015
   363
berghofe@7015
   364
berghofe@5177
   365
(* prepare types *)
berghofe@5177
   366
berghofe@5177
   367
fun read_typ sign ((Ts, sorts), str) =
berghofe@5177
   368
  let
berghofe@5177
   369
    val T = Type.no_tvars (Sign.read_typ (sign, (curry assoc)
berghofe@5177
   370
      (map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg
berghofe@5177
   371
  in (Ts @ [T], add_typ_tfrees (T, sorts)) end;
berghofe@5177
   372
berghofe@5177
   373
fun cert_typ sign ((Ts, sorts), raw_T) =
berghofe@5177
   374
  let
berghofe@5177
   375
    val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle
berghofe@5177
   376
      TYPE (msg, _, _) => error msg;
berghofe@5177
   377
    val sorts' = add_typ_tfrees (T, sorts)
berghofe@5177
   378
  in (Ts @ [T],
berghofe@5177
   379
      case duplicates (map fst sorts') of
berghofe@5177
   380
         [] => sorts'
berghofe@5177
   381
       | dups => error ("Inconsistent sort constraints for " ^ commas dups))
berghofe@5177
   382
  end;
berghofe@5177
   383
berghofe@5177
   384
berghofe@5177
   385
(**** make datatype info ****)
berghofe@5177
   386
berghofe@5177
   387
fun make_dt_info descr induct reccomb_names rec_thms
wenzelm@10121
   388
    (((((((((i, (_, (tname, _, _))), case_name), case_thms),
wenzelm@10121
   389
      exhaustion_thm), distinct_thm), inject), nchotomy), case_cong), weak_case_cong) =
wenzelm@10121
   390
  (tname,
wenzelm@10121
   391
   {index = i,
wenzelm@10121
   392
    descr = descr,
wenzelm@10121
   393
    rec_names = reccomb_names,
wenzelm@10121
   394
    rec_rewrites = rec_thms,
wenzelm@10121
   395
    case_name = case_name,
wenzelm@10121
   396
    case_rewrites = case_thms,
wenzelm@10121
   397
    induction = induct,
wenzelm@10121
   398
    exhaustion = exhaustion_thm,
wenzelm@10121
   399
    distinct = distinct_thm,
wenzelm@10121
   400
    inject = inject,
wenzelm@10121
   401
    nchotomy = nchotomy,
wenzelm@10121
   402
    case_cong = case_cong,
wenzelm@10121
   403
    weak_case_cong = weak_case_cong});
berghofe@5177
   404
berghofe@5177
   405
berghofe@5177
   406
(********************* axiomatic introduction of datatypes ********************)
berghofe@5177
   407
wenzelm@8437
   408
fun add_and_get_axioms_atts label tnames attss ts thy =
wenzelm@8437
   409
  foldr (fn (((tname, atts), t), (thy', axs)) =>
berghofe@5177
   410
    let
wenzelm@8437
   411
      val (thy'', [ax]) = thy' |>
berghofe@5661
   412
        Theory.add_path tname |>
wenzelm@8437
   413
        PureThy.add_axioms_i [((label, t), atts)];
berghofe@5661
   414
    in (Theory.parent_path thy'', ax::axs)
wenzelm@8437
   415
    end) (tnames ~~ attss ~~ ts, (thy, []));
wenzelm@8437
   416
wenzelm@8437
   417
fun add_and_get_axioms label tnames =
wenzelm@8437
   418
  add_and_get_axioms_atts label tnames (replicate (length tnames) []);
berghofe@5177
   419
berghofe@5177
   420
fun add_and_get_axiomss label tnames tss thy =
berghofe@5177
   421
  foldr (fn ((tname, ts), (thy', axss)) =>
berghofe@5177
   422
    let
wenzelm@8437
   423
      val (thy'', [axs]) = thy' |>
berghofe@5661
   424
        Theory.add_path tname |>
berghofe@5177
   425
        PureThy.add_axiomss_i [((label, ts), [])];
berghofe@5661
   426
    in (Theory.parent_path thy'', axs::axss)
berghofe@5177
   427
    end) (tnames ~~ tss, (thy, []));
berghofe@5177
   428
wenzelm@8437
   429
fun add_datatype_axm flat_names new_type_names descr sorts types_syntax constr_syntax dt_info
wenzelm@8437
   430
    case_names_induct case_names_exhausts thy =
berghofe@5177
   431
  let
berghofe@5177
   432
    val descr' = flat descr;
berghofe@5177
   433
    val recTs = get_rec_types descr' sorts;
berghofe@5578
   434
    val used = foldr add_typ_tfree_names (recTs, []);
berghofe@5177
   435
    val newTs = take (length (hd descr), recTs);
berghofe@5177
   436
berghofe@7015
   437
    val no_size = exists (fn (_, (_, _, constrs)) => exists (fn (_, cargs) => exists
berghofe@7015
   438
      (fn (DtType ("fun", [_, DtRec _])) => true | _ => false) cargs) constrs) descr';
berghofe@7015
   439
berghofe@5177
   440
    (**** declare new types and constants ****)
berghofe@5177
   441
berghofe@5177
   442
    val tyvars = map (fn (_, (_, Ts, _)) => map dest_DtTFree Ts) (hd descr);
berghofe@5177
   443
berghofe@5177
   444
    val constr_decls = map (fn (((_, (_, _, constrs)), T), constr_syntax') =>
berghofe@5177
   445
      map (fn ((_, cargs), (cname, mx)) =>
berghofe@5177
   446
        (cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx))
berghofe@5177
   447
          (constrs ~~ constr_syntax')) ((hd descr) ~~ newTs ~~ constr_syntax);
berghofe@5177
   448
berghofe@5578
   449
    val rec_result_Ts = map TFree (variantlist (replicate (length descr') "'t", used) ~~
berghofe@5578
   450
      replicate (length descr') HOLogic.termS);
berghofe@5177
   451
berghofe@5177
   452
    val reccomb_fn_Ts = flat (map (fn (i, (_, _, constrs)) =>
berghofe@5177
   453
      map (fn (_, cargs) =>
berghofe@5177
   454
        let
berghofe@7015
   455
          val Ts = map (typ_of_dtyp descr' sorts) cargs;
berghofe@7015
   456
          val recs = filter (is_rec_type o fst) (cargs ~~ Ts);
berghofe@7015
   457
berghofe@7015
   458
          fun mk_argT (DtRec k, _) = nth_elem (k, rec_result_Ts)
berghofe@7015
   459
            | mk_argT (DtType ("fun", [_, DtRec k]), Type ("fun", [T, _])) =
berghofe@7015
   460
               T --> nth_elem (k, rec_result_Ts);
berghofe@7015
   461
berghofe@7015
   462
          val argTs = Ts @ map mk_argT recs
berghofe@5177
   463
        in argTs ---> nth_elem (i, rec_result_Ts)
berghofe@5177
   464
        end) constrs) descr');
berghofe@5177
   465
berghofe@5177
   466
    val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec";
berghofe@5177
   467
    val reccomb_names = if length descr' = 1 then [big_reccomb_name] else
berghofe@5177
   468
      (map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int)
berghofe@5177
   469
        (1 upto (length descr')));
berghofe@5177
   470
berghofe@9739
   471
    val size_names = DatatypeProp.indexify_names
berghofe@9739
   472
      (map (fn T => name_of_typ T ^ "_size") (drop (length (hd descr), recTs)));
berghofe@5177
   473
berghofe@5578
   474
    val freeT = TFree (variant used "'t", HOLogic.termS);
berghofe@5177
   475
    val case_fn_Ts = map (fn (i, (_, _, constrs)) =>
berghofe@5177
   476
      map (fn (_, cargs) =>
berghofe@5177
   477
        let val Ts = map (typ_of_dtyp descr' sorts) cargs
berghofe@5177
   478
        in Ts ---> freeT end) constrs) (hd descr);
berghofe@5177
   479
berghofe@5177
   480
    val case_names = map (fn s => (s ^ "_case")) new_type_names;
berghofe@5177
   481
berghofe@6305
   482
    val thy2' = thy |>
berghofe@5177
   483
berghofe@5177
   484
      (** new types **)
berghofe@5177
   485
berghofe@5177
   486
      curry (foldr (fn (((name, mx), tvs), thy') => thy' |>
wenzelm@6385
   487
          TypedefPackage.add_typedecls [(name, tvs, mx)]))
wenzelm@6385
   488
        (types_syntax ~~ tyvars) |>
berghofe@5661
   489
      add_path flat_names (space_implode "_" new_type_names) |>
berghofe@5177
   490
berghofe@5177
   491
      (** primrec combinators **)
berghofe@5177
   492
berghofe@5177
   493
      Theory.add_consts_i (map (fn ((name, T), T') =>
berghofe@5177
   494
        (name, reccomb_fn_Ts @ [T] ---> T', NoSyn))
berghofe@5177
   495
          (reccomb_names ~~ recTs ~~ rec_result_Ts)) |>
berghofe@5177
   496
berghofe@5177
   497
      (** case combinators **)
berghofe@5177
   498
berghofe@5177
   499
      Theory.add_consts_i (map (fn ((name, T), Ts) =>
berghofe@5177
   500
        (name, Ts @ [T] ---> freeT, NoSyn))
berghofe@5177
   501
          (case_names ~~ newTs ~~ case_fn_Ts)) |>
berghofe@6305
   502
      Theory.add_trrules_i (DatatypeProp.make_case_trrules new_type_names descr);
berghofe@6305
   503
wenzelm@6394
   504
    val reccomb_names' = map (Sign.intern_const (Theory.sign_of thy2')) reccomb_names;
wenzelm@6394
   505
    val case_names' = map (Sign.intern_const (Theory.sign_of thy2')) case_names;
berghofe@6305
   506
berghofe@6305
   507
    val thy2 = thy2' |>
berghofe@5177
   508
berghofe@5177
   509
      (** size functions **)
berghofe@5177
   510
berghofe@7015
   511
      (if no_size then I else Theory.add_consts_i (map (fn (s, T) =>
berghofe@5177
   512
        (Sign.base_name s, T --> HOLogic.natT, NoSyn))
berghofe@7015
   513
          (size_names ~~ drop (length (hd descr), recTs)))) |>
berghofe@5661
   514
berghofe@5661
   515
      (** constructors **)
berghofe@5661
   516
berghofe@5661
   517
      parent_path flat_names |>
berghofe@5661
   518
      curry (foldr (fn (((((_, (_, _, constrs)), T), tname),
berghofe@5661
   519
        constr_syntax'), thy') => thy' |>
berghofe@5661
   520
          add_path flat_names tname |>
berghofe@5661
   521
            Theory.add_consts_i (map (fn ((_, cargs), (cname, mx)) =>
berghofe@5661
   522
              (cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx))
berghofe@5661
   523
                (constrs ~~ constr_syntax')) |>
berghofe@5661
   524
          parent_path flat_names))
berghofe@5661
   525
            (hd descr ~~ newTs ~~ new_type_names ~~ constr_syntax);
berghofe@5177
   526
berghofe@5177
   527
    (**** introduction of axioms ****)
berghofe@5177
   528
berghofe@5661
   529
    val rec_axs = DatatypeProp.make_primrecs new_type_names descr sorts thy2;
berghofe@9739
   530
    val size_axs = if no_size then [] else DatatypeProp.make_size descr sorts thy2;
berghofe@5661
   531
wenzelm@8437
   532
    val (thy3, (([induct], [rec_thms]), inject)) =
wenzelm@8437
   533
      thy2 |>
berghofe@5661
   534
      Theory.add_path (space_implode "_" new_type_names) |>
wenzelm@8437
   535
      PureThy.add_axioms_i [(("induct", DatatypeProp.make_ind descr sorts), [case_names_induct])] |>>>
wenzelm@8437
   536
      PureThy.add_axiomss_i [(("recs", rec_axs), [])] |>>
wenzelm@8437
   537
      (if no_size then I else #1 o PureThy.add_axiomss_i [(("size", size_axs), [])]) |>>
wenzelm@8437
   538
      Theory.parent_path |>>>
berghofe@5177
   539
      add_and_get_axiomss "inject" new_type_names
berghofe@5177
   540
        (DatatypeProp.make_injs descr sorts);
berghofe@7015
   541
    val size_thms = if no_size then [] else get_thms thy3 "size";
berghofe@5177
   542
    val (thy4, distinct) = add_and_get_axiomss "distinct" new_type_names
berghofe@5177
   543
      (DatatypeProp.make_distincts new_type_names descr sorts thy3) thy3;
wenzelm@8437
   544
wenzelm@8437
   545
    val exhaust_ts = DatatypeProp.make_casedists descr sorts;
wenzelm@8437
   546
    val (thy5, exhaustion) = add_and_get_axioms_atts "exhaust" new_type_names
wenzelm@8437
   547
      (map Library.single case_names_exhausts) exhaust_ts thy4;
berghofe@5177
   548
    val (thy6, case_thms) = add_and_get_axiomss "cases" new_type_names
berghofe@5177
   549
      (DatatypeProp.make_cases new_type_names descr sorts thy5) thy5;
berghofe@5177
   550
    val (split_ts, split_asm_ts) = ListPair.unzip
berghofe@5177
   551
      (DatatypeProp.make_splits new_type_names descr sorts thy6);
berghofe@5177
   552
    val (thy7, split) = add_and_get_axioms "split" new_type_names split_ts thy6;
berghofe@5177
   553
    val (thy8, split_asm) = add_and_get_axioms "split_asm" new_type_names
berghofe@5177
   554
      split_asm_ts thy7;
berghofe@5177
   555
    val (thy9, nchotomys) = add_and_get_axioms "nchotomy" new_type_names
berghofe@5177
   556
      (DatatypeProp.make_nchotomys descr sorts) thy8;
berghofe@5177
   557
    val (thy10, case_congs) = add_and_get_axioms "case_cong" new_type_names
berghofe@5177
   558
      (DatatypeProp.make_case_congs new_type_names descr sorts thy9) thy9;
nipkow@8601
   559
    val (thy11, weak_case_congs) = add_and_get_axioms "weak_case_cong" new_type_names
nipkow@8601
   560
      (DatatypeProp.make_weak_case_congs new_type_names descr sorts thy10) thy10;
wenzelm@8405
   561
berghofe@6305
   562
    val dt_infos = map (make_dt_info descr' induct reccomb_names' rec_thms)
berghofe@6305
   563
      ((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names' ~~ case_thms ~~
berghofe@7015
   564
        exhaustion ~~ replicate (length (hd descr)) QuickAndDirty ~~ inject ~~
wenzelm@10121
   565
          nchotomys ~~ case_congs ~~ weak_case_congs);
berghofe@5177
   566
berghofe@5177
   567
    val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms;
wenzelm@9386
   568
    val split_thms = split ~~ split_asm;
berghofe@5177
   569
nipkow@8601
   570
    val thy12 = thy11 |>
berghofe@5661
   571
      Theory.add_path (space_implode "_" new_type_names) |>
berghofe@8478
   572
      (#1 o PureThy.add_thmss [(("simps", simps), []),
berghofe@8478
   573
        (("", flat case_thms @ size_thms @ rec_thms), [Simplifier.simp_add_global]),
nipkow@8601
   574
        (("", flat (inject @ distinct)), [iff_add_global]),
wenzelm@9714
   575
        (("", weak_case_congs), [Simplifier.cong_add_global])]) |>
berghofe@5177
   576
      put_datatypes (foldr Symtab.update (dt_infos, dt_info)) |>
wenzelm@8306
   577
      add_cases_induct dt_infos |>
wenzelm@9386
   578
      Theory.parent_path |>
wenzelm@9386
   579
      (#1 o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms));
berghofe@5177
   580
  in
nipkow@8601
   581
    (thy12,
berghofe@5177
   582
     {distinct = distinct,
berghofe@5177
   583
      inject = inject,
berghofe@5177
   584
      exhaustion = exhaustion,
berghofe@5177
   585
      rec_thms = rec_thms,
berghofe@5177
   586
      case_thms = case_thms,
wenzelm@9386
   587
      split_thms = split_thms,
berghofe@5177
   588
      induction = induct,
berghofe@5177
   589
      size = size_thms,
berghofe@5177
   590
      simps = simps})
berghofe@5177
   591
  end;
berghofe@5177
   592
berghofe@5177
   593
berghofe@5177
   594
(******************* definitional introduction of datatypes *******************)
berghofe@5177
   595
wenzelm@8437
   596
fun add_datatype_def flat_names new_type_names descr sorts types_syntax constr_syntax dt_info
wenzelm@8437
   597
    case_names_induct case_names_exhausts thy =
berghofe@5177
   598
  let
wenzelm@6360
   599
    val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names);
berghofe@5177
   600
berghofe@7015
   601
    val (thy2, inject, distinct, dist_rewrites, simproc_dists, induct) = thy |>
berghofe@5661
   602
      DatatypeRepProofs.representation_proofs flat_names dt_info new_type_names descr sorts
wenzelm@8437
   603
        types_syntax constr_syntax case_names_induct;
berghofe@5177
   604
wenzelm@8437
   605
    val (thy3, casedist_thms) = DatatypeAbsProofs.prove_casedist_thms new_type_names descr
wenzelm@8437
   606
      sorts induct case_names_exhausts thy2;
berghofe@8478
   607
    val (thy4, (reccomb_names, rec_thms)) = DatatypeAbsProofs.prove_primrec_thms
berghofe@7015
   608
      flat_names new_type_names descr sorts dt_info inject dist_rewrites dist_ss induct thy3;
wenzelm@8437
   609
    val (thy6, (case_thms, case_names)) = DatatypeAbsProofs.prove_case_thms
berghofe@5661
   610
      flat_names new_type_names descr sorts reccomb_names rec_thms thy4;
berghofe@5177
   611
    val (thy7, split_thms) = DatatypeAbsProofs.prove_split_thms new_type_names
berghofe@5177
   612
      descr sorts inject dist_rewrites casedist_thms case_thms thy6;
berghofe@5177
   613
    val (thy8, nchotomys) = DatatypeAbsProofs.prove_nchotomys new_type_names
berghofe@5177
   614
      descr sorts casedist_thms thy7;
berghofe@5177
   615
    val (thy9, case_congs) = DatatypeAbsProofs.prove_case_congs new_type_names
berghofe@5177
   616
      descr sorts nchotomys case_thms thy8;
nipkow@8601
   617
    val (thy10, weak_case_congs) = DatatypeAbsProofs.prove_weak_case_congs new_type_names
nipkow@8601
   618
      descr sorts thy9;
nipkow@8601
   619
    val (thy11, size_thms) = DatatypeAbsProofs.prove_size_thms flat_names new_type_names
nipkow@8601
   620
      descr sorts reccomb_names rec_thms thy10;
berghofe@5177
   621
berghofe@5177
   622
    val dt_infos = map (make_dt_info (flat descr) induct reccomb_names rec_thms)
berghofe@5177
   623
      ((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names ~~ case_thms ~~
wenzelm@10121
   624
        casedist_thms ~~ simproc_dists ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs);
berghofe@5177
   625
berghofe@5177
   626
    val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms;
berghofe@5177
   627
nipkow@8601
   628
    val thy12 = thy11 |>
berghofe@5661
   629
      Theory.add_path (space_implode "_" new_type_names) |>
berghofe@8478
   630
      (#1 o PureThy.add_thmss [(("simps", simps), []),
berghofe@8478
   631
        (("", flat case_thms @ size_thms @ rec_thms), [Simplifier.simp_add_global]),
nipkow@8601
   632
        (("", flat (inject @ distinct)), [iff_add_global]),
nipkow@8601
   633
        (("", weak_case_congs), [Simplifier.change_global_ss (op addcongs)])]) |>
berghofe@5177
   634
      put_datatypes (foldr Symtab.update (dt_infos, dt_info)) |>
wenzelm@8306
   635
      add_cases_induct dt_infos |>
wenzelm@9386
   636
      Theory.parent_path |>
wenzelm@9386
   637
      (#1 o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms));
berghofe@5177
   638
  in
nipkow@8601
   639
    (thy12,
berghofe@5177
   640
     {distinct = distinct,
berghofe@5177
   641
      inject = inject,
berghofe@5177
   642
      exhaustion = casedist_thms,
berghofe@5177
   643
      rec_thms = rec_thms,
berghofe@5177
   644
      case_thms = case_thms,
berghofe@5177
   645
      split_thms = split_thms,
berghofe@5177
   646
      induction = induct,
berghofe@5177
   647
      size = size_thms,
berghofe@5177
   648
      simps = simps})
berghofe@5177
   649
  end;
berghofe@5177
   650
berghofe@5177
   651
wenzelm@6385
   652
(*********************** declare existing type as datatype *********************)
berghofe@5177
   653
wenzelm@6385
   654
fun gen_rep_datatype apply_theorems alt_names raw_distinct raw_inject raw_induction thy0 =
berghofe@5177
   655
  let
wenzelm@6385
   656
    fun app_thmss srcs thy = foldl_map (fn (thy, x) => apply_theorems x thy) (thy, srcs);
wenzelm@6385
   657
    fun app_thm src thy = apsnd Library.hd (apply_theorems [src] thy);
wenzelm@6385
   658
wenzelm@6385
   659
    val (((thy1, induction), inject), distinct) = thy0
wenzelm@6385
   660
      |> app_thmss raw_distinct
wenzelm@6385
   661
      |> apfst (app_thmss raw_inject)
wenzelm@6385
   662
      |> apfst (apfst (app_thm raw_induction));
wenzelm@6394
   663
    val sign = Theory.sign_of thy1;
berghofe@5177
   664
berghofe@5177
   665
    val induction' = freezeT induction;
berghofe@5177
   666
berghofe@5177
   667
    fun err t = error ("Ill-formed predicate in induction rule: " ^
berghofe@5177
   668
      Sign.string_of_term sign t);
berghofe@5177
   669
berghofe@5177
   670
    fun get_typ (t as _ $ Var (_, Type (tname, Ts))) =
berghofe@7015
   671
          ((tname, map dest_TFree Ts) handle TERM _ => err t)
berghofe@5177
   672
      | get_typ t = err t;
berghofe@5177
   673
wenzelm@8437
   674
    val dtnames = map get_typ (HOLogic.dest_conj (HOLogic.dest_Trueprop (Thm.concl_of induction')));
berghofe@5177
   675
    val new_type_names = if_none alt_names (map fst dtnames);
berghofe@5177
   676
berghofe@5177
   677
    fun get_constr t = (case Logic.strip_assums_concl t of
berghofe@5177
   678
        _ $ (_ $ t') => (case head_of t' of
berghofe@5177
   679
            Const (cname, cT) => (case strip_type cT of
berghofe@5177
   680
                (Ts, Type (tname, _)) => (tname, (cname, map (dtyp_of_typ dtnames) Ts))
berghofe@5177
   681
              | _ => err t)
berghofe@5177
   682
          | _ => err t)
berghofe@5177
   683
      | _ => err t);
berghofe@5177
   684
berghofe@5177
   685
    fun make_dt_spec [] _ _ = []
berghofe@5177
   686
      | make_dt_spec ((tname, tvs)::dtnames') i constrs =
berghofe@5177
   687
          let val (constrs', constrs'') = take_prefix (equal tname o fst) constrs
berghofe@5177
   688
          in (i, (tname, map DtTFree tvs, map snd constrs'))::
berghofe@5177
   689
            (make_dt_spec dtnames' (i + 1) constrs'')
berghofe@5177
   690
          end;
berghofe@5177
   691
berghofe@5177
   692
    val descr = make_dt_spec dtnames 0 (map get_constr (prems_of induction'));
berghofe@5177
   693
    val sorts = add_term_tfrees (concl_of induction', []);
wenzelm@6385
   694
    val dt_info = get_datatypes thy1;
berghofe@5177
   695
wenzelm@8437
   696
    val case_names_induct = mk_case_names_induct descr;
wenzelm@8437
   697
    val case_names_exhausts = mk_case_names_exhausts descr (map #1 dtnames);
wenzelm@8437
   698
    
wenzelm@8437
   699
wenzelm@6427
   700
    val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names);
berghofe@5177
   701
wenzelm@6385
   702
    val (thy2, casedist_thms) = thy1 |>
wenzelm@8437
   703
      DatatypeAbsProofs.prove_casedist_thms new_type_names [descr] sorts induction
wenzelm@8437
   704
        case_names_exhausts;
berghofe@8478
   705
    val (thy3, (reccomb_names, rec_thms)) = DatatypeAbsProofs.prove_primrec_thms
berghofe@7015
   706
      false new_type_names [descr] sorts dt_info inject distinct dist_ss induction thy2;
wenzelm@8437
   707
    val (thy4, (case_thms, case_names)) = DatatypeAbsProofs.prove_case_thms false
berghofe@5177
   708
      new_type_names [descr] sorts reccomb_names rec_thms thy3;
berghofe@5177
   709
    val (thy5, split_thms) = DatatypeAbsProofs.prove_split_thms
berghofe@5177
   710
      new_type_names [descr] sorts inject distinct casedist_thms case_thms thy4;
berghofe@5177
   711
    val (thy6, nchotomys) = DatatypeAbsProofs.prove_nchotomys new_type_names
berghofe@5177
   712
      [descr] sorts casedist_thms thy5;
berghofe@5177
   713
    val (thy7, case_congs) = DatatypeAbsProofs.prove_case_congs new_type_names
berghofe@5177
   714
      [descr] sorts nchotomys case_thms thy6;
nipkow@8601
   715
    val (thy8, weak_case_congs) = DatatypeAbsProofs.prove_weak_case_congs new_type_names
nipkow@8601
   716
      [descr] sorts thy7;
nipkow@8601
   717
    val (thy9, size_thms) =
nipkow@10214
   718
      if exists (equal "NatArith") (Sign.stamp_names_of (Theory.sign_of thy8)) then
berghofe@5661
   719
        DatatypeAbsProofs.prove_size_thms false new_type_names
nipkow@8601
   720
          [descr] sorts reccomb_names rec_thms thy8
nipkow@8601
   721
      else (thy8, []);
berghofe@5177
   722
wenzelm@9149
   723
    val (thy10, [induction']) = thy9 |>
wenzelm@9149
   724
      (#1 o store_thmss "inject" new_type_names inject) |>
wenzelm@9149
   725
      (#1 o store_thmss "distinct" new_type_names distinct) |>
wenzelm@9149
   726
      Theory.add_path (space_implode "_" new_type_names) |>
wenzelm@9149
   727
      PureThy.add_thms [(("induct", induction), [case_names_induct])];
wenzelm@9149
   728
wenzelm@9149
   729
    val dt_infos = map (make_dt_info descr induction' reccomb_names rec_thms)
wenzelm@10121
   730
      ((0 upto length descr - 1) ~~ descr ~~ case_names ~~ case_thms ~~ casedist_thms ~~
wenzelm@10121
   731
        map FewConstrs distinct ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs);
berghofe@5177
   732
berghofe@5177
   733
    val simps = flat (distinct @ inject @ case_thms) @ size_thms @ rec_thms;
berghofe@5177
   734
wenzelm@9149
   735
    val thy11 = thy10 |>
berghofe@8478
   736
      (#1 o PureThy.add_thmss [(("simps", simps), []),
berghofe@8478
   737
        (("", flat case_thms @ size_thms @ rec_thms), [Simplifier.simp_add_global]),
nipkow@8601
   738
        (("", flat (inject @ distinct)), [iff_add_global]),
wenzelm@9149
   739
        (("", weak_case_congs), [Simplifier.change_global_ss (op addcongs)])]) |>
wenzelm@9149
   740
      put_datatypes (foldr Symtab.update (dt_infos, dt_info)) |>
wenzelm@9149
   741
      add_cases_induct dt_infos |>
wenzelm@9386
   742
      Theory.parent_path |>
wenzelm@9386
   743
      (#1 o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms));
berghofe@5177
   744
  in
wenzelm@9149
   745
    (thy11,
berghofe@5177
   746
     {distinct = distinct,
berghofe@5177
   747
      inject = inject,
berghofe@5177
   748
      exhaustion = casedist_thms,
berghofe@5177
   749
      rec_thms = rec_thms,
berghofe@5177
   750
      case_thms = case_thms,
berghofe@5177
   751
      split_thms = split_thms,
wenzelm@8437
   752
      induction = induction',
berghofe@5177
   753
      size = size_thms,
berghofe@5177
   754
      simps = simps})
berghofe@5177
   755
  end;
berghofe@5177
   756
wenzelm@6385
   757
val rep_datatype = gen_rep_datatype IsarThy.apply_theorems;
wenzelm@6385
   758
val rep_datatype_i = gen_rep_datatype IsarThy.apply_theorems_i;
wenzelm@6385
   759
berghofe@5177
   760
berghofe@5177
   761
(******************************** add datatype ********************************)
berghofe@5177
   762
berghofe@5661
   763
fun gen_add_datatype prep_typ flat_names new_type_names dts thy =
berghofe@5177
   764
  let
berghofe@5177
   765
    val _ = Theory.requires thy "Datatype" "datatype definitions";
berghofe@5177
   766
berghofe@5177
   767
    (* this theory is used just for parsing *)
berghofe@5177
   768
berghofe@5177
   769
    val tmp_thy = thy |>
wenzelm@5892
   770
      Theory.copy |>
berghofe@5177
   771
      Theory.add_types (map (fn (tvs, tname, mx, _) =>
berghofe@5177
   772
        (tname, length tvs, mx)) dts);
berghofe@5177
   773
wenzelm@6394
   774
    val sign = Theory.sign_of tmp_thy;
berghofe@5177
   775
berghofe@5661
   776
    val (tyvars, _, _, _)::_ = dts;
berghofe@5177
   777
    val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) =>
berghofe@5177
   778
      let val full_tname = Sign.full_name sign (Syntax.type_name tname mx)
berghofe@5177
   779
      in (case duplicates tvs of
berghofe@5661
   780
            [] => if eq_set (tyvars, tvs) then ((full_tname, tvs), (tname, mx))
berghofe@5661
   781
                  else error ("Mutually recursive datatypes must have same type parameters")
berghofe@5177
   782
          | dups => error ("Duplicate parameter(s) for datatype " ^ full_tname ^
berghofe@5177
   783
              " : " ^ commas dups))
berghofe@5177
   784
      end) dts);
berghofe@5177
   785
berghofe@5177
   786
    val _ = (case duplicates (map fst new_dts) @ duplicates new_type_names of
berghofe@5177
   787
      [] => () | dups => error ("Duplicate datatypes: " ^ commas dups));
berghofe@5177
   788
berghofe@5177
   789
    fun prep_dt_spec ((dts', constr_syntax, sorts, i), (tvs, tname, mx, constrs)) =
berghofe@5177
   790
      let
berghofe@5661
   791
        fun prep_constr ((constrs, constr_syntax', sorts'), (cname, cargs, mx')) =
berghofe@5279
   792
          let
berghofe@5279
   793
            val (cargs', sorts'') = foldl (prep_typ sign) (([], sorts'), cargs);
berghofe@5279
   794
            val _ = (case foldr add_typ_tfree_names (cargs', []) \\ tvs of
berghofe@5279
   795
                [] => ()
berghofe@5279
   796
              | vs => error ("Extra type variables on rhs: " ^ commas vs))
berghofe@5661
   797
          in (constrs @ [((if flat_names then Sign.full_name sign else
berghofe@5661
   798
                Sign.full_name_path sign tname) (Syntax.const_name cname mx'),
berghofe@5177
   799
                   map (dtyp_of_typ new_dts) cargs')],
berghofe@5177
   800
              constr_syntax' @ [(cname, mx')], sorts'')
berghofe@5177
   801
          end handle ERROR =>
berghofe@5177
   802
            error ("The error above occured in constructor " ^ cname ^
berghofe@5177
   803
              " of datatype " ^ tname);
berghofe@5177
   804
berghofe@5177
   805
        val (constrs', constr_syntax', sorts') =
berghofe@5177
   806
          foldl prep_constr (([], [], sorts), constrs)
berghofe@5177
   807
wenzelm@8405
   808
      in
berghofe@5177
   809
        case duplicates (map fst constrs') of
berghofe@5177
   810
           [] =>
berghofe@5177
   811
             (dts' @ [(i, (Sign.full_name sign (Syntax.type_name tname mx),
berghofe@5177
   812
                map DtTFree tvs, constrs'))],
berghofe@5177
   813
              constr_syntax @ [constr_syntax'], sorts', i + 1)
berghofe@5177
   814
         | dups => error ("Duplicate constructors " ^ commas dups ^
berghofe@5177
   815
             " in datatype " ^ tname)
berghofe@5177
   816
      end;
berghofe@5177
   817
berghofe@5661
   818
    val (dts', constr_syntax, sorts', i) = foldl prep_dt_spec (([], [], [], 0), dts);
berghofe@7015
   819
    val sorts = sorts' @ (map (rpair (Sign.defaultS sign)) (tyvars \\ map fst sorts'));
berghofe@5177
   820
    val dt_info = get_datatypes thy;
berghofe@7015
   821
    val (descr, _) = unfold_datatypes sign dts' sorts dt_info dts' i;
berghofe@5177
   822
    val _ = check_nonempty descr;
berghofe@5177
   823
wenzelm@8437
   824
    val descr' = flat descr;
wenzelm@8437
   825
    val case_names_induct = mk_case_names_induct descr';
wenzelm@8437
   826
    val case_names_exhausts = mk_case_names_exhausts descr' (map #1 new_dts);
berghofe@5177
   827
  in
berghofe@5177
   828
    (if (!quick_and_dirty) then add_datatype_axm else add_datatype_def)
wenzelm@8437
   829
      flat_names new_type_names descr sorts types_syntax constr_syntax dt_info
wenzelm@8437
   830
      case_names_induct case_names_exhausts thy
berghofe@5177
   831
  end;
berghofe@5177
   832
berghofe@5177
   833
val add_datatype_i = gen_add_datatype cert_typ;
berghofe@5177
   834
val add_datatype = gen_add_datatype read_typ;
berghofe@5177
   835
wenzelm@6360
   836
wenzelm@6360
   837
(** package setup **)
wenzelm@6360
   838
wenzelm@6360
   839
(* setup theory *)
wenzelm@6360
   840
wenzelm@8541
   841
val setup = [DatatypesData.init, Method.add_methods tactic_emulations] @ simproc_setup;
wenzelm@6360
   842
wenzelm@6360
   843
wenzelm@6360
   844
(* outer syntax *)
wenzelm@6360
   845
wenzelm@6723
   846
local structure P = OuterParse and K = OuterSyntax.Keyword in
wenzelm@6360
   847
wenzelm@6360
   848
val datatype_decl =
wenzelm@6723
   849
  Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") -- P.type_args -- P.name -- P.opt_infix --
wenzelm@6729
   850
    (P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix --| P.marg_comment));
wenzelm@6360
   851
wenzelm@6360
   852
fun mk_datatype args =
wenzelm@6360
   853
  let
wenzelm@6360
   854
    val names = map (fn ((((None, _), t), _), _) => t | ((((Some t, _), _), _), _) => t) args;
wenzelm@6360
   855
    val specs = map (fn ((((_, vs), t), mx), cons) => (vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args;
wenzelm@6360
   856
  in #1 o add_datatype false names specs end;
wenzelm@6360
   857
wenzelm@6360
   858
val datatypeP =
wenzelm@6723
   859
  OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl
wenzelm@6723
   860
    (P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype));
wenzelm@6360
   861
wenzelm@6385
   862
wenzelm@6385
   863
val rep_datatype_decl =
wenzelm@6723
   864
  Scan.option (Scan.repeat1 P.name) --
wenzelm@6723
   865
    Scan.optional (P.$$$ "distinct" |-- P.!!! (P.and_list1 P.xthms1)) [] --
wenzelm@6723
   866
    Scan.optional (P.$$$ "inject" |-- P.!!! (P.and_list1 P.xthms1)) [] --
wenzelm@6723
   867
    (P.$$$ "induction" |-- P.!!! P.xthm);
wenzelm@6385
   868
wenzelm@6385
   869
fun mk_rep_datatype (((opt_ts, dss), iss), ind) = #1 o rep_datatype opt_ts dss iss ind;
wenzelm@6385
   870
wenzelm@6385
   871
val rep_datatypeP =
wenzelm@6723
   872
  OuterSyntax.command "rep_datatype" "represent existing types inductively" K.thy_decl
wenzelm@6385
   873
    (rep_datatype_decl >> (Toplevel.theory o mk_rep_datatype));
wenzelm@6385
   874
wenzelm@6385
   875
wenzelm@6479
   876
val _ = OuterSyntax.add_keywords ["distinct", "inject", "induction"];
wenzelm@6385
   877
val _ = OuterSyntax.add_parsers [datatypeP, rep_datatypeP];
wenzelm@6385
   878
wenzelm@6385
   879
end;
wenzelm@6385
   880
wenzelm@6360
   881
berghofe@5177
   882
end;
berghofe@5177
   883
wenzelm@6360
   884
structure BasicDatatypePackage: BASIC_DATATYPE_PACKAGE = DatatypePackage;
wenzelm@6360
   885
open BasicDatatypePackage;