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