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