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