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