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