src/HOL/Tools/record_package.ML
author wenzelm
Tue Jan 12 13:54:51 1999 +0100 (1999-01-12)
changeset 6092 d9db67970c73
parent 5890 92ba560f39ab
child 6358 92dbe243555f
permissions -rw-r--r--
eliminated tthm type and Attribute structure;
wenzelm@4867
     1
(*  Title:      HOL/Tools/record_package.ML
wenzelm@4867
     2
    ID:         $Id$
wenzelm@4867
     3
    Author:     Wolfgang Naraschewski and Markus Wenzel, TU Muenchen
wenzelm@4867
     4
wenzelm@4867
     5
Extensible records with structural subtyping in HOL.
wenzelm@5698
     6
*)
wenzelm@4867
     7
wenzelm@5698
     8
signature BASIC_RECORD_PACKAGE =
wenzelm@5698
     9
sig
wenzelm@5698
    10
  val record_split_tac: int -> tactic
wenzelm@5713
    11
  val record_split_name: string
wenzelm@5698
    12
  val record_split_wrapper: string * wrapper
wenzelm@5698
    13
end;
wenzelm@4867
    14
wenzelm@4867
    15
signature RECORD_PACKAGE =
wenzelm@4867
    16
sig
wenzelm@5698
    17
  include BASIC_RECORD_PACKAGE
wenzelm@5698
    18
  val quiet_mode: bool ref
wenzelm@4890
    19
  val moreS: sort
wenzelm@4890
    20
  val mk_fieldT: (string * typ) * typ -> typ
wenzelm@4890
    21
  val dest_fieldT: typ -> (string * typ) * typ
wenzelm@4890
    22
  val mk_field: (string * term) * term -> term
wenzelm@4890
    23
  val mk_fst: term -> term
wenzelm@4890
    24
  val mk_snd: term -> term
wenzelm@4890
    25
  val mk_recordT: (string * typ) list * typ -> typ
wenzelm@4890
    26
  val dest_recordT: typ -> (string * typ) list * typ
wenzelm@4890
    27
  val mk_record: (string * term) list * term -> term
wenzelm@4890
    28
  val mk_sel: term -> string -> term
wenzelm@4890
    29
  val mk_update: term -> string * term -> term
wenzelm@4867
    30
  val print_records: theory -> unit
wenzelm@4867
    31
  val add_record: (string list * bstring) -> string option
wenzelm@4867
    32
    -> (bstring * string) list -> theory -> theory
wenzelm@4867
    33
  val add_record_i: (string list * bstring) -> (typ list * string) option
wenzelm@4867
    34
    -> (bstring * typ) list -> theory -> theory
wenzelm@4867
    35
  val setup: (theory -> theory) list
wenzelm@4867
    36
end;
wenzelm@4867
    37
wenzelm@4867
    38
structure RecordPackage: RECORD_PACKAGE =
wenzelm@4867
    39
struct
wenzelm@4867
    40
wenzelm@4867
    41
wenzelm@4894
    42
(*** utilities ***)
wenzelm@4867
    43
wenzelm@5698
    44
(* messages *)
wenzelm@5698
    45
wenzelm@5698
    46
val quiet_mode = ref false;
wenzelm@5698
    47
fun message s = if ! quiet_mode then () else writeln s;
wenzelm@5698
    48
wenzelm@5698
    49
wenzelm@5707
    50
(* attributes etc. *)        (* FIXME move to Provers *)
wenzelm@5707
    51
wenzelm@5707
    52
fun add_iffs_global (thy, th) =
wenzelm@5707
    53
  let
wenzelm@5707
    54
    val ss = Simplifier.simpset_ref_of thy;
wenzelm@5707
    55
    val cs = Classical.claset_ref_of thy;
wenzelm@6092
    56
    val (cs', ss') = (! cs, ! ss) addIffs [th];
wenzelm@5707
    57
  in ss := ss'; cs := cs'; (thy, th) end;
wenzelm@5707
    58
wenzelm@5707
    59
fun add_wrapper wrapper thy =
wenzelm@5713
    60
  let val r = Classical.claset_ref_of thy
wenzelm@5707
    61
  in r := ! r addSWrapper wrapper; thy end;
wenzelm@5707
    62
wenzelm@5707
    63
wenzelm@4894
    64
(* definitions and equations *)
wenzelm@4867
    65
wenzelm@5698
    66
infix 0 :== ===;
wenzelm@4894
    67
wenzelm@4894
    68
val (op :==) = Logic.mk_defpair;
wenzelm@4894
    69
val (op ===) = HOLogic.mk_Trueprop o HOLogic.mk_eq;
wenzelm@4894
    70
wenzelm@6092
    71
fun get_defs thy specs = map (PureThy.get_thm thy o fst) specs;
wenzelm@4894
    72
wenzelm@4894
    73
wenzelm@4894
    74
(* proof by simplification *)
wenzelm@4890
    75
wenzelm@5698
    76
fun prove_simp thy tacs simps =
wenzelm@4894
    77
  let
wenzelm@4895
    78
    val sign = Theory.sign_of thy;
wenzelm@6092
    79
    val ss = Simplifier.addsimps (HOL_basic_ss, simps);
wenzelm@4895
    80
wenzelm@4895
    81
    fun prove goal =
wenzelm@6092
    82
      Goals.prove_goalw_cterm [] (Thm.cterm_of sign goal)
wenzelm@6092
    83
        (K (tacs @ [ALLGOALS (Simplifier.simp_tac ss)]))
wenzelm@6092
    84
      handle ERROR => error ("The error(s) above occurred while trying to prove "
wenzelm@6092
    85
        ^ quote (Sign.string_of_term sign goal));
wenzelm@4894
    86
  in prove end;
wenzelm@4894
    87
wenzelm@4894
    88
wenzelm@4894
    89
wenzelm@4894
    90
(*** syntax operations ***)
wenzelm@4894
    91
wenzelm@4894
    92
(** name components **)
wenzelm@4894
    93
wenzelm@4894
    94
val moreN = "more";
wenzelm@4894
    95
val schemeN = "_scheme";
wenzelm@4894
    96
val fieldN = "_field";
wenzelm@5698
    97
val raw_fieldN = "_raw_field";
wenzelm@4894
    98
val field_typeN = "_field_type";
wenzelm@5698
    99
val fstN = "_val";
wenzelm@5698
   100
val sndN = "_more";
wenzelm@4894
   101
val updateN = "_update";
wenzelm@4894
   102
val makeN = "make";
wenzelm@4894
   103
val make_schemeN = "make_scheme";
wenzelm@4890
   104
wenzelm@5698
   105
(*see datatype package*)
wenzelm@5698
   106
val caseN = "_case";
wenzelm@5698
   107
wenzelm@5698
   108
wenzelm@5698
   109
wenzelm@5698
   110
(** generic operations **)
wenzelm@5698
   111
wenzelm@5713
   112
(* adhoc priming of vars *)
wenzelm@5713
   113
wenzelm@5713
   114
fun prime (Free (x, T)) = Free (x ^ "'", T)
wenzelm@5713
   115
  | prime t = raise TERM ("prime: no free variable", [t]);
wenzelm@5713
   116
wenzelm@5713
   117
wenzelm@5713
   118
(* product case *)
wenzelm@5713
   119
wenzelm@5698
   120
fun fst_fn T U = Abs ("x", T, Abs ("y", U, Bound 1));
wenzelm@5698
   121
fun snd_fn T U = Abs ("x", T, Abs ("y", U, Bound 0));
wenzelm@5698
   122
wenzelm@5698
   123
fun mk_prod_case name f p =
wenzelm@5698
   124
  let
wenzelm@5698
   125
    val fT as Type ("fun", [A, Type ("fun", [B, C])]) = fastype_of f;
wenzelm@5698
   126
    val pT = fastype_of p;
wenzelm@5698
   127
  in Const (suffix caseN name, fT --> pT --> C) $ f $ p end;
wenzelm@5698
   128
wenzelm@4890
   129
wenzelm@4890
   130
wenzelm@4867
   131
(** tuple operations **)
wenzelm@4867
   132
wenzelm@4867
   133
(* more type class *)
wenzelm@4867
   134
wenzelm@5210
   135
val moreS = ["Record.more"];
wenzelm@4867
   136
wenzelm@4867
   137
wenzelm@4867
   138
(* types *)
wenzelm@4867
   139
wenzelm@4867
   140
fun mk_fieldT ((c, T), U) = Type (suffix field_typeN c, [T, U]);
wenzelm@4867
   141
wenzelm@4867
   142
fun dest_fieldT (typ as Type (c_field_type, [T, U])) =
wenzelm@4867
   143
      (case try (unsuffix field_typeN) c_field_type of
wenzelm@4867
   144
        None => raise TYPE ("dest_fieldT", [typ], [])
wenzelm@4867
   145
      | Some c => ((c, T), U))
wenzelm@4867
   146
  | dest_fieldT typ = raise TYPE ("dest_fieldT", [typ], []);
wenzelm@4867
   147
wenzelm@4867
   148
wenzelm@4867
   149
(* constructors *)
wenzelm@4867
   150
wenzelm@4867
   151
fun mk_fieldC U (c, T) = (suffix fieldN c, T --> U --> mk_fieldT ((c, T), U));
wenzelm@4867
   152
wenzelm@5698
   153
fun gen_mk_field sfx ((c, t), u) =
wenzelm@4867
   154
  let val T = fastype_of t and U = fastype_of u
wenzelm@5698
   155
  in Const (suffix sfx c, [T, U] ---> mk_fieldT ((c, T), U)) $ t $ u end;
wenzelm@5698
   156
wenzelm@5698
   157
val mk_field = gen_mk_field fieldN;
wenzelm@5698
   158
val mk_raw_field = gen_mk_field raw_fieldN;
wenzelm@4867
   159
wenzelm@4867
   160
wenzelm@4867
   161
(* destructors *)
wenzelm@4867
   162
wenzelm@4867
   163
fun mk_fstC U (c, T) = (suffix fstN c, mk_fieldT ((c, T), U) --> T);
wenzelm@4867
   164
fun mk_sndC U (c, T) = (suffix sndN c, mk_fieldT ((c, T), U) --> U);
wenzelm@4867
   165
wenzelm@4867
   166
fun dest_field fst_or_snd p =
wenzelm@4867
   167
  let
wenzelm@4867
   168
    val pT = fastype_of p;
wenzelm@4867
   169
    val ((c, T), U) = dest_fieldT pT;
wenzelm@4867
   170
    val (destN, destT) = if fst_or_snd then (fstN, T) else (sndN, U);
wenzelm@4867
   171
  in Const (suffix destN c, pT --> destT) $ p end;
wenzelm@4867
   172
wenzelm@4867
   173
val mk_fst = dest_field true;
wenzelm@4867
   174
val mk_snd = dest_field false;
wenzelm@4867
   175
wenzelm@4867
   176
wenzelm@4867
   177
wenzelm@4867
   178
(** record operations **)
wenzelm@4867
   179
wenzelm@4867
   180
(* types *)
wenzelm@4867
   181
wenzelm@4867
   182
val mk_recordT = foldr mk_fieldT;
wenzelm@4867
   183
wenzelm@4867
   184
fun dest_recordT T =
wenzelm@4867
   185
  (case try dest_fieldT T of
wenzelm@4867
   186
    None => ([], T)
wenzelm@4867
   187
  | Some (c_T, U) => apfst (cons c_T) (dest_recordT U));
wenzelm@4867
   188
wenzelm@4867
   189
fun find_fieldT c rT =
wenzelm@4867
   190
  (case assoc (fst (dest_recordT rT), c) of
wenzelm@4867
   191
    None => raise TYPE ("find_field: " ^ c, [rT], [])
wenzelm@4867
   192
  | Some T => T);
wenzelm@4867
   193
wenzelm@4867
   194
wenzelm@4867
   195
(* constructors *)
wenzelm@4867
   196
wenzelm@4867
   197
val mk_record = foldr mk_field;
wenzelm@4867
   198
wenzelm@4867
   199
wenzelm@4867
   200
(* selectors *)
wenzelm@4867
   201
wenzelm@4867
   202
fun mk_selC rT (c, T) = (c, rT --> T);
wenzelm@4867
   203
wenzelm@4890
   204
fun mk_sel r c =
wenzelm@4867
   205
  let val rT = fastype_of r
wenzelm@4867
   206
  in Const (mk_selC rT (c, find_fieldT c rT)) $ r end;
wenzelm@4867
   207
wenzelm@4894
   208
val mk_moreC = mk_selC;
wenzelm@4894
   209
wenzelm@4894
   210
fun mk_more r c =
wenzelm@4894
   211
  let val rT = fastype_of r
wenzelm@4894
   212
  in Const (mk_moreC rT (c, snd (dest_recordT rT))) $ r end;
wenzelm@4894
   213
wenzelm@4867
   214
wenzelm@4867
   215
(* updates *)
wenzelm@4867
   216
wenzelm@4867
   217
fun mk_updateC rT (c, T) = (suffix updateN c, T --> rT --> rT);
wenzelm@4867
   218
wenzelm@4890
   219
fun mk_update r (c, x) =
wenzelm@4867
   220
  let val rT = fastype_of r
wenzelm@4867
   221
  in Const (mk_updateC rT (c, find_fieldT c rT)) $ x $ r end;
wenzelm@4867
   222
wenzelm@5197
   223
val mk_more_updateC = mk_updateC;
wenzelm@5197
   224
wenzelm@5197
   225
fun mk_more_update r (c, x) =
wenzelm@5197
   226
  let val rT = fastype_of r
wenzelm@5197
   227
  in Const (mk_more_updateC rT (c, snd (dest_recordT rT))) $ x $ r end;
wenzelm@5197
   228
wenzelm@4867
   229
wenzelm@4890
   230
(* make *)
wenzelm@4890
   231
wenzelm@4890
   232
fun mk_makeC rT (c, Ts) = (c, Ts ---> rT);
wenzelm@4890
   233
wenzelm@4890
   234
wenzelm@4867
   235
wenzelm@4867
   236
(** concrete syntax for records **)
wenzelm@4867
   237
wenzelm@4867
   238
(* parse translations *)
wenzelm@4867
   239
wenzelm@5197
   240
fun gen_field_tr mark sfx (t as Const (c, _) $ Free (name, _) $ arg) =
wenzelm@5197
   241
      if c = mark then Syntax.const (suffix sfx name) $ arg
wenzelm@5197
   242
      else raise TERM ("gen_field_tr: " ^ mark, [t])
wenzelm@5197
   243
  | gen_field_tr mark _ t = raise TERM ("gen_field_tr: " ^ mark, [t]);
wenzelm@4867
   244
wenzelm@5197
   245
fun gen_fields_tr sep mark sfx (tm as Const (c, _) $ t $ u) =
wenzelm@5197
   246
      if c = sep then gen_field_tr mark sfx t :: gen_fields_tr sep mark sfx u
wenzelm@5201
   247
      else [gen_field_tr mark sfx tm]
wenzelm@5201
   248
  | gen_fields_tr _ mark sfx tm = [gen_field_tr mark sfx tm];
wenzelm@5197
   249
wenzelm@5197
   250
fun gen_record_tr sep mark sfx unit [t] = foldr (op $) (gen_fields_tr sep mark sfx t, unit)
wenzelm@5201
   251
  | gen_record_tr _ _ _ _ ts = raise TERM ("gen_record_tr", ts);
wenzelm@5197
   252
wenzelm@5197
   253
fun gen_record_scheme_tr sep mark sfx [t, more] = foldr (op $) (gen_fields_tr sep mark sfx t, more)
wenzelm@5201
   254
  | gen_record_scheme_tr _ _ _ ts = raise TERM ("gen_record_scheme_tr", ts);
wenzelm@5197
   255
wenzelm@4867
   256
wenzelm@5197
   257
val record_type_tr = gen_record_tr "_field_types" "_field_type" field_typeN (Syntax.const "unit");
wenzelm@5197
   258
val record_type_scheme_tr = gen_record_scheme_tr "_field_types" "_field_type" field_typeN;
wenzelm@5197
   259
wenzelm@5197
   260
val record_tr = gen_record_tr "_fields" "_field" fieldN HOLogic.unit;
wenzelm@5197
   261
val record_scheme_tr = gen_record_scheme_tr "_fields" "_field" fieldN;
wenzelm@4867
   262
wenzelm@5197
   263
fun record_update_tr [t, u] =
wenzelm@5197
   264
      foldr (op $) (rev (gen_fields_tr "_updates" "_update" updateN u), t)
wenzelm@5197
   265
  | record_update_tr ts = raise TERM ("record_update_tr", ts);
wenzelm@5197
   266
wenzelm@5197
   267
wenzelm@5197
   268
val parse_translation =
wenzelm@5197
   269
 [("_record_type", record_type_tr),
wenzelm@5197
   270
  ("_record_type_scheme", record_type_scheme_tr),
wenzelm@5197
   271
  ("_record", record_tr),
wenzelm@5197
   272
  ("_record_scheme", record_scheme_tr),
wenzelm@5197
   273
  ("_record_update", record_update_tr)];
wenzelm@4867
   274
wenzelm@4867
   275
wenzelm@4890
   276
(* print translations *)
wenzelm@4867
   277
wenzelm@5197
   278
fun gen_fields_tr' mark sfx (tm as Const (name_field, _) $ t $ u) =
wenzelm@5197
   279
      (case try (unsuffix sfx) name_field of
wenzelm@5197
   280
        Some name =>
wenzelm@5197
   281
          apfst (cons (Syntax.const mark $ Syntax.free name $ t)) (gen_fields_tr' mark sfx u)
wenzelm@5197
   282
      | None => ([], tm))
wenzelm@5197
   283
  | gen_fields_tr' _ _ tm = ([], tm);
wenzelm@5197
   284
wenzelm@5197
   285
fun gen_record_tr' sep mark sfx is_unit record record_scheme tm =
wenzelm@4867
   286
  let
wenzelm@5197
   287
    val (ts, u) = gen_fields_tr' mark sfx tm;
wenzelm@5197
   288
    val t' = foldr1 (fn (v, w) => Syntax.const sep $ v $ w) ts;
wenzelm@4867
   289
  in
wenzelm@5197
   290
    if is_unit u then Syntax.const record $ t'
wenzelm@5197
   291
    else Syntax.const record_scheme $ t' $ u
wenzelm@4867
   292
  end;
wenzelm@4867
   293
wenzelm@5197
   294
wenzelm@5197
   295
val record_type_tr' =
wenzelm@5197
   296
  gen_record_tr' "_field_types" "_field_type" field_typeN
wenzelm@5197
   297
    (fn Const ("unit", _) => true | _ => false) "_record_type" "_record_type_scheme";
wenzelm@5197
   298
wenzelm@5197
   299
val record_tr' =
wenzelm@5197
   300
  gen_record_tr' "_fields" "_field" fieldN HOLogic.is_unit "_record" "_record_scheme";
wenzelm@5197
   301
wenzelm@5197
   302
fun record_update_tr' tm =
wenzelm@5197
   303
  let val (ts, u) = gen_fields_tr' "_update" updateN tm in
wenzelm@5197
   304
    Syntax.const "_record_update" $ u $
wenzelm@5197
   305
      foldr1 (fn (v, w) => Syntax.const "_updates" $ v $ w) (rev ts)
wenzelm@5197
   306
  end;
wenzelm@5197
   307
wenzelm@5197
   308
wenzelm@5201
   309
fun gen_field_tr' sfx tr' name =
wenzelm@5201
   310
  let val name_sfx = suffix sfx name
wenzelm@5201
   311
  in (name_sfx, fn [t, u] => tr' (Syntax.const name_sfx $ t $ u) | _ => raise Match) end;
wenzelm@5201
   312
wenzelm@5197
   313
fun print_translation names =
wenzelm@5197
   314
  map (gen_field_tr' field_typeN record_type_tr') names @
wenzelm@5197
   315
  map (gen_field_tr' fieldN record_tr') names @
wenzelm@5197
   316
  map (gen_field_tr' updateN record_update_tr') names;
wenzelm@4867
   317
wenzelm@4867
   318
wenzelm@4867
   319
wenzelm@4867
   320
(*** extend theory by record definition ***)
wenzelm@4867
   321
wenzelm@4867
   322
(** record info **)
wenzelm@4867
   323
wenzelm@4867
   324
(* type record_info and parent_info *)
wenzelm@4867
   325
wenzelm@4867
   326
type record_info =
wenzelm@4867
   327
 {args: (string * sort) list,
wenzelm@4867
   328
  parent: (typ list * string) option,
wenzelm@4867
   329
  fields: (string * typ) list,
wenzelm@6092
   330
  simps: thm list};
wenzelm@4867
   331
wenzelm@4867
   332
type parent_info =
wenzelm@4867
   333
 {name: string,
wenzelm@4867
   334
  fields: (string * typ) list,
wenzelm@6092
   335
  simps: thm list};
wenzelm@4867
   336
wenzelm@4867
   337
wenzelm@5052
   338
(* data kind 'HOL/records' *)
wenzelm@5001
   339
wenzelm@5006
   340
structure RecordsArgs =
wenzelm@5006
   341
struct
wenzelm@5006
   342
  val name = "HOL/records";
wenzelm@5698
   343
  type T =
wenzelm@5707
   344
    record_info Symtab.table *                          (*records*)
wenzelm@5707
   345
      (thm Symtab.table * Simplifier.simpset);          (*field split rules*)
wenzelm@4867
   346
wenzelm@5698
   347
  val empty = (Symtab.empty, (Symtab.empty, HOL_basic_ss));
wenzelm@5006
   348
  val prep_ext = I;
wenzelm@5698
   349
  fun merge ((recs1, (sps1, ss1)), (recs2, (sps2, ss2))) =
wenzelm@5698
   350
    (Symtab.merge (K true) (recs1, recs2),
wenzelm@5698
   351
      (Symtab.merge (K true) (sps1, sps2), Simplifier.merge_ss (ss1, ss2)));
wenzelm@4867
   352
wenzelm@5698
   353
  fun print sg (recs, _) =
wenzelm@4867
   354
    let
wenzelm@4867
   355
      val prt_typ = Sign.pretty_typ sg;
wenzelm@4867
   356
      val ext_const = Sign.cond_extern sg Sign.constK;
wenzelm@4867
   357
wenzelm@4867
   358
      fun pretty_parent None = []
wenzelm@4867
   359
        | pretty_parent (Some (Ts, name)) =
wenzelm@4867
   360
            [Pretty.block [prt_typ (Type (name, Ts)), Pretty.str " +"]];
wenzelm@4867
   361
wenzelm@4867
   362
      fun pretty_field (c, T) = Pretty.block
wenzelm@4867
   363
        [Pretty.str (ext_const c), Pretty.str " ::", Pretty.brk 1, Pretty.quote (prt_typ T)];
wenzelm@4867
   364
wenzelm@4895
   365
      fun pretty_record (name, {args, parent, fields, simps = _}) = Pretty.block (Pretty.fbreaks
wenzelm@4867
   366
        (Pretty.block [prt_typ (Type (name, map TFree args)), Pretty.str " = "] ::
wenzelm@4867
   367
          pretty_parent parent @ map pretty_field fields));
wenzelm@4867
   368
    in
wenzelm@5698
   369
      seq (Pretty.writeln o pretty_record) (Symtab.dest recs)
wenzelm@4867
   370
    end;
wenzelm@4867
   371
end;
wenzelm@4867
   372
wenzelm@5006
   373
structure RecordsData = TheoryDataFun(RecordsArgs);
wenzelm@5006
   374
val print_records = RecordsData.print;
wenzelm@5006
   375
wenzelm@4867
   376
wenzelm@5698
   377
(* get and put data *)
wenzelm@4867
   378
wenzelm@5698
   379
fun get_record thy name = Symtab.lookup (#1 (RecordsData.get thy), name);
wenzelm@4867
   380
wenzelm@4890
   381
fun put_record name info thy =
wenzelm@5698
   382
  let val (tab, sp) = RecordsData.get thy
wenzelm@5698
   383
  in RecordsData.put (Symtab.update ((name, info), tab), sp) thy end;
wenzelm@5698
   384
wenzelm@5698
   385
fun add_record_splits splits thy =
wenzelm@5698
   386
  let
wenzelm@5698
   387
    val (tab, (sps, ss)) = RecordsData.get thy;
wenzelm@5698
   388
    val simps = map #2 splits;
wenzelm@5698
   389
  in RecordsData.put (tab, (Symtab.extend (sps, splits), Simplifier.addsimps (ss, simps))) thy end;
wenzelm@4867
   390
wenzelm@4867
   391
wenzelm@4867
   392
(* parent records *)
wenzelm@4867
   393
wenzelm@4867
   394
fun inst_record thy (types, name) =
wenzelm@4867
   395
  let
wenzelm@4867
   396
    val sign = Theory.sign_of thy;
wenzelm@4867
   397
    fun err msg = error (msg ^ " parent record " ^ quote name);
wenzelm@4867
   398
wenzelm@4895
   399
    val {args, parent, fields, simps} =
wenzelm@4867
   400
      (case get_record thy name of Some info => info | None => err "Unknown");
wenzelm@4895
   401
    val _ = if length types <> length args then err "Bad number of arguments for" else ();
wenzelm@4867
   402
wenzelm@4867
   403
    fun bad_inst ((x, S), T) =
wenzelm@4867
   404
      if Sign.of_sort sign (T, S) then None else Some x
wenzelm@4867
   405
    val bads = mapfilter bad_inst (args ~~ types);
wenzelm@4867
   406
wenzelm@4867
   407
    val inst = map fst args ~~ types;
wenzelm@4867
   408
    val subst = Term.map_type_tfree (fn (x, _) => the (assoc (inst, x)));
wenzelm@4867
   409
  in
wenzelm@4895
   410
    if not (null bads) then
wenzelm@4867
   411
      err ("Ill-sorted instantiation of " ^ commas bads ^ " in")
wenzelm@4895
   412
    else (apsome (apfst (map subst)) parent, map (apsnd subst) fields, simps)
wenzelm@4867
   413
  end;
wenzelm@4867
   414
wenzelm@4867
   415
fun add_parents thy (None, parents) = parents
wenzelm@4867
   416
  | add_parents thy (Some (types, name), parents) =
wenzelm@4895
   417
      let val (pparent, pfields, psimps) = inst_record thy (types, name)
wenzelm@4895
   418
      in add_parents thy (pparent, {name = name, fields = pfields, simps = psimps} :: parents) end;
wenzelm@4867
   419
wenzelm@4867
   420
wenzelm@4867
   421
wenzelm@5698
   422
(** record field splitting **)
wenzelm@5698
   423
wenzelm@5698
   424
fun record_split_tac i st =
wenzelm@5698
   425
  let
wenzelm@5698
   426
    val (_, (sps, ss)) = RecordsData.get_sg (Thm.sign_of_thm st);
wenzelm@5698
   427
wenzelm@5698
   428
    fun is_fieldT (_, Type (a, [_, _])) = is_some (Symtab.lookup (sps, a))
wenzelm@5698
   429
      | is_fieldT _ = false;
wenzelm@5698
   430
    val params = Logic.strip_params (Library.nth_elem (i - 1, Thm.prems_of st));
wenzelm@5698
   431
  in
wenzelm@5698
   432
    if exists is_fieldT params then Simplifier.full_simp_tac ss i st
wenzelm@5698
   433
    else Seq.empty
wenzelm@5698
   434
  end handle Library.LIST _ => Seq.empty;
wenzelm@5698
   435
wenzelm@5707
   436
val record_split_name = "record_split_tac";
wenzelm@5707
   437
val record_split_wrapper = (record_split_name, fn tac => record_split_tac ORELSE' tac);
wenzelm@5698
   438
wenzelm@5698
   439
wenzelm@5698
   440
wenzelm@4890
   441
(** internal theory extenders **)
wenzelm@4867
   442
wenzelm@5698
   443
(* field_type_defs *)
wenzelm@5698
   444
wenzelm@5713
   445
fun field_type_def ((thy, simps), (name, tname, vs, T, U)) =
wenzelm@5698
   446
  let
wenzelm@5698
   447
    val full = Sign.full_name (sign_of thy);
wenzelm@5713
   448
    val (thy', {simps = simps', ...}) =
wenzelm@5698
   449
      thy
wenzelm@5698
   450
      |> setmp DatatypePackage.quiet_mode true
wenzelm@5698
   451
        (DatatypePackage.add_datatype_i true [tname]
wenzelm@5698
   452
          [(vs, tname, Syntax.NoSyn, [(name, [T, U], Syntax.NoSyn)])]);
wenzelm@5698
   453
    val thy'' =
wenzelm@5698
   454
      thy'
wenzelm@5698
   455
      |> setmp AxClass.quiet_mode true
wenzelm@5698
   456
        (AxClass.add_inst_arity_i (full tname, [HOLogic.termS, moreS], moreS) [] [] None);
wenzelm@5713
   457
  in (thy'', simps' @ simps) end;
wenzelm@5698
   458
wenzelm@5713
   459
fun field_type_defs args thy = foldl field_type_def ((thy, []), args);
wenzelm@5698
   460
wenzelm@5698
   461
wenzelm@4894
   462
(* field_definitions *)
wenzelm@4867
   463
wenzelm@4894
   464
fun field_definitions fields names zeta moreT more vars named_vars thy =
wenzelm@4890
   465
  let
wenzelm@5698
   466
    val sign = Theory.sign_of thy;
wenzelm@4890
   467
    val base = Sign.base_name;
wenzelm@5698
   468
    val full_path = Sign.full_name_path sign;
wenzelm@4867
   469
wenzelm@4867
   470
wenzelm@4890
   471
    (* prepare declarations and definitions *)
wenzelm@4867
   472
wenzelm@4890
   473
    (*field types*)
wenzelm@4890
   474
    fun mk_fieldT_spec c =
wenzelm@5698
   475
      (suffix raw_fieldN c, suffix field_typeN c,
wenzelm@5698
   476
        ["'a", zeta], TFree ("'a", HOLogic.termS), moreT);
wenzelm@4890
   477
    val fieldT_specs = map (mk_fieldT_spec o base) names;
wenzelm@4890
   478
wenzelm@5698
   479
    (*field constructors*)
wenzelm@4890
   480
    val field_decls = map (mk_fieldC moreT) fields;
wenzelm@4890
   481
wenzelm@4890
   482
    fun mk_field_spec (c, v) =
wenzelm@5698
   483
      mk_field ((c, v), more) :== mk_raw_field ((c, v), more);
wenzelm@4894
   484
    val field_specs = map mk_field_spec named_vars;
wenzelm@4890
   485
wenzelm@4890
   486
    (*field destructors*)
wenzelm@5698
   487
    val dest_decls = map (mk_fstC moreT) fields @ map (mk_sndC moreT) fields;
wenzelm@5698
   488
wenzelm@5698
   489
    fun mk_dest_spec dest f (c, T) =
wenzelm@5698
   490
      let val p = Free ("p", mk_fieldT ((c, T), moreT));
wenzelm@5698
   491
      in dest p :== mk_prod_case (suffix field_typeN c) (f T moreT) p end;
wenzelm@4890
   492
    val dest_specs =
wenzelm@5698
   493
      map (mk_dest_spec mk_fst fst_fn) fields @
wenzelm@5698
   494
      map (mk_dest_spec mk_snd snd_fn) fields;
wenzelm@4890
   495
wenzelm@4890
   496
wenzelm@4890
   497
    (* prepare theorems *)
wenzelm@4894
   498
wenzelm@5713
   499
    (*constructor injects*)
wenzelm@5713
   500
    fun mk_inject_prop (c, v) =
wenzelm@5713
   501
      HOLogic.mk_eq (mk_field ((c, v), more), mk_field ((c, prime v), prime more)) ===
wenzelm@5713
   502
        (HOLogic.conj $ HOLogic.mk_eq (v, prime v) $ HOLogic.mk_eq (more, prime more));
wenzelm@5713
   503
    val inject_props = map mk_inject_prop named_vars;
wenzelm@5713
   504
wenzelm@5698
   505
    (*destructor conversions*)
wenzelm@4890
   506
    fun mk_dest_prop dest dest' (c, v) =
wenzelm@4894
   507
      dest (mk_field ((c, v), more)) === dest' (v, more);
wenzelm@4890
   508
    val dest_props =
wenzelm@4895
   509
      map (mk_dest_prop mk_fst fst) named_vars @
wenzelm@4895
   510
      map (mk_dest_prop mk_snd snd) named_vars;
wenzelm@4890
   511
wenzelm@5698
   512
    (*surjective pairing*)
wenzelm@5698
   513
    fun mk_surj_prop (c, T) =
wenzelm@5698
   514
      let val p = Free ("p", mk_fieldT ((c, T), moreT));
wenzelm@5698
   515
      in p === mk_field ((c, mk_fst p), mk_snd p) end;
wenzelm@5698
   516
    val surj_props = map mk_surj_prop fields;
wenzelm@4890
   517
wenzelm@5698
   518
wenzelm@5698
   519
    (* 1st stage: types_thy *)
wenzelm@5698
   520
wenzelm@6092
   521
    val (types_thy, datatype_simps) =
wenzelm@5698
   522
      thy
wenzelm@5698
   523
      |> field_type_defs fieldT_specs;
wenzelm@5698
   524
wenzelm@5698
   525
wenzelm@5698
   526
    (* 2nd stage: defs_thy *)
wenzelm@4890
   527
wenzelm@4890
   528
    val defs_thy =
wenzelm@5698
   529
      types_thy
wenzelm@5698
   530
       |> (Theory.add_consts_i o map (Syntax.no_syn o apfst base))
wenzelm@5698
   531
         (field_decls @ dest_decls)
wenzelm@6092
   532
       |> (PureThy.add_defs_i o map (fn x => (x, [Drule.tag_internal])))
wenzelm@5698
   533
         (field_specs @ dest_specs);
wenzelm@4890
   534
wenzelm@4890
   535
    val field_defs = get_defs defs_thy field_specs;
wenzelm@4890
   536
    val dest_defs = get_defs defs_thy dest_specs;
wenzelm@4890
   537
wenzelm@4890
   538
wenzelm@5698
   539
    (* 3rd stage: thms_thy *)
wenzelm@5698
   540
wenzelm@5698
   541
    val prove = prove_simp defs_thy;
wenzelm@5713
   542
    val prove_std = prove [] (field_defs @ dest_defs @ datatype_simps);
wenzelm@4890
   543
wenzelm@5713
   544
    val field_injects = map prove_std inject_props;
wenzelm@5713
   545
    val dest_convs = map prove_std dest_props;
wenzelm@5698
   546
    val surj_pairs = map (prove [DatatypePackage.induct_tac "p" 1]
wenzelm@6092
   547
      (map Thm.symmetric field_defs @ dest_convs)) surj_props;
wenzelm@5698
   548
wenzelm@5707
   549
    fun mk_split th = SplitPairedAll.rule (th RS eq_reflection);
wenzelm@6092
   550
    val field_splits = map mk_split surj_pairs;
wenzelm@4894
   551
wenzelm@4890
   552
    val thms_thy =
wenzelm@4890
   553
      defs_thy
wenzelm@6092
   554
      |> (PureThy.add_thmss o map Thm.no_attributes)
wenzelm@4890
   555
        [("field_defs", field_defs),
wenzelm@4890
   556
          ("dest_defs", dest_defs),
wenzelm@5698
   557
          ("dest_convs", dest_convs),
wenzelm@5698
   558
          ("surj_pairs", surj_pairs),
wenzelm@5713
   559
          ("field_splits", field_splits)];
wenzelm@4890
   560
wenzelm@5713
   561
  in (thms_thy, dest_convs, field_injects, field_splits) end;
wenzelm@4890
   562
wenzelm@4890
   563
wenzelm@4890
   564
(* record_definition *)
wenzelm@4867
   565
wenzelm@4867
   566
fun record_definition (args, bname) parent (parents: parent_info list) bfields thy =
wenzelm@4867
   567
  let
wenzelm@4867
   568
    val sign = Theory.sign_of thy;
wenzelm@4867
   569
    val full = Sign.full_name_path sign bname;
wenzelm@4890
   570
    val base = Sign.base_name;
wenzelm@4867
   571
wenzelm@4867
   572
wenzelm@4890
   573
    (* basic components *)
wenzelm@4867
   574
wenzelm@4867
   575
    val alphas = map fst args;
wenzelm@5197
   576
    val name = Sign.full_name sign bname;       (*not made part of record name space!*)
wenzelm@4890
   577
wenzelm@4867
   578
    val parent_fields = flat (map #fields parents);
wenzelm@4890
   579
    val parent_names = map fst parent_fields;
wenzelm@4890
   580
    val parent_types = map snd parent_fields;
wenzelm@4890
   581
    val parent_len = length parent_fields;
wenzelm@4890
   582
    val parent_xs = variantlist (map (base o fst) parent_fields, [moreN]);
wenzelm@4890
   583
    val parent_vars = ListPair.map Free (parent_xs, parent_types);
wenzelm@4894
   584
    val parent_named_vars = parent_names ~~ parent_vars;
wenzelm@4890
   585
wenzelm@4867
   586
    val fields = map (apfst full) bfields;
wenzelm@4890
   587
    val names = map fst fields;
wenzelm@4890
   588
    val types = map snd fields;
wenzelm@4890
   589
    val len = length fields;
wenzelm@4890
   590
    val xs = variantlist (map fst bfields, moreN :: parent_xs);
wenzelm@4890
   591
    val vars = ListPair.map Free (xs, types);
wenzelm@4894
   592
    val named_vars = names ~~ vars;
wenzelm@4867
   593
wenzelm@4867
   594
    val all_fields = parent_fields @ fields;
wenzelm@4890
   595
    val all_names = parent_names @ names;
wenzelm@4890
   596
    val all_types = parent_types @ types;
wenzelm@4890
   597
    val all_len = parent_len + len;
wenzelm@4890
   598
    val all_xs = parent_xs @ xs;
wenzelm@4890
   599
    val all_vars = parent_vars @ vars;
wenzelm@4894
   600
    val all_named_vars = parent_named_vars @ named_vars;
wenzelm@4867
   601
wenzelm@4867
   602
    val zeta = variant alphas "'z";
wenzelm@4867
   603
    val moreT = TFree (zeta, moreS);
wenzelm@4895
   604
    val more = Free (moreN, moreT);
wenzelm@5197
   605
    val full_moreN = full moreN;
wenzelm@5197
   606
    fun more_part t = mk_more t full_moreN;
wenzelm@5197
   607
    fun more_part_update t x = mk_more_update t (full_moreN, x);
wenzelm@4894
   608
wenzelm@4894
   609
    val parent_more = funpow parent_len mk_snd;
wenzelm@4894
   610
    val idxs = 0 upto (len - 1);
wenzelm@4867
   611
wenzelm@4867
   612
    val rec_schemeT = mk_recordT (all_fields, moreT);
wenzelm@4894
   613
    val rec_scheme = mk_record (all_named_vars, more);
wenzelm@4890
   614
    val r = Free ("r", rec_schemeT);
wenzelm@4894
   615
    val recT = mk_recordT (all_fields, HOLogic.unitT);
wenzelm@4867
   616
wenzelm@4867
   617
wenzelm@4890
   618
    (* prepare print translation functions *)
wenzelm@4867
   619
wenzelm@5698
   620
    val field_tr's =
wenzelm@5698
   621
      print_translation (distinct (flat (map NameSpace.accesses (full_moreN :: names))));
wenzelm@4867
   622
wenzelm@4867
   623
wenzelm@4867
   624
    (* prepare declarations *)
wenzelm@4867
   625
wenzelm@5197
   626
    val sel_decls = map (mk_selC rec_schemeT) bfields @
wenzelm@5197
   627
      [mk_moreC rec_schemeT (moreN, moreT)];
wenzelm@5197
   628
    val update_decls = map (mk_updateC rec_schemeT) bfields @
wenzelm@5197
   629
      [mk_more_updateC rec_schemeT (moreN, moreT)];
wenzelm@4890
   630
    val make_decls =
wenzelm@4890
   631
      [(mk_makeC rec_schemeT (make_schemeN, all_types @ [moreT])),
wenzelm@4890
   632
       (mk_makeC recT (makeN, all_types))];
wenzelm@4867
   633
wenzelm@4867
   634
wenzelm@4867
   635
    (* prepare definitions *)
wenzelm@4867
   636
wenzelm@4895
   637
    (*record (scheme) type abbreviation*)
wenzelm@4890
   638
    val recordT_specs =
wenzelm@4890
   639
      [(suffix schemeN bname, alphas @ [zeta], rec_schemeT, Syntax.NoSyn),
wenzelm@4890
   640
        (bname, alphas, recT, Syntax.NoSyn)];
wenzelm@4867
   641
wenzelm@4894
   642
    (*selectors*)
wenzelm@4890
   643
    fun mk_sel_spec (i, c) =
wenzelm@4894
   644
      mk_sel r c :== mk_fst (funpow i mk_snd (parent_more r));
wenzelm@4894
   645
    val sel_specs =
wenzelm@4894
   646
      ListPair.map mk_sel_spec (idxs, names) @
wenzelm@4894
   647
        [more_part r :== funpow len mk_snd (parent_more r)];
wenzelm@4890
   648
wenzelm@4890
   649
    (*updates*)
wenzelm@4894
   650
    val all_sels = all_names ~~ map (mk_sel r) all_names;
wenzelm@4890
   651
    fun mk_upd_spec (i, (c, x)) =
wenzelm@4894
   652
      mk_update r (c, x) :==
wenzelm@4894
   653
        mk_record (nth_update (c, x) (parent_len + i, all_sels), more_part r)
wenzelm@5197
   654
    val update_specs =
wenzelm@5197
   655
      ListPair.map mk_upd_spec (idxs, named_vars) @
wenzelm@5197
   656
        [more_part_update r more :== mk_record (all_sels, more)];
wenzelm@4867
   657
wenzelm@4867
   658
    (*makes*)
wenzelm@4890
   659
    val make_scheme = Const (mk_makeC rec_schemeT (full make_schemeN, all_types @ [moreT]));
wenzelm@4890
   660
    val make = Const (mk_makeC recT (full makeN, all_types));
wenzelm@4867
   661
    val make_specs =
wenzelm@4894
   662
      [list_comb (make_scheme, all_vars) $ more :== rec_scheme,
wenzelm@4894
   663
        list_comb (make, all_vars) :== mk_record (all_named_vars, HOLogic.unit)];
wenzelm@4894
   664
wenzelm@4894
   665
wenzelm@4894
   666
    (* prepare propositions *)
wenzelm@4894
   667
wenzelm@4894
   668
    (*selectors*)
wenzelm@4894
   669
    val sel_props =
wenzelm@4894
   670
      map (fn (c, x) => mk_sel rec_scheme c === x) named_vars @
wenzelm@4894
   671
        [more_part rec_scheme === more];
wenzelm@4894
   672
wenzelm@4894
   673
    (*updates*)
wenzelm@4894
   674
    fun mk_upd_prop (i, (c, T)) =
wenzelm@4894
   675
      let val x' = Free (variant all_xs (base c ^ "'"), T) in
wenzelm@4894
   676
        mk_update rec_scheme (c, x') ===
wenzelm@4894
   677
          mk_record (nth_update (c, x') (parent_len + i, all_named_vars), more)
wenzelm@4894
   678
      end;
wenzelm@5197
   679
    val update_props =
wenzelm@5197
   680
      ListPair.map mk_upd_prop (idxs, fields) @
wenzelm@5197
   681
        let val more' = Free (variant all_xs (moreN ^ "'"), moreT)
wenzelm@5197
   682
        in [more_part_update rec_scheme more' === mk_record (all_named_vars, more')] end;
wenzelm@4867
   683
wenzelm@4867
   684
wenzelm@4890
   685
    (* 1st stage: fields_thy *)
wenzelm@4867
   686
wenzelm@5713
   687
    val (fields_thy, field_simps, field_injects, field_splits) =
wenzelm@4867
   688
      thy
wenzelm@4867
   689
      |> Theory.add_path bname
wenzelm@4894
   690
      |> field_definitions fields names zeta moreT more vars named_vars;
wenzelm@4867
   691
wenzelm@6092
   692
    val named_splits = map2 (fn (c, th) => (suffix field_typeN c, th)) (names, field_splits);
wenzelm@5698
   693
wenzelm@4867
   694
wenzelm@4890
   695
    (* 2nd stage: defs_thy *)
wenzelm@4890
   696
wenzelm@4890
   697
    val defs_thy =
wenzelm@4890
   698
      fields_thy
wenzelm@4890
   699
      |> Theory.parent_path
wenzelm@5197
   700
      |> Theory.add_tyabbrs_i recordT_specs     (*not made part of record name space!*)
wenzelm@4890
   701
      |> Theory.add_path bname
wenzelm@5197
   702
      |> Theory.add_trfuns ([], [], field_tr's, [])
wenzelm@4894
   703
      |> (Theory.add_consts_i o map Syntax.no_syn)
wenzelm@4894
   704
        (sel_decls @ update_decls @ make_decls)
wenzelm@6092
   705
      |> (PureThy.add_defs_i o map (fn x => (x, [Drule.tag_internal])))
wenzelm@5212
   706
        (sel_specs @ update_specs)
wenzelm@6092
   707
      |> (PureThy.add_defs_i o map Thm.no_attributes) make_specs;
wenzelm@4890
   708
wenzelm@4890
   709
    val sel_defs = get_defs defs_thy sel_specs;
wenzelm@4890
   710
    val update_defs = get_defs defs_thy update_specs;
wenzelm@4890
   711
    val make_defs = get_defs defs_thy make_specs;
wenzelm@4890
   712
wenzelm@4890
   713
wenzelm@4890
   714
    (* 3rd stage: thms_thy *)
wenzelm@4890
   715
wenzelm@4895
   716
    val parent_simps = flat (map #simps parents);
wenzelm@5698
   717
    val prove = prove_simp defs_thy [];
wenzelm@4890
   718
wenzelm@4895
   719
    val sel_convs = map (prove (parent_simps @ sel_defs @ field_simps)) sel_props;
wenzelm@4895
   720
    val update_convs = map (prove (parent_simps @ update_defs @ sel_convs)) update_props;
wenzelm@4894
   721
wenzelm@4894
   722
    val simps = field_simps @ sel_convs @ update_convs @ make_defs;
wenzelm@4867
   723
wenzelm@4867
   724
    val thms_thy =
wenzelm@4867
   725
      defs_thy
wenzelm@6092
   726
      |> (PureThy.add_thmss o map Thm.no_attributes)
wenzelm@4895
   727
        [("select_defs", sel_defs),
wenzelm@4890
   728
          ("update_defs", update_defs),
wenzelm@4894
   729
          ("make_defs", make_defs),
wenzelm@4895
   730
          ("select_convs", sel_convs),
wenzelm@4894
   731
          ("update_convs", update_convs)]
wenzelm@6092
   732
      |> PureThy.add_thmss
wenzelm@5707
   733
        [(("simps", simps), [Simplifier.simp_add_global]),
wenzelm@5713
   734
         (("iffs", field_injects), [add_iffs_global])];
wenzelm@4867
   735
wenzelm@4867
   736
wenzelm@4890
   737
    (* 4th stage: final_thy *)
wenzelm@4867
   738
wenzelm@4867
   739
    val final_thy =
wenzelm@4867
   740
      thms_thy
wenzelm@4895
   741
      |> put_record name {args = args, parent = parent, fields = fields, simps = simps}
wenzelm@5713
   742
      |> add_record_splits named_splits
wenzelm@4867
   743
      |> Theory.parent_path;
wenzelm@4867
   744
wenzelm@4867
   745
  in final_thy end;
wenzelm@4867
   746
wenzelm@4867
   747
wenzelm@4867
   748
wenzelm@4867
   749
(** theory extender interface **)
wenzelm@4867
   750
wenzelm@4867
   751
(* prepare arguments *)
wenzelm@4867
   752
wenzelm@4894
   753
(*note: read_raw_typ avoids expanding type abbreviations*)
wenzelm@4867
   754
fun read_raw_parent sign s =
wenzelm@4867
   755
  (case Sign.read_raw_typ (sign, K None) s handle TYPE (msg, _, _) => error msg of
wenzelm@4867
   756
    Type (name, Ts) => (Ts, name)
wenzelm@4867
   757
  | _ => error ("Bad parent record specification: " ^ quote s));
wenzelm@4867
   758
wenzelm@4867
   759
fun read_typ sign (env, s) =
wenzelm@4867
   760
  let
wenzelm@5060
   761
    fun def_sort (x, ~1) = assoc (env, x)
wenzelm@5060
   762
      | def_sort _ = None;
wenzelm@5060
   763
    val T = Type.no_tvars (Sign.read_typ (sign, def_sort) s) handle TYPE (msg, _, _) => error msg;
wenzelm@4867
   764
  in (Term.add_typ_tfrees (T, env), T) end;
wenzelm@4867
   765
wenzelm@4867
   766
fun cert_typ sign (env, raw_T) =
wenzelm@4867
   767
  let val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle TYPE (msg, _, _) => error msg
wenzelm@4867
   768
  in (Term.add_typ_tfrees (T, env), T) end;
wenzelm@4867
   769
wenzelm@4867
   770
wenzelm@4867
   771
(* add_record *)
wenzelm@4867
   772
wenzelm@4895
   773
(*we do all preparations and error checks here, deferring the real
wenzelm@4895
   774
  work to record_definition*)
wenzelm@4890
   775
wenzelm@4867
   776
fun gen_add_record prep_typ prep_raw_parent (params, bname) raw_parent raw_fields thy =
wenzelm@4867
   777
  let
paulson@4970
   778
    val _ = Theory.requires thy "Record" "record definitions";
wenzelm@4867
   779
    val sign = Theory.sign_of thy;
wenzelm@5698
   780
    val _ = message ("Defining record " ^ quote bname ^ " ...");
wenzelm@4867
   781
wenzelm@4867
   782
wenzelm@4867
   783
    (* parents *)
wenzelm@4867
   784
wenzelm@4867
   785
    fun prep_inst T = snd (cert_typ sign ([], T));
wenzelm@4867
   786
wenzelm@4867
   787
    val parent = apsome (apfst (map prep_inst) o prep_raw_parent sign) raw_parent
wenzelm@4867
   788
      handle ERROR => error ("The error(s) above in parent record specification");
wenzelm@4867
   789
    val parents = add_parents thy (parent, []);
wenzelm@4867
   790
wenzelm@4867
   791
    val init_env =
wenzelm@4867
   792
      (case parent of
wenzelm@4867
   793
        None => []
wenzelm@4867
   794
      | Some (types, _) => foldr Term.add_typ_tfrees (types, []));
wenzelm@4867
   795
wenzelm@4867
   796
wenzelm@4867
   797
    (* fields *)
wenzelm@4867
   798
wenzelm@4967
   799
    fun prep_field (env, (c, raw_T)) =
wenzelm@4967
   800
      let val (env', T) = prep_typ sign (env, raw_T) handle ERROR =>
wenzelm@4967
   801
        error ("The error(s) above occured in field " ^ quote c)
wenzelm@4967
   802
      in (env', (c, T)) end;
wenzelm@4867
   803
wenzelm@4967
   804
    val (envir, bfields) = foldl_map prep_field (init_env, raw_fields);
wenzelm@4867
   805
    val envir_names = map fst envir;
wenzelm@4867
   806
wenzelm@4867
   807
wenzelm@4867
   808
    (* args *)
wenzelm@4867
   809
wenzelm@4867
   810
    val defaultS = Sign.defaultS sign;
wenzelm@4867
   811
    val args = map (fn x => (x, if_none (assoc (envir, x)) defaultS)) params;
wenzelm@4867
   812
wenzelm@4867
   813
wenzelm@4867
   814
    (* errors *)
wenzelm@4867
   815
wenzelm@4890
   816
    val name = Sign.full_name sign bname;
wenzelm@4890
   817
    val err_dup_record =
wenzelm@4890
   818
      if is_none (get_record thy name) then []
wenzelm@4890
   819
      else ["Duplicate definition of record " ^ quote name];
wenzelm@4890
   820
wenzelm@4867
   821
    val err_dup_parms =
wenzelm@4867
   822
      (case duplicates params of
wenzelm@4867
   823
        [] => []
wenzelm@4890
   824
      | dups => ["Duplicate parameter(s) " ^ commas dups]);
wenzelm@4867
   825
wenzelm@4867
   826
    val err_extra_frees =
wenzelm@4867
   827
      (case gen_rems (op =) (envir_names, params) of
wenzelm@4867
   828
        [] => []
wenzelm@4890
   829
      | extras => ["Extra free type variable(s) " ^ commas extras]);
wenzelm@4867
   830
wenzelm@4890
   831
    val err_no_fields = if null bfields then ["No fields present"] else [];
wenzelm@4867
   832
wenzelm@4867
   833
    val err_dup_fields =
wenzelm@4867
   834
      (case duplicates (map fst bfields) of
wenzelm@4867
   835
        [] => []
wenzelm@4890
   836
      | dups => ["Duplicate field(s) " ^ commas_quote dups]);
wenzelm@4890
   837
wenzelm@4890
   838
    val err_bad_fields =
wenzelm@4890
   839
      if forall (not_equal moreN o fst) bfields then []
wenzelm@4890
   840
      else ["Illegal field name " ^ quote moreN];
wenzelm@4867
   841
wenzelm@4867
   842
    val err_dup_sorts =
wenzelm@4867
   843
      (case duplicates envir_names of
wenzelm@4867
   844
        [] => []
wenzelm@4867
   845
      | dups => ["Inconsistent sort constraints for " ^ commas dups]);
wenzelm@4867
   846
wenzelm@4867
   847
    val errs =
wenzelm@4890
   848
      err_dup_record @ err_dup_parms @ err_extra_frees @ err_no_fields @
wenzelm@4890
   849
      err_dup_fields @ err_bad_fields @ err_dup_sorts;
wenzelm@4867
   850
  in
wenzelm@4890
   851
    if null errs then () else error (cat_lines errs);
wenzelm@4867
   852
    thy |> record_definition (args, bname) parent parents bfields
wenzelm@4867
   853
  end
wenzelm@4867
   854
  handle ERROR => error ("Failed to define record " ^ quote bname);
wenzelm@4867
   855
wenzelm@4867
   856
val add_record = gen_add_record read_typ read_raw_parent;
wenzelm@4867
   857
val add_record_i = gen_add_record cert_typ (K I);
wenzelm@4867
   858
wenzelm@4867
   859
wenzelm@4867
   860
wenzelm@4867
   861
(** setup theory **)
wenzelm@4867
   862
wenzelm@4867
   863
val setup =
wenzelm@5006
   864
 [RecordsData.init,
wenzelm@5698
   865
  Theory.add_trfuns ([], parse_translation, [], []),
wenzelm@5698
   866
  add_wrapper record_split_wrapper];
wenzelm@4867
   867
wenzelm@4867
   868
wenzelm@4867
   869
end;
wenzelm@5698
   870
wenzelm@5698
   871
wenzelm@5698
   872
structure BasicRecordPackage: BASIC_RECORD_PACKAGE = RecordPackage;
wenzelm@5698
   873
open BasicRecordPackage;