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