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