src/HOL/Tools/record_package.ML
author schirmer
Tue Nov 07 18:25:48 2006 +0100 (2006-11-07)
changeset 21226 a607ae87ee81
parent 21109 f8f89be75e81
child 21363 a12c0bcd9b2a
permissions -rw-r--r--
field-update in records is generalised to take a function on the field
rather than the new value.
wenzelm@4867
     1
(*  Title:      HOL/Tools/record_package.ML
wenzelm@4867
     2
    ID:         $Id$
wenzelm@14579
     3
    Author:     Wolfgang Naraschewski, Norbert Schirmer and Markus Wenzel, TU Muenchen
wenzelm@4867
     4
wenzelm@4867
     5
Extensible records with structural subtyping in HOL.
wenzelm@5698
     6
*)
wenzelm@4867
     7
schirmer@21226
     8
wenzelm@5698
     9
signature BASIC_RECORD_PACKAGE =
wenzelm@5698
    10
sig
wenzelm@7178
    11
  val record_simproc: simproc
berghofe@14079
    12
  val record_eq_simproc: simproc
schirmer@14700
    13
  val record_upd_simproc: simproc
schirmer@15273
    14
  val record_split_simproc: (term -> int) -> simproc
schirmer@14700
    15
  val record_ex_sel_eq_simproc: simproc
wenzelm@5698
    16
  val record_split_tac: int -> tactic
schirmer@15273
    17
  val record_split_simp_tac: thm list -> (term -> int) -> int -> tactic
wenzelm@5713
    18
  val record_split_name: string
wenzelm@5698
    19
  val record_split_wrapper: string * wrapper
schirmer@14700
    20
  val print_record_type_abbr: bool ref
wenzelm@17261
    21
  val print_record_type_as_fields: bool ref
wenzelm@5698
    22
end;
wenzelm@4867
    23
wenzelm@4867
    24
signature RECORD_PACKAGE =
wenzelm@4867
    25
sig
wenzelm@5698
    26
  include BASIC_RECORD_PACKAGE
wenzelm@5698
    27
  val quiet_mode: bool ref
schirmer@15015
    28
  val record_quick_and_dirty_sensitive: bool ref
wenzelm@8574
    29
  val updateN: string
schirmer@14700
    30
  val ext_typeN: string
schirmer@14700
    31
  val last_extT: typ -> (string * typ list) option
schirmer@14700
    32
  val dest_recTs : typ -> (string * typ list) list
wenzelm@16458
    33
  val get_extT_fields:  theory -> typ -> ((string * typ) list * (string * typ))
wenzelm@16458
    34
  val get_recT_fields:  theory -> typ -> ((string * typ) list * (string * typ))
wenzelm@16458
    35
  val get_extension: theory -> Symtab.key -> (string * typ list) option
wenzelm@16458
    36
  val get_extinjects: theory -> thm list
wenzelm@16458
    37
  val get_simpset: theory -> simpset
wenzelm@4867
    38
  val print_records: theory -> unit
wenzelm@16458
    39
  val add_record: string list * string -> string option -> (string * string * mixfix) list
wenzelm@16458
    40
    -> theory -> theory
wenzelm@16458
    41
  val add_record_i: string list * string -> (typ list * string) option
wenzelm@16458
    42
    -> (string * typ * mixfix) list -> theory -> theory
wenzelm@18708
    43
  val setup: theory -> theory
wenzelm@4867
    44
end;
wenzelm@4867
    45
schirmer@14700
    46
wenzelm@17960
    47
structure RecordPackage: RECORD_PACKAGE =
wenzelm@4867
    48
struct
wenzelm@4867
    49
schirmer@14700
    50
val rec_UNIV_I = thm "rec_UNIV_I";
schirmer@14700
    51
val rec_True_simp = thm "rec_True_simp";
schirmer@14700
    52
val Pair_eq = thm "Product_Type.Pair_eq";
schirmer@14700
    53
val atomize_all = thm "HOL.atomize_all";
schirmer@14700
    54
val atomize_imp = thm "HOL.atomize_imp";
wenzelm@17960
    55
val meta_allE = thm "Pure.meta_allE";
wenzelm@17960
    56
val prop_subst = thm "prop_subst";
schirmer@14700
    57
val Pair_sel_convs = [fst_conv,snd_conv];
schirmer@21226
    58
val K_record_apply = thm "Record.K_record_apply";
schirmer@21226
    59
val K_comp_convs = [o_apply,K_record_apply]
wenzelm@11832
    60
schirmer@14700
    61
(** name components **)
schirmer@14700
    62
schirmer@14700
    63
val rN = "r";
schirmer@15215
    64
val wN = "w";
schirmer@14700
    65
val moreN = "more";
schirmer@14700
    66
val schemeN = "_scheme";
wenzelm@17261
    67
val ext_typeN = "_ext_type";
schirmer@14700
    68
val extN ="_ext";
schirmer@15215
    69
val casesN = "_cases";
schirmer@14709
    70
val ext_dest = "_sel";
schirmer@14700
    71
val updateN = "_update";
schirmer@15215
    72
val updN = "_upd";
schirmer@14700
    73
val makeN = "make";
schirmer@14700
    74
val fields_selN = "fields";
schirmer@14700
    75
val extendN = "extend";
schirmer@14700
    76
val truncateN = "truncate";
schirmer@21226
    77
val KN = "Record.K_record";
schirmer@14700
    78
schirmer@14700
    79
(*see typedef_package.ML*)
schirmer@14700
    80
val RepN = "Rep_";
schirmer@14700
    81
val AbsN = "Abs_";
schirmer@14700
    82
wenzelm@4894
    83
(*** utilities ***)
wenzelm@4867
    84
schirmer@14709
    85
fun but_last xs = fst (split_last xs);
schirmer@14700
    86
schirmer@19748
    87
fun varifyT midx =
schirmer@19748
    88
  let fun varify (a, S) = TVar ((a, midx + 1), S);
schirmer@19748
    89
  in map_type_tfree varify end;
schirmer@19748
    90
schirmer@21226
    91
fun the_plist (SOME (a,b)) = [a,b]
schirmer@21226
    92
  | the_plist NONE = raise Option;
schirmer@21226
    93
schirmer@21226
    94
fun domain_type' T =
schirmer@21226
    95
    domain_type T handle Match => T;
schirmer@21226
    96
schirmer@21226
    97
fun range_type' T =
schirmer@21226
    98
    range_type T handle Match => T;
schirmer@21226
    99
wenzelm@5698
   100
(* messages *)
wenzelm@5698
   101
wenzelm@5698
   102
val quiet_mode = ref false;
wenzelm@5698
   103
fun message s = if ! quiet_mode then () else writeln s;
wenzelm@5698
   104
schirmer@21226
   105
fun trace_thm str thm =
schirmer@21226
   106
    tracing (str ^ (Pretty.string_of (Display.pretty_thm thm)));
schirmer@21226
   107
schirmer@21226
   108
fun trace_thms str thms =
schirmer@21226
   109
    (tracing str; map (trace_thm "") thms);
schirmer@21226
   110
schirmer@21226
   111
fun trace_term str t =
schirmer@21226
   112
    tracing (str ^ (Display.raw_string_of_term t));
schirmer@21226
   113
schirmer@15012
   114
(* timing *)
schirmer@15012
   115
schirmer@15012
   116
fun timeit_msg s x = if !timing then (warning s; timeit x) else x ();
schirmer@16379
   117
fun timing_msg s = if !timing then warning s else ();
wenzelm@17261
   118
wenzelm@12255
   119
(* syntax *)
wenzelm@4867
   120
wenzelm@12247
   121
fun prune n xs = Library.drop (n, xs);
wenzelm@11832
   122
fun prefix_base s = NameSpace.map_base (fn bname => s ^ bname);
wenzelm@11832
   123
wenzelm@11927
   124
val Trueprop = HOLogic.mk_Trueprop;
wenzelm@11927
   125
fun All xs t = Term.list_all_free (xs, t);
wenzelm@4894
   126
wenzelm@11934
   127
infix 9 $$;
wenzelm@11934
   128
infix 0 :== ===;
wenzelm@11934
   129
infixr 0 ==>;
wenzelm@11934
   130
wenzelm@11934
   131
val (op $$) = Term.list_comb;
wenzelm@11927
   132
val (op :==) = Logic.mk_defpair;
wenzelm@11927
   133
val (op ===) = Trueprop o HOLogic.mk_eq;
wenzelm@11927
   134
val (op ==>) = Logic.mk_implies;
wenzelm@11927
   135
wenzelm@11832
   136
(* morphisms *)
wenzelm@11832
   137
schirmer@14700
   138
fun mk_RepN name = suffix ext_typeN (prefix_base RepN name);
schirmer@14700
   139
fun mk_AbsN name = suffix ext_typeN (prefix_base AbsN name);
wenzelm@11832
   140
schirmer@14700
   141
fun mk_Rep name repT absT  =
schirmer@14700
   142
  Const (suffix ext_typeN (prefix_base RepN name),absT --> repT);
wenzelm@11832
   143
schirmer@14700
   144
fun mk_Abs name repT absT =
schirmer@14700
   145
  Const (mk_AbsN name,repT --> absT);
wenzelm@4867
   146
schirmer@14700
   147
(* constructor *)
wenzelm@4867
   148
schirmer@14700
   149
fun mk_extC (name,T) Ts  = (suffix extN name, Ts ---> T);
wenzelm@4867
   150
schirmer@14700
   151
fun mk_ext (name,T) ts =
schirmer@14700
   152
  let val Ts = map fastype_of ts
schirmer@14700
   153
  in list_comb (Const (mk_extC (name,T) Ts),ts) end;
wenzelm@4867
   154
schirmer@15215
   155
(* cases *)
schirmer@15215
   156
schirmer@15215
   157
fun mk_casesC (name,T,vT) Ts = (suffix casesN name, (Ts ---> vT) --> T --> vT)
schirmer@15215
   158
schirmer@15215
   159
fun mk_cases (name,T,vT) f =
wenzelm@17261
   160
  let val Ts = binder_types (fastype_of f)
schirmer@15215
   161
  in Const (mk_casesC (name,T,vT) Ts) $ f end;
wenzelm@17261
   162
schirmer@14700
   163
(* selector *)
schirmer@14700
   164
schirmer@14700
   165
fun mk_selC sT (c,T) = (c,sT --> T);
wenzelm@4867
   166
schirmer@14700
   167
fun mk_sel s (c,T) =
schirmer@14700
   168
  let val sT = fastype_of s
schirmer@14700
   169
  in Const (mk_selC sT (c,T)) $ s end;
wenzelm@4867
   170
schirmer@14700
   171
(* updates *)
schirmer@14700
   172
schirmer@21226
   173
fun mk_updC sfx sT (c,T) = (suffix sfx c, (T --> T) --> sT --> sT);
wenzelm@4867
   174
schirmer@21226
   175
fun mk_upd' sfx c v sT =
schirmer@21226
   176
  let val vT = domain_type (fastype_of v);
schirmer@21226
   177
  in Const (mk_updC sfx sT (c, vT)) $ v  end;
schirmer@21226
   178
schirmer@21226
   179
fun mk_upd sfx c v s = mk_upd' sfx c v (fastype_of s) $ s
wenzelm@4867
   180
wenzelm@4867
   181
(* types *)
wenzelm@4867
   182
schirmer@14700
   183
fun dest_recT (typ as Type (c_ext_type, Ts as (T::_))) =
schirmer@14700
   184
      (case try (unsuffix ext_typeN) c_ext_type of
skalberg@15531
   185
        NONE => raise TYPE ("RecordPackage.dest_recT", [typ], [])
skalberg@15570
   186
      | SOME c => ((c, Ts), List.last Ts))
schirmer@14700
   187
  | dest_recT typ = raise TYPE ("RecordPackage.dest_recT", [typ], []);
wenzelm@5197
   188
schirmer@14700
   189
fun is_recT T =
wenzelm@17261
   190
  (case try dest_recT T of NONE => false | SOME _ => true);
wenzelm@11833
   191
schirmer@14700
   192
fun dest_recTs T =
schirmer@14700
   193
  let val ((c, Ts), U) = dest_recT T
schirmer@14700
   194
  in (c, Ts) :: dest_recTs U
schirmer@14700
   195
  end handle TYPE _ => [];
schirmer@14255
   196
schirmer@14700
   197
fun last_extT T =
schirmer@14700
   198
  let val ((c, Ts), U) = dest_recT T
schirmer@14700
   199
  in (case last_extT U of
skalberg@15531
   200
        NONE => SOME (c,Ts)
skalberg@15531
   201
      | SOME l => SOME l)
skalberg@15531
   202
  end handle TYPE _ => NONE
schirmer@14255
   203
wenzelm@17261
   204
fun rec_id i T =
schirmer@15273
   205
  let val rTs = dest_recTs T
skalberg@15570
   206
      val rTs' = if i < 0 then rTs else Library.take (i,rTs)
skalberg@15570
   207
  in Library.foldl (fn (s,(c,T)) => s ^ c) ("",rTs') end;
wenzelm@4867
   208
wenzelm@4867
   209
(*** extend theory by record definition ***)
wenzelm@4867
   210
wenzelm@4867
   211
(** record info **)
wenzelm@4867
   212
schirmer@14255
   213
(* type record_info and parent_info  *)
wenzelm@4867
   214
wenzelm@4867
   215
type record_info =
wenzelm@4867
   216
 {args: (string * sort) list,
wenzelm@4867
   217
  parent: (typ list * string) option,
wenzelm@4867
   218
  fields: (string * typ) list,
schirmer@14700
   219
  extension: (string * typ list),
schirmer@14700
   220
  induct: thm
schirmer@14700
   221
 };
wenzelm@11927
   222
schirmer@14700
   223
fun make_record_info args parent fields extension induct =
wenzelm@17261
   224
 {args = args, parent = parent, fields = fields, extension = extension,
schirmer@14700
   225
  induct = induct}: record_info;
schirmer@14700
   226
wenzelm@4867
   227
wenzelm@4867
   228
type parent_info =
wenzelm@4867
   229
 {name: string,
wenzelm@4867
   230
  fields: (string * typ) list,
schirmer@14700
   231
  extension: (string * typ list),
schirmer@14700
   232
  induct: thm
schirmer@14700
   233
};
wenzelm@11927
   234
schirmer@14700
   235
fun make_parent_info name fields extension induct =
schirmer@14700
   236
 {name = name, fields = fields, extension = extension, induct = induct}: parent_info;
wenzelm@4867
   237
schirmer@14700
   238
(* data kind 'HOL/record' *)
wenzelm@5001
   239
wenzelm@7178
   240
type record_data =
wenzelm@7178
   241
 {records: record_info Symtab.table,
wenzelm@7178
   242
  sel_upd:
wenzelm@7178
   243
   {selectors: unit Symtab.table,
wenzelm@7178
   244
    updates: string Symtab.table,
wenzelm@7178
   245
    simpset: Simplifier.simpset},
schirmer@14255
   246
  equalities: thm Symtab.table,
schirmer@15015
   247
  extinjects: thm list,
schirmer@15015
   248
  extsplit: thm Symtab.table, (* maps extension name to split rule *)
wenzelm@17261
   249
  splits: (thm*thm*thm*thm) Symtab.table,    (* !!,!,EX - split-equalities,induct rule *)
schirmer@14700
   250
  extfields: (string*typ) list Symtab.table, (* maps extension to its fields *)
schirmer@14700
   251
  fieldext: (string*typ list) Symtab.table   (* maps field to its extension *)
schirmer@14255
   252
};
wenzelm@7178
   253
wenzelm@17261
   254
fun make_record_data
schirmer@15015
   255
      records sel_upd equalities extinjects extsplit splits extfields fieldext =
wenzelm@17261
   256
 {records = records, sel_upd = sel_upd,
wenzelm@17261
   257
  equalities = equalities, extinjects=extinjects, extsplit = extsplit, splits = splits,
schirmer@14700
   258
  extfields = extfields, fieldext = fieldext }: record_data;
wenzelm@7178
   259
wenzelm@16458
   260
structure RecordsData = TheoryDataFun
wenzelm@16458
   261
(struct
schirmer@21226
   262
  val name = "HOL/record"; 
wenzelm@7178
   263
  type T = record_data;
wenzelm@4867
   264
wenzelm@7178
   265
  val empty =
wenzelm@7178
   266
    make_record_data Symtab.empty
wenzelm@7178
   267
      {selectors = Symtab.empty, updates = Symtab.empty, simpset = HOL_basic_ss}
schirmer@15015
   268
       Symtab.empty [] Symtab.empty Symtab.empty Symtab.empty Symtab.empty;
wenzelm@7178
   269
wenzelm@6556
   270
  val copy = I;
wenzelm@16458
   271
  val extend = I;
wenzelm@16458
   272
  fun merge _
wenzelm@7178
   273
   ({records = recs1,
wenzelm@7178
   274
     sel_upd = {selectors = sels1, updates = upds1, simpset = ss1},
schirmer@14255
   275
     equalities = equalities1,
wenzelm@17261
   276
     extinjects = extinjects1,
schirmer@15015
   277
     extsplit = extsplit1,
schirmer@14700
   278
     splits = splits1,
schirmer@14700
   279
     extfields = extfields1,
schirmer@14700
   280
     fieldext = fieldext1},
wenzelm@7178
   281
    {records = recs2,
wenzelm@7178
   282
     sel_upd = {selectors = sels2, updates = upds2, simpset = ss2},
schirmer@15015
   283
     equalities = equalities2,
wenzelm@17261
   284
     extinjects = extinjects2,
wenzelm@17261
   285
     extsplit = extsplit2,
schirmer@14700
   286
     splits = splits2,
schirmer@14700
   287
     extfields = extfields2,
schirmer@14700
   288
     fieldext = fieldext2}) =
wenzelm@17261
   289
    make_record_data
wenzelm@7178
   290
      (Symtab.merge (K true) (recs1, recs2))
wenzelm@7178
   291
      {selectors = Symtab.merge (K true) (sels1, sels2),
wenzelm@7178
   292
        updates = Symtab.merge (K true) (upds1, upds2),
wenzelm@7178
   293
        simpset = Simplifier.merge_ss (ss1, ss2)}
schirmer@14255
   294
      (Symtab.merge Thm.eq_thm (equalities1, equalities2))
schirmer@15248
   295
      (gen_merge_lists Thm.eq_thm extinjects1 extinjects2)
schirmer@15015
   296
      (Symtab.merge Thm.eq_thm (extsplit1,extsplit2))
wenzelm@17261
   297
      (Symtab.merge (fn ((a,b,c,d),(w,x,y,z))
wenzelm@17261
   298
                     => Thm.eq_thm (a,w) andalso Thm.eq_thm (b,x) andalso
wenzelm@17261
   299
                        Thm.eq_thm (c,y) andalso Thm.eq_thm (d,z))
schirmer@14700
   300
                    (splits1, splits2))
schirmer@14700
   301
      (Symtab.merge (K true) (extfields1,extfields2))
schirmer@14700
   302
      (Symtab.merge (K true) (fieldext1,fieldext2));
wenzelm@4867
   303
wenzelm@18858
   304
  fun print thy ({records = recs, ...}: record_data) =
wenzelm@4867
   305
    let
wenzelm@18858
   306
      val prt_typ = Sign.pretty_typ thy;
wenzelm@4867
   307
skalberg@15531
   308
      fun pretty_parent NONE = []
skalberg@15531
   309
        | pretty_parent (SOME (Ts, name)) =
wenzelm@4867
   310
            [Pretty.block [prt_typ (Type (name, Ts)), Pretty.str " +"]];
wenzelm@4867
   311
wenzelm@4867
   312
      fun pretty_field (c, T) = Pretty.block
wenzelm@18858
   313
        [Pretty.str (Sign.extern_const thy c), Pretty.str " ::",
wenzelm@12129
   314
          Pretty.brk 1, Pretty.quote (prt_typ T)];
wenzelm@4867
   315
wenzelm@12247
   316
      fun pretty_record (name, {args, parent, fields, ...}: record_info) =
wenzelm@11927
   317
        Pretty.block (Pretty.fbreaks (Pretty.block
wenzelm@11927
   318
          [prt_typ (Type (name, map TFree args)), Pretty.str " = "] ::
wenzelm@4867
   319
          pretty_parent parent @ map pretty_field fields));
wenzelm@12129
   320
    in map pretty_record (Symtab.dest recs) |> Pretty.chunks |> Pretty.writeln end;
wenzelm@16458
   321
end);
wenzelm@4867
   322
wenzelm@5006
   323
val print_records = RecordsData.print;
wenzelm@5006
   324
wenzelm@16458
   325
wenzelm@7178
   326
(* access 'records' *)
wenzelm@4867
   327
wenzelm@17412
   328
val get_record = Symtab.lookup o #records o RecordsData.get;
wenzelm@4867
   329
wenzelm@4890
   330
fun put_record name info thy =
wenzelm@7178
   331
  let
wenzelm@17261
   332
    val {records, sel_upd, equalities, extinjects,extsplit,splits,extfields,fieldext} =
schirmer@15015
   333
          RecordsData.get thy;
wenzelm@17412
   334
    val data = make_record_data (Symtab.update (name, info) records)
schirmer@15015
   335
      sel_upd equalities extinjects extsplit splits extfields fieldext;
wenzelm@7178
   336
  in RecordsData.put data thy end;
wenzelm@7178
   337
wenzelm@7178
   338
(* access 'sel_upd' *)
wenzelm@7178
   339
wenzelm@16458
   340
val get_sel_upd = #sel_upd o RecordsData.get;
wenzelm@7178
   341
wenzelm@17510
   342
val is_selector = Symtab.defined o #selectors o get_sel_upd;
wenzelm@17412
   343
val get_updates = Symtab.lookup o #updates o get_sel_upd;
wenzelm@17892
   344
fun get_simpset thy = Simplifier.theory_context thy (#simpset (get_sel_upd thy));
wenzelm@7178
   345
wenzelm@7178
   346
fun put_sel_upd names simps thy =
wenzelm@7178
   347
  let
wenzelm@7178
   348
    val sels = map (rpair ()) names;
wenzelm@7178
   349
    val upds = map (suffix updateN) names ~~ names;
wenzelm@7178
   350
wenzelm@17261
   351
    val {records, sel_upd = {selectors, updates, simpset},
schirmer@15015
   352
      equalities, extinjects, extsplit, splits, extfields,fieldext} = RecordsData.get thy;
wenzelm@7178
   353
    val data = make_record_data records
wenzelm@7178
   354
      {selectors = Symtab.extend (selectors, sels),
wenzelm@7178
   355
        updates = Symtab.extend (updates, upds),
wenzelm@7178
   356
        simpset = Simplifier.addsimps (simpset, simps)}
schirmer@15015
   357
       equalities extinjects extsplit splits extfields fieldext;
wenzelm@7178
   358
  in RecordsData.put data thy end;
wenzelm@7178
   359
berghofe@14079
   360
(* access 'equalities' *)
berghofe@14079
   361
berghofe@14079
   362
fun add_record_equalities name thm thy =
berghofe@14079
   363
  let
wenzelm@17261
   364
    val {records, sel_upd, equalities, extinjects, extsplit, splits, extfields,fieldext} =
schirmer@15015
   365
          RecordsData.get thy;
wenzelm@17261
   366
    val data = make_record_data records sel_upd
wenzelm@17412
   367
           (Symtab.update_new (name, thm) equalities) extinjects extsplit
schirmer@15015
   368
           splits extfields fieldext;
berghofe@14079
   369
  in RecordsData.put data thy end;
berghofe@14079
   370
wenzelm@17412
   371
val get_equalities =Symtab.lookup o #equalities o RecordsData.get;
berghofe@14079
   372
schirmer@15015
   373
(* access 'extinjects' *)
schirmer@15015
   374
schirmer@15015
   375
fun add_extinjects thm thy =
schirmer@15015
   376
  let
wenzelm@17261
   377
    val {records, sel_upd, equalities, extinjects, extsplit, splits, extfields,fieldext} =
schirmer@15015
   378
          RecordsData.get thy;
wenzelm@17261
   379
    val data = make_record_data records sel_upd equalities (extinjects@[thm]) extsplit
schirmer@15015
   380
                 splits extfields fieldext;
schirmer@15015
   381
  in RecordsData.put data thy end;
schirmer@15015
   382
wenzelm@18858
   383
fun get_extinjects thy = #extinjects (RecordsData.get thy);
schirmer@15015
   384
schirmer@15015
   385
(* access 'extsplit' *)
schirmer@15015
   386
schirmer@15015
   387
fun add_extsplit name thm thy =
schirmer@15015
   388
  let
wenzelm@17261
   389
    val {records, sel_upd, equalities, extinjects, extsplit, splits, extfields,fieldext} =
schirmer@15015
   390
          RecordsData.get thy;
wenzelm@17261
   391
    val data = make_record_data records sel_upd
wenzelm@17412
   392
      equalities extinjects (Symtab.update_new (name, thm) extsplit) splits
schirmer@15015
   393
      extfields fieldext;
schirmer@15015
   394
  in RecordsData.put data thy end;
schirmer@15015
   395
wenzelm@17412
   396
val get_extsplit = Symtab.lookup o #extsplit o RecordsData.get;
schirmer@15015
   397
schirmer@14255
   398
(* access 'splits' *)
schirmer@14255
   399
schirmer@14255
   400
fun add_record_splits name thmP thy =
schirmer@14255
   401
  let
wenzelm@17261
   402
    val {records, sel_upd, equalities, extinjects, extsplit, splits, extfields,fieldext} =
schirmer@15015
   403
          RecordsData.get thy;
wenzelm@17261
   404
    val data = make_record_data records sel_upd
wenzelm@17412
   405
      equalities extinjects extsplit (Symtab.update_new (name, thmP) splits)
schirmer@15015
   406
      extfields fieldext;
schirmer@14255
   407
  in RecordsData.put data thy end;
schirmer@14255
   408
wenzelm@17412
   409
val get_splits = Symtab.lookup o #splits o RecordsData.get;
schirmer@14255
   410
schirmer@15015
   411
schirmer@15015
   412
schirmer@14700
   413
(* extension of a record name *)
wenzelm@17261
   414
val get_extension =
wenzelm@17412
   415
  Option.map #extension oo (Symtab.lookup o #records o RecordsData.get);
wenzelm@17261
   416
berghofe@14079
   417
schirmer@14700
   418
(* access 'extfields' *)
schirmer@14700
   419
schirmer@14700
   420
fun add_extfields name fields thy =
schirmer@14700
   421
  let
wenzelm@17261
   422
    val {records, sel_upd, equalities, extinjects, extsplit,splits, extfields, fieldext} =
schirmer@15015
   423
          RecordsData.get thy;
wenzelm@17261
   424
    val data = make_record_data records sel_upd
wenzelm@17261
   425
         equalities extinjects extsplit splits
wenzelm@17412
   426
         (Symtab.update_new (name, fields) extfields) fieldext;
schirmer@14700
   427
  in RecordsData.put data thy end;
schirmer@14700
   428
wenzelm@17412
   429
val get_extfields = Symtab.lookup o #extfields o RecordsData.get;
schirmer@14700
   430
wenzelm@18858
   431
fun get_extT_fields thy T =
schirmer@15059
   432
  let
schirmer@15059
   433
    val ((name,Ts),moreT) = dest_recT T;
wenzelm@17261
   434
    val recname = let val (nm::recn::rst) = rev (NameSpace.unpack name)
schirmer@15059
   435
                  in NameSpace.pack (rev (nm::rst)) end;
schirmer@15059
   436
    val midx = maxidx_of_typs (moreT::Ts);
schirmer@19748
   437
    val varifyT = varifyT midx;
wenzelm@18858
   438
    val {records,extfields,...} = RecordsData.get thy;
wenzelm@18931
   439
    val (flds,(more,_)) = split_last (Symtab.lookup_list extfields name);
wenzelm@17412
   440
    val args = map varifyT (snd (#extension (the (Symtab.lookup records recname))));
schirmer@15058
   441
schirmer@19748
   442
    val subst = fold (Sign.typ_match thy) (but_last args ~~ but_last Ts) (Vartab.empty);
schirmer@15059
   443
    val flds' = map (apsnd ((Envir.norm_type subst) o varifyT)) flds;
schirmer@15059
   444
  in (flds',(more,moreT)) end;
schirmer@15058
   445
wenzelm@18858
   446
fun get_recT_fields thy T =
wenzelm@17261
   447
  let
wenzelm@18858
   448
    val (root_flds,(root_more,root_moreT)) = get_extT_fields thy T;
wenzelm@17261
   449
    val (rest_flds,rest_more) =
wenzelm@18858
   450
           if is_recT root_moreT then get_recT_fields thy root_moreT
schirmer@15059
   451
           else ([],(root_more,root_moreT));
schirmer@15059
   452
  in (root_flds@rest_flds,rest_more) end;
schirmer@15059
   453
schirmer@15058
   454
schirmer@14700
   455
(* access 'fieldext' *)
schirmer@14700
   456
schirmer@14700
   457
fun add_fieldext extname_types fields thy =
schirmer@14700
   458
  let
wenzelm@17261
   459
    val {records, sel_upd, equalities, extinjects, extsplit, splits, extfields, fieldext} =
schirmer@15015
   460
           RecordsData.get thy;
wenzelm@17261
   461
    val fieldext' =
wenzelm@17412
   462
      fold (fn field => Symtab.update_new (field, extname_types)) fields fieldext;
wenzelm@17261
   463
    val data=make_record_data records sel_upd equalities extinjects extsplit
schirmer@15015
   464
              splits extfields fieldext';
schirmer@14700
   465
  in RecordsData.put data thy end;
schirmer@14700
   466
schirmer@14700
   467
wenzelm@17412
   468
val get_fieldext = Symtab.lookup o #fieldext o RecordsData.get;
schirmer@14700
   469
wenzelm@4867
   470
(* parent records *)
wenzelm@4867
   471
skalberg@15531
   472
fun add_parents thy NONE parents = parents
skalberg@15531
   473
  | add_parents thy (SOME (types, name)) parents =
wenzelm@12247
   474
      let
wenzelm@12247
   475
        val sign = Theory.sign_of thy;
wenzelm@12247
   476
        fun err msg = error (msg ^ " parent record " ^ quote name);
wenzelm@12255
   477
schirmer@14700
   478
        val {args, parent, fields, extension, induct} =
skalberg@15531
   479
          (case get_record thy name of SOME info => info | NONE => err "Unknown");
wenzelm@12247
   480
        val _ = if length types <> length args then err "Bad number of arguments for" else ();
wenzelm@12255
   481
wenzelm@12247
   482
        fun bad_inst ((x, S), T) =
skalberg@15531
   483
          if Sign.of_sort sign (T, S) then NONE else SOME x
skalberg@15570
   484
        val bads = List.mapPartial bad_inst (args ~~ types);
wenzelm@12255
   485
wenzelm@12247
   486
        val inst = map fst args ~~ types;
haftmann@17377
   487
        val subst = Term.map_type_tfree (the o AList.lookup (op =) inst o fst);
skalberg@15570
   488
        val parent' = Option.map (apfst (map subst)) parent;
wenzelm@12247
   489
        val fields' = map (apsnd subst) fields;
schirmer@14700
   490
        val extension' = apsnd (map subst) extension;
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'
schirmer@14700
   495
          (make_parent_info name fields' extension' induct::parents)
wenzelm@12247
   496
      end;
wenzelm@4867
   497
wenzelm@4867
   498
schirmer@14700
   499
(** concrete syntax for records **)
schirmer@14700
   500
schirmer@14700
   501
(* parse translations *)
schirmer@14700
   502
schirmer@14700
   503
fun gen_field_tr mark sfx (t as Const (c, _) $ Const (name, _) $ arg) =
schirmer@21226
   504
      if c = mark then Syntax.const (suffix sfx name) $ (Syntax.const KN $ arg)
schirmer@14700
   505
      else raise TERM ("gen_field_tr: " ^ mark, [t])
schirmer@14700
   506
  | gen_field_tr mark _ t = raise TERM ("gen_field_tr: " ^ mark, [t]);
schirmer@14700
   507
schirmer@14700
   508
fun gen_fields_tr sep mark sfx (tm as Const (c, _) $ t $ u) =
schirmer@14700
   509
      if c = sep then gen_field_tr mark sfx t :: gen_fields_tr sep mark sfx u
schirmer@14700
   510
      else [gen_field_tr mark sfx tm]
schirmer@14700
   511
  | gen_fields_tr _ mark sfx tm = [gen_field_tr mark sfx tm];
schirmer@14700
   512
schirmer@14700
   513
schirmer@14700
   514
fun record_update_tr [t, u] =
haftmann@21078
   515
      Library.foldr (op $) (rev (gen_fields_tr "_updates" "_update" updateN u), t)
schirmer@14700
   516
  | record_update_tr ts = raise TERM ("record_update_tr", ts);
schirmer@14700
   517
schirmer@14700
   518
fun update_name_tr (Free (x, T) :: ts) = Free (suffix updateN x, T) $$ ts
schirmer@14700
   519
  | update_name_tr (Const (x, T) :: ts) = Const (suffix updateN x, T) $$ ts
schirmer@14700
   520
  | update_name_tr (((c as Const ("_constrain", _)) $ t $ ty) :: ts) =
schirmer@14700
   521
      (c $ update_name_tr [t] $ (Syntax.const "fun" $ ty $ Syntax.const "dummy")) $$ ts
schirmer@14700
   522
  | update_name_tr ts = raise TERM ("update_name_tr", ts);
schirmer@14700
   523
schirmer@14700
   524
fun dest_ext_field mark (t as (Const (c,_) $ Const (name,_) $ arg)) =
schirmer@14700
   525
     if c = mark then (name,arg) else raise TERM ("dest_ext_field: " ^ mark, [t])
schirmer@14700
   526
  | dest_ext_field _ t = raise TERM ("dest_ext_field", [t])
schirmer@14700
   527
schirmer@14700
   528
fun dest_ext_fields sep mark (trm as (Const (c,_) $ t $ u)) =
schirmer@14700
   529
     if c = sep then dest_ext_field mark t::dest_ext_fields sep mark u
schirmer@14700
   530
     else [dest_ext_field mark trm]
schirmer@14700
   531
  | dest_ext_fields _ mark t = [dest_ext_field mark t]
schirmer@14700
   532
wenzelm@18858
   533
fun gen_ext_fields_tr sep mark sfx more context t =
wenzelm@17261
   534
  let
wenzelm@18858
   535
    val thy = Context.theory_of context;
schirmer@14709
   536
    val msg = "error in record input: ";
wenzelm@17261
   537
    val fieldargs = dest_ext_fields sep mark t;
schirmer@14700
   538
    fun splitargs (field::fields) ((name,arg)::fargs) =
schirmer@14709
   539
          if can (unsuffix name) field
schirmer@14700
   540
          then let val (args,rest) = splitargs fields fargs
schirmer@14700
   541
               in (arg::args,rest) end
schirmer@14709
   542
          else raise TERM (msg ^ "expecting field " ^ field ^ " but got " ^ name, [t])
schirmer@14700
   543
      | splitargs [] (fargs as (_::_)) = ([],fargs)
schirmer@14709
   544
      | splitargs (_::_) [] = raise TERM (msg ^ "expecting more fields", [t])
schirmer@14700
   545
      | splitargs _ _ = ([],[]);
schirmer@14700
   546
schirmer@14700
   547
    fun mk_ext (fargs as (name,arg)::_) =
wenzelm@18858
   548
         (case get_fieldext thy (Sign.intern_const thy name) of
wenzelm@18858
   549
            SOME (ext,_) => (case get_extfields thy ext of
wenzelm@17261
   550
                               SOME flds
wenzelm@17261
   551
                                 => let val (args,rest) =
schirmer@14700
   552
                                               splitargs (map fst (but_last flds)) fargs;
wenzelm@17261
   553
                                        val more' = mk_ext rest;
schirmer@14700
   554
                                    in list_comb (Syntax.const (suffix sfx ext),args@[more'])
schirmer@14700
   555
                                    end
skalberg@15531
   556
                             | NONE => raise TERM(msg ^ "no fields defined for "
schirmer@14700
   557
                                                   ^ ext,[t]))
skalberg@15531
   558
          | NONE => raise TERM (msg ^ name ^" is no proper field",[t]))
schirmer@14700
   559
      | mk_ext [] = more
schirmer@14700
   560
wenzelm@17261
   561
  in mk_ext fieldargs end;
schirmer@14700
   562
wenzelm@18858
   563
fun gen_ext_type_tr sep mark sfx more context t =
wenzelm@17261
   564
  let
wenzelm@18858
   565
    val thy = Context.theory_of context;
schirmer@14709
   566
    val msg = "error in record-type input: ";
wenzelm@17261
   567
    val fieldargs = dest_ext_fields sep mark t;
schirmer@14700
   568
    fun splitargs (field::fields) ((name,arg)::fargs) =
schirmer@14709
   569
          if can (unsuffix name) field
schirmer@14700
   570
          then let val (args,rest) = splitargs fields fargs
schirmer@14700
   571
               in (arg::args,rest) end
schirmer@14709
   572
          else raise TERM (msg ^ "expecting field " ^ field ^ " but got " ^ name, [t])
schirmer@14700
   573
      | splitargs [] (fargs as (_::_)) = ([],fargs)
schirmer@14709
   574
      | splitargs (_::_) [] = raise TERM (msg ^ "expecting more fields", [t])
schirmer@14700
   575
      | splitargs _ _ = ([],[]);
schirmer@14700
   576
wenzelm@18858
   577
    fun get_sort xs n = AList.lookup (op =) xs n |> the_default (Sign.defaultS thy);
wenzelm@17261
   578
wenzelm@18858
   579
    fun to_type t = Sign.certify_typ thy
wenzelm@18858
   580
                       (Sign.intern_typ thy
schirmer@15957
   581
                         (Syntax.typ_of_term (get_sort (Syntax.raw_term_sorts t)) I t));
wenzelm@16934
   582
schirmer@14700
   583
    fun mk_ext (fargs as (name,arg)::_) =
wenzelm@18858
   584
         (case get_fieldext thy (Sign.intern_const thy name) of
wenzelm@17261
   585
            SOME (ext,alphas) =>
wenzelm@18858
   586
              (case get_extfields thy ext of
wenzelm@17261
   587
                 SOME flds
schirmer@14700
   588
                  => (let
schirmer@14700
   589
                       val flds' = but_last flds;
wenzelm@17261
   590
                       val types = map snd flds';
schirmer@14700
   591
                       val (args,rest) = splitargs (map fst flds') fargs;
schirmer@14700
   592
                       val argtypes = map to_type args;
schirmer@19748
   593
                       val midx =  fold (fn T => fn i => Int.max (maxidx_of_typ T, i)) 
schirmer@19748
   594
                                    argtypes 0;
schirmer@19748
   595
                       val varifyT = varifyT midx;
schirmer@19748
   596
                       val vartypes = map varifyT types;
schirmer@19748
   597
schirmer@19748
   598
                       val subst = fold (Sign.typ_match thy) (vartypes ~~ argtypes)
schirmer@19748
   599
                                            Vartab.empty;
wenzelm@17261
   600
                       val alphas' = map ((Syntax.term_of_typ (! Syntax.show_sorts)) o
schirmer@19748
   601
                                          Envir.norm_type subst o varifyT)
schirmer@14700
   602
                                         (but_last alphas);
wenzelm@17261
   603
wenzelm@17261
   604
                       val more' = mk_ext rest;
wenzelm@17261
   605
                     in list_comb (Syntax.const (suffix sfx ext),alphas'@[more'])
schirmer@19750
   606
                     end handle TYPE_MATCH => raise
schirmer@14709
   607
                           TERM (msg ^ "type is no proper record (extension)", [t]))
skalberg@15531
   608
               | NONE => raise TERM (msg ^ "no fields defined for " ^ ext,[t]))
skalberg@15531
   609
          | NONE => raise TERM (msg ^ name ^" is no proper field",[t]))
schirmer@14700
   610
      | mk_ext [] = more
schirmer@14700
   611
wenzelm@17261
   612
  in mk_ext fieldargs end;
schirmer@14700
   613
wenzelm@18858
   614
fun gen_adv_record_tr sep mark sfx unit context [t] =
wenzelm@18858
   615
      gen_ext_fields_tr sep mark sfx unit context t
schirmer@14700
   616
  | gen_adv_record_tr _ _ _ _ _ ts = raise TERM ("gen_record_tr", ts);
schirmer@14700
   617
wenzelm@18858
   618
fun gen_adv_record_scheme_tr sep mark sfx context [t, more] =
wenzelm@18858
   619
      gen_ext_fields_tr sep mark sfx more context t
schirmer@14700
   620
  | gen_adv_record_scheme_tr _ _ _ _ ts = raise TERM ("gen_record_scheme_tr", ts);
schirmer@14700
   621
wenzelm@18858
   622
fun gen_adv_record_type_tr sep mark sfx unit context [t] =
wenzelm@18858
   623
      gen_ext_type_tr sep mark sfx unit context t
schirmer@14700
   624
  | gen_adv_record_type_tr _ _ _ _ _ ts = raise TERM ("gen_record_tr", ts);
schirmer@14700
   625
wenzelm@18858
   626
fun gen_adv_record_type_scheme_tr sep mark sfx context [t, more] =
wenzelm@18858
   627
      gen_ext_type_tr sep mark sfx more context t
schirmer@14700
   628
  | gen_adv_record_type_scheme_tr _ _ _ _ ts = raise TERM ("gen_record_scheme_tr", ts);
schirmer@14700
   629
schirmer@14700
   630
val adv_record_tr = gen_adv_record_tr "_fields" "_field" extN HOLogic.unit;
schirmer@14700
   631
val adv_record_scheme_tr = gen_adv_record_scheme_tr "_fields" "_field" extN;
schirmer@14700
   632
wenzelm@17261
   633
val adv_record_type_tr =
wenzelm@17261
   634
      gen_adv_record_type_tr "_field_types" "_field_type" ext_typeN
schirmer@14700
   635
        (Syntax.term_of_typ false (HOLogic.unitT));
wenzelm@17261
   636
val adv_record_type_scheme_tr =
schirmer@14700
   637
      gen_adv_record_type_scheme_tr "_field_types" "_field_type" ext_typeN;
schirmer@14700
   638
schirmer@15215
   639
schirmer@21226
   640
val parse_translation = 
schirmer@14700
   641
 [("_record_update", record_update_tr),
wenzelm@17261
   642
  ("_update_name", update_name_tr)];
schirmer@14700
   643
schirmer@21226
   644
schirmer@21226
   645
val adv_parse_translation = 
schirmer@14700
   646
 [("_record",adv_record_tr),
schirmer@14700
   647
  ("_record_scheme",adv_record_scheme_tr),
schirmer@14700
   648
  ("_record_type",adv_record_type_tr),
wenzelm@17261
   649
  ("_record_type_scheme",adv_record_type_scheme_tr)];
schirmer@14700
   650
schirmer@21226
   651
schirmer@14700
   652
(* print translations *)
schirmer@14700
   653
schirmer@14700
   654
val print_record_type_abbr = ref true;
schirmer@14700
   655
val print_record_type_as_fields = ref true;
schirmer@14700
   656
schirmer@21226
   657
fun gen_field_upds_tr' mark sfx (tm as Const (name_field, _) $ (Const ("K_record",_)$t) $ u) =
schirmer@14700
   658
    (case try (unsuffix sfx) name_field of
skalberg@15531
   659
      SOME name =>
schirmer@14700
   660
        apfst (cons (Syntax.const mark $ Syntax.free name $ t)) (gen_field_upds_tr' mark sfx u)
skalberg@15531
   661
     | NONE => ([], tm))
schirmer@14700
   662
  | gen_field_upds_tr' _ _ tm = ([], tm);
schirmer@14700
   663
schirmer@14700
   664
fun record_update_tr' tm =
schirmer@14700
   665
  let val (ts, u) = gen_field_upds_tr' "_update" updateN tm in
schirmer@21226
   666
    if null ts then raise Match
schirmer@21226
   667
    else Syntax.const "_record_update" $ u $
schirmer@21226
   668
          foldr1 (fn (v, w) => Syntax.const "_updates" $ v $ w) (rev ts)
schirmer@14700
   669
  end;
schirmer@14700
   670
schirmer@14700
   671
fun gen_field_tr' sfx tr' name =
schirmer@14700
   672
  let val name_sfx = suffix sfx name
schirmer@14700
   673
  in (name_sfx, fn [t, u] => tr' (Syntax.const name_sfx $ t $ u) | _ => raise Match) end;
schirmer@14700
   674
wenzelm@18858
   675
fun record_tr' sep mark record record_scheme unit context t =
wenzelm@17261
   676
  let
wenzelm@18858
   677
    val thy = Context.theory_of context;
schirmer@14700
   678
    fun field_lst t =
schirmer@14700
   679
      (case strip_comb t of
schirmer@17600
   680
        (Const (ext,_),args as (_::_))
wenzelm@18858
   681
         => (case try (unsuffix extN) (Sign.intern_const thy ext) of
wenzelm@17261
   682
               SOME ext'
wenzelm@18858
   683
               => (case get_extfields thy ext' of
wenzelm@17261
   684
                     SOME flds
schirmer@14700
   685
                     => (let
schirmer@14700
   686
                          val (f::fs) = but_last (map fst flds);
wenzelm@18858
   687
                          val flds' = Sign.extern_const thy f :: map NameSpace.base fs;
wenzelm@17261
   688
                          val (args',more) = split_last args;
schirmer@14700
   689
                         in (flds'~~args')@field_lst more end
wenzelm@19841
   690
                         handle Library.UnequalLengths => [("",t)])
skalberg@15531
   691
                   | NONE => [("",t)])
skalberg@15531
   692
             | NONE => [("",t)])
schirmer@14700
   693
       | _ => [("",t)])
schirmer@14700
   694
schirmer@14700
   695
    val (flds,(_,more)) = split_last (field_lst t);
schirmer@21226
   696
    val _ = if null flds then raise Match else ();
schirmer@14700
   697
    val flds' = map (fn (n,t)=>Syntax.const mark$Syntax.const n$t) flds;
schirmer@14700
   698
    val flds'' = foldr1 (fn (x,y) => Syntax.const sep$x$y) flds';
schirmer@14700
   699
schirmer@21226
   700
  in if unit more
schirmer@21226
   701
     then Syntax.const record$flds''
schirmer@21226
   702
     else Syntax.const record_scheme$flds''$more
schirmer@14700
   703
  end
schirmer@14700
   704
wenzelm@17261
   705
fun gen_record_tr' name =
schirmer@14700
   706
  let val name_sfx = suffix extN name;
schirmer@14700
   707
      val unit = (fn Const ("Unity",_) => true | _ => false);
wenzelm@18858
   708
      fun tr' context ts = record_tr' "_fields" "_field" "_record" "_record_scheme" unit context
schirmer@14700
   709
                       (list_comb (Syntax.const name_sfx,ts))
schirmer@14700
   710
  in (name_sfx,tr')
schirmer@14700
   711
  end
schirmer@14700
   712
schirmer@14700
   713
fun print_translation names =
schirmer@14700
   714
  map (gen_field_tr' updateN record_update_tr') names;
schirmer@14700
   715
schirmer@19748
   716
schirmer@14700
   717
(* record_type_abbr_tr' tries to reconstruct the record name type abbreviation from *)
schirmer@14700
   718
(* the (nested) extension types.                                                    *)
wenzelm@18858
   719
fun record_type_abbr_tr' default_tr' abbr alphas zeta lastExt schemeT context tm =
schirmer@14700
   720
  let
wenzelm@18858
   721
      val thy = Context.theory_of context;
schirmer@14700
   722
      (* tm is term representation of a (nested) field type. We first reconstruct the      *)
schirmer@14700
   723
      (* type from tm so that we can continue on the type level rather then the term level.*)
schirmer@14700
   724
wenzelm@18858
   725
      fun get_sort xs n = AList.lookup (op =) xs n |> the_default (Sign.defaultS thy);
schirmer@14700
   726
schirmer@15273
   727
      (* WORKAROUND:
wenzelm@17261
   728
       * If a record type occurs in an error message of type inference there
schirmer@15273
   729
       * may be some internal frees donoted by ??:
wenzelm@17261
   730
       * (Const "_tfree",_)$Free ("??'a",_).
wenzelm@17261
   731
wenzelm@17261
   732
       * This will unfortunately be translated to Type ("??'a",[]) instead of
wenzelm@17261
   733
       * TFree ("??'a",_) by typ_of_term, which will confuse unify below.
schirmer@15273
   734
       * fixT works around.
schirmer@15273
   735
       *)
wenzelm@17261
   736
      fun fixT (T as Type (x,[])) =
wenzelm@18858
   737
            if String.isPrefix "??'" x then TFree (x,Sign.defaultS thy) else T
schirmer@15273
   738
        | fixT (Type (x,xs)) = Type (x,map fixT xs)
schirmer@15273
   739
        | fixT T = T;
wenzelm@17261
   740
wenzelm@18858
   741
      val T = fixT (Sign.intern_typ thy
wenzelm@17261
   742
                      (Syntax.typ_of_term (get_sort (Syntax.raw_term_sorts tm)) I tm));
schirmer@19748
   743
      val midx = maxidx_of_typ T;
schirmer@19748
   744
      val varifyT = varifyT midx;
schirmer@14700
   745
wenzelm@17261
   746
      fun mk_type_abbr subst name alphas =
schirmer@19748
   747
          let val abbrT = Type (name, map (fn a => varifyT (TFree (a, Sign.defaultS thy))) alphas);
wenzelm@17261
   748
          in Syntax.term_of_typ (! Syntax.show_sorts)
wenzelm@18858
   749
               (Sign.extern_typ thy (Envir.norm_type subst abbrT)) end;
schirmer@14700
   750
schirmer@19748
   751
      fun match rT T = (Sign.typ_match thy (varifyT rT,T) 
schirmer@19748
   752
                                                Vartab.empty);
schirmer@14700
   753
schirmer@14700
   754
   in if !print_record_type_abbr
schirmer@14700
   755
      then (case last_extT T of
wenzelm@17261
   756
             SOME (name,_)
wenzelm@17261
   757
              => if name = lastExt
schirmer@14700
   758
                 then
wenzelm@17261
   759
                  (let
schirmer@19748
   760
                     val subst = match schemeT T
wenzelm@17261
   761
                   in
schirmer@19748
   762
                    if HOLogic.is_unitT (Envir.norm_type subst (varifyT (TFree(zeta,Sign.defaultS thy))))
schirmer@14700
   763
                    then mk_type_abbr subst abbr alphas
schirmer@14700
   764
                    else mk_type_abbr subst (suffix schemeN abbr) (alphas@[zeta])
schirmer@19750
   765
                   end handle TYPE_MATCH => default_tr' context tm)
schirmer@14700
   766
                 else raise Match (* give print translation of specialised record a chance *)
schirmer@14700
   767
            | _ => raise Match)
wenzelm@18858
   768
       else default_tr' context tm
schirmer@14700
   769
  end
schirmer@14700
   770
wenzelm@18858
   771
fun record_type_tr' sep mark record record_scheme context t =
schirmer@14700
   772
  let
wenzelm@18858
   773
    val thy = Context.theory_of context;
wenzelm@18858
   774
    fun get_sort xs n = AList.lookup (op =) xs n |> the_default (Sign.defaultS thy);
schirmer@14700
   775
wenzelm@18858
   776
    val T = Sign.intern_typ thy (Syntax.typ_of_term (get_sort (Syntax.raw_term_sorts t)) I t)
schirmer@19748
   777
    val varifyT = varifyT (Term.maxidx_of_typ T)
schirmer@14700
   778
wenzelm@18858
   779
    fun term_of_type T = Syntax.term_of_typ (!Syntax.show_sorts) (Sign.extern_typ thy T);
wenzelm@17261
   780
schirmer@14700
   781
    fun field_lst T =
schirmer@14700
   782
      (case T of
wenzelm@17261
   783
        Type (ext,args)
schirmer@14700
   784
         => (case try (unsuffix ext_typeN) ext of
wenzelm@17261
   785
               SOME ext'
wenzelm@18858
   786
               => (case get_extfields thy ext' of
wenzelm@17261
   787
                     SOME flds
wenzelm@18858
   788
                     => (case get_fieldext thy (fst (hd flds)) of
wenzelm@17261
   789
                           SOME (_,alphas)
schirmer@14700
   790
                           => (let
schirmer@14700
   791
                                val (f::fs) = but_last flds;
wenzelm@18858
   792
                                val flds' = apfst (Sign.extern_const thy) f
wenzelm@17261
   793
                                            ::map (apfst NameSpace.base) fs;
wenzelm@17261
   794
                                val (args',more) = split_last args;
schirmer@19748
   795
                                val alphavars = map varifyT (but_last alphas);
schirmer@19748
   796
                                val subst= fold (Sign.typ_match thy) (alphavars~~args')
schirmer@19748
   797
                                                    Vartab.empty;
schirmer@19748
   798
                                val flds'' =map (apsnd (Envir.norm_type subst o varifyT))
schirmer@14700
   799
                                                flds';
schirmer@14700
   800
                              in flds''@field_lst more end
schirmer@19750
   801
                              handle TYPE_MATCH     => [("",T)]
wenzelm@19841
   802
                                   | Library.UnequalLengths => [("",T)])
skalberg@15531
   803
                         | NONE => [("",T)])
skalberg@15531
   804
                   | NONE => [("",T)])
wenzelm@17261
   805
             | NONE => [("",T)])
schirmer@14700
   806
        | _ => [("",T)])
schirmer@14700
   807
schirmer@14700
   808
    val (flds,(_,moreT)) = split_last (field_lst T);
schirmer@14700
   809
    val flds' = map (fn (n,T)=>Syntax.const mark$Syntax.const n$term_of_type T) flds;
schirmer@14700
   810
    val flds'' = foldr1 (fn (x,y) => Syntax.const sep$x$y) flds';
schirmer@14700
   811
schirmer@14700
   812
  in if not (!print_record_type_as_fields) orelse null flds then raise Match
wenzelm@17261
   813
     else if moreT = HOLogic.unitT
wenzelm@17261
   814
          then Syntax.const record$flds''
schirmer@14700
   815
          else Syntax.const record_scheme$flds''$term_of_type moreT
schirmer@14700
   816
  end
wenzelm@17261
   817
schirmer@14700
   818
wenzelm@17261
   819
fun gen_record_type_tr' name =
schirmer@14700
   820
  let val name_sfx = suffix ext_typeN name;
wenzelm@18858
   821
      fun tr' context ts = record_type_tr' "_field_types" "_field_type"
wenzelm@18858
   822
                       "_record_type" "_record_type_scheme" context
schirmer@14700
   823
                       (list_comb (Syntax.const name_sfx,ts))
schirmer@14700
   824
  in (name_sfx,tr')
schirmer@14700
   825
  end
schirmer@14700
   826
wenzelm@17261
   827
schirmer@14700
   828
fun gen_record_type_abbr_tr' abbr alphas zeta lastExt schemeT name =
schirmer@14700
   829
  let val name_sfx = suffix ext_typeN name;
wenzelm@17261
   830
      val default_tr' = record_type_tr' "_field_types" "_field_type"
wenzelm@17261
   831
                               "_record_type" "_record_type_scheme"
wenzelm@18858
   832
      fun tr' context ts =
wenzelm@18858
   833
          record_type_abbr_tr' default_tr' abbr alphas zeta lastExt schemeT context
wenzelm@18858
   834
                               (list_comb (Syntax.const name_sfx,ts))
schirmer@14700
   835
  in (name_sfx, tr') end;
schirmer@14700
   836
schirmer@15015
   837
(** record simprocs **)
schirmer@14358
   838
schirmer@15015
   839
val record_quick_and_dirty_sensitive = ref false;
schirmer@15015
   840
schirmer@15215
   841
wenzelm@18858
   842
fun quick_and_dirty_prove stndrd thy asms prop tac =
schirmer@15015
   843
  if !record_quick_and_dirty_sensitive andalso !quick_and_dirty
wenzelm@20049
   844
  then Goal.prove (ProofContext.init thy) [] []
wenzelm@20049
   845
        (Logic.list_implies (map Logic.varify asms,Logic.varify prop))
schirmer@15015
   846
        (K (SkipProof.cheat_tac HOL.thy))
schirmer@15015
   847
        (* standard can take quite a while for large records, thats why
wenzelm@17261
   848
         * we varify the proposition manually here.*)
wenzelm@20049
   849
  else let val prf = Goal.prove (ProofContext.init thy) [] asms prop tac;
wenzelm@17261
   850
       in if stndrd then standard prf else prf end;
schirmer@15215
   851
wenzelm@17261
   852
fun quick_and_dirty_prf noopt opt () =
wenzelm@17261
   853
      if !record_quick_and_dirty_sensitive andalso !quick_and_dirty
schirmer@15215
   854
      then noopt ()
schirmer@15215
   855
      else opt ();
wenzelm@4867
   856
schirmer@21226
   857
local
schirmer@21226
   858
fun abstract_over_fun_app (Abs (f,fT,t)) =
schirmer@21226
   859
  let
schirmer@21226
   860
     val (f',t') = Term.dest_abs (f,fT,t);
schirmer@21226
   861
     val T = domain_type fT;
schirmer@21226
   862
     val (x,T') = hd (Term.variant_frees t' [("x",T)]);
schirmer@21226
   863
     val f_x = Free (f',fT)$(Free (x,T'));
schirmer@21226
   864
     fun is_constr (Const (c,_)$_) = can (unsuffix extN) c
schirmer@21226
   865
       | is_constr _ = false;
schirmer@21226
   866
     fun subst (t as u$w) = if Free (f',fT)=u 
schirmer@21226
   867
                            then if is_constr w then f_x 
schirmer@21226
   868
                                 else raise TERM ("abstract_over_fun_app",[t])
schirmer@21226
   869
                            else subst u$subst w
schirmer@21226
   870
       | subst (Abs (x,T,t)) = (Abs (x,T,subst t))
schirmer@21226
   871
       | subst t = t
schirmer@21226
   872
     val t'' = abstract_over (f_x,subst t');
schirmer@21226
   873
     val vars = strip_qnt_vars "all" t'';
schirmer@21226
   874
     val bdy = strip_qnt_body "all" t'';
schirmer@21226
   875
     
schirmer@21226
   876
  in list_abs ((x,T')::vars,bdy) end
schirmer@21226
   877
  | abstract_over_fun_app t = raise TERM ("abstract_over_fun_app",[t]);
schirmer@21226
   878
(* Generates a theorem of the kind:
schirmer@21226
   879
 * !!f x*. PROP P (f ( r x* ) x* == !!r x*. PROP P r x* 
schirmer@21226
   880
 *) 
schirmer@21226
   881
fun mk_fun_apply_eq (Abs (f, fT, t)) thy =
schirmer@21226
   882
  let
schirmer@21226
   883
    val rT = domain_type fT;
schirmer@21226
   884
    val vars = Term.strip_qnt_vars "all" t;
schirmer@21226
   885
    val Ts = map snd vars;
schirmer@21226
   886
    val n = length vars;
schirmer@21226
   887
    fun app_bounds 0 t = t$Bound 0
schirmer@21226
   888
      | app_bounds n t = if n > 0 then app_bounds (n-1) (t$Bound n) else t
schirmer@21226
   889
schirmer@21226
   890
   
schirmer@21226
   891
    val [P,r] = Term.variant_frees t [("P",rT::Ts--->Term.propT),("r",Ts--->rT)];
schirmer@21226
   892
    val prop = Logic.mk_equals
schirmer@21226
   893
                (list_all ((f,fT)::vars,
schirmer@21226
   894
                           app_bounds (n - 1) ((Free P)$(Bound n$app_bounds (n-1) (Free r)))),
schirmer@21226
   895
                 list_all ((fst r,rT)::vars,
schirmer@21226
   896
                           app_bounds (n - 1) ((Free P)$Bound n))); 
schirmer@21226
   897
    val prove_standard = quick_and_dirty_prove true thy;
schirmer@21226
   898
    val thm = prove_standard [] prop (fn prems =>
schirmer@21226
   899
	 EVERY [rtac equal_intr_rule 1, 
schirmer@21226
   900
                norm_hhf_tac 1,REPEAT (etac meta_allE 1), atac 1,
schirmer@21226
   901
                norm_hhf_tac 1,REPEAT (etac meta_allE 1), atac 1]);
schirmer@21226
   902
  in thm end
schirmer@21226
   903
  | mk_fun_apply_eq t thy = raise TERM ("mk_fun_apply_eq",[t]);
schirmer@21226
   904
schirmer@21226
   905
in
schirmer@21226
   906
(* During proof of theorems produced by record_simproc you can end up in
schirmer@21226
   907
 * situations like "!!f ... . ... f r ..." where f is an extension update function.
schirmer@21226
   908
 * In order to split "f r" we transform this to "!!r ... . ... r ..." so that the
schirmer@21226
   909
 * usual split rules for extensions can apply.
schirmer@21226
   910
 *)
schirmer@21226
   911
val record_split_f_more_simproc =
schirmer@21226
   912
  Simplifier.simproc HOL.thy "record_split_f_more_simp" ["x"]
schirmer@21226
   913
    (fn thy => fn _ => fn t =>
schirmer@21226
   914
      (case t of (Const ("all", Type (_, [Type (_, [Type("fun",[T,T']), _]), _])))$
schirmer@21226
   915
                  (trm as Abs _) =>
schirmer@21226
   916
         (case rec_id (~1) T of
schirmer@21226
   917
            "" => NONE
schirmer@21226
   918
          | n => if T=T'  
schirmer@21226
   919
                 then (let
schirmer@21226
   920
                        val P=cterm_of thy (abstract_over_fun_app trm); 
schirmer@21226
   921
                        val thm = mk_fun_apply_eq trm thy;
schirmer@21226
   922
                        val PV = cterm_of thy (hd (term_vars (prop_of thm)));
schirmer@21226
   923
                        val thm' = cterm_instantiate [(PV,P)] thm;
schirmer@21226
   924
                       in SOME  thm' end handle TERM _ => NONE)
schirmer@21226
   925
                else NONE) 
schirmer@21226
   926
       | _ => NONE))
schirmer@21226
   927
end
schirmer@14255
   928
wenzelm@18858
   929
fun prove_split_simp thy ss T prop =
wenzelm@17261
   930
  let
wenzelm@18858
   931
    val {sel_upd={simpset,...},extsplit,...} = RecordsData.get thy;
wenzelm@17261
   932
    val extsplits =
wenzelm@17412
   933
            Library.foldl (fn (thms,(n,_)) => the_list (Symtab.lookup extsplit n) @ thms)
schirmer@15015
   934
                    ([],dest_recTs T);
wenzelm@18858
   935
    val thms = (case get_splits thy (rec_id (~1) T) of
wenzelm@17261
   936
                   SOME (all_thm,_,_,_) =>
schirmer@15203
   937
                     all_thm::(case extsplits of [thm] => [] | _ => extsplits)
schirmer@15203
   938
                              (* [thm] is the same as all_thm *)
wenzelm@17261
   939
                 | NONE => extsplits)
schirmer@21226
   940
    val thms'=K_comp_convs@thms;
schirmer@21226
   941
    val ss' = (Simplifier.inherit_context ss simpset 
schirmer@21226
   942
                addsimps thms'
schirmer@21226
   943
                addsimprocs [record_split_f_more_simproc]);
wenzelm@16973
   944
  in
schirmer@21226
   945
    quick_and_dirty_prove true thy [] prop (fn _ => simp_tac ss' 1)
schirmer@15203
   946
  end;
schirmer@15015
   947
schirmer@15215
   948
schirmer@15059
   949
local
schirmer@16822
   950
fun eq (s1:string) (s2:string) = (s1 = s2);
schirmer@16822
   951
fun has_field extfields f T =
wenzelm@18931
   952
     exists (fn (eN,_) => exists (eq f o fst) (Symtab.lookup_list extfields eN))
schirmer@16822
   953
       (dest_recTs T);
schirmer@15059
   954
in
schirmer@14255
   955
(* record_simproc *)
schirmer@14255
   956
(* Simplifies selections of an record update:
schirmer@21226
   957
 *  (1)  S (S_update k r) = k (S r)
schirmer@21226
   958
 *  (2)  S (X_update k r) = S r
schirmer@14255
   959
 * The simproc skips multiple updates at once, eg:
schirmer@21226
   960
 *  S (X_update x (Y_update y (S_update k r))) = k (S r)
schirmer@14255
   961
 * But be careful in (2) because of the extendibility of records.
schirmer@14255
   962
 * - If S is a more-selector we have to make sure that the update on component
schirmer@14255
   963
 *   X does not affect the selected subrecord.
schirmer@14255
   964
 * - If X is a more-selector we have to make sure that S is not in the updated
wenzelm@17261
   965
 *   subrecord.
schirmer@14255
   966
 *)
wenzelm@13462
   967
val record_simproc =
wenzelm@17616
   968
  Simplifier.simproc HOL.thy "record_simp" ["x"]
wenzelm@18858
   969
    (fn thy => fn ss => fn t =>
schirmer@16872
   970
      (case t of (sel as Const (s, Type (_,[domS,rangeS])))$
schirmer@16872
   971
                   ((upd as Const (u,Type(_,[_,Type (_,[rT,_])]))) $ k $ r)=>
wenzelm@18858
   972
        if is_selector thy s then
wenzelm@18858
   973
          (case get_updates thy u of SOME u_name =>
wenzelm@13462
   974
            let
wenzelm@18858
   975
              val {sel_upd={updates,...},extfields,...} = RecordsData.get thy;
wenzelm@17261
   976
schirmer@16872
   977
              fun mk_eq_terms ((upd as Const (u,Type(_,[kT,_]))) $ k $ r) =
wenzelm@17412
   978
                  (case Symtab.lookup updates u of
skalberg@15531
   979
                     NONE => NONE
wenzelm@17261
   980
                   | SOME u_name
schirmer@14255
   981
                     => if u_name = s
schirmer@21226
   982
                        then (case mk_eq_terms r of 
schirmer@21226
   983
                               NONE => 
schirmer@21226
   984
                                 let
schirmer@21226
   985
                                   val rv = ("r",rT)
schirmer@21226
   986
                                   val rb = Bound 0
schirmer@21226
   987
                                   val kv = ("k",kT)
schirmer@21226
   988
                                   val kb = Bound 1
schirmer@21226
   989
                                  in SOME (upd$kb$rb,kb$(sel$rb),[kv,rv]) end
schirmer@21226
   990
                              | SOME (trm,trm',vars) =>
schirmer@21226
   991
                                 let
schirmer@21226
   992
                                   val kv = ("k",kT)
schirmer@21226
   993
                                   val kb = Bound (length vars)
schirmer@21226
   994
                                 in SOME (upd$kb$trm,kb$trm',kv::vars) end)
schirmer@16822
   995
                        else if has_field extfields u_name rangeS
schirmer@21226
   996
                             orelse has_field extfields s (domain_type kT)
skalberg@15531
   997
                             then NONE
wenzelm@17261
   998
                             else (case mk_eq_terms r of
schirmer@21226
   999
                                     SOME (trm,trm',vars)
wenzelm@17261
  1000
                                     => let
wenzelm@17261
  1001
                                          val kv = ("k",kT)
schirmer@14255
  1002
                                          val kb = Bound (length vars)
schirmer@21226
  1003
                                        in SOME (upd$kb$trm,trm',kv::vars) end
skalberg@15531
  1004
                                   | NONE
wenzelm@17261
  1005
                                     => let
wenzelm@17261
  1006
                                          val rv = ("r",rT)
schirmer@14255
  1007
                                          val rb = Bound 0
schirmer@16872
  1008
                                          val kv = ("k",kT)
wenzelm@17261
  1009
                                          val kb = Bound 1
schirmer@21226
  1010
                                        in SOME (upd$kb$rb,sel$rb,[kv,rv]) end))
wenzelm@17261
  1011
                | mk_eq_terms r = NONE
wenzelm@13462
  1012
            in
wenzelm@17261
  1013
              (case mk_eq_terms (upd$k$r) of
schirmer@21226
  1014
                 SOME (trm,trm',vars)
schirmer@21226
  1015
                 => SOME (prove_split_simp thy ss domS
schirmer@16872
  1016
                                 (list_all(vars,(equals rangeS$(sel$trm)$trm'))))
skalberg@15531
  1017
               | NONE => NONE)
wenzelm@13462
  1018
            end
skalberg@15531
  1019
          | NONE => NONE)
wenzelm@17510
  1020
        else NONE
skalberg@15531
  1021
      | _ => NONE));
wenzelm@7178
  1022
wenzelm@17261
  1023
(* record_upd_simproc *)
schirmer@15015
  1024
(* simplify multiple updates:
schirmer@21226
  1025
 *  (1)  "N_update y (M_update g (N_update x (M_update f r))) =
schirmer@21226
  1026
          (N_update (y o x) (M_update (g o f) r))"
schirmer@15015
  1027
 *  (2)  "r(|M:= M r|) = r"
schirmer@15015
  1028
 * For (2) special care of "more" updates has to be taken:
schirmer@15015
  1029
 *    r(|more := m; A := A r|)
schirmer@15015
  1030
 * If A is contained in the fields of m we cannot remove the update A := A r!
wenzelm@17261
  1031
 * (But r(|more := r; A := A (r(|more := r|))|) = r(|more := r|)
schirmer@15015
  1032
*)
schirmer@15015
  1033
val record_upd_simproc =
wenzelm@17616
  1034
  Simplifier.simproc HOL.thy "record_upd_simp" ["x"]
wenzelm@18858
  1035
    (fn thy => fn ss => fn t =>
schirmer@16872
  1036
      (case t of ((upd as Const (u, Type(_,[_,Type(_,[rT,_])]))) $ k $ r) =>
wenzelm@17261
  1037
         let datatype ('a,'b) calc = Init of 'b | Inter of 'a
wenzelm@18858
  1038
             val {sel_upd={selectors,updates,...},extfields,...} = RecordsData.get thy;
wenzelm@17261
  1039
wenzelm@17261
  1040
             (*fun mk_abs_var x t = (x, fastype_of t);*)
schirmer@15015
  1041
             fun sel_name u = NameSpace.base (unsuffix updateN u);
schirmer@15015
  1042
schirmer@15015
  1043
             fun seed s (upd as Const (more,Type(_,[mT,_]))$ k $ r) =
schirmer@21226
  1044
                  if has_field extfields s (domain_type' mT) then upd else seed s r
schirmer@15015
  1045
               | seed _ r = r;
schirmer@15015
  1046
wenzelm@17261
  1047
             fun grow u uT k kT vars (sprout,skeleton) =
wenzelm@17261
  1048
                   if sel_name u = moreN
schirmer@16872
  1049
                   then let val kv = ("k", kT);
schirmer@15015
  1050
                            val kb = Bound (length vars);
schirmer@15015
  1051
                        in ((Const (u,uT)$k$sprout,Const (u,uT)$kb$skeleton),kv::vars) end
schirmer@15015
  1052
                   else ((sprout,skeleton),vars);
schirmer@15015
  1053
schirmer@21226
  1054
             fun is_upd_same (sprout,skeleton) u 
schirmer@21226
  1055
                                ((K_rec as Const ("Record.K_record",_))$
schirmer@21226
  1056
                                  ((sel as Const (s,_))$r)) =
wenzelm@17261
  1057
                   if (unsuffix updateN u) = s andalso (seed s sprout) = r
schirmer@21226
  1058
                   then SOME (K_rec,sel,seed s skeleton)
skalberg@15531
  1059
                   else NONE
skalberg@15531
  1060
               | is_upd_same _ _ _ = NONE
wenzelm@17261
  1061
schirmer@16872
  1062
             fun init_seed r = ((r,Bound 0), [("r", rT)]);
wenzelm@17261
  1063
schirmer@21226
  1064
             fun add (n:string) f fmaps = 
schirmer@21226
  1065
               (case AList.lookup (op =) fmaps n of
schirmer@21226
  1066
                  NONE => AList.update (op =) (n,[f]) fmaps
schirmer@21226
  1067
                | SOME fs => AList.update (op =) (n,f::fs) fmaps) 
schirmer@21226
  1068
schirmer@21226
  1069
             fun comps (n:string) T fmaps = 
schirmer@21226
  1070
               (case AList.lookup (op =) fmaps n of
schirmer@21226
  1071
                 SOME fs => 
schirmer@21226
  1072
                   foldr1 (fn (f,g) => Const ("Fun.comp",(T-->T)-->(T-->T)-->(T-->T))$f$g) fs
schirmer@21226
  1073
                | NONE => error ("record_upd_simproc.comps"))
schirmer@21226
  1074
             
schirmer@15015
  1075
             (* mk_updterm returns either
schirmer@15015
  1076
              *  - Init (orig-term, orig-term-skeleton, vars) if no optimisation can be made,
wenzelm@17261
  1077
              *     where vars are the bound variables in the skeleton
wenzelm@17261
  1078
              *  - Inter (orig-term-skeleton,simplified-term-skeleton,
schirmer@16872
  1079
              *           vars, (term-sprout, skeleton-sprout))
schirmer@15015
  1080
              *     where "All vars. orig-term-skeleton = simplified-term-skeleton" is
schirmer@15015
  1081
              *     the desired simplification rule,
schirmer@15015
  1082
              *     the sprouts accumulate the "more-updates" on the way from the seed
wenzelm@17261
  1083
              *     to the outermost update. It is only relevant to calculate the
wenzelm@17261
  1084
              *     possible simplification for (2)
schirmer@15015
  1085
              * The algorithm first walks down the updates to the seed-record while
schirmer@15015
  1086
              * memorising the updates in the already-table. While walking up the
schirmer@15015
  1087
              * updates again, the optimised term is constructed.
schirmer@15015
  1088
              *)
wenzelm@17261
  1089
             fun mk_updterm upds already
schirmer@16872
  1090
                 (t as ((upd as Const (u,uT as (Type (_,[kT,_])))) $ k $ r)) =
wenzelm@17261
  1091
                 if Symtab.defined upds u
wenzelm@17261
  1092
                 then let
wenzelm@17261
  1093
                         fun rest already = mk_updterm upds already
wenzelm@17261
  1094
                      in if u mem_string already
wenzelm@17261
  1095
                         then (case (rest already r) of
wenzelm@17261
  1096
                                 Init ((sprout,skel),vars) =>
schirmer@15015
  1097
                                 let
schirmer@21226
  1098
                                   val n = sel_name u;
schirmer@21226
  1099
                                   val kv = (n, kT);
schirmer@15015
  1100
                                   val kb = Bound (length vars);
schirmer@16872
  1101
                                   val (sprout',vars')= grow u uT k kT (kv::vars) (sprout,skel);
schirmer@21226
  1102
                                 in Inter (upd$kb$skel,skel,vars',add n kb [],sprout') end
schirmer@21226
  1103
                               | Inter (trm,trm',vars,fmaps,sprout) =>
wenzelm@17261
  1104
                                 let
schirmer@21226
  1105
                                   val n = sel_name u;
schirmer@21226
  1106
                                   val kv = (n, kT);
schirmer@15015
  1107
                                   val kb = Bound (length vars);
schirmer@16872
  1108
                                   val (sprout',vars') = grow u uT k kT (kv::vars) sprout;
schirmer@21226
  1109
                                 in Inter(upd$kb$trm,trm',kv::vars',add n kb fmaps,sprout') 
schirmer@21226
  1110
                                 end)
wenzelm@17261
  1111
                         else
wenzelm@17261
  1112
                          (case rest (u::already) r of
wenzelm@17261
  1113
                             Init ((sprout,skel),vars) =>
schirmer@15015
  1114
                              (case is_upd_same (sprout,skel) u k of
schirmer@21226
  1115
                                 SOME (K_rec,sel,skel') =>
schirmer@15015
  1116
                                 let
wenzelm@17261
  1117
                                   val (sprout',vars') = grow u uT k kT vars (sprout,skel);
schirmer@21226
  1118
                                  in Inter(upd$(K_rec$(sel$skel'))$skel,skel,vars',[],sprout')
schirmer@21226
  1119
                                  end
wenzelm@17261
  1120
                               | NONE =>
schirmer@15015
  1121
                                 let
wenzelm@17261
  1122
                                   val kv = (sel_name u, kT);
schirmer@15015
  1123
                                   val kb = Bound (length vars);
schirmer@15015
  1124
                                 in Init ((upd$k$sprout,upd$kb$skel),kv::vars) end)
schirmer@21226
  1125
                           | Inter (trm,trm',vars,fmaps,sprout) =>
schirmer@15015
  1126
                               (case is_upd_same sprout u k of
schirmer@21226
  1127
                                  SOME (K_rec,sel,skel) =>
schirmer@15015
  1128
                                  let
schirmer@16872
  1129
                                    val (sprout',vars') = grow u uT k kT vars sprout
schirmer@21226
  1130
                                  in Inter(upd$(K_rec$(sel$skel))$trm,trm',vars',fmaps,sprout')
schirmer@21226
  1131
                                  end
skalberg@15531
  1132
                                | NONE =>
schirmer@15015
  1133
                                  let
schirmer@21226
  1134
                                    val n = sel_name u
schirmer@21226
  1135
                                    val T = domain_type kT
schirmer@21226
  1136
                                    val kv = (n, kT)
schirmer@15015
  1137
                                    val kb = Bound (length vars)
schirmer@16872
  1138
                                    val (sprout',vars') = grow u uT k kT (kv::vars) sprout
schirmer@21226
  1139
                                    val fmaps' = add n kb fmaps 
schirmer@21226
  1140
                                  in Inter (upd$kb$trm,upd$comps n T fmaps'$trm'
schirmer@21226
  1141
                                           ,vars',fmaps',sprout') end))
schirmer@21226
  1142
                     end
wenzelm@17261
  1143
                 else Init (init_seed t)
wenzelm@17261
  1144
               | mk_updterm _ _ t = Init (init_seed t);
schirmer@15015
  1145
wenzelm@17261
  1146
         in (case mk_updterm updates [] t of
schirmer@21226
  1147
               Inter (trm,trm',vars,_,_)
wenzelm@18858
  1148
                => SOME (prove_split_simp thy ss rT
schirmer@16872
  1149
                          (list_all(vars,(equals rT$trm$trm'))))
skalberg@15531
  1150
             | _ => NONE)
schirmer@21226
  1151
         end 
schirmer@21226
  1152
       | _ => NONE))
schirmer@15059
  1153
end
schirmer@15015
  1154
schirmer@14255
  1155
(* record_eq_simproc *)
schirmer@14255
  1156
(* looks up the most specific record-equality.
schirmer@14255
  1157
 * Note on efficiency:
schirmer@14255
  1158
 * Testing equality of records boils down to the test of equality of all components.
schirmer@14255
  1159
 * Therefore the complexity is: #components * complexity for single component.
schirmer@14255
  1160
 * Especially if a record has a lot of components it may be better to split up
schirmer@14255
  1161
 * the record first and do simplification on that (record_split_simp_tac).
schirmer@14255
  1162
 * e.g. r(|lots of updates|) = x
schirmer@14255
  1163
 *
schirmer@14700
  1164
 *               record_eq_simproc       record_split_simp_tac
wenzelm@17261
  1165
 * Complexity: #components * #updates     #updates
wenzelm@17261
  1166
 *
schirmer@14255
  1167
 *)
berghofe@14079
  1168
val record_eq_simproc =
wenzelm@17510
  1169
  Simplifier.simproc HOL.thy "record_eq_simp" ["r = s"]
wenzelm@18858
  1170
    (fn thy => fn _ => fn t =>
berghofe@14079
  1171
      (case t of Const ("op =", Type (_, [T, _])) $ _ $ _ =>
schirmer@15273
  1172
        (case rec_id (~1) T of
skalberg@15531
  1173
           "" => NONE
wenzelm@18858
  1174
         | name => (case get_equalities thy name of
skalberg@15531
  1175
                                NONE => NONE
skalberg@15531
  1176
                              | SOME thm => SOME (thm RS Eq_TrueI)))
skalberg@15531
  1177
       | _ => NONE));
berghofe@14079
  1178
schirmer@14255
  1179
(* record_split_simproc *)
wenzelm@17261
  1180
(* splits quantified occurrences of records, for which P holds. P can peek on the
schirmer@14255
  1181
 * subterm starting at the quantified occurrence of the record (including the quantifier)
schirmer@15273
  1182
 * P t = 0: do not split
schirmer@15273
  1183
 * P t = ~1: completely split
schirmer@15273
  1184
 * P t > 0: split up to given bound of record extensions
schirmer@14255
  1185
 *)
schirmer@14255
  1186
fun record_split_simproc P =
wenzelm@17616
  1187
  Simplifier.simproc HOL.thy "record_split_simp" ["x"]
wenzelm@18858
  1188
    (fn thy => fn _ => fn t =>
schirmer@14255
  1189
      (case t of (Const (quantifier, Type (_, [Type (_, [T, _]), _])))$trm =>
schirmer@14255
  1190
         if quantifier = "All" orelse quantifier = "all" orelse quantifier = "Ex"
schirmer@15273
  1191
         then (case rec_id (~1) T of
skalberg@15531
  1192
                 "" => NONE
schirmer@14700
  1193
               | name
wenzelm@17261
  1194
                  => let val split = P t
wenzelm@17261
  1195
                     in if split <> 0 then
wenzelm@18858
  1196
                        (case get_splits thy (rec_id split T) of
skalberg@15531
  1197
                              NONE => NONE
wenzelm@17261
  1198
                            | SOME (all_thm, All_thm, Ex_thm,_)
skalberg@15531
  1199
                               => SOME (case quantifier of
schirmer@15273
  1200
                                          "all" => all_thm
schirmer@15273
  1201
                                        | "All" => All_thm RS HOL.eq_reflection
schirmer@15273
  1202
                                        | "Ex"  => Ex_thm RS HOL.eq_reflection
schirmer@15273
  1203
                                        | _     => error "record_split_simproc"))
skalberg@15531
  1204
                        else NONE
schirmer@15273
  1205
                      end)
skalberg@15531
  1206
         else NONE
skalberg@15531
  1207
       | _ => NONE))
wenzelm@7178
  1208
schirmer@14427
  1209
val record_ex_sel_eq_simproc =
wenzelm@17510
  1210
  Simplifier.simproc HOL.thy "record_ex_sel_eq_simproc" ["Ex t"]
wenzelm@18858
  1211
    (fn thy => fn ss => fn t =>
wenzelm@17261
  1212
       let
wenzelm@16973
  1213
         fun prove prop =
wenzelm@18858
  1214
           quick_and_dirty_prove true thy [] prop
wenzelm@18858
  1215
             (fn _ => simp_tac (Simplifier.inherit_context ss (get_simpset thy)
wenzelm@16973
  1216
               addsimps simp_thms addsimprocs [record_split_simproc (K ~1)]) 1);
schirmer@14959
  1217
schirmer@14959
  1218
         fun mkeq (lr,Teq,(sel,Tsel),x) i =
wenzelm@18858
  1219
              if is_selector thy sel then
wenzelm@17261
  1220
                 let val x' = if not (loose_bvar1 (x,0))
wenzelm@17261
  1221
                              then Free ("x" ^ string_of_int i, range_type Tsel)
schirmer@14959
  1222
                              else raise TERM ("",[x]);
schirmer@14959
  1223
                     val sel' = Const (sel,Tsel)$Bound 0;
schirmer@14959
  1224
                     val (l,r) = if lr then (sel',x') else (x',sel');
schirmer@14959
  1225
                  in Const ("op =",Teq)$l$r end
wenzelm@17510
  1226
              else raise TERM ("",[Const (sel,Tsel)]);
schirmer@14959
  1227
wenzelm@17261
  1228
         fun dest_sel_eq (Const ("op =",Teq)$(Const (sel,Tsel)$Bound 0)$X) =
schirmer@14959
  1229
                           (true,Teq,(sel,Tsel),X)
schirmer@14959
  1230
           | dest_sel_eq (Const ("op =",Teq)$X$(Const (sel,Tsel)$Bound 0)) =
schirmer@14959
  1231
                           (false,Teq,(sel,Tsel),X)
schirmer@14959
  1232
           | dest_sel_eq _ = raise TERM ("",[]);
schirmer@14959
  1233
wenzelm@17261
  1234
       in
wenzelm@17261
  1235
         (case t of
schirmer@14959
  1236
           (Const ("Ex",Tex)$Abs(s,T,t)) =>
schirmer@16872
  1237
             (let val eq = mkeq (dest_sel_eq t) 0;
schirmer@14959
  1238
                 val prop = list_all ([("r",T)],
schirmer@14959
  1239
                              Logic.mk_equals (Const ("Ex",Tex)$Abs(s,T,eq),
schirmer@14959
  1240
                                               HOLogic.true_const));
skalberg@15531
  1241
             in SOME (prove prop) end
schirmer@16872
  1242
             handle TERM _ => NONE)
wenzelm@17261
  1243
          | _ => NONE)
schirmer@14427
  1244
         end)
schirmer@14427
  1245
wenzelm@5698
  1246
wenzelm@17261
  1247
wenzelm@6358
  1248
schirmer@14255
  1249
local
schirmer@14255
  1250
val inductive_atomize = thms "induct_atomize";
wenzelm@18464
  1251
val inductive_rulify = thms "induct_rulify";
schirmer@14255
  1252
in
schirmer@14255
  1253
(* record_split_simp_tac *)
wenzelm@17261
  1254
(* splits (and simplifies) all records in the goal for which P holds.
schirmer@14255
  1255
 * For quantified occurrences of a record
schirmer@14255
  1256
 * P can peek on the whole subterm (including the quantifier); for free variables P
schirmer@15273
  1257
 * can only peek on the variable itself.
schirmer@15273
  1258
 * P t = 0: do not split
schirmer@15273
  1259
 * P t = ~1: completely split
wenzelm@17261
  1260
 * P t > 0: split up to given bound of record extensions
schirmer@14255
  1261
 *)
schirmer@15248
  1262
fun record_split_simp_tac thms P i st =
schirmer@14255
  1263
  let
wenzelm@18858
  1264
    val thy = Thm.theory_of_thm st;
schirmer@14255
  1265
schirmer@14700
  1266
    val has_rec = exists_Const
schirmer@14255
  1267
      (fn (s, Type (_, [Type (_, [T, _]), _])) =>
wenzelm@17261
  1268
          (s = "all" orelse s = "All" orelse s = "Ex") andalso is_recT T
schirmer@14255
  1269
        | _ => false);
schirmer@14255
  1270
haftmann@18011
  1271
    val goal = nth (Thm.prems_of st) (i - 1);
skalberg@15570
  1272
    val frees = List.filter (is_recT o type_of) (term_frees goal);
schirmer@14255
  1273
wenzelm@17261
  1274
    fun mk_split_free_tac free induct_thm i =
wenzelm@18858
  1275
        let val cfree = cterm_of thy free;
schirmer@14255
  1276
            val (_$(_$r)) = concl_of induct_thm;
wenzelm@18858
  1277
            val crec = cterm_of thy r;
schirmer@14255
  1278
            val thm  = cterm_instantiate [(crec,cfree)] induct_thm;
schirmer@14255
  1279
        in EVERY [simp_tac (HOL_basic_ss addsimps inductive_atomize) i,
schirmer@14255
  1280
                  rtac thm i,
wenzelm@18464
  1281
                  simp_tac (HOL_basic_ss addsimps inductive_rulify) i]
wenzelm@17261
  1282
        end;
schirmer@14255
  1283
wenzelm@17261
  1284
    fun split_free_tac P i (free as Free (n,T)) =
wenzelm@17261
  1285
        (case rec_id (~1) T of
skalberg@15531
  1286
           "" => NONE
wenzelm@17261
  1287
         | name => let val split = P free
wenzelm@17261
  1288
                   in if split <> 0 then
wenzelm@18858
  1289
                      (case get_splits thy (rec_id split T) of
skalberg@15531
  1290
                             NONE => NONE
skalberg@15531
  1291
                           | SOME (_,_,_,induct_thm)
skalberg@15531
  1292
                               => SOME (mk_split_free_tac free induct_thm i))
skalberg@15531
  1293
                      else NONE
schirmer@15273
  1294
                   end)
skalberg@15531
  1295
     | split_free_tac _ _ _ = NONE;
schirmer@14255
  1296
skalberg@15570
  1297
    val split_frees_tacs = List.mapPartial (split_free_tac P i) frees;
wenzelm@17261
  1298
schirmer@14700
  1299
    val simprocs = if has_rec goal then [record_split_simproc P] else [];
schirmer@21226
  1300
    val thms' = K_comp_convs@thms
wenzelm@17261
  1301
  in st |> ((EVERY split_frees_tacs)
schirmer@21226
  1302
           THEN (Simplifier.full_simp_tac (get_simpset thy addsimps thms' addsimprocs simprocs) i))
skalberg@15570
  1303
  end handle Empty => Seq.empty;
schirmer@14255
  1304
end;
schirmer@14255
  1305
schirmer@14700
  1306
schirmer@14700
  1307
(* record_split_tac *)
schirmer@14700
  1308
(* splits all records in the goal, which are quantified by ! or !!. *)
schirmer@14700
  1309
fun record_split_tac i st =
schirmer@14700
  1310
  let
wenzelm@18858
  1311
    val thy = Thm.theory_of_thm st;
schirmer@14700
  1312
schirmer@14700
  1313
    val has_rec = exists_Const
schirmer@14700
  1314
      (fn (s, Type (_, [Type (_, [T, _]), _])) =>
wenzelm@17261
  1315
          (s = "all" orelse s = "All") andalso is_recT T
schirmer@14700
  1316
        | _ => false);
wenzelm@17261
  1317
haftmann@18011
  1318
    val goal = nth (Thm.prems_of st) (i - 1);
schirmer@14700
  1319
schirmer@14700
  1320
    fun is_all t =
schirmer@14700
  1321
      (case t of (Const (quantifier, _)$_) =>
schirmer@15273
  1322
         if quantifier = "All" orelse quantifier = "all" then ~1 else 0
schirmer@15273
  1323
       | _ => 0);
wenzelm@17261
  1324
wenzelm@17261
  1325
  in if has_rec goal
wenzelm@17261
  1326
     then Simplifier.full_simp_tac
wenzelm@17261
  1327
           (HOL_basic_ss addsimprocs [record_split_simproc is_all]) i st
schirmer@14700
  1328
     else Seq.empty
skalberg@15570
  1329
  end handle Subscript => Seq.empty;
schirmer@14700
  1330
wenzelm@6358
  1331
(* wrapper *)
wenzelm@6358
  1332
wenzelm@5707
  1333
val record_split_name = "record_split_tac";
wenzelm@5707
  1334
val record_split_wrapper = (record_split_name, fn tac => record_split_tac ORELSE' tac);
wenzelm@5698
  1335
wenzelm@16330
  1336
wenzelm@16330
  1337
wenzelm@4867
  1338
(** theory extender interface **)
wenzelm@4867
  1339
wenzelm@4867
  1340
(* prepare arguments *)
wenzelm@4867
  1341
wenzelm@4867
  1342
fun read_raw_parent sign s =
wenzelm@16330
  1343
  (case Sign.read_typ_abbrev (sign, K NONE) s handle TYPE (msg, _, _) => error msg of
wenzelm@4867
  1344
    Type (name, Ts) => (Ts, name)
wenzelm@4867
  1345
  | _ => error ("Bad parent record specification: " ^ quote s));
wenzelm@4867
  1346
wenzelm@4867
  1347
fun read_typ sign (env, s) =
wenzelm@4867
  1348
  let
haftmann@17377
  1349
    fun def_sort (x, ~1) = AList.lookup (op =) env x
skalberg@15531
  1350
      | def_sort _ = NONE;
wenzelm@5060
  1351
    val T = Type.no_tvars (Sign.read_typ (sign, def_sort) s) handle TYPE (msg, _, _) => error msg;
wenzelm@4867
  1352
  in (Term.add_typ_tfrees (T, env), T) end;
wenzelm@4867
  1353
wenzelm@4867
  1354
fun cert_typ sign (env, raw_T) =
wenzelm@4867
  1355
  let val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle TYPE (msg, _, _) => error msg
wenzelm@4867
  1356
  in (Term.add_typ_tfrees (T, env), T) end;
wenzelm@4867
  1357
schirmer@14700
  1358
(* attributes *)
schirmer@14700
  1359
schirmer@14700
  1360
fun case_names_fields x = RuleCases.case_names ["fields"] x;
wenzelm@18728
  1361
fun induct_type_global name = [case_names_fields, InductAttrib.induct_type name];
wenzelm@18728
  1362
fun cases_type_global name = [case_names_fields, InductAttrib.cases_type name];
schirmer@14700
  1363
schirmer@14700
  1364
(* tactics *)
schirmer@14700
  1365
schirmer@14700
  1366
fun simp_all_tac ss simps = ALLGOALS (Simplifier.asm_full_simp_tac (ss addsimps simps));
schirmer@14700
  1367
wenzelm@17261
  1368
(* do case analysis / induction according to rule on last parameter of ith subgoal
wenzelm@17261
  1369
 * (or on s if there are no parameters);
schirmer@14700
  1370
 * Instatiation of record variable (and predicate) in rule is calculated to
wenzelm@17261
  1371
 * avoid problems with higher order unification.
schirmer@14700
  1372
 *)
schirmer@14700
  1373
schirmer@14700
  1374
fun try_param_tac s rule i st =
schirmer@14700
  1375
  let
wenzelm@17510
  1376
    val cert = cterm_of (Thm.theory_of_thm st);
haftmann@18011
  1377
    val g = nth (prems_of st) (i - 1);
schirmer@14700
  1378
    val params = Logic.strip_params g;
schirmer@14700
  1379
    val concl = HOLogic.dest_Trueprop (Logic.strip_assums_concl g);
wenzelm@18145
  1380
    val rule' = Thm.lift_rule (Thm.cprem_of st i) rule;
schirmer@14700
  1381
    val (P, ys) = strip_comb (HOLogic.dest_Trueprop
schirmer@14700
  1382
      (Logic.strip_assums_concl (prop_of rule')));
schirmer@14700
  1383
    (* ca indicates if rule is a case analysis or induction rule *)
skalberg@15570
  1384
    val (x, ca) = (case rev (Library.drop (length params, ys)) of
schirmer@14700
  1385
        [] => (head_of (fst (HOLogic.dest_eq (HOLogic.dest_Trueprop
schirmer@14700
  1386
          (hd (rev (Logic.strip_assums_hyp (hd (prems_of rule')))))))), true)
schirmer@14700
  1387
      | [x] => (head_of x, false));
schirmer@14700
  1388
    val rule'' = cterm_instantiate (map (pairself cert) (case (rev params) of
haftmann@17377
  1389
        [] => (case AList.lookup (op =) (map dest_Free (term_frees (prop_of st))) s of
skalberg@15531
  1390
          NONE => sys_error "try_param_tac: no such variable"
skalberg@15531
  1391
        | SOME T => [(P, if ca then concl else lambda (Free (s, T)) concl),
schirmer@14700
  1392
            (x, Free (s, T))])
schirmer@14700
  1393
      | (_, T) :: _ => [(P, list_abs (params, if ca then concl
schirmer@14700
  1394
          else incr_boundvars 1 (Abs (s, T, concl)))),
schirmer@14700
  1395
        (x, list_abs (params, Bound 0))])) rule'
schirmer@14700
  1396
  in compose_tac (false, rule'', nprems_of rule) i st end;
schirmer@14700
  1397
schirmer@15215
  1398
schirmer@15215
  1399
(* !!x1 ... xn. ... ==> EX x1 ... xn. P x1 ... xn;
schirmer@15215
  1400
   instantiates x1 ... xn with parameters x1 ... xn *)
schirmer@15215
  1401
fun ex_inst_tac i st =
schirmer@15215
  1402
  let
wenzelm@18858
  1403
    val thy = Thm.theory_of_thm st;
haftmann@18011
  1404
    val g = nth (prems_of st) (i - 1);
schirmer@15215
  1405
    val params = Logic.strip_params g;
wenzelm@18145
  1406
    val exI' = Thm.lift_rule (Thm.cprem_of st i) exI;
schirmer@15215
  1407
    val (_$(_$x)) = Logic.strip_assums_concl (hd (prems_of exI'));
wenzelm@18858
  1408
    val cx = cterm_of thy (fst (strip_comb x));
schirmer@15215
  1409
wenzelm@17261
  1410
  in Seq.single (Library.foldl (fn (st,v) =>
wenzelm@17261
  1411
        Seq.hd
wenzelm@17261
  1412
        (compose_tac (false, cterm_instantiate
wenzelm@18858
  1413
                                [(cx,cterm_of thy (list_abs (params,Bound v)))] exI',1)
schirmer@15215
  1414
                i st)) (st,((length params) - 1) downto 0))
schirmer@15215
  1415
  end;
schirmer@15215
  1416
schirmer@14700
  1417
fun extension_typedef name repT alphas thy =
schirmer@14700
  1418
  let
haftmann@20484
  1419
    fun get_thms thy name =
haftmann@20484
  1420
      let
haftmann@20484
  1421
        val SOME { Abs_induct = abs_induct,
haftmann@20484
  1422
          Abs_inject=abs_inject, Abs_inverse = abs_inverse, ...} = TypedefPackage.get_info thy name;
haftmann@20484
  1423
        val rewrite_rule = Tactic.rewrite_rule [rec_UNIV_I, rec_True_simp];
haftmann@20484
  1424
      in map rewrite_rule [abs_inject, abs_inverse, abs_induct] end;
haftmann@20484
  1425
  in
haftmann@20484
  1426
    thy
haftmann@20484
  1427
    |> TypecopyPackage.add_typecopy (suffix ext_typeN (Sign.base_name name), alphas) repT NONE
haftmann@20484
  1428
    |-> (fn (name, _) => `(fn thy => get_thms thy name))
schirmer@14700
  1429
  end;
schirmer@14700
  1430
wenzelm@17261
  1431
fun mixit convs refls =
schirmer@15215
  1432
  let fun f ((res,lhs,rhs),refl) = ((refl,List.revAppend (lhs,refl::tl rhs))::res,hd rhs::lhs,tl rhs);
skalberg@15570
  1433
  in #1 (Library.foldl f (([],[],convs),refls)) end;
schirmer@15215
  1434
schirmer@21226
  1435
wenzelm@17261
  1436
fun extension_definition full name fields names alphas zeta moreT more vars thy =
wenzelm@17261
  1437
  let
schirmer@14700
  1438
    val base = Sign.base_name;
schirmer@14700
  1439
    val fieldTs = (map snd fields);
schirmer@15215
  1440
    val alphas_zeta = alphas@[zeta];
schirmer@15215
  1441
    val alphas_zetaTs = map (fn n => TFree (n, HOLogic.typeS)) alphas_zeta;
wenzelm@20071
  1442
    val vT = TFree (Name.variant alphas_zeta "'v", HOLogic.typeS);
schirmer@14700
  1443
    val extT_name = suffix ext_typeN name
schirmer@14700
  1444
    val extT = Type (extT_name, alphas_zetaTs);
schirmer@14700
  1445
    val repT = foldr1 HOLogic.mk_prodT (fieldTs@[moreT]);
schirmer@14700
  1446
    val fields_more = fields@[(full moreN,moreT)];
schirmer@15215
  1447
    val fields_moreTs = fieldTs@[moreT];
schirmer@14700
  1448
    val bfields_more = map (apfst base) fields_more;
schirmer@14700
  1449
    val r = Free (rN,extT)
schirmer@14700
  1450
    val len = length fields;
schirmer@14700
  1451
    val idxms = 0 upto len;
schirmer@14700
  1452
schirmer@14700
  1453
    (* prepare declarations and definitions *)
wenzelm@17261
  1454
schirmer@14700
  1455
    (*fields constructor*)
schirmer@15215
  1456
    val ext_decl = (mk_extC (name,extT) fields_moreTs);
wenzelm@17261
  1457
    (*
wenzelm@17261
  1458
    val ext_spec = Const ext_decl :==
wenzelm@17261
  1459
         (foldr (uncurry lambda)
wenzelm@17261
  1460
            (mk_Abs name repT extT $ (foldr1 HOLogic.mk_prod (vars@[more]))) (vars@[more]))
wenzelm@17261
  1461
    *)
wenzelm@17261
  1462
    val ext_spec = list_comb (Const ext_decl,vars@[more]) :==
schirmer@15215
  1463
         (mk_Abs name repT extT $ (foldr1 HOLogic.mk_prod (vars@[more])));
schirmer@15215
  1464
wenzelm@17261
  1465
    fun mk_ext args = list_comb (Const ext_decl, args);
wenzelm@17261
  1466
wenzelm@17261
  1467
    (*destructors*)
schirmer@16379
  1468
    val _ = timing_msg "record extension preparing definitions";
schirmer@14700
  1469
    val dest_decls = map (mk_selC extT o (apfst (suffix ext_dest))) bfields_more;
schirmer@14700
  1470
schirmer@14700
  1471
    fun mk_dest_spec (i, (c,T)) =
schirmer@14700
  1472
      let val snds = (funpow i HOLogic.mk_snd (mk_Rep name repT extT $ r))
schirmer@14700
  1473
      in Const (mk_selC extT (suffix ext_dest c,T))
schirmer@14700
  1474
         :== (lambda r (if i=len then snds else HOLogic.mk_fst snds))
schirmer@14700
  1475
      end;
schirmer@14700
  1476
    val dest_specs =
schirmer@14700
  1477
      ListPair.map mk_dest_spec (idxms, fields_more);
wenzelm@17261
  1478
schirmer@16379
  1479
    (*updates*)
schirmer@15215
  1480
    val upd_decls = map (mk_updC updN extT) bfields_more;
schirmer@15215
  1481
    fun mk_upd_spec (c,T) =
schirmer@15215
  1482
      let
schirmer@21226
  1483
        val args = map (fn (n,nT) => if n=c then Free (base c,T --> T)$
schirmer@21226
  1484
                                                  (mk_sel r (suffix ext_dest n,nT))
wenzelm@17261
  1485
                                     else (mk_sel r (suffix ext_dest n,nT)))
schirmer@15215
  1486
                       fields_more;
schirmer@21226
  1487
      in Const (mk_updC updN extT (c,T))$(Free (base c,T --> T))$r
schirmer@15215
  1488
          :== mk_ext args
schirmer@15215
  1489
      end;
schirmer@15215
  1490
    val upd_specs = map mk_upd_spec fields_more;
wenzelm@17261
  1491
schirmer@14700
  1492
    (* 1st stage: defs_thy *)
schirmer@16379
  1493
    fun mk_defs () =
wenzelm@17261
  1494
      thy
schirmer@14700
  1495
        |> extension_typedef name repT (alphas@[zeta])
haftmann@18377
  1496
        ||> Theory.add_consts_i
schirmer@15215
  1497
              (map Syntax.no_syn ((apfst base ext_decl)::dest_decls@upd_decls))
haftmann@18377
  1498
        ||>> PureThy.add_defs_i false (map Thm.no_attributes (ext_spec::dest_specs))
haftmann@18377
  1499
        ||>> PureThy.add_defs_i false (map Thm.no_attributes upd_specs)
haftmann@18377
  1500
        |> swap
schirmer@16379
  1501
    val (defs_thy, (([abs_inject, abs_inverse, abs_induct],ext_def::dest_defs),upd_defs)) =
schirmer@16379
  1502
        timeit_msg "record extension type/selector/update defs:" mk_defs;
wenzelm@17261
  1503
wenzelm@17261
  1504
schirmer@14700
  1505
    (* prepare propositions *)
schirmer@16379
  1506
    val _ = timing_msg "record extension preparing propositions";
schirmer@14700
  1507
    val vars_more = vars@[more];
schirmer@14700
  1508
    val named_vars_more = (names@[full moreN])~~vars_more;
schirmer@15015
  1509
    val variants = map (fn (Free (x,_))=>x) vars_more;
schirmer@15215
  1510
    val ext = mk_ext vars_more;
schirmer@14700
  1511
    val s     = Free (rN, extT);
schirmer@15215
  1512
    val w     = Free (wN, extT);
wenzelm@20071
  1513
    val P = Free (Name.variant variants "P", extT-->HOLogic.boolT);
wenzelm@20071
  1514
    val C = Free (Name.variant variants "C", HOLogic.boolT);
wenzelm@17261
  1515
schirmer@14700
  1516
    val inject_prop =
schirmer@14700
  1517
      let val vars_more' = map (fn (Free (x,T)) => Free (x ^ "'",T)) vars_more;
wenzelm@17261
  1518
      in All (map dest_Free (vars_more@vars_more'))
wenzelm@17261
  1519
          ((HOLogic.eq_const extT $
wenzelm@17261
  1520
            mk_ext vars_more$mk_ext vars_more')
schirmer@14700
  1521
           ===
schirmer@14700
  1522
           foldr1 HOLogic.mk_conj (map HOLogic.mk_eq (vars_more ~~ vars_more')))
schirmer@14700
  1523
      end;
wenzelm@17261
  1524
schirmer@14700
  1525
    val induct_prop =
schirmer@15012
  1526
      (All (map dest_Free vars_more) (Trueprop (P $ ext)), Trueprop (P $ s));
schirmer@15012
  1527
schirmer@14700
  1528
    val cases_prop =
wenzelm@17261
  1529
      (All (map dest_Free vars_more)
wenzelm@17261
  1530
        (Trueprop (HOLogic.mk_eq (s,ext)) ==> Trueprop C))
schirmer@14700
  1531
      ==> Trueprop C;
schirmer@14700
  1532
wenzelm@17261
  1533
    (*destructors*)
schirmer@14700
  1534
    val dest_conv_props =
schirmer@14700
  1535
       map (fn (c, x as Free (_,T)) => mk_sel ext (suffix ext_dest c,T) === x) named_vars_more;
schirmer@14700
  1536
schirmer@15215
  1537
    (*updates*)
schirmer@15215
  1538
    fun mk_upd_prop (i,(c,T)) =
schirmer@21226
  1539
      let val x' = Free (Name.variant variants (base c ^ "'"),T --> T)
schirmer@21226
  1540
          val args' = nth_map i  (K (x'$nth vars_more i)) vars_more
schirmer@15215
  1541
      in mk_upd updN c x' ext === mk_ext args'  end;
schirmer@15215
  1542
    val upd_conv_props = ListPair.map mk_upd_prop (idxms, fields_more);
schirmer@15215
  1543
schirmer@15015
  1544
    val surjective_prop =
wenzelm@17261
  1545
      let val args =
schirmer@15015
  1546
           map (fn (c, Free (_,T)) => mk_sel s (suffix ext_dest c,T)) named_vars_more;
schirmer@15215
  1547
      in s === mk_ext args end;
schirmer@15015
  1548
schirmer@15015
  1549
    val split_meta_prop =
wenzelm@20071
  1550
      let val P = Free (Name.variant variants "P", extT-->Term.propT) in
wenzelm@17261
  1551
        Logic.mk_equals
schirmer@15015
  1552
         (All [dest_Free s] (P $ s), All (map dest_Free vars_more) (P $ ext))
wenzelm@17261
  1553
      end;
schirmer@15015
  1554
wenzelm@17510
  1555
    fun prove stndrd = quick_and_dirty_prove stndrd defs_thy;
wenzelm@17510
  1556
    val prove_standard = quick_and_dirty_prove true defs_thy;
schirmer@15215
  1557
    fun prove_simp stndrd simps =
schirmer@14700
  1558
      let val tac = simp_all_tac HOL_ss simps
schirmer@15215
  1559
      in fn prop => prove stndrd [] prop (K tac) end;
wenzelm@17261
  1560
schirmer@15215
  1561
    fun inject_prf () = (prove_simp true [ext_def,abs_inject,Pair_eq] inject_prop);
schirmer@15012
  1562
    val inject = timeit_msg "record extension inject proof:" inject_prf;
schirmer@14700
  1563
schirmer@15012
  1564
    fun induct_prf () =
schirmer@15012
  1565
      let val (assm, concl) = induct_prop
wenzelm@20248
  1566
      in prove_standard [assm] concl (fn {prems, ...} =>
wenzelm@17261
  1567
           EVERY [try_param_tac rN abs_induct 1,
schirmer@15012
  1568
                  simp_tac (HOL_ss addsimps [split_paired_all]) 1,
schirmer@15012
  1569
                  resolve_tac (map (rewrite_rule [ext_def]) prems) 1])
schirmer@15012
  1570
      end;
schirmer@15012
  1571
    val induct = timeit_msg "record extension induct proof:" induct_prf;
schirmer@14700
  1572
schirmer@15215
  1573
    fun cases_prf_opt () =
wenzelm@17261
  1574
      let
schirmer@15215
  1575
        val (_$(Pvar$_)) = concl_of induct;
wenzelm@17261
  1576
        val ind = cterm_instantiate
wenzelm@18858
  1577
                    [(cterm_of defs_thy Pvar, cterm_of defs_thy
schirmer@15215
  1578
                            (lambda w (HOLogic.imp$HOLogic.mk_eq(r,w)$C)))]
schirmer@15215
  1579
                    induct;
schirmer@15215
  1580
        in standard (ObjectLogic.rulify (mp OF [ind, refl])) end;
schirmer@15215
  1581
schirmer@15215
  1582
    fun cases_prf_noopt () =
schirmer@15015
  1583
        prove_standard [] cases_prop (fn prems =>
schirmer@14700
  1584
         EVERY [asm_full_simp_tac (HOL_basic_ss addsimps [atomize_all, atomize_imp]) 1,
schirmer@14700
  1585
                try_param_tac rN induct 1,
schirmer@14700
  1586
                rtac impI 1,
schirmer@14700
  1587
                REPEAT (etac allE 1),
schirmer@14700
  1588
                etac mp 1,
schirmer@14700
  1589
                rtac refl 1])
schirmer@15215
  1590
schirmer@15215
  1591
    val cases_prf = quick_and_dirty_prf cases_prf_noopt cases_prf_opt;
schirmer@15012
  1592
    val cases = timeit_msg "record extension cases proof:" cases_prf;
wenzelm@17261
  1593
wenzelm@17261
  1594
    fun dest_convs_prf () = map (prove_simp false
schirmer@15215
  1595
                      ([ext_def,abs_inverse]@Pair_sel_convs@dest_defs)) dest_conv_props;
schirmer@15012
  1596
    val dest_convs = timeit_msg "record extension dest_convs proof:" dest_convs_prf;
schirmer@15215
  1597
    fun dest_convs_standard_prf () = map standard dest_convs;
schirmer@15215
  1598
wenzelm@17261
  1599
    val dest_convs_standard =
wenzelm@17261
  1600
        timeit_msg "record extension dest_convs_standard proof:" dest_convs_standard_prf;
wenzelm@17261
  1601
wenzelm@17261
  1602
    fun upd_convs_prf_noopt () = map (prove_simp true (dest_convs_standard@upd_defs))
schirmer@15215
  1603
                                       upd_conv_props;
schirmer@15215
  1604
    fun upd_convs_prf_opt () =
wenzelm@17261
  1605
      let
schirmer@21226
  1606
wenzelm@17261
  1607
        fun mkrefl (c,T) = Thm.reflexive
schirmer@21226
  1608
                    (cterm_of defs_thy (Free (Name.variant variants (base c ^ "'"),T-->T)));
schirmer@15215
  1609
        val refls = map mkrefl fields_more;
schirmer@21226
  1610
        val dest_convs' = map mk_meta_eq dest_convs;
schirmer@21226
  1611
        val map_eqs = map (uncurry Thm.combination) (refls ~~ dest_convs');
schirmer@21226
  1612
        
wenzelm@18858
  1613
        val constr_refl = Thm.reflexive (cterm_of defs_thy (head_of ext));
wenzelm@17261
  1614
schirmer@15215
  1615
        fun mkthm (udef,(fld_refl,thms)) =
skalberg@15570
  1616
          let val bdyeq = Library.foldl (uncurry Thm.combination) (constr_refl,thms);
schirmer@15215
  1617
               (* (|N=N (|N=N,M=M,K=K,more=more|)
schirmer@15215
  1618
                    M=M (|N=N,M=M,K=K,more=more|)
schirmer@15215
  1619
                    K=K'
schirmer@15215
  1620
                    more = more (|N=N,M=M,K=K,more=more|) =
schirmer@15215
  1621
                  (|N=N,M=M,K=K',more=more|)
schirmer@15215
  1622
                *)
schirmer@15215
  1623
              val (_$(_$v$r)$_) = prop_of udef;
schirmer@21226
  1624
              val (_$(v'$_)$_) = prop_of fld_refl;
wenzelm@17261
  1625
              val udef' = cterm_instantiate
wenzelm@18858
  1626
                            [(cterm_of defs_thy v,cterm_of defs_thy v'),
wenzelm@18858
  1627
                             (cterm_of defs_thy r,cterm_of defs_thy ext)] udef;
wenzelm@17261
  1628
          in  standard (Thm.transitive udef' bdyeq) end;
schirmer@21226
  1629
      in map mkthm (rev upd_defs  ~~ (mixit dest_convs' map_eqs)) end;
wenzelm@17261
  1630
schirmer@15215
  1631
    val upd_convs_prf = quick_and_dirty_prf upd_convs_prf_noopt upd_convs_prf_opt;
schirmer@15215
  1632
wenzelm@17261
  1633
    val upd_convs =
wenzelm@17261
  1634
         timeit_msg "record extension upd_convs proof:" upd_convs_prf;
schirmer@15012
  1635
wenzelm@17261
  1636
    fun surjective_prf () =
schirmer@15015
  1637
      prove_standard [] surjective_prop (fn prems =>
schirmer@15015
  1638
          (EVERY [try_param_tac rN induct 1,
schirmer@15215
  1639
                  simp_tac (HOL_basic_ss addsimps dest_convs_standard) 1]));
schirmer@15015
  1640
    val surjective = timeit_msg "record extension surjective proof:" surjective_prf;
schirmer@15015
  1641
schirmer@15015
  1642
    fun split_meta_prf () =
schirmer@15015
  1643
        prove_standard [] split_meta_prop (fn prems =>
wenzelm@17960
  1644
         EVERY [rtac equal_intr_rule 1, norm_hhf_tac 1,
wenzelm@17960
  1645
                etac meta_allE 1, atac 1,
schirmer@15015
  1646
                rtac (prop_subst OF [surjective]) 1,
wenzelm@17960
  1647
                REPEAT (etac meta_allE 1), atac 1]);
schirmer@15015
  1648
    val split_meta = timeit_msg "record extension split_meta proof:" split_meta_prf;
schirmer@15015
  1649
schirmer@21226
  1650
schirmer@21226
  1651
    val (([inject',induct',cases',surjective',split_meta'], 
schirmer@21226
  1652
          [dest_convs',upd_convs']),
haftmann@18377
  1653
      thm_thy) =
wenzelm@17261
  1654
      defs_thy
wenzelm@17261
  1655
      |> (PureThy.add_thms o map Thm.no_attributes)
schirmer@14700
  1656
           [("ext_inject", inject),
schirmer@14700
  1657
            ("ext_induct", induct),
schirmer@15015
  1658
            ("ext_cases", cases),
schirmer@15015
  1659
            ("ext_surjective", surjective),
schirmer@15015
  1660
            ("ext_split", split_meta)]
haftmann@18377
  1661
      ||>> (PureThy.add_thmss o map Thm.no_attributes)
wenzelm@17261
  1662
              [("dest_convs",dest_convs_standard),("upd_convs",upd_convs)]
schirmer@14700
  1663
schirmer@15215
  1664
  in (thm_thy,extT,induct',inject',dest_convs',split_meta',upd_convs')
schirmer@14700
  1665
  end;
wenzelm@17261
  1666
schirmer@14700
  1667
fun chunks []      []   = []
schirmer@14700
  1668
  | chunks []      xs   = [xs]
skalberg@15570
  1669
  | chunks (l::ls) xs  = Library.take (l,xs)::chunks ls (Library.drop (l,xs));
wenzelm@17261
  1670
schirmer@14700
  1671
fun chop_last [] = error "last: list should not be empty"
schirmer@14700
  1672
  | chop_last [x] = ([],x)
schirmer@14700
  1673
  | chop_last (x::xs) = let val (tl,l) = chop_last xs in (x::tl,l) end;
wenzelm@17261
  1674
schirmer@14700
  1675
fun subst_last s []      = error "subst_last: list should not be empty"
schirmer@14700
  1676
  | subst_last s ([x])   = [s]
schirmer@14700
  1677
  | subst_last s (x::xs) = (x::subst_last s xs);
schirmer@14700
  1678
schirmer@14700
  1679
(* mk_recordT builds up the record type from the current extension tpye extT and a list
wenzelm@17261
  1680
 * of parent extensions, starting with the root of the record hierarchy
wenzelm@17261
  1681
*)
haftmann@21078
  1682
fun mk_recordT extT =
haftmann@21078
  1683
    fold_rev (fn (parent, Ts) => fn T => Type (parent, subst_last T Ts)) extT;
schirmer@14700
  1684
schirmer@15215
  1685
schirmer@15215
  1686
schirmer@15215
  1687
fun obj_to_meta_all thm =
schirmer@15215
  1688
  let
wenzelm@17261
  1689
    fun E thm = case (SOME (spec OF [thm]) handle THM _ => NONE) of
skalberg@15531
  1690
                  SOME thm' => E thm'
skalberg@15531
  1691
                | NONE => thm;
schirmer@15215
  1692
    val th1 = E thm;
schirmer@15215
  1693
    val th2 = Drule.forall_intr_vars th1;
schirmer@15215
  1694
  in th2 end;
schirmer@15215
  1695
schirmer@15215
  1696
fun meta_to_obj_all thm =
schirmer@15215
  1697
  let
schirmer@15215
  1698
    val {sign, prop, ...} = rep_thm thm;
schirmer@15215
  1699
    val params = Logic.strip_params prop;
schirmer@15215
  1700
    val concl = HOLogic.dest_Trueprop (Logic.strip_assums_concl prop);
schirmer@15215
  1701
    val ct = cterm_of sign
schirmer@15215
  1702
      (HOLogic.mk_Trueprop (HOLogic.list_all (params, concl)));
schirmer@15215
  1703
    val thm' = Seq.hd (REPEAT (rtac allI 1) (Thm.trivial ct));
schirmer@15215
  1704
  in
schirmer@15215
  1705
    Thm.implies_elim thm' thm
schirmer@15215
  1706
  end;
schirmer@15215
  1707
schirmer@15215
  1708
schirmer@15215
  1709
schirmer@14700
  1710
(* record_definition *)
wenzelm@17261
  1711
fun record_definition (args, bname) parent (parents: parent_info list) raw_fields thy =
schirmer@14702
  1712
  (* smlnj needs type annotation of parents *)
schirmer@14700
  1713
  let
schirmer@14700
  1714
    val sign = Theory.sign_of thy;
schirmer@14700
  1715
schirmer@14700
  1716
    val alphas = map fst args;
schirmer@14700
  1717
    val name = Sign.full_name sign bname;
schirmer@14700
  1718
    val full = Sign.full_name_path sign bname;
schirmer@14700
  1719
    val base = Sign.base_name;
schirmer@14700
  1720
schirmer@14700
  1721
    val (bfields, field_syntax) = split_list (map (fn (x, T, mx) => ((x, T), mx)) raw_fields);
schirmer@14700
  1722
skalberg@15570
  1723
    val parent_fields = List.concat (map #fields parents);
schirmer@14700
  1724
    val parent_chunks = map (length o #fields) parents;
schirmer@14700
  1725
    val parent_names = map fst parent_fields;
schirmer@14700
  1726
    val parent_types = map snd parent_fields;
schirmer@14700
  1727
    val parent_fields_len = length parent_fields;
wenzelm@20071
  1728
    val parent_variants = Name.variant_list [moreN, rN, rN ^ "'", wN] (map base parent_names);
schirmer@14700
  1729
    val parent_vars = ListPair.map Free (parent_variants, parent_types);
schirmer@14700
  1730
    val parent_len = length parents;
schirmer@14700
  1731
    val parents_idx = (map #name parents) ~~ (0 upto (parent_len - 1));
schirmer@14700
  1732
schirmer@14700
  1733
    val fields = map (apfst full) bfields;
schirmer@14700
  1734
    val names = map fst fields;
schirmer@14700
  1735
    val extN = full bname;
schirmer@14700
  1736
    val types = map snd fields;
skalberg@15574
  1737
    val alphas_fields = foldr add_typ_tfree_names [] types;
wenzelm@17261
  1738
    val alphas_ext = alphas inter alphas_fields;
schirmer@14700
  1739
    val len = length fields;
wenzelm@20071
  1740
    val variants = Name.variant_list (moreN::rN::rN ^ "'"::wN::parent_variants) (map fst bfields);
schirmer@14700
  1741
    val vars = ListPair.map Free (variants, types);
schirmer@14700
  1742
    val named_vars = names ~~ vars;
schirmer@14700
  1743
    val idxs = 0 upto (len - 1);
schirmer@14700
  1744
    val idxms = 0 upto len;
schirmer@14700
  1745
schirmer@14700
  1746
    val all_fields = parent_fields @ fields;
schirmer@14700
  1747
    val all_names = parent_names @ names;
schirmer@14700
  1748
    val all_types = parent_types @ types;
schirmer@14700
  1749
    val all_len = parent_fields_len + len;
schirmer@14700
  1750
    val all_variants = parent_variants @ variants;
schirmer@14700
  1751
    val all_vars = parent_vars @ vars;
schirmer@14700
  1752
    val all_named_vars = (parent_names ~~ parent_vars) @ named_vars;
schirmer@14700
  1753
schirmer@14700
  1754
wenzelm@20071
  1755
    val zeta = Name.variant alphas "'z";
schirmer@14700
  1756
    val moreT = TFree (zeta, HOLogic.typeS);
schirmer@14700
  1757
    val more = Free (moreN, moreT);
schirmer@14700
  1758
    val full_moreN = full moreN;
schirmer@14700
  1759
    val bfields_more = bfields @ [(moreN,moreT)];
schirmer@14700
  1760
    val fields_more = fields @ [(full_moreN,moreT)];
schirmer@14700
  1761
    val vars_more = vars @ [more];
schirmer@14700
  1762
    val named_vars_more = named_vars @[(full_moreN,more)];
schirmer@14700
  1763
    val all_vars_more = all_vars @ [more];
schirmer@14700
  1764
    val all_named_vars_more = all_named_vars @ [(full_moreN,more)];
wenzelm@17261
  1765
schirmer@14700
  1766
    (* 1st stage: extension_thy *)
schirmer@15215
  1767
    val (extension_thy,extT,ext_induct,ext_inject,ext_dest_convs,ext_split,u_convs) =
schirmer@14700
  1768
      thy
schirmer@14700
  1769
      |> Theory.add_path bname
schirmer@14700
  1770
      |> extension_definition full extN fields names alphas_ext zeta moreT more vars;
schirmer@14700
  1771
wenzelm@17261
  1772
    val _ = timing_msg "record preparing definitions";
schirmer@14700
  1773
    val Type extension_scheme = extT;
schirmer@14700
  1774
    val extension_name = unsuffix ext_typeN (fst extension_scheme);
wenzelm@17261
  1775
    val extension = let val (n,Ts) = extension_scheme in (n,subst_last HOLogic.unitT Ts) end;
wenzelm@17261
  1776
    val extension_names =
schirmer@14700
  1777
         (map ((unsuffix ext_typeN) o fst o #extension) parents) @ [extN];
skalberg@15570
  1778
    val extension_id = Library.foldl (op ^) ("",extension_names);
schirmer@14700
  1779
wenzelm@17261
  1780
haftmann@21078
  1781
    fun rec_schemeT n = mk_recordT (map #extension (prune n parents)) extT;
schirmer@14700
  1782
    val rec_schemeT0 = rec_schemeT 0;
schirmer@14700
  1783
wenzelm@17261
  1784
    fun recT n =
schirmer@14700
  1785
      let val (c,Ts) = extension
haftmann@21078
  1786
      in mk_recordT (map #extension (prune n parents)) (Type (c,subst_last HOLogic.unitT Ts))
schirmer@14700
  1787
      end;
schirmer@14700
  1788
    val recT0 = recT 0;
wenzelm@17261
  1789
schirmer@14700
  1790
    fun mk_rec args n =
schirmer@14700
  1791
      let val (args',more) = chop_last args;
wenzelm@17261
  1792
          fun mk_ext' (((name,T),args),more) = mk_ext (name,T) (args@[more]);
wenzelm@17261
  1793
          fun build Ts =
skalberg@15574
  1794
           foldr mk_ext' more (prune n (extension_names ~~ Ts ~~ (chunks parent_chunks args')))
wenzelm@17261
  1795
      in
wenzelm@17261
  1796
        if more = HOLogic.unit
wenzelm@17261
  1797
        then build (map recT (0 upto parent_len))
schirmer@14700
  1798
        else build (map rec_schemeT (0 upto parent_len))
schirmer@14700
  1799
      end;
wenzelm@17261
  1800
schirmer@14700
  1801
    val r_rec0 = mk_rec all_vars_more 0;
schirmer@14700
  1802
    val r_rec_unit0 = mk_rec (all_vars@[HOLogic.unit]) 0;
schirmer@14700
  1803
schirmer@14700
  1804
    fun r n = Free (rN, rec_schemeT n)
schirmer@14700
  1805
    val r0 = r 0;
schirmer@14700
  1806
    fun r_unit n = Free (rN, recT n)
schirmer@14700
  1807
    val r_unit0 = r_unit 0;
schirmer@15215
  1808
    val w = Free (wN, rec_schemeT 0)
schirmer@14700
  1809
schirmer@14700
  1810
    (* prepare print translation functions *)
schirmer@14700
  1811
    val field_tr's =
wenzelm@19046
  1812
      print_translation (distinct (op =)
wenzelm@19046
  1813
        (List.concat (map NameSpace.accesses' (full_moreN :: names))));
schirmer@14700
  1814
schirmer@14700
  1815
    val adv_ext_tr's =
schirmer@14700
  1816
    let
schirmer@14700
  1817
      val trnames = NameSpace.accesses' extN;
schirmer@14700
  1818
    in map (gen_record_tr') trnames end;
schirmer@14700
  1819
schirmer@14700
  1820
    val adv_record_type_abbr_tr's =
schirmer@14700
  1821
      let val trnames = NameSpace.accesses' (hd extension_names);
schirmer@14700
  1822
          val lastExt = (unsuffix ext_typeN (fst extension));
schirmer@17190
  1823
      in map (gen_record_type_abbr_tr' name alphas zeta lastExt rec_schemeT0) trnames
schirmer@14700
  1824
      end;
schirmer@14700
  1825
schirmer@14700
  1826
    val adv_record_type_tr's =
schirmer@14700
  1827
      let val trnames = if parent_len > 0 then NameSpace.accesses' extN else [];
schirmer@14700
  1828
                        (* avoid conflict with adv_record_type_abbr_tr's *)
schirmer@14700
  1829
      in map (gen_record_type_tr') trnames
schirmer@14700
  1830
      end;
schirmer@14700
  1831
wenzelm@17261
  1832
schirmer@14700
  1833
    (* prepare declarations *)
schirmer@14700
  1834
schirmer@14700
  1835
    val sel_decls = map (mk_selC rec_schemeT0) bfields_more;
schirmer@15215
  1836
    val upd_decls = map (mk_updC updateN rec_schemeT0) bfields_more;
schirmer@14700
  1837
    val make_decl = (makeN, all_types ---> recT0);
wenzelm@17261
  1838
    val fields_decl = (fields_selN, types ---> Type extension);
schirmer@14700
  1839
    val extend_decl = (extendN, recT0 --> moreT --> rec_schemeT0);
schirmer@14700
  1840
    val truncate_decl = (truncateN, rec_schemeT0 --> recT0);
schirmer@14700
  1841
schirmer@14700
  1842
    (* prepare definitions *)
wenzelm@17261
  1843
wenzelm@17261
  1844
    fun parent_more s =
wenzelm@17261
  1845
         if null parents then s
wenzelm@16124
  1846
         else mk_sel s (NameSpace.qualified (#name (List.last parents)) moreN, extT);
schirmer@14700
  1847
schirmer@14700
  1848
    fun parent_more_upd v s =
schirmer@21226
  1849
      if null parents then v$s
wenzelm@16124
  1850
      else let val mp = NameSpace.qualified (#name (List.last parents)) moreN;
schirmer@15215
  1851
           in mk_upd updateN mp v s end;
wenzelm@17261
  1852
schirmer@14700
  1853
    (*record (scheme) type abbreviation*)
schirmer@14700
  1854
    val recordT_specs =
schirmer@14700
  1855
      [(suffix schemeN bname, alphas @ [zeta], rec_schemeT0, Syntax.NoSyn),
wenzelm@17261
  1856
        (bname, alphas, recT0, Syntax.NoSyn)];
schirmer@14700
  1857
wenzelm@17261
  1858
    (*selectors*)
wenzelm@17261
  1859
    fun mk_sel_spec (c,T) =
wenzelm@17261
  1860
         Const (mk_selC rec_schemeT0 (c,T))
schirmer@14700
  1861
          :== (lambda r0 (Const (mk_selC extT (suffix ext_dest c,T))$parent_more r0));
schirmer@14700
  1862
    val sel_specs = map mk_sel_spec fields_more;
schirmer@14700
  1863
schirmer@14700
  1864
    (*updates*)
schirmer@15215
  1865
schirmer@14700
  1866
    fun mk_upd_spec (c,T) =
wenzelm@17261
  1867
      let
schirmer@21226
  1868
        val new = mk_upd' updN c (Free (base c,T-->T)) extT(*(parent_more r0)*);
schirmer@21226
  1869
      in Const (mk_updC updateN rec_schemeT0 (c,T))$(Free (base c,T-->T))$r0
schirmer@15215
  1870
          :== (parent_more_upd new r0)
schirmer@14700
  1871
      end;
wenzelm@17261
  1872
    val upd_specs = map mk_upd_spec fields_more;
schirmer@14700
  1873
schirmer@14700
  1874
    (*derived operations*)
schirmer@14700
  1875
    val make_spec = Const (full makeN, all_types ---> recT0) $$ all_vars :==
schirmer@14700
  1876
      mk_rec (all_vars @ [HOLogic.unit]) 0;
schirmer@14700
  1877
    val fields_spec = Const (full fields_selN, types ---> Type extension) $$ vars :==
schirmer@14700
  1878
      mk_rec (all_vars @ [HOLogic.unit]) parent_len;
wenzelm@17261
  1879
    val extend_spec =
schirmer@14700
  1880
      Const (full extendN, recT0-->moreT-->rec_schemeT0) $ r_unit0 $ more :==
schirmer@14700
  1881
      mk_rec ((map (mk_sel r_unit0) all_fields) @ [more]) 0;
schirmer@14700
  1882
    val truncate_spec = Const (full truncateN, rec_schemeT0 --> recT0) $ r0 :==
schirmer@14700
  1883
      mk_rec ((map (mk_sel r0) all_fields) @ [HOLogic.unit]) 0;
schirmer@14700
  1884
schirmer@14700
  1885
    (* 2st stage: defs_thy *)
wenzelm@17261
  1886
schirmer@16379
  1887
    fun mk_defs () =
schirmer@16379
  1888
      extension_thy
wenzelm@17261
  1889
        |> Theory.add_trfuns
schirmer@14700
  1890
            ([],[],field_tr's, [])
wenzelm@17261
  1891
        |> Theory.add_advanced_trfuns
schirmer@14700
  1892
            ([],[],adv_ext_tr's @ adv_record_type_tr's @ adv_record_type_abbr_tr's,[])
schirmer@14700
  1893
        |> Theory.parent_path
schirmer@14700
  1894
        |> Theory.add_tyabbrs_i recordT_specs
schirmer@14700
  1895
        |> Theory.add_path bname
schirmer@14700
  1896
        |> Theory.add_consts_i
haftmann@18330
  1897
            (map2 (fn (x, T) => fn mx => (x, T, mx)) sel_decls (field_syntax @ [Syntax.NoSyn]))
wenzelm@17261
  1898
        |> (Theory.add_consts_i o map Syntax.no_syn)
schirmer@14700
  1899
            (upd_decls @ [make_decl, fields_decl, extend_decl, truncate_decl])
haftmann@18377
  1900
        |> ((PureThy.add_defs_i false o map Thm.no_attributes) sel_specs)
haftmann@18377
  1901
        ||>> ((PureThy.add_defs_i false o map Thm.no_attributes) upd_specs)
haftmann@18377
  1902
        ||>> ((PureThy.add_defs_i false o map Thm.no_attributes)
haftmann@18377
  1903
               [make_spec, fields_spec, extend_spec, truncate_spec])
haftmann@18377
  1904
        |> swap
schirmer@16379
  1905
    val (defs_thy,((sel_defs,upd_defs),derived_defs)) =
schirmer@16379
  1906
        timeit_msg "record trfuns/tyabbrs/selectors/updates/make/fields/extend/truncate defs:"
schirmer@16379
  1907
         mk_defs;
wenzelm@17261
  1908
schirmer@14700
  1909
schirmer@14700
  1910
    (* prepare propositions *)
wenzelm@17261
  1911
    val _ = timing_msg "record preparing propositions";
wenzelm@20071
  1912
    val P = Free (Name.variant all_variants "P", rec_schemeT0-->HOLogic.boolT);
wenzelm@20071
  1913
    val C = Free (Name.variant all_variants "C", HOLogic.boolT);
wenzelm@20071
  1914
    val P_unit = Free (Name.variant all_variants "P", recT0-->HOLogic.boolT);
schirmer@14700
  1915
wenzelm@17261
  1916
    (*selectors*)
schirmer@14700
  1917
    val sel_conv_props =
schirmer@14700
  1918
       map (fn (c, x as Free (_,T)) => mk_sel r_rec0 (c,T) === x) named_vars_more;
schirmer@14700
  1919
wenzelm@17261
  1920
    (*updates*)
schirmer@14700
  1921
    fun mk_upd_prop (i,(c,T)) =
schirmer@21226
  1922
      let val x' = Free (Name.variant all_variants (base c ^ "'"),T-->T);
schirmer@21226
  1923
          val n = parent_fields_len + i;
schirmer@21226
  1924
          val args' = nth_map n (K (x'$nth all_vars_more n)) all_vars_more
schirmer@15215
  1925
      in mk_upd updateN c x' r_rec0 === mk_rec args' 0  end;
schirmer@14700
  1926
    val upd_conv_props = ListPair.map mk_upd_prop (idxms, fields_more);
schirmer@14700
  1927
schirmer@14700
  1928
    (*induct*)
schirmer@14700
  1929
    val induct_scheme_prop =
schirmer@14700
  1930
      All (map dest_Free all_vars_more) (Trueprop (P $ r_rec0)) ==> Trueprop (P $ r0);
wenzelm@17261
  1931
    val induct_prop =
schirmer@14700
  1932
      (All (map dest_Free all_vars) (Trueprop (P_unit $ r_rec_unit0)),
schirmer@14700
  1933
       Trueprop (P_unit $ r_unit0));
schirmer@14700
  1934
schirmer@14700
  1935
    (*surjective*)
schirmer@14700
  1936
    val surjective_prop =
schirmer@14700
  1937
      let val args = map (fn (c,Free (_,T)) => mk_sel r0 (c,T)) all_named_vars_more
schirmer@14700
  1938
      in r0 === mk_rec args 0 end;
wenzelm@17261
  1939
schirmer@14700
  1940
    (*cases*)
schirmer@14700
  1941
    val cases_scheme_prop =
wenzelm@17261
  1942
      (All (map dest_Free all_vars_more)
wenzelm@17261
  1943
        (Trueprop (HOLogic.mk_eq (r0,r_rec0)) ==> Trueprop C))
schirmer@14700
  1944
      ==> Trueprop C;
schirmer@14700
  1945
schirmer@14700
  1946
    val cases_prop =
wenzelm@17261
  1947
      (All (map dest_Free all_vars)
wenzelm@17261
  1948
        (Trueprop (HOLogic.mk_eq (r_unit0,r_rec_unit0)) ==> Trueprop C))
schirmer@14700
  1949
       ==> Trueprop C;
schirmer@14700
  1950
schirmer@14700
  1951
    (*split*)
schirmer@14700
  1952
    val split_meta_prop =
wenzelm@20071
  1953
      let val P = Free (Name.variant all_variants "P", rec_schemeT0-->Term.propT) in
wenzelm@17261
  1954
        Logic.mk_equals
schirmer@14700
  1955
         (All [dest_Free r0] (P $ r0), All (map dest_Free all_vars_more) (P $ r_rec0))
wenzelm@17261
  1956
      end;
schirmer@14700
  1957
schirmer@14700
  1958
    val split_object_prop =
skalberg@15574
  1959
      let fun ALL vs t = foldr (fn ((v,T),t) => HOLogic.mk_all (v,T,t)) t vs
schirmer@14700
  1960
      in (ALL [dest_Free r0] (P $ r0)) === (ALL (map dest_Free all_vars_more) (P $ r_rec0))
schirmer@14700
  1961
      end;
schirmer@14700
  1962
schirmer@14700
  1963
schirmer@14700
  1964
    val split_ex_prop =
skalberg@15574
  1965
      let fun EX vs t = foldr (fn ((v,T),t) => HOLogic.mk_exists (v,T,t)) t vs
schirmer@14700
  1966
      in (EX [dest_Free r0] (P $ r0)) === (EX (map dest_Free all_vars_more) (P $ r_rec0))
schirmer@14700
  1967
      end;
schirmer@14700
  1968
schirmer@14700
  1969
    (*equality*)
schirmer@14700
  1970
    val equality_prop =
wenzelm@17261
  1971
      let
wenzelm@17261
  1972
        val s' = Free (rN ^ "'", rec_schemeT0)
wenzelm@17261
  1973
        fun mk_sel_eq (c,Free (_,T)) =  mk_sel r0 (c,T) === mk_sel s' (c,T)
schirmer@14700
  1974
        val seleqs = map mk_sel_eq all_named_vars_more
schirmer@14700
  1975
      in All (map dest_Free [r0,s']) (Logic.list_implies (seleqs,r0 === s')) end;
schirmer@14700
  1976
schirmer@14700
  1977
    (* 3rd stage: thms_thy *)
schirmer@14700
  1978
wenzelm@17510
  1979
    fun prove stndrd = quick_and_dirty_prove stndrd defs_thy;
wenzelm@17510
  1980
    val prove_standard = quick_and_dirty_prove true defs_thy;
wenzelm@17261
  1981
schirmer@15215
  1982
    fun prove_simp stndrd ss simps =
schirmer@14700
  1983
      let val tac = simp_all_tac ss simps
schirmer@15215
  1984
      in fn prop => prove stndrd [] prop (K tac) end;
schirmer@14700
  1985
wenzelm@17510
  1986
    val ss = get_simpset defs_thy;
schirmer@15012
  1987
wenzelm@17261
  1988
    fun sel_convs_prf () = map (prove_simp false ss
schirmer@14700
  1989
                           (sel_defs@ext_dest_convs)) sel_conv_props;
schirmer@15012
  1990
    val sel_convs = timeit_msg "record sel_convs proof:" sel_convs_prf;
schirmer@15215
  1991
    fun sel_convs_standard_prf () = map standard sel_convs
wenzelm@17261
  1992
    val sel_convs_standard =
wenzelm@17261
  1993
          timeit_msg "record sel_convs_standard proof:" sel_convs_standard_prf;
schirmer@14700
  1994
wenzelm@17261
  1995
    fun upd_convs_prf () =
wenzelm@17261
  1996
          map (prove_simp true ss (upd_defs@u_convs)) upd_conv_props;
wenzelm@17261
  1997
schirmer@15012
  1998
    val upd_convs = timeit_msg "record upd_convs proof:" upd_convs_prf;
schirmer@15012
  1999
schirmer@14700
  2000
    val parent_induct = if null parents then [] else [#induct (hd (rev parents))];
schirmer@14700
  2001
schirmer@15015
  2002
    fun induct_scheme_prf () = prove_standard [] induct_scheme_prop (fn prems =>
wenzelm@17261
  2003
          (EVERY [if null parent_induct
schirmer@14700
  2004
                  then all_tac else try_param_tac rN (hd parent_induct) 1,
schirmer@14700
  2005
                  try_param_tac rN ext_induct 1,
schirmer@14700
  2006
                  asm_simp_tac HOL_basic_ss 1]));
schirmer@15012
  2007
    val induct_scheme = timeit_msg "record induct_scheme proof:" induct_scheme_prf;
schirmer@14700
  2008
schirmer@15012
  2009
    fun induct_prf () =
schirmer@14700
  2010
      let val (assm, concl) = induct_prop;
schirmer@14700
  2011
      in
wenzelm@20248
  2012
        prove_standard [assm] concl (fn {prems, ...} =>
schirmer@14700
  2013
          try_param_tac rN induct_scheme 1
schirmer@14700
  2014
          THEN try_param_tac "more" unit_induct 1
schirmer@14700
  2015
          THEN resolve_tac prems 1)
schirmer@14700
  2016
      end;
schirmer@15012
  2017
    val induct = timeit_msg "record induct proof:" induct_prf;
schirmer@14700
  2018
wenzelm@17261
  2019
    fun surjective_prf () =
schirmer@15015
  2020
      prove_standard [] surjective_prop (fn prems =>
schirmer@14700
  2021
          (EVERY [try_param_tac rN induct_scheme 1,
schirmer@15215
  2022
                  simp_tac (ss addsimps sel_convs_standard) 1]))
schirmer@15012
  2023
    val surjective = timeit_msg "record surjective proof:" surjective_prf;
schirmer@15012
  2024
schirmer@15215
  2025
    fun cases_scheme_prf_opt () =
wenzelm@17261
  2026
      let
schirmer@15215
  2027
        val (_$(Pvar$_)) = concl_of induct_scheme;
wenzelm@17261
  2028
        val ind = cterm_instantiate
wenzelm@18858
  2029
                    [(cterm_of defs_thy Pvar, cterm_of defs_thy
schirmer@15215
  2030
                            (lambda w (HOLogic.imp$HOLogic.mk_eq(r0,w)$C)))]
schirmer@15215
  2031
                    induct_scheme;
schirmer@15215
  2032
        in standard (ObjectLogic.rulify (mp OF [ind, refl])) end;
schirmer@15215
  2033
schirmer@15215
  2034
    fun cases_scheme_prf_noopt () =
schirmer@15015
  2035
        prove_standard [] cases_scheme_prop (fn prems =>
schirmer@14700
  2036
         EVERY [asm_full_simp_tac (HOL_basic_ss addsimps [atomize_all, atomize_imp]) 1,
schirmer@14700
  2037
               try_param_tac rN induct_scheme 1,
schirmer@14700
  2038
               rtac impI 1,
schirmer@14700
  2039
               REPEAT (etac allE 1),
schirmer@14700
  2040
               etac mp 1,
schirmer@14700
  2041
               rtac refl 1])
schirmer@15215
  2042
    val cases_scheme_prf = quick_and_dirty_prf cases_scheme_prf_noopt cases_scheme_prf_opt;
schirmer@15012
  2043
    val cases_scheme = timeit_msg "record cases_scheme proof:" cases_scheme_prf;
schirmer@14700
  2044
schirmer@15012
  2045
    fun cases_prf () =
schirmer@15015
  2046
      prove_standard [] cases_prop  (fn _ =>
schirmer@14700
  2047
        try_param_tac rN cases_scheme 1
schirmer@14700
  2048
        THEN simp_all_tac HOL_basic_ss [unit_all_eq1]);
schirmer@15012
  2049
    val cases = timeit_msg "record cases proof:" cases_prf;
schirmer@14700
  2050
schirmer@15012
  2051
    fun split_meta_prf () =
schirmer@15215
  2052
        prove false [] split_meta_prop (fn prems =>
wenzelm@17960
  2053
         EVERY [rtac equal_intr_rule 1, norm_hhf_tac 1,
wenzelm@17960
  2054
                etac meta_allE 1, atac 1,
schirmer@14700
  2055
                rtac (prop_subst OF [surjective]) 1,
wenzelm@17960
  2056
                REPEAT (etac meta_allE 1), atac 1]);
schirmer@15012
  2057
    val split_meta = timeit_msg "record split_meta proof:" split_meta_prf;
schirmer@15215
  2058
    val split_meta_standard = standard split_meta;
schirmer@14700
  2059
schirmer@15215
  2060
    fun split_object_prf_opt () =
wenzelm@17261
  2061
      let
wenzelm@18858
  2062
        val cPI= cterm_of defs_thy (lambda r0 (Trueprop (P$r0)));
schirmer@15215
  2063
        val (_$Abs(_,_,P$_)) = fst (Logic.dest_equals (concl_of split_meta_standard));
wenzelm@18858
  2064
        val cP = cterm_of defs_thy P;
schirmer@15215
  2065
        val split_meta' = cterm_instantiate [(cP,cPI)] split_meta_standard;
schirmer@15215
  2066
        val (l,r) = HOLogic.dest_eq (HOLogic.dest_Trueprop split_object_prop);
wenzelm@18858
  2067
        val cl = cterm_of defs_thy (HOLogic.mk_Trueprop l);
wenzelm@18858
  2068
        val cr = cterm_of defs_thy (HOLogic.mk_Trueprop r);
schirmer@15215
  2069
        val thl = assume cl                 (*All r. P r*) (* 1 *)
schirmer@15215
  2070
                |> obj_to_meta_all          (*!!r. P r*)
wenzelm@17261
  2071
                |> equal_elim split_meta'   (*!!n m more. P (ext n m more)*)
wenzelm@17261
  2072
                |> meta_to_obj_all          (*All n m more. P (ext n m more)*) (* 2*)
schirmer@15215
  2073
                |> implies_intr cl          (* 1 ==> 2 *)
schirmer@15215
  2074
        val thr = assume cr                           (*All n m more. P (ext n m more)*)
schirmer@15215
  2075
                |> obj_to_meta_all                    (*!!n m more. P (ext n m more)*)
wenzelm@17261
  2076
                |> equal_elim (symmetric split_meta') (*!!r. P r*)
schirmer@15215
  2077
                |> meta_to_obj_all                    (*All r. P r*)
schirmer@15215
  2078
                |> implies_intr cr                    (* 2 ==> 1 *)
wenzelm@17261
  2079
     in standard (thr COMP (thl COMP iffI)) end;
schirmer@15215
  2080
schirmer@15215
  2081
    fun split_object_prf_noopt () =
schirmer@15015
  2082
        prove_standard [] split_object_prop (fn prems =>
wenzelm@17261
  2083
         EVERY [rtac iffI 1,
schirmer@14700
  2084
                REPEAT (rtac allI 1), etac allE 1, atac 1,
schirmer@14700
  2085
                rtac allI 1, rtac induct_scheme 1,REPEAT (etac allE 1),atac 1]);
schirmer@15215
  2086
wenzelm@17261
  2087
    val split_object_prf = quick_and_dirty_prf split_object_prf_noopt split_object_prf_opt;
schirmer@15012
  2088
    val split_object = timeit_msg "record split_object proof:" split_object_prf;
schirmer@14700
  2089
schirmer@15012
  2090
wenzelm@17261
  2091
    fun split_ex_prf () =
schirmer@15015
  2092
        prove_standard [] split_ex_prop (fn prems =>
schirmer@15012
  2093
          EVERY [rtac iffI 1,
schirmer@15012
  2094
                   etac exE 1,
schirmer@15215
  2095
                   simp_tac (HOL_basic_ss addsimps [split_meta_standard]) 1,
schirmer@15215
  2096
                   ex_inst_tac 1,
schirmer@15215
  2097
                   (*REPEAT (rtac exI 1),*)
schirmer@15012
  2098
                   atac 1,
schirmer@15012
  2099
                 REPEAT (etac exE 1),
schirmer@15012
  2100
                 rtac exI 1,
schirmer@15012
  2101
                 atac 1]);
schirmer@15012
  2102
    val split_ex = timeit_msg "record split_ex proof:" split_ex_prf;
schirmer@14700
  2103
wenzelm@17261
  2104
    fun equality_tac thms =
schirmer@15012
  2105
      let val (s'::s::eqs) = rev thms;
schirmer@15215
  2106
          val ss' = ss addsimps (s'::s::sel_convs_standard);
schirmer@15012
  2107
          val eqs' = map (simplify ss') eqs;
schirmer@15012
  2108
      in simp_tac (HOL_basic_ss addsimps (s'::s::eqs')) 1 end;
wenzelm@17261
  2109
schirmer@15015
  2110
   fun equality_prf () = prove_standard [] equality_prop (fn _ =>
schirmer@14700
  2111
      fn st => let val [s, s'] = map #1 (rev (Tactic.innermost_params 1 st)) in
schirmer@14700
  2112
        st |> (res_inst_tac [(rN, s)] cases_scheme 1
schirmer@14700
  2113
        THEN res_inst_tac [(rN, s')] cases_scheme 1
wenzelm@17261
  2114
        THEN (METAHYPS equality_tac 1))
schirmer@15012
  2115
             (* simp_all_tac ss (sel_convs) would also work but is less efficient *)
wenzelm@17261
  2116
      end);
schirmer@15015
  2117
     val equality = timeit_msg "record equality proof:" equality_prf;
schirmer@14700
  2118
haftmann@18377
  2119
    val ((([sel_convs',upd_convs',sel_defs',upd_defs',[split_meta',split_object',split_ex'],derived_defs'],
haftmann@18377
  2120
            [surjective',equality']),[induct_scheme',induct',cases_scheme',cases']), thms_thy) =
schirmer@14700
  2121
      defs_thy
schirmer@14700
  2122
      |> (PureThy.add_thmss o map Thm.no_attributes)
schirmer@15215
  2123
         [("select_convs", sel_convs_standard),
schirmer@14700
  2124
          ("update_convs", upd_convs),
schirmer@14700
  2125
          ("select_defs", sel_defs),
schirmer@14700
  2126
          ("update_defs", upd_defs),
schirmer@15215
  2127
          ("splits", [split_meta_standard,split_object,split_ex]),
schirmer@14700
  2128
          ("defs", derived_defs)]
haftmann@18377
  2129
      ||>> (PureThy.add_thms o map Thm.no_attributes)
schirmer@14700
  2130
          [("surjective", surjective),
schirmer@14700
  2131
           ("equality", equality)]
haftmann@18377
  2132
      ||>> PureThy.add_thms
schirmer@14700
  2133
        [(("induct_scheme", induct_scheme), induct_type_global (suffix schemeN name)),
schirmer@14700
  2134
         (("induct", induct), induct_type_global name),
schirmer@14700
  2135
         (("cases_scheme", cases_scheme), cases_type_global (suffix schemeN name)),
schirmer@14700
  2136
         (("cases", cases), cases_type_global name)];
schirmer@14700
  2137
schirmer@14700
  2138
schirmer@14700
  2139
    val sel_upd_simps = sel_convs' @ upd_convs';
schirmer@14700
  2140
    val iffs = [ext_inject]
schirmer@14700
  2141
    val final_thy =
schirmer@14700
  2142
      thms_thy
haftmann@18377
  2143
      |> (snd oo PureThy.add_thmss)
wenzelm@18728
  2144
          [(("simps", sel_upd_simps), [Simplifier.simp_add]),
wenzelm@18728
  2145
           (("iffs",iffs), [iff_add])]
wenzelm@17261
  2146
      |> put_record name (make_record_info args parent fields extension induct_scheme')
schirmer@14700
  2147
      |> put_sel_upd (names @ [full_moreN]) sel_upd_simps
schirmer@14700
  2148
      |> add_record_equalities extension_id equality'
schirmer@15015
  2149
      |> add_extinjects ext_inject
schirmer@15015
  2150
      |> add_extsplit extension_name ext_split
schirmer@14700
  2151
      |> add_record_splits extension_id (split_meta',split_object',split_ex',induct_scheme')
wenzelm@17261
  2152
      |> add_extfields extension_name (fields @ [(full_moreN,moreT)])
wenzelm@17261
  2153
      |> add_fieldext (extension_name,snd extension) (names @ [full_moreN])
schirmer@14700
  2154
      |> Theory.parent_path;
schirmer@14700
  2155
schirmer@14700
  2156
  in final_thy
schirmer@14700
  2157
  end;
wenzelm@4867
  2158
wenzelm@4867
  2159
(* add_record *)
wenzelm@4867
  2160
wenzelm@4895
  2161
(*we do all preparations and error checks here, deferring the real
wenzelm@4895
  2162
  work to record_definition*)
wenzelm@4867
  2163
fun gen_add_record prep_typ prep_raw_parent (params, bname) raw_parent raw_fields thy =
wenzelm@4867
  2164
  let
wenzelm@17261
  2165
    val _ = Theory.requires thy "Record" "record definitions";
wenzelm@4867
  2166
    val sign = Theory.sign_of thy;
wenzelm@5698
  2167
    val _ = message ("Defining record " ^ quote bname ^ " ...");
wenzelm@4867
  2168
wenzelm@4867
  2169
wenzelm@4867
  2170
    (* parents *)
wenzelm@4867
  2171
wenzelm@4867
  2172
    fun prep_inst T = snd (cert_typ sign ([], T));
wenzelm@4867
  2173
skalberg@15570
  2174
    val parent = Option.map (apfst (map prep_inst) o prep_raw_parent sign) raw_parent
wenzelm@18678
  2175
      handle ERROR msg => cat_error msg ("The error(s) above in parent record specification");
wenzelm@12247
  2176
    val parents = add_parents thy parent [];
wenzelm@4867
  2177
wenzelm@4867
  2178
    val init_env =
wenzelm@4867
  2179
      (case parent of
skalberg@15531
  2180
        NONE => []
skalberg@15574
  2181
      | SOME (types, _) => foldr Term.add_typ_tfrees [] types);
wenzelm@4867
  2182
wenzelm@4867
  2183
wenzelm@4867
  2184
    (* fields *)
wenzelm@4867
  2185
wenzelm@12506
  2186
    fun prep_field (env, (c, raw_T, mx)) =
wenzelm@18678
  2187
      let val (env', T) = prep_typ sign (env, raw_T) handle ERROR msg =>
wenzelm@18678
  2188
        cat_error msg ("The error(s) above occured in field " ^ quote c)
wenzelm@12506
  2189
      in (env', (c, T, mx)) end;
wenzelm@4867
  2190
wenzelm@4967
  2191
    val (envir, bfields) = foldl_map prep_field (init_env, raw_fields);
wenzelm@4867
  2192
    val envir_names = map fst envir;
wenzelm@4867
  2193
wenzelm@4867
  2194
wenzelm@4867
  2195
    (* args *)
wenzelm@4867
  2196
wenzelm@4867
  2197
    val defaultS = Sign.defaultS sign;
haftmann@17485
  2198
    val args = map (fn x => (x, AList.lookup (op =) envir x |> the_default defaultS)) params;
wenzelm@4867
  2199
wenzelm@4867
  2200
wenzelm@4867
  2201
    (* errors *)
wenzelm@4867
  2202
wenzelm@4890
  2203
    val name = Sign.full_name sign bname;
wenzelm@17261
  2204
    val err_dup_record =
wenzelm@4890
  2205
      if is_none (get_record thy name) then []
wenzelm@4890
  2206
      else ["Duplicate definition of record " ^ quote name];
wenzelm@4890
  2207
wenzelm@4867
  2208
    val err_dup_parms =
wenzelm@18964
  2209
      (case duplicates (op =) params of
wenzelm@4867
  2210
        [] => []
wenzelm@4890
  2211
      | dups => ["Duplicate parameter(s) " ^ commas dups]);
wenzelm@4867
  2212
wenzelm@4867
  2213
    val err_extra_frees =
haftmann@20951
  2214
      (case subtract (op =) params envir_names of
wenzelm@4867
  2215
        [] => []
wenzelm@4890
  2216
      | extras => ["Extra free type variable(s) " ^ commas extras]);
wenzelm@4867
  2217
wenzelm@4890
  2218
    val err_no_fields = if null bfields then ["No fields present"] else [];
wenzelm@4867
  2219
wenzelm@4867
  2220
    val err_dup_fields =
wenzelm@18964
  2221
      (case duplicates (op =) (map #1 bfields) of
wenzelm@4867
  2222
        [] => []
wenzelm@4890
  2223
      | dups => ["Duplicate field(s) " ^ commas_quote dups]);
wenzelm@4890
  2224
wenzelm@4890
  2225
    val err_bad_fields =
wenzelm@12506
  2226
      if forall (not_equal moreN o #1) bfields then []
wenzelm@4890
  2227
      else ["Illegal field name " ^ quote moreN];
wenzelm@4867
  2228
wenzelm@4867
  2229
    val err_dup_sorts =
wenzelm@18964
  2230
      (case duplicates (op =) envir_names of
wenzelm@4867
  2231
        [] => []
wenzelm@4867
  2232
      | dups => ["Inconsistent sort constraints for " ^ commas dups]);
wenzelm@4867
  2233
wenzelm@4867
  2234
    val errs =
wenzelm@4890
  2235
      err_dup_record @ err_dup_parms @ err_extra_frees @ err_no_fields @
wenzelm@4890
  2236
      err_dup_fields @ err_bad_fields @ err_dup_sorts;
wenzelm@4867
  2237
  in
schirmer@14700
  2238
    if null errs then () else error (cat_lines errs)  ;