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