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