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