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