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