src/Pure/variable.ML
author wenzelm
Thu Oct 16 22:44:34 2008 +0200 (2008-10-16)
changeset 28625 d51a14105e53
parent 27280 2a38802d3649
child 28965 1de908189869
permissions -rw-r--r--
maintain sort occurrences of declared terms;
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@24765
    16
  val maxidx_of: Proof.context -> int
wenzelm@28625
    17
  val sorts_of: Proof.context -> sort list
wenzelm@20303
    18
  val constraints_of: Proof.context -> typ Vartab.table * sort Vartab.table
wenzelm@20303
    19
  val is_declared: Proof.context -> string -> bool
wenzelm@20303
    20
  val is_fixed: Proof.context -> string -> bool
wenzelm@20303
    21
  val newly_fixed: Proof.context -> Proof.context -> string -> bool
wenzelm@21571
    22
  val add_fixed: Proof.context -> term -> (string * typ) list -> (string * typ) list
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@20303
    32
  val thm_context: thm -> Proof.context
wenzelm@20303
    33
  val variant_frees: Proof.context -> term list -> (string * 'a) list -> (string * 'a) list
wenzelm@20303
    34
  val add_binds: (indexname * term option) list -> 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@22601
    55
  val importT_thms: thm list -> Proof.context -> (ctyp list * thm list) * Proof.context
wenzelm@20303
    56
  val import_prf: bool -> Proofterm.proof -> Proof.context -> Proofterm.proof * Proof.context
wenzelm@22568
    57
  val import_thms: bool -> thm list -> Proof.context ->
wenzelm@20303
    58
    ((ctyp list * 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@20303
    61
  val focus: cterm -> Proof.context -> (cterm list * cterm) * Proof.context
wenzelm@20303
    62
  val focus_subgoal: int -> thm -> Proof.context -> (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@28625
    81
  sorts: sort OrdList.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@19899
    90
structure Data = ProofDataFun
wenzelm@19899
    91
(
wenzelm@19899
    92
  type T = data;
wenzelm@19899
    93
  fun init thy =
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@19899
   159
wenzelm@19899
   160
wenzelm@19899
   161
(** declarations **)
wenzelm@19899
   162
wenzelm@19899
   163
(* default sorts and types *)
wenzelm@19899
   164
wenzelm@20162
   165
fun default_type ctxt x = Vartab.lookup (#1 (constraints_of ctxt)) (x, ~1);
wenzelm@19899
   166
wenzelm@19899
   167
fun def_type ctxt pattern xi =
wenzelm@20162
   168
  let val {binds, constraints = (types, _), ...} = rep_data ctxt in
wenzelm@19899
   169
    (case Vartab.lookup types xi of
wenzelm@19899
   170
      NONE =>
wenzelm@19899
   171
        if pattern then NONE
wenzelm@19899
   172
        else Vartab.lookup binds xi |> Option.map (TypeInfer.polymorphicT o #1)
wenzelm@19899
   173
    | some => some)
wenzelm@19899
   174
  end;
wenzelm@19899
   175
wenzelm@20162
   176
val def_sort = Vartab.lookup o #2 o constraints_of;
wenzelm@20162
   177
wenzelm@20162
   178
wenzelm@20162
   179
(* names *)
wenzelm@20162
   180
wenzelm@24765
   181
fun declare_type_names t =
wenzelm@24765
   182
  map_names (fold_types (fold_atyps (fn TFree (a, _) => Name.declare a | _ => I)) t) #>
wenzelm@24765
   183
  map_maxidx (fold_types Term.maxidx_typ t);
wenzelm@20162
   184
wenzelm@20162
   185
fun declare_names t =
wenzelm@20162
   186
  declare_type_names t #>
wenzelm@24765
   187
  map_names (fold_aterms (fn Free (x, _) => Name.declare x | _ => I) t) #>
wenzelm@24765
   188
  map_maxidx (Term.maxidx_term t);
wenzelm@20162
   189
wenzelm@20162
   190
wenzelm@20162
   191
(* type occurrences *)
wenzelm@20162
   192
wenzelm@24719
   193
fun decl_type_occsT T = fold_atyps (fn TFree (a, _) => Symtab.default (a, []) | _ => I) T;
wenzelm@24719
   194
wenzelm@22671
   195
val decl_type_occs = fold_term_types
wenzelm@20162
   196
  (fn Free (x, _) => fold_atyps (fn TFree (a, _) => Symtab.insert_list (op =) (a, x) | _ => I)
wenzelm@24719
   197
    | _ => decl_type_occsT);
wenzelm@19899
   198
wenzelm@24719
   199
val declare_type_occsT = map_type_occs o fold_types decl_type_occsT;
wenzelm@22671
   200
val declare_type_occs = map_type_occs o decl_type_occs;
wenzelm@22671
   201
wenzelm@19899
   202
wenzelm@20162
   203
(* constraints *)
wenzelm@19899
   204
wenzelm@21355
   205
fun constrain_tvar (xi, S) =
wenzelm@21355
   206
  if S = dummyS then Vartab.delete_safe xi else Vartab.update (xi, S);
wenzelm@21355
   207
wenzelm@20162
   208
fun declare_constraints t = map_constraints (fn (types, sorts) =>
wenzelm@20162
   209
  let
wenzelm@20162
   210
    val types' = fold_aterms
wenzelm@20162
   211
      (fn Free (x, T) => Vartab.update ((x, ~1), T)
wenzelm@20162
   212
        | Var v => Vartab.update v
wenzelm@20162
   213
        | _ => I) t types;
wenzelm@20162
   214
    val sorts' = fold_types (fold_atyps
wenzelm@21355
   215
      (fn TFree (x, S) => constrain_tvar ((x, ~1), S)
wenzelm@21355
   216
        | TVar v => constrain_tvar v
wenzelm@20162
   217
        | _ => I)) t sorts;
wenzelm@20162
   218
  in (types', sorts') end)
wenzelm@24719
   219
  #> declare_type_occsT t
wenzelm@22711
   220
  #> declare_type_names t;
wenzelm@19899
   221
wenzelm@20162
   222
wenzelm@20162
   223
(* common declarations *)
wenzelm@20162
   224
wenzelm@20162
   225
fun declare_internal t =
wenzelm@20162
   226
  declare_names t #>
wenzelm@28625
   227
  declare_type_occs t #>
wenzelm@28625
   228
  map_sorts (Sorts.insert_term t);
wenzelm@19911
   229
wenzelm@20162
   230
fun declare_term t =
wenzelm@20162
   231
  declare_internal t #>
wenzelm@20162
   232
  declare_constraints t;
wenzelm@19899
   233
wenzelm@27280
   234
val declare_typ = declare_term o Logic.mk_type;
wenzelm@27280
   235
wenzelm@20303
   236
val declare_prf = Proofterm.fold_proof_terms declare_internal (declare_internal o Logic.mk_type);
wenzelm@20303
   237
wenzelm@22691
   238
val declare_thm = Thm.fold_terms declare_internal;
wenzelm@21522
   239
fun thm_context th = declare_thm th (ProofContext.init (Thm.theory_of_thm th));
wenzelm@19899
   240
wenzelm@19899
   241
wenzelm@19899
   242
(* renaming term/type frees *)
wenzelm@19899
   243
wenzelm@20162
   244
fun variant_frees ctxt ts frees =
wenzelm@19899
   245
  let
wenzelm@20162
   246
    val names = names_of (fold declare_names ts ctxt);
wenzelm@20084
   247
    val xs = fst (Name.variants (map #1 frees) names);
wenzelm@20084
   248
  in xs ~~ map snd frees end;
wenzelm@19899
   249
wenzelm@19899
   250
wenzelm@19899
   251
wenzelm@20303
   252
(** term bindings **)
wenzelm@20303
   253
wenzelm@20303
   254
fun add_bind (xi, NONE) = map_binds (Vartab.delete_safe xi)
wenzelm@20303
   255
  | add_bind ((x, i), SOME t) =
wenzelm@20303
   256
      let
wenzelm@25051
   257
        val u = Term.close_schematic_term t;
wenzelm@25051
   258
        val U = Term.fastype_of u;
wenzelm@25051
   259
      in declare_term u #> map_binds (Vartab.update ((x, i), (U, u))) end;
wenzelm@20303
   260
wenzelm@20303
   261
val add_binds = fold add_bind;
wenzelm@20303
   262
wenzelm@20303
   263
fun expand_binds ctxt =
wenzelm@20303
   264
  let
wenzelm@20303
   265
    val binds = binds_of ctxt;
wenzelm@21799
   266
    val get = fn Var (xi, _) => Vartab.lookup binds xi | _ => NONE;
wenzelm@21799
   267
  in Envir.beta_norm o Envir.expand_term get end;
wenzelm@20303
   268
wenzelm@20303
   269
wenzelm@20303
   270
wenzelm@25325
   271
(** consts **)
wenzelm@25316
   272
wenzelm@25325
   273
val lookup_const = Symtab.lookup o #consts o rep_data;
wenzelm@25325
   274
val is_const = is_some oo lookup_const;
wenzelm@25316
   275
wenzelm@25325
   276
val declare_fixed = map_consts o Symtab.delete_safe;
wenzelm@25325
   277
val declare_const = map_consts o Symtab.update;
wenzelm@25316
   278
wenzelm@25316
   279
wenzelm@25316
   280
wenzelm@19911
   281
(** fixes **)
wenzelm@19911
   282
wenzelm@20084
   283
local
wenzelm@20084
   284
wenzelm@19911
   285
fun no_dups [] = ()
wenzelm@19911
   286
  | no_dups dups = error ("Duplicate fixed variable(s): " ^ commas_quote dups);
wenzelm@19911
   287
wenzelm@20102
   288
fun new_fixes names' xs xs' =
wenzelm@20102
   289
  map_names (K names') #>
wenzelm@25316
   290
  fold declare_fixed xs #>
wenzelm@20102
   291
  map_fixes (fn fixes => (rev (xs ~~ xs') @ fixes)) #>
wenzelm@20162
   292
  fold (declare_constraints o Syntax.free) xs' #>
wenzelm@20084
   293
  pair xs';
wenzelm@20084
   294
wenzelm@20084
   295
in
wenzelm@20084
   296
wenzelm@19911
   297
fun add_fixes xs ctxt =
wenzelm@19911
   298
  let
wenzelm@19911
   299
    val _ =
wenzelm@20084
   300
      (case filter (can Name.dest_skolem) xs of [] => ()
wenzelm@19911
   301
      | bads => error ("Illegal internal Skolem constant(s): " ^ commas_quote bads));
wenzelm@20084
   302
    val _ = no_dups (duplicates (op =) xs);
wenzelm@20084
   303
    val (ys, zs) = split_list (fixes_of ctxt);
wenzelm@20102
   304
    val names = names_of ctxt;
wenzelm@20084
   305
    val (xs', names') =
wenzelm@20149
   306
      if is_body ctxt then Name.variants xs names |>> map Name.skolem
wenzelm@20084
   307
      else (no_dups (xs inter_string ys); no_dups (xs inter_string zs);
wenzelm@20084
   308
        (xs, fold Name.declare xs names));
wenzelm@20102
   309
  in ctxt |> new_fixes names' xs xs' end;
wenzelm@19911
   310
wenzelm@20797
   311
fun variant_fixes raw_xs ctxt =
wenzelm@20084
   312
  let
wenzelm@20102
   313
    val names = names_of ctxt;
wenzelm@26714
   314
    val xs = map (fn x => Name.clean x |> can Name.dest_internal x ? Name.internal) raw_xs;
wenzelm@26714
   315
    val (xs', names') = Name.variants xs names |>> (is_body ctxt ? map Name.skolem);
wenzelm@20102
   316
  in ctxt |> new_fixes names' xs xs' end;
wenzelm@20084
   317
wenzelm@20084
   318
end;
wenzelm@19911
   319
wenzelm@20251
   320
wenzelm@20251
   321
fun add_fixes_direct xs ctxt = ctxt
wenzelm@20251
   322
  |> set_body false
wenzelm@20251
   323
  |> (snd o add_fixes xs)
wenzelm@20251
   324
  |> restore_body ctxt;
wenzelm@20251
   325
wenzelm@20251
   326
fun fix_frees t ctxt = ctxt
wenzelm@20251
   327
  |> add_fixes_direct
wenzelm@20251
   328
      (rev (fold_aterms (fn Free (x, _) =>
wenzelm@21369
   329
        if is_fixed ctxt x then I else insert (op =) x | _ => I) t []));
wenzelm@21369
   330
wenzelm@21369
   331
fun auto_fixes t ctxt =
wenzelm@21369
   332
  (if is_body ctxt then ctxt else fix_frees t ctxt)
wenzelm@20251
   333
  |> declare_term t;
wenzelm@20251
   334
wenzelm@19911
   335
fun invent_types Ss ctxt =
wenzelm@19911
   336
  let
wenzelm@24848
   337
    val tfrees = Name.invents (names_of ctxt) Name.aT (length Ss) ~~ Ss;
wenzelm@20162
   338
    val ctxt' = fold (declare_constraints o Logic.mk_type o TFree) tfrees ctxt;
wenzelm@19911
   339
  in (tfrees, ctxt') end;
wenzelm@19911
   340
wenzelm@19911
   341
wenzelm@19911
   342
wenzelm@22671
   343
(** export -- generalize type/term variables (beware of closure sizes) **)
wenzelm@19911
   344
wenzelm@19911
   345
fun export_inst inner outer =
wenzelm@19911
   346
  let
wenzelm@20162
   347
    val declared_outer = is_declared outer;
wenzelm@19911
   348
    val fixes_inner = fixes_of inner;
wenzelm@19911
   349
    val fixes_outer = fixes_of outer;
wenzelm@19911
   350
wenzelm@19911
   351
    val gen_fixes = map #2 (Library.take (length fixes_inner - length fixes_outer, fixes_inner));
wenzelm@20162
   352
    val still_fixed = not o member (op =) gen_fixes;
wenzelm@22671
   353
wenzelm@22671
   354
    val type_occs_inner = type_occs_of inner;
wenzelm@22671
   355
    fun gen_fixesT ts =
wenzelm@19911
   356
      Symtab.fold (fn (a, xs) =>
wenzelm@20162
   357
        if declared_outer a orelse exists still_fixed xs
wenzelm@22671
   358
        then I else cons a) (fold decl_type_occs ts type_occs_inner) [];
wenzelm@19911
   359
  in (gen_fixesT, gen_fixes) end;
wenzelm@19911
   360
wenzelm@19911
   361
fun exportT_inst inner outer = #1 (export_inst inner outer);
wenzelm@19911
   362
wenzelm@22671
   363
fun exportT_terms inner outer =
wenzelm@22671
   364
  let val mk_tfrees = exportT_inst inner outer in
wenzelm@22671
   365
    fn ts => ts |> map
wenzelm@22671
   366
      (TermSubst.generalize (mk_tfrees ts, [])
wenzelm@22671
   367
        (fold (Term.fold_types Term.maxidx_typ) ts ~1 + 1))
wenzelm@22671
   368
  end;
wenzelm@19911
   369
wenzelm@22671
   370
fun export_terms inner outer =
wenzelm@22671
   371
  let val (mk_tfrees, tfrees) = export_inst inner outer in
wenzelm@22671
   372
    fn ts => ts |> map
wenzelm@22671
   373
      (TermSubst.generalize (mk_tfrees ts, tfrees)
wenzelm@22671
   374
        (fold Term.maxidx_term ts ~1 + 1))
wenzelm@22671
   375
  end;
wenzelm@19911
   376
wenzelm@20303
   377
fun export_prf inner outer prf =
wenzelm@20303
   378
  let
wenzelm@22671
   379
    val (mk_tfrees, frees) = export_inst (declare_prf prf inner) outer;
wenzelm@22671
   380
    val tfrees = mk_tfrees [];
wenzelm@20303
   381
    val idx = Proofterm.maxidx_proof prf ~1 + 1;
wenzelm@22671
   382
    val gen_term = TermSubst.generalize_option (tfrees, frees) idx;
wenzelm@22671
   383
    val gen_typ = TermSubst.generalizeT_option tfrees idx;
wenzelm@20303
   384
  in Proofterm.map_proof_terms_option gen_term gen_typ prf end;
wenzelm@20303
   385
wenzelm@22671
   386
wenzelm@22671
   387
fun gen_export (mk_tfrees, frees) ths =
wenzelm@19911
   388
  let
wenzelm@22671
   389
    val tfrees = mk_tfrees (map Thm.full_prop_of ths);
wenzelm@22671
   390
    val maxidx = fold Thm.maxidx_thm ths ~1;
wenzelm@22671
   391
  in map (Thm.generalize (tfrees, frees) (maxidx + 1)) ths end;
wenzelm@19911
   392
wenzelm@22671
   393
fun exportT inner outer = gen_export (exportT_inst inner outer, []);
wenzelm@22671
   394
fun export inner outer = gen_export (export_inst inner outer);
wenzelm@19911
   395
wenzelm@21522
   396
fun export_morphism inner outer =
wenzelm@21522
   397
  let
wenzelm@21522
   398
    val fact = export inner outer;
wenzelm@21522
   399
    val term = singleton (export_terms inner outer);
wenzelm@21522
   400
    val typ = Logic.type_map term;
wenzelm@21522
   401
  in Morphism.morphism {name = I, var = I, typ = typ, term = term, fact = fact} end;
wenzelm@19911
   402
wenzelm@19911
   403
wenzelm@24765
   404
wenzelm@19911
   405
(** import -- fix schematic type/term variables **)
wenzelm@19911
   406
wenzelm@19911
   407
fun importT_inst ts ctxt =
wenzelm@19911
   408
  let
wenzelm@19911
   409
    val tvars = rev (fold Term.add_tvars ts []);
wenzelm@19911
   410
    val (tfrees, ctxt') = invent_types (map #2 tvars) ctxt;
wenzelm@19911
   411
  in (tvars ~~ map TFree tfrees, ctxt') end;
wenzelm@19911
   412
wenzelm@19911
   413
fun import_inst is_open ts ctxt =
wenzelm@19911
   414
  let
wenzelm@26714
   415
    val ren = Name.clean #> (if is_open then I else Name.internal);
wenzelm@19911
   416
    val (instT, ctxt') = importT_inst ts ctxt;
wenzelm@20509
   417
    val vars = map (apsnd (TermSubst.instantiateT instT)) (rev (fold Term.add_vars ts []));
wenzelm@20797
   418
    val (xs, ctxt'') = variant_fixes (map (ren o #1 o #1) vars) ctxt';
wenzelm@19911
   419
    val inst = vars ~~ map Free (xs ~~ map #2 vars);
wenzelm@19911
   420
  in ((instT, inst), ctxt'') end;
wenzelm@19911
   421
wenzelm@19911
   422
fun importT_terms ts ctxt =
wenzelm@19911
   423
  let val (instT, ctxt') = importT_inst ts ctxt
wenzelm@20509
   424
  in (map (TermSubst.instantiate (instT, [])) ts, ctxt') end;
wenzelm@19911
   425
wenzelm@19911
   426
fun import_terms is_open ts ctxt =
wenzelm@19911
   427
  let val (inst, ctxt') = import_inst is_open ts ctxt
wenzelm@20509
   428
  in (map (TermSubst.instantiate inst) ts, ctxt') end;
wenzelm@19911
   429
wenzelm@22601
   430
fun importT_thms ths ctxt =
wenzelm@19911
   431
  let
wenzelm@21522
   432
    val thy = ProofContext.theory_of ctxt;
wenzelm@19911
   433
    val certT = Thm.ctyp_of thy;
wenzelm@19911
   434
    val (instT, ctxt') = importT_inst (map Thm.full_prop_of ths) ctxt;
wenzelm@19911
   435
    val instT' = map (fn (v, T) => (certT (TVar v), certT T)) instT;
wenzelm@19911
   436
    val ths' = map (Thm.instantiate (instT', [])) ths;
wenzelm@20220
   437
  in ((map #2 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@22568
   445
fun import_thms is_open ths ctxt =
wenzelm@19911
   446
  let
wenzelm@21522
   447
    val thy = ProofContext.theory_of ctxt;
wenzelm@19911
   448
    val cert = Thm.cterm_of thy;
wenzelm@19911
   449
    val certT = Thm.ctyp_of thy;
wenzelm@19911
   450
    val ((instT, inst), ctxt') = import_inst is_open (map Thm.full_prop_of ths) ctxt;
wenzelm@19911
   451
    val instT' = map (fn (v, T) => (certT (TVar v), certT T)) instT;
wenzelm@19911
   452
    val inst' = map (fn (v, t) => (cert (Var v), cert t)) inst;
wenzelm@19911
   453
    val ths' = map (Thm.instantiate (instT', inst')) ths;
wenzelm@20220
   454
  in (((map #2 instT', map #2 inst'), ths'), ctxt') end;
wenzelm@19911
   455
wenzelm@19911
   456
wenzelm@19926
   457
(* import/export *)
wenzelm@19926
   458
wenzelm@21287
   459
fun gen_trade imp exp f ctxt ths =
wenzelm@20220
   460
  let val ((_, ths'), ctxt') = imp ths ctxt
wenzelm@21287
   461
  in exp ctxt' ctxt (f ctxt' ths') end;
wenzelm@19926
   462
wenzelm@22601
   463
val tradeT = gen_trade importT_thms exportT;
wenzelm@22568
   464
val trade = gen_trade (import_thms true) export;
wenzelm@19926
   465
wenzelm@19926
   466
wenzelm@20162
   467
(* focus on outermost parameters *)
wenzelm@20149
   468
wenzelm@20149
   469
fun forall_elim_prop t prop =
wenzelm@20579
   470
  Thm.beta_conversion false (Thm.capply (Thm.dest_arg prop) t)
wenzelm@20579
   471
  |> Thm.cprop_of |> Thm.dest_arg;
wenzelm@20149
   472
wenzelm@20149
   473
fun focus goal ctxt =
wenzelm@20149
   474
  let
wenzelm@20149
   475
    val cert = Thm.cterm_of (Thm.theory_of_cterm goal);
wenzelm@20149
   476
    val t = Thm.term_of goal;
wenzelm@20162
   477
    val ps = Term.variant_frees t (Term.strip_all_vars t);   (*as they are printed :-*)
wenzelm@20149
   478
    val (xs, Ts) = split_list ps;
wenzelm@20797
   479
    val (xs', ctxt') = variant_fixes xs ctxt;
wenzelm@20220
   480
    val ps' = ListPair.map (cert o Free) (xs', Ts);
wenzelm@20220
   481
    val goal' = fold forall_elim_prop ps' goal;
wenzelm@27119
   482
    val ctxt'' = ctxt' |> fold (declare_constraints o Thm.term_of) ps';
wenzelm@27119
   483
  in ((ps', goal'), ctxt'') end;
wenzelm@20149
   484
wenzelm@20303
   485
fun focus_subgoal i st =
wenzelm@20303
   486
  let
wenzelm@22691
   487
    val all_vars = Thm.fold_terms Term.add_vars st [];
wenzelm@20303
   488
    val no_binds = map (fn (xi, _) => (xi, NONE)) all_vars;
wenzelm@20303
   489
  in
wenzelm@20303
   490
    add_binds no_binds #>
wenzelm@20303
   491
    fold (declare_constraints o Var) all_vars #>
wenzelm@20303
   492
    focus (Thm.cprem_of st i)
wenzelm@20303
   493
  end;
wenzelm@20303
   494
wenzelm@20303
   495
wenzelm@19911
   496
wenzelm@19911
   497
(** implicit polymorphism **)
wenzelm@19899
   498
wenzelm@19899
   499
(* warn_extra_tfrees *)
wenzelm@19899
   500
wenzelm@19899
   501
fun warn_extra_tfrees ctxt1 ctxt2 =
wenzelm@19899
   502
  let
wenzelm@19911
   503
    fun occs_typ a = Term.exists_subtype (fn TFree (b, _) => a = b | _ => false);
wenzelm@20162
   504
    fun occs_free a x =
wenzelm@20162
   505
      (case def_type ctxt1 false (x, ~1) of
wenzelm@20162
   506
        SOME T => if occs_typ a T then I else cons (a, x)
wenzelm@20162
   507
      | NONE => cons (a, x));
wenzelm@19899
   508
wenzelm@20162
   509
    val occs1 = type_occs_of ctxt1;
wenzelm@20162
   510
    val occs2 = type_occs_of ctxt2;
wenzelm@19911
   511
    val extras = Symtab.fold (fn (a, xs) =>
wenzelm@19911
   512
      if Symtab.defined occs1 a then I else fold (occs_free a) xs) occs2 [];
wenzelm@19899
   513
    val tfrees = map #1 extras |> sort_distinct string_ord;
wenzelm@19899
   514
    val frees = map #2 extras |> sort_distinct string_ord;
wenzelm@19899
   515
  in
wenzelm@19899
   516
    if null extras then ()
wenzelm@19899
   517
    else warning ("Introduced fixed type variable(s): " ^ commas tfrees ^ " in " ^
wenzelm@19899
   518
      space_implode " or " (map quote frees))
wenzelm@19899
   519
  end;
wenzelm@19899
   520
wenzelm@19899
   521
wenzelm@20149
   522
(* polymorphic terms *)
wenzelm@19899
   523
wenzelm@24694
   524
fun polymorphic_types ctxt ts =
wenzelm@20003
   525
  let
wenzelm@20003
   526
    val ctxt' = fold declare_term ts ctxt;
wenzelm@20162
   527
    val occs = type_occs_of ctxt;
wenzelm@20162
   528
    val occs' = type_occs_of ctxt';
wenzelm@20162
   529
    val types = Symtab.fold (fn (a, _) => if Symtab.defined occs a then I else cons a) occs' [];
wenzelm@24765
   530
    val idx = maxidx_of ctxt' + 1;
wenzelm@24694
   531
    val Ts' = (fold o fold_types o fold_atyps)
wenzelm@24694
   532
      (fn T as TFree _ =>
wenzelm@24694
   533
          (case TermSubst.generalizeT types idx T of TVar v => insert (op =) v | _ => I)
wenzelm@24694
   534
        | _ => I) ts [];
wenzelm@24694
   535
    val ts' = map (TermSubst.generalize (types, []) idx) ts;
wenzelm@24694
   536
  in (rev Ts', ts') end;
wenzelm@24694
   537
wenzelm@24694
   538
fun polymorphic ctxt ts = snd (polymorphic_types ctxt ts);
wenzelm@20003
   539
wenzelm@19899
   540
end;