src/Pure/variable.ML
author wenzelm
Tue Nov 14 00:16:30 2006 +0100 (2006-11-14)
changeset 21355 5c1b1ae737e1
parent 21287 a713ae348e8a
child 21369 6cca4865e388
permissions -rw-r--r--
declare_constraints: reset constraint on dummyS;
wenzelm@19899
     1
(*  Title:      Pure/variable.ML
wenzelm@19899
     2
    ID:         $Id$
wenzelm@19899
     3
    Author:     Makarius
wenzelm@19899
     4
wenzelm@19899
     5
Fixed type/term variables and polymorphic term abbreviations.
wenzelm@19899
     6
*)
wenzelm@19899
     7
wenzelm@19899
     8
signature VARIABLE =
wenzelm@19899
     9
sig
wenzelm@20303
    10
  val is_body: Proof.context -> bool
wenzelm@20303
    11
  val set_body: bool -> Proof.context -> Proof.context
wenzelm@20303
    12
  val restore_body: Proof.context -> Proof.context -> Proof.context
wenzelm@20303
    13
  val names_of: Proof.context -> Name.context
wenzelm@20303
    14
  val fixes_of: Proof.context -> (string * string) list
wenzelm@20303
    15
  val binds_of: Proof.context -> (typ * term) Vartab.table
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@20303
    18
  val is_fixed: Proof.context -> string -> bool
wenzelm@20303
    19
  val newly_fixed: Proof.context -> Proof.context -> string -> bool
wenzelm@20303
    20
  val default_type: Proof.context -> string -> typ option
wenzelm@20303
    21
  val def_type: Proof.context -> bool -> indexname -> typ option
wenzelm@20303
    22
  val def_sort: Proof.context -> indexname -> sort option
wenzelm@20303
    23
  val declare_constraints: term -> Proof.context -> Proof.context
wenzelm@20303
    24
  val declare_internal: term -> Proof.context -> Proof.context
wenzelm@20303
    25
  val declare_term: term -> 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@20303
    28
  val thm_context: thm -> Proof.context
wenzelm@20303
    29
  val variant_frees: Proof.context -> term list -> (string * 'a) list -> (string * 'a) list
wenzelm@19899
    30
  val hidden_polymorphism: term -> typ -> (indexname * sort) list
wenzelm@20303
    31
  val add_binds: (indexname * term option) list -> Proof.context -> Proof.context
wenzelm@20303
    32
  val expand_binds: Proof.context -> term -> term
wenzelm@20303
    33
  val add_fixes: string list -> Proof.context -> string list * Proof.context
wenzelm@20303
    34
  val add_fixes_direct: string list -> Proof.context -> Proof.context
wenzelm@20303
    35
  val fix_frees: term -> Proof.context -> Proof.context
wenzelm@20797
    36
  val variant_fixes: string list -> Proof.context -> string list * Proof.context
wenzelm@20303
    37
  val invent_types: sort list -> Proof.context -> (string * sort) list * Proof.context
wenzelm@20303
    38
  val export_inst: Proof.context -> Proof.context -> string list * string list
wenzelm@20303
    39
  val exportT_inst: Proof.context -> Proof.context -> string list
wenzelm@20303
    40
  val export_terms: Proof.context -> Proof.context -> term list -> term list
wenzelm@20303
    41
  val exportT_terms: Proof.context -> Proof.context -> term list -> term list
wenzelm@20303
    42
  val exportT: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@20303
    43
  val export_prf: Proof.context -> Proof.context -> Proofterm.proof -> Proofterm.proof
wenzelm@20303
    44
  val export: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@20303
    45
  val importT_inst: term list -> Proof.context -> ((indexname * sort) * typ) list * Proof.context
wenzelm@20303
    46
  val import_inst: bool -> term list -> Proof.context ->
wenzelm@20303
    47
    (((indexname * sort) * typ) list * ((indexname * typ) * term) list) * Proof.context
wenzelm@20303
    48
  val importT_terms: term list -> Proof.context -> term list * Proof.context
wenzelm@20303
    49
  val import_terms: bool -> term list -> Proof.context -> term list * Proof.context
wenzelm@20303
    50
  val importT: thm list -> Proof.context -> (ctyp list * thm list) * Proof.context
wenzelm@20303
    51
  val import_prf: bool -> Proofterm.proof -> Proof.context -> Proofterm.proof * Proof.context
wenzelm@20303
    52
  val import: bool -> thm list -> Proof.context ->
wenzelm@20303
    53
    ((ctyp list * cterm list) * thm list) * Proof.context
wenzelm@21287
    54
  val tradeT: (Proof.context -> thm list -> thm list) -> Proof.context -> thm list -> thm list
wenzelm@21287
    55
  val trade: (Proof.context -> thm list -> thm list) -> Proof.context -> thm list -> thm list
wenzelm@20303
    56
  val focus: cterm -> Proof.context -> (cterm list * cterm) * Proof.context
wenzelm@20303
    57
  val focus_subgoal: int -> thm -> Proof.context -> (cterm list * cterm) * Proof.context
wenzelm@20303
    58
  val warn_extra_tfrees: Proof.context -> Proof.context -> unit
wenzelm@20303
    59
  val polymorphic: Proof.context -> term list -> term list
wenzelm@19899
    60
end;
wenzelm@19899
    61
wenzelm@19899
    62
structure Variable: VARIABLE =
wenzelm@19899
    63
struct
wenzelm@19899
    64
wenzelm@19899
    65
(** local context data **)
wenzelm@19899
    66
wenzelm@19899
    67
datatype data = Data of
wenzelm@20102
    68
 {is_body: bool,                        (*inner body mode*)
wenzelm@20162
    69
  names: Name.context,                  (*type/term variable names*)
wenzelm@20162
    70
  fixes: (string * string) list,        (*term fixes -- extern/intern*)
wenzelm@20102
    71
  binds: (typ * term) Vartab.table,     (*term bindings*)
wenzelm@20162
    72
  type_occs: string list Symtab.table,  (*type variables -- possibly within term variables*)
wenzelm@20162
    73
  constraints:
wenzelm@20102
    74
    typ Vartab.table *                  (*type constraints*)
wenzelm@20162
    75
    sort Vartab.table};                 (*default sorts*)
wenzelm@19899
    76
wenzelm@20162
    77
fun make_data (is_body, names, fixes, binds, type_occs, constraints) =
wenzelm@20162
    78
  Data {is_body = is_body, names = names, fixes = fixes, binds = binds,
wenzelm@20162
    79
    type_occs = type_occs, constraints = constraints};
wenzelm@19899
    80
wenzelm@19899
    81
structure Data = ProofDataFun
wenzelm@19899
    82
(
wenzelm@19899
    83
  val name = "Pure/variable";
wenzelm@19899
    84
  type T = data;
wenzelm@19899
    85
  fun init thy =
wenzelm@20162
    86
    make_data (false, Name.context, [], Vartab.empty, Symtab.empty, (Vartab.empty, Vartab.empty));
wenzelm@19899
    87
  fun print _ _ = ();
wenzelm@19899
    88
);
wenzelm@19899
    89
wenzelm@19899
    90
val _ = Context.add_setup Data.init;
wenzelm@19899
    91
wenzelm@19899
    92
fun map_data f =
wenzelm@20162
    93
  Data.map (fn Data {is_body, names, fixes, binds, type_occs, constraints} =>
wenzelm@20162
    94
    make_data (f (is_body, names, fixes, binds, type_occs, constraints)));
wenzelm@19899
    95
wenzelm@20162
    96
fun map_names f = map_data (fn (is_body, names, fixes, binds, type_occs, constraints) =>
wenzelm@20162
    97
  (is_body, f names, fixes, binds, type_occs, constraints));
wenzelm@20162
    98
wenzelm@20162
    99
fun map_fixes f = map_data (fn (is_body, names, fixes, binds, type_occs, constraints) =>
wenzelm@20162
   100
  (is_body, names, f fixes, binds, type_occs, constraints));
wenzelm@19899
   101
wenzelm@20162
   102
fun map_binds f = map_data (fn (is_body, names, fixes, binds, type_occs, constraints) =>
wenzelm@20162
   103
  (is_body, names, fixes, f binds, type_occs, constraints));
wenzelm@19899
   104
wenzelm@20162
   105
fun map_type_occs f = map_data (fn (is_body, names, fixes, binds, type_occs, constraints) =>
wenzelm@20162
   106
  (is_body, names, fixes, binds, f type_occs, constraints));
wenzelm@20102
   107
wenzelm@20162
   108
fun map_constraints f = map_data (fn (is_body, names, fixes, binds, type_occs, constraints) =>
wenzelm@20162
   109
  (is_body, names, fixes, binds, type_occs, f constraints));
wenzelm@19899
   110
wenzelm@19899
   111
fun rep_data ctxt = Data.get ctxt |> (fn Data args => args);
wenzelm@19899
   112
wenzelm@19899
   113
val is_body = #is_body o rep_data;
wenzelm@20162
   114
fun set_body b = map_data (fn (_, names, fixes, binds, type_occs, constraints) =>
wenzelm@20162
   115
  (b, names, fixes, binds, type_occs, constraints));
wenzelm@19899
   116
fun restore_body ctxt = set_body (is_body ctxt);
wenzelm@19899
   117
wenzelm@20102
   118
val names_of = #names o rep_data;
wenzelm@20102
   119
val fixes_of = #fixes o rep_data;
wenzelm@19899
   120
val binds_of = #binds o rep_data;
wenzelm@20162
   121
val type_occs_of = #type_occs o rep_data;
wenzelm@20162
   122
val constraints_of = #constraints o rep_data;
wenzelm@19899
   123
wenzelm@20162
   124
val is_declared = Name.is_declared o names_of;
wenzelm@19899
   125
fun is_fixed ctxt x = exists (fn (_, y) => x = y) (fixes_of ctxt);
wenzelm@20149
   126
fun newly_fixed inner outer x = is_fixed inner x andalso not (is_fixed outer x);
wenzelm@19899
   127
wenzelm@19899
   128
wenzelm@19899
   129
wenzelm@19899
   130
(** declarations **)
wenzelm@19899
   131
wenzelm@19899
   132
(* default sorts and types *)
wenzelm@19899
   133
wenzelm@20162
   134
fun default_type ctxt x = Vartab.lookup (#1 (constraints_of ctxt)) (x, ~1);
wenzelm@19899
   135
wenzelm@19899
   136
fun def_type ctxt pattern xi =
wenzelm@20162
   137
  let val {binds, constraints = (types, _), ...} = rep_data ctxt in
wenzelm@19899
   138
    (case Vartab.lookup types xi of
wenzelm@19899
   139
      NONE =>
wenzelm@19899
   140
        if pattern then NONE
wenzelm@19899
   141
        else Vartab.lookup binds xi |> Option.map (TypeInfer.polymorphicT o #1)
wenzelm@19899
   142
    | some => some)
wenzelm@19899
   143
  end;
wenzelm@19899
   144
wenzelm@20162
   145
val def_sort = Vartab.lookup o #2 o constraints_of;
wenzelm@20162
   146
wenzelm@20162
   147
wenzelm@20162
   148
(* names *)
wenzelm@20162
   149
wenzelm@20162
   150
val declare_type_names = map_names o
wenzelm@20162
   151
  fold_types (fold_atyps (fn TFree (a, _) => Name.declare a | _ => I));
wenzelm@20162
   152
wenzelm@20162
   153
fun declare_names t =
wenzelm@20162
   154
  declare_type_names t #>
wenzelm@20162
   155
  map_names (fold_aterms (fn Free (x, _) => Name.declare x | _ => I) t);
wenzelm@20162
   156
wenzelm@20162
   157
wenzelm@20162
   158
(* type occurrences *)
wenzelm@20162
   159
wenzelm@20162
   160
val declare_type_occs = map_type_occs o fold_term_types
wenzelm@20162
   161
  (fn Free (x, _) => fold_atyps (fn TFree (a, _) => Symtab.insert_list (op =) (a, x) | _ => I)
wenzelm@20162
   162
    | _ => fold_atyps (fn TFree (a, _) => Symtab.default (a, []) | _ => I));
wenzelm@19899
   163
wenzelm@19899
   164
wenzelm@20162
   165
(* constraints *)
wenzelm@19899
   166
wenzelm@20162
   167
fun redeclare_skolems ctxt = ctxt |> map_constraints (apfst (fn types =>
wenzelm@20162
   168
  let
wenzelm@20162
   169
    fun decl (x, x') =
wenzelm@20162
   170
      (case default_type ctxt x' of
wenzelm@20162
   171
        SOME T => Vartab.update ((x, ~1), T)
wenzelm@20162
   172
      | NONE => I);
wenzelm@20162
   173
  in fold_rev decl (fixes_of ctxt) types end));
wenzelm@20084
   174
wenzelm@21355
   175
fun constrain_tvar (xi, S) =
wenzelm@21355
   176
  if S = dummyS then Vartab.delete_safe xi else Vartab.update (xi, S);
wenzelm@21355
   177
wenzelm@20162
   178
fun declare_constraints t = map_constraints (fn (types, sorts) =>
wenzelm@20162
   179
  let
wenzelm@20162
   180
    val types' = fold_aterms
wenzelm@20162
   181
      (fn Free (x, T) => Vartab.update ((x, ~1), T)
wenzelm@20162
   182
        | Var v => Vartab.update v
wenzelm@20162
   183
        | _ => I) t types;
wenzelm@20162
   184
    val sorts' = fold_types (fold_atyps
wenzelm@21355
   185
      (fn TFree (x, S) => constrain_tvar ((x, ~1), S)
wenzelm@21355
   186
        | TVar v => constrain_tvar v
wenzelm@20162
   187
        | _ => I)) t sorts;
wenzelm@20162
   188
  in (types', sorts') end)
wenzelm@20162
   189
  #> declare_type_names t
wenzelm@20162
   190
  #> redeclare_skolems;
wenzelm@19899
   191
wenzelm@20162
   192
wenzelm@20162
   193
(* common declarations *)
wenzelm@20162
   194
wenzelm@20162
   195
fun declare_internal t =
wenzelm@20162
   196
  declare_names t #>
wenzelm@20162
   197
  declare_type_occs t;
wenzelm@19911
   198
wenzelm@20162
   199
fun declare_term t =
wenzelm@20162
   200
  declare_internal t #>
wenzelm@20162
   201
  declare_constraints t;
wenzelm@19899
   202
wenzelm@20303
   203
val declare_prf = Proofterm.fold_proof_terms declare_internal (declare_internal o Logic.mk_type);
wenzelm@20303
   204
wenzelm@20797
   205
val declare_thm = Drule.fold_terms declare_internal;
wenzelm@20162
   206
fun thm_context th = declare_thm th (Context.init_proof (Thm.theory_of_thm th));
wenzelm@19899
   207
wenzelm@19899
   208
wenzelm@19899
   209
(* renaming term/type frees *)
wenzelm@19899
   210
wenzelm@20162
   211
fun variant_frees ctxt ts frees =
wenzelm@19899
   212
  let
wenzelm@20162
   213
    val names = names_of (fold declare_names ts ctxt);
wenzelm@20084
   214
    val xs = fst (Name.variants (map #1 frees) names);
wenzelm@20084
   215
  in xs ~~ map snd frees end;
wenzelm@19899
   216
wenzelm@19899
   217
wenzelm@19899
   218
wenzelm@20303
   219
(** term bindings **)
wenzelm@20303
   220
wenzelm@20303
   221
fun hidden_polymorphism t T =
wenzelm@20303
   222
  let
wenzelm@20303
   223
    val tvarsT = Term.add_tvarsT T [];
wenzelm@20303
   224
    val extra_tvars = Term.fold_types (Term.fold_atyps
wenzelm@20303
   225
      (fn TVar v => if member (op =) tvarsT v then I else insert (op =) v | _ => I)) t [];
wenzelm@20303
   226
  in extra_tvars end;
wenzelm@20303
   227
wenzelm@20303
   228
fun add_bind (xi, NONE) = map_binds (Vartab.delete_safe xi)
wenzelm@20303
   229
  | add_bind ((x, i), SOME t) =
wenzelm@20303
   230
      let
wenzelm@20303
   231
        val T = Term.fastype_of t;
wenzelm@20303
   232
        val t' =
wenzelm@20303
   233
          if null (hidden_polymorphism t T) then t
wenzelm@20303
   234
          else Var ((x ^ "_has_extra_type_vars_on_rhs", i), T);
wenzelm@20303
   235
      in declare_term t' #> map_binds (Vartab.update ((x, i), (T, t'))) end;
wenzelm@20303
   236
wenzelm@20303
   237
val add_binds = fold add_bind;
wenzelm@20303
   238
wenzelm@20303
   239
fun expand_binds ctxt =
wenzelm@20303
   240
  let
wenzelm@20303
   241
    val binds = binds_of ctxt;
wenzelm@20303
   242
    fun expand (t as Var (xi, T)) =
wenzelm@20303
   243
          (case Vartab.lookup binds xi of
wenzelm@20303
   244
            SOME u => Envir.expand_atom T u
wenzelm@20303
   245
          | NONE => t)
wenzelm@20303
   246
      | expand t = t;
wenzelm@20303
   247
  in Envir.beta_norm o Term.map_aterms expand end;
wenzelm@20303
   248
wenzelm@20303
   249
wenzelm@20303
   250
wenzelm@19911
   251
(** fixes **)
wenzelm@19911
   252
wenzelm@20084
   253
local
wenzelm@20084
   254
wenzelm@19911
   255
fun no_dups [] = ()
wenzelm@19911
   256
  | no_dups dups = error ("Duplicate fixed variable(s): " ^ commas_quote dups);
wenzelm@19911
   257
wenzelm@20102
   258
fun new_fixes names' xs xs' =
wenzelm@20102
   259
  map_names (K names') #>
wenzelm@20102
   260
  map_fixes (fn fixes => (rev (xs ~~ xs') @ fixes)) #>
wenzelm@20162
   261
  fold (declare_constraints o Syntax.free) xs' #>
wenzelm@20084
   262
  pair xs';
wenzelm@20084
   263
wenzelm@20084
   264
in
wenzelm@20084
   265
wenzelm@19911
   266
fun add_fixes xs ctxt =
wenzelm@19911
   267
  let
wenzelm@19911
   268
    val _ =
wenzelm@20084
   269
      (case filter (can Name.dest_skolem) xs of [] => ()
wenzelm@19911
   270
      | bads => error ("Illegal internal Skolem constant(s): " ^ commas_quote bads));
wenzelm@20084
   271
    val _ = no_dups (duplicates (op =) xs);
wenzelm@20084
   272
    val (ys, zs) = split_list (fixes_of ctxt);
wenzelm@20102
   273
    val names = names_of ctxt;
wenzelm@20084
   274
    val (xs', names') =
wenzelm@20149
   275
      if is_body ctxt then Name.variants xs names |>> map Name.skolem
wenzelm@20084
   276
      else (no_dups (xs inter_string ys); no_dups (xs inter_string zs);
wenzelm@20084
   277
        (xs, fold Name.declare xs names));
wenzelm@20102
   278
  in ctxt |> new_fixes names' xs xs' end;
wenzelm@19911
   279
wenzelm@20797
   280
fun variant_fixes raw_xs ctxt =
wenzelm@20084
   281
  let
wenzelm@20102
   282
    val names = names_of ctxt;
wenzelm@20149
   283
    val xs = map Name.clean raw_xs;
wenzelm@20149
   284
    val (xs', names') = Name.variants xs names |>> map Name.skolem;
wenzelm@20102
   285
  in ctxt |> new_fixes names' xs xs' end;
wenzelm@20084
   286
wenzelm@20084
   287
end;
wenzelm@19911
   288
wenzelm@20251
   289
wenzelm@20251
   290
fun add_fixes_direct xs ctxt = ctxt
wenzelm@20251
   291
  |> set_body false
wenzelm@20251
   292
  |> (snd o add_fixes xs)
wenzelm@20251
   293
  |> restore_body ctxt;
wenzelm@20251
   294
wenzelm@20251
   295
fun fix_frees t ctxt = ctxt
wenzelm@20251
   296
  |> add_fixes_direct
wenzelm@20251
   297
      (rev (fold_aterms (fn Free (x, _) =>
wenzelm@20251
   298
        if is_fixed ctxt x then I else insert (op =) x | _ => I) t []))
wenzelm@20251
   299
  |> declare_term t;
wenzelm@20251
   300
wenzelm@19911
   301
fun invent_types Ss ctxt =
wenzelm@19911
   302
  let
wenzelm@20102
   303
    val tfrees = Name.invents (names_of ctxt) "'a" (length Ss) ~~ Ss;
wenzelm@20162
   304
    val ctxt' = fold (declare_constraints o Logic.mk_type o TFree) tfrees ctxt;
wenzelm@19911
   305
  in (tfrees, ctxt') end;
wenzelm@19911
   306
wenzelm@19911
   307
wenzelm@19911
   308
wenzelm@19911
   309
(** export -- generalize type/term variables **)
wenzelm@19911
   310
wenzelm@19911
   311
fun export_inst inner outer =
wenzelm@19911
   312
  let
wenzelm@20162
   313
    val declared_outer = is_declared outer;
wenzelm@19911
   314
    val fixes_inner = fixes_of inner;
wenzelm@19911
   315
    val fixes_outer = fixes_of outer;
wenzelm@19911
   316
wenzelm@19911
   317
    val gen_fixes = map #2 (Library.take (length fixes_inner - length fixes_outer, fixes_inner));
wenzelm@20162
   318
    val still_fixed = not o member (op =) gen_fixes;
wenzelm@19911
   319
    val gen_fixesT =
wenzelm@19911
   320
      Symtab.fold (fn (a, xs) =>
wenzelm@20162
   321
        if declared_outer a orelse exists still_fixed xs
wenzelm@19911
   322
        then I else cons a) (type_occs_of inner) [];
wenzelm@19911
   323
  in (gen_fixesT, gen_fixes) end;
wenzelm@19911
   324
wenzelm@19911
   325
fun exportT_inst inner outer = #1 (export_inst inner outer);
wenzelm@19911
   326
wenzelm@19911
   327
fun exportT_terms inner outer ts =
wenzelm@20509
   328
  map (TermSubst.generalize (exportT_inst (fold declare_type_occs ts inner) outer, [])
wenzelm@19911
   329
    (fold (Term.fold_types Term.maxidx_typ) ts ~1 + 1)) ts;
wenzelm@19911
   330
wenzelm@19911
   331
fun export_terms inner outer ts =
wenzelm@20509
   332
  map (TermSubst.generalize (export_inst (fold declare_type_occs ts inner) outer)
wenzelm@19911
   333
    (fold Term.maxidx_term ts ~1 + 1)) ts;
wenzelm@19911
   334
wenzelm@20303
   335
fun export_prf inner outer prf =
wenzelm@20303
   336
  let
wenzelm@20303
   337
    val insts = export_inst (declare_prf prf inner) outer;
wenzelm@20303
   338
    val idx = Proofterm.maxidx_proof prf ~1 + 1;
wenzelm@20509
   339
    val gen_term = TermSubst.generalize_option insts idx;
wenzelm@20509
   340
    val gen_typ = TermSubst.generalizeT_option (#1 insts) idx;
wenzelm@20303
   341
  in Proofterm.map_proof_terms_option gen_term gen_typ prf end;
wenzelm@20303
   342
wenzelm@19911
   343
fun gen_export inst inner outer ths =
wenzelm@19911
   344
  let
wenzelm@20262
   345
    val inner' = fold (declare_type_occs o Thm.full_prop_of) ths inner;
wenzelm@20262
   346
  in map (Thm.generalize (inst inner' outer) (fold Thm.maxidx_thm ths ~1 + 1)) ths end;
wenzelm@19911
   347
wenzelm@19911
   348
val exportT = gen_export (rpair [] oo exportT_inst);
wenzelm@19911
   349
val export = gen_export export_inst;
wenzelm@19911
   350
wenzelm@19911
   351
wenzelm@19911
   352
wenzelm@19911
   353
(** import -- fix schematic type/term variables **)
wenzelm@19911
   354
wenzelm@19911
   355
fun importT_inst ts ctxt =
wenzelm@19911
   356
  let
wenzelm@19911
   357
    val tvars = rev (fold Term.add_tvars ts []);
wenzelm@19911
   358
    val (tfrees, ctxt') = invent_types (map #2 tvars) ctxt;
wenzelm@19911
   359
  in (tvars ~~ map TFree tfrees, ctxt') end;
wenzelm@19911
   360
wenzelm@19911
   361
fun import_inst is_open ts ctxt =
wenzelm@19911
   362
  let
wenzelm@20198
   363
    val ren = if is_open then I else Name.internal;
wenzelm@19911
   364
    val (instT, ctxt') = importT_inst ts ctxt;
wenzelm@20509
   365
    val vars = map (apsnd (TermSubst.instantiateT instT)) (rev (fold Term.add_vars ts []));
wenzelm@20797
   366
    val (xs, ctxt'') = variant_fixes (map (ren o #1 o #1) vars) ctxt';
wenzelm@19911
   367
    val inst = vars ~~ map Free (xs ~~ map #2 vars);
wenzelm@19911
   368
  in ((instT, inst), ctxt'') end;
wenzelm@19911
   369
wenzelm@19911
   370
fun importT_terms ts ctxt =
wenzelm@19911
   371
  let val (instT, ctxt') = importT_inst ts ctxt
wenzelm@20509
   372
  in (map (TermSubst.instantiate (instT, [])) ts, ctxt') end;
wenzelm@19911
   373
wenzelm@19911
   374
fun import_terms is_open ts ctxt =
wenzelm@19911
   375
  let val (inst, ctxt') = import_inst is_open ts ctxt
wenzelm@20509
   376
  in (map (TermSubst.instantiate inst) ts, ctxt') end;
wenzelm@19911
   377
wenzelm@19911
   378
fun importT ths ctxt =
wenzelm@19911
   379
  let
wenzelm@19911
   380
    val thy = Context.theory_of_proof ctxt;
wenzelm@19911
   381
    val certT = Thm.ctyp_of thy;
wenzelm@19911
   382
    val (instT, ctxt') = importT_inst (map Thm.full_prop_of ths) ctxt;
wenzelm@19911
   383
    val instT' = map (fn (v, T) => (certT (TVar v), certT T)) instT;
wenzelm@19911
   384
    val ths' = map (Thm.instantiate (instT', [])) ths;
wenzelm@20220
   385
  in ((map #2 instT', ths'), ctxt') end;
wenzelm@19911
   386
wenzelm@20303
   387
fun import_prf is_open prf ctxt =
wenzelm@20303
   388
  let
wenzelm@20303
   389
    val ts = rev (Proofterm.fold_proof_terms cons (cons o Logic.mk_type) prf []);
wenzelm@20303
   390
    val (insts, ctxt') = import_inst is_open ts ctxt;
wenzelm@20303
   391
  in (Proofterm.instantiate insts prf, ctxt') end;
wenzelm@20303
   392
wenzelm@19911
   393
fun import is_open ths ctxt =
wenzelm@19911
   394
  let
wenzelm@19911
   395
    val thy = Context.theory_of_proof ctxt;
wenzelm@19911
   396
    val cert = Thm.cterm_of thy;
wenzelm@19911
   397
    val certT = Thm.ctyp_of thy;
wenzelm@19911
   398
    val ((instT, inst), ctxt') = import_inst is_open (map Thm.full_prop_of ths) ctxt;
wenzelm@19911
   399
    val instT' = map (fn (v, T) => (certT (TVar v), certT T)) instT;
wenzelm@19911
   400
    val inst' = map (fn (v, t) => (cert (Var v), cert t)) inst;
wenzelm@19911
   401
    val ths' = map (Thm.instantiate (instT', inst')) ths;
wenzelm@20220
   402
  in (((map #2 instT', map #2 inst'), ths'), ctxt') end;
wenzelm@19911
   403
wenzelm@19911
   404
wenzelm@19926
   405
(* import/export *)
wenzelm@19926
   406
wenzelm@21287
   407
fun gen_trade imp exp f ctxt ths =
wenzelm@20220
   408
  let val ((_, ths'), ctxt') = imp ths ctxt
wenzelm@21287
   409
  in exp ctxt' ctxt (f ctxt' ths') end;
wenzelm@19926
   410
wenzelm@19926
   411
val tradeT = gen_trade importT exportT;
wenzelm@19926
   412
val trade = gen_trade (import true) export;
wenzelm@19926
   413
wenzelm@19926
   414
wenzelm@20162
   415
(* focus on outermost parameters *)
wenzelm@20149
   416
wenzelm@20149
   417
fun forall_elim_prop t prop =
wenzelm@20579
   418
  Thm.beta_conversion false (Thm.capply (Thm.dest_arg prop) t)
wenzelm@20579
   419
  |> Thm.cprop_of |> Thm.dest_arg;
wenzelm@20149
   420
wenzelm@20149
   421
fun focus goal ctxt =
wenzelm@20149
   422
  let
wenzelm@20149
   423
    val cert = Thm.cterm_of (Thm.theory_of_cterm goal);
wenzelm@20149
   424
    val t = Thm.term_of goal;
wenzelm@20162
   425
    val ps = Term.variant_frees t (Term.strip_all_vars t);   (*as they are printed :-*)
wenzelm@20149
   426
    val (xs, Ts) = split_list ps;
wenzelm@20797
   427
    val (xs', ctxt') = variant_fixes xs ctxt;
wenzelm@20220
   428
    val ps' = ListPair.map (cert o Free) (xs', Ts);
wenzelm@20220
   429
    val goal' = fold forall_elim_prop ps' goal;
wenzelm@20149
   430
  in ((ps', goal'), ctxt') end;
wenzelm@20149
   431
wenzelm@20303
   432
fun focus_subgoal i st =
wenzelm@20303
   433
  let
wenzelm@20303
   434
    val all_vars = Drule.fold_terms Term.add_vars st [];
wenzelm@20303
   435
    val no_binds = map (fn (xi, _) => (xi, NONE)) all_vars;
wenzelm@20303
   436
  in
wenzelm@20303
   437
    add_binds no_binds #>
wenzelm@20303
   438
    fold (declare_constraints o Var) all_vars #>
wenzelm@20303
   439
    focus (Thm.cprem_of st i)
wenzelm@20303
   440
  end;
wenzelm@20303
   441
wenzelm@20303
   442
wenzelm@19911
   443
wenzelm@19911
   444
(** implicit polymorphism **)
wenzelm@19899
   445
wenzelm@19899
   446
(* warn_extra_tfrees *)
wenzelm@19899
   447
wenzelm@19899
   448
fun warn_extra_tfrees ctxt1 ctxt2 =
wenzelm@19899
   449
  let
wenzelm@19911
   450
    fun occs_typ a = Term.exists_subtype (fn TFree (b, _) => a = b | _ => false);
wenzelm@20162
   451
    fun occs_free a x =
wenzelm@20162
   452
      (case def_type ctxt1 false (x, ~1) of
wenzelm@20162
   453
        SOME T => if occs_typ a T then I else cons (a, x)
wenzelm@20162
   454
      | NONE => cons (a, x));
wenzelm@19899
   455
wenzelm@20162
   456
    val occs1 = type_occs_of ctxt1;
wenzelm@20162
   457
    val occs2 = type_occs_of ctxt2;
wenzelm@19911
   458
    val extras = Symtab.fold (fn (a, xs) =>
wenzelm@19911
   459
      if Symtab.defined occs1 a then I else fold (occs_free a) xs) occs2 [];
wenzelm@19899
   460
    val tfrees = map #1 extras |> sort_distinct string_ord;
wenzelm@19899
   461
    val frees = map #2 extras |> sort_distinct string_ord;
wenzelm@19899
   462
  in
wenzelm@19899
   463
    if null extras then ()
wenzelm@19899
   464
    else warning ("Introduced fixed type variable(s): " ^ commas tfrees ^ " in " ^
wenzelm@19899
   465
      space_implode " or " (map quote frees))
wenzelm@19899
   466
  end;
wenzelm@19899
   467
wenzelm@19899
   468
wenzelm@20149
   469
(* polymorphic terms *)
wenzelm@19899
   470
wenzelm@19899
   471
fun polymorphic ctxt ts =
wenzelm@20003
   472
  let
wenzelm@20003
   473
    val ctxt' = fold declare_term ts ctxt;
wenzelm@20162
   474
    val occs = type_occs_of ctxt;
wenzelm@20162
   475
    val occs' = type_occs_of ctxt';
wenzelm@20162
   476
    val types = Symtab.fold (fn (a, _) => if Symtab.defined occs a then I else cons a) occs' [];
wenzelm@20003
   477
    val idx = fold (Term.fold_types Term.maxidx_typ) ts ~1 + 1;
wenzelm@20509
   478
  in map (TermSubst.generalize (types, []) idx) ts end;
wenzelm@20003
   479
wenzelm@19899
   480
end;