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