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