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