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