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