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