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