src/HOL/Tools/record.ML
author wenzelm
Fri Oct 12 21:22:35 2012 +0200 (2012-10-12)
changeset 49835 31f32ec4d766
parent 49833 1d80798e8d8a
child 51143 0a2371e7ced3
permissions -rw-r--r--
discontinued typedef with alternative name;
haftmann@31723
     1
(*  Title:      HOL/Tools/record.ML
wenzelm@32763
     2
    Author:     Wolfgang Naraschewski, TU Muenchen
wenzelm@32763
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@32763
     4
    Author:     Norbert Schirmer, TU Muenchen
wenzelm@32763
     5
    Author:     Thomas Sewell, NICTA
wenzelm@32763
     6
wenzelm@32763
     7
Extensible records with structural subtyping.
wenzelm@5698
     8
*)
wenzelm@4867
     9
haftmann@38012
    10
signature RECORD =
wenzelm@5698
    11
sig
wenzelm@43682
    12
  val type_abbr: bool Config.T
wenzelm@43682
    13
  val type_as_fields: bool Config.T
wenzelm@43682
    14
  val timing: bool Config.T
haftmann@38012
    15
haftmann@38012
    16
  type info =
wenzelm@35138
    17
   {args: (string * sort) list,
wenzelm@35138
    18
    parent: (typ list * string) option,
wenzelm@35138
    19
    fields: (string * typ) list,
wenzelm@35138
    20
    extension: (string * typ list),
wenzelm@35138
    21
    ext_induct: thm, ext_inject: thm, ext_surjective: thm, ext_split: thm, ext_def: thm,
wenzelm@35138
    22
    select_convs: thm list, update_convs: thm list, select_defs: thm list, update_defs: thm list,
wenzelm@35138
    23
    fold_congs: thm list, unfold_congs: thm list, splits: thm list, defs: thm list,
wenzelm@35138
    24
    surjective: thm, equality: thm, induct_scheme: thm, induct: thm, cases_scheme: thm,
wenzelm@35138
    25
    cases: thm, simps: thm list, iffs: thm list}
haftmann@38012
    26
  val get_info: theory -> string -> info option
haftmann@38012
    27
  val the_info: theory -> string -> info
wenzelm@41591
    28
  val get_hierarchy: theory -> (string * typ list) -> (string * ((string * sort) * typ) list) list
wenzelm@44653
    29
  val add_record: (string * sort) list * binding -> (typ list * string) option ->
haftmann@38012
    30
    (binding * typ * mixfix) list -> theory -> theory
haftmann@38012
    31
schirmer@14700
    32
  val last_extT: typ -> (string * typ list) option
wenzelm@32972
    33
  val dest_recTs: typ -> (string * typ list) list
wenzelm@32761
    34
  val get_extT_fields: theory -> typ -> (string * typ) list * (string * typ)
wenzelm@32761
    35
  val get_recT_fields: theory -> typ -> (string * typ) list * (string * typ)
wenzelm@26088
    36
  val get_parent: theory -> string -> (typ list * string) option
wenzelm@26088
    37
  val get_extension: theory -> string -> (string * typ list) option
wenzelm@16458
    38
  val get_extinjects: theory -> thm list
wenzelm@16458
    39
  val get_simpset: theory -> simpset
haftmann@38012
    40
  val simproc: simproc
haftmann@38012
    41
  val eq_simproc: simproc
haftmann@38012
    42
  val upd_simproc: simproc
haftmann@38012
    43
  val split_simproc: (term -> int) -> simproc
haftmann@38012
    44
  val ex_sel_eq_simproc: simproc
haftmann@38012
    45
  val split_tac: int -> tactic
haftmann@38012
    46
  val split_simp_tac: thm list -> (term -> int) -> int -> tactic
wenzelm@42793
    47
  val split_wrapper: string * (Proof.context -> wrapper)
haftmann@38012
    48
gerwin@47842
    49
  val codegen: bool Config.T
haftmann@38012
    50
  val updateN: string
haftmann@38012
    51
  val ext_typeN: string
haftmann@38012
    52
  val extN: string
wenzelm@18708
    53
  val setup: theory -> theory
wenzelm@4867
    54
end;
wenzelm@4867
    55
schirmer@14700
    56
haftmann@34151
    57
signature ISO_TUPLE_SUPPORT =
tsewell@32752
    58
sig
haftmann@37470
    59
  val add_iso_tuple_type: binding * (string * sort) list ->
wenzelm@36151
    60
    typ * typ -> theory -> (term * term) * theory
wenzelm@32761
    61
  val mk_cons_tuple: term * term -> term
wenzelm@32761
    62
  val dest_cons_tuple: term -> term * term
haftmann@34151
    63
  val iso_tuple_intros_tac: int -> tactic
wenzelm@32761
    64
  val named_cterm_instantiate: (string * cterm) list -> thm -> thm
tsewell@32752
    65
end;
tsewell@32752
    66
haftmann@34151
    67
structure Iso_Tuple_Support: ISO_TUPLE_SUPPORT =
tsewell@32752
    68
struct
tsewell@32752
    69
haftmann@34151
    70
val isoN = "_Tuple_Iso";
haftmann@34151
    71
haftmann@34151
    72
val iso_tuple_intro = @{thm isomorphic_tuple_intro};
haftmann@34151
    73
val iso_tuple_intros = Tactic.build_net @{thms isomorphic_tuple.intros};
haftmann@34151
    74
haftmann@37470
    75
val tuple_iso_tuple = (@{const_name Record.tuple_iso_tuple}, @{thm tuple_iso_tuple});
tsewell@32752
    76
wenzelm@38252
    77
fun named_cterm_instantiate values thm =  (* FIXME eliminate *)
wenzelm@32761
    78
  let
wenzelm@35135
    79
    fun match name ((name', _), _) = name = name';
wenzelm@32761
    80
    fun getvar name =
wenzelm@32761
    81
      (case find_first (match name) (Term.add_vars (prop_of thm) []) of
wenzelm@32761
    82
        SOME var => cterm_of (theory_of_thm thm) (Var var)
wenzelm@32761
    83
      | NONE => raise THM ("named_cterm_instantiate: " ^ name, 0, [thm]));
tsewell@32752
    84
  in
tsewell@32752
    85
    cterm_instantiate (map (apfst getvar) values) thm
tsewell@32752
    86
  end;
tsewell@32752
    87
haftmann@34151
    88
structure Iso_Tuple_Thms = Theory_Data
tsewell@32752
    89
(
tsewell@32752
    90
  type T = thm Symtab.table;
haftmann@34151
    91
  val empty = Symtab.make [tuple_iso_tuple];
tsewell@32752
    92
  val extend = I;
wenzelm@33522
    93
  fun merge data = Symtab.merge Thm.eq_thm_prop data;   (* FIXME handle Symtab.DUP ?? *)
tsewell@32752
    94
);
tsewell@32752
    95
wenzelm@41575
    96
fun get_typedef_info tyco vs
wenzelm@41575
    97
    (({rep_type, Abs_name, ...}, {Rep_inject, Abs_inverse, ... }) : Typedef.info) thy =
haftmann@38529
    98
  let
haftmann@38529
    99
    val exists_thm =
haftmann@38529
   100
      UNIV_I
haftmann@38529
   101
      |> Drule.instantiate' [SOME (ctyp_of thy (Logic.varifyT_global rep_type))] [];
haftmann@38529
   102
    val proj_constr = Abs_inverse OF [exists_thm];
haftmann@38534
   103
    val absT = Type (tyco, map TFree vs);
haftmann@38529
   104
  in
haftmann@38529
   105
    thy
haftmann@38534
   106
    |> pair (tyco, ((Rep_inject, proj_constr), Const (Abs_name, rep_type --> absT), absT))
haftmann@38529
   107
  end
haftmann@38529
   108
haftmann@38534
   109
fun do_typedef raw_tyco repT raw_vs thy =
haftmann@38529
   110
  let
wenzelm@42361
   111
    val ctxt = Proof_Context.init_global thy |> Variable.declare_typ repT;
wenzelm@42361
   112
    val vs = map (Proof_Context.check_tfree ctxt) raw_vs;
haftmann@38529
   113
  in
haftmann@38529
   114
    thy
wenzelm@49835
   115
    |> Typedef.add_typedef_global (raw_tyco, vs, NoSyn)
wenzelm@46043
   116
        (HOLogic.mk_UNIV repT) NONE (rtac UNIV_witness 1)
haftmann@38534
   117
    |-> (fn (tyco, info) => get_typedef_info tyco vs info)
tsewell@32752
   118
  end;
tsewell@32752
   119
wenzelm@32761
   120
fun mk_cons_tuple (left, right) =
wenzelm@32761
   121
  let
tsewell@32752
   122
    val (leftT, rightT) = (fastype_of left, fastype_of right);
wenzelm@32761
   123
    val prodT = HOLogic.mk_prodT (leftT, rightT);
wenzelm@32972
   124
    val isomT = Type (@{type_name tuple_isomorphism}, [prodT, leftT, rightT]);
tsewell@32752
   125
  in
haftmann@37470
   126
    Const (@{const_name Record.iso_tuple_cons}, isomT --> leftT --> rightT --> prodT) $
haftmann@34151
   127
      Const (fst tuple_iso_tuple, isomT) $ left $ right
tsewell@32752
   128
  end;
tsewell@32752
   129
haftmann@37470
   130
fun dest_cons_tuple (Const (@{const_name Record.iso_tuple_cons}, _) $ Const _ $ t $ u) = (t, u)
wenzelm@32972
   131
  | dest_cons_tuple t = raise TERM ("dest_cons_tuple", [t]);
tsewell@32752
   132
haftmann@37470
   133
fun add_iso_tuple_type (b, alphas) (leftT, rightT) thy =
wenzelm@32761
   134
  let
wenzelm@32761
   135
    val repT = HOLogic.mk_prodT (leftT, rightT);
wenzelm@32761
   136
haftmann@38534
   137
    val ((_, ((rep_inject, abs_inverse), absC, absT)), typ_thy) =
wenzelm@32761
   138
      thy
haftmann@37470
   139
      |> do_typedef b repT alphas
haftmann@37470
   140
      ||> Sign.add_path (Binding.name_of b); (*FIXME proper prefixing instead*)
wenzelm@32761
   141
wenzelm@32761
   142
    (*construct a type and body for the isomorphism constant by
wenzelm@32761
   143
      instantiating the theorem to which the definition will be applied*)
wenzelm@32761
   144
    val intro_inst =
haftmann@34151
   145
      rep_inject RS named_cterm_instantiate [("abst", cterm_of typ_thy absC)] iso_tuple_intro;
wenzelm@32761
   146
    val (_, body) = Logic.dest_equals (List.last (prems_of intro_inst));
wenzelm@32761
   147
    val isomT = fastype_of body;
haftmann@37470
   148
    val isom_binding = Binding.suffix_name isoN b;
wenzelm@35239
   149
    val isom_name = Sign.full_name typ_thy isom_binding;
wenzelm@32972
   150
    val isom = Const (isom_name, isomT);
wenzelm@32761
   151
wenzelm@32761
   152
    val ([isom_def], cdef_thy) =
wenzelm@32761
   153
      typ_thy
wenzelm@42375
   154
      |> Sign.declare_const_global ((isom_binding, isomT), NoSyn) |> snd
wenzelm@39557
   155
      |> Global_Theory.add_defs false
wenzelm@35239
   156
        [((Binding.conceal (Thm.def_binding isom_binding), Logic.mk_equals (isom, body)), [])];
wenzelm@32761
   157
haftmann@34151
   158
    val iso_tuple = isom_def RS (abs_inverse RS (rep_inject RS iso_tuple_intro));
haftmann@37470
   159
    val cons = Const (@{const_name Record.iso_tuple_cons}, isomT --> leftT --> rightT --> absT);
wenzelm@32761
   160
wenzelm@32761
   161
    val thm_thy =
wenzelm@32761
   162
      cdef_thy
haftmann@34151
   163
      |> Iso_Tuple_Thms.map (Symtab.insert Thm.eq_thm_prop (isom_name, iso_tuple))
wenzelm@35239
   164
      |> Sign.restore_naming thy
wenzelm@32761
   165
  in
wenzelm@32972
   166
    ((isom, cons $ isom), thm_thy)
wenzelm@32761
   167
  end;
wenzelm@32761
   168
wenzelm@35133
   169
val iso_tuple_intros_tac =
wenzelm@35133
   170
  resolve_from_net_tac iso_tuple_intros THEN'
wenzelm@32975
   171
  CSUBGOAL (fn (cgoal, i) =>
wenzelm@32975
   172
    let
wenzelm@32975
   173
      val thy = Thm.theory_of_cterm cgoal;
wenzelm@32975
   174
      val goal = Thm.term_of cgoal;
wenzelm@32975
   175
haftmann@34151
   176
      val isthms = Iso_Tuple_Thms.get thy;
haftmann@34151
   177
      fun err s t = raise TERM ("iso_tuple_intros_tac: " ^ s, [t]);
wenzelm@32975
   178
wenzelm@32975
   179
      val goal' = Envir.beta_eta_contract goal;
wenzelm@32975
   180
      val is =
wenzelm@32975
   181
        (case goal' of
wenzelm@32975
   182
          Const (@{const_name Trueprop}, _) $
wenzelm@32975
   183
            (Const (@{const_name isomorphic_tuple}, _) $ Const is) => is
wenzelm@32975
   184
        | _ => err "unexpected goal format" goal');
wenzelm@32975
   185
      val isthm =
wenzelm@32975
   186
        (case Symtab.lookup isthms (#1 is) of
wenzelm@32975
   187
          SOME isthm => isthm
wenzelm@32975
   188
        | NONE => err "no thm found for constant" (Const is));
wenzelm@32975
   189
    in rtac isthm i end);
tsewell@32752
   190
tsewell@32752
   191
end;
tsewell@32752
   192
wenzelm@32761
   193
haftmann@31723
   194
structure Record: RECORD =
wenzelm@4867
   195
struct
wenzelm@4867
   196
wenzelm@35133
   197
val surject_assistI = @{thm iso_tuple_surjective_proof_assistI};
wenzelm@35133
   198
val surject_assist_idE = @{thm iso_tuple_surjective_proof_assist_idE};
wenzelm@35133
   199
wenzelm@35133
   200
val updacc_accessor_eqE = @{thm update_accessor_accessor_eqE};
wenzelm@35133
   201
val updacc_updator_eqE = @{thm update_accessor_updator_eqE};
wenzelm@35133
   202
val updacc_eq_idI = @{thm iso_tuple_update_accessor_eq_assist_idI};
wenzelm@35133
   203
val updacc_eq_triv = @{thm iso_tuple_update_accessor_eq_assist_triv};
wenzelm@35133
   204
wenzelm@35133
   205
val updacc_foldE = @{thm update_accessor_congruence_foldE};
wenzelm@35133
   206
val updacc_unfoldE = @{thm update_accessor_congruence_unfoldE};
wenzelm@35133
   207
val updacc_noopE = @{thm update_accessor_noopE};
wenzelm@35133
   208
val updacc_noop_compE = @{thm update_accessor_noop_compE};
wenzelm@35133
   209
val updacc_cong_idI = @{thm update_accessor_cong_assist_idI};
wenzelm@35133
   210
val updacc_cong_triv = @{thm update_accessor_cong_assist_triv};
wenzelm@35133
   211
val updacc_cong_from_eq = @{thm iso_tuple_update_accessor_cong_from_eq};
tsewell@32743
   212
gerwin@47842
   213
val codegen = Attrib.setup_config_bool @{binding record_codegen} (K true);
wenzelm@32761
   214
wenzelm@32761
   215
schirmer@14700
   216
(** name components **)
schirmer@14700
   217
schirmer@14700
   218
val rN = "r";
schirmer@15215
   219
val wN = "w";
schirmer@14700
   220
val moreN = "more";
schirmer@14700
   221
val schemeN = "_scheme";
haftmann@38531
   222
val ext_typeN = "_ext";
haftmann@38531
   223
val inner_typeN = "_inner";
schirmer@14700
   224
val extN ="_ext";
schirmer@14700
   225
val updateN = "_update";
schirmer@14700
   226
val makeN = "make";
schirmer@14700
   227
val fields_selN = "fields";
schirmer@14700
   228
val extendN = "extend";
schirmer@14700
   229
val truncateN = "truncate";
schirmer@14700
   230
wenzelm@32335
   231
wenzelm@32335
   232
wenzelm@4894
   233
(*** utilities ***)
wenzelm@4867
   234
wenzelm@45424
   235
fun varifyT idx = map_type_tfree (fn (a, S) => TVar ((a, idx), S));
schirmer@19748
   236
wenzelm@32335
   237
schirmer@15012
   238
(* timing *)
schirmer@15012
   239
wenzelm@43682
   240
val timing = Attrib.setup_config_bool @{binding record_timing} (K false);
wenzelm@43682
   241
fun timeit_msg ctxt s x = if Config.get ctxt timing then (warning s; timeit x) else x ();
wenzelm@43682
   242
fun timing_msg ctxt s = if Config.get ctxt timing then warning s else ();
wenzelm@17261
   243
wenzelm@32335
   244
wenzelm@12255
   245
(* syntax *)
wenzelm@4867
   246
wenzelm@11927
   247
val Trueprop = HOLogic.mk_Trueprop;
wenzelm@4894
   248
wenzelm@11934
   249
infix 0 :== ===;
wenzelm@11934
   250
infixr 0 ==>;
wenzelm@11934
   251
wenzelm@37781
   252
val op :== = Misc_Legacy.mk_defpair;
wenzelm@32799
   253
val op === = Trueprop o HOLogic.mk_eq;
wenzelm@32799
   254
val op ==> = Logic.mk_implies;
wenzelm@4867
   255
wenzelm@32335
   256
schirmer@14700
   257
(* constructor *)
wenzelm@4867
   258
wenzelm@32761
   259
fun mk_ext (name, T) ts =
schirmer@14700
   260
  let val Ts = map fastype_of ts
wenzelm@35239
   261
  in list_comb (Const (suffix extN name, Ts ---> T), ts) end;
wenzelm@4867
   262
wenzelm@32335
   263
schirmer@14700
   264
(* selector *)
schirmer@14700
   265
wenzelm@32761
   266
fun mk_selC sT (c, T) = (c, sT --> T);
wenzelm@32761
   267
wenzelm@32761
   268
fun mk_sel s (c, T) =
schirmer@14700
   269
  let val sT = fastype_of s
wenzelm@32761
   270
  in Const (mk_selC sT (c, T)) $ s end;
wenzelm@4867
   271
wenzelm@32335
   272
schirmer@14700
   273
(* updates *)
schirmer@14700
   274
wenzelm@32761
   275
fun mk_updC sfx sT (c, T) = (suffix sfx c, (T --> T) --> sT --> sT);
wenzelm@4867
   276
schirmer@21226
   277
fun mk_upd' sfx c v sT =
schirmer@21226
   278
  let val vT = domain_type (fastype_of v);
wenzelm@32761
   279
  in Const (mk_updC sfx sT (c, vT)) $ v end;
wenzelm@32761
   280
wenzelm@32761
   281
fun mk_upd sfx c v s = mk_upd' sfx c v (fastype_of s) $ s;
wenzelm@4867
   282
wenzelm@32335
   283
wenzelm@4867
   284
(* types *)
wenzelm@4867
   285
wenzelm@32799
   286
fun dest_recT (typ as Type (c_ext_type, Ts as (_ :: _))) =
schirmer@14700
   287
      (case try (unsuffix ext_typeN) c_ext_type of
haftmann@31723
   288
        NONE => raise TYPE ("Record.dest_recT", [typ], [])
skalberg@15570
   289
      | SOME c => ((c, Ts), List.last Ts))
haftmann@31723
   290
  | dest_recT typ = raise TYPE ("Record.dest_recT", [typ], []);
wenzelm@5197
   291
wenzelm@32975
   292
val is_recT = can dest_recT;
wenzelm@11833
   293
schirmer@14700
   294
fun dest_recTs T =
schirmer@14700
   295
  let val ((c, Ts), U) = dest_recT T
schirmer@14700
   296
  in (c, Ts) :: dest_recTs U
schirmer@14700
   297
  end handle TYPE _ => [];
schirmer@14255
   298
schirmer@14700
   299
fun last_extT T =
wenzelm@32761
   300
  let val ((c, Ts), U) = dest_recT T in
wenzelm@32761
   301
    (case last_extT U of
wenzelm@32761
   302
      NONE => SOME (c, Ts)
wenzelm@32761
   303
    | SOME l => SOME l)
wenzelm@32761
   304
  end handle TYPE _ => NONE;
schirmer@14255
   305
wenzelm@17261
   306
fun rec_id i T =
wenzelm@32761
   307
  let
wenzelm@32761
   308
    val rTs = dest_recTs T;
haftmann@33957
   309
    val rTs' = if i < 0 then rTs else take i rTs;
wenzelm@32764
   310
  in implode (map #1 rTs') end;
wenzelm@4867
   311
wenzelm@32335
   312
wenzelm@32335
   313
wenzelm@4867
   314
(*** extend theory by record definition ***)
wenzelm@4867
   315
wenzelm@4867
   316
(** record info **)
wenzelm@4867
   317
haftmann@38012
   318
(* type info and parent_info *)
haftmann@38012
   319
haftmann@38012
   320
type info =
wenzelm@4867
   321
 {args: (string * sort) list,
wenzelm@4867
   322
  parent: (typ list * string) option,
wenzelm@4867
   323
  fields: (string * typ) list,
schirmer@14700
   324
  extension: (string * typ list),
wenzelm@35138
   325
wenzelm@35138
   326
  ext_induct: thm,
wenzelm@35138
   327
  ext_inject: thm,
wenzelm@35138
   328
  ext_surjective: thm,
wenzelm@35138
   329
  ext_split: thm,
wenzelm@35138
   330
  ext_def: thm,
wenzelm@35138
   331
wenzelm@35138
   332
  select_convs: thm list,
wenzelm@35138
   333
  update_convs: thm list,
wenzelm@35138
   334
  select_defs: thm list,
wenzelm@35138
   335
  update_defs: thm list,
wenzelm@47783
   336
  fold_congs: thm list,  (* potentially used in L4.verified *)
wenzelm@47783
   337
  unfold_congs: thm list,  (* potentially used in L4.verified *)
wenzelm@35138
   338
  splits: thm list,
wenzelm@35138
   339
  defs: thm list,
wenzelm@35138
   340
wenzelm@35138
   341
  surjective: thm,
wenzelm@35138
   342
  equality: thm,
wenzelm@35138
   343
  induct_scheme: thm,
tsewell@32743
   344
  induct: thm,
wenzelm@35138
   345
  cases_scheme: thm,
wenzelm@35138
   346
  cases: thm,
wenzelm@35138
   347
wenzelm@35138
   348
  simps: thm list,
wenzelm@35138
   349
  iffs: thm list};
wenzelm@35138
   350
haftmann@38012
   351
fun make_info args parent fields extension
wenzelm@35138
   352
    ext_induct ext_inject ext_surjective ext_split ext_def
wenzelm@35138
   353
    select_convs update_convs select_defs update_defs fold_congs unfold_congs splits defs
wenzelm@35138
   354
    surjective equality induct_scheme induct cases_scheme cases
haftmann@38012
   355
    simps iffs : info =
wenzelm@17261
   356
 {args = args, parent = parent, fields = fields, extension = extension,
wenzelm@35138
   357
  ext_induct = ext_induct, ext_inject = ext_inject, ext_surjective = ext_surjective,
wenzelm@35138
   358
  ext_split = ext_split, ext_def = ext_def, select_convs = select_convs,
wenzelm@35138
   359
  update_convs = update_convs, select_defs = select_defs, update_defs = update_defs,
wenzelm@35138
   360
  fold_congs = fold_congs, unfold_congs = unfold_congs, splits = splits, defs = defs,
wenzelm@35138
   361
  surjective = surjective, equality = equality, induct_scheme = induct_scheme,
wenzelm@35138
   362
  induct = induct, cases_scheme = cases_scheme, cases = cases, simps = simps, iffs = iffs};
wenzelm@4867
   363
wenzelm@4867
   364
type parent_info =
wenzelm@4867
   365
 {name: string,
wenzelm@4867
   366
  fields: (string * typ) list,
schirmer@14700
   367
  extension: (string * typ list),
wenzelm@35138
   368
  induct_scheme: thm,
wenzelm@35138
   369
  ext_def: thm};
wenzelm@35138
   370
wenzelm@35138
   371
fun make_parent_info name fields extension ext_def induct_scheme : parent_info =
tsewell@32743
   372
 {name = name, fields = fields, extension = extension,
wenzelm@35138
   373
  ext_def = ext_def, induct_scheme = induct_scheme};
wenzelm@4867
   374
wenzelm@22846
   375
wenzelm@22846
   376
(* theory data *)
wenzelm@5001
   377
haftmann@38012
   378
type data =
haftmann@38012
   379
 {records: info Symtab.table,
wenzelm@7178
   380
  sel_upd:
tsewell@32744
   381
   {selectors: (int * bool) Symtab.table,
wenzelm@7178
   382
    updates: string Symtab.table,
wenzelm@46047
   383
    simpset: simpset,
wenzelm@46221
   384
    defset: simpset},
schirmer@14255
   385
  equalities: thm Symtab.table,
schirmer@15015
   386
  extinjects: thm list,
wenzelm@32764
   387
  extsplit: thm Symtab.table,  (*maps extension name to split rule*)
wenzelm@35135
   388
  splits: (thm * thm * thm * thm) Symtab.table,  (*!!, ALL, EX - split-equalities, induct rule*)
wenzelm@32764
   389
  extfields: (string * typ) list Symtab.table,  (*maps extension to its fields*)
wenzelm@32764
   390
  fieldext: (string * typ list) Symtab.table};  (*maps field to its extension*)
wenzelm@7178
   391
haftmann@38012
   392
fun make_data
wenzelm@32761
   393
    records sel_upd equalities extinjects extsplit splits extfields fieldext =
wenzelm@17261
   394
 {records = records, sel_upd = sel_upd,
wenzelm@17261
   395
  equalities = equalities, extinjects=extinjects, extsplit = extsplit, splits = splits,
haftmann@38012
   396
  extfields = extfields, fieldext = fieldext }: data;
wenzelm@7178
   397
wenzelm@38758
   398
structure Data = Theory_Data
wenzelm@22846
   399
(
haftmann@38012
   400
  type T = data;
wenzelm@7178
   401
  val empty =
haftmann@38012
   402
    make_data Symtab.empty
tsewell@32743
   403
      {selectors = Symtab.empty, updates = Symtab.empty,
wenzelm@46221
   404
        simpset = HOL_basic_ss, defset = HOL_basic_ss}
schirmer@15015
   405
       Symtab.empty [] Symtab.empty Symtab.empty Symtab.empty Symtab.empty;
wenzelm@16458
   406
  val extend = I;
wenzelm@33522
   407
  fun merge
wenzelm@7178
   408
   ({records = recs1,
wenzelm@46221
   409
     sel_upd = {selectors = sels1, updates = upds1, simpset = ss1, defset = ds1},
schirmer@14255
   410
     equalities = equalities1,
wenzelm@17261
   411
     extinjects = extinjects1,
schirmer@15015
   412
     extsplit = extsplit1,
schirmer@14700
   413
     splits = splits1,
schirmer@14700
   414
     extfields = extfields1,
schirmer@14700
   415
     fieldext = fieldext1},
wenzelm@7178
   416
    {records = recs2,
wenzelm@46221
   417
     sel_upd = {selectors = sels2, updates = upds2, simpset = ss2, defset = ds2},
schirmer@15015
   418
     equalities = equalities2,
wenzelm@17261
   419
     extinjects = extinjects2,
wenzelm@17261
   420
     extsplit = extsplit2,
schirmer@14700
   421
     splits = splits2,
schirmer@14700
   422
     extfields = extfields2,
schirmer@14700
   423
     fieldext = fieldext2}) =
haftmann@38012
   424
    make_data
wenzelm@7178
   425
      (Symtab.merge (K true) (recs1, recs2))
wenzelm@7178
   426
      {selectors = Symtab.merge (K true) (sels1, sels2),
wenzelm@7178
   427
        updates = Symtab.merge (K true) (upds1, upds2),
tsewell@32743
   428
        simpset = Simplifier.merge_ss (ss1, ss2),
wenzelm@46221
   429
        defset = Simplifier.merge_ss (ds1, ds2)}
haftmann@22634
   430
      (Symtab.merge Thm.eq_thm_prop (equalities1, equalities2))
wenzelm@33522
   431
      (Thm.merge_thms (extinjects1, extinjects2))
wenzelm@32761
   432
      (Symtab.merge Thm.eq_thm_prop (extsplit1, extsplit2))
wenzelm@32761
   433
      (Symtab.merge (fn ((a, b, c, d), (w, x, y, z)) =>
wenzelm@32761
   434
          Thm.eq_thm (a, w) andalso Thm.eq_thm (b, x) andalso
wenzelm@32761
   435
          Thm.eq_thm (c, y) andalso Thm.eq_thm (d, z)) (splits1, splits2))
wenzelm@32761
   436
      (Symtab.merge (K true) (extfields1, extfields2))
wenzelm@32761
   437
      (Symtab.merge (K true) (fieldext1, fieldext2));
wenzelm@22846
   438
);
wenzelm@4867
   439
wenzelm@16458
   440
wenzelm@7178
   441
(* access 'records' *)
wenzelm@4867
   442
wenzelm@38758
   443
val get_info = Symtab.lookup o #records o Data.get;
haftmann@38012
   444
haftmann@38012
   445
fun the_info thy name =
haftmann@38012
   446
  (case get_info thy name of
wenzelm@35138
   447
    SOME info => info
wenzelm@35138
   448
  | NONE => error ("Unknown record type " ^ quote name));
wenzelm@35138
   449
wenzelm@38758
   450
fun put_record name info =
wenzelm@38758
   451
  Data.map (fn {records, sel_upd, equalities, extinjects, extsplit, splits, extfields, fieldext} =>
wenzelm@38758
   452
    make_data (Symtab.update (name, info) records)
wenzelm@38758
   453
      sel_upd equalities extinjects extsplit splits extfields fieldext);
wenzelm@7178
   454
wenzelm@22846
   455
wenzelm@7178
   456
(* access 'sel_upd' *)
wenzelm@7178
   457
wenzelm@38758
   458
val get_sel_upd = #sel_upd o Data.get;
wenzelm@7178
   459
wenzelm@17510
   460
val is_selector = Symtab.defined o #selectors o get_sel_upd;
wenzelm@17412
   461
val get_updates = Symtab.lookup o #updates o get_sel_upd;
wenzelm@35232
   462
fun get_ss_with_context getss thy = Simplifier.global_context thy (getss (get_sel_upd thy));
wenzelm@32764
   463
wenzelm@32764
   464
val get_simpset = get_ss_with_context #simpset;
wenzelm@32764
   465
val get_sel_upd_defs = get_ss_with_context #defset;
tsewell@32743
   466
wenzelm@32761
   467
fun get_update_details u thy =
wenzelm@32761
   468
  let val sel_upd = get_sel_upd thy in
wenzelm@32761
   469
    (case Symtab.lookup (#updates sel_upd) u of
wenzelm@32761
   470
      SOME s =>
wenzelm@32761
   471
        let val SOME (dep, ismore) = Symtab.lookup (#selectors sel_upd) s
wenzelm@32761
   472
        in SOME (s, dep, ismore) end
wenzelm@32761
   473
    | NONE => NONE)
wenzelm@32761
   474
  end;
wenzelm@7178
   475
wenzelm@46221
   476
fun put_sel_upd names more depth simps defs thy =
tsewell@32744
   477
  let
wenzelm@32761
   478
    val all = names @ [more];
tsewell@32744
   479
    val sels = map (rpair (depth, false)) names @ [(more, (depth, true))];
tsewell@32744
   480
    val upds = map (suffix updateN) all ~~ all;
tsewell@32744
   481
wenzelm@46221
   482
    val {records, sel_upd = {selectors, updates, simpset, defset},
wenzelm@38758
   483
      equalities, extinjects, extsplit, splits, extfields, fieldext} = Data.get thy;
wenzelm@46221
   484
    val data =
wenzelm@46221
   485
      make_data records
wenzelm@46221
   486
        {selectors = fold Symtab.update_new sels selectors,
wenzelm@46221
   487
          updates = fold Symtab.update_new upds updates,
wenzelm@46221
   488
          simpset = simpset addsimps simps,
wenzelm@46221
   489
          defset = defset addsimps defs}
wenzelm@46221
   490
         equalities extinjects extsplit splits extfields fieldext;
wenzelm@38758
   491
  in Data.put data thy end;
wenzelm@22846
   492
wenzelm@32761
   493
berghofe@14079
   494
(* access 'equalities' *)
berghofe@14079
   495
wenzelm@38758
   496
fun add_equalities name thm =
wenzelm@38758
   497
  Data.map (fn {records, sel_upd, equalities, extinjects, extsplit, splits, extfields, fieldext} =>
wenzelm@38758
   498
    make_data records sel_upd
wenzelm@38758
   499
      (Symtab.update_new (name, thm) equalities) extinjects extsplit splits extfields fieldext);
wenzelm@38758
   500
wenzelm@38758
   501
val get_equalities = Symtab.lookup o #equalities o Data.get;
berghofe@14079
   502
wenzelm@22846
   503
schirmer@15015
   504
(* access 'extinjects' *)
schirmer@15015
   505
wenzelm@38758
   506
fun add_extinjects thm =
wenzelm@38758
   507
  Data.map (fn {records, sel_upd, equalities, extinjects, extsplit, splits, extfields, fieldext} =>
wenzelm@38758
   508
    make_data records sel_upd equalities (insert Thm.eq_thm_prop thm extinjects)
wenzelm@38758
   509
      extsplit splits extfields fieldext);
wenzelm@38758
   510
wenzelm@38758
   511
val get_extinjects = rev o #extinjects o Data.get;
schirmer@15015
   512
wenzelm@22846
   513
schirmer@15015
   514
(* access 'extsplit' *)
schirmer@15015
   515
wenzelm@38758
   516
fun add_extsplit name thm =
wenzelm@38758
   517
  Data.map (fn {records, sel_upd, equalities, extinjects, extsplit, splits, extfields, fieldext} =>
wenzelm@38758
   518
    make_data records sel_upd equalities extinjects
wenzelm@38758
   519
      (Symtab.update_new (name, thm) extsplit) splits extfields fieldext);
schirmer@15015
   520
wenzelm@26088
   521
schirmer@14255
   522
(* access 'splits' *)
schirmer@14255
   523
wenzelm@38758
   524
fun add_splits name thmP =
wenzelm@38758
   525
  Data.map (fn {records, sel_upd, equalities, extinjects, extsplit, splits, extfields, fieldext} =>
wenzelm@38758
   526
    make_data records sel_upd equalities extinjects extsplit
wenzelm@38758
   527
      (Symtab.update_new (name, thmP) splits) extfields fieldext);
wenzelm@38758
   528
wenzelm@38758
   529
val get_splits = Symtab.lookup o #splits o Data.get;
schirmer@14255
   530
schirmer@15015
   531
wenzelm@26088
   532
(* parent/extension of named record *)
schirmer@15015
   533
wenzelm@38758
   534
val get_parent = (Option.join o Option.map #parent) oo (Symtab.lookup o #records o Data.get);
wenzelm@38758
   535
val get_extension = Option.map #extension oo (Symtab.lookup o #records o Data.get);
wenzelm@17261
   536
berghofe@14079
   537
schirmer@14700
   538
(* access 'extfields' *)
schirmer@14700
   539
wenzelm@38758
   540
fun add_extfields name fields =
wenzelm@38758
   541
  Data.map (fn {records, sel_upd, equalities, extinjects, extsplit, splits, extfields, fieldext} =>
wenzelm@38758
   542
    make_data records sel_upd equalities extinjects extsplit splits
wenzelm@38758
   543
      (Symtab.update_new (name, fields) extfields) fieldext);
wenzelm@38758
   544
wenzelm@38758
   545
val get_extfields = Symtab.lookup o #extfields o Data.get;
schirmer@14700
   546
wenzelm@18858
   547
fun get_extT_fields thy T =
schirmer@15059
   548
  let
wenzelm@32761
   549
    val ((name, Ts), moreT) = dest_recT T;
wenzelm@32761
   550
    val recname =
wenzelm@32799
   551
      let val (nm :: _ :: rst) = rev (Long_Name.explode name)   (* FIXME !? *)
wenzelm@32761
   552
      in Long_Name.implode (rev (nm :: rst)) end;
wenzelm@45424
   553
    val varifyT = varifyT (maxidx_of_typs (moreT :: Ts) + 1);
wenzelm@38758
   554
    val {records, extfields, ...} = Data.get thy;
wenzelm@35149
   555
    val (fields, (more, _)) = split_last (Symtab.lookup_list extfields name);
wenzelm@17412
   556
    val args = map varifyT (snd (#extension (the (Symtab.lookup records recname))));
schirmer@15058
   557
wenzelm@41489
   558
    val subst = fold (Sign.typ_match thy) (#1 (split_last args) ~~ #1 (split_last Ts)) Vartab.empty;
wenzelm@35149
   559
    val fields' = map (apsnd (Envir.norm_type subst o varifyT)) fields;
wenzelm@35149
   560
  in (fields', (more, moreT)) end;
schirmer@15058
   561
wenzelm@18858
   562
fun get_recT_fields thy T =
wenzelm@17261
   563
  let
wenzelm@35149
   564
    val (root_fields, (root_more, root_moreT)) = get_extT_fields thy T;
wenzelm@35149
   565
    val (rest_fields, rest_more) =
wenzelm@32761
   566
      if is_recT root_moreT then get_recT_fields thy root_moreT
wenzelm@32761
   567
      else ([], (root_more, root_moreT));
wenzelm@35149
   568
  in (root_fields @ rest_fields, rest_more) end;
schirmer@15059
   569
schirmer@15058
   570
schirmer@14700
   571
(* access 'fieldext' *)
schirmer@14700
   572
wenzelm@38758
   573
fun add_fieldext extname_types fields =
wenzelm@38758
   574
  Data.map (fn {records, sel_upd, equalities, extinjects, extsplit, splits, extfields, fieldext} =>
wenzelm@38758
   575
    let
wenzelm@38758
   576
      val fieldext' =
wenzelm@38758
   577
        fold (fn field => Symtab.update_new (field, extname_types)) fields fieldext;
wenzelm@38758
   578
    in make_data records sel_upd equalities extinjects extsplit splits extfields fieldext' end);
wenzelm@38758
   579
wenzelm@38758
   580
val get_fieldext = Symtab.lookup o #fieldext o Data.get;
schirmer@14700
   581
wenzelm@21962
   582
wenzelm@4867
   583
(* parent records *)
wenzelm@4867
   584
wenzelm@41577
   585
local
wenzelm@41577
   586
wenzelm@41577
   587
fun add_parents _ NONE = I
wenzelm@41577
   588
  | add_parents thy (SOME (types, name)) =
wenzelm@12247
   589
      let
wenzelm@12247
   590
        fun err msg = error (msg ^ " parent record " ^ quote name);
wenzelm@12255
   591
wenzelm@41577
   592
        val {args, parent, ...} =
haftmann@38012
   593
          (case get_info thy name of SOME info => info | NONE => err "Unknown");
wenzelm@12247
   594
        val _ = if length types <> length args then err "Bad number of arguments for" else ();
wenzelm@12255
   595
wenzelm@12247
   596
        fun bad_inst ((x, S), T) =
wenzelm@22578
   597
          if Sign.of_sort thy (T, S) then NONE else SOME x
wenzelm@32952
   598
        val bads = map_filter bad_inst (args ~~ types);
wenzelm@21962
   599
        val _ = null bads orelse err ("Ill-sorted instantiation of " ^ commas bads ^ " in");
wenzelm@12255
   600
wenzelm@41591
   601
        val inst = args ~~ types;
wenzelm@41591
   602
        val subst = Term.map_type_tfree (the o AList.lookup (op =) inst);
skalberg@15570
   603
        val parent' = Option.map (apfst (map subst)) parent;
wenzelm@41577
   604
      in cons (name, inst) #> add_parents thy parent' end;
wenzelm@41577
   605
wenzelm@41577
   606
in
wenzelm@41577
   607
wenzelm@41577
   608
fun get_hierarchy thy (name, types) = add_parents thy (SOME (types, name)) [];
wenzelm@41577
   609
wenzelm@41577
   610
fun get_parent_info thy parent =
wenzelm@41577
   611
  add_parents thy parent [] |> map (fn (name, inst) =>
wenzelm@41577
   612
    let
wenzelm@41591
   613
      val subst = Term.map_type_tfree (the o AList.lookup (op =) inst);
wenzelm@41577
   614
      val {fields, extension, induct_scheme, ext_def, ...} = the_info thy name;
wenzelm@41577
   615
      val fields' = map (apsnd subst) fields;
wenzelm@41577
   616
      val extension' = apsnd (map subst) extension;
wenzelm@41577
   617
    in make_parent_info name fields' extension' ext_def induct_scheme end);
wenzelm@41577
   618
wenzelm@41577
   619
end;
wenzelm@4867
   620
wenzelm@4867
   621
wenzelm@21962
   622
schirmer@14700
   623
(** concrete syntax for records **)
schirmer@14700
   624
schirmer@14700
   625
(* parse translations *)
schirmer@14700
   626
wenzelm@35144
   627
local
wenzelm@35144
   628
wenzelm@43681
   629
fun split_args (field :: fields) ((name, arg) :: fargs) =
wenzelm@43681
   630
      if can (unsuffix name) field then
wenzelm@43681
   631
        let val (args, rest) = split_args fields fargs
wenzelm@43681
   632
        in (arg :: args, rest) end
wenzelm@43681
   633
      else raise Fail ("expecting field " ^ quote field ^ " but got " ^ quote name)
wenzelm@43681
   634
  | split_args [] (fargs as (_ :: _)) = ([], fargs)
wenzelm@43681
   635
  | split_args (_ :: _) [] = raise Fail "expecting more fields"
wenzelm@43681
   636
  | split_args _ _ = ([], []);
wenzelm@43681
   637
wenzelm@35146
   638
fun field_type_tr ((Const (@{syntax_const "_field_type"}, _) $ Const (name, _) $ arg)) =
wenzelm@35146
   639
      (name, arg)
wenzelm@35146
   640
  | field_type_tr t = raise TERM ("field_type_tr", [t]);
wenzelm@35146
   641
wenzelm@35146
   642
fun field_types_tr (Const (@{syntax_const "_field_types"}, _) $ t $ u) =
wenzelm@35146
   643
      field_type_tr t :: field_types_tr u
wenzelm@35146
   644
  | field_types_tr t = [field_type_tr t];
wenzelm@35146
   645
wenzelm@35146
   646
fun record_field_types_tr more ctxt t =
wenzelm@17261
   647
  let
wenzelm@42361
   648
    val thy = Proof_Context.theory_of ctxt;
wenzelm@35146
   649
    fun err msg = raise TERM ("Error in record-type input: " ^ msg, [t]);
wenzelm@35146
   650
wenzelm@32799
   651
    fun mk_ext (fargs as (name, _) :: _) =
wenzelm@42361
   652
          (case get_fieldext thy (Proof_Context.intern_const ctxt name) of
wenzelm@32761
   653
            SOME (ext, alphas) =>
wenzelm@18858
   654
              (case get_extfields thy ext of
wenzelm@35146
   655
                SOME fields =>
wenzelm@35146
   656
                  let
wenzelm@41489
   657
                    val (fields', _) = split_last fields;
wenzelm@35146
   658
                    val types = map snd fields';
wenzelm@43681
   659
                    val (args, rest) = split_args (map fst fields') fargs
wenzelm@43681
   660
                      handle Fail msg => err msg;
wenzelm@45434
   661
                    val argtypes = Syntax.check_typs ctxt (map Syntax_Phases.decode_typ args);
wenzelm@45434
   662
                    val varifyT = varifyT (fold Term.maxidx_typ argtypes ~1 + 1);
wenzelm@32761
   663
                    val vartypes = map varifyT types;
wenzelm@32761
   664
wenzelm@36159
   665
                    val subst = Type.raw_matches (vartypes, argtypes) Vartab.empty
wenzelm@35146
   666
                      handle Type.TYPE_MATCH => err "type is no proper record (extension)";
wenzelm@32761
   667
                    val alphas' =
wenzelm@42247
   668
                      map (Syntax_Phases.term_of_typ ctxt o Envir.norm_type subst o varifyT)
wenzelm@42247
   669
                        (#1 (split_last alphas));
wenzelm@32761
   670
wenzelm@32761
   671
                    val more' = mk_ext rest;
wenzelm@32761
   672
                  in
wenzelm@35430
   673
                    list_comb
wenzelm@42290
   674
                      (Syntax.const (Lexicon.mark_type (suffix ext_typeN ext)), alphas' @ [more'])
wenzelm@35146
   675
                  end
wenzelm@43683
   676
              | NONE => err ("no fields defined for " ^ quote ext))
wenzelm@43683
   677
          | NONE => err (quote name ^ " is no proper field"))
wenzelm@32761
   678
      | mk_ext [] = more;
wenzelm@35146
   679
  in
wenzelm@35146
   680
    mk_ext (field_types_tr t)
wenzelm@35146
   681
  end;
wenzelm@35146
   682
wenzelm@35363
   683
fun record_type_tr ctxt [t] = record_field_types_tr (Syntax.const @{type_syntax unit}) ctxt t
wenzelm@35146
   684
  | record_type_tr _ ts = raise TERM ("record_type_tr", ts);
wenzelm@35146
   685
wenzelm@35146
   686
fun record_type_scheme_tr ctxt [t, more] = record_field_types_tr more ctxt t
wenzelm@35146
   687
  | record_type_scheme_tr _ ts = raise TERM ("record_type_scheme_tr", ts);
wenzelm@35146
   688
wenzelm@35147
   689
wenzelm@35147
   690
fun field_tr ((Const (@{syntax_const "_field"}, _) $ Const (name, _) $ arg)) = (name, arg)
wenzelm@35147
   691
  | field_tr t = raise TERM ("field_tr", [t]);
wenzelm@35147
   692
wenzelm@35147
   693
fun fields_tr (Const (@{syntax_const "_fields"}, _) $ t $ u) = field_tr t :: fields_tr u
wenzelm@35147
   694
  | fields_tr t = [field_tr t];
wenzelm@35147
   695
wenzelm@35147
   696
fun record_fields_tr more ctxt t =
wenzelm@35147
   697
  let
wenzelm@42361
   698
    val thy = Proof_Context.theory_of ctxt;
wenzelm@35147
   699
    fun err msg = raise TERM ("Error in record input: " ^ msg, [t]);
wenzelm@35147
   700
wenzelm@35147
   701
    fun mk_ext (fargs as (name, _) :: _) =
wenzelm@42361
   702
          (case get_fieldext thy (Proof_Context.intern_const ctxt name) of
wenzelm@35147
   703
            SOME (ext, _) =>
wenzelm@35147
   704
              (case get_extfields thy ext of
wenzelm@35147
   705
                SOME fields =>
wenzelm@35147
   706
                  let
wenzelm@43681
   707
                    val (args, rest) = split_args (map fst (fst (split_last fields))) fargs
wenzelm@43681
   708
                      handle Fail msg => err msg;
wenzelm@35147
   709
                    val more' = mk_ext rest;
wenzelm@42290
   710
                  in list_comb (Syntax.const (Lexicon.mark_const (ext ^ extN)), args @ [more']) end
wenzelm@43683
   711
              | NONE => err ("no fields defined for " ^ quote ext))
wenzelm@43683
   712
          | NONE => err (quote name ^ " is no proper field"))
wenzelm@35147
   713
      | mk_ext [] = more;
wenzelm@35147
   714
  in mk_ext (fields_tr t) end;
wenzelm@35147
   715
wenzelm@35147
   716
fun record_tr ctxt [t] = record_fields_tr (Syntax.const @{const_syntax Unity}) ctxt t
wenzelm@35147
   717
  | record_tr _ ts = raise TERM ("record_tr", ts);
wenzelm@35147
   718
wenzelm@35147
   719
fun record_scheme_tr ctxt [t, more] = record_fields_tr more ctxt t
wenzelm@35147
   720
  | record_scheme_tr _ ts = raise TERM ("record_scheme_tr", ts);
wenzelm@35147
   721
wenzelm@35147
   722
wenzelm@35147
   723
fun field_update_tr (Const (@{syntax_const "_field_update"}, _) $ Const (name, _) $ arg) =
wenzelm@43683
   724
      Syntax.const (suffix updateN name) $ Abs (Name.uu_, dummyT, arg)
wenzelm@35147
   725
  | field_update_tr t = raise TERM ("field_update_tr", [t]);
wenzelm@35147
   726
wenzelm@35147
   727
fun field_updates_tr (Const (@{syntax_const "_field_updates"}, _) $ t $ u) =
wenzelm@35147
   728
      field_update_tr t :: field_updates_tr u
wenzelm@35147
   729
  | field_updates_tr t = [field_update_tr t];
wenzelm@35147
   730
wenzelm@35147
   731
fun record_update_tr [t, u] = fold (curry op $) (field_updates_tr u) t
wenzelm@35147
   732
  | record_update_tr ts = raise TERM ("record_update_tr", ts);
wenzelm@35147
   733
wenzelm@35146
   734
in
schirmer@15215
   735
wenzelm@24867
   736
val parse_translation =
wenzelm@35145
   737
 [(@{syntax_const "_record_update"}, record_update_tr)];
schirmer@14700
   738
wenzelm@35146
   739
val advanced_parse_translation =
wenzelm@35146
   740
 [(@{syntax_const "_record"}, record_tr),
wenzelm@35146
   741
  (@{syntax_const "_record_scheme"}, record_scheme_tr),
wenzelm@35146
   742
  (@{syntax_const "_record_type"}, record_type_tr),
wenzelm@35146
   743
  (@{syntax_const "_record_type_scheme"}, record_type_scheme_tr)];
wenzelm@35146
   744
wenzelm@35146
   745
end;
schirmer@14700
   746
schirmer@21226
   747
schirmer@14700
   748
(* print translations *)
schirmer@14700
   749
wenzelm@43682
   750
val type_abbr = Attrib.setup_config_bool @{binding record_type_abbr} (K true);
wenzelm@43682
   751
val type_as_fields = Attrib.setup_config_bool @{binding record_type_as_fields} (K true);
schirmer@14700
   752
wenzelm@35149
   753
wenzelm@35149
   754
local
wenzelm@35149
   755
wenzelm@35149
   756
(* FIXME early extern (!??) *)
wenzelm@35149
   757
(* FIXME Syntax.free (??) *)
wenzelm@35149
   758
fun field_type_tr' (c, t) = Syntax.const @{syntax_const "_field_type"} $ Syntax.const c $ t;
wenzelm@35149
   759
wenzelm@35149
   760
fun field_types_tr' (t, u) = Syntax.const @{syntax_const "_field_types"} $ t $ u;
wenzelm@35149
   761
wenzelm@35149
   762
fun record_type_tr' ctxt t =
wenzelm@32761
   763
  let
wenzelm@42361
   764
    val thy = Proof_Context.theory_of ctxt;
wenzelm@35149
   765
wenzelm@45427
   766
    val T = Syntax_Phases.decode_typ t;
wenzelm@45424
   767
    val varifyT = varifyT (Term.maxidx_of_typ T + 1);
wenzelm@35149
   768
wenzelm@35149
   769
    fun strip_fields T =
wenzelm@35149
   770
      (case T of
wenzelm@35615
   771
        Type (ext, args as _ :: _) =>
wenzelm@35149
   772
          (case try (unsuffix ext_typeN) ext of
wenzelm@35149
   773
            SOME ext' =>
wenzelm@35149
   774
              (case get_extfields thy ext' of
wenzelm@35615
   775
                SOME (fields as (x, _) :: _) =>
wenzelm@35615
   776
                  (case get_fieldext thy x of
wenzelm@35149
   777
                    SOME (_, alphas) =>
wenzelm@35149
   778
                     (let
wenzelm@41489
   779
                        val (f :: fs, _) = split_last fields;
wenzelm@35149
   780
                        val fields' =
wenzelm@42361
   781
                          apfst (Proof_Context.extern_const ctxt) f ::
wenzelm@42359
   782
                            map (apfst Long_Name.base_name) fs;
wenzelm@35149
   783
                        val (args', more) = split_last args;
wenzelm@41489
   784
                        val alphavars = map varifyT (#1 (split_last alphas));
wenzelm@36159
   785
                        val subst = Type.raw_matches (alphavars, args') Vartab.empty;
wenzelm@35149
   786
                        val fields'' = (map o apsnd) (Envir.norm_type subst o varifyT) fields';
wenzelm@35149
   787
                      in fields'' @ strip_fields more end
wenzelm@36159
   788
                      handle Type.TYPE_MATCH => [("", T)])
wenzelm@35615
   789
                  | _ => [("", T)])
wenzelm@35615
   790
              | _ => [("", T)])
wenzelm@35615
   791
          | _ => [("", T)])
wenzelm@35149
   792
      | _ => [("", T)]);
wenzelm@35149
   793
wenzelm@35149
   794
    val (fields, (_, moreT)) = split_last (strip_fields T);
wenzelm@35149
   795
    val _ = null fields andalso raise Match;
wenzelm@42247
   796
    val u =
wenzelm@42247
   797
      foldr1 field_types_tr'
wenzelm@42247
   798
        (map (field_type_tr' o apsnd (Syntax_Phases.term_of_typ ctxt)) fields);
wenzelm@35149
   799
  in
wenzelm@43682
   800
    if not (Config.get ctxt type_as_fields) orelse null fields then raise Match
wenzelm@35149
   801
    else if moreT = HOLogic.unitT then Syntax.const @{syntax_const "_record_type"} $ u
wenzelm@42247
   802
    else
wenzelm@42247
   803
      Syntax.const @{syntax_const "_record_type_scheme"} $ u $
wenzelm@42247
   804
        Syntax_Phases.term_of_typ ctxt moreT
wenzelm@35149
   805
  end;
wenzelm@32761
   806
wenzelm@32761
   807
(*try to reconstruct the record name type abbreviation from
wenzelm@32761
   808
  the (nested) extension types*)
wenzelm@35149
   809
fun record_type_abbr_tr' abbr alphas zeta last_ext schemeT ctxt tm =
schirmer@14700
   810
  let
wenzelm@45427
   811
    val T = Syntax_Phases.decode_typ tm;
wenzelm@45424
   812
    val varifyT = varifyT (maxidx_of_typ T + 1);
wenzelm@32761
   813
wenzelm@36151
   814
    fun mk_type_abbr subst name args =
wenzelm@36151
   815
      let val abbrT = Type (name, map (varifyT o TFree) args)
wenzelm@42247
   816
      in Syntax_Phases.term_of_typ ctxt (Envir.norm_type subst abbrT) end;
wenzelm@32761
   817
wenzelm@36159
   818
    fun match rT T = Type.raw_match (varifyT rT, T) Vartab.empty;
wenzelm@32761
   819
  in
wenzelm@43682
   820
    if Config.get ctxt type_abbr then
wenzelm@32761
   821
      (case last_extT T of
wenzelm@32761
   822
        SOME (name, _) =>
wenzelm@35148
   823
          if name = last_ext then
wenzelm@35149
   824
            let val subst = match schemeT T in
wenzelm@36151
   825
              if HOLogic.is_unitT (Envir.norm_type subst (varifyT (TFree zeta)))
wenzelm@32335
   826
              then mk_type_abbr subst abbr alphas
wenzelm@32335
   827
              else mk_type_abbr subst (suffix schemeN abbr) (alphas @ [zeta])
wenzelm@35149
   828
            end handle Type.TYPE_MATCH => record_type_tr' ctxt tm
wenzelm@32761
   829
          else raise Match (*give print translation of specialised record a chance*)
wenzelm@32761
   830
      | _ => raise Match)
wenzelm@35149
   831
    else record_type_tr' ctxt tm
wenzelm@32761
   832
  end;
schirmer@14700
   833
wenzelm@35149
   834
in
wenzelm@35149
   835
wenzelm@35149
   836
fun record_ext_type_tr' name =
schirmer@14700
   837
  let
wenzelm@42290
   838
    val ext_type_name = Lexicon.mark_type (suffix ext_typeN name);
wenzelm@35149
   839
    fun tr' ctxt ts =
wenzelm@35149
   840
      record_type_tr' ctxt (list_comb (Syntax.const ext_type_name, ts));
wenzelm@35149
   841
  in (ext_type_name, tr') end;
wenzelm@35149
   842
wenzelm@35149
   843
fun record_ext_type_abbr_tr' abbr alphas zeta last_ext schemeT name =
wenzelm@32761
   844
  let
wenzelm@42290
   845
    val ext_type_name = Lexicon.mark_type (suffix ext_typeN name);
wenzelm@32761
   846
    fun tr' ctxt ts =
wenzelm@35149
   847
      record_type_abbr_tr' abbr alphas zeta last_ext schemeT ctxt
wenzelm@35149
   848
        (list_comb (Syntax.const ext_type_name, ts));
wenzelm@35149
   849
  in (ext_type_name, tr') end;
wenzelm@35149
   850
wenzelm@35149
   851
end;
schirmer@14700
   852
wenzelm@32335
   853
wenzelm@35240
   854
local
wenzelm@35240
   855
wenzelm@35240
   856
(* FIXME Syntax.free (??) *)
wenzelm@35240
   857
fun field_tr' (c, t) = Syntax.const @{syntax_const "_field"} $ Syntax.const c $ t;
wenzelm@35240
   858
fun fields_tr' (t, u) = Syntax.const @{syntax_const "_fields"} $ t $ u;
wenzelm@35240
   859
wenzelm@35240
   860
fun record_tr' ctxt t =
wenzelm@35240
   861
  let
wenzelm@42361
   862
    val thy = Proof_Context.theory_of ctxt;
wenzelm@35240
   863
wenzelm@35240
   864
    fun strip_fields t =
wenzelm@35240
   865
      (case strip_comb t of
wenzelm@35240
   866
        (Const (ext, _), args as (_ :: _)) =>
wenzelm@42290
   867
          (case try (Lexicon.unmark_const o unsuffix extN) ext of
wenzelm@35240
   868
            SOME ext' =>
wenzelm@35240
   869
              (case get_extfields thy ext' of
wenzelm@35240
   870
                SOME fields =>
wenzelm@35240
   871
                 (let
wenzelm@41489
   872
                    val (f :: fs, _) = split_last (map fst fields);
wenzelm@42361
   873
                    val fields' = Proof_Context.extern_const ctxt f :: map Long_Name.base_name fs;
wenzelm@35240
   874
                    val (args', more) = split_last args;
wenzelm@35240
   875
                  in (fields' ~~ args') @ strip_fields more end
wenzelm@40722
   876
                  handle ListPair.UnequalLengths => [("", t)])
wenzelm@35240
   877
              | NONE => [("", t)])
wenzelm@35240
   878
          | NONE => [("", t)])
wenzelm@35240
   879
       | _ => [("", t)]);
wenzelm@35240
   880
wenzelm@35240
   881
    val (fields, (_, more)) = split_last (strip_fields t);
wenzelm@35240
   882
    val _ = null fields andalso raise Match;
wenzelm@35240
   883
    val u = foldr1 fields_tr' (map field_tr' fields);
wenzelm@35240
   884
  in
wenzelm@46046
   885
    (case more of
wenzelm@35240
   886
      Const (@{const_syntax Unity}, _) => Syntax.const @{syntax_const "_record"} $ u
wenzelm@46046
   887
    | _ => Syntax.const @{syntax_const "_record_scheme"} $ u $ more)
wenzelm@35240
   888
  end;
wenzelm@35240
   889
wenzelm@35240
   890
in
wenzelm@35240
   891
wenzelm@35240
   892
fun record_ext_tr' name =
wenzelm@35240
   893
  let
wenzelm@42290
   894
    val ext_name = Lexicon.mark_const (name ^ extN);
wenzelm@35240
   895
    fun tr' ctxt ts = record_tr' ctxt (list_comb (Syntax.const ext_name, ts));
wenzelm@35240
   896
  in (ext_name, tr') end;
wenzelm@35240
   897
wenzelm@35240
   898
end;
wenzelm@35240
   899
wenzelm@35240
   900
wenzelm@35240
   901
local
wenzelm@35240
   902
wenzelm@41578
   903
fun dest_update ctxt c =
wenzelm@42290
   904
  (case try Lexicon.unmark_const c of
wenzelm@42361
   905
    SOME d => try (unsuffix updateN) (Proof_Context.extern_const ctxt d)
wenzelm@41578
   906
  | NONE => NONE);
wenzelm@41578
   907
wenzelm@35240
   908
fun field_updates_tr' ctxt (tm as Const (c, _) $ k $ u) =
wenzelm@41578
   909
      (case dest_update ctxt c of
wenzelm@41578
   910
        SOME name =>
wenzelm@42284
   911
          (case try Syntax_Trans.const_abs_tr' k of
wenzelm@42086
   912
            SOME t =>
wenzelm@42086
   913
              apfst (cons (Syntax.const @{syntax_const "_field_update"} $ Syntax.free name $ t))
wenzelm@42086
   914
                (field_updates_tr' ctxt u)
wenzelm@42086
   915
          | NONE => ([], tm))
wenzelm@41578
   916
      | NONE => ([], tm))
wenzelm@35240
   917
  | field_updates_tr' _ tm = ([], tm);
wenzelm@35240
   918
wenzelm@35240
   919
fun record_update_tr' ctxt tm =
wenzelm@35240
   920
  (case field_updates_tr' ctxt tm of
wenzelm@35240
   921
    ([], _) => raise Match
wenzelm@35240
   922
  | (ts, u) =>
wenzelm@35240
   923
      Syntax.const @{syntax_const "_record_update"} $ u $
wenzelm@35240
   924
        foldr1 (fn (v, w) => Syntax.const @{syntax_const "_field_updates"} $ v $ w) (rev ts));
wenzelm@35240
   925
wenzelm@35240
   926
in
wenzelm@35240
   927
wenzelm@35240
   928
fun field_update_tr' name =
wenzelm@35240
   929
  let
wenzelm@42290
   930
    val update_name = Lexicon.mark_const (name ^ updateN);
wenzelm@35240
   931
    fun tr' ctxt [t, u] = record_update_tr' ctxt (Syntax.const update_name $ t $ u)
wenzelm@35240
   932
      | tr' _ _ = raise Match;
wenzelm@35240
   933
  in (update_name, tr') end;
wenzelm@35240
   934
wenzelm@35240
   935
end;
wenzelm@35240
   936
wenzelm@35240
   937
wenzelm@32335
   938
schirmer@15015
   939
(** record simprocs **)
schirmer@14358
   940
wenzelm@32799
   941
fun is_sel_upd_pair thy (Const (s, _)) (Const (u, t')) =
wenzelm@32761
   942
  (case get_updates thy u of
wenzelm@32761
   943
    SOME u_name => u_name = s
wenzelm@32761
   944
  | NONE => raise TERM ("is_sel_upd_pair: not update", [Const (u, t')]));
wenzelm@32761
   945
wenzelm@32761
   946
fun mk_comp_id f =
wenzelm@32761
   947
  let val T = range_type (fastype_of f)
wenzelm@40845
   948
  in HOLogic.mk_comp (Const (@{const_name Fun.id}, T --> T), f) end;
tsewell@32743
   949
tsewell@32752
   950
fun get_upd_funs (upd $ _ $ t) = upd :: get_upd_funs t
wenzelm@32761
   951
  | get_upd_funs _ = [];
wenzelm@32761
   952
wenzelm@32975
   953
fun get_accupd_simps thy term defset =
wenzelm@32761
   954
  let
tsewell@32743
   955
    val (acc, [body]) = strip_comb term;
wenzelm@35408
   956
    val upd_funs = sort_distinct Term_Ord.fast_term_ord (get_upd_funs body);
wenzelm@32761
   957
    fun get_simp upd =
wenzelm@32761
   958
      let
wenzelm@35133
   959
        (* FIXME fresh "f" (!?) *)
wenzelm@32761
   960
        val T = domain_type (fastype_of upd);
wenzelm@40845
   961
        val lhs = HOLogic.mk_comp (acc, upd $ Free ("f", T));
wenzelm@32761
   962
        val rhs =
wenzelm@32761
   963
          if is_sel_upd_pair thy acc upd
wenzelm@40845
   964
          then HOLogic.mk_comp (Free ("f", T), acc)
wenzelm@32761
   965
          else mk_comp_id acc;
wenzelm@32799
   966
        val prop = lhs === rhs;
wenzelm@32761
   967
        val othm =
wenzelm@42361
   968
          Goal.prove (Proof_Context.init_global thy) [] [] prop
wenzelm@32799
   969
            (fn _ =>
wenzelm@32975
   970
              simp_tac defset 1 THEN
haftmann@34151
   971
              REPEAT_DETERM (Iso_Tuple_Support.iso_tuple_intros_tac 1) THEN
wenzelm@46043
   972
              TRY (simp_tac (HOL_ss addsimps @{thms id_apply id_o o_id}) 1));
wenzelm@32761
   973
        val dest =
wenzelm@32761
   974
          if is_sel_upd_pair thy acc upd
wenzelm@46043
   975
          then @{thm o_eq_dest}
wenzelm@46043
   976
          else @{thm o_eq_id_dest};
wenzelm@35021
   977
      in Drule.export_without_context (othm RS dest) end;
tsewell@32752
   978
  in map get_simp upd_funs end;
tsewell@32743
   979
wenzelm@32975
   980
fun get_updupd_simp thy defset u u' comp =
wenzelm@32761
   981
  let
wenzelm@35133
   982
    (* FIXME fresh "f" (!?) *)
wenzelm@32761
   983
    val f = Free ("f", domain_type (fastype_of u));
wenzelm@32761
   984
    val f' = Free ("f'", domain_type (fastype_of u'));
wenzelm@40845
   985
    val lhs = HOLogic.mk_comp (u $ f, u' $ f');
wenzelm@32761
   986
    val rhs =
wenzelm@32761
   987
      if comp
wenzelm@40845
   988
      then u $ HOLogic.mk_comp (f, f')
wenzelm@40845
   989
      else HOLogic.mk_comp (u' $ f', u $ f);
wenzelm@32799
   990
    val prop = lhs === rhs;
wenzelm@32761
   991
    val othm =
wenzelm@42361
   992
      Goal.prove (Proof_Context.init_global thy) [] [] prop
wenzelm@32799
   993
        (fn _ =>
wenzelm@32975
   994
          simp_tac defset 1 THEN
haftmann@34151
   995
          REPEAT_DETERM (Iso_Tuple_Support.iso_tuple_intros_tac 1) THEN
wenzelm@46043
   996
          TRY (simp_tac (HOL_ss addsimps @{thms id_apply}) 1));
wenzelm@46043
   997
    val dest = if comp then @{thm o_eq_dest_lhs} else @{thm o_eq_dest};
wenzelm@35021
   998
  in Drule.export_without_context (othm RS dest) end;
tsewell@32743
   999
wenzelm@32975
  1000
fun get_updupd_simps thy term defset =
wenzelm@32761
  1001
  let
wenzelm@32761
  1002
    val upd_funs = get_upd_funs term;
wenzelm@32761
  1003
    val cname = fst o dest_Const;
wenzelm@32975
  1004
    fun getswap u u' = get_updupd_simp thy defset u u' (cname u = cname u');
wenzelm@32799
  1005
    fun build_swaps_to_eq _ [] swaps = swaps
wenzelm@32761
  1006
      | build_swaps_to_eq upd (u :: us) swaps =
wenzelm@32761
  1007
          let
wenzelm@32761
  1008
            val key = (cname u, cname upd);
wenzelm@32761
  1009
            val newswaps =
wenzelm@32764
  1010
              if Symreltab.defined swaps key then swaps
wenzelm@32764
  1011
              else Symreltab.insert (K true) (key, getswap u upd) swaps;
wenzelm@32761
  1012
          in
wenzelm@32761
  1013
            if cname u = cname upd then newswaps
wenzelm@32761
  1014
            else build_swaps_to_eq upd us newswaps
wenzelm@32761
  1015
          end;
wenzelm@32799
  1016
    fun swaps_needed [] _ _ swaps = map snd (Symreltab.dest swaps)
wenzelm@32761
  1017
      | swaps_needed (u :: us) prev seen swaps =
wenzelm@32761
  1018
          if Symtab.defined seen (cname u)
wenzelm@32761
  1019
          then swaps_needed us prev seen (build_swaps_to_eq u prev swaps)
wenzelm@32761
  1020
          else swaps_needed us (u :: prev) (Symtab.insert (K true) (cname u, ()) seen) swaps;
wenzelm@32764
  1021
  in swaps_needed upd_funs [] Symtab.empty Symreltab.empty end;
tsewell@32743
  1022
haftmann@34151
  1023
val named_cterm_instantiate = Iso_Tuple_Support.named_cterm_instantiate;
tsewell@32743
  1024
wenzelm@32799
  1025
fun prove_unfold_defs thy ex_simps ex_simprs prop =
schirmer@21226
  1026
  let
tsewell@32743
  1027
    val defset = get_sel_upd_defs thy;
wenzelm@32761
  1028
    val prop' = Envir.beta_eta_contract prop;
wenzelm@32799
  1029
    val (lhs, _) = Logic.dest_equals (Logic.strip_assums_concl prop');
wenzelm@32799
  1030
    val (_, args) = strip_comb lhs;
wenzelm@32975
  1031
    val simps = (if length args = 1 then get_accupd_simps else get_updupd_simps) thy lhs defset;
wenzelm@16973
  1032
  in
wenzelm@42361
  1033
    Goal.prove (Proof_Context.init_global thy) [] [] prop'
wenzelm@32799
  1034
      (fn _ =>
wenzelm@46043
  1035
        simp_tac (HOL_basic_ss addsimps (simps @ @{thms K_record_comp})) 1 THEN
wenzelm@32761
  1036
        TRY (simp_tac (HOL_basic_ss addsimps ex_simps addsimprocs ex_simprs) 1))
schirmer@15203
  1037
  end;
schirmer@15015
  1038
schirmer@15215
  1039
schirmer@15059
  1040
local
wenzelm@32761
  1041
wenzelm@32761
  1042
fun eq (s1: string) (s2: string) = (s1 = s2);
wenzelm@32761
  1043
schirmer@16822
  1044
fun has_field extfields f T =
wenzelm@32761
  1045
  exists (fn (eN, _) => exists (eq f o fst) (Symtab.lookup_list extfields eN)) (dest_recTs T);
wenzelm@32761
  1046
wenzelm@32761
  1047
fun K_skeleton n (T as Type (_, [_, kT])) (b as Bound i) (Abs (x, xT, t)) =
wenzelm@32761
  1048
      if null (loose_bnos t) then ((n, kT), (Abs (x, xT, Bound (i + 1)))) else ((n, T), b)
wenzelm@32761
  1049
  | K_skeleton n T b _ = ((n, T), b);
schirmer@25705
  1050
schirmer@15059
  1051
in
wenzelm@32761
  1052
haftmann@38012
  1053
(* simproc *)
wenzelm@32761
  1054
wenzelm@32761
  1055
(*
wenzelm@32761
  1056
  Simplify selections of an record update:
wenzelm@32761
  1057
    (1)  S (S_update k r) = k (S r)
wenzelm@32761
  1058
    (2)  S (X_update k r) = S r
wenzelm@32761
  1059
wenzelm@32761
  1060
  The simproc skips multiple updates at once, eg:
wenzelm@32761
  1061
   S (X_update x (Y_update y (S_update k r))) = k (S r)
wenzelm@32761
  1062
wenzelm@32761
  1063
  But be careful in (2) because of the extensibility of records.
wenzelm@32761
  1064
  - If S is a more-selector we have to make sure that the update on component
wenzelm@32761
  1065
    X does not affect the selected subrecord.
wenzelm@32761
  1066
  - If X is a more-selector we have to make sure that S is not in the updated
wenzelm@32761
  1067
    subrecord.
wenzelm@32761
  1068
*)
haftmann@38012
  1069
val simproc =
wenzelm@38715
  1070
  Simplifier.simproc_global @{theory HOL} "record_simp" ["x"]
wenzelm@32799
  1071
    (fn thy => fn _ => fn t =>
wenzelm@32761
  1072
      (case t of
wenzelm@32799
  1073
        (sel as Const (s, Type (_, [_, rangeS]))) $
wenzelm@32761
  1074
            ((upd as Const (u, Type (_, [_, Type (_, [rT, _])]))) $ k $ r) =>
wenzelm@32799
  1075
          if is_selector thy s andalso is_some (get_updates thy u) then
wenzelm@32799
  1076
            let
wenzelm@38758
  1077
              val {sel_upd = {updates, ...}, extfields, ...} = Data.get thy;
wenzelm@32799
  1078
wenzelm@32799
  1079
              fun mk_eq_terms ((upd as Const (u, Type(_, [kT, _]))) $ k $ r) =
wenzelm@32799
  1080
                    (case Symtab.lookup updates u of
wenzelm@32799
  1081
                      NONE => NONE
wenzelm@32799
  1082
                    | SOME u_name =>
wenzelm@32799
  1083
                        if u_name = s then
wenzelm@32799
  1084
                          (case mk_eq_terms r of
wenzelm@32799
  1085
                            NONE =>
wenzelm@32799
  1086
                              let
wenzelm@32799
  1087
                                val rv = ("r", rT);
wenzelm@32799
  1088
                                val rb = Bound 0;
wenzelm@32799
  1089
                                val (kv, kb) = K_skeleton "k" kT (Bound 1) k;
wenzelm@32799
  1090
                              in SOME (upd $ kb $ rb, kb $ (sel $ rb), [kv, rv]) end
wenzelm@32799
  1091
                          | SOME (trm, trm', vars) =>
wenzelm@32799
  1092
                              let
wenzelm@32799
  1093
                                val (kv, kb) = K_skeleton "k" kT (Bound (length vars)) k;
wenzelm@32799
  1094
                              in SOME (upd $ kb $ trm, kb $ trm', kv :: vars) end)
wenzelm@32799
  1095
                        else if has_field extfields u_name rangeS orelse
wenzelm@32799
  1096
                          has_field extfields s (domain_type kT) then NONE
wenzelm@32799
  1097
                        else
wenzelm@32799
  1098
                          (case mk_eq_terms r of
wenzelm@32799
  1099
                            SOME (trm, trm', vars) =>
wenzelm@32799
  1100
                              let val (kv, kb) = K_skeleton "k" kT (Bound (length vars)) k
wenzelm@32799
  1101
                              in SOME (upd $ kb $ trm, trm', kv :: vars) end
wenzelm@32799
  1102
                          | NONE =>
wenzelm@32799
  1103
                              let
wenzelm@32799
  1104
                                val rv = ("r", rT);
wenzelm@32799
  1105
                                val rb = Bound 0;
wenzelm@32799
  1106
                                val (kv, kb) = K_skeleton "k" kT (Bound 1) k;
wenzelm@32799
  1107
                              in SOME (upd $ kb $ rb, sel $ rb, [kv, rv]) end))
wenzelm@32799
  1108
                | mk_eq_terms _ = NONE;
wenzelm@32799
  1109
            in
wenzelm@32799
  1110
              (case mk_eq_terms (upd $ k $ r) of
wenzelm@32799
  1111
                SOME (trm, trm', vars) =>
wenzelm@32799
  1112
                  SOME
wenzelm@32799
  1113
                    (prove_unfold_defs thy [] []
wenzelm@46218
  1114
                      (Logic.list_all (vars, Logic.mk_equals (sel $ trm, trm'))))
wenzelm@32799
  1115
              | NONE => NONE)
wenzelm@32799
  1116
            end
wenzelm@32761
  1117
          else NONE
skalberg@15531
  1118
      | _ => NONE));
wenzelm@7178
  1119
wenzelm@32761
  1120
fun get_upd_acc_cong_thm upd acc thy simpset =
wenzelm@32761
  1121
  let
haftmann@38401
  1122
    val insts = [("upd", cterm_of thy upd), ("ac", cterm_of thy acc)];
wenzelm@32975
  1123
    val prop = Thm.concl_of (named_cterm_instantiate insts updacc_cong_triv);
wenzelm@32761
  1124
  in
wenzelm@42361
  1125
    Goal.prove (Proof_Context.init_global thy) [] [] prop
wenzelm@32799
  1126
      (fn _ =>
wenzelm@32975
  1127
        simp_tac simpset 1 THEN
haftmann@34151
  1128
        REPEAT_DETERM (Iso_Tuple_Support.iso_tuple_intros_tac 1) THEN
wenzelm@32975
  1129
        TRY (resolve_tac [updacc_cong_idI] 1))
tsewell@32743
  1130
  end;
tsewell@32743
  1131
wenzelm@32761
  1132
haftmann@38012
  1133
(* upd_simproc *)
wenzelm@32761
  1134
wenzelm@32761
  1135
(*Simplify multiple updates:
wenzelm@32761
  1136
    (1) "N_update y (M_update g (N_update x (M_update f r))) =
schirmer@21226
  1137
          (N_update (y o x) (M_update (g o f) r))"
wenzelm@32761
  1138
    (2)  "r(|M:= M r|) = r"
wenzelm@32761
  1139
wenzelm@32761
  1140
  In both cases "more" updates complicate matters: for this reason
wenzelm@32761
  1141
  we omit considering further updates if doing so would introduce
wenzelm@32761
  1142
  both a more update and an update to a field within it.*)
haftmann@38012
  1143
val upd_simproc =
wenzelm@38715
  1144
  Simplifier.simproc_global @{theory HOL} "record_upd_simp" ["x"]
wenzelm@32799
  1145
    (fn thy => fn _ => fn t =>
tsewell@32743
  1146
      let
wenzelm@32761
  1147
        (*We can use more-updators with other updators as long
wenzelm@32761
  1148
          as none of the other updators go deeper than any more
wenzelm@32761
  1149
          updator. min here is the depth of the deepest other
wenzelm@32761
  1150
          updator, max the depth of the shallowest more updator.*)
tsewell@32743
  1151
        fun include_depth (dep, true) (min, max) =
wenzelm@32761
  1152
              if min <= dep
wenzelm@32761
  1153
              then SOME (min, if dep <= max orelse max = ~1 then dep else max)
wenzelm@32761
  1154
              else NONE
tsewell@32743
  1155
          | include_depth (dep, false) (min, max) =
wenzelm@32761
  1156
              if dep <= max orelse max = ~1
wenzelm@32761
  1157
              then SOME (if min <= dep then dep else min, max)
wenzelm@32761
  1158
              else NONE;
tsewell@32743
  1159
wenzelm@32799
  1160
        fun getupdseq (term as (upd as Const (u, _)) $ f $ tm) min max =
wenzelm@32761
  1161
              (case get_update_details u thy of
wenzelm@32761
  1162
                SOME (s, dep, ismore) =>
wenzelm@32761
  1163
                  (case include_depth (dep, ismore) (min, max) of
wenzelm@32761
  1164
                    SOME (min', max') =>
wenzelm@32761
  1165
                      let val (us, bs, _) = getupdseq tm min' max'
tsewell@32743
  1166
                      in ((upd, s, f) :: us, bs, fastype_of term) end
wenzelm@32761
  1167
                  | NONE => ([], term, HOLogic.unitT))
wenzelm@32761
  1168
              | NONE => ([], term, HOLogic.unitT))
tsewell@32743
  1169
          | getupdseq term _ _ = ([], term, HOLogic.unitT);
tsewell@32743
  1170
tsewell@32743
  1171
        val (upds, base, baseT) = getupdseq t 0 ~1;
tsewell@32743
  1172
wenzelm@32799
  1173
        fun is_upd_noop s (Abs (n, T, Const (s', T') $ tm')) tm =
wenzelm@32761
  1174
              if s = s' andalso null (loose_bnos tm')
wenzelm@32761
  1175
                andalso subst_bound (HOLogic.unit, tm') = tm
wenzelm@32761
  1176
              then (true, Abs (n, T, Const (s', T') $ Bound 1))
wenzelm@32761
  1177
              else (false, HOLogic.unit)
wenzelm@32799
  1178
          | is_upd_noop _ _ _ = (false, HOLogic.unit);
wenzelm@32799
  1179
wenzelm@32799
  1180
        fun get_noop_simps (upd as Const _) (Abs (_, _, (acc as Const _) $ _)) =
wenzelm@32761
  1181
          let
wenzelm@32761
  1182
            val ss = get_sel_upd_defs thy;
tsewell@32743
  1183
            val uathm = get_upd_acc_cong_thm upd acc thy ss;
wenzelm@32761
  1184
          in
wenzelm@35021
  1185
           [Drule.export_without_context (uathm RS updacc_noopE),
wenzelm@35021
  1186
            Drule.export_without_context (uathm RS updacc_noop_compE)]
wenzelm@32761
  1187
          end;
wenzelm@32761
  1188
wenzelm@32974
  1189
        (*If f is constant then (f o g) = f.  We know that K_skeleton
wenzelm@32761
  1190
          only returns constant abstractions thus when we see an
wenzelm@32761
  1191
          abstraction we can discard inner updates.*)
tsewell@32743
  1192
        fun add_upd (f as Abs _) fs = [f]
tsewell@32743
  1193
          | add_upd f fs = (f :: fs);
tsewell@32743
  1194
wenzelm@32761
  1195
        (*mk_updterm returns
wenzelm@32761
  1196
          (orig-term-skeleton, simplified-skeleton,
wenzelm@32761
  1197
            variables, duplicate-updates, simp-flag, noop-simps)
wenzelm@32761
  1198
wenzelm@32761
  1199
          where duplicate-updates is a table used to pass upward
wenzelm@32761
  1200
          the list of update functions which can be composed
wenzelm@32761
  1201
          into an update above them, simp-flag indicates whether
wenzelm@32761
  1202
          any simplification was achieved, and noop-simps are
wenzelm@32761
  1203
          used for eliminating case (2) defined above*)
wenzelm@32761
  1204
        fun mk_updterm ((upd as Const (u, T), s, f) :: upds) above term =
wenzelm@32761
  1205
              let
wenzelm@32761
  1206
                val (lhs, rhs, vars, dups, simp, noops) =
tsewell@32743
  1207
                  mk_updterm upds (Symtab.update (u, ()) above) term;
wenzelm@32761
  1208
                val (fvar, skelf) =
wenzelm@32761
  1209
                  K_skeleton (Long_Name.base_name s) (domain_type T) (Bound (length vars)) f;
wenzelm@32761
  1210
                val (isnoop, skelf') = is_upd_noop s f term;
wenzelm@32761
  1211
                val funT = domain_type T;
wenzelm@35133
  1212
                fun mk_comp_local (f, f') =
wenzelm@35133
  1213
                  Const (@{const_name Fun.comp}, funT --> funT --> funT) $ f $ f';
wenzelm@32761
  1214
              in
wenzelm@32761
  1215
                if isnoop then
wenzelm@32761
  1216
                  (upd $ skelf' $ lhs, rhs, vars,
tsewell@32743
  1217
                    Symtab.update (u, []) dups, true,
tsewell@32743
  1218
                    if Symtab.defined noops u then noops
tsewell@32743
  1219
                    else Symtab.update (u, get_noop_simps upd skelf') noops)
wenzelm@32761
  1220
                else if Symtab.defined above u then
wenzelm@32761
  1221
                  (upd $ skelf $ lhs, rhs, fvar :: vars,
tsewell@32743
  1222
                    Symtab.map_default (u, []) (add_upd skelf) dups,
tsewell@32743
  1223
                    true, noops)
wenzelm@32761
  1224
                else
wenzelm@32761
  1225
                  (case Symtab.lookup dups u of
wenzelm@32761
  1226
                    SOME fs =>
wenzelm@32761
  1227
                     (upd $ skelf $ lhs,
wenzelm@32761
  1228
                      upd $ foldr1 mk_comp_local (add_upd skelf fs) $ rhs,
wenzelm@32761
  1229
                      fvar :: vars, dups, true, noops)
wenzelm@32761
  1230
                  | NONE => (upd $ skelf $ lhs, upd $ skelf $ rhs, fvar :: vars, dups, simp, noops))
wenzelm@32761
  1231
              end
wenzelm@32799
  1232
          | mk_updterm [] _ _ =
wenzelm@32761
  1233
              (Bound 0, Bound 0, [("r", baseT)], Symtab.empty, false, Symtab.empty)
wenzelm@32799
  1234
          | mk_updterm us _ _ = raise TERM ("mk_updterm match", map (fn (x, _, _) => x) us);
wenzelm@32799
  1235
wenzelm@32799
  1236
        val (lhs, rhs, vars, _, simp, noops) = mk_updterm upds Symtab.empty base;
wenzelm@32952
  1237
        val noops' = maps snd (Symtab.dest noops);
tsewell@32743
  1238
      in
tsewell@32743
  1239
        if simp then
wenzelm@32761
  1240
          SOME
haftmann@38012
  1241
            (prove_unfold_defs thy noops' [simproc]
wenzelm@46218
  1242
              (Logic.list_all (vars, Logic.mk_equals (lhs, rhs))))
tsewell@32743
  1243
        else NONE
wenzelm@32761
  1244
      end);
wenzelm@32761
  1245
wenzelm@32761
  1246
end;
schirmer@15015
  1247
tsewell@32743
  1248
haftmann@38012
  1249
(* eq_simproc *)
wenzelm@32761
  1250
wenzelm@32974
  1251
(*Look up the most specific record-equality.
wenzelm@32761
  1252
wenzelm@32761
  1253
 Note on efficiency:
wenzelm@32761
  1254
 Testing equality of records boils down to the test of equality of all components.
wenzelm@32761
  1255
 Therefore the complexity is: #components * complexity for single component.
wenzelm@32761
  1256
 Especially if a record has a lot of components it may be better to split up
haftmann@38012
  1257
 the record first and do simplification on that (split_simp_tac).
wenzelm@32761
  1258
 e.g. r(|lots of updates|) = x
wenzelm@32761
  1259
haftmann@38012
  1260
             eq_simproc          split_simp_tac
wenzelm@32761
  1261
 Complexity: #components * #updates     #updates
wenzelm@32761
  1262
*)
haftmann@38012
  1263
val eq_simproc =
wenzelm@38715
  1264
  Simplifier.simproc_global @{theory HOL} "record_eq_simp" ["r = s"]
wenzelm@18858
  1265
    (fn thy => fn _ => fn t =>
haftmann@38864
  1266
      (case t of Const (@{const_name HOL.eq}, Type (_, [T, _])) $ _ $ _ =>
wenzelm@32761
  1267
        (case rec_id ~1 T of
wenzelm@32761
  1268
          "" => NONE
wenzelm@32761
  1269
        | name =>
wenzelm@32761
  1270
            (case get_equalities thy name of
wenzelm@32761
  1271
              NONE => NONE
wenzelm@35410
  1272
            | SOME thm => SOME (thm RS @{thm Eq_TrueI})))
wenzelm@32761
  1273
      | _ => NONE));
wenzelm@32761
  1274
berghofe@14079
  1275
haftmann@38012
  1276
(* split_simproc *)
wenzelm@32761
  1277
wenzelm@32761
  1278
(*Split quantified occurrences of records, for which P holds.  P can peek on the
wenzelm@32761
  1279
  subterm starting at the quantified occurrence of the record (including the quantifier):
wenzelm@32761
  1280
    P t = 0: do not split
wenzelm@32761
  1281
    P t = ~1: completely split
wenzelm@32761
  1282
    P t > 0: split up to given bound of record extensions.*)
haftmann@38012
  1283
fun split_simproc P =
wenzelm@38715
  1284
  Simplifier.simproc_global @{theory HOL} "record_split_simp" ["x"]
wenzelm@18858
  1285
    (fn thy => fn _ => fn t =>
wenzelm@32761
  1286
      (case t of
wenzelm@32799
  1287
        Const (quantifier, Type (_, [Type (_, [T, _]), _])) $ _ =>
wenzelm@35147
  1288
          if quantifier = @{const_name all} orelse
wenzelm@35147
  1289
            quantifier = @{const_name All} orelse
wenzelm@35133
  1290
            quantifier = @{const_name Ex}
wenzelm@35133
  1291
          then
wenzelm@32761
  1292
            (case rec_id ~1 T of
wenzelm@32761
  1293
              "" => NONE
wenzelm@32799
  1294
            | _ =>
wenzelm@32761
  1295
                let val split = P t in
wenzelm@32761
  1296
                  if split <> 0 then
wenzelm@32761
  1297
                    (case get_splits thy (rec_id split T) of
wenzelm@32761
  1298
                      NONE => NONE
wenzelm@32761
  1299
                    | SOME (all_thm, All_thm, Ex_thm, _) =>
wenzelm@32761
  1300
                        SOME
wenzelm@32761
  1301
                          (case quantifier of
wenzelm@35133
  1302
                            @{const_name all} => all_thm
wenzelm@46043
  1303
                          | @{const_name All} => All_thm RS @{thm eq_reflection}
wenzelm@46043
  1304
                          | @{const_name Ex} => Ex_thm RS @{thm eq_reflection}
wenzelm@43683
  1305
                          | _ => raise Fail "split_simproc"))
wenzelm@32761
  1306
                  else NONE
wenzelm@32761
  1307
                end)
wenzelm@32761
  1308
          else NONE
wenzelm@32761
  1309
      | _ => NONE));
wenzelm@7178
  1310
haftmann@38012
  1311
val ex_sel_eq_simproc =
wenzelm@38715
  1312
  Simplifier.simproc_global @{theory HOL} "ex_sel_eq_simproc" ["Ex t"]
wenzelm@18858
  1313
    (fn thy => fn ss => fn t =>
wenzelm@32761
  1314
      let
wenzelm@32761
  1315
        fun mkeq (lr, Teq, (sel, Tsel), x) i =
wenzelm@32761
  1316
          if is_selector thy sel then
wenzelm@32761
  1317
            let
wenzelm@32761
  1318
              val x' =
wenzelm@47234
  1319
                if not (Term.is_dependent x)
wenzelm@32761
  1320
                then Free ("x" ^ string_of_int i, range_type Tsel)
wenzelm@32761
  1321
                else raise TERM ("", [x]);
wenzelm@32761
  1322
              val sel' = Const (sel, Tsel) $ Bound 0;
wenzelm@32761
  1323
              val (l, r) = if lr then (sel', x') else (x', sel');
haftmann@38864
  1324
            in Const (@{const_name HOL.eq}, Teq) $ l $ r end
wenzelm@32761
  1325
          else raise TERM ("", [Const (sel, Tsel)]);
wenzelm@32761
  1326
haftmann@38864
  1327
        fun dest_sel_eq (Const (@{const_name HOL.eq}, Teq) $ (Const (sel, Tsel) $ Bound 0) $ X) =
wenzelm@32761
  1328
              (true, Teq, (sel, Tsel), X)
haftmann@38864
  1329
          | dest_sel_eq (Const (@{const_name HOL.eq}, Teq) $ X $ (Const (sel, Tsel) $ Bound 0)) =
wenzelm@32761
  1330
              (false, Teq, (sel, Tsel), X)
wenzelm@32761
  1331
          | dest_sel_eq _ = raise TERM ("", []);
wenzelm@32761
  1332
      in
wenzelm@32761
  1333
        (case t of
wenzelm@35133
  1334
          Const (@{const_name Ex}, Tex) $ Abs (s, T, t) =>
wenzelm@32761
  1335
           (let
wenzelm@35133
  1336
             val eq = mkeq (dest_sel_eq t) 0;
wenzelm@35133
  1337
             val prop =
wenzelm@46218
  1338
               Logic.list_all ([("r", T)],
wenzelm@35133
  1339
                 Logic.mk_equals
wenzelm@45740
  1340
                  (Const (@{const_name Ex}, Tex) $ Abs (s, T, eq), @{term True}));
wenzelm@46049
  1341
            in
wenzelm@46049
  1342
              SOME (Skip_Proof.prove_global thy [] [] prop
wenzelm@46049
  1343
                (fn _ => simp_tac (Simplifier.inherit_context ss (get_simpset thy)
wenzelm@46049
  1344
                    addsimps @{thms simp_thms} addsimprocs [split_simproc (K ~1)]) 1))
wenzelm@46049
  1345
            end handle TERM _ => NONE)
wenzelm@32761
  1346
        | _ => NONE)
wenzelm@32761
  1347
      end);
schirmer@14427
  1348
wenzelm@5698
  1349
haftmann@38012
  1350
(* split_simp_tac *)
wenzelm@32761
  1351
wenzelm@32761
  1352
(*Split (and simplify) all records in the goal for which P holds.
wenzelm@32761
  1353
  For quantified occurrences of a record
wenzelm@32761
  1354
  P can peek on the whole subterm (including the quantifier); for free variables P
wenzelm@32761
  1355
  can only peek on the variable itself.
wenzelm@32761
  1356
  P t = 0: do not split
wenzelm@32761
  1357
  P t = ~1: completely split
wenzelm@32761
  1358
  P t > 0: split up to given bound of record extensions.*)
haftmann@38012
  1359
fun split_simp_tac thms P = CSUBGOAL (fn (cgoal, i) =>
schirmer@14255
  1360
  let
wenzelm@32975
  1361
    val thy = Thm.theory_of_cterm cgoal;
wenzelm@32975
  1362
wenzelm@32975
  1363
    val goal = term_of cgoal;
wenzelm@32975
  1364
    val frees = filter (is_recT o #2) (Term.add_frees goal []);
schirmer@14255
  1365
schirmer@14700
  1366
    val has_rec = exists_Const
schirmer@14255
  1367
      (fn (s, Type (_, [Type (_, [T, _]), _])) =>
wenzelm@35133
  1368
          (s = @{const_name all} orelse s = @{const_name All} orelse s = @{const_name Ex}) andalso
wenzelm@35133
  1369
          is_recT T
schirmer@14255
  1370
        | _ => false);
schirmer@14255
  1371
wenzelm@17261
  1372
    fun mk_split_free_tac free induct_thm i =
wenzelm@32761
  1373
      let
wenzelm@32761
  1374
        val cfree = cterm_of thy free;
wenzelm@32761
  1375
        val _$ (_ $ r) = concl_of induct_thm;
wenzelm@32761
  1376
        val crec = cterm_of thy r;
wenzelm@32761
  1377
        val thm = cterm_instantiate [(crec, cfree)] induct_thm;
wenzelm@32761
  1378
      in
wenzelm@32975
  1379
        simp_tac (HOL_basic_ss addsimps @{thms induct_atomize}) i THEN
wenzelm@32975
  1380
        rtac thm i THEN
wenzelm@32975
  1381
        simp_tac (HOL_basic_ss addsimps @{thms induct_rulify}) i
wenzelm@32761
  1382
      end;
wenzelm@32761
  1383
wenzelm@32975
  1384
    val split_frees_tacs =
wenzelm@32975
  1385
      frees |> map_filter (fn (x, T) =>
wenzelm@32975
  1386
        (case rec_id ~1 T of
wenzelm@32975
  1387
          "" => NONE
wenzelm@32975
  1388
        | _ =>
wenzelm@32975
  1389
            let
wenzelm@32975
  1390
              val free = Free (x, T);
wenzelm@32975
  1391
              val split = P free;
wenzelm@32975
  1392
            in
wenzelm@32975
  1393
              if split <> 0 then
wenzelm@32975
  1394
                (case get_splits thy (rec_id split T) of
wenzelm@32975
  1395
                  NONE => NONE
wenzelm@32975
  1396
                | SOME (_, _, _, induct_thm) =>
wenzelm@32975
  1397
                    SOME (mk_split_free_tac free induct_thm i))
wenzelm@32975
  1398
              else NONE
wenzelm@32975
  1399
            end));
wenzelm@17261
  1400
haftmann@38012
  1401
    val simprocs = if has_rec goal then [split_simproc P] else [];
wenzelm@46043
  1402
    val thms' = @{thms o_apply K_record_comp} @ thms;
wenzelm@32761
  1403
  in
wenzelm@32975
  1404
    EVERY split_frees_tacs THEN
wenzelm@46047
  1405
    full_simp_tac (get_simpset thy addsimps thms' addsimprocs simprocs) i
wenzelm@32975
  1406
  end);
schirmer@14255
  1407
schirmer@14700
  1408
haftmann@38012
  1409
(* split_tac *)
wenzelm@32761
  1410
wenzelm@35147
  1411
(*Split all records in the goal, which are quantified by !! or ALL.*)
haftmann@38012
  1412
val split_tac = CSUBGOAL (fn (cgoal, i) =>
schirmer@14700
  1413
  let
wenzelm@32975
  1414
    val goal = term_of cgoal;
wenzelm@32975
  1415
schirmer@14700
  1416
    val has_rec = exists_Const
schirmer@14700
  1417
      (fn (s, Type (_, [Type (_, [T, _]), _])) =>
wenzelm@35147
  1418
          (s = @{const_name all} orelse s = @{const_name All}) andalso is_recT T
schirmer@14700
  1419
        | _ => false);
wenzelm@17261
  1420
wenzelm@35240
  1421
    fun is_all (Const (@{const_name all}, _) $ _) = ~1
wenzelm@35240
  1422
      | is_all (Const (@{const_name All}, _) $ _) = ~1
wenzelm@35240
  1423
      | is_all _ = 0;
wenzelm@32761
  1424
  in
wenzelm@32761
  1425
    if has_rec goal then
wenzelm@46047
  1426
      full_simp_tac (HOL_basic_ss addsimprocs [split_simproc is_all]) i
wenzelm@32975
  1427
    else no_tac
wenzelm@32975
  1428
  end);
schirmer@14700
  1429
wenzelm@32335
  1430
wenzelm@6358
  1431
(* wrapper *)
wenzelm@6358
  1432
haftmann@38012
  1433
val split_name = "record_split_tac";
wenzelm@42793
  1434
val split_wrapper = (split_name, fn _ => fn tac => split_tac ORELSE' tac);
wenzelm@5698
  1435
wenzelm@16330
  1436
wenzelm@16330
  1437
wenzelm@4867
  1438
(** theory extender interface **)
wenzelm@4867
  1439
schirmer@14700
  1440
(* attributes *)
schirmer@14700
  1441
wenzelm@33368
  1442
fun case_names_fields x = Rule_Cases.case_names ["fields"] x;
wenzelm@24830
  1443
fun induct_type_global name = [case_names_fields, Induct.induct_type name];
wenzelm@24830
  1444
fun cases_type_global name = [case_names_fields, Induct.cases_type name];
schirmer@14700
  1445
wenzelm@32335
  1446
schirmer@14700
  1447
(* tactics *)
schirmer@14700
  1448
wenzelm@32761
  1449
(*Do case analysis / induction according to rule on last parameter of ith subgoal
wenzelm@32761
  1450
  (or on s if there are no parameters).
wenzelm@32761
  1451
  Instatiation of record variable (and predicate) in rule is calculated to
wenzelm@32761
  1452
  avoid problems with higher order unification.*)
wenzelm@32975
  1453
fun try_param_tac s rule = CSUBGOAL (fn (cgoal, i) =>
schirmer@14700
  1454
  let
wenzelm@32975
  1455
    val cert = Thm.cterm_of (Thm.theory_of_cterm cgoal);
wenzelm@32975
  1456
wenzelm@32975
  1457
    val g = Thm.term_of cgoal;
schirmer@14700
  1458
    val params = Logic.strip_params g;
schirmer@14700
  1459
    val concl = HOLogic.dest_Trueprop (Logic.strip_assums_concl g);
wenzelm@32975
  1460
    val rule' = Thm.lift_rule cgoal rule;
wenzelm@46051
  1461
    val (P, ys) = strip_comb (HOLogic.dest_Trueprop (Logic.strip_assums_concl (prop_of rule')));
wenzelm@32761
  1462
    (*ca indicates if rule is a case analysis or induction rule*)
wenzelm@32761
  1463
    val (x, ca) =
haftmann@33957
  1464
      (case rev (drop (length params) ys) of
schirmer@14700
  1465
        [] => (head_of (fst (HOLogic.dest_eq (HOLogic.dest_Trueprop
schirmer@14700
  1466
          (hd (rev (Logic.strip_assums_hyp (hd (prems_of rule')))))))), true)
schirmer@14700
  1467
      | [x] => (head_of x, false));
wenzelm@38758
  1468
    val rule'' =
wenzelm@38758
  1469
      cterm_instantiate
wenzelm@38758
  1470
        (map (pairself cert)
wenzelm@38758
  1471
          (case rev params of
wenzelm@38758
  1472
            [] =>
wenzelm@38758
  1473
              (case AList.lookup (op =) (Term.add_frees g []) s of
wenzelm@40315
  1474
                NONE => error "try_param_tac: no such variable"
wenzelm@38758
  1475
              | SOME T => [(P, if ca then concl else lambda (Free (s, T)) concl), (x, Free (s, T))])
wenzelm@38758
  1476
          | (_, T) :: _ =>
wenzelm@46219
  1477
              [(P, fold_rev Term.abs params (if ca then concl else incr_boundvars 1 (Abs (s, T, concl)))),
wenzelm@46219
  1478
                (x, fold_rev Term.abs params (Bound 0))])) rule';
wenzelm@32975
  1479
  in compose_tac (false, rule'', nprems_of rule) i end);
schirmer@14700
  1480
schirmer@15215
  1481
wenzelm@32799
  1482
fun extension_definition name fields alphas zeta moreT more vars thy =
wenzelm@17261
  1483
  let
wenzelm@43682
  1484
    val ctxt = Proof_Context.init_global thy;
wenzelm@43682
  1485
wenzelm@35239
  1486
    val base_name = Long_Name.base_name name;
wenzelm@35239
  1487
wenzelm@32977
  1488
    val fieldTs = map snd fields;
wenzelm@35239
  1489
    val fields_moreTs = fieldTs @ [moreT];
wenzelm@35239
  1490
wenzelm@32761
  1491
    val alphas_zeta = alphas @ [zeta];
wenzelm@35239
  1492
wenzelm@35239
  1493
    val ext_binding = Binding.name (suffix extN base_name);
wenzelm@35239
  1494
    val ext_name = suffix extN name;
haftmann@38533
  1495
    val ext_tyco = suffix ext_typeN name
haftmann@38533
  1496
    val extT = Type (ext_tyco, map TFree alphas_zeta);
wenzelm@35239
  1497
    val ext_type = fields_moreTs ---> extT;
wenzelm@35239
  1498
wenzelm@35239
  1499
wenzelm@35239
  1500
    (* the tree of new types that will back the record extension *)
wenzelm@32767
  1501
haftmann@34151
  1502
    val mktreeV = Balanced_Tree.make Iso_Tuple_Support.mk_cons_tuple;
haftmann@34151
  1503
haftmann@34151
  1504
    fun mk_iso_tuple (left, right) (thy, i) =
wenzelm@32761
  1505
      let
wenzelm@32761
  1506
        val suff = if i = 0 then ext_typeN else inner_typeN ^ string_of_int i;
wenzelm@35239
  1507
        val ((_, cons), thy') = thy
wenzelm@35239
  1508
          |> Iso_Tuple_Support.add_iso_tuple_type
wenzelm@38758
  1509
            (Binding.suffix_name suff (Binding.name base_name), alphas_zeta)
wenzelm@38758
  1510
              (fastype_of left, fastype_of right);
wenzelm@32761
  1511
      in
wenzelm@32764
  1512
        (cons $ left $ right, (thy', i + 1))
wenzelm@32761
  1513
      end;
wenzelm@32761
  1514
haftmann@34151
  1515
    (*trying to create a 1-element iso_tuple will fail, and is pointless anyway*)
haftmann@34151
  1516
    fun mk_even_iso_tuple [arg] = pair arg
haftmann@34151
  1517
      | mk_even_iso_tuple args = mk_iso_tuple (Iso_Tuple_Support.dest_cons_tuple (mktreeV args));
tsewell@32743
  1518
tsewell@32743
  1519
    fun build_meta_tree_type i thy vars more =
wenzelm@32761
  1520
      let val len = length vars in
wenzelm@32764
  1521
        if len < 1 then raise TYPE ("meta_tree_type args too short", [], vars)
wenzelm@32761
  1522
        else if len > 16 then
wenzelm@32761
  1523
          let
wenzelm@32761
  1524
            fun group16 [] = []
haftmann@33957
  1525
              | group16 xs = take 16 xs :: group16 (drop 16 xs);
wenzelm@32761
  1526
            val vars' = group16 vars;
haftmann@34151
  1527
            val (composites, (thy', i')) = fold_map mk_even_iso_tuple vars' (thy, i);
wenzelm@32761
  1528
          in
wenzelm@32761
  1529
            build_meta_tree_type i' thy' composites more
wenzelm@32761
  1530
          end
wenzelm@32761
  1531
        else
haftmann@34151
  1532
          let val (term, (thy', _)) = mk_iso_tuple (mktreeV vars, more) (thy, 0)
wenzelm@32761
  1533
          in (term, thy') end
wenzelm@32761
  1534
      end;
tsewell@32743
  1535
wenzelm@43682
  1536
    val _ = timing_msg ctxt "record extension preparing definitions";
tsewell@32743
  1537
wenzelm@32761
  1538
tsewell@32743
  1539
    (* 1st stage part 1: introduce the tree of new types *)
wenzelm@32761
  1540
wenzelm@46044
  1541
    val (ext_body, typ_thy) = timeit_msg ctxt "record extension nested type def:" (fn () =>
wenzelm@46044
  1542
      build_meta_tree_type 1 thy vars more);
tsewell@32743
  1543
wenzelm@32761
  1544
schirmer@14700
  1545
    (* prepare declarations and definitions *)
wenzelm@17261
  1546
tsewell@32743
  1547
    (* 1st stage part 2: define the ext constant *)
wenzelm@32761
  1548
wenzelm@35239
  1549
    fun mk_ext args = list_comb (Const (ext_name, ext_type), args);
wenzelm@35239
  1550
    val ext_spec = Logic.mk_equals (mk_ext (vars @ [more]), ext_body);
wenzelm@35239
  1551
wenzelm@46044
  1552
    val ([ext_def], defs_thy) = timeit_msg ctxt "record extension constructor def:" (fn () =>
tsewell@32743
  1553
      typ_thy
wenzelm@42375
  1554
      |> Sign.declare_const_global ((ext_binding, ext_type), NoSyn) |> snd
wenzelm@39557
  1555
      |> Global_Theory.add_defs false [((Thm.def_binding ext_binding, ext_spec), [])]
wenzelm@46044
  1556
      ||> Theory.checkpoint);
wenzelm@17261
  1557
wenzelm@32799
  1558
schirmer@14700
  1559
    (* prepare propositions *)
wenzelm@32799
  1560
wenzelm@43682
  1561
    val _ = timing_msg ctxt "record extension preparing propositions";
wenzelm@32761
  1562
    val vars_more = vars @ [more];
wenzelm@32761
  1563
    val variants = map (fn Free (x, _) => x) vars_more;
schirmer@15215
  1564
    val ext = mk_ext vars_more;
wenzelm@32761
  1565
    val s = Free (rN, extT);
wenzelm@43324
  1566
    val P = Free (singleton (Name.variant_list variants) "P", extT --> HOLogic.boolT);
wenzelm@17261
  1567
wenzelm@43683
  1568
    val inject_prop =  (* FIXME local x x' *)
wenzelm@32761
  1569
      let val vars_more' = map (fn (Free (x, T)) => Free (x ^ "'", T)) vars_more in
wenzelm@32761
  1570
        HOLogic.mk_conj (HOLogic.eq_const extT $
wenzelm@45740
  1571
          mk_ext vars_more $ mk_ext vars_more', @{term True})
wenzelm@32761
  1572
        ===
wenzelm@32761
  1573
        foldr1 HOLogic.mk_conj
wenzelm@45740
  1574
          (map HOLogic.mk_eq (vars_more ~~ vars_more') @ [@{term True}])
schirmer@14700
  1575
      end;
wenzelm@17261
  1576
wenzelm@46215
  1577
    val induct_prop = (fold_rev Logic.all vars_more (Trueprop (P $ ext)), Trueprop (P $ s));
schirmer@15012
  1578
wenzelm@43683
  1579
    val split_meta_prop =  (* FIXME local P *)
wenzelm@46215
  1580
      let val P = Free (singleton (Name.variant_list variants) "P", extT --> propT)
wenzelm@46215
  1581
      in Logic.mk_equals (Logic.all s (P $ s), fold_rev Logic.all vars_more (P $ ext)) end;
schirmer@15015
  1582
wenzelm@46044
  1583
    val inject = timeit_msg ctxt "record extension inject proof:" (fn () =>
wenzelm@32761
  1584
      simplify HOL_ss
wenzelm@46049
  1585
        (Skip_Proof.prove_global defs_thy [] [] inject_prop
wenzelm@32799
  1586
          (fn _ =>
wenzelm@32975
  1587
            simp_tac (HOL_basic_ss addsimps [ext_def]) 1 THEN
wenzelm@32975
  1588
            REPEAT_DETERM
wenzelm@46043
  1589
              (rtac @{thm refl_conj_eq} 1 ORELSE
haftmann@34151
  1590
                Iso_Tuple_Support.iso_tuple_intros_tac 1 ORELSE
wenzelm@46044
  1591
                rtac refl 1))));
wenzelm@46044
  1592
schirmer@14700
  1593
wenzelm@32761
  1594
    (*We need a surjection property r = (| f = f r, g = g r ... |)
wenzelm@32761
  1595
      to prove other theorems. We haven't given names to the accessors
wenzelm@32761
  1596
      f, g etc yet however, so we generate an ext structure with
wenzelm@32761
  1597
      free variables as all arguments and allow the introduction tactic to
wenzelm@35021
  1598
      operate on it as far as it can. We then use Drule.export_without_context
wenzelm@35021
  1599
      to convert the free variables into unifiable variables and unify them with
wenzelm@32761
  1600
      (roughly) the definition of the accessor.*)
wenzelm@46044
  1601
    val surject = timeit_msg ctxt "record extension surjective proof:" (fn () =>
wenzelm@32761
  1602
      let
tsewell@32743
  1603
        val cterm_ext = cterm_of defs_thy ext;
wenzelm@32761
  1604
        val start = named_cterm_instantiate [("y", cterm_ext)] surject_assist_idE;
wenzelm@32761
  1605
        val tactic1 =
wenzelm@32761
  1606
          simp_tac (HOL_basic_ss addsimps [ext_def]) 1 THEN
haftmann@34151
  1607
          REPEAT_ALL_NEW Iso_Tuple_Support.iso_tuple_intros_tac 1;
wenzelm@32761
  1608
        val tactic2 = REPEAT (rtac surject_assistI 1 THEN rtac refl 1);
wenzelm@32972
  1609
        val [halfway] = Seq.list_of (tactic1 start);
wenzelm@35021
  1610
        val [surject] = Seq.list_of (tactic2 (Drule.export_without_context halfway));
tsewell@32743
  1611
      in
tsewell@32743
  1612
        surject
wenzelm@46044
  1613
      end);
wenzelm@46044
  1614
wenzelm@46044
  1615
    val split_meta = timeit_msg ctxt "record extension split_meta proof:" (fn () =>
wenzelm@46049
  1616
      Skip_Proof.prove_global defs_thy [] [] split_meta_prop
wenzelm@32799
  1617
        (fn _ =>
wenzelm@32975
  1618
          EVERY1
wenzelm@46186
  1619
           [rtac @{thm equal_intr_rule}, Goal.norm_hhf_tac,
wenzelm@46043
  1620
            etac @{thm meta_allE}, atac,
wenzelm@46043
  1621
            rtac (@{thm prop_subst} OF [surject]),
wenzelm@46044
  1622
            REPEAT o etac @{thm meta_allE}, atac]));
wenzelm@46044
  1623
wenzelm@46044
  1624
    val induct = timeit_msg ctxt "record extension induct proof:" (fn () =>
wenzelm@32761
  1625
      let val (assm, concl) = induct_prop in
wenzelm@46049
  1626
        Skip_Proof.prove_global defs_thy [] [assm] concl
wenzelm@32761
  1627
          (fn {prems, ...} =>
wenzelm@46708
  1628
            cut_tac (split_meta RS Drule.equal_elim_rule2) 1 THEN
wenzelm@32975
  1629
            resolve_tac prems 2 THEN
wenzelm@32975
  1630
            asm_simp_tac HOL_ss 1)
wenzelm@46044
  1631
      end);
schirmer@14700
  1632
wenzelm@46055
  1633
    val ([(_, [induct']), (_, [inject']), (_, [surjective']), (_, [split_meta'])], thm_thy) =
wenzelm@17261
  1634
      defs_thy
wenzelm@46055
  1635
      |> Global_Theory.note_thmss ""
wenzelm@46055
  1636
          [((Binding.name "ext_induct", []), [([induct], [])]),
wenzelm@46055
  1637
           ((Binding.name "ext_inject", []), [([inject], [])]),
wenzelm@46055
  1638
           ((Binding.name "ext_surjective", []), [([surject], [])]),
wenzelm@46055
  1639
           ((Binding.name "ext_split", []), [([split_meta], [])])];
wenzelm@38758
  1640
  in
wenzelm@38758
  1641
    (((ext_name, ext_type), (ext_tyco, alphas_zeta),
wenzelm@38758
  1642
      extT, induct', inject', surjective', split_meta', ext_def), thm_thy)
wenzelm@38758
  1643
  end;
wenzelm@32761
  1644
wenzelm@32761
  1645
fun chunks [] [] = []
wenzelm@32761
  1646
  | chunks [] xs = [xs]
haftmann@33957
  1647
  | chunks (l :: ls) xs = take l xs :: chunks ls (drop l xs);
wenzelm@17261
  1648
wenzelm@32764
  1649
fun chop_last [] = error "chop_last: list should not be empty"
wenzelm@32761
  1650
  | chop_last [x] = ([], x)
wenzelm@32761
  1651
  | chop_last (x :: xs) = let val (tl, l) = chop_last xs in (x :: tl, l) end;
wenzelm@32761
  1652
wenzelm@32799
  1653
fun subst_last _ [] = error "subst_last: list should not be empty"
wenzelm@32799
  1654
  | subst_last s [_] = [s]
wenzelm@32761
  1655
  | subst_last s (x :: xs) = x :: subst_last s xs;
wenzelm@32761
  1656
wenzelm@32761
  1657
wenzelm@32761
  1658
(* mk_recordT *)
wenzelm@32761
  1659
wenzelm@38758
  1660
(*build up the record type from the current extension tpye extT and a list
wenzelm@32761
  1661
  of parent extensions, starting with the root of the record hierarchy*)
haftmann@21078
  1662
fun mk_recordT extT =
wenzelm@32761
  1663
  fold_rev (fn (parent, Ts) => fn T => Type (parent, subst_last T Ts)) extT;
schirmer@15215
  1664
schirmer@15215
  1665
haftmann@38533
  1666
(* code generation *)
haftmann@38533
  1667
bulwahn@42695
  1668
fun mk_random_eq tyco vs extN Ts =
haftmann@38544
  1669
  let
wenzelm@43683
  1670
    (* FIXME local i etc. *)
haftmann@38544
  1671
    val size = @{term "i::code_numeral"};
haftmann@38544
  1672
    fun termifyT T = HOLogic.mk_prodT (T, @{typ "unit => term"});
haftmann@38544
  1673
    val T = Type (tyco, map TFree vs);
haftmann@38544
  1674
    val Tm = termifyT T;
wenzelm@43329
  1675
    val params = Name.invent_names Name.context "x" Ts;
haftmann@38544
  1676
    val lhs = HOLogic.mk_random T size;
haftmann@38544
  1677
    val tc = HOLogic.mk_return Tm @{typ Random.seed}
haftmann@38544
  1678
      (HOLogic.mk_valtermify_app extN params T);
wenzelm@38758
  1679
    val rhs =
wenzelm@38758
  1680
      HOLogic.mk_ST
wenzelm@38758
  1681
        (map (fn (v, T') =>
wenzelm@38758
  1682
          ((HOLogic.mk_random T' size, @{typ Random.seed}), SOME (v, termifyT T'))) params)
haftmann@38544
  1683
        tc @{typ Random.seed} (SOME Tm, @{typ Random.seed});
bulwahn@42695
  1684
  in
bulwahn@42695
  1685
    (lhs, rhs)
bulwahn@42695
  1686
  end
bulwahn@42695
  1687
bulwahn@42695
  1688
fun mk_full_exhaustive_eq tyco vs extN Ts =
bulwahn@42695
  1689
  let
wenzelm@43683
  1690
    (* FIXME local i etc. *)
bulwahn@42695
  1691
    val size = @{term "i::code_numeral"};
bulwahn@42695
  1692
    fun termifyT T = HOLogic.mk_prodT (T, @{typ "unit => term"});
bulwahn@42695
  1693
    val T = Type (tyco, map TFree vs);
bulwahn@45731
  1694
    val test_function = Free ("f", termifyT T --> @{typ "(bool * term list) option"});
wenzelm@43329
  1695
    val params = Name.invent_names Name.context "x" Ts;
wenzelm@43683
  1696
    fun full_exhaustiveT T =
bulwahn@45731
  1697
      (termifyT T --> @{typ "(bool * Code_Evaluation.term list) option"}) -->
bulwahn@45731
  1698
        @{typ code_numeral} --> @{typ "(bool * Code_Evaluation.term list) option"};
bulwahn@42695
  1699
    fun mk_full_exhaustive T =
bulwahn@42695
  1700
      Const (@{const_name "Quickcheck_Exhaustive.full_exhaustive_class.full_exhaustive"},
wenzelm@43683
  1701
        full_exhaustiveT T);
bulwahn@42695
  1702
    val lhs = mk_full_exhaustive T $ test_function $ size;
bulwahn@42695
  1703
    val tc = test_function $ (HOLogic.mk_valtermify_app extN params T);
bulwahn@42695
  1704
    val rhs = fold_rev (fn (v, T) => fn cont =>
wenzelm@43683
  1705
        mk_full_exhaustive T $ (lambda (Free (v, termifyT T)) cont) $ size) params tc;
bulwahn@42695
  1706
  in
bulwahn@42695
  1707
    (lhs, rhs)
wenzelm@43683
  1708
  end;
bulwahn@42695
  1709
bulwahn@42695
  1710
fun instantiate_sort_record (sort, mk_eq) tyco vs extN Ts thy =
bulwahn@42695
  1711
  let
bulwahn@42695
  1712
    val eq = HOLogic.mk_Trueprop (HOLogic.mk_eq (mk_eq tyco vs extN Ts));
wenzelm@41576
  1713
  in
haftmann@38544
  1714
    thy
bulwahn@42695
  1715
    |> Class.instantiation ([tyco], vs, sort)
haftmann@38544
  1716
    |> `(fn lthy => Syntax.check_term lthy eq)
haftmann@38544
  1717
    |-> (fn eq => Specification.definition (NONE, (apfst Binding.conceal Attrib.empty_binding, eq)))
haftmann@38544
  1718
    |> snd
haftmann@38544
  1719
    |> Class.prove_instantiation_exit (K (Class.intro_classes_tac []))
wenzelm@43683
  1720
  end;
bulwahn@42695
  1721
bulwahn@42695
  1722
fun ensure_sort_record (sort, mk_eq) ext_tyco vs extN Ts thy =
haftmann@38544
  1723
  let
haftmann@38544
  1724
    val algebra = Sign.classes_of thy;
wenzelm@48272
  1725
    val has_inst = Sorts.has_instance algebra ext_tyco sort;
wenzelm@41576
  1726
  in
wenzelm@41576
  1727
    if has_inst then thy
wenzelm@41576
  1728
    else
bulwahn@42695
  1729
      (case Quickcheck_Common.perhaps_constrain thy (map (rpair sort) Ts) vs of
wenzelm@41576
  1730
        SOME constrain =>
bulwahn@42695
  1731
          instantiate_sort_record (sort, mk_eq) ext_tyco (map constrain vs) extN
wenzelm@41576
  1732
            ((map o map_atyps) (fn TFree v => TFree (constrain v)) Ts) thy
wenzelm@41576
  1733
      | NONE => thy)
haftmann@38544
  1734
  end;
haftmann@38544
  1735
haftmann@38533
  1736
fun add_code ext_tyco vs extT ext simps inject thy =
gerwin@47842
  1737
  if Config.get_global thy codegen then
gerwin@47842
  1738
    let
gerwin@47842
  1739
      val eq =
gerwin@47842
  1740
        HOLogic.mk_Trueprop (HOLogic.mk_eq
gerwin@47842
  1741
          (Const (@{const_name HOL.equal}, extT --> extT --> HOLogic.boolT),
gerwin@47842
  1742
           Const (@{const_name HOL.eq}, extT --> extT --> HOLogic.boolT)));
gerwin@47842
  1743
      fun tac eq_def =
gerwin@47842
  1744
        Class.intro_classes_tac []
gerwin@47842
  1745
        THEN rewrite_goals_tac [Simpdata.mk_eq eq_def]
gerwin@47842
  1746
        THEN ALLGOALS (rtac @{thm refl});
gerwin@47842
  1747
      fun mk_eq thy eq_def =
gerwin@47842
  1748
        Simplifier.rewrite_rule
gerwin@47842
  1749
          [AxClass.unoverload thy (Thm.symmetric (Simpdata.mk_eq eq_def))] inject;
gerwin@47842
  1750
      fun mk_eq_refl thy =
gerwin@47842
  1751
        @{thm equal_refl}
gerwin@47842
  1752
        |> Thm.instantiate
gerwin@47842
  1753
          ([pairself (ctyp_of thy) (TVar (("'a", 0), @{sort equal}), Logic.varifyT_global extT)], [])
gerwin@47842
  1754
        |> AxClass.unoverload thy;
gerwin@47842
  1755
      val ensure_random_record = ensure_sort_record (@{sort random}, mk_random_eq);
gerwin@47842
  1756
      val ensure_exhaustive_record =
gerwin@47842
  1757
        ensure_sort_record (@{sort full_exhaustive}, mk_full_exhaustive_eq);
gerwin@47842
  1758
    in
gerwin@47842
  1759
      thy
gerwin@47842
  1760
      |> Code.add_datatype [ext]
gerwin@47842
  1761
      |> fold Code.add_default_eqn simps
gerwin@47842
  1762
      |> Class.instantiation ([ext_tyco], vs, [HOLogic.class_equal])
gerwin@47842
  1763
      |> `(fn lthy => Syntax.check_term lthy eq)
gerwin@47842
  1764
      |-> (fn eq => Specification.definition
gerwin@47842
  1765
            (NONE, (Attrib.empty_binding, eq)))
gerwin@47842
  1766
      |-> (fn (_, (_, eq_def)) =>
gerwin@47842
  1767
         Class.prove_instantiation_exit_result Morphism.thm
gerwin@47842
  1768
            (fn _ => fn eq_def => tac eq_def) eq_def)
gerwin@47842
  1769
      |-> (fn eq_def => fn thy =>
gerwin@47842
  1770
            thy |> Code.del_eqn eq_def |> Code.add_default_eqn (mk_eq thy eq_def))
gerwin@47842
  1771
      |> (fn thy => Code.add_nbe_default_eqn (mk_eq_refl thy) thy)
gerwin@47842
  1772
      |> ensure_random_record ext_tyco vs (fst ext) (binder_types (snd ext))
gerwin@47842
  1773
      |> ensure_exhaustive_record ext_tyco vs (fst ext) (binder_types (snd ext))
gerwin@47842
  1774
    end
gerwin@47842
  1775
  else thy;
haftmann@38533
  1776
haftmann@38533
  1777
haftmann@38012
  1778
(* definition *)
haftmann@38012
  1779
haftmann@38012
  1780
fun definition (alphas, binding) parent (parents: parent_info list) raw_fields thy =
schirmer@14700
  1781
  let
wenzelm@43682
  1782
    val ctxt = Proof_Context.init_global thy;
wenzelm@43682
  1783
haftmann@37470
  1784
    val prefix = Binding.name_of binding;
wenzelm@35239
  1785
    val name = Sign.full_name thy binding;
haftmann@37470
  1786
    val full = Sign.full_name_path thy prefix;
schirmer@14700
  1787
wenzelm@35136
  1788
    val bfields = map (fn (x, T, _) => (x, T)) raw_fields;
wenzelm@35136
  1789
    val field_syntax = map #3 raw_fields;
schirmer@14700
  1790
wenzelm@32952
  1791
    val parent_fields = maps #fields parents;
schirmer@14700
  1792
    val parent_chunks = map (length o #fields) parents;
schirmer@14700
  1793
    val parent_names = map fst parent_fields;
schirmer@14700
  1794
    val parent_types = map snd parent_fields;
schirmer@14700
  1795
    val parent_fields_len = length parent_fields;
wenzelm@35239
  1796
    val parent_variants =
wenzelm@35239
  1797
      Name.variant_list [moreN, rN, rN ^ "'", wN] (map Long_Name.base_name parent_names);
haftmann@37470
  1798
    val parent_vars = map2 (curry Free) parent_variants parent_types;
schirmer@14700
  1799
    val parent_len = length parents;
schirmer@14700
  1800
schirmer@14700
  1801
    val fields = map (apfst full) bfields;
schirmer@14700
  1802
    val names = map fst fields;
schirmer@14700
  1803
    val types = map snd fields;
wenzelm@36151
  1804
    val alphas_fields = fold Term.add_tfreesT types [];
haftmann@33049
  1805
    val alphas_ext = inter (op =) alphas_fields alphas;
schirmer@14700
  1806
    val len = length fields;
wenzelm@30715
  1807
    val variants =
wenzelm@32764
  1808
      Name.variant_list (moreN :: rN :: (rN ^ "'") :: wN :: parent_variants)
wenzelm@35136
  1809
        (map (Binding.name_of o fst) bfields);
haftmann@37470
  1810
    val vars = map2 (curry Free) variants types;
schirmer@14700
  1811
    val named_vars = names ~~ vars;
schirmer@14700
  1812
    val idxms = 0 upto len;
schirmer@14700
  1813
schirmer@14700
  1814
    val all_fields = parent_fields @ fields;
schirmer@14700
  1815
    val all_types = parent_types @ types;
schirmer@14700
  1816
    val all_variants = parent_variants @ variants;
schirmer@14700
  1817
    val all_vars = parent_vars @ vars;
schirmer@14700
  1818
    val all_named_vars = (parent_names ~~ parent_vars) @ named_vars;
schirmer@14700
  1819
wenzelm@43324
  1820
    val zeta = (singleton (Name.variant_list (map #1 alphas)) "'z", HOLogic.typeS);
wenzelm@36151
  1821
    val moreT = TFree zeta;
schirmer@14700
  1822
    val more = Free (moreN, moreT);
wenzelm@35136
  1823
    val full_moreN = full (Binding.name moreN);
wenzelm@35136
  1824
    val bfields_more = bfields @ [(Binding.name moreN, moreT)];
wenzelm@32761
  1825
    val fields_more = fields @ [(full_moreN, moreT)];
wenzelm@32761
  1826
    val named_vars_more = named_vars @ [(full_moreN, more)];
schirmer@14700
  1827
    val all_vars_more = all_vars @ [more];
wenzelm@32761
  1828
    val all_named_vars_more = all_named_vars @ [(full_moreN, more)];
wenzelm@32761
  1829
wenzelm@17261
  1830
wenzelm@35239
  1831
    (* 1st stage: ext_thy *)
wenzelm@35239
  1832
wenzelm@35239
  1833
    val extension_name = full binding;
wenzelm@35239
  1834
wenzelm@38758
  1835
    val ((ext, (ext_tyco, vs),
wenzelm@38758
  1836
        extT, ext_induct, ext_inject, ext_surjective, ext_split, ext_def), ext_thy) =
schirmer@14700
  1837
      thy
wenzelm@35239
  1838
      |> Sign.qualified_path false binding
wenzelm@35239
  1839
      |> extension_definition extension_name fields alphas_ext zeta moreT more vars;
schirmer@14700
  1840
wenzelm@43682
  1841
    val _ = timing_msg ctxt "record preparing definitions";
schirmer@14700
  1842
    val Type extension_scheme = extT;
schirmer@14700
  1843
    val extension_name = unsuffix ext_typeN (fst extension_scheme);
wenzelm@32761
  1844
    val extension = let val (n, Ts) = extension_scheme in (n, subst_last HOLogic.unitT Ts) end;
wenzelm@35239
  1845
    val extension_names = map (unsuffix ext_typeN o fst o #extension) parents @ [extension_name];
wenzelm@32764
  1846
    val extension_id = implode extension_names;
wenzelm@17261
  1847
haftmann@33957
  1848
    fun rec_schemeT n = mk_recordT (map #extension (drop n parents)) extT;
schirmer@14700
  1849
    val rec_schemeT0 = rec_schemeT 0;
schirmer@14700
  1850
wenzelm@17261
  1851
    fun recT n =
wenzelm@32972
  1852
      let val (c, Ts) = extension in
haftmann@33957
  1853
        mk_recordT (map #extension (drop n parents))
wenzelm@32972
  1854
          (Type (c, subst_last HOLogic.unitT Ts))
wenzelm@32972
  1855
      end;
schirmer@14700
  1856
    val recT0 = recT 0;
wenzelm@17261
  1857
schirmer@14700
  1858
    fun mk_rec args n =
wenzelm@32761
  1859
      let
wenzelm@32761
  1860
        val (args', more) = chop_last args;
wenzelm@32974
  1861
        fun mk_ext' ((name, T), args) more = mk_ext (name, T) (args @ [more]);
wenzelm@32761
  1862
        fun build Ts =
wenzelm@35430
  1863
          fold_rev mk_ext' (drop n ((extension_names ~~ Ts) ~~ chunks parent_chunks args')) more;
wenzelm@17261
  1864
      in
wenzelm@17261
  1865
        if more = HOLogic.unit
haftmann@33063
  1866
        then build (map_range recT (parent_len + 1))
haftmann@33063
  1867
        else build (map_range rec_schemeT (parent_len + 1))
schirmer@14700
  1868
      end;
wenzelm@17261
  1869
schirmer@14700
  1870
    val r_rec0 = mk_rec all_vars_more 0;
wenzelm@32761
  1871
    val r_rec_unit0 = mk_rec (all_vars @ [HOLogic.unit]) 0;
schirmer@14700
  1872
wenzelm@35430
  1873
    fun r n = Free (rN, rec_schemeT n);
schirmer@14700
  1874
    val r0 = r 0;
wenzelm@35430
  1875
    fun r_unit n = Free (rN, recT n);
schirmer@14700
  1876
    val r_unit0 = r_unit 0;
wenzelm@35430
  1877
    val w = Free (wN, rec_schemeT 0);
schirmer@14700
  1878
wenzelm@32761
  1879
wenzelm@35239
  1880
    (* print translations *)
wenzelm@35239
  1881
wenzelm@35149
  1882
    val record_ext_type_abbr_tr's =
wenzelm@32761
  1883
      let
wenzelm@35430
  1884
        val trname = hd extension_names;
wenzelm@35148
  1885
        val last_ext = unsuffix ext_typeN (fst extension);
wenzelm@35430
  1886
      in [record_ext_type_abbr_tr' name alphas zeta last_ext rec_schemeT0 trname] end;
wenzelm@35149
  1887
wenzelm@35149
  1888
    val record_ext_type_tr's =
wenzelm@32761
  1889
      let
wenzelm@35149
  1890
        (*avoid conflict with record_type_abbr_tr's*)
wenzelm@35430
  1891
        val trnames = if parent_len > 0 then [extension_name] else [];
wenzelm@35149
  1892
      in map record_ext_type_tr' trnames end;
schirmer@14700
  1893
wenzelm@35239
  1894
    val advanced_print_translation =
wenzelm@35239
  1895
      map field_update_tr' (full_moreN :: names) @ [record_ext_tr' extension_name] @
wenzelm@35239
  1896
      record_ext_type_tr's @ record_ext_type_abbr_tr's;
wenzelm@35239
  1897
wenzelm@17261
  1898
schirmer@14700
  1899
    (* prepare declarations *)
schirmer@14700
  1900
wenzelm@35136
  1901
    val sel_decls = map (mk_selC rec_schemeT0 o apfst Binding.name_of) bfields_more;
wenzelm@35136
  1902
    val upd_decls = map (mk_updC updateN rec_schemeT0 o apfst Binding.name_of) bfields_more;
schirmer@14700
  1903
    val make_decl = (makeN, all_types ---> recT0);
wenzelm@17261
  1904
    val fields_decl = (fields_selN, types ---> Type extension);
schirmer@14700
  1905
    val extend_decl = (extendN, recT0 --> moreT --> rec_schemeT0);
schirmer@14700
  1906
    val truncate_decl = (truncateN, rec_schemeT0 --> recT0);
schirmer@14700
  1907
wenzelm@35133
  1908
schirmer@14700
  1909
    (* prepare definitions *)
wenzelm@17261
  1910
wenzelm@35138
  1911
    val ext_defs = ext_def :: map #ext_def parents;
tsewell@32743
  1912
haftmann@34151
  1913
    (*Theorems from the iso_tuple intros.
wenzelm@32761
  1914
      By unfolding ext_defs from r_rec0 we create a tree of constructor
wenzelm@32761
  1915
      calls (many of them Pair, but others as well). The introduction
wenzelm@32761
  1916
      rules for update_accessor_eq_assist can unify two different ways
wenzelm@32761
  1917
      on these constructors. If we take the complete result sequence of
wenzelm@32761
  1918
      running a the introduction tactic, we get one theorem for each upd/acc
wenzelm@32761
  1919
      pair, from which we can derive the bodies of our selector and
wenzelm@32761
  1920
      updator and their convs.*)
tsewell@32743
  1921
    val (accessor_thms, updator_thms, upd_acc_cong_assists) =
wenzelm@46044
  1922
      timeit_msg ctxt "record getting tree access/updates:" (fn () =>
wenzelm@46044
  1923
        let
wenzelm@46044
  1924
          val r_rec0_Vars =
wenzelm@46044
  1925
            let
wenzelm@46044
  1926
              (*pick variable indices of 1 to avoid possible variable
wenzelm@46044
  1927
                collisions with existing variables in updacc_eq_triv*)
wenzelm@46044
  1928
              fun to_Var (Free (c, T)) = Var ((c, 1), T);
wenzelm@46044
  1929
            in mk_rec (map to_Var all_vars_more) 0 end;
wenzelm@46044
  1930
wenzelm@46044
  1931
          val cterm_rec = cterm_of ext_thy r_rec0;
wenzelm@46044
  1932
          val cterm_vrs = cterm_of ext_thy r_rec0_Vars;
wenzelm@46044
  1933
          val insts = [("v", cterm_rec), ("v'", cterm_vrs)];
wenzelm@46044
  1934
          val init_thm = named_cterm_instantiate insts updacc_eq_triv;
wenzelm@46044
  1935
          val terminal = rtac updacc_eq_idI 1 THEN rtac refl 1;
wenzelm@46044
  1936
          val tactic =
wenzelm@46044
  1937
            simp_tac (HOL_basic_ss addsimps ext_defs) 1 THEN
wenzelm@46044
  1938
            REPEAT (Iso_Tuple_Support.iso_tuple_intros_tac 1 ORELSE terminal);
wenzelm@46044
  1939
          val updaccs = Seq.list_of (tactic init_thm);
wenzelm@46044
  1940
        in
wenzelm@46044
  1941
          (updaccs RL [updacc_accessor_eqE],
wenzelm@46044
  1942
           updaccs RL [updacc_updator_eqE],
wenzelm@46044
  1943
           updaccs RL [updacc_cong_from_eq])
wenzelm@46044
  1944
        end);
tsewell@32743
  1945
haftmann@33957
  1946
    fun lastN xs = drop parent_fields_len xs;
tsewell@32743
  1947
wenzelm@17261
  1948
    (*selectors*)
wenzelm@32761
  1949
    fun mk_sel_spec ((c, T), thm) =
tsewell@32743
  1950
      let
wenzelm@35239
  1951
        val (acc $ arg, _) =
wenzelm@35239
  1952
          HOLogic.dest_eq (HOLogic.dest_Trueprop (Envir.beta_eta_contract (Thm.concl_of thm)));
wenzelm@32761
  1953
        val _ =
wenzelm@35239
  1954
          if arg aconv r_rec0 then ()
wenzelm@32761
  1955
          else raise TERM ("mk_sel_spec: different arg", [arg]);
tsewell@32743
  1956
      in
wenzelm@32761
  1957
        Const (mk_selC rec_schemeT0 (c, T)) :== acc
tsewell@32743
  1958
      end;
tsewell@32743
  1959
    val sel_specs = map mk_sel_spec (fields_more ~~ lastN accessor_thms);
schirmer@14700
  1960
schirmer@14700
  1961
    (*updates*)
wenzelm@32761
  1962
    fun mk_upd_spec ((c, T), thm) =
wenzelm@17261
  1963
      let
wenzelm@35239
  1964
        val (upd $ _ $ arg, _) =
wenzelm@35239
  1965
          HOLogic.dest_eq (HOLogic.dest_Trueprop (Envir.beta_eta_contract (Thm.concl_of thm)));
wenzelm@32761
  1966
        val _ =
wenzelm@35135
  1967
          if arg aconv r_rec0 then ()
wenzelm@32761
  1968
          else raise TERM ("mk_sel_spec: different arg", [arg]);
wenzelm@32761
  1969
      in Const (mk_updC updateN rec_schemeT0 (c, T)) :== upd end;
tsewell@32743
  1970
    val upd_specs = map mk_upd_spec (fields_more ~~ lastN updator_thms);
schirmer@14700
  1971
schirmer@14700
  1972
    (*derived operations*)
wenzelm@35144
  1973
    val make_spec =
wenzelm@35144
  1974
      list_comb (Const (full (Binding.name makeN), all_types ---> recT0), all_vars) :==
wenzelm@35144
  1975
        mk_rec (all_vars @ [HOLogic.unit]) 0;
wenzelm@35144
  1976
    val fields_spec =
wenzelm@35144
  1977
      list_comb (Const (full (Binding.name fields_selN), types ---> Type extension), vars) :==
wenzelm@35144
  1978
        mk_rec (all_vars @ [HOLogic.unit]) parent_len;
wenzelm@17261
  1979
    val extend_spec =
wenzelm@35136
  1980
      Const (full (Binding.name extendN), recT0 --> moreT --> rec_schemeT0) $ r_unit0 $ more :==
wenzelm@35144
  1981
        mk_rec ((map (mk_sel r_unit0) all_fields) @ [more]) 0;
wenzelm@35144
  1982
    val truncate_spec =
wenzelm@35144
  1983
      Const (full (Binding.name truncateN), rec_schemeT0 --> recT0) $ r0 :==
wenzelm@35144
  1984
        mk_rec ((map (mk_sel r0) all_fields) @ [HOLogic.unit]) 0;
schirmer@14700
  1985
wenzelm@32761
  1986
schirmer@14700
  1987
    (* 2st stage: defs_thy *)
wenzelm@17261
  1988
haftmann@22747
  1989
    val (((sel_defs, upd_defs), derived_defs), defs_thy) =
wenzelm@43682
  1990
      timeit_msg ctxt "record trfuns/tyabbrs/selectors/updates/make/fields/extend/truncate defs:"
wenzelm@46044
  1991
        (fn () =>
wenzelm@46044
  1992
          ext_thy
wenzelm@46044
  1993
          |> Sign.add_advanced_trfuns ([], [], advanced_print_translation, [])
wenzelm@46044
  1994
          |> Sign.restore_naming thy
wenzelm@46044
  1995
          |> Typedecl.abbrev_global (binding, map #1 alphas, NoSyn) recT0 |> snd
wenzelm@46044
  1996
          |> Typedecl.abbrev_global
wenzelm@46056
  1997
            (Binding.suffix_name schemeN binding, map #1 (alphas @ [zeta]), NoSyn) rec_schemeT0
wenzelm@46056
  1998
          |> snd
wenzelm@46044
  1999
          |> Sign.qualified_path false binding
wenzelm@46044
  2000
          |> fold (fn ((x, T), mx) => snd o Sign.declare_const_global ((Binding.name x, T), mx))
wenzelm@46044
  2001
            (sel_decls ~~ (field_syntax @ [NoSyn]))
wenzelm@46044
  2002
          |> fold (fn (x, T) => snd o Sign.declare_const_global ((Binding.name x, T), NoSyn))
wenzelm@46044
  2003
            (upd_decls @ [make_decl, fields_decl, extend_decl, truncate_decl])
wenzelm@46044
  2004
          |> (Global_Theory.add_defs false o
wenzelm@46044
  2005
                map (Thm.no_attributes o apfst (Binding.conceal o Binding.name))) sel_specs
wenzelm@46044
  2006
          ||>> (Global_Theory.add_defs false o
wenzelm@46044
  2007
                map (Thm.no_attributes o apfst (Binding.conceal o Binding.name))) upd_specs
wenzelm@46044
  2008
          ||>> (Global_Theory.add_defs false o
wenzelm@46044
  2009
                map (Thm.no_attributes o apfst (Binding.conceal o Binding.name)))
wenzelm@46044
  2010
            [make_spec, fields_spec, extend_spec, truncate_spec]
wenzelm@46044
  2011
          ||> Theory.checkpoint);
wenzelm@17261
  2012
schirmer@14700
  2013
    (* prepare propositions *)
wenzelm@43682
  2014
    val _ = timing_msg ctxt "record preparing propositions";
wenzelm@43324
  2015
    val P = Free (singleton (Name.variant_list all_variants) "P", rec_schemeT0 --> HOLogic.boolT);
wenzelm@43324
  2016
    val C = Free (singleton (Name.variant_list all_variants) "C", HOLogic.boolT);
wenzelm@43324
  2017
    val P_unit = Free (singleton (Name.variant_list all_variants) "P", recT0 --> HOLogic.boolT);
schirmer@14700
  2018
wenzelm@17261
  2019
    (*selectors*)
schirmer@14700
  2020
    val sel_conv_props =
wenzelm@32761
  2021
       map (fn (c, x as Free (_, T)) => mk_sel r_rec0 (c, T) === x) named_vars_more;
schirmer@14700
  2022
wenzelm@17261
  2023
    (*updates*)
haftmann@37470
  2024
    fun mk_upd_prop i (c, T) =
wenzelm@32761
  2025
      let
wenzelm@43324
  2026
        val x' =
wenzelm@43324
  2027
          Free (singleton (Name.variant_list all_variants) (Long_Name.base_name c ^ "'"), T --> T);
wenzelm@32761
  2028
        val n = parent_fields_len + i;
wenzelm@35239
  2029
        val args' = nth_map n (K (x' $ nth all_vars_more n)) all_vars_more;
wenzelm@32761
  2030
      in mk_upd updateN c x' r_rec0 === mk_rec args' 0 end;
haftmann@37470
  2031
    val upd_conv_props = map2 mk_upd_prop idxms fields_more;
schirmer@14700
  2032
schirmer@14700
  2033
    (*induct*)
schirmer@14700
  2034
    val induct_scheme_prop =
wenzelm@46215
  2035
      fold_rev Logic.all all_vars_more (Trueprop (P $ r_rec0)) ==> Trueprop (P $ r0);
wenzelm@17261
  2036
    val induct_prop =
wenzelm@46215
  2037
      (fold_rev Logic.all all_vars (Trueprop (P_unit $ r_rec_unit0)), Trueprop (P_unit $ r_unit0));
schirmer@14700
  2038
schirmer@14700
  2039
    (*surjective*)
schirmer@14700
  2040
    val surjective_prop =
wenzelm@32761
  2041
      let val args = map (fn (c, Free (_, T)) => mk_sel r0 (c, T)) all_named_vars_more
schirmer@14700
  2042
      in r0 === mk_rec args 0 end;
wenzelm@17261
  2043
schirmer@14700
  2044
    (*cases*)
schirmer@14700
  2045
    val cases_scheme_prop =
wenzelm@46215
  2046
      (fold_rev Logic.all all_vars_more ((r0 === r_rec0) ==> Trueprop C), Trueprop C);
schirmer@14700
  2047
schirmer@14700
  2048
    val cases_prop =
wenzelm@46215
  2049
      fold_rev Logic.all all_vars ((r_unit0 === r_rec_unit0) ==> Trueprop C) ==> Trueprop C;
schirmer@14700
  2050
schirmer@14700
  2051
    (*split*)
schirmer@14700
  2052
    val split_meta_prop =
wenzelm@43324
  2053
      let
wenzelm@46056
  2054
        val P = Free (singleton (Name.variant_list all_variants) "P", rec_schemeT0 --> propT);
wenzelm@43324
  2055
      in
wenzelm@46215
  2056
        Logic.mk_equals (Logic.all r0 (P $ r0), fold_rev Logic.all all_vars_more (P $ r_rec0))
wenzelm@17261
  2057
      end;
schirmer@14700
  2058
schirmer@14700
  2059
    val split_object_prop =
wenzelm@32974
  2060
      let val ALL = fold_rev (fn (v, T) => fn t => HOLogic.mk_all (v, T, t))
wenzelm@32974
  2061
      in ALL [dest_Free r0] (P $ r0) === ALL (map dest_Free all_vars_more) (P $ r_rec0) end;
schirmer@14700
  2062
schirmer@14700
  2063
    val split_ex_prop =
wenzelm@32974
  2064
      let val EX = fold_rev (fn (v, T) => fn t => HOLogic.mk_exists (v, T, t))
wenzelm@32974
  2065
      in EX [dest_Free r0] (P $ r0) === EX (map dest_Free all_vars_more) (P $ r_rec0) end;
schirmer@14700
  2066
schirmer@14700
  2067
    (*equality*)
schirmer@14700
  2068
    val equality_prop =
wenzelm@17261
  2069
      let
wenzelm@32761
  2070
        val s' = Free (rN ^ "'", rec_schemeT0);
wenzelm@32761
  2071
        fun mk_sel_eq (c, Free (_, T)) = mk_sel r0 (c, T) === mk_sel s' (c, T);
wenzelm@32761
  2072
        val seleqs = map mk_sel_eq all_named_vars_more;
wenzelm@46215
  2073
      in Logic.all r0 (Logic.all s' (Logic.list_implies (seleqs, r0 === s'))) end;
wenzelm@32761
  2074
schirmer@14700
  2075
schirmer@14700
  2076
    (* 3rd stage: thms_thy *)
schirmer@14700
  2077
wenzelm@46054
  2078
    val record_ss = get_simpset defs_thy;
wenzelm@46054
  2079
    val sel_upd_ss = record_ss addsimps (sel_defs @ accessor_thms @ upd_defs @ updator_thms);
wenzelm@46050
  2080
wenzelm@46050
  2081
    val (sel_convs, upd_convs) =
wenzelm@46050
  2082
      timeit_msg ctxt "record sel_convs/upd_convs proof:" (fn () =>
wenzelm@46893
  2083
        grouped 10 Par_List.map (fn prop =>
wenzelm@46050
  2084
          Skip_Proof.prove_global defs_thy [] [] prop
wenzelm@46050
  2085
            (K (ALLGOALS (asm_full_simp_tac sel_upd_ss)))) (sel_conv_props @ upd_conv_props))
wenzelm@46050
  2086
      |> chop (length sel_conv_props);
wenzelm@46044
  2087
wenzelm@46044
  2088
    val (fold_congs, unfold_congs) = timeit_msg ctxt "record upd fold/unfold congs:" (fn () =>
wenzelm@32761
  2089
      let
wenzelm@36945
  2090
        val symdefs = map Thm.symmetric (sel_defs @ upd_defs);
wenzelm@32761
  2091
        val fold_ss = HOL_basic_ss addsimps symdefs;
wenzelm@35021
  2092
        val ua_congs = map (Drule.export_without_context o simplify fold_ss) upd_acc_cong_assists;
wenzelm@46044
  2093
      in (ua_congs RL [updacc_foldE], ua_congs RL [updacc_unfoldE]) end);
schirmer@15012
  2094
wenzelm@35138
  2095
    val parent_induct = Option.map #induct_scheme (try List.last parents);
schirmer@14700
  2096
wenzelm@46044
  2097
    val induct_scheme = timeit_msg ctxt "record induct_scheme proof:" (fn () =>
wenzelm@46049
  2098
      Skip_Proof.prove_global defs_thy [] [] induct_scheme_prop
wenzelm@32761
  2099
        (fn _ =>
wenzelm@32761
  2100
          EVERY
wenzelm@35138
  2101
           [case parent_induct of NONE => all_tac | SOME ind => try_param_tac rN ind 1,
wenzelm@32761
  2102
            try_param_tac rN ext_induct 1,
wenzelm@46044
  2103
            asm_simp_tac HOL_basic_ss 1]));
wenzelm@46044
  2104
wenzelm@46044
  2105
    val induct = timeit_msg ctxt "record induct proof:" (fn () =>
wenzelm@46053
  2106
      Skip_Proof.prove_global defs_thy [] [#1 induct_prop] (#2 induct_prop) (fn {prems, ...} =>
wenzelm@46053
  2107
        try_param_tac rN induct_scheme 1
wenzelm@46053
  2108
        THEN try_param_tac "more" @{thm unit.induct} 1
wenzelm@46053
  2109
        THEN resolve_tac prems 1));
wenzelm@46044
  2110
wenzelm@46044
  2111
    val surjective = timeit_msg ctxt "record surjective proof:" (fn () =>
wenzelm@32761
  2112
      let
wenzelm@46043
  2113
        val leaf_ss =
wenzelm@46043
  2114
          get_sel_upd_defs defs_thy addsimps (sel_defs @ @{thms o_assoc id_apply id_o o_id});
wenzelm@32761
  2115
        val init_ss = HOL_basic_ss addsimps ext_defs;
tsewell@32743
  2116
      in
wenzelm@46049
  2117
        Skip_Proof.prove_global defs_thy [] [] surjective_prop
wenzelm@32799
  2118
          (fn _ =>
wenzelm@32761
  2119
            EVERY
wenzelm@32761
  2120
             [rtac surject_assist_idE 1,
wenzelm@32761
  2121
              simp_tac init_ss 1,
wenzelm@32975
  2122
              REPEAT
haftmann@34151
  2123
                (Iso_Tuple_Support.iso_tuple_intros_tac 1 ORELSE
wenzelm@32975
  2124
                  (rtac surject_assistI 1 THEN simp_tac leaf_ss 1))])
wenzelm@46044
  2125
      end);
wenzelm@46044
  2126
wenzelm@46053
  2127
    val cases_scheme = timeit_msg ctxt "record cases_scheme proof:" (fn () =>
wenzelm@46053
  2128
      Skip_Proof.prove_global defs_thy [] [#1 cases_scheme_prop] (#2 cases_scheme_prop)
wenzelm@46053
  2129
        (fn {prems, ...} =>
wenzelm@46053
  2130
          resolve_tac prems 1 THEN
wenzelm@46053
  2131
          rtac surjective 1));
wenzelm@46053
  2132
wenzelm@46053
  2133
    val cases = timeit_msg ctxt "record cases proof:" (fn () =>
wenzelm@46053
  2134
      Skip_Proof.prove_global defs_thy [] [] cases_prop
wenzelm@46053
  2135
        (fn _ =>
wenzelm@46053
  2136
          try_param_tac rN cases_scheme 1 THEN
wenzelm@46053
  2137
          ALLGOALS (asm_full_simp_tac (HOL_basic_ss addsimps @{thms unit_all_eq1}))));
wenzelm@46053
  2138
wenzelm@46044
  2139
    val split_meta = timeit_msg ctxt "record split_meta proof:" (fn () =>
wenzelm@46049
  2140
      Skip_Proof.prove_global defs_thy [] [] split_meta_prop
wenzelm@32799
  2141
        (fn _ =>
wenzelm@32975
  2142
          EVERY1
wenzelm@46186
  2143
           [rtac @{thm equal_intr_rule}, Goal.norm_hhf_tac,
wenzelm@46043
  2144
            etac @{thm meta_allE}, atac,
wenzelm@46043
  2145
            rtac (@{thm prop_subst} OF [surjective]),
wenzelm@46044
  2146
            REPEAT o etac @{thm meta_allE}, atac]));
wenzelm@46044
  2147
wenzelm@46044
  2148
    val split_object = timeit_msg ctxt "record split_object proof:" (fn () =>
wenzelm@46051
  2149
      Skip_Proof.prove_global defs_thy [] [] split_object_prop
wenzelm@46051
  2150
        (fn _ =>
wenzelm@46051
  2151
          rtac @{lemma "Trueprop A == Trueprop B ==> A = B" by (rule iffI) unfold} 1 THEN
wenzelm@46051
  2152
          rewrite_goals_tac @{thms atomize_all [symmetric]} THEN
wenzelm@46051
  2153
          rtac split_meta 1));
wenzelm@46044
  2154
wenzelm@46044
  2155
    val split_ex = timeit_msg ctxt "record split_ex proof:" (fn () =>
wenzelm@46052
  2156
      Skip_Proof.prove_global defs_thy [] [] split_ex_prop
wenzelm@46052
  2157
        (fn _ =>
wenzelm@46052
  2158
          simp_tac
wenzelm@46052
  2159
            (HOL_basic_ss addsimps
wenzelm@46052
  2160
              (@{lemma "EX x. P x == ~ (ALL x. ~ P x)" by simp} ::
wenzelm@46052
  2161
                @{thms not_not Not_eq_iff})) 1 THEN
wenzelm@46052
  2162
          rtac split_object 1));
schirmer@14700
  2163
wenzelm@46044
  2164
    val equality = timeit_msg ctxt "record equality proof:" (fn () =>
wenzelm@46054
  2165
      Skip_Proof.prove_global defs_thy [] [] equality_prop
wenzelm@46054
  2166
        (fn _ => asm_full_simp_tac (record_ss addsimps (split_meta :: sel_convs)) 1));
schirmer@14700
  2167
wenzelm@46055
  2168
    val ([(_, sel_convs'), (_, upd_convs'), (_, sel_defs'), (_, upd_defs'),
wenzelm@46055
  2169
          (_, fold_congs'), (_, unfold_congs'),
wenzelm@46055
  2170
          (_, splits' as [split_meta', split_object', split_ex']), (_, derived_defs'),
wenzelm@46055
  2171
          (_, [surjective']), (_, [equality']), (_, [induct_scheme']), (_, [induct']),
wenzelm@46055
  2172
          (_, [cases_scheme']), (_, [cases'])], thms_thy) = defs_thy
wenzelm@46055
  2173
      |> Global_Theory.note_thmss ""
wenzelm@46055
  2174
       [((Binding.name "select_convs", []), [(sel_convs, [])]),
wenzelm@46055
  2175
        ((Binding.name "update_convs", []), [(upd_convs, [])]),
wenzelm@46055
  2176
        ((Binding.name "select_defs", []), [(sel_defs, [])]),
wenzelm@46055
  2177
        ((Binding.name "update_defs", []), [(upd_defs, [])]),
wenzelm@46055
  2178
        ((Binding.name "fold_congs", []), [(fold_congs, [])]),
wenzelm@46055
  2179
        ((Binding.name "unfold_congs", []), [(unfold_congs, [])]),
wenzelm@46055
  2180
        ((Binding.name "splits", []), [([split_meta, split_object, split_ex], [])]),
wenzelm@46055
  2181
        ((Binding.name "defs", []), [(derived_defs, [])]),
wenzelm@46055
  2182
        ((Binding.name "surjective", []), [([surjective], [])]),
wenzelm@46055
  2183
        ((Binding.name "equality", []), [([equality], [])]),
wenzelm@46055
  2184
        ((Binding.name "induct_scheme", induct_type_global (suffix schemeN name)),
wenzelm@46055
  2185
          [([induct_scheme], [])]),
wenzelm@46055
  2186
        ((Binding.name "induct", induct_type_global name), [([induct], [])]),
wenzelm@46055
  2187
        ((Binding.name "cases_scheme", cases_type_global (suffix schemeN name)),
wenzelm@46055
  2188
          [([cases_scheme], [])]),
wenzelm@46055
  2189
        ((Binding.name "cases", cases_type_global name), [([cases], [])])];
schirmer@14700
  2190
schirmer@14700
  2191
    val sel_upd_simps = sel_convs' @ upd_convs';
tsewell@32743
  2192
    val sel_upd_defs = sel_defs' @ upd_defs';
tsewell@32743
  2193
    val depth = parent_len + 1;
wenzelm@35138
  2194
wenzelm@46055
  2195
    val ([(_, simps'), (_, iffs')], thms_thy') = thms_thy
wenzelm@46055
  2196
      |> Global_Theory.note_thmss ""
wenzelm@46055
  2197
          [((Binding.name "simps", [Simplifier.simp_add]), [(sel_upd_simps, [])]),
wenzelm@46055
  2198
           ((Binding.name "iffs", [iff_add]), [([ext_inject], [])])];
wenzelm@35138
  2199
wenzelm@35138
  2200
    val info =
haftmann@38012
  2201
      make_info alphas parent fields extension
wenzelm@35138
  2202
        ext_induct ext_inject ext_surjective ext_split ext_def
wenzelm@35138
  2203
        sel_convs' upd_convs' sel_defs' upd_defs' fold_congs' unfold_congs' splits' derived_defs'
wenzelm@35138
  2204
        surjective' equality' induct_scheme' induct' cases_scheme' cases' simps' iffs';
wenzelm@35138
  2205
wenzelm@35138
  2206
    val final_thy =
wenzelm@35138
  2207
      thms_thy'
wenzelm@35138
  2208
      |> put_record name info
wenzelm@46221
  2209
      |> put_sel_upd names full_moreN depth sel_upd_simps sel_upd_defs
haftmann@38012
  2210
      |> add_equalities extension_id equality'
schirmer@15015
  2211
      |> add_extinjects ext_inject
schirmer@15015
  2212
      |> add_extsplit extension_name ext_split
haftmann@38012
  2213
      |> add_splits extension_id (split_meta', split_object', split_ex', induct_scheme')
wenzelm@32761
  2214
      |> add_extfields extension_name (fields @ [(full_moreN, moreT)])
wenzelm@43685
  2215
      |> add_fieldext (extension_name, snd extension) names
haftmann@38533
  2216
      |> add_code ext_tyco vs extT ext simps' ext_inject
wenzelm@35239
  2217
      |> Sign.restore_naming thy;
schirmer@14700
  2218
wenzelm@32761
  2219
  in final_thy end;
wenzelm@4867
  2220
wenzelm@27278
  2221
wenzelm@4867
  2222
(* add_record *)
wenzelm@4867
  2223
wenzelm@36151
  2224
local
wenzelm@36151
  2225
wenzelm@36151
  2226
fun read_parent NONE ctxt = (NONE, ctxt)
wenzelm@36151
  2227
  | read_parent (SOME raw_T) ctxt =
wenzelm@42361
  2228
      (case Proof_Context.read_typ_abbrev ctxt raw_T of
wenzelm@36151
  2229
        Type (name, Ts) => (SOME (Ts, name), fold Variable.declare_typ Ts ctxt)
wenzelm@36151
  2230
      | T => error ("Bad parent record specification: " ^ Syntax.string_of_typ ctxt T));
wenzelm@36151
  2231
wenzelm@46990
  2232
fun read_fields raw_fields ctxt =
wenzelm@46990
  2233
  let
wenzelm@46990
  2234
    val Ts = Syntax.read_typs ctxt (map (fn (_, raw_T, _) => raw_T) raw_fields);
wenzelm@46990
  2235
    val fields = map2 (fn (x, _, mx) => fn T => (x, T, mx)) raw_fields Ts;
wenzelm@46990
  2236
    val ctxt' = fold Variable.declare_typ Ts ctxt;
wenzelm@46990
  2237
  in (fields, ctxt') end;
wenzelm@36151
  2238
wenzelm@36151
  2239
in
wenzelm@36151
  2240
wenzelm@44653
  2241
fun add_record (params, binding) raw_parent raw_fields thy =
wenzelm@4867
  2242
  let
wenzelm@17261
  2243
    val _ = Theory.requires thy "Record" "record definitions";
wenzelm@4867
  2244
wenzelm@42361
  2245
    val ctxt = Proof_Context.init_global thy;
wenzelm@42361
  2246
    fun cert_typ T = Type.no_tvars (Proof_Context.cert_typ ctxt T)
wenzelm@36151
  2247
      handle TYPE (msg, _, _) => error msg;
wenzelm@36151
  2248
wenzelm@36151
  2249
wenzelm@36151
  2250
    (* specification *)
wenzelm@36151
  2251
wenzelm@36151
  2252
    val parent = Option.map (apfst (map cert_typ)) raw_parent
wenzelm@36151
  2253
      handle ERROR msg =>
wenzelm@36151
  2254
        cat_error msg ("The error(s) above occurred in parent record specification");
wenzelm@36151
  2255
    val parent_args = (case parent of SOME (Ts, _) => Ts | NONE => []);
wenzelm@41577
  2256
    val parents = get_parent_info thy parent;
wenzelm@4867
  2257
wenzelm@46990
  2258
    val bfields =
wenzelm@46990
  2259
      raw_fields |> map (fn (x, raw_T, mx) => (x, cert_typ raw_T, mx)
wenzelm@46990
  2260
        handle ERROR msg =>
wenzelm@46990
  2261
          cat_error msg ("The error(s) above occurred in record field " ^ Binding.print x));
wenzelm@46990
  2262
wenzelm@4867
  2263
wenzelm@4867
  2264
    (* errors *)
wenzelm@4867
  2265
wenzelm@35239
  2266
    val name = Sign.full_name thy binding;
wenzelm@17261
  2267
    val err_dup_record =
haftmann@38012
  2268
      if is_none (get_info thy name) then []
wenzelm@4890
  2269
      else ["Duplicate definition of record " ^ quote name];
wenzelm@4890
  2270
wenzelm@36151
  2271
    val spec_frees = fold Term.add_tfreesT (parent_args @ map #2 bfields) [];
wenzelm@36151
  2272
    val err_extra_frees =
wenzelm@36151
  2273
      (case subtract (op =) params spec_frees of
wenzelm@4867
  2274
        [] => []
wenzelm@36151
  2275
      | extras => ["Extra free type variable(s) " ^
wenzelm@36151
  2276
          commas (map (Syntax.string_of_typ ctxt o TFree) extras)]);
wenzelm@4867
  2277
wenzelm@4890
  2278
    val err_no_fields = if null bfields then ["No fields present"] else [];
wenzelm@4867
  2279
wenzelm@4867
  2280
    val err_dup_fields =
wenzelm@35136
  2281
      (case duplicates Binding.eq_name (map #1 bfields) of
wenzelm@4867
  2282
        [] => []
wenzelm@42381
  2283
      | dups => ["Duplicate field(s) " ^ commas (map Binding.print dups)]);
wenzelm@4890
  2284
wenzelm@4890
  2285
    val err_bad_fields =
wenzelm@35136
  2286
      if forall (not_equal moreN o Binding.name_of o #1) bfields then []
wenzelm@4890
  2287
      else ["Illegal field name " ^ quote moreN];
wenzelm@4867
  2288
wenzelm@4867
  2289
    val errs =
wenzelm@36151
  2290
      err_dup_record @ err_extra_frees @ err_no_fields @ err_dup_fields @ err_bad_fields;
wenzelm@32761
  2291
    val _ = if null errs then () else error (cat_lines errs);
wenzelm@4867
  2292
  in
haftmann@38012
  2293
    thy |> definition (params, binding) parent parents bfields
wenzelm@4867
  2294
  end
wenzelm@42381
  2295
  handle ERROR msg => cat_error msg ("Failed to define record " ^ Binding.print binding);
wenzelm@35136
  2296
wenzelm@44653
  2297
fun add_record_cmd (raw_params, binding) raw_parent raw_fields thy =
wenzelm@36151
  2298
  let
wenzelm@42361
  2299
    val ctxt = Proof_Context.init_global thy;
wenzelm@36153
  2300
    val params = map (apsnd (Typedecl.read_constraint ctxt)) raw_params;
wenzelm@36153
  2301
    val ctxt1 = fold (Variable.declare_typ o TFree) params ctxt;
wenzelm@36153
  2302
    val (parent, ctxt2) = read_parent raw_parent ctxt1;
wenzelm@46990
  2303
    val (fields, ctxt3) = read_fields raw_fields ctxt2;
wenzelm@42361
  2304
    val params' = map (Proof_Context.check_tfree ctxt3) params;
wenzelm@44653
  2305
  in thy |> add_record (params', binding) parent fields end;
wenzelm@36151
  2306
wenzelm@36151
  2307
end;
wenzelm@4867
  2308
wenzelm@32335
  2309
wenzelm@6358
  2310
(* setup theory *)
wenzelm@4867
  2311
wenzelm@4867
  2312
val setup =
wenzelm@24712
  2313
  Sign.add_trfuns ([], parse_translation, [], []) #>
wenzelm@35146
  2314
  Sign.add_advanced_trfuns ([], advanced_parse_translation, [], []) #>
wenzelm@42795
  2315
  Simplifier.map_simpset_global (fn ss => ss addsimprocs [simproc, upd_simproc, eq_simproc]);
wenzelm@4867
  2316
wenzelm@32335
  2317
wenzelm@6358
  2318
(* outer syntax *)
wenzelm@6358
  2319
wenzelm@24867
  2320
val _ =
wenzelm@46961
  2321
  Outer_Syntax.command @{command_spec "record"} "define extensible record"
wenzelm@36960
  2322
    (Parse.type_args_constrained -- Parse.binding --
wenzelm@46949
  2323
      (@{keyword "="} |-- Scan.option (Parse.typ --| @{keyword "+"}) --
wenzelm@36960
  2324
        Scan.repeat1 Parse.const_binding)
wenzelm@44653
  2325
    >> (fn (x, (y, z)) => Toplevel.theory (add_record_cmd x y z)));
wenzelm@6358
  2326
wenzelm@4867
  2327
end;