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