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