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