src/Pure/variable.ML
author wenzelm
Thu Jun 09 20:22:22 2011 +0200 (2011-06-09)
changeset 43329 84472e198515
parent 43326 47cf4bc789aa
child 43790 9bd8d4addd6e
permissions -rw-r--r--
tuned signature: Name.invent and Name.invent_names;
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@42488
    84
val empty_fixes: fixes = Name_Space.empty_table "fixed variable";
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@19899
   147
fun rep_data ctxt = Data.get ctxt |> (fn Data args => args);
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@42494
   168
val check_name = Long_Name.base_name o Name_Space.full_name Name_Space.default_naming;
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@21355
   216
fun constrain_tvar (xi, S) =
wenzelm@21355
   217
  if S = dummyS then Vartab.delete_safe xi else Vartab.update (xi, S);
wenzelm@21355
   218
wenzelm@20162
   219
fun declare_constraints t = map_constraints (fn (types, sorts) =>
wenzelm@20162
   220
  let
wenzelm@20162
   221
    val types' = fold_aterms
wenzelm@20162
   222
      (fn Free (x, T) => Vartab.update ((x, ~1), T)
wenzelm@20162
   223
        | Var v => Vartab.update v
wenzelm@20162
   224
        | _ => I) t types;
wenzelm@20162
   225
    val sorts' = fold_types (fold_atyps
wenzelm@21355
   226
      (fn TFree (x, S) => constrain_tvar ((x, ~1), S)
wenzelm@21355
   227
        | TVar v => constrain_tvar v
wenzelm@20162
   228
        | _ => I)) t sorts;
wenzelm@20162
   229
  in (types', sorts') end)
wenzelm@24719
   230
  #> declare_type_occsT t
wenzelm@22711
   231
  #> declare_type_names t;
wenzelm@19899
   232
wenzelm@20162
   233
wenzelm@20162
   234
(* common declarations *)
wenzelm@20162
   235
wenzelm@20162
   236
fun declare_internal t =
wenzelm@20162
   237
  declare_names t #>
wenzelm@28625
   238
  declare_type_occs t #>
wenzelm@28625
   239
  map_sorts (Sorts.insert_term t);
wenzelm@19911
   240
wenzelm@20162
   241
fun declare_term t =
wenzelm@20162
   242
  declare_internal t #>
wenzelm@20162
   243
  declare_constraints t;
wenzelm@19899
   244
wenzelm@27280
   245
val declare_typ = declare_term o Logic.mk_type;
wenzelm@27280
   246
wenzelm@20303
   247
val declare_prf = Proofterm.fold_proof_terms declare_internal (declare_internal o Logic.mk_type);
wenzelm@20303
   248
wenzelm@22691
   249
val declare_thm = Thm.fold_terms declare_internal;
wenzelm@42360
   250
fun global_thm_context th = declare_thm th (Proof_Context.init_global (Thm.theory_of_thm th));
wenzelm@19899
   251
wenzelm@19899
   252
wenzelm@19899
   253
(* renaming term/type frees *)
wenzelm@19899
   254
wenzelm@20162
   255
fun variant_frees ctxt ts frees =
wenzelm@19899
   256
  let
wenzelm@20162
   257
    val names = names_of (fold declare_names ts ctxt);
wenzelm@43326
   258
    val xs = fst (fold_map Name.variant (map #1 frees) names);
wenzelm@20084
   259
  in xs ~~ map snd frees end;
wenzelm@19899
   260
wenzelm@19899
   261
wenzelm@19899
   262
wenzelm@20303
   263
(** term bindings **)
wenzelm@20303
   264
wenzelm@30756
   265
fun bind_term (xi, NONE) = map_binds (Vartab.delete_safe xi)
wenzelm@30756
   266
  | bind_term ((x, i), SOME t) =
wenzelm@20303
   267
      let
wenzelm@25051
   268
        val u = Term.close_schematic_term t;
wenzelm@25051
   269
        val U = Term.fastype_of u;
wenzelm@25051
   270
      in declare_term u #> map_binds (Vartab.update ((x, i), (U, u))) end;
wenzelm@20303
   271
wenzelm@20303
   272
fun expand_binds ctxt =
wenzelm@20303
   273
  let
wenzelm@20303
   274
    val binds = binds_of ctxt;
wenzelm@21799
   275
    val get = fn Var (xi, _) => Vartab.lookup binds xi | _ => NONE;
wenzelm@21799
   276
  in Envir.beta_norm o Envir.expand_term get end;
wenzelm@20303
   277
wenzelm@20303
   278
wenzelm@20303
   279
wenzelm@25325
   280
(** consts **)
wenzelm@25316
   281
wenzelm@25325
   282
val lookup_const = Symtab.lookup o #consts o rep_data;
wenzelm@25325
   283
val is_const = is_some oo lookup_const;
wenzelm@25316
   284
wenzelm@25325
   285
val declare_fixed = map_consts o Symtab.delete_safe;
wenzelm@25325
   286
val declare_const = map_consts o Symtab.update;
wenzelm@25316
   287
wenzelm@25316
   288
wenzelm@25316
   289
wenzelm@19911
   290
(** fixes **)
wenzelm@19911
   291
wenzelm@42488
   292
(* specialized name space *)
wenzelm@42488
   293
wenzelm@42493
   294
fun is_fixed ctxt x = can (Name_Space.the_entry (fixes_space 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@42493
   297
val fixed_ord = Name_Space.entry_ord o fixes_space;
wenzelm@42493
   298
val intern_fixed = Name_Space.intern o fixes_space;
wenzelm@42493
   299
val markup_fixed = Name_Space.markup 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@42488
   310
fun dest_fixes ctxt =
wenzelm@42488
   311
  let val (space, tab) = fixes_of ctxt
wenzelm@42488
   312
  in sort (Name_Space.entry_ord space o pairself #2) (map swap (Symtab.dest tab)) end;
wenzelm@42488
   313
wenzelm@42488
   314
wenzelm@42482
   315
(* collect variables *)
wenzelm@42482
   316
wenzelm@42482
   317
fun add_free_names ctxt =
wenzelm@42482
   318
  fold_aterms (fn Free (x, _) => not (is_fixed ctxt x) ? insert (op =) x | _ => I);
wenzelm@42482
   319
wenzelm@42482
   320
fun add_frees ctxt =
wenzelm@42482
   321
  fold_aterms (fn Free (x, T) => not (is_fixed ctxt x) ? insert (op =) (x, T) | _ => I);
wenzelm@42482
   322
wenzelm@42482
   323
fun add_fixed_names ctxt =
wenzelm@42482
   324
  fold_aterms (fn Free (x, _) => is_fixed ctxt x ? insert (op =) x | _ => I);
wenzelm@42482
   325
wenzelm@42482
   326
fun add_fixed ctxt =
wenzelm@42482
   327
  fold_aterms (fn Free (x, T) => is_fixed ctxt x ? insert (op =) (x, T) | _ => I);
wenzelm@42482
   328
wenzelm@42482
   329
wenzelm@42482
   330
(* declarations *)
wenzelm@42482
   331
wenzelm@20084
   332
local
wenzelm@20084
   333
wenzelm@42488
   334
fun err_dups dups =
wenzelm@42488
   335
  error ("Duplicate fixed variable(s): " ^ commas (map Binding.print dups));
wenzelm@19911
   336
wenzelm@42488
   337
fun new_fixed ((x, x'), pos) ctxt =
wenzelm@42488
   338
  if is_some (lookup_fixed ctxt x') then err_dups [Binding.make (x, pos)]
wenzelm@42488
   339
  else
wenzelm@42488
   340
    ctxt
wenzelm@42488
   341
    |> map_fixes
wenzelm@42488
   342
      (Name_Space.define ctxt true Name_Space.default_naming (Binding.make (x', pos), x) #> snd #>>
wenzelm@42488
   343
        Name_Space.alias Name_Space.default_naming (Binding.make (x, pos)) x')
wenzelm@42488
   344
    |> declare_fixed x
wenzelm@42488
   345
    |> declare_constraints (Syntax.free x');
wenzelm@42488
   346
wenzelm@42488
   347
fun new_fixes names' xs xs' ps =
wenzelm@20102
   348
  map_names (K names') #>
wenzelm@42488
   349
  fold new_fixed ((xs ~~ xs') ~~ ps) #>
wenzelm@20084
   350
  pair xs';
wenzelm@20084
   351
wenzelm@20084
   352
in
wenzelm@20084
   353
wenzelm@42488
   354
fun add_fixes_binding bs ctxt =
wenzelm@19911
   355
  let
wenzelm@19911
   356
    val _ =
wenzelm@42488
   357
      (case filter (can Name.dest_skolem o Binding.name_of) bs of
wenzelm@42488
   358
        [] => ()
wenzelm@42488
   359
      | bads => error ("Illegal internal Skolem constant(s): " ^ commas (map Binding.print bads)));
wenzelm@42488
   360
    val _ =
wenzelm@42488
   361
      (case duplicates (op = o pairself Binding.name_of) bs of
wenzelm@42488
   362
        [] => ()
wenzelm@42488
   363
      | dups => err_dups dups);
wenzelm@42488
   364
wenzelm@42494
   365
    val xs = map check_name bs;
wenzelm@20102
   366
    val names = names_of ctxt;
wenzelm@20084
   367
    val (xs', names') =
wenzelm@43326
   368
      if is_body ctxt then fold_map Name.variant xs names |>> map Name.skolem
wenzelm@42488
   369
      else (xs, fold Name.declare xs names);
wenzelm@42488
   370
  in ctxt |> new_fixes names' xs xs' (map Binding.pos_of bs) end;
wenzelm@19911
   371
wenzelm@20797
   372
fun variant_fixes raw_xs ctxt =
wenzelm@20084
   373
  let
wenzelm@20102
   374
    val names = names_of ctxt;
wenzelm@26714
   375
    val xs = map (fn x => Name.clean x |> can Name.dest_internal x ? Name.internal) raw_xs;
wenzelm@43326
   376
    val (xs', names') = fold_map Name.variant xs names |>> (is_body ctxt ? map Name.skolem);
wenzelm@42488
   377
  in ctxt |> new_fixes names' xs xs' (replicate (length xs) Position.none) end;
wenzelm@20084
   378
wenzelm@20084
   379
end;
wenzelm@19911
   380
wenzelm@42488
   381
val add_fixes = add_fixes_binding o map Binding.name;
wenzelm@20251
   382
wenzelm@20251
   383
fun add_fixes_direct xs ctxt = ctxt
wenzelm@20251
   384
  |> set_body false
wenzelm@20251
   385
  |> (snd o add_fixes xs)
wenzelm@20251
   386
  |> restore_body ctxt;
wenzelm@20251
   387
wenzelm@42482
   388
fun auto_fixes t ctxt = ctxt
wenzelm@42482
   389
  |> not (is_body ctxt) ? add_fixes_direct (rev (add_free_names ctxt t []))
wenzelm@20251
   390
  |> declare_term t;
wenzelm@20251
   391
wenzelm@19911
   392
fun invent_types Ss ctxt =
wenzelm@19911
   393
  let
wenzelm@43329
   394
    val tfrees = Name.invent (names_of ctxt) Name.aT (length Ss) ~~ Ss;
wenzelm@20162
   395
    val ctxt' = fold (declare_constraints o Logic.mk_type o TFree) tfrees ctxt;
wenzelm@19911
   396
  in (tfrees, ctxt') end;
wenzelm@19911
   397
wenzelm@19911
   398
wenzelm@19911
   399
wenzelm@22671
   400
(** export -- generalize type/term variables (beware of closure sizes) **)
wenzelm@19911
   401
wenzelm@19911
   402
fun export_inst inner outer =
wenzelm@19911
   403
  let
wenzelm@20162
   404
    val declared_outer = is_declared outer;
wenzelm@19911
   405
wenzelm@42488
   406
    val gen_fixes =
wenzelm@42488
   407
      Symtab.fold (fn (y, _) => not (is_fixed outer y) ? cons y)
wenzelm@42488
   408
        (#2 (fixes_of inner)) [];
wenzelm@20162
   409
    val still_fixed = not o member (op =) gen_fixes;
wenzelm@22671
   410
wenzelm@22671
   411
    val type_occs_inner = type_occs_of inner;
wenzelm@22671
   412
    fun gen_fixesT ts =
wenzelm@19911
   413
      Symtab.fold (fn (a, xs) =>
wenzelm@20162
   414
        if declared_outer a orelse exists still_fixed xs
wenzelm@22671
   415
        then I else cons a) (fold decl_type_occs ts type_occs_inner) [];
wenzelm@19911
   416
  in (gen_fixesT, gen_fixes) end;
wenzelm@19911
   417
wenzelm@19911
   418
fun exportT_inst inner outer = #1 (export_inst inner outer);
wenzelm@19911
   419
wenzelm@22671
   420
fun exportT_terms inner outer =
wenzelm@22671
   421
  let val mk_tfrees = exportT_inst inner outer in
wenzelm@22671
   422
    fn ts => ts |> map
wenzelm@31977
   423
      (Term_Subst.generalize (mk_tfrees ts, [])
wenzelm@22671
   424
        (fold (Term.fold_types Term.maxidx_typ) ts ~1 + 1))
wenzelm@22671
   425
  end;
wenzelm@19911
   426
wenzelm@22671
   427
fun export_terms inner outer =
wenzelm@22671
   428
  let val (mk_tfrees, tfrees) = export_inst inner outer in
wenzelm@22671
   429
    fn ts => ts |> map
wenzelm@31977
   430
      (Term_Subst.generalize (mk_tfrees ts, tfrees)
wenzelm@22671
   431
        (fold Term.maxidx_term ts ~1 + 1))
wenzelm@22671
   432
  end;
wenzelm@19911
   433
wenzelm@20303
   434
fun export_prf inner outer prf =
wenzelm@20303
   435
  let
wenzelm@22671
   436
    val (mk_tfrees, frees) = export_inst (declare_prf prf inner) outer;
wenzelm@22671
   437
    val tfrees = mk_tfrees [];
wenzelm@20303
   438
    val idx = Proofterm.maxidx_proof prf ~1 + 1;
wenzelm@36620
   439
    val gen_term = Term_Subst.generalize_same (tfrees, frees) idx;
wenzelm@36620
   440
    val gen_typ = Term_Subst.generalizeT_same tfrees idx;
wenzelm@36620
   441
  in Same.commit (Proofterm.map_proof_terms_same gen_term gen_typ) prf end;
wenzelm@20303
   442
wenzelm@22671
   443
wenzelm@22671
   444
fun gen_export (mk_tfrees, frees) ths =
wenzelm@19911
   445
  let
wenzelm@22671
   446
    val tfrees = mk_tfrees (map Thm.full_prop_of ths);
wenzelm@22671
   447
    val maxidx = fold Thm.maxidx_thm ths ~1;
wenzelm@22671
   448
  in map (Thm.generalize (tfrees, frees) (maxidx + 1)) ths end;
wenzelm@19911
   449
wenzelm@22671
   450
fun exportT inner outer = gen_export (exportT_inst inner outer, []);
wenzelm@22671
   451
fun export inner outer = gen_export (export_inst inner outer);
wenzelm@19911
   452
wenzelm@21522
   453
fun export_morphism inner outer =
wenzelm@21522
   454
  let
wenzelm@21522
   455
    val fact = export inner outer;
wenzelm@21522
   456
    val term = singleton (export_terms inner outer);
wenzelm@21522
   457
    val typ = Logic.type_map term;
wenzelm@29605
   458
  in Morphism.morphism {binding = I, typ = typ, term = term, fact = fact} end;
wenzelm@19911
   459
wenzelm@19911
   460
wenzelm@24765
   461
wenzelm@19911
   462
(** import -- fix schematic type/term variables **)
wenzelm@19911
   463
wenzelm@19911
   464
fun importT_inst ts ctxt =
wenzelm@19911
   465
  let
wenzelm@19911
   466
    val tvars = rev (fold Term.add_tvars ts []);
wenzelm@19911
   467
    val (tfrees, ctxt') = invent_types (map #2 tvars) ctxt;
wenzelm@19911
   468
  in (tvars ~~ map TFree tfrees, ctxt') end;
wenzelm@19911
   469
wenzelm@19911
   470
fun import_inst is_open ts ctxt =
wenzelm@19911
   471
  let
wenzelm@26714
   472
    val ren = Name.clean #> (if is_open then I else Name.internal);
wenzelm@19911
   473
    val (instT, ctxt') = importT_inst ts ctxt;
wenzelm@31977
   474
    val vars = map (apsnd (Term_Subst.instantiateT instT)) (rev (fold Term.add_vars ts []));
wenzelm@20797
   475
    val (xs, ctxt'') = variant_fixes (map (ren o #1 o #1) vars) ctxt';
wenzelm@19911
   476
    val inst = vars ~~ map Free (xs ~~ map #2 vars);
wenzelm@19911
   477
  in ((instT, inst), ctxt'') end;
wenzelm@19911
   478
wenzelm@19911
   479
fun importT_terms ts ctxt =
wenzelm@19911
   480
  let val (instT, ctxt') = importT_inst ts ctxt
wenzelm@31977
   481
  in (map (Term_Subst.instantiate (instT, [])) ts, ctxt') end;
wenzelm@19911
   482
wenzelm@19911
   483
fun import_terms is_open ts ctxt =
wenzelm@19911
   484
  let val (inst, ctxt') = import_inst is_open ts ctxt
wenzelm@31977
   485
  in (map (Term_Subst.instantiate inst) ts, ctxt') end;
wenzelm@19911
   486
wenzelm@31794
   487
fun importT ths ctxt =
wenzelm@19911
   488
  let
wenzelm@42360
   489
    val thy = Proof_Context.theory_of ctxt;
wenzelm@19911
   490
    val (instT, ctxt') = importT_inst (map Thm.full_prop_of ths) ctxt;
wenzelm@32280
   491
    val insts' as (instT', _) = Thm.certify_inst thy (instT, []);
wenzelm@32280
   492
    val ths' = map (Thm.instantiate insts') ths;
wenzelm@32280
   493
  in ((instT', ths'), ctxt') end;
wenzelm@19911
   494
wenzelm@20303
   495
fun import_prf is_open prf ctxt =
wenzelm@20303
   496
  let
wenzelm@20303
   497
    val ts = rev (Proofterm.fold_proof_terms cons (cons o Logic.mk_type) prf []);
wenzelm@20303
   498
    val (insts, ctxt') = import_inst is_open ts ctxt;
wenzelm@20303
   499
  in (Proofterm.instantiate insts prf, ctxt') end;
wenzelm@20303
   500
wenzelm@31794
   501
fun import is_open ths ctxt =
wenzelm@19911
   502
  let
wenzelm@42360
   503
    val thy = Proof_Context.theory_of ctxt;
wenzelm@32280
   504
    val (insts, ctxt') = import_inst is_open (map Thm.full_prop_of ths) ctxt;
wenzelm@32280
   505
    val insts' = Thm.certify_inst thy insts;
wenzelm@32280
   506
    val ths' = map (Thm.instantiate insts') ths;
wenzelm@32280
   507
  in ((insts', ths'), ctxt') end;
wenzelm@19911
   508
wenzelm@19911
   509
wenzelm@19926
   510
(* import/export *)
wenzelm@19926
   511
wenzelm@21287
   512
fun gen_trade imp exp f ctxt ths =
wenzelm@20220
   513
  let val ((_, ths'), ctxt') = imp ths ctxt
wenzelm@21287
   514
  in exp ctxt' ctxt (f ctxt' ths') end;
wenzelm@19926
   515
wenzelm@31794
   516
val tradeT = gen_trade importT exportT;
wenzelm@31794
   517
val trade = gen_trade (import true) export;
wenzelm@19926
   518
wenzelm@19926
   519
wenzelm@42495
   520
(* focus on outermost parameters: !!x y z. B *)
wenzelm@42495
   521
wenzelm@42495
   522
fun focus_params t ctxt =
wenzelm@42495
   523
  let
wenzelm@42495
   524
    val (xs, Ts) =
wenzelm@42495
   525
      split_list (Term.variant_frees t (Term.strip_all_vars t));  (*as they are printed :-*)
wenzelm@42495
   526
    val (xs', ctxt') = variant_fixes xs ctxt;
wenzelm@42495
   527
    val ps = xs' ~~ Ts;
wenzelm@42495
   528
    val ctxt'' = ctxt' |> fold (declare_constraints o Free) ps;
wenzelm@42495
   529
  in ((xs, ps), ctxt'') end;
wenzelm@42495
   530
wenzelm@42495
   531
fun focus t ctxt =
wenzelm@42495
   532
  let
wenzelm@42495
   533
    val ((xs, ps), ctxt') = focus_params t ctxt;
wenzelm@42495
   534
    val t' = Term.subst_bounds (rev (map Free ps), Term.strip_all_body t);
wenzelm@42495
   535
  in (((xs ~~ ps), t'), ctxt') end;
wenzelm@20149
   536
wenzelm@20149
   537
fun forall_elim_prop t prop =
wenzelm@20579
   538
  Thm.beta_conversion false (Thm.capply (Thm.dest_arg prop) t)
wenzelm@20579
   539
  |> Thm.cprop_of |> Thm.dest_arg;
wenzelm@20149
   540
wenzelm@42495
   541
fun focus_cterm goal ctxt =
wenzelm@20149
   542
  let
wenzelm@20149
   543
    val cert = Thm.cterm_of (Thm.theory_of_cterm goal);
wenzelm@42495
   544
    val ((xs, ps), ctxt') = focus_params (Thm.term_of goal) ctxt;
wenzelm@42495
   545
    val ps' = map (cert o Free) ps;
wenzelm@20220
   546
    val goal' = fold forall_elim_prop ps' goal;
wenzelm@42495
   547
  in ((xs ~~ ps', goal'), ctxt') end;
wenzelm@20149
   548
wenzelm@20303
   549
fun focus_subgoal i st =
wenzelm@20303
   550
  let
wenzelm@22691
   551
    val all_vars = Thm.fold_terms Term.add_vars st [];
wenzelm@20303
   552
    val no_binds = map (fn (xi, _) => (xi, NONE)) all_vars;
wenzelm@20303
   553
  in
wenzelm@30756
   554
    fold bind_term no_binds #>
wenzelm@20303
   555
    fold (declare_constraints o Var) all_vars #>
wenzelm@42495
   556
    focus_cterm (Thm.cprem_of st i)
wenzelm@20303
   557
  end;
wenzelm@20303
   558
wenzelm@20303
   559
wenzelm@19911
   560
wenzelm@19911
   561
(** implicit polymorphism **)
wenzelm@19899
   562
wenzelm@19899
   563
(* warn_extra_tfrees *)
wenzelm@19899
   564
wenzelm@19899
   565
fun warn_extra_tfrees ctxt1 ctxt2 =
wenzelm@19899
   566
  let
wenzelm@19911
   567
    fun occs_typ a = Term.exists_subtype (fn TFree (b, _) => a = b | _ => false);
wenzelm@20162
   568
    fun occs_free a x =
wenzelm@20162
   569
      (case def_type ctxt1 false (x, ~1) of
wenzelm@20162
   570
        SOME T => if occs_typ a T then I else cons (a, x)
wenzelm@20162
   571
      | NONE => cons (a, x));
wenzelm@19899
   572
wenzelm@20162
   573
    val occs1 = type_occs_of ctxt1;
wenzelm@20162
   574
    val occs2 = type_occs_of ctxt2;
wenzelm@19911
   575
    val extras = Symtab.fold (fn (a, xs) =>
wenzelm@19911
   576
      if Symtab.defined occs1 a then I else fold (occs_free a) xs) occs2 [];
wenzelm@19899
   577
    val tfrees = map #1 extras |> sort_distinct string_ord;
wenzelm@19899
   578
    val frees = map #2 extras |> sort_distinct string_ord;
wenzelm@19899
   579
  in
wenzelm@38831
   580
    if null extras orelse not (Context_Position.is_visible ctxt2) then ()
wenzelm@19899
   581
    else warning ("Introduced fixed type variable(s): " ^ commas tfrees ^ " in " ^
wenzelm@19899
   582
      space_implode " or " (map quote frees))
wenzelm@19899
   583
  end;
wenzelm@19899
   584
wenzelm@19899
   585
wenzelm@20149
   586
(* polymorphic terms *)
wenzelm@19899
   587
wenzelm@24694
   588
fun polymorphic_types ctxt ts =
wenzelm@20003
   589
  let
wenzelm@20003
   590
    val ctxt' = fold declare_term ts ctxt;
wenzelm@20162
   591
    val occs = type_occs_of ctxt;
wenzelm@20162
   592
    val occs' = type_occs_of ctxt';
wenzelm@20162
   593
    val types = Symtab.fold (fn (a, _) => if Symtab.defined occs a then I else cons a) occs' [];
wenzelm@24765
   594
    val idx = maxidx_of ctxt' + 1;
wenzelm@24694
   595
    val Ts' = (fold o fold_types o fold_atyps)
wenzelm@24694
   596
      (fn T as TFree _ =>
wenzelm@31977
   597
          (case Term_Subst.generalizeT types idx T of TVar v => insert (op =) v | _ => I)
wenzelm@24694
   598
        | _ => I) ts [];
wenzelm@31977
   599
    val ts' = map (Term_Subst.generalize (types, []) idx) ts;
wenzelm@24694
   600
  in (rev Ts', ts') end;
wenzelm@24694
   601
wenzelm@24694
   602
fun polymorphic ctxt ts = snd (polymorphic_types ctxt ts);
wenzelm@20003
   603
wenzelm@19899
   604
end;