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