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