src/Pure/variable.ML
author wenzelm
Wed Apr 27 17:58:45 2011 +0200 (2011-04-27)
changeset 42488 4638622bcaa1
parent 42482 42c7ef050bc3
child 42493 01430341fc79
permissions -rw-r--r--
reorganized fixes as specialized (global) name space;
wenzelm@19899
     1
(*  Title:      Pure/variable.ML
wenzelm@19899
     2
    Author:     Makarius
wenzelm@19899
     3
wenzelm@19899
     4
Fixed type/term variables and polymorphic term abbreviations.
wenzelm@19899
     5
*)
wenzelm@19899
     6
wenzelm@19899
     7
signature VARIABLE =
wenzelm@19899
     8
sig
wenzelm@20303
     9
  val is_body: Proof.context -> bool
wenzelm@20303
    10
  val set_body: bool -> Proof.context -> Proof.context
wenzelm@20303
    11
  val restore_body: Proof.context -> Proof.context -> Proof.context
wenzelm@20303
    12
  val names_of: Proof.context -> Name.context
wenzelm@20303
    13
  val binds_of: Proof.context -> (typ * term) Vartab.table
wenzelm@24765
    14
  val maxidx_of: Proof.context -> int
wenzelm@28625
    15
  val sorts_of: Proof.context -> sort list
wenzelm@20303
    16
  val constraints_of: Proof.context -> typ Vartab.table * sort Vartab.table
wenzelm@20303
    17
  val is_declared: Proof.context -> string -> bool
wenzelm@42357
    18
  val name: binding -> string
wenzelm@20303
    19
  val default_type: Proof.context -> string -> typ option
wenzelm@20303
    20
  val def_type: Proof.context -> bool -> indexname -> typ option
wenzelm@20303
    21
  val def_sort: Proof.context -> indexname -> sort option
wenzelm@27280
    22
  val declare_names: term -> Proof.context -> Proof.context
wenzelm@20303
    23
  val declare_constraints: term -> Proof.context -> Proof.context
wenzelm@20303
    24
  val declare_term: term -> Proof.context -> Proof.context
wenzelm@27280
    25
  val declare_typ: typ -> Proof.context -> Proof.context
wenzelm@20303
    26
  val declare_prf: Proofterm.proof -> Proof.context -> Proof.context
wenzelm@20303
    27
  val declare_thm: thm -> Proof.context -> Proof.context
wenzelm@36603
    28
  val global_thm_context: thm -> Proof.context
wenzelm@20303
    29
  val variant_frees: Proof.context -> term list -> (string * 'a) list -> (string * 'a) list
wenzelm@30756
    30
  val bind_term: indexname * term option -> Proof.context -> Proof.context
wenzelm@20303
    31
  val expand_binds: Proof.context -> term -> term
wenzelm@25325
    32
  val lookup_const: Proof.context -> string -> string option
wenzelm@25316
    33
  val is_const: Proof.context -> string -> bool
wenzelm@25325
    34
  val declare_const: string * string -> Proof.context -> Proof.context
wenzelm@42488
    35
  val fixed_ord: Proof.context -> string * string -> order
wenzelm@42488
    36
  val is_fixed: Proof.context -> string -> bool
wenzelm@42488
    37
  val newly_fixed: Proof.context -> Proof.context -> string -> bool
wenzelm@42488
    38
  val intern_fixed: Proof.context -> string -> string
wenzelm@42488
    39
  val lookup_fixed: Proof.context -> string -> string option
wenzelm@42488
    40
  val revert_fixed: Proof.context -> string -> string
wenzelm@42482
    41
  val add_fixed_names: Proof.context -> term -> string list -> string list
wenzelm@42482
    42
  val add_fixed: Proof.context -> term -> (string * typ) list -> (string * typ) list
wenzelm@42482
    43
  val add_free_names: Proof.context -> term -> string list -> string list
wenzelm@42482
    44
  val add_frees: Proof.context -> term -> (string * typ) list -> (string * typ) list
wenzelm@42488
    45
  val add_fixes_binding: binding list -> Proof.context -> string list * Proof.context
wenzelm@20303
    46
  val add_fixes: string list -> Proof.context -> string list * Proof.context
wenzelm@20303
    47
  val add_fixes_direct: string list -> Proof.context -> Proof.context
wenzelm@21369
    48
  val auto_fixes: term -> Proof.context -> Proof.context
wenzelm@20797
    49
  val variant_fixes: string list -> Proof.context -> string list * Proof.context
wenzelm@42488
    50
  val dest_fixes: Proof.context -> (string * string) list
wenzelm@20303
    51
  val invent_types: sort list -> Proof.context -> (string * sort) list * Proof.context
wenzelm@20303
    52
  val export_terms: Proof.context -> Proof.context -> term list -> term list
wenzelm@20303
    53
  val exportT_terms: Proof.context -> Proof.context -> term list -> term list
wenzelm@20303
    54
  val exportT: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@20303
    55
  val export_prf: Proof.context -> Proof.context -> Proofterm.proof -> Proofterm.proof
wenzelm@20303
    56
  val export: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@21522
    57
  val export_morphism: Proof.context -> Proof.context -> morphism
wenzelm@20303
    58
  val importT_inst: term list -> Proof.context -> ((indexname * sort) * typ) list * Proof.context
wenzelm@20303
    59
  val import_inst: bool -> term list -> Proof.context ->
wenzelm@20303
    60
    (((indexname * sort) * typ) list * ((indexname * typ) * term) list) * Proof.context
wenzelm@20303
    61
  val importT_terms: term list -> Proof.context -> term list * Proof.context
wenzelm@20303
    62
  val import_terms: bool -> term list -> Proof.context -> term list * Proof.context
wenzelm@32280
    63
  val importT: thm list -> Proof.context -> ((ctyp * ctyp) list * thm list) * Proof.context
wenzelm@20303
    64
  val import_prf: bool -> Proofterm.proof -> Proof.context -> Proofterm.proof * Proof.context
wenzelm@31794
    65
  val import: bool -> thm list -> Proof.context ->
wenzelm@32280
    66
    (((ctyp * ctyp) list * (cterm * cterm) list) * thm list) * Proof.context
wenzelm@21287
    67
  val tradeT: (Proof.context -> thm list -> thm list) -> Proof.context -> thm list -> thm list
wenzelm@21287
    68
  val trade: (Proof.context -> thm list -> thm list) -> Proof.context -> thm list -> thm list
wenzelm@32199
    69
  val focus: cterm -> Proof.context -> ((string * cterm) list * cterm) * Proof.context
wenzelm@32199
    70
  val focus_subgoal: int -> thm -> Proof.context -> ((string * cterm) list * cterm) * Proof.context
wenzelm@20303
    71
  val warn_extra_tfrees: Proof.context -> Proof.context -> unit
wenzelm@24694
    72
  val polymorphic_types: Proof.context -> term list -> (indexname * sort) list * term list
wenzelm@20303
    73
  val polymorphic: Proof.context -> term list -> term list
wenzelm@19899
    74
end;
wenzelm@19899
    75
wenzelm@19899
    76
structure Variable: VARIABLE =
wenzelm@19899
    77
struct
wenzelm@19899
    78
wenzelm@19899
    79
(** local context data **)
wenzelm@19899
    80
wenzelm@42488
    81
type fixes = string Name_Space.table;
wenzelm@42488
    82
val empty_fixes: fixes = Name_Space.empty_table "fixed variable";
wenzelm@42488
    83
wenzelm@19899
    84
datatype data = Data of
wenzelm@20102
    85
 {is_body: bool,                        (*inner body mode*)
wenzelm@20162
    86
  names: Name.context,                  (*type/term variable names*)
wenzelm@25325
    87
  consts: string Symtab.table,          (*consts within the local scope*)
wenzelm@42488
    88
  fixes: fixes,                         (*term fixes -- global name space, intern ~> extern*)
wenzelm@20102
    89
  binds: (typ * term) Vartab.table,     (*term bindings*)
wenzelm@20162
    90
  type_occs: string list Symtab.table,  (*type variables -- possibly within term variables*)
wenzelm@24765
    91
  maxidx: int,                          (*maximum var index*)
wenzelm@40124
    92
  sorts: sort Ord_List.T,               (*declared sort occurrences*)
wenzelm@20162
    93
  constraints:
wenzelm@20102
    94
    typ Vartab.table *                  (*type constraints*)
wenzelm@20162
    95
    sort Vartab.table};                 (*default sorts*)
wenzelm@19899
    96
wenzelm@28625
    97
fun make_data (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints) =
wenzelm@25325
    98
  Data {is_body = is_body, names = names, consts = consts, fixes = fixes, binds = binds,
wenzelm@28625
    99
    type_occs = type_occs, maxidx = maxidx, sorts = sorts, constraints = constraints};
wenzelm@19899
   100
wenzelm@33519
   101
structure Data = Proof_Data
wenzelm@19899
   102
(
wenzelm@19899
   103
  type T = data;
wenzelm@32784
   104
  fun init _ =
wenzelm@42488
   105
    make_data (false, Name.context, Symtab.empty, empty_fixes, Vartab.empty,
wenzelm@42488
   106
      Symtab.empty, ~1, [], (Vartab.empty, Vartab.empty));
wenzelm@19899
   107
);
wenzelm@19899
   108
wenzelm@19899
   109
fun map_data f =
wenzelm@28625
   110
  Data.map (fn Data {is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints} =>
wenzelm@28625
   111
    make_data (f (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints)));
wenzelm@25316
   112
wenzelm@25316
   113
fun map_names f =
wenzelm@28625
   114
  map_data (fn (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints) =>
wenzelm@28625
   115
    (is_body, f names, consts, fixes, binds, type_occs, maxidx, sorts, constraints));
wenzelm@19899
   116
wenzelm@25325
   117
fun map_consts f =
wenzelm@28625
   118
  map_data (fn (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints) =>
wenzelm@28625
   119
    (is_body, names, f consts, fixes, binds, type_occs, maxidx, sorts, constraints));
wenzelm@20162
   120
wenzelm@25316
   121
fun map_fixes f =
wenzelm@28625
   122
  map_data (fn (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints) =>
wenzelm@28625
   123
    (is_body, names, consts, f fixes, binds, type_occs, maxidx, sorts, constraints));
wenzelm@19899
   124
wenzelm@25316
   125
fun map_binds f =
wenzelm@28625
   126
  map_data (fn (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints) =>
wenzelm@28625
   127
    (is_body, names, consts, fixes, f binds, type_occs, maxidx, sorts, constraints));
wenzelm@24765
   128
wenzelm@25316
   129
fun map_type_occs f =
wenzelm@28625
   130
  map_data (fn (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints) =>
wenzelm@28625
   131
    (is_body, names, consts, fixes, binds, f type_occs, maxidx, sorts, constraints));
wenzelm@19899
   132
wenzelm@25316
   133
fun map_maxidx f =
wenzelm@28625
   134
  map_data (fn (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints) =>
wenzelm@28625
   135
    (is_body, names, consts, fixes, binds, type_occs, f maxidx, sorts, constraints));
wenzelm@28625
   136
wenzelm@28625
   137
fun map_sorts f =
wenzelm@28625
   138
  map_data (fn (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints) =>
wenzelm@28625
   139
    (is_body, names, consts, fixes, binds, type_occs, maxidx, f sorts, constraints));
wenzelm@20102
   140
wenzelm@25316
   141
fun map_constraints f =
wenzelm@28625
   142
  map_data (fn (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints) =>
wenzelm@28625
   143
    (is_body, names, consts, fixes, binds, type_occs, maxidx, sorts, f constraints));
wenzelm@19899
   144
wenzelm@19899
   145
fun rep_data ctxt = Data.get ctxt |> (fn Data args => args);
wenzelm@19899
   146
wenzelm@19899
   147
val is_body = #is_body o rep_data;
wenzelm@24765
   148
wenzelm@28625
   149
fun set_body b =
wenzelm@28625
   150
  map_data (fn (_, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints) =>
wenzelm@28625
   151
    (b, names, consts, fixes, binds, type_occs, maxidx, sorts, constraints));
wenzelm@24765
   152
wenzelm@19899
   153
fun restore_body ctxt = set_body (is_body ctxt);
wenzelm@19899
   154
wenzelm@20102
   155
val names_of = #names o rep_data;
wenzelm@20102
   156
val fixes_of = #fixes o rep_data;
wenzelm@19899
   157
val binds_of = #binds o rep_data;
wenzelm@20162
   158
val type_occs_of = #type_occs o rep_data;
wenzelm@24765
   159
val maxidx_of = #maxidx o rep_data;
wenzelm@28625
   160
val sorts_of = #sorts o rep_data;
wenzelm@20162
   161
val constraints_of = #constraints o rep_data;
wenzelm@19899
   162
wenzelm@20162
   163
val is_declared = Name.is_declared o names_of;
wenzelm@19899
   164
wenzelm@42357
   165
(*checked name binding*)
wenzelm@42357
   166
val name = Long_Name.base_name o Name_Space.full_name Name_Space.default_naming;
wenzelm@42357
   167
wenzelm@19899
   168
wenzelm@19899
   169
wenzelm@19899
   170
(** declarations **)
wenzelm@19899
   171
wenzelm@19899
   172
(* default sorts and types *)
wenzelm@19899
   173
wenzelm@20162
   174
fun default_type ctxt x = Vartab.lookup (#1 (constraints_of ctxt)) (x, ~1);
wenzelm@19899
   175
wenzelm@19899
   176
fun def_type ctxt pattern xi =
wenzelm@20162
   177
  let val {binds, constraints = (types, _), ...} = rep_data ctxt in
wenzelm@19899
   178
    (case Vartab.lookup types xi of
wenzelm@19899
   179
      NONE =>
wenzelm@19899
   180
        if pattern then NONE
wenzelm@39290
   181
        else Vartab.lookup binds xi |> Option.map (Type.mark_polymorphic o #1)
wenzelm@19899
   182
    | some => some)
wenzelm@19899
   183
  end;
wenzelm@19899
   184
wenzelm@20162
   185
val def_sort = Vartab.lookup o #2 o constraints_of;
wenzelm@20162
   186
wenzelm@20162
   187
wenzelm@20162
   188
(* names *)
wenzelm@20162
   189
wenzelm@24765
   190
fun declare_type_names t =
wenzelm@29279
   191
  map_names (fold_types (fold_atyps Term.declare_typ_names) t) #>
wenzelm@24765
   192
  map_maxidx (fold_types Term.maxidx_typ t);
wenzelm@20162
   193
wenzelm@20162
   194
fun declare_names t =
wenzelm@20162
   195
  declare_type_names t #>
wenzelm@29279
   196
  map_names (fold_aterms Term.declare_term_frees t) #>
wenzelm@24765
   197
  map_maxidx (Term.maxidx_term t);
wenzelm@20162
   198
wenzelm@20162
   199
wenzelm@20162
   200
(* type occurrences *)
wenzelm@20162
   201
wenzelm@24719
   202
fun decl_type_occsT T = fold_atyps (fn TFree (a, _) => Symtab.default (a, []) | _ => I) T;
wenzelm@24719
   203
wenzelm@22671
   204
val decl_type_occs = fold_term_types
wenzelm@20162
   205
  (fn Free (x, _) => fold_atyps (fn TFree (a, _) => Symtab.insert_list (op =) (a, x) | _ => I)
wenzelm@24719
   206
    | _ => decl_type_occsT);
wenzelm@19899
   207
wenzelm@24719
   208
val declare_type_occsT = map_type_occs o fold_types decl_type_occsT;
wenzelm@22671
   209
val declare_type_occs = map_type_occs o decl_type_occs;
wenzelm@22671
   210
wenzelm@19899
   211
wenzelm@20162
   212
(* constraints *)
wenzelm@19899
   213
wenzelm@21355
   214
fun constrain_tvar (xi, S) =
wenzelm@21355
   215
  if S = dummyS then Vartab.delete_safe xi else Vartab.update (xi, S);
wenzelm@21355
   216
wenzelm@20162
   217
fun declare_constraints t = map_constraints (fn (types, sorts) =>
wenzelm@20162
   218
  let
wenzelm@20162
   219
    val types' = fold_aterms
wenzelm@20162
   220
      (fn Free (x, T) => Vartab.update ((x, ~1), T)
wenzelm@20162
   221
        | Var v => Vartab.update v
wenzelm@20162
   222
        | _ => I) t types;
wenzelm@20162
   223
    val sorts' = fold_types (fold_atyps
wenzelm@21355
   224
      (fn TFree (x, S) => constrain_tvar ((x, ~1), S)
wenzelm@21355
   225
        | TVar v => constrain_tvar v
wenzelm@20162
   226
        | _ => I)) t sorts;
wenzelm@20162
   227
  in (types', sorts') end)
wenzelm@24719
   228
  #> declare_type_occsT t
wenzelm@22711
   229
  #> declare_type_names t;
wenzelm@19899
   230
wenzelm@20162
   231
wenzelm@20162
   232
(* common declarations *)
wenzelm@20162
   233
wenzelm@20162
   234
fun declare_internal t =
wenzelm@20162
   235
  declare_names t #>
wenzelm@28625
   236
  declare_type_occs t #>
wenzelm@28625
   237
  map_sorts (Sorts.insert_term t);
wenzelm@19911
   238
wenzelm@20162
   239
fun declare_term t =
wenzelm@20162
   240
  declare_internal t #>
wenzelm@20162
   241
  declare_constraints t;
wenzelm@19899
   242
wenzelm@27280
   243
val declare_typ = declare_term o Logic.mk_type;
wenzelm@27280
   244
wenzelm@20303
   245
val declare_prf = Proofterm.fold_proof_terms declare_internal (declare_internal o Logic.mk_type);
wenzelm@20303
   246
wenzelm@22691
   247
val declare_thm = Thm.fold_terms declare_internal;
wenzelm@42360
   248
fun global_thm_context th = declare_thm th (Proof_Context.init_global (Thm.theory_of_thm th));
wenzelm@19899
   249
wenzelm@19899
   250
wenzelm@19899
   251
(* renaming term/type frees *)
wenzelm@19899
   252
wenzelm@20162
   253
fun variant_frees ctxt ts frees =
wenzelm@19899
   254
  let
wenzelm@20162
   255
    val names = names_of (fold declare_names ts ctxt);
wenzelm@20084
   256
    val xs = fst (Name.variants (map #1 frees) names);
wenzelm@20084
   257
  in xs ~~ map snd frees end;
wenzelm@19899
   258
wenzelm@19899
   259
wenzelm@19899
   260
wenzelm@20303
   261
(** term bindings **)
wenzelm@20303
   262
wenzelm@30756
   263
fun bind_term (xi, NONE) = map_binds (Vartab.delete_safe xi)
wenzelm@30756
   264
  | bind_term ((x, i), SOME t) =
wenzelm@20303
   265
      let
wenzelm@25051
   266
        val u = Term.close_schematic_term t;
wenzelm@25051
   267
        val U = Term.fastype_of u;
wenzelm@25051
   268
      in declare_term u #> map_binds (Vartab.update ((x, i), (U, u))) end;
wenzelm@20303
   269
wenzelm@20303
   270
fun expand_binds ctxt =
wenzelm@20303
   271
  let
wenzelm@20303
   272
    val binds = binds_of ctxt;
wenzelm@21799
   273
    val get = fn Var (xi, _) => Vartab.lookup binds xi | _ => NONE;
wenzelm@21799
   274
  in Envir.beta_norm o Envir.expand_term get end;
wenzelm@20303
   275
wenzelm@20303
   276
wenzelm@20303
   277
wenzelm@25325
   278
(** consts **)
wenzelm@25316
   279
wenzelm@25325
   280
val lookup_const = Symtab.lookup o #consts o rep_data;
wenzelm@25325
   281
val is_const = is_some oo lookup_const;
wenzelm@25316
   282
wenzelm@25325
   283
val declare_fixed = map_consts o Symtab.delete_safe;
wenzelm@25325
   284
val declare_const = map_consts o Symtab.update;
wenzelm@25316
   285
wenzelm@25316
   286
wenzelm@25316
   287
wenzelm@19911
   288
(** fixes **)
wenzelm@19911
   289
wenzelm@42488
   290
(* specialized name space *)
wenzelm@42488
   291
wenzelm@42488
   292
fun fixed_ord ctxt = Name_Space.entry_ord (#1 (fixes_of ctxt));
wenzelm@42488
   293
wenzelm@42488
   294
fun is_fixed ctxt x = can (Name_Space.the_entry (#1 (fixes_of ctxt))) x;
wenzelm@42488
   295
fun newly_fixed inner outer x = is_fixed inner x andalso not (is_fixed outer x);
wenzelm@42488
   296
wenzelm@42488
   297
fun intern_fixed ctxt = Name_Space.intern (#1 (fixes_of ctxt));
wenzelm@42488
   298
wenzelm@42488
   299
fun lookup_fixed ctxt x =
wenzelm@42488
   300
  let val x' = intern_fixed ctxt x
wenzelm@42488
   301
  in if is_fixed ctxt x' then SOME x' else NONE end;
wenzelm@42488
   302
wenzelm@42488
   303
fun revert_fixed ctxt x =
wenzelm@42488
   304
  (case Symtab.lookup (#2 (fixes_of ctxt)) x of
wenzelm@42488
   305
    SOME x' => if intern_fixed ctxt x' = x then x' else x
wenzelm@42488
   306
  | NONE => x);
wenzelm@42488
   307
wenzelm@42488
   308
fun dest_fixes ctxt =
wenzelm@42488
   309
  let val (space, tab) = fixes_of ctxt
wenzelm@42488
   310
  in sort (Name_Space.entry_ord space o pairself #2) (map swap (Symtab.dest tab)) end;
wenzelm@42488
   311
wenzelm@42488
   312
wenzelm@42482
   313
(* collect variables *)
wenzelm@42482
   314
wenzelm@42482
   315
fun add_free_names ctxt =
wenzelm@42482
   316
  fold_aterms (fn Free (x, _) => not (is_fixed ctxt x) ? insert (op =) x | _ => I);
wenzelm@42482
   317
wenzelm@42482
   318
fun add_frees ctxt =
wenzelm@42482
   319
  fold_aterms (fn Free (x, T) => not (is_fixed ctxt x) ? insert (op =) (x, T) | _ => I);
wenzelm@42482
   320
wenzelm@42482
   321
fun add_fixed_names ctxt =
wenzelm@42482
   322
  fold_aterms (fn Free (x, _) => is_fixed ctxt x ? insert (op =) x | _ => I);
wenzelm@42482
   323
wenzelm@42482
   324
fun add_fixed ctxt =
wenzelm@42482
   325
  fold_aterms (fn Free (x, T) => is_fixed ctxt x ? insert (op =) (x, T) | _ => I);
wenzelm@42482
   326
wenzelm@42482
   327
wenzelm@42482
   328
(* declarations *)
wenzelm@42482
   329
wenzelm@20084
   330
local
wenzelm@20084
   331
wenzelm@42488
   332
fun err_dups dups =
wenzelm@42488
   333
  error ("Duplicate fixed variable(s): " ^ commas (map Binding.print dups));
wenzelm@19911
   334
wenzelm@42488
   335
fun new_fixed ((x, x'), pos) ctxt =
wenzelm@42488
   336
  if is_some (lookup_fixed ctxt x') then err_dups [Binding.make (x, pos)]
wenzelm@42488
   337
  else
wenzelm@42488
   338
    ctxt
wenzelm@42488
   339
    |> map_fixes
wenzelm@42488
   340
      (Name_Space.define ctxt true Name_Space.default_naming (Binding.make (x', pos), x) #> snd #>>
wenzelm@42488
   341
        Name_Space.alias Name_Space.default_naming (Binding.make (x, pos)) x')
wenzelm@42488
   342
    |> declare_fixed x
wenzelm@42488
   343
    |> declare_constraints (Syntax.free x');
wenzelm@42488
   344
wenzelm@42488
   345
fun new_fixes names' xs xs' ps =
wenzelm@20102
   346
  map_names (K names') #>
wenzelm@42488
   347
  fold new_fixed ((xs ~~ xs') ~~ ps) #>
wenzelm@20084
   348
  pair xs';
wenzelm@20084
   349
wenzelm@20084
   350
in
wenzelm@20084
   351
wenzelm@42488
   352
fun add_fixes_binding bs ctxt =
wenzelm@19911
   353
  let
wenzelm@19911
   354
    val _ =
wenzelm@42488
   355
      (case filter (can Name.dest_skolem o Binding.name_of) bs of
wenzelm@42488
   356
        [] => ()
wenzelm@42488
   357
      | bads => error ("Illegal internal Skolem constant(s): " ^ commas (map Binding.print bads)));
wenzelm@42488
   358
    val _ =
wenzelm@42488
   359
      (case duplicates (op = o pairself Binding.name_of) bs of
wenzelm@42488
   360
        [] => ()
wenzelm@42488
   361
      | dups => err_dups dups);
wenzelm@42488
   362
wenzelm@42488
   363
    val xs = map name bs;
wenzelm@20102
   364
    val names = names_of ctxt;
wenzelm@20084
   365
    val (xs', names') =
wenzelm@20149
   366
      if is_body ctxt then Name.variants xs names |>> map Name.skolem
wenzelm@42488
   367
      else (xs, fold Name.declare xs names);
wenzelm@42488
   368
  in ctxt |> new_fixes names' xs xs' (map Binding.pos_of bs) end;
wenzelm@19911
   369
wenzelm@20797
   370
fun variant_fixes raw_xs ctxt =
wenzelm@20084
   371
  let
wenzelm@20102
   372
    val names = names_of ctxt;
wenzelm@26714
   373
    val xs = map (fn x => Name.clean x |> can Name.dest_internal x ? Name.internal) raw_xs;
wenzelm@26714
   374
    val (xs', names') = Name.variants xs names |>> (is_body ctxt ? map Name.skolem);
wenzelm@42488
   375
  in ctxt |> new_fixes names' xs xs' (replicate (length xs) Position.none) end;
wenzelm@20084
   376
wenzelm@20084
   377
end;
wenzelm@19911
   378
wenzelm@42488
   379
val add_fixes = add_fixes_binding o map Binding.name;
wenzelm@20251
   380
wenzelm@20251
   381
fun add_fixes_direct xs ctxt = ctxt
wenzelm@20251
   382
  |> set_body false
wenzelm@20251
   383
  |> (snd o add_fixes xs)
wenzelm@20251
   384
  |> restore_body ctxt;
wenzelm@20251
   385
wenzelm@42482
   386
fun auto_fixes t ctxt = ctxt
wenzelm@42482
   387
  |> not (is_body ctxt) ? add_fixes_direct (rev (add_free_names ctxt t []))
wenzelm@20251
   388
  |> declare_term t;
wenzelm@20251
   389
wenzelm@19911
   390
fun invent_types Ss ctxt =
wenzelm@19911
   391
  let
wenzelm@24848
   392
    val tfrees = Name.invents (names_of ctxt) Name.aT (length Ss) ~~ Ss;
wenzelm@20162
   393
    val ctxt' = fold (declare_constraints o Logic.mk_type o TFree) tfrees ctxt;
wenzelm@19911
   394
  in (tfrees, ctxt') end;
wenzelm@19911
   395
wenzelm@19911
   396
wenzelm@19911
   397
wenzelm@22671
   398
(** export -- generalize type/term variables (beware of closure sizes) **)
wenzelm@19911
   399
wenzelm@19911
   400
fun export_inst inner outer =
wenzelm@19911
   401
  let
wenzelm@20162
   402
    val declared_outer = is_declared outer;
wenzelm@19911
   403
wenzelm@42488
   404
    val gen_fixes =
wenzelm@42488
   405
      Symtab.fold (fn (y, _) => not (is_fixed outer y) ? cons y)
wenzelm@42488
   406
        (#2 (fixes_of inner)) [];
wenzelm@20162
   407
    val still_fixed = not o member (op =) gen_fixes;
wenzelm@22671
   408
wenzelm@22671
   409
    val type_occs_inner = type_occs_of inner;
wenzelm@22671
   410
    fun gen_fixesT ts =
wenzelm@19911
   411
      Symtab.fold (fn (a, xs) =>
wenzelm@20162
   412
        if declared_outer a orelse exists still_fixed xs
wenzelm@22671
   413
        then I else cons a) (fold decl_type_occs ts type_occs_inner) [];
wenzelm@19911
   414
  in (gen_fixesT, gen_fixes) end;
wenzelm@19911
   415
wenzelm@19911
   416
fun exportT_inst inner outer = #1 (export_inst inner outer);
wenzelm@19911
   417
wenzelm@22671
   418
fun exportT_terms inner outer =
wenzelm@22671
   419
  let val mk_tfrees = exportT_inst inner outer in
wenzelm@22671
   420
    fn ts => ts |> map
wenzelm@31977
   421
      (Term_Subst.generalize (mk_tfrees ts, [])
wenzelm@22671
   422
        (fold (Term.fold_types Term.maxidx_typ) ts ~1 + 1))
wenzelm@22671
   423
  end;
wenzelm@19911
   424
wenzelm@22671
   425
fun export_terms inner outer =
wenzelm@22671
   426
  let val (mk_tfrees, tfrees) = export_inst inner outer in
wenzelm@22671
   427
    fn ts => ts |> map
wenzelm@31977
   428
      (Term_Subst.generalize (mk_tfrees ts, tfrees)
wenzelm@22671
   429
        (fold Term.maxidx_term ts ~1 + 1))
wenzelm@22671
   430
  end;
wenzelm@19911
   431
wenzelm@20303
   432
fun export_prf inner outer prf =
wenzelm@20303
   433
  let
wenzelm@22671
   434
    val (mk_tfrees, frees) = export_inst (declare_prf prf inner) outer;
wenzelm@22671
   435
    val tfrees = mk_tfrees [];
wenzelm@20303
   436
    val idx = Proofterm.maxidx_proof prf ~1 + 1;
wenzelm@36620
   437
    val gen_term = Term_Subst.generalize_same (tfrees, frees) idx;
wenzelm@36620
   438
    val gen_typ = Term_Subst.generalizeT_same tfrees idx;
wenzelm@36620
   439
  in Same.commit (Proofterm.map_proof_terms_same gen_term gen_typ) prf end;
wenzelm@20303
   440
wenzelm@22671
   441
wenzelm@22671
   442
fun gen_export (mk_tfrees, frees) ths =
wenzelm@19911
   443
  let
wenzelm@22671
   444
    val tfrees = mk_tfrees (map Thm.full_prop_of ths);
wenzelm@22671
   445
    val maxidx = fold Thm.maxidx_thm ths ~1;
wenzelm@22671
   446
  in map (Thm.generalize (tfrees, frees) (maxidx + 1)) ths end;
wenzelm@19911
   447
wenzelm@22671
   448
fun exportT inner outer = gen_export (exportT_inst inner outer, []);
wenzelm@22671
   449
fun export inner outer = gen_export (export_inst inner outer);
wenzelm@19911
   450
wenzelm@21522
   451
fun export_morphism inner outer =
wenzelm@21522
   452
  let
wenzelm@21522
   453
    val fact = export inner outer;
wenzelm@21522
   454
    val term = singleton (export_terms inner outer);
wenzelm@21522
   455
    val typ = Logic.type_map term;
wenzelm@29605
   456
  in Morphism.morphism {binding = I, typ = typ, term = term, fact = fact} end;
wenzelm@19911
   457
wenzelm@19911
   458
wenzelm@24765
   459
wenzelm@19911
   460
(** import -- fix schematic type/term variables **)
wenzelm@19911
   461
wenzelm@19911
   462
fun importT_inst ts ctxt =
wenzelm@19911
   463
  let
wenzelm@19911
   464
    val tvars = rev (fold Term.add_tvars ts []);
wenzelm@19911
   465
    val (tfrees, ctxt') = invent_types (map #2 tvars) ctxt;
wenzelm@19911
   466
  in (tvars ~~ map TFree tfrees, ctxt') end;
wenzelm@19911
   467
wenzelm@19911
   468
fun import_inst is_open ts ctxt =
wenzelm@19911
   469
  let
wenzelm@26714
   470
    val ren = Name.clean #> (if is_open then I else Name.internal);
wenzelm@19911
   471
    val (instT, ctxt') = importT_inst ts ctxt;
wenzelm@31977
   472
    val vars = map (apsnd (Term_Subst.instantiateT instT)) (rev (fold Term.add_vars ts []));
wenzelm@20797
   473
    val (xs, ctxt'') = variant_fixes (map (ren o #1 o #1) vars) ctxt';
wenzelm@19911
   474
    val inst = vars ~~ map Free (xs ~~ map #2 vars);
wenzelm@19911
   475
  in ((instT, inst), ctxt'') end;
wenzelm@19911
   476
wenzelm@19911
   477
fun importT_terms ts ctxt =
wenzelm@19911
   478
  let val (instT, ctxt') = importT_inst ts ctxt
wenzelm@31977
   479
  in (map (Term_Subst.instantiate (instT, [])) ts, ctxt') end;
wenzelm@19911
   480
wenzelm@19911
   481
fun import_terms is_open ts ctxt =
wenzelm@19911
   482
  let val (inst, ctxt') = import_inst is_open ts ctxt
wenzelm@31977
   483
  in (map (Term_Subst.instantiate inst) ts, ctxt') end;
wenzelm@19911
   484
wenzelm@31794
   485
fun importT ths ctxt =
wenzelm@19911
   486
  let
wenzelm@42360
   487
    val thy = Proof_Context.theory_of ctxt;
wenzelm@19911
   488
    val (instT, ctxt') = importT_inst (map Thm.full_prop_of ths) ctxt;
wenzelm@32280
   489
    val insts' as (instT', _) = Thm.certify_inst thy (instT, []);
wenzelm@32280
   490
    val ths' = map (Thm.instantiate insts') ths;
wenzelm@32280
   491
  in ((instT', ths'), ctxt') end;
wenzelm@19911
   492
wenzelm@20303
   493
fun import_prf is_open prf ctxt =
wenzelm@20303
   494
  let
wenzelm@20303
   495
    val ts = rev (Proofterm.fold_proof_terms cons (cons o Logic.mk_type) prf []);
wenzelm@20303
   496
    val (insts, ctxt') = import_inst is_open ts ctxt;
wenzelm@20303
   497
  in (Proofterm.instantiate insts prf, ctxt') end;
wenzelm@20303
   498
wenzelm@31794
   499
fun import is_open ths ctxt =
wenzelm@19911
   500
  let
wenzelm@42360
   501
    val thy = Proof_Context.theory_of ctxt;
wenzelm@32280
   502
    val (insts, ctxt') = import_inst is_open (map Thm.full_prop_of ths) ctxt;
wenzelm@32280
   503
    val insts' = Thm.certify_inst thy insts;
wenzelm@32280
   504
    val ths' = map (Thm.instantiate insts') ths;
wenzelm@32280
   505
  in ((insts', ths'), ctxt') end;
wenzelm@19911
   506
wenzelm@19911
   507
wenzelm@19926
   508
(* import/export *)
wenzelm@19926
   509
wenzelm@21287
   510
fun gen_trade imp exp f ctxt ths =
wenzelm@20220
   511
  let val ((_, ths'), ctxt') = imp ths ctxt
wenzelm@21287
   512
  in exp ctxt' ctxt (f ctxt' ths') end;
wenzelm@19926
   513
wenzelm@31794
   514
val tradeT = gen_trade importT exportT;
wenzelm@31794
   515
val trade = gen_trade (import true) export;
wenzelm@19926
   516
wenzelm@19926
   517
wenzelm@20162
   518
(* focus on outermost parameters *)
wenzelm@20149
   519
wenzelm@20149
   520
fun forall_elim_prop t prop =
wenzelm@20579
   521
  Thm.beta_conversion false (Thm.capply (Thm.dest_arg prop) t)
wenzelm@20579
   522
  |> Thm.cprop_of |> Thm.dest_arg;
wenzelm@20149
   523
wenzelm@20149
   524
fun focus goal ctxt =
wenzelm@20149
   525
  let
wenzelm@20149
   526
    val cert = Thm.cterm_of (Thm.theory_of_cterm goal);
wenzelm@20149
   527
    val t = Thm.term_of goal;
wenzelm@20162
   528
    val ps = Term.variant_frees t (Term.strip_all_vars t);   (*as they are printed :-*)
wenzelm@20149
   529
    val (xs, Ts) = split_list ps;
wenzelm@20797
   530
    val (xs', ctxt') = variant_fixes xs ctxt;
wenzelm@20220
   531
    val ps' = ListPair.map (cert o Free) (xs', Ts);
wenzelm@20220
   532
    val goal' = fold forall_elim_prop ps' goal;
wenzelm@27119
   533
    val ctxt'' = ctxt' |> fold (declare_constraints o Thm.term_of) ps';
wenzelm@32199
   534
  in ((xs ~~ ps', goal'), ctxt'') end;
wenzelm@20149
   535
wenzelm@20303
   536
fun focus_subgoal i st =
wenzelm@20303
   537
  let
wenzelm@22691
   538
    val all_vars = Thm.fold_terms Term.add_vars st [];
wenzelm@20303
   539
    val no_binds = map (fn (xi, _) => (xi, NONE)) all_vars;
wenzelm@20303
   540
  in
wenzelm@30756
   541
    fold bind_term no_binds #>
wenzelm@20303
   542
    fold (declare_constraints o Var) all_vars #>
wenzelm@20303
   543
    focus (Thm.cprem_of st i)
wenzelm@20303
   544
  end;
wenzelm@20303
   545
wenzelm@20303
   546
wenzelm@19911
   547
wenzelm@19911
   548
(** implicit polymorphism **)
wenzelm@19899
   549
wenzelm@19899
   550
(* warn_extra_tfrees *)
wenzelm@19899
   551
wenzelm@19899
   552
fun warn_extra_tfrees ctxt1 ctxt2 =
wenzelm@19899
   553
  let
wenzelm@19911
   554
    fun occs_typ a = Term.exists_subtype (fn TFree (b, _) => a = b | _ => false);
wenzelm@20162
   555
    fun occs_free a x =
wenzelm@20162
   556
      (case def_type ctxt1 false (x, ~1) of
wenzelm@20162
   557
        SOME T => if occs_typ a T then I else cons (a, x)
wenzelm@20162
   558
      | NONE => cons (a, x));
wenzelm@19899
   559
wenzelm@20162
   560
    val occs1 = type_occs_of ctxt1;
wenzelm@20162
   561
    val occs2 = type_occs_of ctxt2;
wenzelm@19911
   562
    val extras = Symtab.fold (fn (a, xs) =>
wenzelm@19911
   563
      if Symtab.defined occs1 a then I else fold (occs_free a) xs) occs2 [];
wenzelm@19899
   564
    val tfrees = map #1 extras |> sort_distinct string_ord;
wenzelm@19899
   565
    val frees = map #2 extras |> sort_distinct string_ord;
wenzelm@19899
   566
  in
wenzelm@38831
   567
    if null extras orelse not (Context_Position.is_visible ctxt2) then ()
wenzelm@19899
   568
    else warning ("Introduced fixed type variable(s): " ^ commas tfrees ^ " in " ^
wenzelm@19899
   569
      space_implode " or " (map quote frees))
wenzelm@19899
   570
  end;
wenzelm@19899
   571
wenzelm@19899
   572
wenzelm@20149
   573
(* polymorphic terms *)
wenzelm@19899
   574
wenzelm@24694
   575
fun polymorphic_types ctxt ts =
wenzelm@20003
   576
  let
wenzelm@20003
   577
    val ctxt' = fold declare_term ts ctxt;
wenzelm@20162
   578
    val occs = type_occs_of ctxt;
wenzelm@20162
   579
    val occs' = type_occs_of ctxt';
wenzelm@20162
   580
    val types = Symtab.fold (fn (a, _) => if Symtab.defined occs a then I else cons a) occs' [];
wenzelm@24765
   581
    val idx = maxidx_of ctxt' + 1;
wenzelm@24694
   582
    val Ts' = (fold o fold_types o fold_atyps)
wenzelm@24694
   583
      (fn T as TFree _ =>
wenzelm@31977
   584
          (case Term_Subst.generalizeT types idx T of TVar v => insert (op =) v | _ => I)
wenzelm@24694
   585
        | _ => I) ts [];
wenzelm@31977
   586
    val ts' = map (Term_Subst.generalize (types, []) idx) ts;
wenzelm@24694
   587
  in (rev Ts', ts') end;
wenzelm@24694
   588
wenzelm@24694
   589
fun polymorphic ctxt ts = snd (polymorphic_types ctxt ts);
wenzelm@20003
   590
wenzelm@19899
   591
end;