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