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