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