src/Pure/variable.ML
author wenzelm
Tue Jul 18 20:01:45 2006 +0200 (2006-07-18)
changeset 20149 54d4ea7927be
parent 20123 88fa41273824
child 20162 d4bcb27686f9
permissions -rw-r--r--
added newly_fixed, focus;
removed monomorphic;
tuned;
wenzelm@19899
     1
(*  Title:      Pure/variable.ML
wenzelm@19899
     2
    ID:         $Id$
wenzelm@19899
     3
    Author:     Makarius
wenzelm@19899
     4
wenzelm@19899
     5
Fixed type/term variables and polymorphic term abbreviations.
wenzelm@19899
     6
*)
wenzelm@19899
     7
wenzelm@19899
     8
signature VARIABLE =
wenzelm@19899
     9
sig
wenzelm@19899
    10
  val is_body: Context.proof -> bool
wenzelm@19899
    11
  val set_body: bool -> Context.proof -> Context.proof
wenzelm@19899
    12
  val restore_body: Context.proof -> Context.proof -> Context.proof
wenzelm@19899
    13
  val fixes_of: Context.proof -> (string * string) list
wenzelm@19899
    14
  val binds_of: Context.proof -> (typ * term) Vartab.table
wenzelm@19899
    15
  val defaults_of: Context.proof ->
wenzelm@20102
    16
    typ Vartab.table * sort Vartab.table * string list * string list Symtab.table
wenzelm@19899
    17
  val used_types: Context.proof -> string list
wenzelm@19899
    18
  val is_declared: Context.proof -> string -> bool
wenzelm@19899
    19
  val is_fixed: Context.proof -> string -> bool
wenzelm@20149
    20
  val newly_fixed: Context.proof -> Context.proof -> string -> bool
wenzelm@19899
    21
  val def_sort: Context.proof -> indexname -> sort option
wenzelm@19899
    22
  val def_type: Context.proof -> bool -> indexname -> typ option
wenzelm@19899
    23
  val default_type: Context.proof -> string -> typ option
wenzelm@19899
    24
  val declare_type: typ -> Context.proof -> Context.proof
wenzelm@19899
    25
  val declare_syntax: term -> Context.proof -> Context.proof
wenzelm@19899
    26
  val declare_term: term -> Context.proof -> Context.proof
wenzelm@19926
    27
  val declare_thm: thm -> Context.proof -> Context.proof
wenzelm@19926
    28
  val thm_context: thm -> Context.proof
wenzelm@19911
    29
  val rename_wrt: Context.proof -> term list -> (string * 'a) list -> (string * 'a) list
wenzelm@19911
    30
  val add_fixes: string list -> Context.proof -> string list * Context.proof
wenzelm@19911
    31
  val invent_fixes: string list -> Context.proof -> string list * Context.proof
wenzelm@19899
    32
  val invent_types: sort list -> Context.proof -> (string * sort) list * Context.proof
wenzelm@19911
    33
  val export_inst: Context.proof -> Context.proof -> string list * string list
wenzelm@19911
    34
  val exportT_inst: Context.proof -> Context.proof -> string list
wenzelm@19911
    35
  val export_terms: Context.proof -> Context.proof -> term list -> term list
wenzelm@19911
    36
  val exportT_terms: Context.proof -> Context.proof -> term list -> term list
wenzelm@19911
    37
  val exportT: Context.proof -> Context.proof -> thm list -> thm list
wenzelm@19911
    38
  val export: Context.proof -> Context.proof -> thm list -> thm list
wenzelm@19911
    39
  val importT_inst: term list -> Context.proof -> ((indexname * sort) * typ) list * Context.proof
wenzelm@19911
    40
  val import_inst: bool -> term list -> Context.proof ->
wenzelm@19911
    41
    (((indexname * sort) * typ) list * ((indexname * typ) * term) list) * Context.proof
wenzelm@19911
    42
  val importT_terms: term list -> Context.proof -> term list * Context.proof
wenzelm@19911
    43
  val import_terms: bool -> term list -> Context.proof -> term list * Context.proof
wenzelm@19911
    44
  val importT: thm list -> Context.proof -> thm list * Context.proof
wenzelm@19911
    45
  val import: bool -> thm list -> Context.proof -> thm list * Context.proof
wenzelm@19926
    46
  val tradeT: Context.proof -> (thm list -> thm list) -> thm list -> thm list
wenzelm@19926
    47
  val trade: Context.proof -> (thm list -> thm list) -> thm list -> thm list
wenzelm@20149
    48
  val focus: cterm -> Context.proof -> ((string * typ) list * cterm) * Context.proof
wenzelm@19899
    49
  val warn_extra_tfrees: Context.proof -> Context.proof -> unit
wenzelm@19899
    50
  val polymorphic: Context.proof -> term list -> term list
wenzelm@19899
    51
  val hidden_polymorphism: term -> typ -> (indexname * sort) list
wenzelm@19899
    52
  val add_binds: (indexname * term option) list -> Context.proof -> Context.proof
wenzelm@19899
    53
  val expand_binds: Context.proof -> term -> term
wenzelm@19899
    54
end;
wenzelm@19899
    55
wenzelm@19899
    56
structure Variable: VARIABLE =
wenzelm@19899
    57
struct
wenzelm@19899
    58
wenzelm@20084
    59
wenzelm@19899
    60
(** local context data **)
wenzelm@19899
    61
wenzelm@19899
    62
datatype data = Data of
wenzelm@20102
    63
 {is_body: bool,                        (*inner body mode*)
wenzelm@20102
    64
  names: Name.context,        		(*used type/term variable names*)
wenzelm@20102
    65
  fixes: (string * string) list, 	(*term fixes -- extern/intern*)
wenzelm@20102
    66
  binds: (typ * term) Vartab.table,     (*term bindings*)
wenzelm@19899
    67
  defaults:
wenzelm@20102
    68
    typ Vartab.table *                  (*type constraints*)
wenzelm@20102
    69
    sort Vartab.table *                 (*default sorts*)
wenzelm@20102
    70
    string list *                       (*used type variables*)
wenzelm@20102
    71
    string list Symtab.table};          (*occurrences of type variables in term variables*)
wenzelm@19899
    72
wenzelm@20102
    73
fun make_data (is_body, names, fixes, binds, defaults) =
wenzelm@20102
    74
  Data {is_body = is_body, names = names, fixes = fixes, binds = binds, defaults = defaults};
wenzelm@19899
    75
wenzelm@19899
    76
structure Data = ProofDataFun
wenzelm@19899
    77
(
wenzelm@19899
    78
  val name = "Pure/variable";
wenzelm@19899
    79
  type T = data;
wenzelm@19899
    80
  fun init thy =
wenzelm@20123
    81
    make_data (false, Name.context, [], Vartab.empty,
wenzelm@20102
    82
      (Vartab.empty, Vartab.empty, [], Symtab.empty));
wenzelm@19899
    83
  fun print _ _ = ();
wenzelm@19899
    84
);
wenzelm@19899
    85
wenzelm@19899
    86
val _ = Context.add_setup Data.init;
wenzelm@19899
    87
wenzelm@19899
    88
fun map_data f =
wenzelm@20102
    89
  Data.map (fn Data {is_body, names, fixes, binds, defaults} =>
wenzelm@20102
    90
    make_data (f (is_body, names, fixes, binds, defaults)));
wenzelm@19899
    91
wenzelm@20102
    92
fun map_names f = map_data (fn (is_body, names, fixes, binds, defaults) =>
wenzelm@20102
    93
  (is_body, f names, fixes, binds, defaults));
wenzelm@19899
    94
wenzelm@20102
    95
fun map_fixes f = map_data (fn (is_body, names, fixes, binds, defaults) =>
wenzelm@20102
    96
  (is_body, names, f fixes, binds, defaults));
wenzelm@19899
    97
wenzelm@20102
    98
fun map_binds f = map_data (fn (is_body, names, fixes, binds, defaults) =>
wenzelm@20102
    99
  (is_body, names, fixes, f binds, defaults));
wenzelm@20102
   100
wenzelm@20102
   101
fun map_defaults f = map_data (fn (is_body, names, fixes, binds, defaults) =>
wenzelm@20102
   102
  (is_body, names, fixes, binds, f defaults));
wenzelm@19899
   103
wenzelm@19899
   104
fun rep_data ctxt = Data.get ctxt |> (fn Data args => args);
wenzelm@19899
   105
wenzelm@19899
   106
val is_body = #is_body o rep_data;
wenzelm@20102
   107
fun set_body b = map_data (fn (_, names, fixes, binds, defaults) =>
wenzelm@20102
   108
  (b, names, fixes, binds, defaults));
wenzelm@19899
   109
fun restore_body ctxt = set_body (is_body ctxt);
wenzelm@19899
   110
wenzelm@20102
   111
val names_of = #names o rep_data;
wenzelm@20102
   112
val fixes_of = #fixes o rep_data;
wenzelm@19899
   113
val binds_of = #binds o rep_data;
wenzelm@19899
   114
wenzelm@19899
   115
val defaults_of = #defaults o rep_data;
wenzelm@19899
   116
val used_types = #3 o defaults_of;
wenzelm@19899
   117
val type_occs_of = #4 o defaults_of;
wenzelm@19899
   118
wenzelm@19899
   119
fun is_declared ctxt x = Vartab.defined (#1 (defaults_of ctxt)) (x, ~1);
wenzelm@19899
   120
fun is_fixed ctxt x = exists (fn (_, y) => x = y) (fixes_of ctxt);
wenzelm@20149
   121
fun newly_fixed inner outer x = is_fixed inner x andalso not (is_fixed outer x);
wenzelm@19899
   122
wenzelm@19899
   123
wenzelm@19899
   124
wenzelm@19899
   125
(** declarations **)
wenzelm@19899
   126
wenzelm@19899
   127
(* default sorts and types *)
wenzelm@19899
   128
wenzelm@19899
   129
val def_sort = Vartab.lookup o #2 o defaults_of;
wenzelm@19899
   130
wenzelm@19899
   131
fun def_type ctxt pattern xi =
wenzelm@20102
   132
  let val {binds, defaults = (types, _, _, _), ...} = rep_data ctxt in
wenzelm@19899
   133
    (case Vartab.lookup types xi of
wenzelm@19899
   134
      NONE =>
wenzelm@19899
   135
        if pattern then NONE
wenzelm@19899
   136
        else Vartab.lookup binds xi |> Option.map (TypeInfer.polymorphicT o #1)
wenzelm@19899
   137
    | some => some)
wenzelm@19899
   138
  end;
wenzelm@19899
   139
wenzelm@19899
   140
fun default_type ctxt x = Vartab.lookup (#1 (defaults_of ctxt)) (x, ~1);
wenzelm@19899
   141
wenzelm@19899
   142
wenzelm@19899
   143
(* declare types/terms *)
wenzelm@19899
   144
wenzelm@19899
   145
local
wenzelm@19899
   146
wenzelm@19899
   147
val ins_types = fold_aterms
wenzelm@19899
   148
  (fn Free (x, T) => Vartab.update ((x, ~1), T)
wenzelm@19899
   149
    | Var v => Vartab.update v
wenzelm@19899
   150
    | _ => I);
wenzelm@19899
   151
wenzelm@19899
   152
val ins_sorts = fold_atyps
wenzelm@20123
   153
  (fn TFree (x, S) => Vartab.default ((x, ~1), S)
wenzelm@20123
   154
    | TVar v => Vartab.default v
wenzelm@19899
   155
    | _ => I);
wenzelm@19899
   156
wenzelm@19899
   157
val ins_used = fold_atyps
wenzelm@19899
   158
  (fn TFree (x, _) => insert (op =) x | _ => I);
wenzelm@19899
   159
wenzelm@19899
   160
val ins_occs = fold_term_types (fn t =>
wenzelm@19911
   161
  let val x = case t of Free (x, _) => x | _ => ""
wenzelm@19911
   162
  in fold_atyps (fn TFree (a, _) => Symtab.insert_list (op =) (a, x) | _ => I) end);
wenzelm@19899
   163
wenzelm@19899
   164
fun ins_skolem def_ty = fold_rev (fn (x, x') =>
wenzelm@19899
   165
  (case def_ty x' of
wenzelm@19899
   166
    SOME T => Vartab.update ((x, ~1), T)
wenzelm@19899
   167
  | NONE => I));
wenzelm@19899
   168
wenzelm@20084
   169
val ins_namesT = fold_atyps
wenzelm@20084
   170
  (fn TFree (x, _) => Name.declare x | _ => I);
wenzelm@20084
   171
wenzelm@20084
   172
fun ins_names t =
wenzelm@20084
   173
  fold_types ins_namesT t #>
wenzelm@20084
   174
  fold_aterms (fn Free (x, _) => Name.declare x | _ => I) t;
wenzelm@20084
   175
wenzelm@19899
   176
in
wenzelm@19899
   177
wenzelm@20102
   178
fun declare_type T = map_defaults (fn (types, sorts, used, occ) =>
wenzelm@20102
   179
  (types,
wenzelm@20102
   180
    ins_sorts T sorts,
wenzelm@20102
   181
    ins_used T used,
wenzelm@20102
   182
    occ)) #>
wenzelm@20102
   183
  map_names (ins_namesT T);
wenzelm@19899
   184
wenzelm@20102
   185
fun declare_syntax t = map_defaults (fn (types, sorts, used, occ) =>
wenzelm@20102
   186
  (ins_types t types,
wenzelm@20102
   187
    fold_types ins_sorts t sorts,
wenzelm@20102
   188
    fold_types ins_used t used,
wenzelm@20102
   189
    occ)) #>
wenzelm@20102
   190
  map_names (ins_names t);
wenzelm@19899
   191
wenzelm@20102
   192
fun declare_occs t = map_defaults (fn (types, sorts, used, occ) =>
wenzelm@20102
   193
  (types, sorts, used, ins_occs t occ));
wenzelm@19911
   194
wenzelm@19899
   195
fun declare_term t ctxt =
wenzelm@19899
   196
  ctxt
wenzelm@19899
   197
  |> declare_syntax t
wenzelm@20102
   198
  |> map_defaults (fn (types, sorts, used, occ) =>
wenzelm@19899
   199
     (ins_skolem (fn x => Vartab.lookup types (x, ~1)) (fixes_of ctxt) types,
wenzelm@19899
   200
      sorts,
wenzelm@19899
   201
      used,
wenzelm@20102
   202
      ins_occs t occ))
wenzelm@20102
   203
  |> map_names (ins_names t);
wenzelm@19899
   204
wenzelm@19926
   205
fun declare_thm th = fold declare_term (Thm.full_prop_of th :: Thm.hyps_of th);
wenzelm@19926
   206
fun thm_context th = Context.init_proof (Thm.theory_of_thm th) |> declare_thm th;
wenzelm@19926
   207
wenzelm@19899
   208
end;
wenzelm@19899
   209
wenzelm@19899
   210
wenzelm@19899
   211
(* renaming term/type frees *)
wenzelm@19899
   212
wenzelm@19899
   213
fun rename_wrt ctxt ts frees =
wenzelm@19899
   214
  let
wenzelm@20102
   215
    val names = names_of (ctxt |> fold declare_syntax ts);
wenzelm@20084
   216
    val xs = fst (Name.variants (map #1 frees) names);
wenzelm@20084
   217
  in xs ~~ map snd frees end;
wenzelm@19899
   218
wenzelm@19899
   219
wenzelm@19899
   220
wenzelm@19911
   221
(** fixes **)
wenzelm@19911
   222
wenzelm@20084
   223
local
wenzelm@20084
   224
wenzelm@19911
   225
fun no_dups [] = ()
wenzelm@19911
   226
  | no_dups dups = error ("Duplicate fixed variable(s): " ^ commas_quote dups);
wenzelm@19911
   227
wenzelm@20102
   228
fun new_fixes names' xs xs' =
wenzelm@20102
   229
  map_names (K names') #>
wenzelm@20102
   230
  map_fixes (fn fixes => (rev (xs ~~ xs') @ fixes)) #>
wenzelm@20084
   231
  fold (declare_syntax o Syntax.free) xs' #>
wenzelm@20084
   232
  pair xs';
wenzelm@20084
   233
wenzelm@20084
   234
in
wenzelm@20084
   235
wenzelm@19911
   236
fun add_fixes xs ctxt =
wenzelm@19911
   237
  let
wenzelm@19911
   238
    val _ =
wenzelm@20084
   239
      (case filter (can Name.dest_skolem) xs of [] => ()
wenzelm@19911
   240
      | bads => error ("Illegal internal Skolem constant(s): " ^ commas_quote bads));
wenzelm@20084
   241
    val _ = no_dups (duplicates (op =) xs);
wenzelm@20084
   242
    val (ys, zs) = split_list (fixes_of ctxt);
wenzelm@20102
   243
    val names = names_of ctxt;
wenzelm@20084
   244
    val (xs', names') =
wenzelm@20149
   245
      if is_body ctxt then Name.variants xs names |>> map Name.skolem
wenzelm@20084
   246
      else (no_dups (xs inter_string ys); no_dups (xs inter_string zs);
wenzelm@20084
   247
        (xs, fold Name.declare xs names));
wenzelm@20102
   248
  in ctxt |> new_fixes names' xs xs' end;
wenzelm@19911
   249
wenzelm@20084
   250
fun invent_fixes raw_xs ctxt =
wenzelm@20084
   251
  let
wenzelm@20102
   252
    val names = names_of ctxt;
wenzelm@20149
   253
    val xs = map Name.clean raw_xs;
wenzelm@20149
   254
    val (xs', names') = Name.variants xs names |>> map Name.skolem;
wenzelm@20102
   255
  in ctxt |> new_fixes names' xs xs' end;
wenzelm@20084
   256
wenzelm@20084
   257
end;
wenzelm@19911
   258
wenzelm@19911
   259
fun invent_types Ss ctxt =
wenzelm@19911
   260
  let
wenzelm@20102
   261
    val tfrees = Name.invents (names_of ctxt) "'a" (length Ss) ~~ Ss;
wenzelm@19911
   262
    val ctxt' = fold (declare_type o TFree) tfrees ctxt;
wenzelm@19911
   263
  in (tfrees, ctxt') end;
wenzelm@19911
   264
wenzelm@19911
   265
wenzelm@19911
   266
wenzelm@19911
   267
(** export -- generalize type/term variables **)
wenzelm@19911
   268
wenzelm@19911
   269
fun export_inst inner outer =
wenzelm@19911
   270
  let
wenzelm@19911
   271
    val types_outer = used_types outer;
wenzelm@19911
   272
    val fixes_inner = fixes_of inner;
wenzelm@19911
   273
    val fixes_outer = fixes_of outer;
wenzelm@19911
   274
wenzelm@19911
   275
    val gen_fixes = map #2 (Library.take (length fixes_inner - length fixes_outer, fixes_inner));
wenzelm@19911
   276
    val still_fixed = not o member (op =) ("" :: gen_fixes);
wenzelm@19911
   277
    val gen_fixesT =
wenzelm@19911
   278
      Symtab.fold (fn (a, xs) =>
wenzelm@19911
   279
        if member (op =) types_outer a orelse exists still_fixed xs
wenzelm@19911
   280
        then I else cons a) (type_occs_of inner) [];
wenzelm@19911
   281
  in (gen_fixesT, gen_fixes) end;
wenzelm@19911
   282
wenzelm@19911
   283
fun exportT_inst inner outer = #1 (export_inst inner outer);
wenzelm@19911
   284
wenzelm@19911
   285
fun exportT_terms inner outer ts =
wenzelm@19911
   286
  map (Term.generalize (exportT_inst (fold declare_occs ts inner) outer, [])
wenzelm@19911
   287
    (fold (Term.fold_types Term.maxidx_typ) ts ~1 + 1)) ts;
wenzelm@19911
   288
wenzelm@19911
   289
fun export_terms inner outer ts =
wenzelm@19911
   290
  map (Term.generalize (export_inst (fold declare_occs ts inner) outer)
wenzelm@19911
   291
    (fold Term.maxidx_term ts ~1 + 1)) ts;
wenzelm@19911
   292
wenzelm@19911
   293
fun gen_export inst inner outer ths =
wenzelm@19911
   294
  let
wenzelm@19926
   295
    val ths' = map Thm.adjust_maxidx_thm ths;
wenzelm@19926
   296
    val inner' = fold (declare_occs o Thm.full_prop_of) ths' inner;
wenzelm@20003
   297
  in map (Thm.generalize (inst inner' outer) (fold Thm.maxidx_thm ths' ~1 + 1)) ths' end;
wenzelm@19911
   298
wenzelm@19911
   299
val exportT = gen_export (rpair [] oo exportT_inst);
wenzelm@19911
   300
val export = gen_export export_inst;
wenzelm@19911
   301
wenzelm@19911
   302
wenzelm@19911
   303
wenzelm@19911
   304
(** import -- fix schematic type/term variables **)
wenzelm@19911
   305
wenzelm@19911
   306
fun importT_inst ts ctxt =
wenzelm@19911
   307
  let
wenzelm@19911
   308
    val tvars = rev (fold Term.add_tvars ts []);
wenzelm@19911
   309
    val (tfrees, ctxt') = invent_types (map #2 tvars) ctxt;
wenzelm@19911
   310
  in (tvars ~~ map TFree tfrees, ctxt') end;
wenzelm@19911
   311
wenzelm@19911
   312
fun import_inst is_open ts ctxt =
wenzelm@19911
   313
  let
wenzelm@19911
   314
    val (instT, ctxt') = importT_inst ts ctxt;
wenzelm@19911
   315
    val vars = map (apsnd (Term.instantiateT instT)) (rev (fold Term.add_vars ts []));
wenzelm@20084
   316
    val ren = if is_open then I else Name.internal;
wenzelm@19911
   317
    val (xs, ctxt'') = invent_fixes (map (ren o #1 o #1) vars) ctxt';
wenzelm@19911
   318
    val inst = vars ~~ map Free (xs ~~ map #2 vars);
wenzelm@19911
   319
  in ((instT, inst), ctxt'') end;
wenzelm@19911
   320
wenzelm@19911
   321
fun importT_terms ts ctxt =
wenzelm@19911
   322
  let val (instT, ctxt') = importT_inst ts ctxt
wenzelm@19911
   323
  in (map (Term.instantiate (instT, [])) ts, ctxt') end;
wenzelm@19911
   324
wenzelm@19911
   325
fun import_terms is_open ts ctxt =
wenzelm@19911
   326
  let val (inst, ctxt') = import_inst is_open ts ctxt
wenzelm@19911
   327
  in (map (Term.instantiate inst) ts, ctxt') end;
wenzelm@19911
   328
wenzelm@19911
   329
fun importT ths ctxt =
wenzelm@19911
   330
  let
wenzelm@19911
   331
    val thy = Context.theory_of_proof ctxt;
wenzelm@19911
   332
    val certT = Thm.ctyp_of thy;
wenzelm@19911
   333
    val (instT, ctxt') = importT_inst (map Thm.full_prop_of ths) ctxt;
wenzelm@19911
   334
    val instT' = map (fn (v, T) => (certT (TVar v), certT T)) instT;
wenzelm@19911
   335
    val ths' = map (Thm.instantiate (instT', [])) ths;
wenzelm@19911
   336
  in (ths', ctxt') end;
wenzelm@19911
   337
wenzelm@19911
   338
fun import is_open ths ctxt =
wenzelm@19911
   339
  let
wenzelm@19911
   340
    val thy = Context.theory_of_proof ctxt;
wenzelm@19911
   341
    val cert = Thm.cterm_of thy;
wenzelm@19911
   342
    val certT = Thm.ctyp_of thy;
wenzelm@19911
   343
    val ((instT, inst), ctxt') = import_inst is_open (map Thm.full_prop_of ths) ctxt;
wenzelm@19911
   344
    val instT' = map (fn (v, T) => (certT (TVar v), certT T)) instT;
wenzelm@19911
   345
    val inst' = map (fn (v, t) => (cert (Var v), cert t)) inst;
wenzelm@19911
   346
    val ths' = map (Thm.instantiate (instT', inst')) ths;
wenzelm@19911
   347
  in (ths', ctxt') end;
wenzelm@19911
   348
wenzelm@19911
   349
wenzelm@19926
   350
(* import/export *)
wenzelm@19926
   351
wenzelm@19926
   352
fun gen_trade imp exp ctxt f ths =
wenzelm@19926
   353
  let val (ths', ctxt') = imp ths ctxt
wenzelm@19926
   354
  in exp ctxt' ctxt (f ths') end;
wenzelm@19926
   355
wenzelm@19926
   356
val tradeT = gen_trade importT exportT;
wenzelm@19926
   357
val trade = gen_trade (import true) export;
wenzelm@19926
   358
wenzelm@19926
   359
wenzelm@20149
   360
(* focus on outer params *)
wenzelm@20149
   361
wenzelm@20149
   362
fun forall_elim_prop t prop =
wenzelm@20149
   363
  Thm.beta_conversion false (Thm.capply (#2 (Thm.dest_comb prop)) t)
wenzelm@20149
   364
  |> Thm.cprop_of |> Thm.dest_comb |> #2;
wenzelm@20149
   365
wenzelm@20149
   366
fun focus goal ctxt =
wenzelm@20149
   367
  let
wenzelm@20149
   368
    val cert = Thm.cterm_of (Thm.theory_of_cterm goal);
wenzelm@20149
   369
    val t = Thm.term_of goal;
wenzelm@20149
   370
    val ps = rev (Term.rename_wrt_term t (Term.strip_all_vars t));   (*as they are printed :-*)
wenzelm@20149
   371
    val (xs, Ts) = split_list ps;
wenzelm@20149
   372
    val (xs', ctxt') = invent_fixes xs ctxt;
wenzelm@20149
   373
    val ps' = xs' ~~ Ts;
wenzelm@20149
   374
    val goal' = fold (forall_elim_prop o cert o Free) ps' goal;
wenzelm@20149
   375
  in ((ps', goal'), ctxt') end;
wenzelm@20149
   376
wenzelm@19911
   377
wenzelm@19911
   378
(** implicit polymorphism **)
wenzelm@19899
   379
wenzelm@19899
   380
(* warn_extra_tfrees *)
wenzelm@19899
   381
wenzelm@19899
   382
fun warn_extra_tfrees ctxt1 ctxt2 =
wenzelm@19899
   383
  let
wenzelm@19911
   384
    fun occs_typ a = Term.exists_subtype (fn TFree (b, _) => a = b | _ => false);
wenzelm@19911
   385
    fun occs_free _ "" = I
wenzelm@19911
   386
      | occs_free a x =
wenzelm@19899
   387
          (case def_type ctxt1 false (x, ~1) of
wenzelm@19899
   388
            SOME T => if occs_typ a T then I else cons (a, x)
wenzelm@19911
   389
          | NONE => cons (a, x));
wenzelm@19899
   390
wenzelm@19899
   391
    val occs1 = type_occs_of ctxt1 and occs2 = type_occs_of ctxt2;
wenzelm@19911
   392
    val extras = Symtab.fold (fn (a, xs) =>
wenzelm@19911
   393
      if Symtab.defined occs1 a then I else fold (occs_free a) xs) occs2 [];
wenzelm@19899
   394
    val tfrees = map #1 extras |> sort_distinct string_ord;
wenzelm@19899
   395
    val frees = map #2 extras |> sort_distinct string_ord;
wenzelm@19899
   396
  in
wenzelm@19899
   397
    if null extras then ()
wenzelm@19899
   398
    else warning ("Introduced fixed type variable(s): " ^ commas tfrees ^ " in " ^
wenzelm@19899
   399
      space_implode " or " (map quote frees))
wenzelm@19899
   400
  end;
wenzelm@19899
   401
wenzelm@19899
   402
wenzelm@20149
   403
(* polymorphic terms *)
wenzelm@19899
   404
wenzelm@19911
   405
fun monomorphic ctxt ts =
wenzelm@19911
   406
  #1 (importT_terms ts (fold declare_term ts ctxt));
wenzelm@19899
   407
wenzelm@19899
   408
fun polymorphic ctxt ts =
wenzelm@20003
   409
  let
wenzelm@20003
   410
    val ctxt' = fold declare_term ts ctxt;
wenzelm@20003
   411
    val types = subtract (op =) (used_types ctxt) (used_types ctxt');
wenzelm@20003
   412
    val idx = fold (Term.fold_types Term.maxidx_typ) ts ~1 + 1;
wenzelm@20003
   413
  in map (Term.generalize (types, []) idx) ts end;
wenzelm@20003
   414
wenzelm@19911
   415
wenzelm@19911
   416
wenzelm@19911
   417
(** term bindings **)
wenzelm@19899
   418
wenzelm@19899
   419
fun hidden_polymorphism t T =
wenzelm@19899
   420
  let
wenzelm@19899
   421
    val tvarsT = Term.add_tvarsT T [];
wenzelm@19899
   422
    val extra_tvars = Term.fold_types (Term.fold_atyps
wenzelm@19899
   423
      (fn TVar v => if member (op =) tvarsT v then I else insert (op =) v | _ => I)) t [];
wenzelm@19899
   424
  in extra_tvars end;
wenzelm@19899
   425
wenzelm@19899
   426
fun add_bind (xi, NONE) = map_binds (Vartab.delete_safe xi)
wenzelm@19899
   427
  | add_bind ((x, i), SOME t) =
wenzelm@19899
   428
      let
wenzelm@19899
   429
        val T = Term.fastype_of t;
wenzelm@19899
   430
        val t' =
wenzelm@19899
   431
          if null (hidden_polymorphism t T) then t
wenzelm@19899
   432
          else Var ((x ^ "_has_extra_type_vars_on_rhs", i), T);
wenzelm@19899
   433
      in declare_term t' #> map_binds (Vartab.update ((x, i), (T, t'))) end;
wenzelm@19899
   434
wenzelm@19899
   435
val add_binds = fold add_bind;
wenzelm@19899
   436
wenzelm@19899
   437
fun expand_binds ctxt =
wenzelm@19899
   438
  let
wenzelm@19899
   439
    val binds = binds_of ctxt;
wenzelm@19899
   440
    fun expand (t as Var (xi, T)) =
wenzelm@19899
   441
          (case Vartab.lookup binds xi of
wenzelm@19899
   442
            SOME u => Envir.expand_atom T u
wenzelm@19899
   443
          | NONE => t)
wenzelm@19899
   444
      | expand t = t;
wenzelm@19899
   445
  in Envir.beta_norm o Term.map_aterms expand end;
wenzelm@19899
   446
wenzelm@19899
   447
end;