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