src/HOL/Tools/datatype_package.ML
author wenzelm
Fri Jan 27 19:03:02 2006 +0100 (2006-01-27)
changeset 18799 f137c5e971f5
parent 18751 38dc4ff2a32b
child 18857 c4b4fbd74ffb
permissions -rw-r--r--
moved theorem tags from Drule to PureThy;
     1 (*  Title:      HOL/Tools/datatype_package.ML
     2     ID:         $Id$
     3     Author:     Stefan Berghofer, TU Muenchen
     4 
     5 Datatype package for Isabelle/HOL.
     6 *)
     7 
     8 signature BASIC_DATATYPE_PACKAGE =
     9 sig
    10   val induct_tac : string -> int -> tactic
    11   val induct_thm_tac : thm -> 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 ->
    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} * theory
    31   val add_datatype_i : bool -> bool -> string list -> (string list * bstring * mixfix *
    32     (bstring * typ list * mixfix) list) list -> 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} * theory
    42   val rep_datatype_i : string list option -> (thm list * attribute list) list list ->
    43     (thm list * attribute list) list list -> (thm list * attribute list) ->
    44     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} * theory
    54   val rep_datatype : string list option -> (thmref * Attrib.src list) list list ->
    55     (thmref * Attrib.src list) list list -> thmref * Attrib.src list -> 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} * theory
    65   val get_datatypes : theory -> DatatypeAux.datatype_info Symtab.table
    66   val print_datatypes : theory -> unit
    67   val datatype_info : theory -> string -> DatatypeAux.datatype_info option
    68   val datatype_info_err : theory -> string -> DatatypeAux.datatype_info
    69   val is_datatype : theory -> string -> bool
    70   val get_datatype : theory -> string -> ((string * sort) list * string list) option
    71   val get_datatype_cons : theory -> string * string -> typ list option
    72   val get_datatype_case_consts : theory -> string list
    73   val get_case_const_data : theory -> string -> (string * int) list option
    74   val get_all_datatype_cons : theory -> (string * string) list
    75   val constrs_of : theory -> string -> term list option
    76   val case_const_of : theory -> string -> term option
    77   val weak_case_congs_of : theory -> thm list
    78   val setup: theory -> theory
    79 end;
    80 
    81 structure DatatypePackage : DATATYPE_PACKAGE =
    82 struct
    83 
    84 open DatatypeAux;
    85 
    86 val quiet_mode = quiet_mode;
    87 
    88 
    89 (* data kind 'HOL/datatypes' *)
    90 
    91 structure DatatypesData = TheoryDataFun
    92 (struct
    93   val name = "HOL/datatypes";
    94   type T = datatype_info Symtab.table;
    95 
    96   val empty = Symtab.empty;
    97   val copy = I;
    98   val extend = I;
    99   fun merge _ tabs : T = Symtab.merge (K true) tabs;
   100 
   101   fun print sg tab =
   102     Pretty.writeln (Pretty.strs ("datatypes:" ::
   103       map #1 (NameSpace.extern_table (Sign.type_space sg, tab))));
   104 end);
   105 
   106 val get_datatypes = DatatypesData.get;
   107 val put_datatypes = DatatypesData.put;
   108 val print_datatypes = DatatypesData.print;
   109 
   110 
   111 (** theory information about datatypes **)
   112 
   113 val datatype_info = Symtab.lookup o get_datatypes;
   114 
   115 fun datatype_info_err thy name = (case datatype_info thy name of
   116       SOME info => info
   117     | NONE => error ("Unknown datatype " ^ quote name));
   118 
   119 fun constrs_of thy tname = (case datatype_info thy tname of
   120    SOME {index, descr, ...} =>
   121      let val (_, _, constrs) = valOf (AList.lookup (op =) descr index)
   122      in SOME (map (fn (cname, _) => Const (cname, Sign.the_const_type thy cname)) constrs)
   123      end
   124  | _ => NONE);
   125 
   126 fun case_const_of thy tname = (case datatype_info thy tname of
   127    SOME {case_name, ...} => SOME (Const (case_name, Sign.the_const_type thy case_name))
   128  | _ => NONE);
   129 
   130 val weak_case_congs_of = map (#weak_case_cong o #2) o Symtab.dest o get_datatypes;
   131 
   132 fun is_datatype thy dtco =
   133   Symtab.lookup (get_datatypes thy) dtco
   134   |> is_some;
   135 
   136 fun get_datatype thy dtco =
   137   dtco
   138   |> Symtab.lookup (get_datatypes thy)
   139   |> Option.map (fn info => (#sorts info,
   140       (get_first (fn (_, (dtco', _, cs)) =>
   141         if dtco = dtco'
   142         then SOME (map fst cs)
   143         else NONE) (#descr info) |> the)));
   144   
   145 fun get_datatype_cons thy (co, dtco) =
   146   let
   147     val descr =
   148       dtco
   149       |> Symtab.lookup (get_datatypes thy)
   150       |> Option.map #descr
   151       |> these
   152     val one_descr =
   153       descr
   154       |> get_first (fn (_, (dtco', vs, cs)) =>
   155           if dtco = dtco'
   156           then SOME (vs, cs)
   157           else NONE);
   158   in
   159     if is_some one_descr
   160     then
   161       the one_descr
   162       |> (fn (vs, cs) =>
   163           co
   164           |> AList.lookup (op =) cs
   165           |> Option.map (map (DatatypeAux.typ_of_dtyp descr (map (rpair [])
   166                (map DatatypeAux.dest_DtTFree vs)))))
   167     else NONE
   168   end;
   169 
   170 fun get_datatype_case_consts thy =
   171   Symtab.fold (fn (_, {case_name, ...}) => cons case_name) (get_datatypes thy) [];
   172 
   173 fun get_case_const_data thy c =
   174   case find_first (fn (_, {index, descr, case_name, ...}) =>
   175       case_name = c
   176     ) ((Symtab.dest o get_datatypes) thy)
   177    of NONE => NONE
   178     | SOME (_, {index, descr, ...}) =>
   179         (SOME o map (apsnd length) o #3 o the o AList.lookup (op =) descr) index;
   180 
   181 fun get_all_datatype_cons thy =
   182   Symtab.fold (fn (dtco, _) => fold
   183     (fn co => cons (co, dtco))
   184       ((snd o the oo get_datatype) thy dtco)) (get_datatypes thy) [];
   185 
   186 fun find_tname var Bi =
   187   let val frees = map dest_Free (term_frees Bi)
   188       val params = rename_wrt_term Bi (Logic.strip_params Bi);
   189   in case AList.lookup (op =) (frees @ params) var of
   190        NONE => error ("No such variable in subgoal: " ^ quote var)
   191      | SOME(Type (tn, _)) => tn
   192      | _ => error ("Cannot determine type of " ^ quote var)
   193   end;
   194 
   195 fun infer_tname state i aterm =
   196   let
   197     val sign = Thm.sign_of_thm state;
   198     val (_, _, Bi, _) = Thm.dest_state (state, i)
   199     val params = Logic.strip_params Bi;   (*params of subgoal i*)
   200     val params = rev (rename_wrt_term Bi params);   (*as they are printed*)
   201     val (types, sorts) = types_sorts state;
   202     fun types' (a, ~1) = (case AList.lookup (op =) params a of NONE => types(a, ~1) | sm => sm)
   203       | types' ixn = types ixn;
   204     val (ct, _) = read_def_cterm (sign, types', sorts) [] false (aterm, TypeInfer.logicT);
   205   in case #T (rep_cterm ct) of
   206        Type (tn, _) => tn
   207      | _ => error ("Cannot determine type of " ^ quote aterm)
   208   end;
   209 
   210 (*Warn if the (induction) variable occurs Free among the premises, which
   211   usually signals a mistake.  But calls the tactic either way!*)
   212 fun occs_in_prems tacf vars =
   213   SUBGOAL (fn (Bi, i) =>
   214            (if  exists (fn Free (a, _) => a mem vars)
   215                       (foldr add_term_frees [] (#2 (strip_context Bi)))
   216              then warning "Induction variable occurs also among premises!"
   217              else ();
   218             tacf i));
   219 
   220 
   221 (* generic induction tactic for datatypes *)
   222 
   223 local
   224 
   225 fun prep_var (Var (ixn, _), SOME x) = SOME (ixn, x)
   226   | prep_var _ = NONE;
   227 
   228 fun prep_inst (concl, xs) =	(*exception UnequalLengths *)
   229   let val vs = InductAttrib.vars_of concl
   230   in List.mapPartial prep_var (Library.drop (length vs - length xs, vs) ~~ xs) end;
   231 
   232 in
   233 
   234 fun gen_induct_tac inst_tac (varss, opt_rule) i state = 
   235   SUBGOAL (fn (Bi,_) =>
   236   let
   237     val (rule, rule_name) =
   238       case opt_rule of
   239 	  SOME r => (r, "Induction rule")
   240 	| NONE =>
   241 	    let val tn = find_tname (hd (List.mapPartial I (List.concat varss))) Bi
   242                 val {sign, ...} = Thm.rep_thm state
   243 	    in (#induction (datatype_info_err sign tn), "Induction rule for type " ^ tn) 
   244 	    end
   245     val concls = HOLogic.dest_concls (Thm.concl_of rule);
   246     val insts = List.concat (map prep_inst (concls ~~ varss)) handle UnequalLengths =>
   247       error (rule_name ^ " has different numbers of variables");
   248   in occs_in_prems (inst_tac insts rule) (map #2 insts) i end)
   249   i state;
   250 
   251 fun induct_tac s =
   252   gen_induct_tac Tactic.res_inst_tac'
   253     (map (Library.single o SOME) (Syntax.read_idents s), NONE);
   254 
   255 fun induct_thm_tac th s =
   256   gen_induct_tac Tactic.res_inst_tac'
   257     ([map SOME (Syntax.read_idents s)], SOME th);
   258 
   259 end;
   260 
   261 
   262 (* generic case tactic for datatypes *)
   263 
   264 fun case_inst_tac inst_tac t rule i state =
   265   let
   266     val _ $ Var (ixn, _) $ _ = HOLogic.dest_Trueprop
   267       (hd (Logic.strip_assums_hyp (hd (Thm.prems_of rule))));
   268   in inst_tac [(ixn, t)] rule i state end;
   269 
   270 fun gen_case_tac inst_tac (t, SOME rule) i state =
   271       case_inst_tac inst_tac t rule i state
   272   | gen_case_tac inst_tac (t, NONE) i state =
   273       let val tn = infer_tname state i t in
   274         if tn = HOLogic.boolN then inst_tac [(("P", 0), t)] case_split_thm i state
   275         else case_inst_tac inst_tac t
   276                (#exhaustion (datatype_info_err (Thm.sign_of_thm state) tn))
   277                i state
   278       end handle THM _ => Seq.empty;
   279 
   280 fun case_tac t = gen_case_tac Tactic.res_inst_tac' (t, NONE);
   281 
   282 
   283 
   284 (** Isar tactic emulations **)
   285 
   286 local
   287 
   288 val rule_spec = Scan.lift (Args.$$$ "rule" -- Args.$$$ ":");
   289 val opt_rule = Scan.option (rule_spec |-- Attrib.local_thm);
   290 
   291 val varss =
   292   Args.and_list (Scan.repeat (Scan.unless rule_spec (Scan.lift (Args.maybe Args.name))));
   293 
   294 val inst_tac = Method.bires_inst_tac false;
   295 
   296 fun induct_meth ctxt (varss, opt_rule) =
   297   gen_induct_tac (inst_tac ctxt) (varss, opt_rule);
   298 fun case_meth ctxt (varss, opt_rule) =
   299   gen_case_tac (inst_tac ctxt) (varss, opt_rule);
   300 
   301 in
   302 
   303 val tactic_emulations =
   304  [("induct_tac", Method.goal_args_ctxt' (varss -- opt_rule) induct_meth,
   305     "induct_tac emulation (dynamic instantiation)"),
   306   ("case_tac", Method.goal_args_ctxt' (Scan.lift Args.name -- opt_rule) case_meth,
   307     "case_tac emulation (dynamic instantiation)")];
   308 
   309 end;
   310 
   311 
   312 
   313 (** induct method setup **)
   314 
   315 (* case names *)
   316 
   317 local
   318 
   319 fun dt_recs (DtTFree _) = []
   320   | dt_recs (DtType (_, dts)) = List.concat (map dt_recs dts)
   321   | dt_recs (DtRec i) = [i];
   322 
   323 fun dt_cases (descr: descr) (_, args, constrs) =
   324   let
   325     fun the_bname i = Sign.base_name (#1 (valOf (AList.lookup (op =) descr i)));
   326     val bnames = map the_bname (distinct (List.concat (map dt_recs args)));
   327   in map (fn (c, _) => space_implode "_" (Sign.base_name c :: bnames)) constrs end;
   328 
   329 
   330 fun induct_cases descr =
   331   DatatypeProp.indexify_names (List.concat (map (dt_cases descr) (map #2 descr)));
   332 
   333 fun exhaust_cases descr i = dt_cases descr (valOf (AList.lookup (op =) descr i));
   334 
   335 in
   336 
   337 fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr);
   338 
   339 fun mk_case_names_exhausts descr new =
   340   map (RuleCases.case_names o exhaust_cases descr o #1)
   341     (List.filter (fn ((_, (name, _, _))) => name mem_string new) descr);
   342 
   343 end;
   344 
   345 (*Name management for ATP linkup. The suffix here must agree with the one given
   346   for notE in Clasimp.addIff*)
   347 fun name_notE th =
   348     Thm.name_thm (Thm.name_of_thm th ^ "_iff1", th RS notE);
   349       
   350 fun add_rules simps case_thms size_thms rec_thms inject distinct
   351                   weak_case_congs cong_att =
   352   (snd o PureThy.add_thmss [(("simps", simps), []),
   353     (("", List.concat case_thms @ size_thms @ 
   354           List.concat distinct  @ rec_thms), [Simplifier.simp_add]),
   355     (("", size_thms @ rec_thms),             [RecfunCodegen.add NONE]),
   356     (("", List.concat inject),               [iff_add]),
   357     (("", map name_notE (List.concat distinct)),  [Classical.safe_elim NONE]),
   358     (("", weak_case_congs),                  [cong_att])]);
   359 
   360 
   361 (* add_cases_induct *)
   362 
   363 fun add_cases_induct infos induction =
   364   let
   365     val n = length (HOLogic.dest_concls (Thm.concl_of induction));
   366     fun proj i = ProjectRule.project induction (i + 1);
   367 
   368     fun named_rules (name, {index, exhaustion, ...}: datatype_info) =
   369       [(("", proj index), [InductAttrib.induct_type name]),
   370        (("", exhaustion), [InductAttrib.cases_type name])];
   371     fun unnamed_rule i =
   372       (("", proj i), [PureThy.kind_internal, InductAttrib.induct_type ""]);
   373   in
   374     PureThy.add_thms
   375       (List.concat (map named_rules infos) @
   376         map unnamed_rule (length infos upto n - 1)) #> snd #>
   377     PureThy.add_thmss [(("inducts",
   378       map (proj #> standard #> RuleCases.save induction) (0 upto n - 1)), [])] #> snd
   379   end;
   380 
   381 
   382 
   383 (**** simplification procedure for showing distinctness of constructors ****)
   384 
   385 fun stripT (i, Type ("fun", [_, T])) = stripT (i + 1, T)
   386   | stripT p = p;
   387 
   388 fun stripC (i, f $ x) = stripC (i + 1, f)
   389   | stripC p = p;
   390 
   391 val distinctN = "constr_distinct";
   392 
   393 exception ConstrDistinct of term;
   394 
   395 fun distinct_proc sg ss (t as Const ("op =", _) $ t1 $ t2) =
   396   (case (stripC (0, t1), stripC (0, t2)) of
   397      ((i, Const (cname1, T1)), (j, Const (cname2, T2))) =>
   398          (case (stripT (0, T1), stripT (0, T2)) of
   399             ((i', Type (tname1, _)), (j', Type (tname2, _))) =>
   400                 if tname1 = tname2 andalso not (cname1 = cname2) andalso i = i' andalso j = j' then
   401                    (case (constrs_of sg tname1) of
   402                       SOME constrs => let val cnames = map (fst o dest_Const) constrs
   403                         in if cname1 mem cnames andalso cname2 mem cnames then
   404                              let val eq_t = Logic.mk_equals (t, Const ("False", HOLogic.boolT));
   405                                  val eq_ct = cterm_of sg eq_t;
   406                                  val Datatype_thy = theory "Datatype";
   407                                  val [In0_inject, In1_inject, In0_not_In1, In1_not_In0] =
   408                                    map (get_thm Datatype_thy o Name)
   409                                      ["In0_inject", "In1_inject", "In0_not_In1", "In1_not_In0"]
   410                              in (case (#distinct (datatype_info_err sg tname1)) of
   411                                  QuickAndDirty => SOME (Thm.invoke_oracle
   412                                    Datatype_thy distinctN (sg, ConstrDistinct eq_t))
   413                                | FewConstrs thms => SOME (Goal.prove sg [] [] eq_t (K
   414                                    (EVERY [rtac eq_reflection 1, rtac iffI 1, rtac notE 1,
   415                                     atac 2, resolve_tac thms 1, etac FalseE 1])))
   416                                | ManyConstrs (thm, simpset) => SOME (Goal.prove sg [] [] eq_t (K
   417                                    (EVERY [rtac eq_reflection 1, rtac iffI 1, dtac thm 1,
   418                                     full_simp_tac (Simplifier.inherit_context ss simpset) 1,
   419                                     REPEAT (dresolve_tac [In0_inject, In1_inject] 1),
   420                                     eresolve_tac [In0_not_In1 RS notE, In1_not_In0 RS notE] 1,
   421                                     etac FalseE 1]))))
   422                              end
   423                            else NONE
   424                         end
   425                     | NONE => NONE)
   426                 else NONE
   427           | _ => NONE)
   428    | _ => NONE)
   429   | distinct_proc sg _ _ = NONE;
   430 
   431 val distinct_simproc =
   432   Simplifier.simproc HOL.thy distinctN ["s = t"] distinct_proc;
   433 
   434 val dist_ss = HOL_ss addsimprocs [distinct_simproc];
   435 
   436 val simproc_setup =
   437   Theory.add_oracle (distinctN, fn (_, ConstrDistinct t) => t) #>
   438   (fn thy => ((change_simpset_of thy) (fn ss => ss addsimprocs [distinct_simproc]); thy));
   439 
   440 
   441 (**** translation rules for case ****)
   442 
   443 fun find_first f = Library.find_first f;
   444 
   445 fun case_tr sg [t, u] =
   446     let
   447       fun case_error s name ts = raise TERM ("Error in case expression" ^
   448         getOpt (Option.map (curry op ^ " for datatype ") name, "") ^ ":\n" ^ s, ts);
   449       fun dest_case1 (Const ("_case1", _) $ t $ u) = (case strip_comb t of
   450             (Const (s, _), ts) => (Sign.intern_const sg s, ts)
   451           | (Free (s, _), ts) => (Sign.intern_const sg s, ts)
   452           | _ => case_error "Head is not a constructor" NONE [t, u], u)
   453         | dest_case1 t = raise TERM ("dest_case1", [t]);
   454       fun dest_case2 (Const ("_case2", _) $ t $ u) = t :: dest_case2 u
   455         | dest_case2 t = [t];
   456       val cases as ((cname, _), _) :: _ = map dest_case1 (dest_case2 u);
   457       val tab = Symtab.dest (get_datatypes sg);
   458       val (cases', default) = (case split_last cases of
   459           (cases', (("dummy_pattern", []), t)) => (cases', SOME t)
   460         | _ => (cases, NONE))
   461       fun abstr (Free (x, T), body) = Term.absfree (x, T, body)
   462         | abstr (Const ("_constrain", _) $ Free (x, T) $ tT, body) =
   463             Syntax.const Syntax.constrainAbsC $ Term.absfree (x, T, body) $ tT
   464         | abstr (Const ("Pair", _) $ x $ y, body) =
   465             Syntax.const "split" $ abstr (x, abstr (y, body))
   466         | abstr (t, _) = case_error "Illegal pattern" NONE [t];
   467     in case find_first (fn (_, {descr, index, ...}) =>
   468       exists (equal cname o fst) (#3 (snd (List.nth (descr, index))))) tab of
   469         NONE => case_error ("Not a datatype constructor: " ^ cname) NONE [u]
   470       | SOME (tname, {descr, sorts, case_name, index, ...}) =>
   471         let
   472           val _ = if exists (equal "dummy_pattern" o fst o fst) cases' then
   473             case_error "Illegal occurrence of '_' dummy pattern" (SOME tname) [u] else ();
   474           val (_, (_, dts, constrs)) = List.nth (descr, index);
   475           fun find_case (cases, (s, dt)) =
   476             (case find_first (equal s o fst o fst) cases' of
   477                NONE => (case default of
   478                    NONE => case_error ("No clause for constructor " ^ s) (SOME tname) [u]
   479                  | SOME t => (cases, list_abs (map (rpair dummyT) (DatatypeProp.make_tnames
   480                      (map (typ_of_dtyp descr sorts) dt)), t)))
   481              | SOME (c as ((_, vs), t)) =>
   482                  if length dt <> length vs then
   483                     case_error ("Wrong number of arguments for constructor " ^ s)
   484                       (SOME tname) vs
   485                  else (cases \ c, foldr abstr t vs))
   486           val (cases'', fs) = foldl_map find_case (cases', constrs)
   487         in case (cases'', length constrs = length cases', default) of
   488             ([], true, SOME _) =>
   489               case_error "Extra '_' dummy pattern" (SOME tname) [u]
   490           | (_ :: _, _, _) =>
   491               let val extra = distinct (map (fst o fst) cases'')
   492               in case extra \\ map fst constrs of
   493                   [] => case_error ("More than one clause for constructor(s) " ^
   494                     commas extra) (SOME tname) [u]
   495                 | extra' => case_error ("Illegal constructor(s): " ^ commas extra')
   496                     (SOME tname) [u]
   497               end
   498           | _ => list_comb (Syntax.const case_name, fs) $ t
   499         end
   500     end
   501   | case_tr sg ts = raise TERM ("case_tr", ts);
   502 
   503 fun case_tr' constrs sg ts =
   504   if length ts <> length constrs + 1 then raise Match else
   505   let
   506     val (fs, x) = split_last ts;
   507     fun strip_abs 0 t = ([], t)
   508       | strip_abs i (Abs p) =
   509         let val (x, u) = Syntax.atomic_abs_tr' p
   510         in apfst (cons x) (strip_abs (i-1) u) end
   511       | strip_abs i (Const ("split", _) $ t) = (case strip_abs (i+1) t of
   512           (v :: v' :: vs, u) => (Syntax.const "Pair" $ v $ v' :: vs, u));
   513     fun is_dependent i t =
   514       let val k = length (strip_abs_vars t) - i
   515       in k < 0 orelse exists (fn j => j >= k)
   516         (loose_bnos (strip_abs_body t))
   517       end;
   518     val cases = map (fn ((cname, dts), t) =>
   519       (Sign.extern_const sg cname,
   520        strip_abs (length dts) t, is_dependent (length dts) t))
   521       (constrs ~~ fs);
   522     fun count_cases (cs, (_, _, true)) = cs
   523       | count_cases (cs, (cname, (_, body), false)) = (case AList.lookup (op =) cs body of
   524           NONE => (body, [cname]) :: cs
   525         | SOME cnames => AList.update (op =) (body, cnames @ [cname]) cs);
   526     val cases' = sort (int_ord o Library.swap o pairself (length o snd))
   527       (Library.foldl count_cases ([], cases));
   528     fun mk_case1 (cname, (vs, body), _) = Syntax.const "_case1" $
   529       list_comb (Syntax.const cname, vs) $ body;
   530   in
   531     Syntax.const "_case_syntax" $ x $
   532       foldr1 (fn (t, u) => Syntax.const "_case2" $ t $ u) (map mk_case1
   533         (case cases' of
   534            [] => cases
   535          | (default, cnames) :: _ =>
   536            if length cnames = 1 then cases
   537            else if length cnames = length constrs then
   538              [hd cases, ("dummy_pattern", ([], default), false)]
   539            else
   540              filter_out (fn (cname, _, _) => cname mem cnames) cases @
   541              [("dummy_pattern", ([], default), false)]))
   542   end;
   543 
   544 fun make_case_tr' case_names descr = List.concat (map
   545   (fn ((_, (_, _, constrs)), case_name) => map (rpair (case_tr' constrs))
   546     (NameSpace.accesses' case_name)) (descr ~~ case_names));
   547 
   548 val trfun_setup =
   549   Theory.add_advanced_trfuns ([], [("_case_syntax", case_tr)], [], []);
   550 
   551 
   552 (* prepare types *)
   553 
   554 fun read_typ sign ((Ts, sorts), str) =
   555   let
   556     val T = Type.no_tvars (Sign.read_typ (sign, AList.lookup (op =)
   557       (map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg
   558   in (Ts @ [T], add_typ_tfrees (T, sorts)) end;
   559 
   560 fun cert_typ sign ((Ts, sorts), raw_T) =
   561   let
   562     val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle
   563       TYPE (msg, _, _) => error msg;
   564     val sorts' = add_typ_tfrees (T, sorts)
   565   in (Ts @ [T],
   566       case duplicates (map fst sorts') of
   567          [] => sorts'
   568        | dups => error ("Inconsistent sort constraints for " ^ commas dups))
   569   end;
   570 
   571 
   572 (**** make datatype info ****)
   573 
   574 fun make_dt_info descr sorts induct reccomb_names rec_thms
   575     (((((((((i, (_, (tname, _, _))), case_name), case_thms),
   576       exhaustion_thm), distinct_thm), inject), nchotomy), case_cong), weak_case_cong) =
   577   (tname,
   578    {index = i,
   579     descr = descr,
   580     sorts = sorts,
   581     rec_names = reccomb_names,
   582     rec_rewrites = rec_thms,
   583     case_name = case_name,
   584     case_rewrites = case_thms,
   585     induction = induct,
   586     exhaustion = exhaustion_thm,
   587     distinct = distinct_thm,
   588     inject = inject,
   589     nchotomy = nchotomy,
   590     case_cong = case_cong,
   591     weak_case_cong = weak_case_cong});
   592 
   593 
   594 (********************* axiomatic introduction of datatypes ********************)
   595 
   596 fun add_and_get_axioms_atts label tnames attss ts thy =
   597   foldr (fn (((tname, atts), t), (thy', axs)) =>
   598     let
   599       val ([ax], thy'') =
   600         thy'
   601         |> Theory.add_path tname
   602         |> PureThy.add_axioms_i [((label, t), atts)];
   603     in (Theory.parent_path thy'', ax::axs)
   604     end) (thy, []) (tnames ~~ attss ~~ ts) |> swap;
   605 
   606 fun add_and_get_axioms label tnames =
   607   add_and_get_axioms_atts label tnames (replicate (length tnames) []);
   608 
   609 fun add_and_get_axiomss label tnames tss thy =
   610   foldr (fn ((tname, ts), (thy', axss)) =>
   611     let
   612       val ([axs], thy'') =
   613         thy'
   614         |> Theory.add_path tname
   615         |> PureThy.add_axiomss_i [((label, ts), [])];
   616     in (Theory.parent_path thy'', axs::axss)
   617     end) (thy, []) (tnames ~~ tss) |> swap;
   618 
   619 fun add_datatype_axm flat_names new_type_names descr sorts types_syntax constr_syntax dt_info
   620     case_names_induct case_names_exhausts thy =
   621   let
   622     val descr' = List.concat descr;
   623     val recTs = get_rec_types descr' sorts;
   624     val used = foldr add_typ_tfree_names [] recTs;
   625     val newTs = Library.take (length (hd descr), recTs);
   626 
   627     val no_size = exists (fn (_, (_, _, constrs)) => exists (fn (_, cargs) => exists
   628       (fn dt => is_rec_type dt andalso not (null (fst (strip_dtyp dt))))
   629         cargs) constrs) descr';
   630 
   631     (**** declare new types and constants ****)
   632 
   633     val tyvars = map (fn (_, (_, Ts, _)) => map dest_DtTFree Ts) (hd descr);
   634 
   635     val constr_decls = map (fn (((_, (_, _, constrs)), T), constr_syntax') =>
   636       map (fn ((_, cargs), (cname, mx)) =>
   637         (cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx))
   638           (constrs ~~ constr_syntax')) ((hd descr) ~~ newTs ~~ constr_syntax);
   639 
   640     val (rec_result_Ts, reccomb_fn_Ts) = DatatypeProp.make_primrec_Ts descr sorts used;
   641 
   642     val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec";
   643     val reccomb_names = if length descr' = 1 then [big_reccomb_name] else
   644       (map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int)
   645         (1 upto (length descr')));
   646 
   647     val size_names = DatatypeProp.indexify_names
   648       (map (fn T => name_of_typ T ^ "_size") (Library.drop (length (hd descr), recTs)));
   649 
   650     val freeT = TFree (variant used "'t", HOLogic.typeS);
   651     val case_fn_Ts = map (fn (i, (_, _, constrs)) =>
   652       map (fn (_, cargs) =>
   653         let val Ts = map (typ_of_dtyp descr' sorts) cargs
   654         in Ts ---> freeT end) constrs) (hd descr);
   655 
   656     val case_names = map (fn s => (s ^ "_case")) new_type_names;
   657 
   658     val thy2' = thy |>
   659 
   660       (** new types **)
   661 
   662       curry (Library.foldr (fn (((name, mx), tvs), thy') => thy' |>
   663           TypedefPackage.add_typedecls [(name, tvs, mx)]))
   664         (types_syntax ~~ tyvars) |>
   665       add_path flat_names (space_implode "_" new_type_names) |>
   666 
   667       (** primrec combinators **)
   668 
   669       Theory.add_consts_i (map (fn ((name, T), T') =>
   670         (name, reccomb_fn_Ts @ [T] ---> T', NoSyn))
   671           (reccomb_names ~~ recTs ~~ rec_result_Ts)) |>
   672 
   673       (** case combinators **)
   674 
   675       Theory.add_consts_i (map (fn ((name, T), Ts) =>
   676         (name, Ts @ [T] ---> freeT, NoSyn))
   677           (case_names ~~ newTs ~~ case_fn_Ts));
   678 
   679     val reccomb_names' = map (Sign.intern_const thy2') reccomb_names;
   680     val case_names' = map (Sign.intern_const thy2') case_names;
   681 
   682     val thy2 = thy2' |>
   683 
   684       (** size functions **)
   685 
   686       (if no_size then I else Theory.add_consts_i (map (fn (s, T) =>
   687         (Sign.base_name s, T --> HOLogic.natT, NoSyn))
   688           (size_names ~~ Library.drop (length (hd descr), recTs)))) |>
   689 
   690       (** constructors **)
   691 
   692       parent_path flat_names |>
   693       curry (Library.foldr (fn (((((_, (_, _, constrs)), T), tname),
   694         constr_syntax'), thy') => thy' |>
   695           add_path flat_names tname |>
   696             Theory.add_consts_i (map (fn ((_, cargs), (cname, mx)) =>
   697               (cname, map (typ_of_dtyp descr' sorts) cargs ---> T, mx))
   698                 (constrs ~~ constr_syntax')) |>
   699           parent_path flat_names))
   700             (hd descr ~~ newTs ~~ new_type_names ~~ constr_syntax);
   701 
   702     (**** introduction of axioms ****)
   703 
   704     val rec_axs = DatatypeProp.make_primrecs new_type_names descr sorts thy2;
   705     val size_axs = if no_size then [] else DatatypeProp.make_size descr sorts thy2;
   706 
   707     val ((([induct], [rec_thms]), inject), thy3) =
   708       thy2
   709       |> Theory.add_path (space_implode "_" new_type_names)
   710       |> PureThy.add_axioms_i [(("induct", DatatypeProp.make_ind descr sorts),
   711           [case_names_induct])]
   712       ||>> PureThy.add_axiomss_i [(("recs", rec_axs), [])]
   713       ||> (if no_size then I else snd o PureThy.add_axiomss_i [(("size", size_axs), [])])
   714       ||> Theory.parent_path
   715       ||>> add_and_get_axiomss "inject" new_type_names
   716             (DatatypeProp.make_injs descr sorts);
   717     val size_thms = if no_size then [] else get_thms thy3 (Name "size");
   718     val (distinct, thy4) = add_and_get_axiomss "distinct" new_type_names
   719       (DatatypeProp.make_distincts new_type_names descr sorts thy3) thy3;
   720 
   721     val exhaust_ts = DatatypeProp.make_casedists descr sorts;
   722     val (exhaustion, thy5) = add_and_get_axioms_atts "exhaust" new_type_names
   723       (map Library.single case_names_exhausts) exhaust_ts thy4;
   724     val (case_thms, thy6) = add_and_get_axiomss "cases" new_type_names
   725       (DatatypeProp.make_cases new_type_names descr sorts thy5) thy5;
   726     val (split_ts, split_asm_ts) = ListPair.unzip
   727       (DatatypeProp.make_splits new_type_names descr sorts thy6);
   728     val (split, thy7) = add_and_get_axioms "split" new_type_names split_ts thy6;
   729     val (split_asm, thy8) = add_and_get_axioms "split_asm" new_type_names
   730       split_asm_ts thy7;
   731     val (nchotomys, thy9) = add_and_get_axioms "nchotomy" new_type_names
   732       (DatatypeProp.make_nchotomys descr sorts) thy8;
   733     val (case_congs, thy10) = add_and_get_axioms "case_cong" new_type_names
   734       (DatatypeProp.make_case_congs new_type_names descr sorts thy9) thy9;
   735     val (weak_case_congs, thy11) = add_and_get_axioms "weak_case_cong" new_type_names
   736       (DatatypeProp.make_weak_case_congs new_type_names descr sorts thy10) thy10;
   737 
   738     val dt_infos = map (make_dt_info descr' sorts induct reccomb_names' rec_thms)
   739       ((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names' ~~ case_thms ~~
   740         exhaustion ~~ replicate (length (hd descr)) QuickAndDirty ~~ inject ~~
   741           nchotomys ~~ case_congs ~~ weak_case_congs);
   742 
   743     val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms;
   744     val split_thms = split ~~ split_asm;
   745 
   746     val thy12 =
   747       thy11
   748       |> Theory.add_advanced_trfuns ([], [], make_case_tr' case_names' (hd descr), [])
   749       |> Theory.add_path (space_implode "_" new_type_names)
   750       |> add_rules simps case_thms size_thms rec_thms inject distinct
   751           weak_case_congs Simplifier.cong_add
   752       |> put_datatypes (fold Symtab.update dt_infos dt_info)
   753       |> add_cases_induct dt_infos induct
   754       |> Theory.parent_path
   755       |> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |> snd
   756       |> DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos)
   757       |> fold (CodegenPackage.add_case_const_i get_case_const_data) case_names';
   758   in
   759     ({distinct = distinct,
   760       inject = inject,
   761       exhaustion = exhaustion,
   762       rec_thms = rec_thms,
   763       case_thms = case_thms,
   764       split_thms = split_thms,
   765       induction = induct,
   766       size = size_thms,
   767       simps = simps}, thy12)
   768   end;
   769 
   770 
   771 (******************* definitional introduction of datatypes *******************)
   772 
   773 fun add_datatype_def flat_names new_type_names descr sorts types_syntax constr_syntax dt_info
   774     case_names_induct case_names_exhausts thy =
   775   let
   776     val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names);
   777 
   778     val ((inject, distinct, dist_rewrites, simproc_dists, induct), thy2) = thy |>
   779       DatatypeRepProofs.representation_proofs flat_names dt_info new_type_names descr sorts
   780         types_syntax constr_syntax case_names_induct;
   781 
   782     val (casedist_thms, thy3) = DatatypeAbsProofs.prove_casedist_thms new_type_names descr
   783       sorts induct case_names_exhausts thy2;
   784     val ((reccomb_names, rec_thms), thy4) = DatatypeAbsProofs.prove_primrec_thms
   785       flat_names new_type_names descr sorts dt_info inject dist_rewrites dist_ss induct thy3;
   786     val ((case_thms, case_names), thy6) = DatatypeAbsProofs.prove_case_thms
   787       flat_names new_type_names descr sorts reccomb_names rec_thms thy4;
   788     val (split_thms, thy7) = DatatypeAbsProofs.prove_split_thms new_type_names
   789       descr sorts inject dist_rewrites casedist_thms case_thms thy6;
   790     val (nchotomys, thy8) = DatatypeAbsProofs.prove_nchotomys new_type_names
   791       descr sorts casedist_thms thy7;
   792     val (case_congs, thy9) = DatatypeAbsProofs.prove_case_congs new_type_names
   793       descr sorts nchotomys case_thms thy8;
   794     val (weak_case_congs, thy10) = DatatypeAbsProofs.prove_weak_case_congs new_type_names
   795       descr sorts thy9;
   796     val (size_thms, thy11) = DatatypeAbsProofs.prove_size_thms flat_names new_type_names
   797       descr sorts reccomb_names rec_thms thy10;
   798 
   799     val dt_infos = map (make_dt_info (List.concat descr) sorts induct reccomb_names rec_thms)
   800       ((0 upto length (hd descr) - 1) ~~ (hd descr) ~~ case_names ~~ case_thms ~~
   801         casedist_thms ~~ simproc_dists ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs);
   802 
   803     val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms;
   804 
   805     val thy12 =
   806       thy11
   807       |> Theory.add_advanced_trfuns ([], [], make_case_tr' case_names (hd descr), [])
   808       |> Theory.add_path (space_implode "_" new_type_names)
   809       |> add_rules simps case_thms size_thms rec_thms inject distinct
   810           weak_case_congs (Simplifier.attrib (op addcongs))
   811       |> put_datatypes (fold Symtab.update dt_infos dt_info)
   812       |> add_cases_induct dt_infos induct
   813       |> Theory.parent_path
   814       |> store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms) |> snd
   815       |> DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos)
   816       |> fold (CodegenPackage.add_case_const_i get_case_const_data) case_names;
   817   in
   818     ({distinct = distinct,
   819       inject = inject,
   820       exhaustion = casedist_thms,
   821       rec_thms = rec_thms,
   822       case_thms = case_thms,
   823       split_thms = split_thms,
   824       induction = induct,
   825       size = size_thms,
   826       simps = simps}, thy12)
   827   end;
   828 
   829 
   830 (*********************** declare existing type as datatype *********************)
   831 
   832 fun gen_rep_datatype apply_theorems alt_names raw_distinct raw_inject raw_induction thy0 =
   833   let
   834     val _ = Theory.requires thy0 "Inductive" "datatype representations";
   835 
   836     val (((distinct, inject), [induction]), thy1) =
   837       thy0
   838       |> fold_map apply_theorems raw_distinct
   839       ||>> fold_map apply_theorems raw_inject
   840       ||>> apply_theorems [raw_induction];
   841     val sign = Theory.sign_of thy1;
   842 
   843     val induction' = freezeT induction;
   844 
   845     fun err t = error ("Ill-formed predicate in induction rule: " ^
   846       Sign.string_of_term sign t);
   847 
   848     fun get_typ (t as _ $ Var (_, Type (tname, Ts))) =
   849           ((tname, map dest_TFree Ts) handle TERM _ => err t)
   850       | get_typ t = err t;
   851 
   852     val dtnames = map get_typ (HOLogic.dest_conj (HOLogic.dest_Trueprop (Thm.concl_of induction')));
   853     val new_type_names = getOpt (alt_names, map fst dtnames);
   854 
   855     fun get_constr t = (case Logic.strip_assums_concl t of
   856         _ $ (_ $ t') => (case head_of t' of
   857             Const (cname, cT) => (case strip_type cT of
   858                 (Ts, Type (tname, _)) => (tname, (cname, map (dtyp_of_typ dtnames) Ts))
   859               | _ => err t)
   860           | _ => err t)
   861       | _ => err t);
   862 
   863     fun make_dt_spec [] _ _ = []
   864       | make_dt_spec ((tname, tvs)::dtnames') i constrs =
   865           let val (constrs', constrs'') = take_prefix (equal tname o fst) constrs
   866           in (i, (tname, map DtTFree tvs, map snd constrs'))::
   867             (make_dt_spec dtnames' (i + 1) constrs'')
   868           end;
   869 
   870     val descr = make_dt_spec dtnames 0 (map get_constr (prems_of induction'));
   871     val sorts = add_term_tfrees (concl_of induction', []);
   872     val dt_info = get_datatypes thy1;
   873 
   874     val case_names_induct = mk_case_names_induct descr;
   875     val case_names_exhausts = mk_case_names_exhausts descr (map #1 dtnames);
   876     
   877 
   878     val _ = message ("Proofs for datatype(s) " ^ commas_quote new_type_names);
   879 
   880     val (casedist_thms, thy2) = thy1 |>
   881       DatatypeAbsProofs.prove_casedist_thms new_type_names [descr] sorts induction
   882         case_names_exhausts;
   883     val ((reccomb_names, rec_thms), thy3) = DatatypeAbsProofs.prove_primrec_thms
   884       false new_type_names [descr] sorts dt_info inject distinct dist_ss induction thy2;
   885     val ((case_thms, case_names), thy4) = DatatypeAbsProofs.prove_case_thms false
   886       new_type_names [descr] sorts reccomb_names rec_thms thy3;
   887     val (split_thms, thy5) = DatatypeAbsProofs.prove_split_thms
   888       new_type_names [descr] sorts inject distinct casedist_thms case_thms thy4;
   889     val (nchotomys, thy6) = DatatypeAbsProofs.prove_nchotomys new_type_names
   890       [descr] sorts casedist_thms thy5;
   891     val (case_congs, thy7) = DatatypeAbsProofs.prove_case_congs new_type_names
   892       [descr] sorts nchotomys case_thms thy6;
   893     val (weak_case_congs, thy8) = DatatypeAbsProofs.prove_weak_case_congs new_type_names
   894       [descr] sorts thy7;
   895     val (size_thms, thy9) =
   896       if Context.exists_name "NatArith" thy8 then
   897         DatatypeAbsProofs.prove_size_thms false new_type_names
   898           [descr] sorts reccomb_names rec_thms thy8
   899       else ([], thy8);
   900 
   901     val ((_, [induction']), thy10) =
   902       thy9
   903       |> store_thmss "inject" new_type_names inject
   904       ||>> store_thmss "distinct" new_type_names distinct
   905       ||> Theory.add_path (space_implode "_" new_type_names)
   906       ||>> PureThy.add_thms [(("induct", induction), [case_names_induct])];
   907 
   908     val dt_infos = map (make_dt_info descr sorts induction' reccomb_names rec_thms)
   909       ((0 upto length descr - 1) ~~ descr ~~ case_names ~~ case_thms ~~ casedist_thms ~~
   910         map FewConstrs distinct ~~ inject ~~ nchotomys ~~ case_congs ~~ weak_case_congs);
   911 
   912     val simps = List.concat (distinct @ inject @ case_thms) @ size_thms @ rec_thms;
   913 
   914     val thy11 = thy10 |>
   915       Theory.add_advanced_trfuns ([], [], make_case_tr' case_names descr, []) |>
   916       add_rules simps case_thms size_thms rec_thms inject distinct
   917         weak_case_congs (Simplifier.attrib (op addcongs)) |> 
   918       put_datatypes (fold Symtab.update dt_infos dt_info) |>
   919       add_cases_induct dt_infos induction' |>
   920       Theory.parent_path |>
   921       (snd o store_thmss "splits" new_type_names (map (fn (x, y) => [x, y]) split_thms)) |>
   922       DatatypeRealizer.add_dt_realizers sorts (map snd dt_infos);
   923   in
   924     ({distinct = distinct,
   925       inject = inject,
   926       exhaustion = casedist_thms,
   927       rec_thms = rec_thms,
   928       case_thms = case_thms,
   929       split_thms = split_thms,
   930       induction = induction',
   931       size = size_thms,
   932       simps = simps}, thy11)
   933   end;
   934 
   935 val rep_datatype = gen_rep_datatype IsarThy.apply_theorems;
   936 val rep_datatype_i = gen_rep_datatype IsarThy.apply_theorems_i;
   937 
   938 
   939 
   940 (******************************** add datatype ********************************)
   941 
   942 fun gen_add_datatype prep_typ err flat_names new_type_names dts thy =
   943   let
   944     val _ = Theory.requires thy "Datatype_Universe" "datatype definitions";
   945 
   946     (* this theory is used just for parsing *)
   947 
   948     val tmp_thy = thy |>
   949       Theory.copy |>
   950       Theory.add_types (map (fn (tvs, tname, mx, _) =>
   951         (tname, length tvs, mx)) dts);
   952 
   953     val sign = Theory.sign_of tmp_thy;
   954 
   955     val (tyvars, _, _, _)::_ = dts;
   956     val (new_dts, types_syntax) = ListPair.unzip (map (fn (tvs, tname, mx, _) =>
   957       let val full_tname = Sign.full_name sign (Syntax.type_name tname mx)
   958       in (case duplicates tvs of
   959             [] => if eq_set (tyvars, tvs) then ((full_tname, tvs), (tname, mx))
   960                   else error ("Mutually recursive datatypes must have same type parameters")
   961           | dups => error ("Duplicate parameter(s) for datatype " ^ full_tname ^
   962               " : " ^ commas dups))
   963       end) dts);
   964 
   965     val _ = (case duplicates (map fst new_dts) @ duplicates new_type_names of
   966       [] => () | dups => error ("Duplicate datatypes: " ^ commas dups));
   967 
   968     fun prep_dt_spec ((dts', constr_syntax, sorts, i), (tvs, tname, mx, constrs)) =
   969       let
   970         fun prep_constr ((constrs, constr_syntax', sorts'), (cname, cargs, mx')) =
   971           let
   972             val (cargs', sorts'') = Library.foldl (prep_typ sign) (([], sorts'), cargs);
   973             val _ = (case foldr add_typ_tfree_names [] cargs' \\ tvs of
   974                 [] => ()
   975               | vs => error ("Extra type variables on rhs: " ^ commas vs))
   976           in (constrs @ [((if flat_names then Sign.full_name sign else
   977                 Sign.full_name_path sign tname) (Syntax.const_name cname mx'),
   978                    map (dtyp_of_typ new_dts) cargs')],
   979               constr_syntax' @ [(cname, mx')], sorts'')
   980           end handle ERROR msg =>
   981             cat_error msg ("The error above occured in constructor " ^ cname ^
   982               " of datatype " ^ tname);
   983 
   984         val (constrs', constr_syntax', sorts') =
   985           Library.foldl prep_constr (([], [], sorts), constrs)
   986 
   987       in
   988         case duplicates (map fst constrs') of
   989            [] =>
   990              (dts' @ [(i, (Sign.full_name sign (Syntax.type_name tname mx),
   991                 map DtTFree tvs, constrs'))],
   992               constr_syntax @ [constr_syntax'], sorts', i + 1)
   993          | dups => error ("Duplicate constructors " ^ commas dups ^
   994              " in datatype " ^ tname)
   995       end;
   996 
   997     val (dts', constr_syntax, sorts', i) = Library.foldl prep_dt_spec (([], [], [], 0), dts);
   998     val sorts = sorts' @ (map (rpair (Sign.defaultS sign)) (tyvars \\ map fst sorts'));
   999     val dt_info = get_datatypes thy;
  1000     val (descr, _) = unfold_datatypes sign dts' sorts dt_info dts' i;
  1001     val _ = check_nonempty descr handle (exn as Datatype_Empty s) =>
  1002       if err then error ("Nonemptiness check failed for datatype " ^ s)
  1003       else raise exn;
  1004 
  1005     val descr' = List.concat descr;
  1006     val case_names_induct = mk_case_names_induct descr';
  1007     val case_names_exhausts = mk_case_names_exhausts descr' (map #1 new_dts);
  1008   in
  1009     (if (!quick_and_dirty) then add_datatype_axm else add_datatype_def)
  1010       flat_names new_type_names descr sorts types_syntax constr_syntax dt_info
  1011       case_names_induct case_names_exhausts thy
  1012   end;
  1013 
  1014 val add_datatype_i = gen_add_datatype cert_typ;
  1015 val add_datatype = gen_add_datatype read_typ true;
  1016 
  1017 
  1018 
  1019 (** package setup **)
  1020 
  1021 (* setup theory *)
  1022 
  1023 val setup =
  1024   DatatypesData.init #> Method.add_methods tactic_emulations #> simproc_setup #> trfun_setup;
  1025 
  1026 
  1027 (* outer syntax *)
  1028 
  1029 local structure P = OuterParse and K = OuterKeyword in
  1030 
  1031 val datatype_decl =
  1032   Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") -- P.type_args -- P.name -- P.opt_infix --
  1033     (P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix));
  1034 
  1035 fun mk_datatype args =
  1036   let
  1037     val names = map (fn ((((NONE, _), t), _), _) => t | ((((SOME t, _), _), _), _) => t) args;
  1038     val specs = map (fn ((((_, vs), t), mx), cons) =>
  1039       (vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args;
  1040   in snd o add_datatype false names specs end;
  1041 
  1042 val datatypeP =
  1043   OuterSyntax.command "datatype" "define inductive datatypes" K.thy_decl
  1044     (P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype));
  1045 
  1046 
  1047 val rep_datatype_decl =
  1048   Scan.option (Scan.repeat1 P.name) --
  1049     Scan.optional (P.$$$ "distinct" |-- P.!!! (P.and_list1 P.xthms1)) [[]] --
  1050     Scan.optional (P.$$$ "inject" |-- P.!!! (P.and_list1 P.xthms1)) [[]] --
  1051     (P.$$$ "induction" |-- P.!!! P.xthm);
  1052 
  1053 fun mk_rep_datatype (((opt_ts, dss), iss), ind) = #2 o rep_datatype opt_ts dss iss ind;
  1054 
  1055 val rep_datatypeP =
  1056   OuterSyntax.command "rep_datatype" "represent existing types inductively" K.thy_decl
  1057     (rep_datatype_decl >> (Toplevel.theory o mk_rep_datatype));
  1058 
  1059 
  1060 val _ = OuterSyntax.add_keywords ["distinct", "inject", "induction"];
  1061 val _ = OuterSyntax.add_parsers [datatypeP, rep_datatypeP];
  1062 
  1063 end;
  1064 
  1065 
  1066 end;
  1067 
  1068 structure BasicDatatypePackage: BASIC_DATATYPE_PACKAGE = DatatypePackage;
  1069 open BasicDatatypePackage;
  1070