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