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