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