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