src/HOL/Tools/record_package.ML
author wenzelm
Tue Jun 01 12:33:50 2004 +0200 (2004-06-01)
changeset 14854 61bdf2ae4dc5
parent 14709 d01983034ded
child 14959 014d4e006739
permissions -rw-r--r--
removed obsolete sort 'logic';
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@9230
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@4867
     5
wenzelm@4867
     6
Extensible records with structural subtyping in HOL.
wenzelm@5698
     7
*)
wenzelm@4867
     8
wenzelm@5698
     9
signature BASIC_RECORD_PACKAGE =
wenzelm@5698
    10
sig
wenzelm@7178
    11
  val record_simproc: simproc
berghofe@14079
    12
  val record_eq_simproc: simproc
schirmer@14700
    13
  val record_upd_simproc: simproc
schirmer@14700
    14
  val record_split_simproc: (term -> bool) -> simproc
schirmer@14700
    15
  val record_ex_sel_eq_simproc: simproc
wenzelm@5698
    16
  val record_split_tac: int -> tactic
schirmer@14700
    17
  val record_split_simp_tac: (term -> bool) -> int -> tactic
wenzelm@5713
    18
  val record_split_name: string
wenzelm@5698
    19
  val record_split_wrapper: string * wrapper
schirmer@14700
    20
  val print_record_type_abbr: bool ref
schirmer@14700
    21
  val print_record_type_as_fields: bool ref 
wenzelm@5698
    22
end;
wenzelm@4867
    23
wenzelm@4867
    24
signature RECORD_PACKAGE =
wenzelm@4867
    25
sig
wenzelm@5698
    26
  include BASIC_RECORD_PACKAGE
wenzelm@5698
    27
  val quiet_mode: bool ref
wenzelm@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
schirmer@14700
    32
  val get_extension: Sign.sg -> Symtab.key -> (string * typ list) option
wenzelm@4867
    33
  val print_records: theory -> unit
schirmer@14700
    34
  val add_record: string list * string -> string option -> (string * string * mixfix) list 
schirmer@14700
    35
                  -> theory -> theory
schirmer@14700
    36
  val add_record_i: string list * string -> (typ list * string) option 
schirmer@14700
    37
                    -> (string * typ * mixfix) list -> theory -> theory
wenzelm@4867
    38
  val setup: (theory -> theory) list
wenzelm@4867
    39
end;
wenzelm@4867
    40
schirmer@14700
    41
schirmer@14709
    42
structure RecordPackage :RECORD_PACKAGE =     
wenzelm@4867
    43
struct
wenzelm@4867
    44
schirmer@14700
    45
val rec_UNIV_I = thm "rec_UNIV_I";
schirmer@14700
    46
val rec_True_simp = thm "rec_True_simp";
schirmer@14700
    47
val Pair_eq = thm "Product_Type.Pair_eq";
schirmer@14700
    48
val atomize_all = thm "HOL.atomize_all";
schirmer@14700
    49
val atomize_imp = thm "HOL.atomize_imp";
schirmer@14700
    50
val triv_goal   = thm "triv_goal";
schirmer@14700
    51
val prop_subst  = thm "prop_subst";
schirmer@14700
    52
val Pair_sel_convs = [fst_conv,snd_conv];
wenzelm@11832
    53
wenzelm@11832
    54
wenzelm@11832
    55
schirmer@14700
    56
(** name components **)
schirmer@14700
    57
schirmer@14700
    58
val rN = "r";
schirmer@14700
    59
val moreN = "more";
schirmer@14700
    60
val schemeN = "_scheme";
schirmer@14700
    61
val ext_typeN = "_ext_type"; 
schirmer@14700
    62
val extN ="_ext";
schirmer@14709
    63
val ext_dest = "_sel";
schirmer@14700
    64
val updateN = "_update";
schirmer@14700
    65
val schemeN = "_scheme";
schirmer@14700
    66
val makeN = "make";
schirmer@14700
    67
val fields_selN = "fields";
schirmer@14700
    68
val extendN = "extend";
schirmer@14700
    69
val truncateN = "truncate";
schirmer@14700
    70
schirmer@14700
    71
(*see typedef_package.ML*)
schirmer@14700
    72
val RepN = "Rep_";
schirmer@14700
    73
val AbsN = "Abs_";
schirmer@14700
    74
wenzelm@4894
    75
(*** utilities ***)
wenzelm@4867
    76
schirmer@14709
    77
fun but_last xs = fst (split_last xs);
schirmer@14700
    78
wenzelm@5698
    79
(* messages *)
wenzelm@5698
    80
wenzelm@5698
    81
val quiet_mode = ref false;
wenzelm@5698
    82
fun message s = if ! quiet_mode then () else writeln s;
wenzelm@5698
    83
wenzelm@12255
    84
(* syntax *)
wenzelm@4867
    85
wenzelm@12247
    86
fun prune n xs = Library.drop (n, xs);
wenzelm@11832
    87
fun prefix_base s = NameSpace.map_base (fn bname => s ^ bname);
wenzelm@11832
    88
wenzelm@11927
    89
val Trueprop = HOLogic.mk_Trueprop;
wenzelm@11927
    90
fun All xs t = Term.list_all_free (xs, t);
wenzelm@4894
    91
wenzelm@11934
    92
infix 9 $$;
wenzelm@11934
    93
infix 0 :== ===;
wenzelm@11934
    94
infixr 0 ==>;
wenzelm@11934
    95
wenzelm@11934
    96
val (op $$) = Term.list_comb;
wenzelm@11927
    97
val (op :==) = Logic.mk_defpair;
wenzelm@11927
    98
val (op ===) = Trueprop o HOLogic.mk_eq;
wenzelm@11927
    99
val (op ==>) = Logic.mk_implies;
wenzelm@11927
   100
wenzelm@11832
   101
(* morphisms *)
wenzelm@11832
   102
schirmer@14700
   103
fun mk_RepN name = suffix ext_typeN (prefix_base RepN name);
schirmer@14700
   104
fun mk_AbsN name = suffix ext_typeN (prefix_base AbsN name);
wenzelm@11832
   105
schirmer@14700
   106
fun mk_Rep name repT absT  =
schirmer@14700
   107
  Const (suffix ext_typeN (prefix_base RepN name),absT --> repT);
wenzelm@11832
   108
schirmer@14700
   109
fun mk_Abs name repT absT =
schirmer@14700
   110
  Const (mk_AbsN name,repT --> absT);
wenzelm@4867
   111
schirmer@14700
   112
(* constructor *)
wenzelm@4867
   113
schirmer@14700
   114
fun mk_extC (name,T) Ts  = (suffix extN name, Ts ---> T);
wenzelm@4867
   115
schirmer@14700
   116
fun mk_ext (name,T) ts =
schirmer@14700
   117
  let val Ts = map fastype_of ts
schirmer@14700
   118
  in list_comb (Const (mk_extC (name,T) Ts),ts) end;
wenzelm@4867
   119
schirmer@14700
   120
(* selector *)
schirmer@14700
   121
schirmer@14700
   122
fun mk_selC sT (c,T) = (c,sT --> T);
wenzelm@4867
   123
schirmer@14700
   124
fun mk_sel s (c,T) =
schirmer@14700
   125
  let val sT = fastype_of s
schirmer@14700
   126
  in Const (mk_selC sT (c,T)) $ s end;
wenzelm@4867
   127
schirmer@14700
   128
(* updates *)
schirmer@14700
   129
schirmer@14700
   130
fun mk_updC sT (c,T) = (suffix updateN c, T --> sT --> sT);
wenzelm@4867
   131
schirmer@14700
   132
fun mk_upd c v s =
schirmer@14700
   133
  let val sT = fastype_of s;
schirmer@14700
   134
      val vT = fastype_of v;
schirmer@14700
   135
  in Const (mk_updC sT (c, vT)) $ v $ s end;
wenzelm@4867
   136
wenzelm@4867
   137
(* types *)
wenzelm@4867
   138
schirmer@14700
   139
fun dest_recT (typ as Type (c_ext_type, Ts as (T::_))) =
schirmer@14700
   140
      (case try (unsuffix ext_typeN) c_ext_type of
schirmer@14700
   141
        None => raise TYPE ("RecordPackage.dest_recT", [typ], [])
schirmer@14709
   142
      | Some c => ((c, Ts), last_elem Ts))
schirmer@14700
   143
  | dest_recT typ = raise TYPE ("RecordPackage.dest_recT", [typ], []);
wenzelm@5197
   144
schirmer@14700
   145
fun is_recT T =
schirmer@14700
   146
  (case try dest_recT T of None => false | Some _ => true); 
wenzelm@11833
   147
schirmer@14700
   148
fun dest_recTs T =
schirmer@14700
   149
  let val ((c, Ts), U) = dest_recT T
schirmer@14700
   150
  in (c, Ts) :: dest_recTs U
schirmer@14700
   151
  end handle TYPE _ => [];
schirmer@14255
   152
schirmer@14700
   153
fun last_extT T =
schirmer@14700
   154
  let val ((c, Ts), U) = dest_recT T
schirmer@14700
   155
  in (case last_extT U of
schirmer@14700
   156
        None => Some (c,Ts)
schirmer@14700
   157
      | Some l => Some l)
schirmer@14700
   158
  end handle TYPE _ => None
schirmer@14255
   159
schirmer@14700
   160
fun rec_id T = foldl (fn (s,(c,T)) => s ^ c) ("",dest_recTs T);
wenzelm@4867
   161
wenzelm@4867
   162
(*** extend theory by record definition ***)
wenzelm@4867
   163
wenzelm@4867
   164
(** record info **)
wenzelm@4867
   165
schirmer@14255
   166
(* type record_info and parent_info  *)
wenzelm@4867
   167
wenzelm@4867
   168
type record_info =
wenzelm@4867
   169
 {args: (string * sort) list,
wenzelm@4867
   170
  parent: (typ list * string) option,
wenzelm@4867
   171
  fields: (string * typ) list,
schirmer@14700
   172
  extension: (string * typ list),
schirmer@14700
   173
  induct: thm
schirmer@14700
   174
 };
wenzelm@11927
   175
schirmer@14700
   176
fun make_record_info args parent fields extension induct =
schirmer@14700
   177
 {args = args, parent = parent, fields = fields, extension = extension, 
schirmer@14700
   178
  induct = induct}: record_info;
schirmer@14700
   179
wenzelm@4867
   180
wenzelm@4867
   181
type parent_info =
wenzelm@4867
   182
 {name: string,
wenzelm@4867
   183
  fields: (string * typ) list,
schirmer@14700
   184
  extension: (string * typ list),
schirmer@14700
   185
  induct: thm
schirmer@14700
   186
};
wenzelm@11927
   187
schirmer@14700
   188
fun make_parent_info name fields extension induct =
schirmer@14700
   189
 {name = name, fields = fields, extension = extension, induct = induct}: parent_info;
wenzelm@4867
   190
schirmer@14700
   191
(* data kind 'HOL/record' *)
wenzelm@5001
   192
wenzelm@7178
   193
type record_data =
wenzelm@7178
   194
 {records: record_info Symtab.table,
wenzelm@7178
   195
  sel_upd:
wenzelm@7178
   196
   {selectors: unit Symtab.table,
wenzelm@7178
   197
    updates: string Symtab.table,
wenzelm@7178
   198
    simpset: Simplifier.simpset},
schirmer@14255
   199
  equalities: thm Symtab.table,
schirmer@14700
   200
  splits: (thm*thm*thm*thm) Symtab.table,    (* !!,!,EX - split-equalities,induct rule *) 
schirmer@14700
   201
  extfields: (string*typ) list Symtab.table, (* maps extension to its fields *)
schirmer@14700
   202
  fieldext: (string*typ list) Symtab.table   (* maps field to its extension *)
schirmer@14255
   203
};
wenzelm@7178
   204
schirmer@14700
   205
fun make_record_data records sel_upd equalities splits extfields fieldext =
schirmer@14700
   206
 {records = records, sel_upd = sel_upd, 
schirmer@14700
   207
  equalities = equalities, splits = splits, 
schirmer@14700
   208
  extfields = extfields, fieldext = fieldext }: record_data;
wenzelm@7178
   209
wenzelm@5006
   210
structure RecordsArgs =
wenzelm@5006
   211
struct
schirmer@14709
   212
  val name = "HOL/structures"; (* FIXME *)    
wenzelm@7178
   213
  type T = record_data;
wenzelm@4867
   214
wenzelm@7178
   215
  val empty =
wenzelm@7178
   216
    make_record_data Symtab.empty
wenzelm@7178
   217
      {selectors = Symtab.empty, updates = Symtab.empty, simpset = HOL_basic_ss}
schirmer@14700
   218
      Symtab.empty Symtab.empty Symtab.empty Symtab.empty;
wenzelm@7178
   219
wenzelm@6556
   220
  val copy = I;
wenzelm@5006
   221
  val prep_ext = I;
wenzelm@7178
   222
  fun merge
wenzelm@7178
   223
   ({records = recs1,
wenzelm@7178
   224
     sel_upd = {selectors = sels1, updates = upds1, simpset = ss1},
schirmer@14255
   225
     equalities = equalities1,
schirmer@14700
   226
     splits = splits1,
schirmer@14700
   227
     extfields = extfields1,
schirmer@14700
   228
     fieldext = fieldext1},
wenzelm@7178
   229
    {records = recs2,
wenzelm@7178
   230
     sel_upd = {selectors = sels2, updates = upds2, simpset = ss2},
schirmer@14255
   231
     equalities = equalities2, 
schirmer@14700
   232
     splits = splits2,
schirmer@14700
   233
     extfields = extfields2,
schirmer@14700
   234
     fieldext = fieldext2}) =
schirmer@14255
   235
    make_record_data  
wenzelm@7178
   236
      (Symtab.merge (K true) (recs1, recs2))
wenzelm@7178
   237
      {selectors = Symtab.merge (K true) (sels1, sels2),
wenzelm@7178
   238
        updates = Symtab.merge (K true) (upds1, upds2),
wenzelm@7178
   239
        simpset = Simplifier.merge_ss (ss1, ss2)}
schirmer@14255
   240
      (Symtab.merge Thm.eq_thm (equalities1, equalities2))
schirmer@14255
   241
      (Symtab.merge (fn ((a,b,c,d),(w,x,y,z)) 
schirmer@14255
   242
                     => Thm.eq_thm (a,w) andalso Thm.eq_thm (b,x) andalso 
schirmer@14255
   243
                        Thm.eq_thm (c,y) andalso Thm.eq_thm (d,z)) 
schirmer@14700
   244
                    (splits1, splits2))
schirmer@14700
   245
      (Symtab.merge (K true) (extfields1,extfields2))
schirmer@14700
   246
      (Symtab.merge (K true) (fieldext1,fieldext2));
wenzelm@4867
   247
wenzelm@7178
   248
  fun print sg ({records = recs, ...}: record_data) =
wenzelm@4867
   249
    let
wenzelm@4867
   250
      val prt_typ = Sign.pretty_typ sg;
wenzelm@4867
   251
wenzelm@4867
   252
      fun pretty_parent None = []
wenzelm@4867
   253
        | pretty_parent (Some (Ts, name)) =
wenzelm@4867
   254
            [Pretty.block [prt_typ (Type (name, Ts)), Pretty.str " +"]];
wenzelm@4867
   255
wenzelm@4867
   256
      fun pretty_field (c, T) = Pretty.block
wenzelm@12129
   257
        [Pretty.str (Sign.cond_extern sg Sign.constK c), Pretty.str " ::",
wenzelm@12129
   258
          Pretty.brk 1, Pretty.quote (prt_typ T)];
wenzelm@4867
   259
wenzelm@12247
   260
      fun pretty_record (name, {args, parent, fields, ...}: record_info) =
wenzelm@11927
   261
        Pretty.block (Pretty.fbreaks (Pretty.block
wenzelm@11927
   262
          [prt_typ (Type (name, map TFree args)), Pretty.str " = "] ::
wenzelm@4867
   263
          pretty_parent parent @ map pretty_field fields));
wenzelm@12129
   264
    in map pretty_record (Symtab.dest recs) |> Pretty.chunks |> Pretty.writeln end;
wenzelm@4867
   265
end;
wenzelm@4867
   266
wenzelm@5006
   267
structure RecordsData = TheoryDataFun(RecordsArgs);
wenzelm@5006
   268
val print_records = RecordsData.print;
wenzelm@5006
   269
wenzelm@7178
   270
(* access 'records' *)
wenzelm@4867
   271
wenzelm@7178
   272
fun get_record thy name = Symtab.lookup (#records (RecordsData.get thy), name);
wenzelm@4867
   273
wenzelm@4890
   274
fun put_record name info thy =
wenzelm@7178
   275
  let
schirmer@14700
   276
    val {records, sel_upd, equalities, splits,extfields,fieldext} = RecordsData.get thy;
berghofe@14079
   277
    val data = make_record_data (Symtab.update ((name, info), records))
schirmer@14700
   278
      sel_upd equalities splits extfields fieldext;
wenzelm@7178
   279
  in RecordsData.put data thy end;
wenzelm@7178
   280
wenzelm@7178
   281
(* access 'sel_upd' *)
wenzelm@7178
   282
wenzelm@7178
   283
fun get_sel_upd sg = #sel_upd (RecordsData.get_sg sg);
wenzelm@7178
   284
wenzelm@7178
   285
fun get_selectors sg name = Symtab.lookup (#selectors (get_sel_upd sg), name);
schirmer@14700
   286
fun is_selector sg name = 
schirmer@14700
   287
  case get_selectors sg (Sign.intern_const sg name) of 
schirmer@14700
   288
     None => false
schirmer@14700
   289
   | Some _ => true
schirmer@14700
   290
schirmer@14700
   291
                             
wenzelm@7178
   292
fun get_updates sg name = Symtab.lookup (#updates (get_sel_upd sg), name);
wenzelm@7178
   293
fun get_simpset sg = #simpset (get_sel_upd sg);
wenzelm@7178
   294
wenzelm@7178
   295
fun put_sel_upd names simps thy =
wenzelm@7178
   296
  let
wenzelm@7178
   297
    val sels = map (rpair ()) names;
wenzelm@7178
   298
    val upds = map (suffix updateN) names ~~ names;
wenzelm@7178
   299
schirmer@14700
   300
    val {records, sel_upd = {selectors, updates, simpset}, 
schirmer@14700
   301
      equalities, splits, extfields,fieldext} = RecordsData.get thy;
wenzelm@7178
   302
    val data = make_record_data records
wenzelm@7178
   303
      {selectors = Symtab.extend (selectors, sels),
wenzelm@7178
   304
        updates = Symtab.extend (updates, upds),
wenzelm@7178
   305
        simpset = Simplifier.addsimps (simpset, simps)}
schirmer@14700
   306
       equalities splits extfields fieldext;
wenzelm@7178
   307
  in RecordsData.put data thy end;
wenzelm@7178
   308
berghofe@14079
   309
(* access 'equalities' *)
berghofe@14079
   310
berghofe@14079
   311
fun add_record_equalities name thm thy =
berghofe@14079
   312
  let
schirmer@14700
   313
    val {records, sel_upd, equalities, splits, extfields,fieldext} = RecordsData.get thy;
schirmer@14700
   314
    val data = make_record_data records sel_upd 
schirmer@14700
   315
      (Symtab.update_new ((name, thm), equalities)) splits extfields fieldext;
berghofe@14079
   316
  in RecordsData.put data thy end;
berghofe@14079
   317
berghofe@14079
   318
fun get_equalities sg name =
berghofe@14079
   319
  Symtab.lookup (#equalities (RecordsData.get_sg sg), name);
berghofe@14079
   320
schirmer@14255
   321
(* access 'splits' *)
schirmer@14255
   322
schirmer@14255
   323
fun add_record_splits name thmP thy =
schirmer@14255
   324
  let
schirmer@14700
   325
    val {records, sel_upd, equalities, splits, extfields,fieldext} = RecordsData.get thy;
schirmer@14700
   326
    val data = make_record_data records sel_upd 
schirmer@14700
   327
      equalities (Symtab.update_new ((name, thmP), splits)) extfields fieldext;
schirmer@14255
   328
  in RecordsData.put data thy end;
schirmer@14255
   329
schirmer@14255
   330
fun get_splits sg name =
schirmer@14255
   331
  Symtab.lookup (#splits (RecordsData.get_sg sg), name);
schirmer@14255
   332
schirmer@14700
   333
(* extension of a record name *)
schirmer@14700
   334
fun get_extension sg name =
schirmer@14700
   335
 case Symtab.lookup (#records (RecordsData.get_sg sg),name) of
schirmer@14700
   336
        Some s => Some (#extension s)
schirmer@14358
   337
      | None => None;
berghofe@14079
   338
schirmer@14700
   339
(* access 'extfields' *)
schirmer@14700
   340
schirmer@14700
   341
fun add_extfields name fields thy =
schirmer@14700
   342
  let
schirmer@14700
   343
    val {records, sel_upd, equalities, splits, extfields, fieldext} = RecordsData.get thy;
schirmer@14700
   344
    val data = make_record_data records sel_upd 
schirmer@14700
   345
         equalities splits (Symtab.update_new ((name, fields), extfields)) fieldext;
schirmer@14700
   346
  in RecordsData.put data thy end;
schirmer@14700
   347
schirmer@14700
   348
fun get_extfields sg name =
schirmer@14700
   349
  Symtab.lookup (#extfields (RecordsData.get_sg sg), name);
schirmer@14700
   350
schirmer@14700
   351
(* access 'fieldext' *)
schirmer@14700
   352
schirmer@14700
   353
fun add_fieldext extname_types fields thy =
schirmer@14700
   354
  let
schirmer@14700
   355
    val {records, sel_upd, equalities, splits, extfields, fieldext} = RecordsData.get thy;
schirmer@14700
   356
    val fieldext' = foldl (fn (table,field) => Symtab.update_new ((field,extname_types),table))  
schirmer@14700
   357
                          (fieldext,fields);
schirmer@14700
   358
    val data = make_record_data records sel_upd equalities splits extfields fieldext';
schirmer@14700
   359
  in RecordsData.put data thy end;
schirmer@14700
   360
schirmer@14700
   361
schirmer@14700
   362
fun get_fieldext sg name =
schirmer@14700
   363
  Symtab.lookup (#fieldext (RecordsData.get_sg sg), name);
schirmer@14700
   364
wenzelm@4867
   365
(* parent records *)
wenzelm@4867
   366
wenzelm@12247
   367
fun add_parents thy None parents = parents
wenzelm@12247
   368
  | add_parents thy (Some (types, name)) parents =
wenzelm@12247
   369
      let
wenzelm@12247
   370
        val sign = Theory.sign_of thy;
wenzelm@12247
   371
        fun err msg = error (msg ^ " parent record " ^ quote name);
wenzelm@12255
   372
schirmer@14700
   373
        val {args, parent, fields, extension, induct} =
wenzelm@12247
   374
          (case get_record thy name of Some info => info | None => err "Unknown");
wenzelm@12247
   375
        val _ = if length types <> length args then err "Bad number of arguments for" else ();
wenzelm@12255
   376
wenzelm@12247
   377
        fun bad_inst ((x, S), T) =
wenzelm@12247
   378
          if Sign.of_sort sign (T, S) then None else Some x
wenzelm@12247
   379
        val bads = mapfilter bad_inst (args ~~ types);
wenzelm@12255
   380
wenzelm@12247
   381
        val inst = map fst args ~~ types;
wenzelm@12247
   382
        val subst = Term.map_type_tfree (fn (x, _) => the (assoc (inst, x)));
wenzelm@12247
   383
        val parent' = apsome (apfst (map subst)) parent;
wenzelm@12247
   384
        val fields' = map (apsnd subst) fields;
schirmer@14700
   385
        val extension' = apsnd (map subst) extension;
wenzelm@12247
   386
      in
wenzelm@12255
   387
        conditional (not (null bads)) (fn () =>
wenzelm@12255
   388
          err ("Ill-sorted instantiation of " ^ commas bads ^ " in"));
wenzelm@12255
   389
        add_parents thy parent'
schirmer@14700
   390
          (make_parent_info name fields' extension' induct::parents)
wenzelm@12247
   391
      end;
wenzelm@4867
   392
wenzelm@4867
   393
schirmer@14700
   394
(** concrete syntax for records **)
schirmer@14700
   395
schirmer@14700
   396
(* parse translations *)
schirmer@14700
   397
schirmer@14700
   398
fun gen_field_tr mark sfx (t as Const (c, _) $ Const (name, _) $ arg) =
schirmer@14700
   399
      if c = mark then Syntax.const (suffix sfx name) $ arg
schirmer@14700
   400
      else raise TERM ("gen_field_tr: " ^ mark, [t])
schirmer@14700
   401
  | gen_field_tr mark _ t = raise TERM ("gen_field_tr: " ^ mark, [t]);
schirmer@14700
   402
schirmer@14700
   403
fun gen_fields_tr sep mark sfx (tm as Const (c, _) $ t $ u) =
schirmer@14700
   404
      if c = sep then gen_field_tr mark sfx t :: gen_fields_tr sep mark sfx u
schirmer@14700
   405
      else [gen_field_tr mark sfx tm]
schirmer@14700
   406
  | gen_fields_tr _ mark sfx tm = [gen_field_tr mark sfx tm];
schirmer@14700
   407
schirmer@14700
   408
schirmer@14700
   409
fun record_update_tr [t, u] =
schirmer@14700
   410
      foldr (op $) (rev (gen_fields_tr "_updates" "_update" updateN u), t)
schirmer@14700
   411
  | record_update_tr ts = raise TERM ("record_update_tr", ts);
schirmer@14700
   412
schirmer@14700
   413
fun update_name_tr (Free (x, T) :: ts) = Free (suffix updateN x, T) $$ ts
schirmer@14700
   414
  | update_name_tr (Const (x, T) :: ts) = Const (suffix updateN x, T) $$ ts
schirmer@14700
   415
  | update_name_tr (((c as Const ("_constrain", _)) $ t $ ty) :: ts) =
schirmer@14700
   416
      (c $ update_name_tr [t] $ (Syntax.const "fun" $ ty $ Syntax.const "dummy")) $$ ts
schirmer@14700
   417
  | update_name_tr ts = raise TERM ("update_name_tr", ts);
schirmer@14700
   418
schirmer@14700
   419
fun dest_ext_field mark (t as (Const (c,_) $ Const (name,_) $ arg)) =
schirmer@14700
   420
     if c = mark then (name,arg) else raise TERM ("dest_ext_field: " ^ mark, [t])
schirmer@14700
   421
  | dest_ext_field _ t = raise TERM ("dest_ext_field", [t])
schirmer@14700
   422
schirmer@14700
   423
fun dest_ext_fields sep mark (trm as (Const (c,_) $ t $ u)) =
schirmer@14700
   424
     if c = sep then dest_ext_field mark t::dest_ext_fields sep mark u
schirmer@14700
   425
     else [dest_ext_field mark trm]
schirmer@14700
   426
  | dest_ext_fields _ mark t = [dest_ext_field mark t]
schirmer@14700
   427
schirmer@14700
   428
fun gen_ext_fields_tr sep mark sfx more sg t =
schirmer@14700
   429
  let 
schirmer@14709
   430
    val msg = "error in record input: ";
schirmer@14700
   431
    val fieldargs = dest_ext_fields sep mark t; 
schirmer@14700
   432
    fun splitargs (field::fields) ((name,arg)::fargs) =
schirmer@14709
   433
          if can (unsuffix name) field
schirmer@14700
   434
          then let val (args,rest) = splitargs fields fargs
schirmer@14700
   435
               in (arg::args,rest) end
schirmer@14709
   436
          else raise TERM (msg ^ "expecting field " ^ field ^ " but got " ^ name, [t])
schirmer@14700
   437
      | splitargs [] (fargs as (_::_)) = ([],fargs)
schirmer@14709
   438
      | splitargs (_::_) [] = raise TERM (msg ^ "expecting more fields", [t])
schirmer@14700
   439
      | splitargs _ _ = ([],[]);
schirmer@14700
   440
schirmer@14700
   441
    fun mk_ext (fargs as (name,arg)::_) =
schirmer@14700
   442
         (case get_fieldext sg (Sign.intern_const sg name) of
schirmer@14700
   443
            Some (ext,_) => (case get_extfields sg ext of
schirmer@14700
   444
                               Some flds 
schirmer@14700
   445
                                 => let val (args,rest) = 
schirmer@14700
   446
                                               splitargs (map fst (but_last flds)) fargs;
schirmer@14700
   447
                                        val more' = mk_ext rest;  
schirmer@14700
   448
                                    in list_comb (Syntax.const (suffix sfx ext),args@[more'])
schirmer@14700
   449
                                    end
schirmer@14709
   450
                             | None => raise TERM(msg ^ "no fields defined for "
schirmer@14700
   451
                                                   ^ ext,[t]))
schirmer@14709
   452
          | None => raise TERM (msg ^ name ^" is no proper field",[t]))
schirmer@14700
   453
      | mk_ext [] = more
schirmer@14700
   454
schirmer@14700
   455
  in mk_ext fieldargs end;   
schirmer@14700
   456
schirmer@14700
   457
fun gen_ext_type_tr sep mark sfx more sg t =
schirmer@14700
   458
  let 
schirmer@14709
   459
    val msg = "error in record-type input: ";
schirmer@14700
   460
    val fieldargs = dest_ext_fields sep mark t; 
schirmer@14700
   461
    fun splitargs (field::fields) ((name,arg)::fargs) =
schirmer@14709
   462
          if can (unsuffix name) field
schirmer@14700
   463
          then let val (args,rest) = splitargs fields fargs
schirmer@14700
   464
               in (arg::args,rest) end
schirmer@14709
   465
          else raise TERM (msg ^ "expecting field " ^ field ^ " but got " ^ name, [t])
schirmer@14700
   466
      | splitargs [] (fargs as (_::_)) = ([],fargs)
schirmer@14709
   467
      | splitargs (_::_) [] = raise TERM (msg ^ "expecting more fields", [t])
schirmer@14700
   468
      | splitargs _ _ = ([],[]);
schirmer@14700
   469
schirmer@14700
   470
    fun get_sort xs n = (case assoc (xs,n) of 
schirmer@14700
   471
                                Some s => s 
schirmer@14700
   472
                              | None => Sign.defaultS sg);
schirmer@14700
   473
    fun to_type t = Sign.intern_typ sg 
schirmer@14700
   474
                      (Syntax.typ_of_term (get_sort (Syntax.raw_term_sorts t)) I t);
schirmer@14700
   475
 
schirmer@14700
   476
    val tsig = Sign.tsig_of sg;
schirmer@14700
   477
    fun unify (t,env) = Type.unify tsig env t; 
schirmer@14700
   478
    
schirmer@14700
   479
    fun mk_ext (fargs as (name,arg)::_) =
schirmer@14700
   480
         (case get_fieldext sg (Sign.intern_const sg name) of
schirmer@14700
   481
            Some (ext,alphas) => 
schirmer@14700
   482
              (case get_extfields sg ext of
schirmer@14700
   483
                 Some flds 
schirmer@14700
   484
                  => (let
schirmer@14700
   485
                       val flds' = but_last flds;
schirmer@14700
   486
                       val types = map snd flds'; 
schirmer@14700
   487
                       val (args,rest) = splitargs (map fst flds') fargs;
schirmer@14700
   488
                       val vartypes = map Type.varifyT types;
schirmer@14700
   489
                       val argtypes = map to_type args;
schirmer@14700
   490
                       val (subst,_) = foldr unify (vartypes ~~ argtypes,(Vartab.empty,0));
schirmer@14700
   491
                       val alphas' = map ((Syntax.term_of_typ (! Syntax.show_sorts)) o 
schirmer@14700
   492
                                          (Envir.norm_type subst) o Type.varifyT) 
schirmer@14700
   493
                                         (but_last alphas);
schirmer@14700
   494
 
schirmer@14700
   495
                       val more' = mk_ext rest;   
schirmer@14700
   496
                     in list_comb (Syntax.const (suffix sfx ext),alphas'@[more']) 
schirmer@14700
   497
                     end handle TUNIFY => raise 
schirmer@14709
   498
                           TERM (msg ^ "type is no proper record (extension)", [t]))
schirmer@14709
   499
               | None => raise TERM (msg ^ "no fields defined for " ^ ext,[t]))
schirmer@14709
   500
          | None => raise TERM (msg ^ name ^" is no proper field",[t]))
schirmer@14700
   501
      | mk_ext [] = more
schirmer@14700
   502
schirmer@14700
   503
  in mk_ext fieldargs end;   
schirmer@14700
   504
schirmer@14700
   505
fun gen_adv_record_tr sep mark sfx unit sg [t] = 
schirmer@14700
   506
      gen_ext_fields_tr sep mark sfx unit sg t
schirmer@14700
   507
  | gen_adv_record_tr _ _ _ _ _ ts = raise TERM ("gen_record_tr", ts);
schirmer@14700
   508
schirmer@14700
   509
fun gen_adv_record_scheme_tr sep mark sfx sg [t, more] = 
schirmer@14700
   510
      gen_ext_fields_tr sep mark sfx more sg t 
schirmer@14700
   511
  | gen_adv_record_scheme_tr _ _ _ _ ts = raise TERM ("gen_record_scheme_tr", ts);
schirmer@14700
   512
schirmer@14700
   513
fun gen_adv_record_type_tr sep mark sfx unit sg [t] = 
schirmer@14700
   514
      gen_ext_type_tr sep mark sfx unit sg t
schirmer@14700
   515
  | gen_adv_record_type_tr _ _ _ _ _ ts = raise TERM ("gen_record_tr", ts);
schirmer@14700
   516
schirmer@14700
   517
fun gen_adv_record_type_scheme_tr sep mark sfx sg [t, more] = 
schirmer@14700
   518
      gen_ext_type_tr sep mark sfx more sg t 
schirmer@14700
   519
  | gen_adv_record_type_scheme_tr _ _ _ _ ts = raise TERM ("gen_record_scheme_tr", ts);
schirmer@14700
   520
schirmer@14700
   521
val adv_record_tr = gen_adv_record_tr "_fields" "_field" extN HOLogic.unit;
schirmer@14700
   522
val adv_record_scheme_tr = gen_adv_record_scheme_tr "_fields" "_field" extN;
schirmer@14700
   523
schirmer@14700
   524
val adv_record_type_tr = 
schirmer@14700
   525
      gen_adv_record_type_tr "_field_types" "_field_type" ext_typeN 
schirmer@14700
   526
        (Syntax.term_of_typ false (HOLogic.unitT));
schirmer@14700
   527
val adv_record_type_scheme_tr = 
schirmer@14700
   528
      gen_adv_record_type_scheme_tr "_field_types" "_field_type" ext_typeN;
schirmer@14700
   529
schirmer@14700
   530
val parse_translation =
schirmer@14700
   531
 [("_record_update", record_update_tr),
schirmer@14700
   532
  ("_update_name", update_name_tr)];
schirmer@14700
   533
schirmer@14700
   534
val adv_parse_translation = 
schirmer@14700
   535
 [("_record",adv_record_tr),
schirmer@14700
   536
  ("_record_scheme",adv_record_scheme_tr),
schirmer@14700
   537
  ("_record_type",adv_record_type_tr),
schirmer@14700
   538
  ("_record_type_scheme",adv_record_type_scheme_tr)];
schirmer@14700
   539
schirmer@14700
   540
schirmer@14700
   541
(* print translations *)
schirmer@14700
   542
schirmer@14700
   543
val print_record_type_abbr = ref true;
schirmer@14700
   544
val print_record_type_as_fields = ref true;
schirmer@14700
   545
schirmer@14700
   546
fun gen_field_upds_tr' mark sfx (tm as Const (name_field, _) $ t $ u) =
schirmer@14700
   547
    (case try (unsuffix sfx) name_field of
schirmer@14700
   548
      Some name =>
schirmer@14700
   549
        apfst (cons (Syntax.const mark $ Syntax.free name $ t)) (gen_field_upds_tr' mark sfx u)
schirmer@14700
   550
     | None => ([], tm))
schirmer@14700
   551
  | gen_field_upds_tr' _ _ tm = ([], tm);
schirmer@14700
   552
schirmer@14700
   553
fun record_update_tr' tm =
schirmer@14700
   554
  let val (ts, u) = gen_field_upds_tr' "_update" updateN tm in
schirmer@14700
   555
    Syntax.const "_record_update" $ u $
schirmer@14700
   556
      foldr1 (fn (v, w) => Syntax.const "_updates" $ v $ w) (rev ts)
schirmer@14700
   557
  end;
schirmer@14700
   558
schirmer@14700
   559
fun gen_field_tr' sfx tr' name =
schirmer@14700
   560
  let val name_sfx = suffix sfx name
schirmer@14700
   561
  in (name_sfx, fn [t, u] => tr' (Syntax.const name_sfx $ t $ u) | _ => raise Match) end;
schirmer@14700
   562
schirmer@14700
   563
fun record_tr' sep mark record record_scheme unit sg t =
schirmer@14700
   564
  let 
schirmer@14700
   565
    fun field_lst t =
schirmer@14700
   566
      (case strip_comb t of
schirmer@14700
   567
        (Const (ext,_),args) 
schirmer@14700
   568
         => (case try (unsuffix extN) (Sign.intern_const sg ext) of
schirmer@14700
   569
               Some ext' 
schirmer@14700
   570
               => (case get_extfields sg ext' of
schirmer@14700
   571
                     Some flds 
schirmer@14700
   572
                     => (let
schirmer@14700
   573
                          val (f::fs) = but_last (map fst flds);
schirmer@14700
   574
                          val flds' = Sign.extern sg Sign.constK f::map NameSpace.base fs; 
schirmer@14700
   575
                          val (args',more) = split_last args; 
schirmer@14700
   576
                         in (flds'~~args')@field_lst more end
schirmer@14700
   577
                         handle LIST _ => [("",t)]) 
schirmer@14700
   578
                   | None => [("",t)])
schirmer@14700
   579
             | None => [("",t)])
schirmer@14700
   580
       | _ => [("",t)])
schirmer@14700
   581
schirmer@14700
   582
    val (flds,(_,more)) = split_last (field_lst t);
schirmer@14700
   583
    val flds' = map (fn (n,t)=>Syntax.const mark$Syntax.const n$t) flds;
schirmer@14700
   584
    val flds'' = foldr1 (fn (x,y) => Syntax.const sep$x$y) flds';
schirmer@14700
   585
schirmer@14700
   586
  in if null flds then raise Match
schirmer@14700
   587
     else if unit more  
schirmer@14700
   588
          then Syntax.const record$flds'' 
schirmer@14700
   589
          else Syntax.const record_scheme$flds''$more
schirmer@14700
   590
  end
schirmer@14700
   591
schirmer@14700
   592
fun gen_record_tr' name = 
schirmer@14700
   593
  let val name_sfx = suffix extN name;
schirmer@14700
   594
      val unit = (fn Const ("Unity",_) => true | _ => false);
schirmer@14700
   595
      fun tr' sg ts = record_tr' "_fields" "_field" "_record" "_record_scheme" unit sg 
schirmer@14700
   596
                       (list_comb (Syntax.const name_sfx,ts))
schirmer@14700
   597
  in (name_sfx,tr')
schirmer@14700
   598
  end
schirmer@14700
   599
schirmer@14700
   600
fun print_translation names =
schirmer@14700
   601
  map (gen_field_tr' updateN record_update_tr') names;
schirmer@14700
   602
schirmer@14700
   603
(* record_type_abbr_tr' tries to reconstruct the record name type abbreviation from *)
schirmer@14700
   604
(* the (nested) extension types.                                                    *)
schirmer@14700
   605
fun record_type_abbr_tr' default_tr' abbr alphas zeta lastExt schemeT sg tm =
schirmer@14700
   606
  let
schirmer@14700
   607
      (* tm is term representation of a (nested) field type. We first reconstruct the      *)
schirmer@14700
   608
      (* type from tm so that we can continue on the type level rather then the term level.*)
schirmer@14700
   609
schirmer@14700
   610
      fun get_sort xs n = (case assoc (xs,n) of 
schirmer@14700
   611
                             Some s => s 
schirmer@14700
   612
                           | None => Sign.defaultS sg);
schirmer@14700
   613
schirmer@14700
   614
      val T = Sign.intern_typ sg (Syntax.typ_of_term (get_sort (Syntax.raw_term_sorts tm)) I tm) 
schirmer@14700
   615
      val tsig = Sign.tsig_of sg
schirmer@14700
   616
schirmer@14700
   617
      fun mk_type_abbr subst name alphas = 
wenzelm@14854
   618
          let val abbrT = Type (name, map (fn a => TVar ((a, 0), [])) alphas);
schirmer@14700
   619
          in Syntax.term_of_typ (! Syntax.show_sorts) (Envir.norm_type subst abbrT) end;    
schirmer@14700
   620
schirmer@14700
   621
      fun unify rT T = fst (Type.unify tsig (Vartab.empty,0) (Type.varifyT rT,T))
schirmer@14700
   622
schirmer@14700
   623
   in if !print_record_type_abbr
schirmer@14700
   624
      then (case last_extT T of
schirmer@14700
   625
             Some (name,_) 
schirmer@14700
   626
              => if name = lastExt 
schirmer@14700
   627
                 then
schirmer@14700
   628
		  (let val subst = unify schemeT T 
schirmer@14700
   629
                   in 
schirmer@14700
   630
                    if HOLogic.is_unitT (Envir.norm_type subst (TVar((zeta,0),Sign.defaultS sg)))
schirmer@14700
   631
                    then mk_type_abbr subst abbr alphas
schirmer@14700
   632
                    else mk_type_abbr subst (suffix schemeN abbr) (alphas@[zeta])
schirmer@14700
   633
		   end handle TUNIFY => default_tr' sg tm)
schirmer@14700
   634
                 else raise Match (* give print translation of specialised record a chance *)
schirmer@14700
   635
            | _ => raise Match)
schirmer@14700
   636
       else default_tr' sg tm
schirmer@14700
   637
  end
schirmer@14700
   638
schirmer@14700
   639
fun record_type_tr' sep mark record record_scheme sg t =
schirmer@14700
   640
  let
schirmer@14700
   641
    fun get_sort xs n = (case assoc (xs,n) of 
schirmer@14700
   642
                             Some s => s 
schirmer@14700
   643
                           | None => Sign.defaultS sg);
schirmer@14700
   644
schirmer@14700
   645
    val T = Sign.intern_typ sg (Syntax.typ_of_term (get_sort (Syntax.raw_term_sorts t)) I t)
schirmer@14700
   646
schirmer@14700
   647
    val tsig = Sign.tsig_of sg
schirmer@14700
   648
    fun unify (t,v) = Type.unify tsig v t;
schirmer@14700
   649
schirmer@14700
   650
    fun term_of_type T = Syntax.term_of_typ (!Syntax.show_sorts) (Sign.extern_typ sg T);
schirmer@14700
   651
 
schirmer@14700
   652
    fun field_lst T =
schirmer@14700
   653
      (case T of
schirmer@14700
   654
        Type (ext,args) 
schirmer@14700
   655
         => (case try (unsuffix ext_typeN) ext of
schirmer@14700
   656
               Some ext' 
schirmer@14700
   657
               => (case get_extfields sg ext' of
schirmer@14700
   658
                     Some flds 
schirmer@14700
   659
                     => (case get_fieldext sg (fst (hd flds)) of
schirmer@14700
   660
                           Some (_,alphas) 
schirmer@14700
   661
                           => (let
schirmer@14700
   662
                                val (f::fs) = but_last flds;
schirmer@14700
   663
                                val flds' = apfst (Sign.extern sg Sign.constK) f
schirmer@14700
   664
                                            ::map (apfst NameSpace.base) fs; 
schirmer@14700
   665
                                val (args',more) = split_last args; 
schirmer@14700
   666
                                val alphavars = map Type.varifyT (but_last alphas); 
schirmer@14700
   667
                                val (subst,_)= foldr unify (alphavars~~args',(Vartab.empty,0));
schirmer@14700
   668
                                val flds'' =map (apsnd ((Envir.norm_type subst)o(Type.varifyT)))
schirmer@14700
   669
                                                flds';
schirmer@14700
   670
                              in flds''@field_lst more end
schirmer@14700
   671
                              handle TUNIFY => [("",T)] 
schirmer@14700
   672
                                   | LIST _=> [("",T)])
schirmer@14700
   673
                         | None => [("",T)])
schirmer@14700
   674
                   | None => [("",T)])
schirmer@14700
   675
             | None => [("",T)]) 
schirmer@14700
   676
        | _ => [("",T)])
schirmer@14700
   677
schirmer@14700
   678
    val (flds,(_,moreT)) = split_last (field_lst T);
schirmer@14700
   679
    val flds' = map (fn (n,T)=>Syntax.const mark$Syntax.const n$term_of_type T) flds;
schirmer@14700
   680
    val flds'' = foldr1 (fn (x,y) => Syntax.const sep$x$y) flds';
schirmer@14700
   681
schirmer@14700
   682
  in if not (!print_record_type_as_fields) orelse null flds then raise Match
schirmer@14700
   683
     else if moreT = HOLogic.unitT 
schirmer@14700
   684
          then Syntax.const record$flds'' 
schirmer@14700
   685
          else Syntax.const record_scheme$flds''$term_of_type moreT
schirmer@14700
   686
  end
schirmer@14700
   687
    
schirmer@14700
   688
schirmer@14700
   689
fun gen_record_type_tr' name = 
schirmer@14700
   690
  let val name_sfx = suffix ext_typeN name;
schirmer@14700
   691
      fun tr' sg ts = record_type_tr' "_field_types" "_field_type" 
schirmer@14700
   692
                       "_record_type" "_record_type_scheme" sg 
schirmer@14700
   693
                       (list_comb (Syntax.const name_sfx,ts))
schirmer@14700
   694
  in (name_sfx,tr')
schirmer@14700
   695
  end
schirmer@14700
   696
schirmer@14700
   697
     
schirmer@14700
   698
fun gen_record_type_abbr_tr' abbr alphas zeta lastExt schemeT name =
schirmer@14700
   699
  let val name_sfx = suffix ext_typeN name;
schirmer@14700
   700
      val default_tr' = record_type_tr' "_field_types" "_field_type" 
schirmer@14700
   701
                               "_record_type" "_record_type_scheme" 
schirmer@14700
   702
      fun tr' sg ts = record_type_abbr_tr' default_tr' abbr alphas zeta lastExt schemeT sg
schirmer@14700
   703
                         (list_comb (Syntax.const name_sfx,ts))
schirmer@14700
   704
  in (name_sfx, tr') end;
schirmer@14700
   705
schirmer@14358
   706
schirmer@14255
   707
(** record simprocs **)
schirmer@14255
   708
fun quick_and_dirty_prove sg xs asms prop tac =
schirmer@14255
   709
Tactic.prove sg xs asms prop
schirmer@14700
   710
    (if !quick_and_dirty then (K (SkipProof.cheat_tac HOL.thy)) else tac);
wenzelm@4867
   711
schirmer@14255
   712
schirmer@14255
   713
fun prove_split_simp sg T prop =
schirmer@14700
   714
  (case get_splits sg (rec_id T) of
schirmer@14700
   715
     Some (all_thm,_,_,_) 
schirmer@14700
   716
     => let val {sel_upd={simpset,...},...} = RecordsData.get_sg sg;
schirmer@14700
   717
        in (quick_and_dirty_prove sg [] [] prop 
schirmer@14700
   718
           (K (simp_tac (simpset addsimps [all_thm]) 1)))
schirmer@14700
   719
        end
schirmer@14700
   720
   | _ => error "RecordPackage.prove_split_simp:code should never been reached")
wenzelm@7178
   721
schirmer@14255
   722
(* record_simproc *)
schirmer@14255
   723
(* Simplifies selections of an record update:
schirmer@14255
   724
 *  (1)  S (r(|S:=k|)) = k respectively
schirmer@14255
   725
 *  (2)  S (r(|X:=k|)) = S r
schirmer@14255
   726
 * The simproc skips multiple updates at once, eg:
schirmer@14255
   727
 *  S (r (|S:=k,X:=2,Y:=3|)) = k
schirmer@14255
   728
 * But be careful in (2) because of the extendibility of records.
schirmer@14255
   729
 * - If S is a more-selector we have to make sure that the update on component
schirmer@14255
   730
 *   X does not affect the selected subrecord.
schirmer@14255
   731
 * - If X is a more-selector we have to make sure that S is not in the updated
schirmer@14255
   732
 *   subrecord. 
schirmer@14255
   733
 *)
wenzelm@13462
   734
val record_simproc =
wenzelm@13462
   735
  Simplifier.simproc (Theory.sign_of HOL.thy) "record_simp" ["s (u k r)"]
wenzelm@13462
   736
    (fn sg => fn _ => fn t =>
schirmer@14255
   737
      (case t of (sel as Const (s, Type (_,[domS,rangeS]))) $ ((upd as Const (u, _)) $ k $ r) =>
wenzelm@13462
   738
        (case get_selectors sg s of Some () =>
wenzelm@13462
   739
          (case get_updates sg u of Some u_name =>
wenzelm@13462
   740
            let
schirmer@14255
   741
              fun mk_abs_var x t = (x, fastype_of t);
schirmer@14700
   742
              val {sel_upd={updates,...},extfields,...} = RecordsData.get_sg sg;
schirmer@14700
   743
              fun flds T = 
schirmer@14700
   744
                   foldl (fn (xs,(eN,_))=>xs@(map fst (Symtab.lookup_multi (extfields,eN))))
schirmer@14700
   745
                         ([],(dest_recTs T));
schirmer@14255
   746
              fun mk_eq_terms ((upd as Const (u,Type(_,[updT,_]))) $ k $ r) =
schirmer@14255
   747
		  (case (Symtab.lookup (updates,u)) of
schirmer@14255
   748
                     None => None
schirmer@14255
   749
                   | Some u_name 
schirmer@14255
   750
                     => if u_name = s
schirmer@14255
   751
                        then let 
schirmer@14255
   752
                               val rv = mk_abs_var "r" r
schirmer@14255
   753
                               val rb = Bound 0
schirmer@14255
   754
                               val kv = mk_abs_var "k" k
schirmer@14255
   755
                               val kb = Bound 1 
schirmer@14255
   756
                             in Some (upd$kb$rb,kb,[kv,rv],true) end
schirmer@14700
   757
                        else if u_name mem (flds rangeS)
schirmer@14700
   758
                             orelse s mem (flds updT)
schirmer@14255
   759
                             then None
schirmer@14255
   760
			     else (case mk_eq_terms r of 
schirmer@14255
   761
                                     Some (trm,trm',vars,update_s) 
schirmer@14255
   762
                                     => let   
schirmer@14255
   763
					  val kv = mk_abs_var "k" k
schirmer@14255
   764
                                          val kb = Bound (length vars)
schirmer@14255
   765
		                        in Some (upd$kb$trm,trm',kv::vars,update_s) end
schirmer@14255
   766
                                   | None
schirmer@14255
   767
                                     => let 
schirmer@14255
   768
					  val rv = mk_abs_var "r" r
schirmer@14255
   769
                                          val rb = Bound 0
schirmer@14255
   770
                                          val kv = mk_abs_var "k" k
schirmer@14255
   771
                                          val kb = Bound 1 
schirmer@14255
   772
                                        in Some (upd$kb$rb,rb,[kv,rv],false) end))
schirmer@14255
   773
                | mk_eq_terms r = None     
wenzelm@13462
   774
            in
schirmer@14255
   775
	      (case mk_eq_terms (upd$k$r) of
schirmer@14255
   776
                 Some (trm,trm',vars,update_s) 
schirmer@14255
   777
                 => if update_s 
schirmer@14255
   778
		    then Some (prove_split_simp sg domS 
schirmer@14255
   779
                                 (list_all(vars,(Logic.mk_equals (sel$trm,trm')))))
schirmer@14255
   780
                    else Some (prove_split_simp sg domS 
schirmer@14255
   781
                                 (list_all(vars,(Logic.mk_equals (sel$trm,sel$trm')))))
schirmer@14255
   782
               | None => None)
wenzelm@13462
   783
            end
wenzelm@13462
   784
          | None => None)
wenzelm@13462
   785
        | None => None)
wenzelm@13462
   786
      | _ => None));
wenzelm@7178
   787
schirmer@14255
   788
(* record_eq_simproc *)
schirmer@14255
   789
(* looks up the most specific record-equality.
schirmer@14255
   790
 * Note on efficiency:
schirmer@14255
   791
 * Testing equality of records boils down to the test of equality of all components.
schirmer@14255
   792
 * Therefore the complexity is: #components * complexity for single component.
schirmer@14255
   793
 * Especially if a record has a lot of components it may be better to split up
schirmer@14255
   794
 * the record first and do simplification on that (record_split_simp_tac).
schirmer@14255
   795
 * e.g. r(|lots of updates|) = x
schirmer@14255
   796
 *
schirmer@14700
   797
 *               record_eq_simproc       record_split_simp_tac
schirmer@14255
   798
 * Complexity: #components * #updates     #updates   
schirmer@14255
   799
 *           
schirmer@14255
   800
 *)
berghofe@14079
   801
val record_eq_simproc =
berghofe@14079
   802
  Simplifier.simproc (Theory.sign_of HOL.thy) "record_eq_simp" ["r = s"]
berghofe@14079
   803
    (fn sg => fn _ => fn t =>
berghofe@14079
   804
      (case t of Const ("op =", Type (_, [T, _])) $ _ $ _ =>
schirmer@14700
   805
        (case rec_id T of
schirmer@14700
   806
           "" => None
schirmer@14700
   807
         | name => (case get_equalities sg name of
schirmer@14255
   808
                                None => None
schirmer@14255
   809
                              | Some thm => Some (thm RS Eq_TrueI)))
berghofe@14079
   810
       | _ => None));
berghofe@14079
   811
wenzelm@7178
   812
schirmer@14255
   813
(* record_upd_simproc *)
schirmer@14255
   814
(* simplify multiple updates; for example: "r(|M:=3,N:=1,M:=2,N:=4|) == r(|M:=2,N:=4|)" *)
schirmer@14255
   815
val record_upd_simproc =
schirmer@14255
   816
  Simplifier.simproc (Theory.sign_of HOL.thy) "record_upd_simp" ["(u1 k1 (u2 k2 r))"]
schirmer@14255
   817
    (fn sg => fn _ => fn t =>
schirmer@14255
   818
      (case t of ((upd as Const (u, Type(_,[_,Type(_,[T,_])]))) $ k $ r) =>
schirmer@14255
   819
 	 let val {sel_upd={updates,...},...} = RecordsData.get_sg sg;
schirmer@14255
   820
	     fun mk_abs_var x t = (x, fastype_of t);
schirmer@14255
   821
schirmer@14255
   822
             fun mk_updterm upds already ((upd as Const (u,_)) $ k $ r) =
schirmer@14255
   823
		 if is_some (Symtab.lookup (upds,u))
schirmer@14255
   824
		 then let 
schirmer@14255
   825
			 fun rest already = mk_updterm upds already
schirmer@14255
   826
		      in if is_some (Symtab.lookup (already,u)) 
schirmer@14255
   827
			 then (case (rest already r) of
schirmer@14255
   828
				 None => let 
schirmer@14255
   829
				           val rv = mk_abs_var "r" r
schirmer@14255
   830
                                           val rb = Bound 0
schirmer@14255
   831
					   val kv = mk_abs_var "k" k
schirmer@14255
   832
                                           val kb = Bound 1	      
schirmer@14255
   833
                                         in Some (upd$kb$rb,rb,[kv,rv]) end
schirmer@14255
   834
                               | Some (trm,trm',vars) 
schirmer@14255
   835
				 => let 
schirmer@14255
   836
				     val kv = mk_abs_var "k" k
schirmer@14255
   837
                                     val kb = Bound (length vars)
schirmer@14255
   838
                                    in Some (upd$kb$trm,trm',kv::vars) end)
schirmer@14255
   839
	                 else (case rest (Symtab.update ((u,()),already)) r of 
schirmer@14255
   840
				 None => None
schirmer@14255
   841
		               | Some (trm,trm',vars) 
schirmer@14255
   842
                                  => let
schirmer@14255
   843
				      val kv = mk_abs_var "k" k
schirmer@14255
   844
                                      val kb = Bound (length vars)
schirmer@14255
   845
                                     in Some (upd$kb$trm,upd$kb$trm',kv::vars) end)
schirmer@14255
   846
		     end
schirmer@14255
   847
		 else None
schirmer@14255
   848
	       | mk_updterm _ _ _ = None;
schirmer@14255
   849
schirmer@14255
   850
	 in (case mk_updterm updates Symtab.empty t of
schirmer@14255
   851
	       Some (trm,trm',vars)
schirmer@14700
   852
                => Some (prove_split_simp sg T  
schirmer@14700
   853
                          (list_all(vars,(Logic.mk_equals (trm,trm')))))
schirmer@14255
   854
             | None => None)
schirmer@14255
   855
	 end
schirmer@14255
   856
       | _ => None));
schirmer@14255
   857
schirmer@14255
   858
(* record_split_simproc *)
schirmer@14255
   859
(* splits quantified occurrences of records, for which P holds. P can peek on the 
schirmer@14255
   860
 * subterm starting at the quantified occurrence of the record (including the quantifier)
schirmer@14255
   861
 *)
schirmer@14255
   862
fun record_split_simproc P =
schirmer@14255
   863
  Simplifier.simproc (Theory.sign_of HOL.thy) "record_split_simp" ["(a t)"]
schirmer@14255
   864
    (fn sg => fn _ => fn t =>
schirmer@14255
   865
      (case t of (Const (quantifier, Type (_, [Type (_, [T, _]), _])))$trm =>
schirmer@14255
   866
         if quantifier = "All" orelse quantifier = "all" orelse quantifier = "Ex"
schirmer@14700
   867
         then (case rec_id T of
schirmer@14700
   868
                 "" => None
schirmer@14700
   869
               | name
schirmer@14255
   870
                  => if P t 
schirmer@14255
   871
                     then (case get_splits sg name of
schirmer@14255
   872
                             None => None
schirmer@14255
   873
                           | Some (all_thm, All_thm, Ex_thm,_) 
schirmer@14255
   874
                              => Some (case quantifier of
schirmer@14255
   875
                                         "all" => all_thm
schirmer@14255
   876
                                       | "All" => All_thm RS HOL.eq_reflection
schirmer@14255
   877
                                       | "Ex"  => Ex_thm RS HOL.eq_reflection
schirmer@14255
   878
                                       | _     => error "record_split_simproc"))
schirmer@14255
   879
                     else None)
schirmer@14255
   880
         else None
schirmer@14255
   881
       | _ => None))
wenzelm@7178
   882
schirmer@14427
   883
(* record_ex_sel_eq_simproc *)
schirmer@14700
   884
(* simplifies: (EX s. x = sel s) resp. (EX s. sel s = x) to True *) 
schirmer@14427
   885
val record_ex_sel_eq_simproc =
schirmer@14427
   886
  Simplifier.simproc (Theory.sign_of HOL.thy) "record_ex_sel_eq_simproc" ["Ex t"]
schirmer@14427
   887
    (fn sg => fn _ => fn t =>
schirmer@14427
   888
       let fun prove prop = (quick_and_dirty_prove sg [] [] prop 
schirmer@14427
   889
                             (fn _ => (simp_tac ((get_simpset sg) addsimps simp_thms
schirmer@14427
   890
                                       addsimprocs [record_split_simproc (K true)]) 1)));
schirmer@14427
   891
       in     
schirmer@14427
   892
         (case t of 
schirmer@14700
   893
           (Const ("Ex",Tex)$Abs(s,T,Const ("op =",Teq)$(Const (sel,Tsel)$Bound 0)$X)) =>
schirmer@14427
   894
             (case get_selectors sg sel of Some () =>
schirmer@14427
   895
                let 
schirmer@14427
   896
                  val X' = ("x",range_type Tsel);
schirmer@14427
   897
		  val prop = list_all ([X'], 
schirmer@14427
   898
                               Logic.mk_equals
schirmer@14700
   899
		                 (Const ("Ex",Tex)$Abs(s,T,Const ("op =",Teq)$
schirmer@14427
   900
                                                      (Const (sel,Tsel)$Bound 0)$Bound 1),
schirmer@14427
   901
                                  Const ("True",HOLogic.boolT)));
schirmer@14427
   902
                in Some (prove prop) end
schirmer@14427
   903
              | None => None)
schirmer@14700
   904
          |(Const ("Ex",Tex)$Abs(s,T,Const ("op =",Teq)$X$(Const (sel,Tsel)$Bound 0))) =>
schirmer@14427
   905
             (case get_selectors sg sel of Some () =>
schirmer@14427
   906
                let 
schirmer@14427
   907
                  val X' = ("x",range_type Tsel);
schirmer@14427
   908
		  val prop = list_all ([X'], 
schirmer@14427
   909
                               Logic.mk_equals
schirmer@14700
   910
		                 (Const ("Ex",Tex)$Abs(s,T,Const ("op =",Teq)$
schirmer@14427
   911
                                                     Bound 1$(Const (sel,Tsel)$Bound 0)),
schirmer@14427
   912
                                  Const ("True",HOLogic.boolT)));
schirmer@14427
   913
                in Some (prove prop) end 
schirmer@14427
   914
            | None => None)
schirmer@14427
   915
          | _ => None)
schirmer@14427
   916
         end)
schirmer@14427
   917
wenzelm@5698
   918
schirmer@14700
   919
    
wenzelm@6358
   920
schirmer@14255
   921
local
schirmer@14255
   922
val inductive_atomize = thms "induct_atomize";
schirmer@14255
   923
val inductive_rulify1 = thms "induct_rulify1";
schirmer@14255
   924
in
schirmer@14255
   925
(* record_split_simp_tac *)
schirmer@14255
   926
(* splits (and simplifies) all records in the goal for which P holds. 
schirmer@14255
   927
 * For quantified occurrences of a record
schirmer@14255
   928
 * P can peek on the whole subterm (including the quantifier); for free variables P
schirmer@14255
   929
 * can only peek on the variable itself. 
schirmer@14255
   930
 *)
schirmer@14255
   931
fun record_split_simp_tac P i st =
schirmer@14255
   932
  let
schirmer@14255
   933
    val sg = Thm.sign_of_thm st;
schirmer@14700
   934
    val {sel_upd={simpset,...},...} 
schirmer@14255
   935
            = RecordsData.get_sg sg;
schirmer@14255
   936
schirmer@14700
   937
    val has_rec = exists_Const
schirmer@14255
   938
      (fn (s, Type (_, [Type (_, [T, _]), _])) =>
schirmer@14700
   939
          (s = "all" orelse s = "All" orelse s = "Ex") andalso is_recT T 
schirmer@14255
   940
        | _ => false);
schirmer@14255
   941
schirmer@14255
   942
    val goal = Library.nth_elem (i - 1, Thm.prems_of st);
schirmer@14700
   943
    val frees = filter (is_recT o type_of) (term_frees goal);
schirmer@14255
   944
schirmer@14255
   945
    fun mk_split_free_tac free induct_thm i = 
schirmer@14255
   946
	let val cfree = cterm_of sg free;
schirmer@14255
   947
            val (_$(_$r)) = concl_of induct_thm;
schirmer@14255
   948
            val crec = cterm_of sg r;
schirmer@14255
   949
            val thm  = cterm_instantiate [(crec,cfree)] induct_thm;
schirmer@14255
   950
        in EVERY [simp_tac (HOL_basic_ss addsimps inductive_atomize) i,
schirmer@14255
   951
                  rtac thm i,
schirmer@14255
   952
                  simp_tac (HOL_basic_ss addsimps inductive_rulify1) i]
schirmer@14255
   953
	end;
schirmer@14255
   954
schirmer@14255
   955
    fun split_free_tac P i (free as Free (n,T)) = 
schirmer@14700
   956
	(case rec_id T of
schirmer@14700
   957
           "" => None
schirmer@14700
   958
         | name => if P free 
schirmer@14700
   959
                   then (case get_splits sg name of
schirmer@14700
   960
                           None => None
schirmer@14700
   961
                         | Some (_,_,_,induct_thm)
schirmer@14700
   962
                             => Some (mk_split_free_tac free induct_thm i))
schirmer@14700
   963
                   else None)
schirmer@14255
   964
     | split_free_tac _ _ _ = None;
schirmer@14255
   965
schirmer@14255
   966
    val split_frees_tacs = mapfilter (split_free_tac P i) frees;
schirmer@14255
   967
   
schirmer@14700
   968
    val simprocs = if has_rec goal then [record_split_simproc P] else [];
schirmer@14255
   969
   
schirmer@14255
   970
  in st |> (EVERY split_frees_tacs) 
schirmer@14255
   971
           THEN (Simplifier.full_simp_tac (simpset addsimprocs simprocs) i)
schirmer@14255
   972
  end handle Library.LIST _ => Seq.empty;
schirmer@14255
   973
end;
schirmer@14255
   974
schirmer@14700
   975
schirmer@14700
   976
(* record_split_tac *)
schirmer@14700
   977
(* splits all records in the goal, which are quantified by ! or !!. *)
schirmer@14700
   978
fun record_split_tac i st =
schirmer@14700
   979
  let
schirmer@14700
   980
    val sg = Thm.sign_of_thm st;
schirmer@14700
   981
schirmer@14700
   982
    val has_rec = exists_Const
schirmer@14700
   983
      (fn (s, Type (_, [Type (_, [T, _]), _])) =>
schirmer@14700
   984
          (s = "all" orelse s = "All") andalso is_recT T 
schirmer@14700
   985
        | _ => false);
schirmer@14700
   986
 
schirmer@14700
   987
    val goal = Library.nth_elem (i - 1, Thm.prems_of st);   
schirmer@14700
   988
schirmer@14700
   989
    fun is_all t =
schirmer@14700
   990
      (case t of (Const (quantifier, _)$_) =>
schirmer@14700
   991
         quantifier = "All" orelse quantifier = "all"
schirmer@14700
   992
       | _ => false);
schirmer@14700
   993
 
schirmer@14700
   994
  in if has_rec goal 
schirmer@14700
   995
     then Simplifier.full_simp_tac 
schirmer@14700
   996
           (HOL_basic_ss addsimprocs [record_split_simproc is_all]) i st 
schirmer@14700
   997
     else Seq.empty
schirmer@14700
   998
  end handle Library.LIST _ => Seq.empty;
schirmer@14700
   999
wenzelm@6358
  1000
(* wrapper *)
wenzelm@6358
  1001
wenzelm@5707
  1002
val record_split_name = "record_split_tac";
wenzelm@5707
  1003
val record_split_wrapper = (record_split_name, fn tac => record_split_tac ORELSE' tac);
wenzelm@5698
  1004
wenzelm@4867
  1005
(** theory extender interface **)
wenzelm@4867
  1006
wenzelm@4867
  1007
(* prepare arguments *)
wenzelm@4867
  1008
wenzelm@4894
  1009
(*note: read_raw_typ avoids expanding type abbreviations*)
wenzelm@4867
  1010
fun read_raw_parent sign s =
wenzelm@4867
  1011
  (case Sign.read_raw_typ (sign, K None) s handle TYPE (msg, _, _) => error msg of
wenzelm@4867
  1012
    Type (name, Ts) => (Ts, name)
wenzelm@4867
  1013
  | _ => error ("Bad parent record specification: " ^ quote s));
wenzelm@4867
  1014
wenzelm@4867
  1015
fun read_typ sign (env, s) =
wenzelm@4867
  1016
  let
wenzelm@5060
  1017
    fun def_sort (x, ~1) = assoc (env, x)
wenzelm@5060
  1018
      | def_sort _ = None;
wenzelm@5060
  1019
    val T = Type.no_tvars (Sign.read_typ (sign, def_sort) s) handle TYPE (msg, _, _) => error msg;
wenzelm@4867
  1020
  in (Term.add_typ_tfrees (T, env), T) end;
wenzelm@4867
  1021
wenzelm@4867
  1022
fun cert_typ sign (env, raw_T) =
wenzelm@4867
  1023
  let val T = Type.no_tvars (Sign.certify_typ sign raw_T) handle TYPE (msg, _, _) => error msg
wenzelm@4867
  1024
  in (Term.add_typ_tfrees (T, env), T) end;
wenzelm@4867
  1025
schirmer@14700
  1026
(* attributes *)
schirmer@14700
  1027
schirmer@14700
  1028
fun case_names_fields x = RuleCases.case_names ["fields"] x;
schirmer@14700
  1029
fun induct_type_global name = [case_names_fields, InductAttrib.induct_type_global name];
schirmer@14700
  1030
fun cases_type_global name = [case_names_fields, InductAttrib.cases_type_global name];
schirmer@14700
  1031
schirmer@14700
  1032
(* tactics *)
schirmer@14700
  1033
schirmer@14700
  1034
fun simp_all_tac ss simps = ALLGOALS (Simplifier.asm_full_simp_tac (ss addsimps simps));
schirmer@14700
  1035
schirmer@14700
  1036
(* do case analysis / induction according to rule on last parameter of ith subgoal 
schirmer@14700
  1037
 * (or on s if there are no parameters); 
schirmer@14700
  1038
 * Instatiation of record variable (and predicate) in rule is calculated to
schirmer@14700
  1039
 * avoid problems with higher order unification. 
schirmer@14700
  1040
 *)
schirmer@14700
  1041
schirmer@14700
  1042
fun try_param_tac s rule i st =
schirmer@14700
  1043
  let
schirmer@14700
  1044
    val cert = cterm_of (Thm.sign_of_thm st);
schirmer@14700
  1045
    val g = nth_elem (i - 1, prems_of st);
schirmer@14700
  1046
    val params = Logic.strip_params g;
schirmer@14700
  1047
    val concl = HOLogic.dest_Trueprop (Logic.strip_assums_concl g);
schirmer@14700
  1048
    val rule' = Thm.lift_rule (st, i) rule;
schirmer@14700
  1049
    val (P, ys) = strip_comb (HOLogic.dest_Trueprop
schirmer@14700
  1050
      (Logic.strip_assums_concl (prop_of rule')));
schirmer@14700
  1051
    (* ca indicates if rule is a case analysis or induction rule *)
schirmer@14700
  1052
    val (x, ca) = (case rev (drop (length params, ys)) of
schirmer@14700
  1053
        [] => (head_of (fst (HOLogic.dest_eq (HOLogic.dest_Trueprop
schirmer@14700
  1054
          (hd (rev (Logic.strip_assums_hyp (hd (prems_of rule')))))))), true)
schirmer@14700
  1055
      | [x] => (head_of x, false));
schirmer@14700
  1056
    val rule'' = cterm_instantiate (map (pairself cert) (case (rev params) of
schirmer@14700
  1057
        [] => (case assoc (map dest_Free (term_frees (prop_of st)), s) of
schirmer@14700
  1058
          None => sys_error "try_param_tac: no such variable"
schirmer@14700
  1059
        | Some T => [(P, if ca then concl else lambda (Free (s, T)) concl),
schirmer@14700
  1060
            (x, Free (s, T))])
schirmer@14700
  1061
      | (_, T) :: _ => [(P, list_abs (params, if ca then concl
schirmer@14700
  1062
          else incr_boundvars 1 (Abs (s, T, concl)))),
schirmer@14700
  1063
        (x, list_abs (params, Bound 0))])) rule'
schirmer@14700
  1064
  in compose_tac (false, rule'', nprems_of rule) i st end;
schirmer@14700
  1065
schirmer@14700
  1066
fun extension_typedef name repT alphas thy =
schirmer@14700
  1067
  let
schirmer@14700
  1068
    val UNIV = HOLogic.mk_UNIV repT;
schirmer@14700
  1069
schirmer@14700
  1070
    val (thy',{set_def=Some def, Abs_induct = abs_induct, 
schirmer@14700
  1071
               Abs_inject=abs_inject, Abs_inverse = abs_inverse,...}) =
schirmer@14700
  1072
        thy |> setmp TypedefPackage.quiet_mode true
schirmer@14700
  1073
           (TypedefPackage.add_typedef_i true None
schirmer@14700
  1074
             (suffix ext_typeN (Sign.base_name name), alphas, Syntax.NoSyn) UNIV None
schirmer@14700
  1075
             (Tactic.rtac UNIV_witness 1))
schirmer@14700
  1076
    val rewrite_rule = Tactic.rewrite_rule [def, rec_UNIV_I, rec_True_simp];
schirmer@14700
  1077
  in (thy',map rewrite_rule [abs_inject, abs_inverse, abs_induct])
schirmer@14700
  1078
  end;
schirmer@14700
  1079
schirmer@14700
  1080
fun extension_definition full name fields names alphas zeta moreT more vars thy = 
schirmer@14700
  1081
  let  
schirmer@14700
  1082
    val base = Sign.base_name;
schirmer@14700
  1083
schirmer@14700
  1084
    val fieldTs = (map snd fields);
schirmer@14700
  1085
    val alphas_zetaTs = map (fn n => TFree (n, HOLogic.typeS)) (alphas@[zeta]);
schirmer@14700
  1086
    val extT_name = suffix ext_typeN name
schirmer@14700
  1087
    val extT = Type (extT_name, alphas_zetaTs);
schirmer@14700
  1088
    val repT = foldr1 HOLogic.mk_prodT (fieldTs@[moreT]);
schirmer@14700
  1089
    val fields_more = fields@[(full moreN,moreT)];
schirmer@14700
  1090
    val bfields_more = map (apfst base) fields_more;
schirmer@14700
  1091
    val r = Free (rN,extT)
schirmer@14700
  1092
    val len = length fields;
schirmer@14700
  1093
    val idxms = 0 upto len;
schirmer@14700
  1094
schirmer@14700
  1095
    (* prepare declarations and definitions *)
schirmer@14700
  1096
    
schirmer@14700
  1097
    (*fields constructor*)
schirmer@14700
  1098
    val ext_decl = (mk_extC (name,extT) (fieldTs@[moreT]));     
schirmer@14700
  1099
    val ext_spec = Const ext_decl :== 
schirmer@14700
  1100
         (foldr (uncurry lambda) 
schirmer@14700
  1101
            (vars@[more],(mk_Abs name repT extT $ (foldr1 HOLogic.mk_prod (vars@[more]))))) 
schirmer@14700
  1102
    
schirmer@14700
  1103
    (*destructors*) 
schirmer@14700
  1104
    val dest_decls = map (mk_selC extT o (apfst (suffix ext_dest))) bfields_more;
schirmer@14700
  1105
schirmer@14700
  1106
    fun mk_dest_spec (i, (c,T)) =
schirmer@14700
  1107
      let val snds = (funpow i HOLogic.mk_snd (mk_Rep name repT extT $ r))
schirmer@14700
  1108
      in Const (mk_selC extT (suffix ext_dest c,T))
schirmer@14700
  1109
         :== (lambda r (if i=len then snds else HOLogic.mk_fst snds))
schirmer@14700
  1110
      end;
schirmer@14700
  1111
    val dest_specs =
schirmer@14700
  1112
      ListPair.map mk_dest_spec (idxms, fields_more);
schirmer@14700
  1113
schirmer@14700
  1114
    (* code generator data *)
schirmer@14700
  1115
        (* Representation as nested pairs is revealed for codegeneration *)
schirmer@14709
  1116
    val [rep_code,abs_code] = map (Codegen.parse_mixfix (K (Bound 0))) ["(_)","(_)"];
schirmer@14709
  1117
    val ext_type_code = Codegen.parse_mixfix (K dummyT) "(_)";
schirmer@14700
  1118
    
schirmer@14700
  1119
    (* 1st stage: defs_thy *)
schirmer@14700
  1120
    val (defs_thy, ([abs_inject, abs_inverse, abs_induct],ext_def::dest_defs)) =
schirmer@14700
  1121
        thy 
schirmer@14700
  1122
        |> extension_typedef name repT (alphas@[zeta])
schirmer@14700
  1123
        |>> Codegen.assoc_consts_i 
schirmer@14700
  1124
               [(mk_AbsN name,None,abs_code),
schirmer@14700
  1125
                (mk_RepN name,None,rep_code)]
schirmer@14700
  1126
        |>> Codegen.assoc_types [(extT_name,ext_type_code)]
schirmer@14700
  1127
        |>> Theory.add_consts_i (map Syntax.no_syn ((apfst base ext_decl)::dest_decls))
schirmer@14700
  1128
        |>>> PureThy.add_defs_i false (map Thm.no_attributes (ext_spec::dest_specs))
schirmer@14700
  1129
schirmer@14700
  1130
    
schirmer@14700
  1131
    (* prepare propositions *)
schirmer@14700
  1132
schirmer@14700
  1133
    val vars_more = vars@[more];
schirmer@14700
  1134
    val named_vars_more = (names@[full moreN])~~vars_more;
schirmer@14700
  1135
    val ext = list_comb (Const ext_decl,vars_more);
schirmer@14700
  1136
    val s     = Free (rN, extT);
schirmer@14700
  1137
    val P = Free (variant (map (fn (Free (x,_))=>x) vars_more) "P", extT-->HOLogic.boolT);
schirmer@14700
  1138
    val C = Free (variant (map (fn (Free (x,_))=>x) vars_more) "C", HOLogic.boolT);
schirmer@14700
  1139
schirmer@14700
  1140
    val inject_prop =
schirmer@14700
  1141
      let val vars_more' = map (fn (Free (x,T)) => Free (x ^ "'",T)) vars_more;
schirmer@14700
  1142
      in All (map dest_Free (vars_more@vars_more')) 
schirmer@14700
  1143
          ((HOLogic.eq_const extT $ 
schirmer@14700
  1144
            list_comb (Const ext_decl,vars_more)$list_comb (Const ext_decl,vars_more')) 
schirmer@14700
  1145
           ===
schirmer@14700
  1146
           foldr1 HOLogic.mk_conj (map HOLogic.mk_eq (vars_more ~~ vars_more')))
schirmer@14700
  1147
      end;
schirmer@14700
  1148
schirmer@14700
  1149
    val induct_prop =
schirmer@14700
  1150
      All (map dest_Free vars_more) (Trueprop (P $ ext)) ==> Trueprop (P $ s);
schirmer@14700
  1151
     
schirmer@14700
  1152
    val cases_prop =
schirmer@14700
  1153
      (All (map dest_Free vars_more) 
schirmer@14700
  1154
        (Trueprop (HOLogic.mk_eq (s,ext)) ==> Trueprop C)) 
schirmer@14700
  1155
      ==> Trueprop C;
schirmer@14700
  1156
schirmer@14700
  1157
    (*destructors*) 
schirmer@14700
  1158
    val dest_conv_props =
schirmer@14700
  1159
       map (fn (c, x as Free (_,T)) => mk_sel ext (suffix ext_dest c,T) === x) named_vars_more;
schirmer@14700
  1160
schirmer@14700
  1161
    val prove_standard = Tactic.prove_standard (Theory.sign_of defs_thy);
schirmer@14700
  1162
    fun prove_simp simps =
schirmer@14700
  1163
      let val tac = simp_all_tac HOL_ss simps
schirmer@14700
  1164
      in fn prop => prove_standard [] [] prop (K tac) end;
schirmer@14700
  1165
    
schirmer@14700
  1166
    (* prove propositions *)
schirmer@14700
  1167
schirmer@14700
  1168
    val inject = (prove_simp [ext_def,abs_inject,Pair_eq] inject_prop);
schirmer@14700
  1169
schirmer@14700
  1170
    val induct =
schirmer@14700
  1171
        prove_standard [] [] induct_prop (fn prems =>
schirmer@14700
  1172
         EVERY [try_param_tac rN abs_induct 1, 
schirmer@14700
  1173
                asm_full_simp_tac (HOL_ss addsimps [ext_def,split_paired_all]) 1]);
schirmer@14700
  1174
schirmer@14700
  1175
    val cases =
schirmer@14700
  1176
        prove_standard [] [] cases_prop (fn prems =>
schirmer@14700
  1177
         EVERY [asm_full_simp_tac (HOL_basic_ss addsimps [atomize_all, atomize_imp]) 1,
schirmer@14700
  1178
                try_param_tac rN induct 1,
schirmer@14700
  1179
                rtac impI 1,
schirmer@14700
  1180
                REPEAT (etac allE 1),
schirmer@14700
  1181
                etac mp 1,
schirmer@14700
  1182
                rtac refl 1])
schirmer@14700
  1183
	
schirmer@14700
  1184
    val dest_convs = map (prove_simp 
schirmer@14700
  1185
                           ([ext_def,abs_inverse]@Pair_sel_convs@dest_defs)) dest_conv_props;
schirmer@14700
  1186
    
schirmer@14700
  1187
    val (thm_thy,([inject',induct',cases'],[dest_convs'])) =
schirmer@14700
  1188
      defs_thy 
schirmer@14700
  1189
      |> (PureThy.add_thms o map Thm.no_attributes) 
schirmer@14700
  1190
           [("ext_inject", inject),
schirmer@14700
  1191
            ("ext_induct", induct),
schirmer@14700
  1192
            ("ext_cases", cases)]
schirmer@14700
  1193
      |>>> (PureThy.add_thmss o map Thm.no_attributes)
schirmer@14700
  1194
              [("dest_convs",dest_convs)] 
schirmer@14700
  1195
schirmer@14700
  1196
  in (thm_thy,extT,induct',inject',dest_convs')
schirmer@14700
  1197
  end;
schirmer@14700
  1198
   
schirmer@14700
  1199
fun chunks []      []   = []
schirmer@14700
  1200
  | chunks []      xs   = [xs]
schirmer@14700
  1201
  | chunks (l::ls) xs  = take (l,xs)::chunks ls (drop (l,xs));
schirmer@14700
  1202
 
schirmer@14700
  1203
fun chop_last [] = error "last: list should not be empty"
schirmer@14700
  1204
  | chop_last [x] = ([],x)
schirmer@14700
  1205
  | chop_last (x::xs) = let val (tl,l) = chop_last xs in (x::tl,l) end;
schirmer@14700
  1206
     	
schirmer@14700
  1207
fun subst_last s []      = error "subst_last: list should not be empty"
schirmer@14700
  1208
  | subst_last s ([x])   = [s]
schirmer@14700
  1209
  | subst_last s (x::xs) = (x::subst_last s xs);
schirmer@14700
  1210
schirmer@14700
  1211
(* mk_recordT builds up the record type from the current extension tpye extT and a list
schirmer@14700
  1212
 * of parent extensions, starting with the root of the record hierarchy 
schirmer@14700
  1213
*) 
schirmer@14700
  1214
fun mk_recordT extT parent_exts = 
schirmer@14700
  1215
    foldr (fn ((parent,Ts),T) => Type (parent, subst_last T Ts)) (parent_exts,extT);
schirmer@14700
  1216
schirmer@14700
  1217
(* record_definition *)
schirmer@14702
  1218
fun record_definition (args, bname) parent (parents: parent_info list) raw_fields thy = 
schirmer@14702
  1219
  (* smlnj needs type annotation of parents *)
schirmer@14700
  1220
  let
schirmer@14700
  1221
    val sign = Theory.sign_of thy;
schirmer@14700
  1222
schirmer@14700
  1223
    val alphas = map fst args;
schirmer@14700
  1224
    val name = Sign.full_name sign bname;
schirmer@14700
  1225
    val full = Sign.full_name_path sign bname;
schirmer@14700
  1226
    val base = Sign.base_name;
schirmer@14700
  1227
schirmer@14700
  1228
    val (bfields, field_syntax) = split_list (map (fn (x, T, mx) => ((x, T), mx)) raw_fields);
schirmer@14700
  1229
schirmer@14700
  1230
    val parent_fields = flat (map #fields parents);
schirmer@14700
  1231
    val parent_chunks = map (length o #fields) parents;
schirmer@14700
  1232
    val parent_names = map fst parent_fields;
schirmer@14700
  1233
    val parent_types = map snd parent_fields;
schirmer@14700
  1234
    val parent_fields_len = length parent_fields;
schirmer@14700
  1235
    val parent_variants = variantlist (map base parent_names, [moreN, rN, rN ^ "'"]);
schirmer@14700
  1236
    val parent_vars = ListPair.map Free (parent_variants, parent_types);
schirmer@14700
  1237
    val parent_len = length parents;
schirmer@14700
  1238
    val parents_idx = (map #name parents) ~~ (0 upto (parent_len - 1));
schirmer@14700
  1239
schirmer@14700
  1240
    val fields = map (apfst full) bfields;
schirmer@14700
  1241
    val names = map fst fields;
schirmer@14700
  1242
    val extN = full bname;
schirmer@14700
  1243
    val types = map snd fields;
schirmer@14700
  1244
    val alphas_fields = foldr add_typ_tfree_names (types,[]);
schirmer@14700
  1245
    val alphas_ext = alphas inter alphas_fields; 
schirmer@14700
  1246
    val len = length fields;
schirmer@14700
  1247
    val variants = variantlist (map fst bfields, moreN::rN::rN ^ "'"::parent_variants);
schirmer@14700
  1248
    val vars = ListPair.map Free (variants, types);
schirmer@14700
  1249
    val named_vars = names ~~ vars;
schirmer@14700
  1250
    val idxs = 0 upto (len - 1);
schirmer@14700
  1251
    val idxms = 0 upto len;
schirmer@14700
  1252
schirmer@14700
  1253
    val all_fields = parent_fields @ fields;
schirmer@14700
  1254
    val all_names = parent_names @ names;
schirmer@14700
  1255
    val all_types = parent_types @ types;
schirmer@14700
  1256
    val all_len = parent_fields_len + len;
schirmer@14700
  1257
    val all_variants = parent_variants @ variants;
schirmer@14700
  1258
    val all_vars = parent_vars @ vars;
schirmer@14700
  1259
    val all_named_vars = (parent_names ~~ parent_vars) @ named_vars;
schirmer@14700
  1260
schirmer@14700
  1261
schirmer@14700
  1262
    val zeta = variant alphas "'z";
schirmer@14700
  1263
    val moreT = TFree (zeta, HOLogic.typeS);
schirmer@14700
  1264
    val more = Free (moreN, moreT);
schirmer@14700
  1265
    val full_moreN = full moreN;
schirmer@14700
  1266
    val bfields_more = bfields @ [(moreN,moreT)];
schirmer@14700
  1267
    val fields_more = fields @ [(full_moreN,moreT)];
schirmer@14700
  1268
    val vars_more = vars @ [more];
schirmer@14700
  1269
    val named_vars_more = named_vars @[(full_moreN,more)];
schirmer@14700
  1270
    val all_vars_more = all_vars @ [more];
schirmer@14700
  1271
    val all_named_vars_more = all_named_vars @ [(full_moreN,more)];
schirmer@14700
  1272
   
schirmer@14700
  1273
    (* 1st stage: extension_thy *)
schirmer@14700
  1274
	
schirmer@14700
  1275
    val (extension_thy,extT,ext_induct,ext_inject,ext_dest_convs) =
schirmer@14700
  1276
      thy
schirmer@14700
  1277
      |> Theory.add_path bname
schirmer@14700
  1278
      |> extension_definition full extN fields names alphas_ext zeta moreT more vars;
schirmer@14700
  1279
schirmer@14700
  1280
   
schirmer@14700
  1281
    val Type extension_scheme = extT;
schirmer@14700
  1282
    val extension_name = unsuffix ext_typeN (fst extension_scheme);
schirmer@14700
  1283
    val extension = let val (n,Ts) = extension_scheme in (n,subst_last HOLogic.unitT Ts) end; 
schirmer@14700
  1284
    val extension_names = 
schirmer@14700
  1285
         (map ((unsuffix ext_typeN) o fst o #extension) parents) @ [extN];
schirmer@14700
  1286
    val extension_id = foldl (op ^) ("",extension_names);
schirmer@14700
  1287
schirmer@14700
  1288
 
schirmer@14700
  1289
    fun rec_schemeT n = mk_recordT extT (map #extension (prune n parents));
schirmer@14700
  1290
    val rec_schemeT0 = rec_schemeT 0;
schirmer@14700
  1291
schirmer@14700
  1292
    fun recT n = 
schirmer@14700
  1293
      let val (c,Ts) = extension
schirmer@14700
  1294
      in mk_recordT (Type (c,subst_last HOLogic.unitT Ts))(map #extension (prune n parents))
schirmer@14700
  1295
      end;
schirmer@14700
  1296
    val recT0 = recT 0;
schirmer@14700
  1297
    
schirmer@14700
  1298
    fun mk_rec args n =
schirmer@14700
  1299
      let val (args',more) = chop_last args;
schirmer@14700
  1300
	  fun mk_ext' (((name,T),args),more) = mk_ext (name,T) (args@[more]);
schirmer@14700
  1301
          fun build Ts = 
schirmer@14700
  1302
           foldr mk_ext' (prune n (extension_names ~~ Ts ~~ (chunks parent_chunks args')),more) 
schirmer@14700
  1303
      in 
schirmer@14700
  1304
        if more = HOLogic.unit 
schirmer@14700
  1305
        then build (map recT (0 upto parent_len)) 
schirmer@14700
  1306
        else build (map rec_schemeT (0 upto parent_len))
schirmer@14700
  1307
      end;
schirmer@14700
  1308
   
schirmer@14700
  1309
    val r_rec0 = mk_rec all_vars_more 0;
schirmer@14700
  1310
    val r_rec_unit0 = mk_rec (all_vars@[HOLogic.unit]) 0;
schirmer@14700
  1311
schirmer@14700
  1312
    fun r n = Free (rN, rec_schemeT n)
schirmer@14700
  1313
    val r0 = r 0;
schirmer@14700
  1314
    fun r_unit n = Free (rN, recT n)
schirmer@14700
  1315
    val r_unit0 = r_unit 0;
schirmer@14700
  1316
schirmer@14700
  1317
    (* prepare print translation functions *)
schirmer@14700
  1318
    val field_tr's =
schirmer@14700
  1319
      print_translation (distinct (flat (map NameSpace.accesses' (full_moreN :: names))));
schirmer@14700
  1320
schirmer@14700
  1321
    val adv_ext_tr's =
schirmer@14700
  1322
    let
schirmer@14700
  1323
      val trnames = NameSpace.accesses' extN;
schirmer@14700
  1324
    in map (gen_record_tr') trnames end;
schirmer@14700
  1325
schirmer@14700
  1326
    val adv_record_type_abbr_tr's =
schirmer@14700
  1327
      let val trnames = NameSpace.accesses' (hd extension_names);
schirmer@14700
  1328
          val lastExt = (unsuffix ext_typeN (fst extension));
schirmer@14700
  1329
      in map (gen_record_type_abbr_tr' bname alphas zeta lastExt rec_schemeT0) trnames
schirmer@14700
  1330
      end;
schirmer@14700
  1331
schirmer@14700
  1332
    val adv_record_type_tr's =
schirmer@14700
  1333
      let val trnames = if parent_len > 0 then NameSpace.accesses' extN else [];
schirmer@14700
  1334
                        (* avoid conflict with adv_record_type_abbr_tr's *)
schirmer@14700
  1335
      in map (gen_record_type_tr') trnames
schirmer@14700
  1336
      end;
schirmer@14700
  1337
schirmer@14700
  1338
    
schirmer@14700
  1339
    (* prepare declarations *)
schirmer@14700
  1340
schirmer@14700
  1341
    val sel_decls = map (mk_selC rec_schemeT0) bfields_more;
schirmer@14700
  1342
    val upd_decls = map (mk_updC rec_schemeT0) bfields_more;
schirmer@14700
  1343
    val make_decl = (makeN, all_types ---> recT0);
schirmer@14700
  1344
    val fields_decl = (fields_selN, types ---> Type extension); 
schirmer@14700
  1345
    val extend_decl = (extendN, recT0 --> moreT --> rec_schemeT0);
schirmer@14700
  1346
    val truncate_decl = (truncateN, rec_schemeT0 --> recT0);
schirmer@14700
  1347
schirmer@14700
  1348
    (* prepare definitions *)
schirmer@14700
  1349
    
schirmer@14700
  1350
    fun parent_more s = 
schirmer@14700
  1351
         if null parents then s 
schirmer@14700
  1352
         else mk_sel s (NameSpace.append (#name (hd (rev parents))) moreN, extT);
schirmer@14700
  1353
schirmer@14700
  1354
    fun parent_more_upd v s =
schirmer@14700
  1355
      if null parents then v 
schirmer@14700
  1356
      else let val mp = (NameSpace.append (#name (hd (rev parents))) moreN);
schirmer@14700
  1357
           in mk_upd mp v s end;
schirmer@14700
  1358
   
schirmer@14700
  1359
    (*record (scheme) type abbreviation*)
schirmer@14700
  1360
    val recordT_specs =
schirmer@14700
  1361
      [(suffix schemeN bname, alphas @ [zeta], rec_schemeT0, Syntax.NoSyn),
schirmer@14700
  1362
        (bname, alphas, recT0, Syntax.NoSyn)];	
schirmer@14700
  1363
schirmer@14700
  1364
    (*selectors*) 
schirmer@14700
  1365
    fun mk_sel_spec (c,T) = 
schirmer@14700
  1366
	 Const (mk_selC rec_schemeT0 (c,T)) 
schirmer@14700
  1367
          :== (lambda r0 (Const (mk_selC extT (suffix ext_dest c,T))$parent_more r0));
schirmer@14700
  1368
    val sel_specs = map mk_sel_spec fields_more;
schirmer@14700
  1369
schirmer@14700
  1370
    (*updates*)
schirmer@14700
  1371
    fun mk_upd_spec (c,T) =
schirmer@14700
  1372
      let 
schirmer@14700
  1373
        val args = map (fn (n,nT) => if n=c then Free (base c,T) else (mk_sel r0 (n,nT))) 
schirmer@14700
  1374
                       fields_more;
schirmer@14700
  1375
        val new = mk_ext (extN,extT) args; 
schirmer@14700
  1376
      in Const (mk_updC rec_schemeT0 (c,T))
schirmer@14700
  1377
          :== (lambda (Free (base c,T)) (lambda r0 (parent_more_upd new r0)))
schirmer@14700
  1378
      end;
schirmer@14700
  1379
    val upd_specs = map mk_upd_spec fields_more;
schirmer@14700
  1380
schirmer@14700
  1381
    (*derived operations*)
schirmer@14700
  1382
    val make_spec = Const (full makeN, all_types ---> recT0) $$ all_vars :==
schirmer@14700
  1383
      mk_rec (all_vars @ [HOLogic.unit]) 0;
schirmer@14700
  1384
    val fields_spec = Const (full fields_selN, types ---> Type extension) $$ vars :==
schirmer@14700
  1385
      mk_rec (all_vars @ [HOLogic.unit]) parent_len;
schirmer@14700
  1386
    val extend_spec = 
schirmer@14700
  1387
      Const (full extendN, recT0-->moreT-->rec_schemeT0) $ r_unit0 $ more :==
schirmer@14700
  1388
      mk_rec ((map (mk_sel r_unit0) all_fields) @ [more]) 0;
schirmer@14700
  1389
    val truncate_spec = Const (full truncateN, rec_schemeT0 --> recT0) $ r0 :==
schirmer@14700
  1390
      mk_rec ((map (mk_sel r0) all_fields) @ [HOLogic.unit]) 0;
schirmer@14700
  1391
schirmer@14700
  1392
    (* 2st stage: defs_thy *)
schirmer@14700
  1393
 
schirmer@14700
  1394
    val (defs_thy,((sel_defs,upd_defs),derived_defs)) = 
schirmer@14700
  1395
        extension_thy
schirmer@14700
  1396
        |> Theory.add_trfuns 
schirmer@14700
  1397
            ([],[],field_tr's, [])
schirmer@14700
  1398
        |> Theory.add_advanced_trfuns 
schirmer@14700
  1399
            ([],[],adv_ext_tr's @ adv_record_type_tr's @ adv_record_type_abbr_tr's,[])
schirmer@14700
  1400
schirmer@14700
  1401
        |> Theory.parent_path
schirmer@14700
  1402
        |> Theory.add_tyabbrs_i recordT_specs
schirmer@14700
  1403
        |> Theory.add_path bname
schirmer@14700
  1404
        |> Theory.add_consts_i
schirmer@14700
  1405
            (map2 (fn ((x, T), mx) => (x, T, mx)) (sel_decls, field_syntax @ [Syntax.NoSyn]))
schirmer@14700
  1406
        |> (Theory.add_consts_i o map Syntax.no_syn) 
schirmer@14700
  1407
            (upd_decls @ [make_decl, fields_decl, extend_decl, truncate_decl])
schirmer@14700
  1408
        |> (PureThy.add_defs_i false o map Thm.no_attributes) sel_specs
schirmer@14700
  1409
        |>>> (PureThy.add_defs_i false o map Thm.no_attributes) upd_specs
schirmer@14700
  1410
	|>>> (PureThy.add_defs_i false o map Thm.no_attributes)
schirmer@14700
  1411
               [make_spec, fields_spec, extend_spec, truncate_spec];
schirmer@14700
  1412
        
schirmer@14700
  1413
schirmer@14700
  1414
    (* prepare propositions *)
schirmer@14700
  1415
    val P = Free (variant all_variants "P", rec_schemeT0-->HOLogic.boolT);
schirmer@14700
  1416
    val C = Free (variant all_variants "C", HOLogic.boolT);    
schirmer@14700
  1417
    val P_unit = Free (variant all_variants "P", recT0-->HOLogic.boolT);
schirmer@14700
  1418
schirmer@14700
  1419
    (*selectors*) 
schirmer@14700
  1420
    val sel_conv_props =
schirmer@14700
  1421
       map (fn (c, x as Free (_,T)) => mk_sel r_rec0 (c,T) === x) named_vars_more;
schirmer@14700
  1422
schirmer@14700
  1423
    (*updates*) 
schirmer@14700
  1424
    fun mk_upd_prop (i,(c,T)) =
schirmer@14700
  1425
      let val x' = Free (variant all_variants (base c ^ "'"),T) 
schirmer@14700
  1426
          val args' = nth_update x' (parent_fields_len + i, all_vars_more)
schirmer@14700
  1427
      in mk_upd c x' r_rec0 === mk_rec args' 0  end;
schirmer@14700
  1428
    val upd_conv_props = ListPair.map mk_upd_prop (idxms, fields_more);
schirmer@14700
  1429
schirmer@14700
  1430
    (*induct*)
schirmer@14700
  1431
    val induct_scheme_prop =
schirmer@14700
  1432
      All (map dest_Free all_vars_more) (Trueprop (P $ r_rec0)) ==> Trueprop (P $ r0);
schirmer@14700
  1433
    val induct_prop =  
schirmer@14700
  1434
      (All (map dest_Free all_vars) (Trueprop (P_unit $ r_rec_unit0)),
schirmer@14700
  1435
       Trueprop (P_unit $ r_unit0));
schirmer@14700
  1436
schirmer@14700
  1437
    (*surjective*)
schirmer@14700
  1438
    val surjective_prop =
schirmer@14700
  1439
      let val args = map (fn (c,Free (_,T)) => mk_sel r0 (c,T)) all_named_vars_more
schirmer@14700
  1440
      in r0 === mk_rec args 0 end;
schirmer@14700
  1441
schirmer@14700
  1442
    (*cases*)
schirmer@14700
  1443
    val cases_scheme_prop =
schirmer@14700
  1444
      (All (map dest_Free all_vars_more) 
schirmer@14700
  1445
        (Trueprop (HOLogic.mk_eq (r0,r_rec0)) ==> Trueprop C)) 
schirmer@14700
  1446
      ==> Trueprop C;
schirmer@14700
  1447
schirmer@14700
  1448
    val cases_prop =
schirmer@14700
  1449
      (All (map dest_Free all_vars) 
schirmer@14700
  1450
        (Trueprop (HOLogic.mk_eq (r_unit0,r_rec_unit0)) ==> Trueprop C)) 
schirmer@14700
  1451
       ==> Trueprop C;
schirmer@14700
  1452
schirmer@14700
  1453
    (*split*)
schirmer@14700
  1454
    val split_meta_prop =
schirmer@14700
  1455
      let val P = Free (variant all_variants "P", rec_schemeT0-->Term.propT) in
schirmer@14700
  1456
        Logic.mk_equals 
schirmer@14700
  1457
         (All [dest_Free r0] (P $ r0), All (map dest_Free all_vars_more) (P $ r_rec0))
schirmer@14700
  1458
      end; 
schirmer@14700
  1459
schirmer@14700
  1460
    val split_object_prop =
schirmer@14700
  1461
      let fun ALL vs t = foldr (fn ((v,T),t) => HOLogic.mk_all (v,T,t)) (vs,t)
schirmer@14700
  1462
      in (ALL [dest_Free r0] (P $ r0)) === (ALL (map dest_Free all_vars_more) (P $ r_rec0))
schirmer@14700
  1463
      end;
schirmer@14700
  1464
schirmer@14700
  1465
schirmer@14700
  1466
    val split_ex_prop =
schirmer@14700
  1467
      let fun EX vs t = foldr (fn ((v,T),t) => HOLogic.mk_exists (v,T,t)) (vs,t)
schirmer@14700
  1468
      in (EX [dest_Free r0] (P $ r0)) === (EX (map dest_Free all_vars_more) (P $ r_rec0))
schirmer@14700
  1469
      end;
schirmer@14700
  1470
schirmer@14700
  1471
    (*equality*)
schirmer@14700
  1472
    val equality_prop =
schirmer@14700
  1473
      let 
schirmer@14700
  1474
	val s' = Free (rN ^ "'", rec_schemeT0)
schirmer@14700
  1475
        fun mk_sel_eq (c,Free (_,T)) =  mk_sel r0 (c,T) === mk_sel s' (c,T) 
schirmer@14700
  1476
        val seleqs = map mk_sel_eq all_named_vars_more
schirmer@14700
  1477
      in All (map dest_Free [r0,s']) (Logic.list_implies (seleqs,r0 === s')) end;
schirmer@14700
  1478
schirmer@14700
  1479
    (* 3rd stage: thms_thy *)
schirmer@14700
  1480
schirmer@14700
  1481
    val prove_standard = Tactic.prove_standard (Theory.sign_of defs_thy);
schirmer@14700
  1482
    fun prove_simp ss simps =
schirmer@14700
  1483
      let val tac = simp_all_tac ss simps
schirmer@14700
  1484
      in fn prop => prove_standard [] [] prop (K tac) end;
schirmer@14700
  1485
schirmer@14700
  1486
    val ss = get_simpset (sign_of defs_thy);
schirmer@14700
  1487
    val sel_convs = map (prove_simp ss 
schirmer@14700
  1488
                           (sel_defs@ext_dest_convs)) sel_conv_props;
schirmer@14700
  1489
schirmer@14700
  1490
    val upd_convs = map (prove_simp ss (sel_convs@upd_defs)) 
schirmer@14700
  1491
                         upd_conv_props;
schirmer@14700
  1492
      
schirmer@14700
  1493
    val parent_induct = if null parents then [] else [#induct (hd (rev parents))];
schirmer@14700
  1494
schirmer@14700
  1495
    val induct_scheme = prove_standard [] [] induct_scheme_prop (fn prems =>
schirmer@14700
  1496
          (EVERY [if null parent_induct 
schirmer@14700
  1497
                  then all_tac else try_param_tac rN (hd parent_induct) 1,
schirmer@14700
  1498
                  try_param_tac rN ext_induct 1,
schirmer@14700
  1499
                  asm_simp_tac HOL_basic_ss 1]));
schirmer@14700
  1500
schirmer@14700
  1501
    val induct =
schirmer@14700
  1502
      let val (assm, concl) = induct_prop;
schirmer@14700
  1503
      in
schirmer@14700
  1504
        prove_standard [] [assm] concl (fn prems =>
schirmer@14700
  1505
          try_param_tac rN induct_scheme 1
schirmer@14700
  1506
          THEN try_param_tac "more" unit_induct 1
schirmer@14700
  1507
          THEN resolve_tac prems 1)
schirmer@14700
  1508
      end;
schirmer@14700
  1509
schirmer@14700
  1510
    val surjective = 
schirmer@14700
  1511
      prove_standard [] [] surjective_prop (fn prems =>
schirmer@14700
  1512
          (EVERY [try_param_tac rN induct_scheme 1,
schirmer@14700
  1513
                  simp_tac (ss addsimps sel_convs) 1]))
schirmer@14700
  1514
    
schirmer@14700
  1515
    val cases_scheme =
schirmer@14700
  1516
        prove_standard [] [] cases_scheme_prop (fn prems =>
schirmer@14700
  1517
         EVERY [asm_full_simp_tac (HOL_basic_ss addsimps [atomize_all, atomize_imp]) 1,
schirmer@14700
  1518
               try_param_tac rN induct_scheme 1,
schirmer@14700
  1519
               rtac impI 1,
schirmer@14700
  1520
               REPEAT (etac allE 1),
schirmer@14700
  1521
               etac mp 1,
schirmer@14700
  1522
               rtac refl 1])
schirmer@14700
  1523
schirmer@14700
  1524
    val cases =
schirmer@14700
  1525
      prove_standard [] [] cases_prop  (fn _ =>
schirmer@14700
  1526
        try_param_tac rN cases_scheme 1
schirmer@14700
  1527
        THEN simp_all_tac HOL_basic_ss [unit_all_eq1]);
schirmer@14700
  1528
schirmer@14700
  1529
    val split_meta =
schirmer@14700
  1530
        prove_standard [] [] split_meta_prop (fn prems =>
schirmer@14700
  1531
         EVERY [rtac equal_intr_rule 1,
schirmer@14700
  1532
                  rtac meta_allE 1, etac triv_goal 1, atac 1,
schirmer@14700
  1533
                rtac (prop_subst OF [surjective]) 1,
schirmer@14700
  1534
                REPEAT (EVERY [rtac meta_allE 1, etac triv_goal 1, etac thin_rl 1]),
schirmer@14700
  1535
                atac 1]);
schirmer@14700
  1536
schirmer@14700
  1537
    val split_object =
schirmer@14700
  1538
        prove_standard [] [] split_object_prop (fn prems =>
schirmer@14700
  1539
         EVERY [rtac iffI 1, 
schirmer@14700
  1540
                REPEAT (rtac allI 1), etac allE 1, atac 1,
schirmer@14700
  1541
                rtac allI 1, rtac induct_scheme 1,REPEAT (etac allE 1),atac 1]);
schirmer@14700
  1542
schirmer@14700
  1543
    val split_ex = 
schirmer@14700
  1544
        prove_standard [] [] split_ex_prop (fn prems =>
schirmer@14700
  1545
         fast_simp_tac (claset_of HOL.thy,
schirmer@14700
  1546
                       HOL_basic_ss addsimps [split_meta]) 1);
schirmer@14700
  1547
schirmer@14700
  1548
    val equality = prove_standard [] [] equality_prop (fn _ =>
schirmer@14700
  1549
      fn st => let val [s, s'] = map #1 (rev (Tactic.innermost_params 1 st)) in
schirmer@14700
  1550
        st |> (res_inst_tac [(rN, s)] cases_scheme 1
schirmer@14700
  1551
        THEN res_inst_tac [(rN, s')] cases_scheme 1
schirmer@14700
  1552
        THEN simp_all_tac ss (sel_convs))
schirmer@14700
  1553
      end);
schirmer@14700
  1554
schirmer@14700
  1555
    val (thms_thy,(([sel_convs',upd_convs',sel_defs',upd_defs',[split_meta',split_object',split_ex'],
schirmer@14700
  1556
                    derived_defs'],
schirmer@14700
  1557
                   [surjective',equality']),[induct_scheme',induct',cases_scheme',cases'])) =
schirmer@14700
  1558
      defs_thy
schirmer@14700
  1559
      |> (PureThy.add_thmss o map Thm.no_attributes)
schirmer@14700
  1560
         [("select_convs", sel_convs),
schirmer@14700
  1561
          ("update_convs", upd_convs),
schirmer@14700
  1562
          ("select_defs", sel_defs),
schirmer@14700
  1563
          ("update_defs", upd_defs),
schirmer@14700
  1564
          ("splits", [split_meta,split_object,split_ex]),
schirmer@14700
  1565
          ("defs", derived_defs)]
schirmer@14700
  1566
      |>>> (PureThy.add_thms o map Thm.no_attributes)
schirmer@14700
  1567
          [("surjective", surjective),
schirmer@14700
  1568
           ("equality", equality)]
schirmer@14700
  1569
      |>>> PureThy.add_thms 
schirmer@14700
  1570
        [(("induct_scheme", induct_scheme), induct_type_global (suffix schemeN name)),
schirmer@14700
  1571
         (("induct", induct), induct_type_global name),
schirmer@14700
  1572
         (("cases_scheme", cases_scheme), cases_type_global (suffix schemeN name)),
schirmer@14700
  1573
         (("cases", cases), cases_type_global name)];
schirmer@14700
  1574
schirmer@14700
  1575
schirmer@14700
  1576
    val sel_upd_simps = sel_convs' @ upd_convs';
schirmer@14700
  1577
    val iffs = [ext_inject]
schirmer@14700
  1578
    val final_thy =
schirmer@14700
  1579
      thms_thy
schirmer@14700
  1580
      |> (#1 oo PureThy.add_thmss)
schirmer@14700
  1581
          [(("simps", sel_upd_simps), [Simplifier.simp_add_global]),
schirmer@14700
  1582
           (("iffs",iffs), [iff_add_global])]
schirmer@14700
  1583
      |> put_record name (make_record_info args parent fields extension induct_scheme') 
schirmer@14700
  1584
      |> put_sel_upd (names @ [full_moreN]) sel_upd_simps
schirmer@14700
  1585
      |> add_record_equalities extension_id equality'
schirmer@14700
  1586
      |> add_record_splits extension_id (split_meta',split_object',split_ex',induct_scheme')
schirmer@14700
  1587
      |> add_extfields extension_name (fields @ [(full_moreN,moreT)]) 
schirmer@14700
  1588
      |> add_fieldext (extension_name,snd extension) (names @ [full_moreN]) 
schirmer@14700
  1589
      |> Theory.parent_path;
schirmer@14700
  1590
schirmer@14700
  1591
  in final_thy
schirmer@14700
  1592
  end;
wenzelm@4867
  1593
wenzelm@4867
  1594
(* add_record *)
wenzelm@4867
  1595
wenzelm@4895
  1596
(*we do all preparations and error checks here, deferring the real
wenzelm@4895
  1597
  work to record_definition*)
wenzelm@4867
  1598
fun gen_add_record prep_typ prep_raw_parent (params, bname) raw_parent raw_fields thy =
wenzelm@4867
  1599
  let
schirmer@14700
  1600
    val _ = Theory.requires thy "Record" "record definitions"; 
wenzelm@4867
  1601
    val sign = Theory.sign_of thy;
wenzelm@5698
  1602
    val _ = message ("Defining record " ^ quote bname ^ " ...");
wenzelm@4867
  1603
wenzelm@4867
  1604
wenzelm@4867
  1605
    (* parents *)
wenzelm@4867
  1606
wenzelm@4867
  1607
    fun prep_inst T = snd (cert_typ sign ([], T));
wenzelm@4867
  1608
wenzelm@4867
  1609
    val parent = apsome (apfst (map prep_inst) o prep_raw_parent sign) raw_parent
wenzelm@4867
  1610
      handle ERROR => error ("The error(s) above in parent record specification");
wenzelm@12247
  1611
    val parents = add_parents thy parent [];
wenzelm@4867
  1612
wenzelm@4867
  1613
    val init_env =
wenzelm@4867
  1614
      (case parent of
wenzelm@4867
  1615
        None => []
wenzelm@4867
  1616
      | Some (types, _) => foldr Term.add_typ_tfrees (types, []));
wenzelm@4867
  1617
wenzelm@4867
  1618
wenzelm@4867
  1619
    (* fields *)
wenzelm@4867
  1620
wenzelm@12506
  1621
    fun prep_field (env, (c, raw_T, mx)) =
wenzelm@4967
  1622
      let val (env', T) = prep_typ sign (env, raw_T) handle ERROR =>
wenzelm@4967
  1623
        error ("The error(s) above occured in field " ^ quote c)
wenzelm@12506
  1624
      in (env', (c, T, mx)) end;
wenzelm@4867
  1625
wenzelm@4967
  1626
    val (envir, bfields) = foldl_map prep_field (init_env, raw_fields);
wenzelm@4867
  1627
    val envir_names = map fst envir;
wenzelm@4867
  1628
wenzelm@4867
  1629
wenzelm@4867
  1630
    (* args *)
wenzelm@4867
  1631
wenzelm@4867
  1632
    val defaultS = Sign.defaultS sign;
wenzelm@4867
  1633
    val args = map (fn x => (x, if_none (assoc (envir, x)) defaultS)) params;
wenzelm@4867
  1634
wenzelm@4867
  1635
wenzelm@4867
  1636
    (* errors *)
wenzelm@4867
  1637
wenzelm@4890
  1638
    val name = Sign.full_name sign bname;
schirmer@14700
  1639
    val err_dup_record =  
wenzelm@4890
  1640
      if is_none (get_record thy name) then []
wenzelm@4890
  1641
      else ["Duplicate definition of record " ^ quote name];
wenzelm@4890
  1642
wenzelm@4867
  1643
    val err_dup_parms =
wenzelm@4867
  1644
      (case duplicates params of
wenzelm@4867
  1645
        [] => []
wenzelm@4890
  1646
      | dups => ["Duplicate parameter(s) " ^ commas dups]);
wenzelm@4867
  1647
wenzelm@4867
  1648
    val err_extra_frees =
wenzelm@4867
  1649
      (case gen_rems (op =) (envir_names, params) of
wenzelm@4867
  1650
        [] => []
wenzelm@4890
  1651
      | extras => ["Extra free type variable(s) " ^ commas extras]);
wenzelm@4867
  1652
wenzelm@4890
  1653
    val err_no_fields = if null bfields then ["No fields present"] else [];
wenzelm@4867
  1654
wenzelm@4867
  1655
    val err_dup_fields =
wenzelm@12506
  1656
      (case duplicates (map #1 bfields) of
wenzelm@4867
  1657
        [] => []
wenzelm@4890
  1658
      | dups => ["Duplicate field(s) " ^ commas_quote dups]);
wenzelm@4890
  1659
wenzelm@4890
  1660
    val err_bad_fields =
wenzelm@12506
  1661
      if forall (not_equal moreN o #1) bfields then []
wenzelm@4890
  1662
      else ["Illegal field name " ^ quote moreN];
wenzelm@4867
  1663
wenzelm@4867
  1664
    val err_dup_sorts =
wenzelm@4867
  1665
      (case duplicates envir_names of
wenzelm@4867
  1666
        [] => []
wenzelm@4867
  1667
      | dups => ["Inconsistent sort constraints for " ^ commas dups]);
wenzelm@4867
  1668
wenzelm@4867
  1669
    val errs =
wenzelm@4890
  1670
      err_dup_record @ err_dup_parms @ err_extra_frees @ err_no_fields @
wenzelm@4890
  1671
      err_dup_fields @ err_bad_fields @ err_dup_sorts;
wenzelm@4867
  1672
  in
schirmer@14700
  1673
    if null errs then () else error (cat_lines errs)  ;
wenzelm@4867
  1674
    thy |> record_definition (args, bname) parent parents bfields
wenzelm@4867
  1675
  end
wenzelm@4867
  1676
  handle ERROR => error ("Failed to define record " ^ quote bname);
wenzelm@4867
  1677
wenzelm@4867
  1678
val add_record = gen_add_record read_typ read_raw_parent;
wenzelm@4867
  1679
val add_record_i = gen_add_record cert_typ (K I);
wenzelm@4867
  1680
wenzelm@6358
  1681
(* setup theory *)
wenzelm@4867
  1682
wenzelm@4867
  1683
val setup =
wenzelm@5006
  1684
 [RecordsData.init,
wenzelm@11490
  1685
  Theory.add_trfuns ([], parse_translation, [], []),
schirmer@14709
  1686
  Theory.add_advanced_trfuns ([], adv_parse_translation, [], []),   
berghofe@14079
  1687
  Simplifier.change_simpset_of Simplifier.addsimprocs
schirmer@14709
  1688
    [record_simproc, record_upd_simproc, record_eq_simproc]];
wenzelm@4867
  1689
wenzelm@6358
  1690
(* outer syntax *)
wenzelm@6358
  1691
wenzelm@6723
  1692
local structure P = OuterParse and K = OuterSyntax.Keyword in
wenzelm@6358
  1693
wenzelm@6358
  1694
val record_decl =
wenzelm@12876
  1695
  P.type_args -- P.name --
wenzelm@12876
  1696
    (P.$$$ "=" |-- Scan.option (P.typ --| P.$$$ "+") -- Scan.repeat1 P.const);
wenzelm@6358
  1697
wenzelm@6358
  1698
val recordP =
schirmer@14709
  1699
  OuterSyntax.command "record" "define extensible record" K.thy_decl  
schirmer@14700
  1700
    (record_decl >> (fn (x, (y, z)) => Toplevel.theory (add_record x y z)));  
wenzelm@6358
  1701
wenzelm@6358
  1702
val _ = OuterSyntax.add_parsers [recordP];
wenzelm@6358
  1703
wenzelm@4867
  1704
end;
wenzelm@5698
  1705
wenzelm@6384
  1706
end;
wenzelm@6384
  1707
wenzelm@5698
  1708
structure BasicRecordPackage: BASIC_RECORD_PACKAGE = RecordPackage;
wenzelm@5698
  1709
open BasicRecordPackage;