src/HOL/Tools/datatype_aux.ML
author berghofe
Thu Dec 01 18:39:08 2005 +0100 (2005-12-01)
changeset 18319 c52b139ebde0
parent 18314 4595eb4627fa
child 18349 58de95a16d3c
permissions -rw-r--r--
Added new component "sorts" to record datatype_info.
berghofe@5177
     1
(*  Title:      HOL/Tools/datatype_aux.ML
berghofe@5177
     2
    ID:         $Id$
wenzelm@11539
     3
    Author:     Stefan Berghofer, TU Muenchen
berghofe@5177
     4
wenzelm@11539
     5
Auxiliary functions for defining datatypes.
berghofe@5177
     6
*)
berghofe@5177
     7
berghofe@5177
     8
signature DATATYPE_AUX =
berghofe@5177
     9
sig
berghofe@5661
    10
  val quiet_mode : bool ref
berghofe@5661
    11
  val message : string -> unit
berghofe@5661
    12
  
berghofe@5177
    13
  val foldl1 : ('a * 'a -> 'a) -> 'a list -> 'a
berghofe@5177
    14
berghofe@5661
    15
  val add_path : bool -> string -> theory -> theory
berghofe@5661
    16
  val parent_path : bool -> theory -> theory
berghofe@5661
    17
haftmann@18314
    18
  val store_thmss : string -> string list -> thm list list -> theory -> thm list list * theory
wenzelm@8435
    19
  val store_thms_atts : string -> string list -> theory attribute list list -> thm list
haftmann@18314
    20
    -> theory -> thm list * theory
haftmann@18314
    21
  val store_thms : string -> string list -> thm list -> theory -> thm list * theory
berghofe@5177
    22
berghofe@5177
    23
  val split_conj_thm : thm -> thm list
berghofe@5177
    24
  val mk_conj : term list -> term
berghofe@5177
    25
  val mk_disj : term list -> term
berghofe@5177
    26
berghofe@13641
    27
  val app_bnds : term -> int -> term
berghofe@13641
    28
berghofe@13641
    29
  val cong_tac : int -> tactic
berghofe@5177
    30
  val indtac : thm -> int -> tactic
berghofe@5177
    31
  val exh_tac : (string -> thm) -> int -> tactic
berghofe@5177
    32
berghofe@7015
    33
  datatype simproc_dist = QuickAndDirty
berghofe@7015
    34
                        | FewConstrs of thm list
berghofe@7015
    35
                        | ManyConstrs of thm * simpset;
berghofe@7015
    36
berghofe@5177
    37
  datatype dtyp =
berghofe@5177
    38
      DtTFree of string
berghofe@5177
    39
    | DtType of string * (dtyp list)
berghofe@5177
    40
    | DtRec of int;
wenzelm@8404
    41
  type descr
berghofe@5177
    42
  type datatype_info
berghofe@5177
    43
berghofe@7015
    44
  exception Datatype
berghofe@14887
    45
  exception Datatype_Empty of string
berghofe@9740
    46
  val name_of_typ : typ -> string
berghofe@5177
    47
  val dtyp_of_typ : (string * string list) list -> typ -> dtyp
berghofe@5177
    48
  val mk_Free : string -> typ -> int -> term
berghofe@5177
    49
  val is_rec_type : dtyp -> bool
berghofe@13641
    50
  val typ_of_dtyp : descr -> (string * sort) list -> dtyp -> typ
berghofe@5177
    51
  val dest_DtTFree : dtyp -> string
berghofe@5177
    52
  val dest_DtRec : dtyp -> int
berghofe@13641
    53
  val strip_dtyp : dtyp -> dtyp list * dtyp
berghofe@13641
    54
  val body_index : dtyp -> int
berghofe@13641
    55
  val mk_fun_dtyp : dtyp list -> dtyp -> dtyp
berghofe@5177
    56
  val dest_TFree : typ -> string
berghofe@13641
    57
  val get_nonrec_types : descr -> (string * sort) list -> typ list
berghofe@13641
    58
  val get_branching_types : descr -> (string * sort) list -> typ list
berghofe@13641
    59
  val get_arities : descr -> int list
berghofe@13641
    60
  val get_rec_types : descr -> (string * sort) list -> typ list
berghofe@13641
    61
  val check_nonempty : descr list -> unit
berghofe@5177
    62
  val unfold_datatypes : 
berghofe@13641
    63
    Sign.sg -> descr -> (string * sort) list -> datatype_info Symtab.table ->
berghofe@13641
    64
      descr -> int -> descr list * int
berghofe@5177
    65
end;
berghofe@5177
    66
berghofe@5177
    67
structure DatatypeAux : DATATYPE_AUX =
berghofe@5177
    68
struct
berghofe@5177
    69
berghofe@5661
    70
val quiet_mode = ref false;
berghofe@5661
    71
fun message s = if !quiet_mode then () else writeln s;
berghofe@5661
    72
berghofe@5177
    73
(* FIXME: move to library ? *)
skalberg@15570
    74
fun foldl1 f (x::xs) = Library.foldl f (x, xs);
berghofe@5177
    75
berghofe@5661
    76
fun add_path flat_names s = if flat_names then I else Theory.add_path s;
berghofe@5661
    77
fun parent_path flat_names = if flat_names then I else Theory.parent_path;
berghofe@5661
    78
wenzelm@8435
    79
berghofe@5177
    80
(* store theorems in theory *)
berghofe@5177
    81
berghofe@18101
    82
fun store_thmss_atts label tnames attss thmss thy =
berghofe@18101
    83
  (thy, tnames ~~ attss ~~ thmss) |>
berghofe@18101
    84
  foldl_map (fn (thy', ((tname, atts), thms)) => thy' |>
berghofe@5661
    85
    Theory.add_path tname |>
berghofe@18101
    86
    (apsnd hd o PureThy.add_thmss [((label, thms), atts)]) |>>
haftmann@18314
    87
    Theory.parent_path) |> Library.swap;
berghofe@5177
    88
berghofe@18101
    89
fun store_thmss label tnames = store_thmss_atts label tnames (replicate (length tnames) []);
berghofe@18101
    90
wenzelm@8435
    91
fun store_thms_atts label tnames attss thms thy =
wenzelm@8435
    92
  (thy, tnames ~~ attss ~~ thms) |>
wenzelm@8435
    93
  foldl_map (fn (thy', ((tname, atts), thm)) => thy' |>
berghofe@5661
    94
    Theory.add_path tname |>
wenzelm@8435
    95
    (apsnd hd o PureThy.add_thms [((label, thm), atts)]) |>>
haftmann@18314
    96
    Theory.parent_path) |> Library.swap;
wenzelm@8435
    97
wenzelm@8435
    98
fun store_thms label tnames = store_thms_atts label tnames (replicate (length tnames) []);
wenzelm@8435
    99
berghofe@5177
   100
berghofe@5177
   101
(* split theorem thm_1 & ... & thm_n into n theorems *)
berghofe@5177
   102
berghofe@5177
   103
fun split_conj_thm th =
berghofe@7015
   104
  ((th RS conjunct1)::(split_conj_thm (th RS conjunct2))) handle THM _ => [th];
berghofe@5177
   105
berghofe@5177
   106
val mk_conj = foldr1 (HOLogic.mk_binop "op &");
berghofe@5177
   107
val mk_disj = foldr1 (HOLogic.mk_binop "op |");
berghofe@5177
   108
berghofe@13641
   109
fun app_bnds t i = list_comb (t, map Bound (i - 1 downto 0));
berghofe@13641
   110
berghofe@13641
   111
berghofe@13641
   112
fun cong_tac i st = (case Logic.strip_assums_concl
skalberg@15570
   113
  (List.nth (prems_of st, i - 1)) of
berghofe@13641
   114
    _ $ (_ $ (f $ x) $ (g $ y)) =>
berghofe@13641
   115
      let
wenzelm@18145
   116
        val cong' = Thm.lift_rule (Thm.cprem_of st i) cong;
berghofe@13641
   117
        val _ $ (_ $ (f' $ x') $ (g' $ y')) =
berghofe@13641
   118
          Logic.strip_assums_concl (prop_of cong');
berghofe@13641
   119
        val insts = map (pairself (cterm_of (#sign (rep_thm st))) o
berghofe@13641
   120
          apsnd (curry list_abs (Logic.strip_params (concl_of cong'))) o
berghofe@13641
   121
            apfst head_of) [(f', f), (g', g), (x', x), (y', y)]
berghofe@13641
   122
      in compose_tac (false, cterm_instantiate insts cong', 2) i st
berghofe@13641
   123
        handle THM _ => no_tac st
berghofe@13641
   124
      end
berghofe@13641
   125
  | _ => no_tac st);
berghofe@5177
   126
berghofe@5177
   127
(* instantiate induction rule *)
berghofe@5177
   128
berghofe@5177
   129
fun indtac indrule i st =
berghofe@5177
   130
  let
wenzelm@8305
   131
    val ts = HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of indrule));
wenzelm@8305
   132
    val ts' = HOLogic.dest_conj (HOLogic.dest_Trueprop
skalberg@15570
   133
      (Logic.strip_imp_concl (List.nth (prems_of st, i - 1))));
berghofe@5177
   134
    val getP = if can HOLogic.dest_imp (hd ts) then
skalberg@15531
   135
      (apfst SOME) o HOLogic.dest_imp else pair NONE;
berghofe@5177
   136
    fun abstr (t1, t2) = (case t1 of
skalberg@15531
   137
        NONE => let val [Free (s, T)] = add_term_frees (t2, [])
berghofe@5177
   138
          in absfree (s, T, t2) end
skalberg@15531
   139
      | SOME (_ $ t' $ _) => Abs ("x", fastype_of t', abstract_over (t', t2)))
wenzelm@6394
   140
    val cert = cterm_of (Thm.sign_of_thm st);
berghofe@5177
   141
    val Ps = map (cert o head_of o snd o getP) ts;
berghofe@5177
   142
    val indrule' = cterm_instantiate (Ps ~~
berghofe@5177
   143
      (map (cert o abstr o getP) ts')) indrule
berghofe@5177
   144
  in
berghofe@5177
   145
    rtac indrule' i st
berghofe@5177
   146
  end;
berghofe@5177
   147
berghofe@5177
   148
(* perform exhaustive case analysis on last parameter of subgoal i *)
berghofe@5177
   149
berghofe@5177
   150
fun exh_tac exh_thm_of i state =
berghofe@5177
   151
  let
wenzelm@6394
   152
    val sg = Thm.sign_of_thm state;
skalberg@15570
   153
    val prem = List.nth (prems_of state, i - 1);
berghofe@5177
   154
    val params = Logic.strip_params prem;
berghofe@5177
   155
    val (_, Type (tname, _)) = hd (rev params);
wenzelm@18145
   156
    val exhaustion = Thm.lift_rule (Thm.cprem_of state i) (exh_thm_of tname);
berghofe@5177
   157
    val prem' = hd (prems_of exhaustion);
berghofe@5177
   158
    val _ $ (_ $ lhs $ _) = hd (rev (Logic.strip_assums_hyp prem'));
berghofe@5177
   159
    val exhaustion' = cterm_instantiate [(cterm_of sg (head_of lhs),
skalberg@15574
   160
      cterm_of sg (foldr (fn ((_, T), t) => Abs ("z", T, t))
skalberg@15574
   161
        (Bound 0) params))] exhaustion
berghofe@5177
   162
  in compose_tac (false, exhaustion', nprems_of exhaustion) i state
berghofe@5177
   163
  end;
berghofe@5177
   164
berghofe@7015
   165
(* handling of distinctness theorems *)
berghofe@7015
   166
berghofe@7015
   167
datatype simproc_dist = QuickAndDirty
berghofe@7015
   168
                      | FewConstrs of thm list
berghofe@7015
   169
                      | ManyConstrs of thm * simpset;
berghofe@7015
   170
berghofe@5177
   171
(********************** Internal description of datatypes *********************)
berghofe@5177
   172
berghofe@5177
   173
datatype dtyp =
berghofe@5177
   174
    DtTFree of string
berghofe@5177
   175
  | DtType of string * (dtyp list)
berghofe@5177
   176
  | DtRec of int;
berghofe@5177
   177
berghofe@5177
   178
(* information about datatypes *)
berghofe@5177
   179
berghofe@16901
   180
(* index, datatype name, type arguments, constructor name, types of constructor's arguments *)
wenzelm@8404
   181
type descr = (int * (string * dtyp list * (string * dtyp list) list)) list;
wenzelm@8404
   182
berghofe@5177
   183
type datatype_info =
berghofe@5177
   184
  {index : int,
wenzelm@8404
   185
   descr : descr,
berghofe@18319
   186
   sorts : (string * sort) list,
berghofe@5177
   187
   rec_names : string list,
berghofe@5177
   188
   rec_rewrites : thm list,
berghofe@5177
   189
   case_name : string,
berghofe@5177
   190
   case_rewrites : thm list,
berghofe@5177
   191
   induction : thm,
berghofe@5177
   192
   exhaustion : thm,
berghofe@7015
   193
   distinct : simproc_dist,
berghofe@5177
   194
   inject : thm list,
berghofe@5177
   195
   nchotomy : thm,
wenzelm@10120
   196
   case_cong : thm,
wenzelm@10120
   197
   weak_case_cong : thm};
berghofe@5177
   198
berghofe@5177
   199
fun mk_Free s T i = Free (s ^ (string_of_int i), T);
berghofe@5177
   200
berghofe@5177
   201
fun subst_DtTFree _ substs (T as (DtTFree name)) =
haftmann@17485
   202
      AList.lookup (op =) substs name |> the_default T
berghofe@5177
   203
  | subst_DtTFree i substs (DtType (name, ts)) =
berghofe@5177
   204
      DtType (name, map (subst_DtTFree i substs) ts)
berghofe@5177
   205
  | subst_DtTFree i _ (DtRec j) = DtRec (i + j);
berghofe@5177
   206
berghofe@7015
   207
exception Datatype;
berghofe@14887
   208
exception Datatype_Empty of string;
berghofe@7015
   209
berghofe@7015
   210
fun dest_DtTFree (DtTFree a) = a
berghofe@7015
   211
  | dest_DtTFree _ = raise Datatype;
berghofe@7015
   212
berghofe@7015
   213
fun dest_DtRec (DtRec i) = i
berghofe@7015
   214
  | dest_DtRec _ = raise Datatype;
berghofe@5177
   215
berghofe@5177
   216
fun is_rec_type (DtType (_, dts)) = exists is_rec_type dts
berghofe@5177
   217
  | is_rec_type (DtRec _) = true
berghofe@5177
   218
  | is_rec_type _ = false;
berghofe@5177
   219
berghofe@13641
   220
fun strip_dtyp (DtType ("fun", [T, U])) = apfst (cons T) (strip_dtyp U)
berghofe@13641
   221
  | strip_dtyp T = ([], T);
berghofe@13641
   222
berghofe@13641
   223
val body_index = dest_DtRec o snd o strip_dtyp;
berghofe@13641
   224
berghofe@13641
   225
fun mk_fun_dtyp [] U = U
berghofe@13641
   226
  | mk_fun_dtyp (T :: Ts) U = DtType ("fun", [T, mk_fun_dtyp Ts U]);
berghofe@13641
   227
berghofe@5177
   228
fun dest_TFree (TFree (n, _)) = n;
berghofe@5177
   229
berghofe@13707
   230
fun name_of_typ (Type (s, Ts)) =
berghofe@13707
   231
      let val s' = Sign.base_name s
skalberg@15570
   232
      in space_implode "_" (List.filter (not o equal "") (map name_of_typ Ts) @
wenzelm@14673
   233
        [if Syntax.is_identifier s' then s' else "x"])
berghofe@13707
   234
      end
berghofe@9740
   235
  | name_of_typ _ = "";
berghofe@9740
   236
berghofe@5177
   237
fun dtyp_of_typ _ (TFree (n, _)) = DtTFree n
berghofe@5177
   238
  | dtyp_of_typ _ (TVar _) = error "Illegal schematic type variable(s)"
berghofe@5177
   239
  | dtyp_of_typ new_dts (Type (tname, Ts)) =
haftmann@17485
   240
      (case AList.lookup (op =) new_dts tname of
skalberg@15531
   241
         NONE => DtType (tname, map (dtyp_of_typ new_dts) Ts)
skalberg@15531
   242
       | SOME vs => if map (try dest_TFree) Ts = map SOME vs then
berghofe@5177
   243
             DtRec (find_index (curry op = tname o fst) new_dts)
huffman@18069
   244
           else error ("Illegal occurrence of recursive type " ^ tname));
berghofe@5177
   245
haftmann@17485
   246
fun typ_of_dtyp descr sorts (DtTFree a) = TFree (a, (the o AList.lookup (op =) sorts) a)
berghofe@5177
   247
  | typ_of_dtyp descr sorts (DtRec i) =
haftmann@17485
   248
      let val (s, ds, _) = (the o AList.lookup (op =) descr) i
berghofe@5177
   249
      in Type (s, map (typ_of_dtyp descr sorts) ds) end
berghofe@5177
   250
  | typ_of_dtyp descr sorts (DtType (s, ds)) =
berghofe@5177
   251
      Type (s, map (typ_of_dtyp descr sorts) ds);
berghofe@5177
   252
berghofe@5177
   253
(* find all non-recursive types in datatype description *)
berghofe@5177
   254
berghofe@5177
   255
fun get_nonrec_types descr sorts =
skalberg@15570
   256
  map (typ_of_dtyp descr sorts) (Library.foldl (fn (Ts, (_, (_, _, constrs))) =>
skalberg@15570
   257
    Library.foldl (fn (Ts', (_, cargs)) =>
berghofe@13641
   258
      filter_out is_rec_type cargs union Ts') (Ts, constrs)) ([], descr));
berghofe@5177
   259
berghofe@5177
   260
(* get all recursive types in datatype description *)
berghofe@5177
   261
berghofe@5177
   262
fun get_rec_types descr sorts = map (fn (_ , (s, ds, _)) =>
berghofe@5177
   263
  Type (s, map (typ_of_dtyp descr sorts) ds)) descr;
berghofe@5177
   264
berghofe@7015
   265
(* get all branching types *)
berghofe@7015
   266
berghofe@13641
   267
fun get_branching_types descr sorts =
skalberg@15570
   268
  map (typ_of_dtyp descr sorts) (Library.foldl (fn (Ts, (_, (_, _, constrs))) =>
skalberg@15574
   269
    Library.foldl (fn (Ts', (_, cargs)) => foldr op union Ts' (map (fst o strip_dtyp)
skalberg@15574
   270
      cargs)) (Ts, constrs)) ([], descr));
berghofe@13641
   271
skalberg@15570
   272
fun get_arities descr = Library.foldl (fn (is, (_, (_, _, constrs))) =>
skalberg@15570
   273
  Library.foldl (fn (is', (_, cargs)) => map (length o fst o strip_dtyp)
skalberg@15570
   274
    (List.filter is_rec_type cargs) union is') (is, constrs)) ([], descr);
berghofe@7015
   275
berghofe@5177
   276
(* nonemptiness check for datatypes *)
berghofe@5177
   277
berghofe@5177
   278
fun check_nonempty descr =
berghofe@5177
   279
  let
skalberg@15570
   280
    val descr' = List.concat descr;
berghofe@5177
   281
    fun is_nonempty_dt is i =
berghofe@5177
   282
      let
haftmann@17485
   283
        val (_, _, constrs) = (the o AList.lookup (op =) descr') i;
berghofe@13641
   284
        fun arg_nonempty (_, DtRec i) = if i mem is then false
berghofe@5177
   285
              else is_nonempty_dt (i::is) i
berghofe@5177
   286
          | arg_nonempty _ = true;
berghofe@13641
   287
      in exists ((forall (arg_nonempty o strip_dtyp)) o snd) constrs
berghofe@5177
   288
      end
berghofe@5177
   289
  in assert_all (fn (i, _) => is_nonempty_dt [i] i) (hd descr)
berghofe@14887
   290
    (fn (_, (s, _, _)) => raise Datatype_Empty s)
berghofe@5177
   291
  end;
berghofe@5177
   292
berghofe@5177
   293
(* unfold a list of mutually recursive datatype specifications *)
berghofe@5177
   294
(* all types of the form DtType (dt_name, [..., DtRec _, ...]) *)
berghofe@5177
   295
(* need to be unfolded                                         *)
berghofe@5177
   296
berghofe@7015
   297
fun unfold_datatypes sign orig_descr sorts (dt_info : datatype_info Symtab.table) descr i =
berghofe@5177
   298
  let
berghofe@7015
   299
    fun typ_error T msg = error ("Non-admissible type expression\n" ^
berghofe@7015
   300
      Sign.string_of_typ sign (typ_of_dtyp (orig_descr @ descr) sorts T) ^ "\n" ^ msg);
berghofe@7015
   301
berghofe@7015
   302
    fun get_dt_descr T i tname dts =
wenzelm@17412
   303
      (case Symtab.lookup dt_info tname of
skalberg@15531
   304
         NONE => typ_error T (tname ^ " is not a datatype - can't use it in\
berghofe@7015
   305
           \ nested recursion")
skalberg@15531
   306
       | (SOME {index, descr, ...}) =>
haftmann@17485
   307
           let val (_, vars, _) = (the o AList.lookup (op =) descr) index;
skalberg@15570
   308
               val subst = ((map dest_DtTFree vars) ~~ dts) handle UnequalLengths =>
berghofe@7015
   309
                 typ_error T ("Type constructor " ^ tname ^ " used with wrong\
berghofe@5177
   310
                  \ number of arguments")
berghofe@5177
   311
           in (i + index, map (fn (j, (tn, args, cs)) => (i + j,
berghofe@5177
   312
             (tn, map (subst_DtTFree i subst) args,
berghofe@5177
   313
              map (apsnd (map (subst_DtTFree i subst))) cs))) descr)
berghofe@5177
   314
           end);
berghofe@5177
   315
berghofe@5177
   316
    (* unfold a single constructor argument *)
berghofe@5177
   317
berghofe@13641
   318
    fun unfold_arg ((i, Ts, descrs), T) =
berghofe@13641
   319
      if is_rec_type T then
berghofe@13641
   320
        let val (Us, U) = strip_dtyp T
berghofe@13641
   321
        in if exists is_rec_type Us then
berghofe@13641
   322
            typ_error T "Non-strictly positive recursive occurrence of type"
berghofe@13641
   323
          else (case U of
berghofe@13641
   324
              DtType (tname, dts) =>  
berghofe@13641
   325
                let
berghofe@13641
   326
                  val (index, descr) = get_dt_descr T i tname dts;
berghofe@13641
   327
                  val (descr', i') = unfold_datatypes sign orig_descr sorts
berghofe@13641
   328
                    dt_info descr (i + length descr)
berghofe@13641
   329
                in (i', Ts @ [mk_fun_dtyp Us (DtRec index)], descrs @ descr') end
berghofe@13641
   330
            | _ => (i, Ts @ [T], descrs))
berghofe@13641
   331
        end
berghofe@13641
   332
      else (i, Ts @ [T], descrs);
berghofe@5177
   333
berghofe@5177
   334
    (* unfold a constructor *)
berghofe@5177
   335
berghofe@5177
   336
    fun unfold_constr ((i, constrs, descrs), (cname, cargs)) =
skalberg@15570
   337
      let val (i', cargs', descrs') = Library.foldl unfold_arg ((i, [], descrs), cargs)
berghofe@5177
   338
      in (i', constrs @ [(cname, cargs')], descrs') end;
berghofe@5177
   339
berghofe@5177
   340
    (* unfold a single datatype *)
berghofe@5177
   341
berghofe@5177
   342
    fun unfold_datatype ((i, dtypes, descrs), (j, (tname, tvars, constrs))) =
berghofe@5177
   343
      let val (i', constrs', descrs') =
skalberg@15570
   344
        Library.foldl unfold_constr ((i, [], descrs), constrs)
berghofe@5177
   345
      in (i', dtypes @ [(j, (tname, tvars, constrs'))], descrs')
berghofe@5177
   346
      end;
berghofe@5177
   347
skalberg@15570
   348
    val (i', descr', descrs) = Library.foldl unfold_datatype ((i, [],[]), descr);
berghofe@5177
   349
berghofe@5177
   350
  in (descr' :: descrs, i') end;
berghofe@5177
   351
berghofe@5177
   352
end;