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