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