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