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