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