src/Pure/Isar/proof_context.ML
author wenzelm
Tue Oct 23 22:59:14 2001 +0200 (2001-10-23 ago)
changeset 11915 df030220a2a8
parent 11816 545aab7410ac
child 11918 dfdf0798d7b8
permissions -rw-r--r--
print fixed names as plain strings;
wenzelm@5819
     1
(*  Title:      Pure/Isar/proof_context.ML
wenzelm@5819
     2
    ID:         $Id$
wenzelm@5819
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@8807
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@5819
     5
wenzelm@5819
     6
Proof context information.
wenzelm@5819
     7
*)
wenzelm@5819
     8
wenzelm@5819
     9
signature PROOF_CONTEXT =
wenzelm@5819
    10
sig
wenzelm@5819
    11
  type context
wenzelm@9470
    12
  type exporter
wenzelm@5819
    13
  exception CONTEXT of string * context
wenzelm@5819
    14
  val theory_of: context -> theory
wenzelm@5819
    15
  val sign_of: context -> Sign.sg
wenzelm@7557
    16
  val prems_of: context -> thm list
wenzelm@5819
    17
  val print_proof_data: theory -> unit
wenzelm@5874
    18
  val init: theory -> context
wenzelm@9470
    19
  val assumptions: context -> (cterm list * exporter) list
wenzelm@8616
    20
  val fixed_names: context -> string list
wenzelm@5819
    21
  val read_typ: context -> string -> typ
wenzelm@9504
    22
  val read_typ_no_norm: context -> string -> typ
wenzelm@5819
    23
  val cert_typ: context -> typ -> typ
wenzelm@9504
    24
  val cert_typ_no_norm: context -> typ -> typ
wenzelm@10583
    25
  val get_skolem: context -> string -> string
wenzelm@9291
    26
  val intern_skolem: context -> term -> term
wenzelm@9133
    27
  val extern_skolem: context -> term -> term
wenzelm@5874
    28
  val read_termTs: context -> (string * typ) list -> term list * (indexname * typ) list
wenzelm@5819
    29
  val read_term: context -> string -> term
wenzelm@5819
    30
  val read_prop: context -> string -> term
wenzelm@10465
    31
  val read_terms: context -> string list -> term list
wenzelm@8096
    32
  val read_termT_pats: context -> (string * typ) list -> term list
wenzelm@8096
    33
  val read_term_pats: typ -> context -> string list -> term list
wenzelm@8096
    34
  val read_prop_pats: context -> string list -> term list
wenzelm@5819
    35
  val cert_term: context -> term -> term
wenzelm@5819
    36
  val cert_prop: context -> term -> term
wenzelm@8096
    37
  val cert_term_pats: typ -> context -> term list -> term list
wenzelm@8096
    38
  val cert_prop_pats: context -> term list -> term list
wenzelm@5819
    39
  val declare_term: term -> context -> context
wenzelm@5819
    40
  val declare_terms: term list -> context -> context
wenzelm@7925
    41
  val warn_extra_tfrees: context -> context -> context
wenzelm@8616
    42
  val generalizeT: context -> context -> typ -> typ
wenzelm@8616
    43
  val generalize: context -> context -> term -> term
wenzelm@9470
    44
  val find_free: term -> string -> term option
wenzelm@11816
    45
  val export_wrt: bool -> context -> context option -> thm -> thm Seq.seq
wenzelm@10810
    46
  val drop_schematic: indexname * term option -> indexname * term option
wenzelm@10810
    47
  val add_binds: (indexname * string option) list -> context -> context
wenzelm@10810
    48
  val add_binds_i: (indexname * term option) list -> context -> context
wenzelm@7925
    49
  val auto_bind_goal: term -> context -> context
wenzelm@7925
    50
  val auto_bind_facts: string -> term list -> context -> context
wenzelm@8616
    51
  val match_bind: bool -> (string list * string) list -> context -> context
wenzelm@8616
    52
  val match_bind_i: bool -> (term list * term) list -> context -> context
wenzelm@10465
    53
  val read_propp: context * (string * (string list * string list)) list list
wenzelm@10465
    54
    -> context * (term * (term list * term list)) list list
wenzelm@10465
    55
  val cert_propp: context * (term * (term list * term list)) list list
wenzelm@10465
    56
    -> context * (term * (term list * term list)) list list
wenzelm@10554
    57
  val read_propp_schematic: context * (string * (string list * string list)) list list
wenzelm@10554
    58
    -> context * (term * (term list * term list)) list list
wenzelm@10554
    59
  val cert_propp_schematic: context * (term * (term list * term list)) list list
wenzelm@10554
    60
    -> context * (term * (term list * term list)) list list
wenzelm@10465
    61
  val bind_propp: context * (string * (string list * string list)) list list
wenzelm@10465
    62
    -> context * (term list list * (context -> context))
wenzelm@10465
    63
  val bind_propp_i: context * (term * (term list * term list)) list list
wenzelm@10465
    64
    -> context * (term list list * (context -> context))
wenzelm@10554
    65
  val bind_propp_schematic: context * (string * (string list * string list)) list list
wenzelm@10554
    66
    -> context * (term list list * (context -> context))
wenzelm@10554
    67
  val bind_propp_schematic_i: context * (term * (term list * term list)) list list
wenzelm@10554
    68
    -> context * (term list list * (context -> context))
wenzelm@6091
    69
  val get_thm: context -> string -> thm
wenzelm@9566
    70
  val get_thm_closure: context -> string -> thm
wenzelm@6091
    71
  val get_thms: context -> string -> thm list
wenzelm@9566
    72
  val get_thms_closure: context -> string -> thm list
wenzelm@6091
    73
  val put_thm: string * thm -> context -> context
wenzelm@6091
    74
  val put_thms: string * thm list -> context -> context
wenzelm@6091
    75
  val put_thmss: (string * thm list) list -> context -> context
wenzelm@7606
    76
  val reset_thms: string -> context -> context
wenzelm@9196
    77
  val have_thmss:
wenzelm@9196
    78
    ((string * context attribute list) * (thm list * context attribute list) list) list ->
wenzelm@9196
    79
      context -> context * (string * thm list) list
wenzelm@9470
    80
  val assume: exporter
wenzelm@10465
    81
    -> ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@7270
    82
    -> context -> context * ((string * thm list) list * thm list)
wenzelm@9470
    83
  val assume_i: exporter
wenzelm@10465
    84
    -> ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@7270
    85
    -> context -> context * ((string * thm list) list * thm list)
wenzelm@8096
    86
  val read_vars: context * (string list * string option) -> context * (string list * typ option)
wenzelm@8096
    87
  val cert_vars: context * (string list * typ option) -> context * (string list * typ option)
wenzelm@7411
    88
  val fix: (string list * string option) list -> context -> context
wenzelm@7663
    89
  val fix_i: (string list * typ option) list -> context -> context
wenzelm@9291
    90
  val bind_skolem: context -> string list -> term -> term
wenzelm@11793
    91
  val get_case: context -> string -> string option list -> RuleCases.T
wenzelm@8373
    92
  val add_cases: (string * RuleCases.T) list -> context -> context
wenzelm@10830
    93
  val apply_case: RuleCases.T -> context -> context * ((indexname * term option) list * term list)
wenzelm@10810
    94
  val show_hyps: bool ref
wenzelm@10810
    95
  val pretty_thm: thm -> Pretty.T
wenzelm@10810
    96
  val verbose: bool ref
wenzelm@10810
    97
  val setmp_verbose: ('a -> 'b) -> 'a -> 'b
wenzelm@10810
    98
  val print_binds: context -> unit
wenzelm@10810
    99
  val print_thms: context -> unit
wenzelm@10810
   100
  val print_cases: context -> unit
wenzelm@10810
   101
  val prems_limit: int ref
wenzelm@10810
   102
  val pretty_prems: context -> Pretty.T list
wenzelm@10810
   103
  val pretty_context: context -> Pretty.T list
wenzelm@5819
   104
  val setup: (theory -> theory) list
wenzelm@5819
   105
end;
wenzelm@5819
   106
wenzelm@8151
   107
signature PRIVATE_PROOF_CONTEXT =
wenzelm@5819
   108
sig
wenzelm@5819
   109
  include PROOF_CONTEXT
wenzelm@5819
   110
  val init_data: Object.kind -> (theory -> Object.T) * (context -> Object.T -> unit)
wenzelm@5819
   111
    -> theory -> theory
wenzelm@5819
   112
  val print_data: Object.kind -> context -> unit
wenzelm@5819
   113
  val get_data: Object.kind -> (Object.T -> 'a) -> context -> 'a
wenzelm@5819
   114
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> context -> context
wenzelm@5819
   115
end;
wenzelm@5819
   116
wenzelm@8151
   117
structure ProofContext: PRIVATE_PROOF_CONTEXT =
wenzelm@5819
   118
struct
wenzelm@5819
   119
wenzelm@5819
   120
wenzelm@5819
   121
(** datatype context **)
wenzelm@5819
   122
wenzelm@11816
   123
type exporter = bool -> cterm list -> thm -> thm Seq.seq;
wenzelm@9470
   124
wenzelm@5819
   125
datatype context =
wenzelm@5819
   126
  Context of
wenzelm@6847
   127
   {thy: theory,                                                        (*current theory*)
wenzelm@6847
   128
    data: Object.T Symtab.table,                                        (*user data*)
wenzelm@5819
   129
    asms:
wenzelm@9470
   130
      ((cterm list * exporter) list *                                   (*assumes: A ==> _*)
wenzelm@6931
   131
        (string * thm list) list) *
wenzelm@6847
   132
      ((string * string) list * string list),                           (*fixes: !!x. _*)
wenzelm@7606
   133
    binds: (term * typ) option Vartab.table,                            (*term bindings*)
wenzelm@7606
   134
    thms: thm list option Symtab.table,                                 (*local thms*)
wenzelm@8426
   135
    cases: (string * RuleCases.T) list,                                 (*local contexts*)
wenzelm@5819
   136
    defs:
wenzelm@6847
   137
      typ Vartab.table *                                                (*type constraints*)
wenzelm@6847
   138
      sort Vartab.table *                                               (*default sorts*)
wenzelm@8616
   139
      (string list * term list Symtab.table)};                          (*used type variables*)
wenzelm@5819
   140
wenzelm@5819
   141
exception CONTEXT of string * context;
wenzelm@5819
   142
wenzelm@5819
   143
wenzelm@8373
   144
fun make_context (thy, data, asms, binds, thms, cases, defs) =
wenzelm@8373
   145
  Context {thy = thy, data = data, asms = asms, binds = binds, thms = thms,
wenzelm@8373
   146
    cases = cases, defs = defs};
wenzelm@5819
   147
wenzelm@8373
   148
fun map_context f (Context {thy, data, asms, binds, thms, cases, defs}) =
wenzelm@8373
   149
  make_context (f (thy, data, asms, binds, thms, cases, defs));
wenzelm@5819
   150
wenzelm@5819
   151
fun theory_of (Context {thy, ...}) = thy;
wenzelm@5819
   152
val sign_of = Theory.sign_of o theory_of;
wenzelm@5819
   153
wenzelm@7270
   154
fun prems_of (Context {asms = ((_, asms), _), ...}) = flat (map #2 asms);
wenzelm@7270
   155
wenzelm@5819
   156
wenzelm@5819
   157
wenzelm@5819
   158
(** user data **)
wenzelm@5819
   159
wenzelm@5819
   160
(* errors *)
wenzelm@5819
   161
wenzelm@5819
   162
fun of_theory thy = "\nof theory " ^ Sign.str_of_sg (Theory.sign_of thy);
wenzelm@5819
   163
wenzelm@5819
   164
fun err_inconsistent kinds =
wenzelm@5819
   165
  error ("Attempt to merge different versions of " ^ commas_quote kinds ^ " proof data");
wenzelm@5819
   166
wenzelm@5819
   167
fun err_dup_init thy kind =
wenzelm@5819
   168
  error ("Duplicate initialization of " ^ quote kind ^ " proof data" ^ of_theory thy);
wenzelm@5819
   169
wenzelm@5819
   170
fun err_undef ctxt kind =
wenzelm@5819
   171
  raise CONTEXT ("Tried to access undefined " ^ quote kind ^ " proof data", ctxt);
wenzelm@5819
   172
wenzelm@5819
   173
fun err_uninit ctxt kind =
wenzelm@5819
   174
  raise CONTEXT ("Tried to access uninitialized " ^ quote kind ^ " proof data" ^
wenzelm@5819
   175
    of_theory (theory_of ctxt), ctxt);
wenzelm@5819
   176
wenzelm@5819
   177
fun err_access ctxt kind =
wenzelm@5819
   178
  raise CONTEXT ("Unauthorized access to " ^ quote kind ^ " proof data" ^
wenzelm@5819
   179
    of_theory (theory_of ctxt), ctxt);
wenzelm@5819
   180
wenzelm@5819
   181
wenzelm@5819
   182
(* data kind 'Isar/proof_data' *)
wenzelm@5819
   183
wenzelm@5819
   184
structure ProofDataDataArgs =
wenzelm@5819
   185
struct
wenzelm@5819
   186
  val name = "Isar/proof_data";
wenzelm@5819
   187
  type T = (Object.kind * ((theory -> Object.T) * (context -> Object.T -> unit))) Symtab.table;
wenzelm@5819
   188
wenzelm@5819
   189
  val empty = Symtab.empty;
wenzelm@6550
   190
  val copy = I;
wenzelm@5819
   191
  val prep_ext = I;
wenzelm@5819
   192
  fun merge tabs = Symtab.merge (Object.eq_kind o pairself fst) tabs
wenzelm@5819
   193
    handle Symtab.DUPS kinds => err_inconsistent kinds;
wenzelm@5819
   194
  fun print _ tab = Pretty.writeln (Pretty.strs (map #1 (Symtab.dest tab)));
wenzelm@5819
   195
end;
wenzelm@5819
   196
wenzelm@5819
   197
structure ProofDataData = TheoryDataFun(ProofDataDataArgs);
wenzelm@5819
   198
val print_proof_data = ProofDataData.print;
wenzelm@5819
   199
wenzelm@5819
   200
wenzelm@5819
   201
(* init proof data *)
wenzelm@5819
   202
wenzelm@5819
   203
fun init_data kind meths thy =
wenzelm@5819
   204
  let
wenzelm@5819
   205
    val name = Object.name_of_kind kind;
wenzelm@5819
   206
    val tab = Symtab.update_new ((name, (kind, meths)), ProofDataData.get thy)
wenzelm@5819
   207
      handle Symtab.DUP _ => err_dup_init thy name;
wenzelm@5819
   208
  in thy |> ProofDataData.put tab end;
wenzelm@5819
   209
wenzelm@5819
   210
wenzelm@5819
   211
(* access data *)
wenzelm@5819
   212
wenzelm@5819
   213
fun lookup_data (ctxt as Context {data, ...}) kind =
wenzelm@5819
   214
  let
wenzelm@5819
   215
    val thy = theory_of ctxt;
wenzelm@5819
   216
    val name = Object.name_of_kind kind;
wenzelm@5819
   217
  in
wenzelm@5819
   218
    (case Symtab.lookup (ProofDataData.get thy, name) of
wenzelm@5819
   219
      Some (k, meths) =>
wenzelm@5819
   220
        if Object.eq_kind (kind, k) then
wenzelm@5819
   221
          (case Symtab.lookup (data, name) of
wenzelm@5819
   222
            Some x => (x, meths)
wenzelm@5819
   223
          | None => err_undef ctxt name)
wenzelm@5819
   224
        else err_access ctxt name
wenzelm@5819
   225
    | None => err_uninit ctxt name)
wenzelm@5819
   226
  end;
wenzelm@5819
   227
wenzelm@5819
   228
fun get_data kind f ctxt =
wenzelm@5819
   229
  let val (x, _) = lookup_data ctxt kind
wenzelm@5819
   230
  in f x handle Match => Object.kind_error kind end;
wenzelm@5819
   231
wenzelm@5819
   232
fun print_data kind ctxt =
wenzelm@5819
   233
  let val (x, (_, prt)) = lookup_data ctxt kind
wenzelm@5819
   234
  in prt ctxt x end;
wenzelm@5819
   235
wenzelm@5819
   236
fun put_data kind f x ctxt =
wenzelm@8373
   237
 (lookup_data ctxt kind;
wenzelm@8373
   238
  ctxt |> map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8373
   239
    (thy, Symtab.update ((Object.name_of_kind kind, f x), data), asms, binds, thms, cases, defs)));
wenzelm@5819
   240
wenzelm@5819
   241
wenzelm@5819
   242
(* init context *)
wenzelm@5819
   243
wenzelm@5874
   244
fun init thy =
wenzelm@5874
   245
  let val data = Symtab.map (fn (_, (f, _)) => f thy) (ProofDataData.get thy) in
wenzelm@8426
   246
    make_context (thy, data, (([], []), ([], [])), Vartab.empty, Symtab.empty, [],
wenzelm@8616
   247
      (Vartab.empty, Vartab.empty, ([], Symtab.empty)))
wenzelm@5819
   248
  end;
wenzelm@5819
   249
wenzelm@5819
   250
wenzelm@8616
   251
(* get assumptions *)
wenzelm@8616
   252
wenzelm@8616
   253
fun assumptions (Context {asms = ((asms, _), _), ...}) = asms;
wenzelm@8616
   254
fun fixed_names (Context {asms = (_, (fixes, _)), ...}) = map #2 fixes;
wenzelm@8616
   255
fun used_table (Context {defs = (_, _, (_, tab)), ...}) = tab;
wenzelm@8616
   256
wenzelm@8616
   257
wenzelm@8096
   258
wenzelm@7663
   259
(** default sorts and types **)
wenzelm@7663
   260
wenzelm@7670
   261
fun def_sort (Context {defs = (_, sorts, _), ...}) xi = Vartab.lookup (sorts, xi);
wenzelm@7663
   262
wenzelm@7670
   263
fun def_type (Context {binds, defs = (types, _, _), ...}) is_pat xi =
wenzelm@7663
   264
  (case Vartab.lookup (types, xi) of
wenzelm@7663
   265
    None =>
wenzelm@8616
   266
      if is_pat then None else
wenzelm@8616
   267
        (case Vartab.lookup (binds, xi) of
wenzelm@8616
   268
          Some (Some (_, T)) => Some (TypeInfer.polymorphicT T)
wenzelm@8616
   269
        | _ => None)
wenzelm@7663
   270
  | some => some);
wenzelm@7663
   271
wenzelm@7663
   272
wenzelm@5819
   273
wenzelm@5819
   274
(** prepare types **)
wenzelm@5819
   275
wenzelm@9504
   276
local
wenzelm@9504
   277
wenzelm@9504
   278
fun read_typ_aux read ctxt s =
wenzelm@9504
   279
  transform_error (read (sign_of ctxt, def_sort ctxt)) s
wenzelm@7663
   280
    handle ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt);
wenzelm@5819
   281
wenzelm@10554
   282
fun cert_typ_aux cert ctxt raw_T =
wenzelm@10554
   283
  cert (sign_of ctxt) raw_T
wenzelm@10554
   284
    handle TYPE (msg, _, _) => raise CONTEXT (msg, ctxt);
wenzelm@9504
   285
wenzelm@9504
   286
in
wenzelm@9504
   287
wenzelm@9504
   288
val read_typ         = read_typ_aux Sign.read_typ;
wenzelm@9504
   289
val read_typ_no_norm = read_typ_aux Sign.read_typ_no_norm;
wenzelm@9504
   290
val cert_typ         = cert_typ_aux Sign.certify_typ;
wenzelm@9504
   291
val cert_typ_no_norm = cert_typ_aux Sign.certify_typ_no_norm;
wenzelm@9504
   292
wenzelm@9504
   293
end;
wenzelm@9504
   294
wenzelm@5819
   295
wenzelm@7679
   296
(* internalize Skolem constants *)
wenzelm@7679
   297
wenzelm@9133
   298
fun fixes_of (Context {asms = (_, (fixes, _)), ...}) = fixes;
wenzelm@10583
   299
fun lookup_skolem ctxt x = assoc (fixes_of ctxt, x);
wenzelm@10583
   300
fun get_skolem ctxt x = if_none (lookup_skolem ctxt x) x;
wenzelm@7679
   301
wenzelm@9325
   302
fun no_skolem no_internal ctxt x =
wenzelm@9291
   303
  if can Syntax.dest_skolem x then
wenzelm@7679
   304
    raise CONTEXT ("Illegal reference to internal Skolem constant: " ^ quote x, ctxt)
wenzelm@9325
   305
  else if no_internal andalso can Syntax.dest_internal x then
wenzelm@9291
   306
    raise CONTEXT ("Illegal reference to internal variable: " ^ quote x, ctxt)
wenzelm@7679
   307
  else x;
wenzelm@7679
   308
wenzelm@9291
   309
fun intern_skolem ctxt =
wenzelm@7679
   310
  let
wenzelm@7679
   311
    fun intern (t as Free (x, T)) =
wenzelm@10583
   312
          (case lookup_skolem ctxt (no_skolem true ctxt x) of
wenzelm@7679
   313
            Some x' => Free (x', T)
wenzelm@7679
   314
          | None => t)
wenzelm@7679
   315
      | intern (t $ u) = intern t $ intern u
wenzelm@7679
   316
      | intern (Abs (x, T, t)) = Abs (x, T, intern t)
wenzelm@7679
   317
      | intern a = a;
wenzelm@7679
   318
  in intern end;
wenzelm@7679
   319
wenzelm@7679
   320
wenzelm@9133
   321
(* externalize Skolem constants -- for printing purposes only *)
wenzelm@9133
   322
wenzelm@9133
   323
fun extern_skolem ctxt =
wenzelm@9133
   324
  let
wenzelm@9133
   325
    val rev_fixes = map Library.swap (fixes_of ctxt);
wenzelm@9133
   326
wenzelm@9133
   327
    fun extern (t as Free (x, T)) =
wenzelm@9133
   328
          (case assoc (rev_fixes, x) of
wenzelm@10583
   329
            Some x' => Free (if lookup_skolem ctxt x' = Some x then x' else NameSpace.hidden x', T)
wenzelm@9133
   330
          | None => t)
wenzelm@9133
   331
      | extern (t $ u) = extern t $ extern u
wenzelm@9133
   332
      | extern (Abs (x, T, t)) = Abs (x, T, extern t)
wenzelm@9133
   333
      | extern a = a;
wenzelm@9133
   334
  in extern end
wenzelm@9133
   335
wenzelm@8096
   336
wenzelm@5819
   337
(** prepare terms and propositions **)
wenzelm@5819
   338
wenzelm@5819
   339
(*
wenzelm@5819
   340
  (1) read / certify wrt. signature of context
wenzelm@5819
   341
  (2) intern Skolem constants
wenzelm@5819
   342
  (3) expand term bindings
wenzelm@5819
   343
*)
wenzelm@5819
   344
wenzelm@5819
   345
wenzelm@5819
   346
(* read / certify wrt. signature *)     (*exception ERROR*) (*exception TERM*)
wenzelm@5819
   347
wenzelm@5874
   348
fun read_def_termTs freeze sg (types, sorts, used) sTs =
wenzelm@8616
   349
  Sign.read_def_terms (sg, types, sorts) used freeze sTs;
wenzelm@5874
   350
wenzelm@5874
   351
fun read_def_termT freeze sg defs sT = apfst hd (read_def_termTs freeze sg defs [sT]);
wenzelm@5874
   352
wenzelm@8096
   353
fun read_term_sg freeze sg defs s = #1 (read_def_termT freeze sg defs (s, TypeInfer.logicT));
wenzelm@8096
   354
fun read_prop_sg freeze sg defs s = #1 (read_def_termT freeze sg defs (s, propT));
wenzelm@10465
   355
fun read_terms_sg freeze sg defs =
wenzelm@10465
   356
  #1 o read_def_termTs freeze sg defs o map (rpair TypeInfer.logicT);
wenzelm@10465
   357
fun read_props_sg freeze sg defs = #1 o read_def_termTs freeze sg defs o map (rpair propT);
wenzelm@5819
   358
wenzelm@5819
   359
wenzelm@5819
   360
fun cert_term_sg sg t = Thm.term_of (Thm.cterm_of sg t);
wenzelm@5819
   361
wenzelm@5819
   362
fun cert_prop_sg sg tm =
wenzelm@5819
   363
  let
wenzelm@5819
   364
    val ctm = Thm.cterm_of sg tm;
wenzelm@5819
   365
    val {t, T, ...} = Thm.rep_cterm ctm;
wenzelm@10465
   366
  in if T = propT then t else raise TERM ("Term not of type prop", [t]) end;
wenzelm@5819
   367
wenzelm@5819
   368
wenzelm@5819
   369
(* norm_term *)
wenzelm@5819
   370
wenzelm@5819
   371
(*beta normal form for terms (not eta normal form), chase variables in
wenzelm@5819
   372
  bindings environment (code taken from Pure/envir.ML)*)
wenzelm@5819
   373
wenzelm@8616
   374
fun unifyT ctxt (T, U) =
wenzelm@8616
   375
  let val maxidx = Int.max (Term.maxidx_of_typ T, Term.maxidx_of_typ U)
wenzelm@8616
   376
  in #1 (Type.unify (Sign.tsig_of (sign_of ctxt)) maxidx Vartab.empty (T, U)) end;
wenzelm@8616
   377
wenzelm@10554
   378
fun norm_term (ctxt as Context {binds, ...}) schematic =
wenzelm@5819
   379
  let
wenzelm@5819
   380
    (*raised when norm has no effect on a term, to do sharing instead of copying*)
wenzelm@5819
   381
    exception SAME;
wenzelm@5819
   382
wenzelm@5819
   383
    fun norm (t as Var (xi, T)) =
wenzelm@5819
   384
          (case Vartab.lookup (binds, xi) of
wenzelm@7606
   385
            Some (Some (u, U)) =>
wenzelm@8616
   386
              let
wenzelm@8616
   387
                val env = unifyT ctxt (T, U) handle Type.TUNIFY =>
wenzelm@8616
   388
                  raise TYPE ("norm_term: ill-typed variable assigment", [T, U], [t, u]);
wenzelm@8616
   389
                val u' = Term.subst_TVars_Vartab env u;
wenzelm@8616
   390
              in norm u' handle SAME => u' end
wenzelm@10554
   391
          | _ =>
wenzelm@10554
   392
            if schematic then raise SAME
wenzelm@10554
   393
            else raise CONTEXT ("Unbound schematic variable: " ^ Syntax.string_of_vname xi, ctxt))
wenzelm@5819
   394
      | norm (Abs (a, T, body)) =  Abs (a, T, norm body)
wenzelm@5819
   395
      | norm (Abs (_, _, body) $ t) = normh (subst_bound (t, body))
wenzelm@5819
   396
      | norm (f $ t) =
wenzelm@5819
   397
          ((case norm f of
wenzelm@5819
   398
            Abs (_, _, body) => normh (subst_bound (t, body))
wenzelm@5819
   399
          | nf => nf $ (norm t handle SAME => t)) handle SAME => f $ norm t)
wenzelm@5819
   400
      | norm _ =  raise SAME
wenzelm@5819
   401
    and normh t = norm t handle SAME => t
wenzelm@5819
   402
  in normh end;
wenzelm@5819
   403
wenzelm@5819
   404
wenzelm@6550
   405
(* dummy patterns *)
wenzelm@6550
   406
wenzelm@9540
   407
fun prepare_dummies t = #2 (Term.replace_dummy_patterns (1, t));
wenzelm@6762
   408
wenzelm@9540
   409
fun reject_dummies ctxt t = Term.no_dummy_patterns t
wenzelm@9540
   410
  handle TERM _ => raise CONTEXT ("Illegal dummy pattern(s) in term", ctxt);
wenzelm@6550
   411
wenzelm@6550
   412
wenzelm@5819
   413
(* read terms *)
wenzelm@5819
   414
wenzelm@10554
   415
local
wenzelm@10554
   416
wenzelm@10554
   417
fun gen_read read app is_pat schematic (ctxt as Context {defs = (_, _, (used, _)), ...}) s =
wenzelm@7663
   418
  (transform_error (read (sign_of ctxt) (def_type ctxt is_pat, def_sort ctxt, used)) s
wenzelm@7663
   419
    handle TERM (msg, _) => raise CONTEXT (msg, ctxt)
wenzelm@7663
   420
    | ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt))
wenzelm@9291
   421
  |> app (intern_skolem ctxt)
wenzelm@10554
   422
  |> app (if is_pat then I else norm_term ctxt schematic)
wenzelm@7663
   423
  |> app (if is_pat then prepare_dummies else (reject_dummies ctxt));
wenzelm@5819
   424
wenzelm@10554
   425
in
wenzelm@10554
   426
wenzelm@10554
   427
val read_termTs = gen_read (read_def_termTs false) (apfst o map) false false;
wenzelm@10554
   428
val read_termT_pats = #1 oo gen_read (read_def_termTs false) (apfst o map) true false;
wenzelm@8096
   429
wenzelm@8096
   430
fun read_term_pats T ctxt pats = read_termT_pats ctxt (map (rpair T) pats);
wenzelm@8096
   431
val read_prop_pats = read_term_pats propT;
wenzelm@8096
   432
wenzelm@10554
   433
val read_term = gen_read (read_term_sg true) I false false;
wenzelm@10554
   434
val read_prop = gen_read (read_prop_sg true) I false false;
wenzelm@10554
   435
val read_terms = gen_read (read_terms_sg true) map false false;
wenzelm@10465
   436
val read_props = gen_read (read_props_sg true) map false;
wenzelm@5819
   437
wenzelm@10554
   438
end;
wenzelm@10554
   439
wenzelm@5819
   440
wenzelm@5819
   441
(* certify terms *)
wenzelm@5819
   442
wenzelm@10554
   443
local
wenzelm@10554
   444
wenzelm@10554
   445
fun gen_cert cert is_pat schematic ctxt t = t
wenzelm@10554
   446
  |> (if is_pat then I else norm_term ctxt schematic)
wenzelm@8616
   447
  |> (fn t' => cert (sign_of ctxt) t' handle TERM (msg, _) => raise CONTEXT (msg, ctxt));
wenzelm@5819
   448
wenzelm@10554
   449
in
wenzelm@8096
   450
wenzelm@10554
   451
val cert_term = gen_cert cert_term_sg false false;
wenzelm@10554
   452
val cert_prop = gen_cert cert_prop_sg false false;
wenzelm@10554
   453
val cert_props = map oo gen_cert cert_prop_sg false;
wenzelm@10554
   454
wenzelm@10554
   455
fun cert_term_pats _ = map o gen_cert cert_term_sg true false;
wenzelm@10554
   456
val cert_prop_pats = map o gen_cert cert_prop_sg true false;
wenzelm@10554
   457
wenzelm@10554
   458
end;
wenzelm@5819
   459
wenzelm@5819
   460
wenzelm@5819
   461
(* declare terms *)
wenzelm@5819
   462
wenzelm@10381
   463
local
wenzelm@10381
   464
wenzelm@5819
   465
val ins_types = foldl_aterms
wenzelm@5819
   466
  (fn (types, Free (x, T)) => Vartab.update (((x, ~1), T), types)
wenzelm@5819
   467
    | (types, Var v) => Vartab.update (v, types)
wenzelm@5819
   468
    | (types, _) => types);
wenzelm@5819
   469
wenzelm@5819
   470
val ins_sorts = foldl_types (foldl_atyps
wenzelm@5819
   471
  (fn (sorts, TFree (x, S)) => Vartab.update (((x, ~1), S), sorts)
wenzelm@5819
   472
    | (sorts, TVar v) => Vartab.update (v, sorts)
wenzelm@5819
   473
    | (sorts, _) => sorts));
wenzelm@5819
   474
wenzelm@8616
   475
val ins_used = foldl_term_types (fn t => foldl_atyps
wenzelm@8616
   476
  (fn ((used, tab), TFree (x, _)) => (x ins used, Symtab.update_multi ((x, t), tab))
wenzelm@5819
   477
    | (used, _) => used));
wenzelm@5819
   478
wenzelm@7663
   479
fun ins_skolem def_ty = foldr
wenzelm@5994
   480
  (fn ((x, x'), types) =>
wenzelm@7663
   481
    (case def_ty x' of
wenzelm@5994
   482
      Some T => Vartab.update (((x, ~1), T), types)
wenzelm@5994
   483
    | None => types));
wenzelm@5994
   484
wenzelm@8373
   485
fun map_defaults f = map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8373
   486
  (thy, data, asms, binds, thms, cases, f defs));
wenzelm@5819
   487
wenzelm@10381
   488
fun declare_syn (ctxt, t) =
wenzelm@5819
   489
  ctxt
wenzelm@7670
   490
  |> map_defaults (fn (types, sorts, used) => (ins_types (types, t), sorts, used))
wenzelm@10381
   491
  |> map_defaults (fn (types, sorts, used) => (types, ins_sorts (sorts, t), used));
wenzelm@10381
   492
wenzelm@10381
   493
fun declare_occ (ctxt as Context {asms = (_, (fixes, _)), ...}, t) =
wenzelm@10381
   494
  declare_syn (ctxt, t)
wenzelm@7670
   495
  |> map_defaults (fn (types, sorts, used) => (types, sorts, ins_used (used, t)))
wenzelm@7670
   496
  |> map_defaults (fn (types, sorts, used) =>
wenzelm@7670
   497
      (ins_skolem (fn x => Vartab.lookup (types, (x, ~1))) (fixes, types), sorts, used));
wenzelm@5819
   498
wenzelm@10381
   499
in
wenzelm@5819
   500
wenzelm@10381
   501
fun declare_term t ctxt = declare_occ (ctxt, t);
wenzelm@10381
   502
fun declare_terms ts ctxt = foldl declare_occ (ctxt, ts);
wenzelm@10381
   503
fun predeclare_terms ts ctxt = foldl declare_syn (ctxt, ts);
wenzelm@10381
   504
wenzelm@10381
   505
end;
wenzelm@5819
   506
wenzelm@5819
   507
wenzelm@8616
   508
wenzelm@8616
   509
(** Hindley-Milner polymorphism **)
wenzelm@8616
   510
wenzelm@7925
   511
(* warn_extra_tfrees *)
wenzelm@7925
   512
wenzelm@8616
   513
local
wenzelm@8616
   514
wenzelm@8616
   515
fun used_free (a, ts) =
wenzelm@8616
   516
  (case mapfilter (fn Free (x, _) => Some x | _ => None) ts of
wenzelm@8616
   517
    [] => None
wenzelm@8616
   518
  | xs => Some (a, xs));
wenzelm@8616
   519
wenzelm@8616
   520
fun warn_extra (names1: string list, tab1) (names2, tab2) =
wenzelm@8616
   521
  if names1 = names2 then ()
wenzelm@7925
   522
  else
wenzelm@8616
   523
    let
wenzelm@8616
   524
      val extra =
wenzelm@8616
   525
        Library.gen_rems Library.eq_fst (Symtab.dest tab2, Symtab.dest tab1)
wenzelm@8616
   526
        |> mapfilter used_free;
wenzelm@8616
   527
      val tfrees = map #1 extra;
wenzelm@8616
   528
      val frees = Library.sort_strings (Library.distinct (flat (map #2 extra)));
wenzelm@8616
   529
    in
wenzelm@8616
   530
      if null extra then ()
wenzelm@8616
   531
      else warning ("Danger! Just introduced free type variable(s): " ^ commas tfrees ^ " in " ^
wenzelm@8616
   532
          space_implode " or " frees)
wenzelm@8616
   533
    end;
wenzelm@8616
   534
wenzelm@8616
   535
in
wenzelm@7925
   536
wenzelm@7925
   537
fun warn_extra_tfrees (ctxt1 as Context {defs = (_, _, used1), ...})
wenzelm@7925
   538
    (ctxt2 as Context {defs = (_, _, used2), ...}) = (warn_extra used1 used2; ctxt2);
wenzelm@7925
   539
wenzelm@8616
   540
end;
wenzelm@8616
   541
wenzelm@8616
   542
wenzelm@8616
   543
(* generalize type variables *)
wenzelm@8616
   544
wenzelm@8616
   545
fun gen_tfrees inner opt_outer =
wenzelm@8616
   546
  let
wenzelm@8616
   547
    val inner_used = used_table inner;
wenzelm@8616
   548
    val inner_fixes = fixed_names inner;
wenzelm@8616
   549
    val (outer_used, outer_fixes) =
wenzelm@8616
   550
      (case opt_outer of
wenzelm@8616
   551
        None => (Symtab.empty, [])
wenzelm@8616
   552
      | Some ctxt => (used_table ctxt, fixed_names ctxt));
wenzelm@8616
   553
wenzelm@8616
   554
    val extra_fixes = inner_fixes \\ outer_fixes;
wenzelm@8616
   555
    fun still_fixed (Free (x, _)) = not (x mem_string extra_fixes)
wenzelm@8616
   556
      | still_fixed _ = false;
wenzelm@8616
   557
wenzelm@8616
   558
    fun add (gen, (a, xs)) =
wenzelm@8616
   559
      if is_some (Symtab.lookup (outer_used, a)) orelse exists still_fixed xs
wenzelm@8616
   560
      then gen else a :: gen;
wenzelm@8616
   561
  in Symtab.foldl add ([], inner_used) end;
wenzelm@8616
   562
wenzelm@8616
   563
fun generalizeT inner outer =
wenzelm@8616
   564
  let
wenzelm@8616
   565
    val tfrees = gen_tfrees inner (Some outer);
wenzelm@8616
   566
    fun gen (x, S) = if x mem_string tfrees then TVar ((x, 0), S) else TFree (x, S);
wenzelm@8616
   567
  in Term.map_type_tfree gen end;
wenzelm@8616
   568
wenzelm@8616
   569
val generalize = Term.map_term_types oo generalizeT;
wenzelm@8616
   570
wenzelm@8616
   571
wenzelm@9553
   572
wenzelm@9553
   573
(** export theorems **)
wenzelm@8616
   574
wenzelm@8616
   575
fun get_free x (None, t as Free (y, _)) = if x = y then Some t else None
wenzelm@8616
   576
  | get_free _ (opt, _) = opt;
wenzelm@8616
   577
wenzelm@8616
   578
fun find_free t x = foldl_aterms (get_free x) (None, t);
wenzelm@8616
   579
wenzelm@8616
   580
fun diff_context inner None = (gen_tfrees inner None, fixed_names inner, assumptions inner)
wenzelm@8616
   581
  | diff_context inner (Some outer) =
wenzelm@8616
   582
      (gen_tfrees inner (Some outer),
wenzelm@8616
   583
        fixed_names inner \\ fixed_names outer,
wenzelm@8616
   584
        Library.drop (length (assumptions outer), assumptions inner));
wenzelm@8616
   585
wenzelm@9470
   586
fun export_wrt is_goal inner opt_outer =
wenzelm@8616
   587
  let
wenzelm@8616
   588
    val (tfrees, fixes, asms) = diff_context inner opt_outer;
wenzelm@11816
   589
    val exp_asms = map (fn (cprops, exp) => exp is_goal cprops) asms;
wenzelm@11816
   590
  in fn thm =>
wenzelm@11816
   591
    thm
wenzelm@11816
   592
    |> Tactic.norm_hhf
wenzelm@11816
   593
    |> Seq.EVERY (rev exp_asms)
wenzelm@11816
   594
    |> Seq.map (fn rule =>
wenzelm@11816
   595
      let
wenzelm@11816
   596
        val {sign, prop, ...} = Thm.rep_thm rule;
wenzelm@11816
   597
        val frees = map (Thm.cterm_of sign) (mapfilter (find_free prop) fixes);
wenzelm@11816
   598
      in
wenzelm@11816
   599
        rule
wenzelm@11816
   600
        |> Drule.forall_intr_list frees
wenzelm@11816
   601
        |> Tactic.norm_hhf
wenzelm@11816
   602
        |> Drule.tvars_intr_list tfrees
wenzelm@11816
   603
      end)
wenzelm@11816
   604
  end;
wenzelm@8616
   605
wenzelm@7925
   606
wenzelm@5819
   607
wenzelm@5819
   608
(** bindings **)
wenzelm@5819
   609
wenzelm@5819
   610
(* update_binds *)
wenzelm@5819
   611
wenzelm@7606
   612
fun del_bind (ctxt, xi) =
wenzelm@7606
   613
  ctxt
wenzelm@8373
   614
  |> map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8373
   615
      (thy, data, asms, Vartab.update ((xi, None), binds), thms, cases, defs));
wenzelm@7606
   616
wenzelm@8616
   617
fun upd_bind (ctxt, ((x, i), t)) =
wenzelm@8616
   618
  let
wenzelm@8616
   619
    val T = Term.fastype_of t;
wenzelm@8616
   620
    val t' =
wenzelm@8616
   621
      if null (Term.term_tvars t \\ Term.typ_tvars T) then t
wenzelm@8637
   622
      else Var ((x ^ "_has_extra_type_vars_on_rhs", i), T);
wenzelm@8616
   623
  in
wenzelm@5819
   624
    ctxt
wenzelm@8616
   625
    |> declare_term t'
wenzelm@8373
   626
    |> map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8616
   627
        (thy, data, asms, Vartab.update (((x, i), Some (t', T)), binds), thms, cases, defs))
wenzelm@5819
   628
  end;
wenzelm@5819
   629
wenzelm@7606
   630
fun del_upd_bind (ctxt, (xi, None)) = del_bind (ctxt, xi)
wenzelm@7606
   631
  | del_upd_bind (ctxt, (xi, Some t)) = upd_bind (ctxt, (xi, t));
wenzelm@7606
   632
wenzelm@5819
   633
fun update_binds bs ctxt = foldl upd_bind (ctxt, bs);
wenzelm@7606
   634
fun delete_update_binds bs ctxt = foldl del_upd_bind (ctxt, bs);
wenzelm@7606
   635
wenzelm@5819
   636
wenzelm@8096
   637
(* simult_matches *)
wenzelm@8096
   638
wenzelm@10554
   639
local
wenzelm@10554
   640
wenzelm@10554
   641
val add_vars = Term.foldl_aterms (fn (vs, Var (xi, _)) => xi ins vs | (vs, _) => vs);
wenzelm@10554
   642
fun vars_of ts = foldl add_vars ([], ts);
wenzelm@10554
   643
wenzelm@10554
   644
in
wenzelm@10554
   645
wenzelm@8616
   646
fun simult_matches ctxt [] = []
wenzelm@8616
   647
  | simult_matches ctxt pairs =
wenzelm@8096
   648
      let
wenzelm@10554
   649
        fun fail () = raise CONTEXT ("Pattern match failed!", ctxt);
wenzelm@10554
   650
wenzelm@8096
   651
        val maxidx = foldl (fn (i, (t1, t2)) =>
wenzelm@8096
   652
          Int.max (i, Int.max (Term.maxidx_of_term t1, Term.maxidx_of_term t2))) (~1, pairs);
wenzelm@10554
   653
        val envs = Unify.smash_unifiers (sign_of ctxt, Envir.empty maxidx,
wenzelm@10554
   654
          map swap pairs);    (*prefer assignment of variables from patterns*)
wenzelm@10554
   655
        val env =
wenzelm@8096
   656
          (case Seq.pull envs of
wenzelm@10554
   657
            None => fail ()
wenzelm@10554
   658
          | Some (env, _) => env);    (*ignore further results*)
wenzelm@10554
   659
        val domain = filter_out Term.is_replaced_dummy_pattern (vars_of (map #1 pairs));
wenzelm@10554
   660
        val _ =    (*may not assign variables from text*)
wenzelm@10554
   661
          if null (map #1 (Envir.alist_of env) inter vars_of (map #2 pairs)) then ()
wenzelm@10554
   662
          else fail ();
wenzelm@10465
   663
        fun norm_bind (xi, t) = if xi mem domain then Some (xi, Envir.norm_term env t) else None;
wenzelm@10465
   664
      in mapfilter norm_bind (Envir.alist_of env) end;
wenzelm@8096
   665
wenzelm@10554
   666
end;
wenzelm@10554
   667
wenzelm@8096
   668
wenzelm@8096
   669
(* add_binds(_i) *)
wenzelm@5819
   670
wenzelm@7925
   671
local
wenzelm@7925
   672
wenzelm@5819
   673
fun gen_bind prep (ctxt, (xi as (x, _), raw_t)) =
wenzelm@7606
   674
  ctxt |> delete_update_binds [(xi, apsome (prep ctxt) raw_t)];
wenzelm@5819
   675
wenzelm@8616
   676
fun gen_binds prep binds ctxt = foldl (gen_bind prep) (ctxt, binds);
wenzelm@7925
   677
wenzelm@10810
   678
in
wenzelm@10810
   679
wenzelm@10554
   680
fun drop_schematic (b as (xi, Some t)) = if null (Term.term_vars t) then b else (xi, None)
wenzelm@10554
   681
  | drop_schematic b = b;
wenzelm@10554
   682
wenzelm@5819
   683
val add_binds = gen_binds read_term;
wenzelm@5819
   684
val add_binds_i = gen_binds cert_term;
wenzelm@8616
   685
wenzelm@11764
   686
fun auto_bind_goal t ctxt =
wenzelm@11764
   687
  ctxt |> add_binds_i (map drop_schematic (AutoBind.goal (sign_of ctxt) t));
wenzelm@11764
   688
wenzelm@11764
   689
fun auto_bind_facts name ts ctxt =
wenzelm@11764
   690
  ctxt |> add_binds_i (map drop_schematic (AutoBind.facts (sign_of ctxt) name ts));
wenzelm@7925
   691
wenzelm@7925
   692
end;
wenzelm@5819
   693
wenzelm@5819
   694
wenzelm@8096
   695
(* match_bind(_i) *)
wenzelm@5819
   696
wenzelm@8096
   697
local
wenzelm@8096
   698
wenzelm@10465
   699
fun prep_bind prep_pats (ctxt, (raw_pats, t)) =
wenzelm@5819
   700
  let
wenzelm@8096
   701
    val ctxt' = declare_term t ctxt;
wenzelm@8096
   702
    val pats = prep_pats (fastype_of t) ctxt' raw_pats;
wenzelm@8616
   703
    val binds = simult_matches ctxt' (map (rpair t) pats);
wenzelm@8616
   704
  in (ctxt', binds) end;
wenzelm@7670
   705
wenzelm@10465
   706
fun gen_binds prep_terms prep_pats gen raw_binds ctxt =
wenzelm@8616
   707
  let
wenzelm@10465
   708
    val ts = prep_terms ctxt (map snd raw_binds);
wenzelm@10465
   709
    val (ctxt', binds) =
wenzelm@10465
   710
      apsnd flat (foldl_map (prep_bind prep_pats) (ctxt, map fst raw_binds ~~ ts));
wenzelm@8616
   711
    val binds' =
wenzelm@8616
   712
      if gen then map (apsnd (generalize ctxt' ctxt)) binds
wenzelm@8616
   713
      else binds;
wenzelm@8616
   714
    val binds'' = map (apsnd Some) binds';
wenzelm@8616
   715
  in
wenzelm@8616
   716
    warn_extra_tfrees ctxt
wenzelm@8616
   717
     (if gen then ctxt (*sic!*) |> declare_terms (map #2 binds') |> add_binds_i binds''
wenzelm@8616
   718
      else ctxt' |> add_binds_i binds'')
wenzelm@8616
   719
  end;
wenzelm@8096
   720
wenzelm@8096
   721
in
wenzelm@5935
   722
wenzelm@10465
   723
val match_bind = gen_binds read_terms read_term_pats;
wenzelm@10465
   724
val match_bind_i = gen_binds (map o cert_term) cert_term_pats;
wenzelm@8096
   725
wenzelm@8096
   726
end;
wenzelm@5935
   727
wenzelm@5935
   728
wenzelm@10465
   729
(* propositions with patterns *)
wenzelm@5935
   730
wenzelm@10465
   731
local
wenzelm@8096
   732
wenzelm@10554
   733
fun prep_propp schematic prep_props prep_pats (context, args) =
wenzelm@10465
   734
  let
wenzelm@10465
   735
    fun prep ((ctxt, prop :: props), (_, (raw_pats1, raw_pats2))) =
wenzelm@10465
   736
          let
wenzelm@10465
   737
            val ctxt' = declare_term prop ctxt;
wenzelm@10465
   738
            val pats = prep_pats ctxt' (raw_pats1 @ raw_pats2);    (*simultaneous type inference!*)
wenzelm@10465
   739
            val len1 = length raw_pats1;
wenzelm@10465
   740
          in ((ctxt', props), (prop, (take (len1, pats), drop (len1, pats)))) end
wenzelm@10465
   741
      | prep _ = sys_error "prep_propp";
wenzelm@10465
   742
    val ((context', _), propp) = foldl_map (foldl_map prep)
wenzelm@10554
   743
        ((context, prep_props schematic context (flat (map (map fst) args))), args);
wenzelm@10465
   744
  in (context', propp) end;
wenzelm@5935
   745
wenzelm@10465
   746
fun matches ctxt (prop, (pats1, pats2)) =
wenzelm@10465
   747
  simult_matches ctxt (map (rpair prop) pats1 @ map (rpair (Logic.strip_imp_concl prop)) pats2);
wenzelm@8096
   748
wenzelm@10465
   749
fun gen_bind_propp prepp (ctxt, raw_args) =
wenzelm@8096
   750
  let
wenzelm@10465
   751
    val (ctxt', args) = prepp (ctxt, raw_args);
wenzelm@10465
   752
    val binds = flat (flat (map (map (matches ctxt')) args));
wenzelm@10465
   753
    val propss = map (map #1) args;
wenzelm@8616
   754
wenzelm@10554
   755
    (*generalize result: context evaluated now, binds added later*)
wenzelm@8616
   756
    val gen = generalize ctxt' ctxt;
wenzelm@10465
   757
    fun gen_binds c = c |> add_binds_i (map (apsnd (Some o gen)) binds);
wenzelm@10465
   758
  in (ctxt' |> add_binds_i (map (apsnd Some) binds), (propss, gen_binds)) end;
wenzelm@8096
   759
wenzelm@10465
   760
in
wenzelm@10465
   761
wenzelm@10554
   762
val read_propp           = prep_propp false read_props read_prop_pats;
wenzelm@10554
   763
val cert_propp           = prep_propp false cert_props cert_prop_pats;
wenzelm@10554
   764
val read_propp_schematic = prep_propp true read_props read_prop_pats;
wenzelm@10554
   765
val cert_propp_schematic = prep_propp true cert_props cert_prop_pats;
wenzelm@10554
   766
wenzelm@10554
   767
val bind_propp             = gen_bind_propp read_propp;
wenzelm@10554
   768
val bind_propp_i           = gen_bind_propp cert_propp;
wenzelm@10554
   769
val bind_propp_schematic   = gen_bind_propp read_propp_schematic;
wenzelm@10554
   770
val bind_propp_schematic_i = gen_bind_propp cert_propp_schematic;
wenzelm@6789
   771
wenzelm@10465
   772
end;
wenzelm@10465
   773
wenzelm@6789
   774
wenzelm@5819
   775
wenzelm@5819
   776
(** theorems **)
wenzelm@5819
   777
wenzelm@6091
   778
(* get_thm(s) *)
wenzelm@5819
   779
wenzelm@9566
   780
(*beware of proper order of evaluation!*)
wenzelm@5819
   781
wenzelm@9566
   782
fun retrieve_thms f g (ctxt as Context {thy, thms, ...}) =
wenzelm@9566
   783
  let
wenzelm@9566
   784
    val sg_ref = Sign.self_ref (Theory.sign_of thy);
wenzelm@9566
   785
    val get_from_thy = f thy;
wenzelm@9566
   786
  in
wenzelm@9566
   787
    fn name =>
wenzelm@9566
   788
      (case Symtab.lookup (thms, name) of
wenzelm@9566
   789
        Some (Some ths) => map (Thm.transfer_sg (Sign.deref sg_ref)) ths
wenzelm@9566
   790
      | _ => get_from_thy name) |> g name
wenzelm@9566
   791
  end;
wenzelm@5819
   792
wenzelm@9566
   793
val get_thm = retrieve_thms PureThy.get_thms PureThy.single_thm;
wenzelm@9566
   794
val get_thm_closure = retrieve_thms PureThy.get_thms_closure PureThy.single_thm;
wenzelm@9566
   795
val get_thms = retrieve_thms PureThy.get_thms (K I);
wenzelm@9566
   796
val get_thms_closure = retrieve_thms PureThy.get_thms_closure (K I);
wenzelm@5819
   797
wenzelm@5819
   798
wenzelm@6091
   799
(* put_thm(s) *)
wenzelm@5819
   800
wenzelm@7479
   801
fun put_thms ("", _) = I
wenzelm@7479
   802
  | put_thms (name, ths) = map_context
wenzelm@8373
   803
      (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8373
   804
        (thy, data, asms, binds, Symtab.update ((name, Some ths), thms), cases, defs));
wenzelm@5819
   805
wenzelm@6091
   806
fun put_thm (name, th) = put_thms (name, [th]);
wenzelm@5819
   807
wenzelm@6091
   808
fun put_thmss [] ctxt = ctxt
wenzelm@6091
   809
  | put_thmss (th :: ths) ctxt = ctxt |> put_thms th |> put_thmss ths;
wenzelm@5819
   810
wenzelm@5819
   811
wenzelm@7606
   812
(* reset_thms *)
wenzelm@7606
   813
wenzelm@8373
   814
fun reset_thms name = map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8373
   815
  (thy, data, asms, binds, Symtab.update ((name, None), thms), cases, defs));
wenzelm@7606
   816
wenzelm@7606
   817
wenzelm@6091
   818
(* have_thmss *)
wenzelm@5819
   819
wenzelm@9196
   820
fun have_thss (ctxt, ((name, more_attrs), ths_attrs)) =
wenzelm@5819
   821
  let
wenzelm@5819
   822
    fun app ((ct, ths), (th, attrs)) =
wenzelm@6091
   823
      let val (ct', th') = Thm.applys_attributes ((ct, th), attrs @ more_attrs)
wenzelm@5819
   824
      in (ct', th' :: ths) end
wenzelm@5819
   825
    val (ctxt', rev_thms) = foldl app ((ctxt, []), ths_attrs);
wenzelm@9196
   826
    val thms = flat (rev rev_thms);
wenzelm@6091
   827
  in (ctxt' |> put_thms (name, thms), (name, thms)) end;
wenzelm@5819
   828
wenzelm@9196
   829
fun have_thmss args ctxt = foldl_map have_thss (ctxt, args);
wenzelm@9196
   830
wenzelm@5819
   831
wenzelm@5819
   832
wenzelm@5819
   833
(** assumptions **)
wenzelm@5819
   834
wenzelm@5819
   835
(* assume *)
wenzelm@5819
   836
wenzelm@7270
   837
local
wenzelm@6797
   838
wenzelm@10465
   839
fun add_assm (ctxt, ((name, attrs), props)) =
wenzelm@5819
   840
  let
wenzelm@10465
   841
    val cprops = map (Thm.cterm_of (sign_of ctxt)) props;
wenzelm@11816
   842
    val asms = map (Tactic.norm_hhf o Thm.assume) cprops;
wenzelm@5919
   843
wenzelm@5919
   844
    val ths = map (fn th => ([th], [])) asms;
wenzelm@10465
   845
    val (ctxt', [(_, thms)]) =
wenzelm@10465
   846
      ctxt
wenzelm@6797
   847
      |> auto_bind_facts name props
berghofe@11526
   848
      |> have_thmss [((name, attrs), ths)];
wenzelm@10465
   849
  in (ctxt', (cprops, (name, asms), (name, thms))) end;
wenzelm@5819
   850
wenzelm@9470
   851
fun gen_assms prepp exp args ctxt =
wenzelm@9470
   852
  let
wenzelm@10465
   853
    val (ctxt1, propss) = prepp (ctxt, map snd args);
wenzelm@10465
   854
    val (ctxt2, results) = foldl_map add_assm (ctxt1, map fst args ~~ propss);
wenzelm@10465
   855
wenzelm@9470
   856
    val cprops = flat (map #1 results);
wenzelm@9470
   857
    val asmss = map #2 results;
wenzelm@9470
   858
    val thmss = map #3 results;
wenzelm@10465
   859
    val ctxt3 =
wenzelm@10465
   860
      ctxt2
wenzelm@8373
   861
      |> map_context (fn (thy, data, ((asms_ct, asms_th), fixes), binds, thms, cases, defs) =>
wenzelm@9470
   862
        (thy, data, ((asms_ct @ [(cprops, exp)], asms_th @ asmss), fixes), binds, thms,
wenzelm@9470
   863
          cases, defs));
wenzelm@10465
   864
  in (warn_extra_tfrees ctxt ctxt3, (thmss, prems_of ctxt3)) end;
wenzelm@5819
   865
wenzelm@7270
   866
in
wenzelm@7270
   867
wenzelm@8616
   868
val assume = gen_assms (apsnd #1 o bind_propp);
wenzelm@8616
   869
val assume_i = gen_assms (apsnd #1 o bind_propp_i);
wenzelm@7270
   870
wenzelm@7270
   871
end;
wenzelm@5819
   872
wenzelm@5819
   873
wenzelm@8096
   874
(* variables *)
wenzelm@8096
   875
wenzelm@10381
   876
local
wenzelm@10381
   877
wenzelm@9291
   878
fun prep_vars prep_typ (ctxt, (xs, raw_T)) =
wenzelm@8096
   879
  let
wenzelm@9325
   880
    val _ = (case filter (not o Syntax.is_identifier) (map (no_skolem false ctxt) xs) of
wenzelm@8096
   881
      [] => () | bads => raise CONTEXT ("Bad variable name(s): " ^ commas_quote bads, ctxt));
wenzelm@8096
   882
wenzelm@8096
   883
    val opt_T = apsome (prep_typ ctxt) raw_T;
wenzelm@8096
   884
    val T = if_none opt_T TypeInfer.logicT;
wenzelm@10381
   885
    val ctxt' = ctxt |> predeclare_terms (map (fn x => Free (x, T)) xs);
wenzelm@8096
   886
  in (ctxt', (xs, opt_T)) end;
wenzelm@8096
   887
wenzelm@10381
   888
in
wenzelm@10381
   889
wenzelm@9291
   890
val read_vars = prep_vars read_typ;
wenzelm@9291
   891
val cert_vars = prep_vars cert_typ;
wenzelm@8096
   892
wenzelm@10381
   893
end;
wenzelm@10381
   894
wenzelm@8096
   895
wenzelm@5819
   896
(* fix *)
wenzelm@5819
   897
wenzelm@8096
   898
local
wenzelm@8096
   899
wenzelm@8096
   900
fun add_vars xs (fixes, names) =
wenzelm@8096
   901
  let
wenzelm@8096
   902
    val xs' = variantlist (xs, names);
wenzelm@8096
   903
    val fixes' = (xs ~~ map Syntax.skolem xs') @ fixes;
wenzelm@8096
   904
    val names' = xs' @ names;
wenzelm@8096
   905
  in (fixes', names') end;
wenzelm@8096
   906
wenzelm@8373
   907
fun map_vars f = map_context (fn (thy, data, (assumes, vars), binds, thms, cases, defs) =>
wenzelm@8373
   908
  (thy, data, (assumes, f vars), binds, thms, cases, defs));
wenzelm@5819
   909
wenzelm@8096
   910
fun gen_fix prep raw_vars ctxt =
wenzelm@8096
   911
  let
wenzelm@8096
   912
    val (ctxt', varss) = foldl_map prep (ctxt, raw_vars);
wenzelm@8096
   913
    val xs = flat (map fst varss);
wenzelm@8096
   914
  in
wenzelm@8096
   915
    (case Library.duplicates xs of
wenzelm@8096
   916
      [] => ()
wenzelm@8096
   917
    | dups => raise CONTEXT ("Duplicate variable name(s): " ^ commas_quote dups, ctxt));
wenzelm@8096
   918
    ctxt' |> map_vars (add_vars xs)
wenzelm@8096
   919
  end;
wenzelm@5819
   920
wenzelm@8096
   921
in
wenzelm@7679
   922
wenzelm@8096
   923
val fix = gen_fix read_vars;
wenzelm@8096
   924
val fix_i = gen_fix cert_vars;
wenzelm@8096
   925
wenzelm@8096
   926
end;
wenzelm@5819
   927
wenzelm@6895
   928
wenzelm@9291
   929
(*Note: improper use may result in variable capture / dynamic scoping!*)
wenzelm@9291
   930
fun bind_skolem ctxt xs =
wenzelm@9291
   931
  let
wenzelm@9291
   932
    val ctxt' = ctxt |> fix_i [(xs, None)];
wenzelm@9291
   933
    fun bind (t as Free (x, T)) =
wenzelm@9291
   934
          if x mem_string xs then
wenzelm@10583
   935
            (case lookup_skolem ctxt' x of Some x' => Free (x', T) | None => t)
wenzelm@9291
   936
          else t
wenzelm@9291
   937
      | bind (t $ u) = bind t $ bind u
wenzelm@9291
   938
      | bind (Abs (x, T, t)) = Abs (x, T, bind t)
wenzelm@9291
   939
      | bind a = a;
wenzelm@9291
   940
  in bind end;
wenzelm@9291
   941
wenzelm@9291
   942
wenzelm@5819
   943
wenzelm@8373
   944
(** cases **)
wenzelm@8373
   945
wenzelm@11793
   946
fun prep_case ctxt name xs {fixes, assumes, binds} =
wenzelm@11793
   947
  let
wenzelm@11793
   948
    fun replace (opt_x :: xs) ((y, T) :: ys) = (if_none opt_x y, T) :: replace xs ys
wenzelm@11793
   949
      | replace [] ys = ys
wenzelm@11793
   950
      | replace (_ :: _) [] = raise CONTEXT ("Too many parameters for case " ^ quote name, ctxt);
wenzelm@11793
   951
  in
wenzelm@11793
   952
    if null (foldr Term.add_typ_tvars (map snd fixes, [])) andalso
wenzelm@11793
   953
      null (foldr Term.add_term_vars (assumes, [])) then
wenzelm@11793
   954
        {fixes = replace xs fixes, assumes = assumes, binds = map drop_schematic binds}
wenzelm@11793
   955
    else raise CONTEXT ("Illegal schematic variable(s) in case " ^ quote name, ctxt)
wenzelm@11793
   956
  end;
wenzelm@8403
   957
wenzelm@11793
   958
fun get_case (ctxt as Context {cases, ...}) name xs =
wenzelm@8426
   959
  (case assoc (cases, name) of
wenzelm@8373
   960
    None => raise CONTEXT ("Unknown case: " ^ quote name, ctxt)
wenzelm@11793
   961
  | Some c => prep_case ctxt name xs c);
wenzelm@8373
   962
wenzelm@8384
   963
wenzelm@8373
   964
fun add_cases xs = map_context (fn (thy, data, asms, binds, thms, cases, defs) =>
wenzelm@8426
   965
  (thy, data, asms, binds, thms, rev (filter_out (equal "" o #1) xs) @ cases, defs));
wenzelm@8373
   966
wenzelm@8373
   967
wenzelm@8373
   968
wenzelm@10810
   969
(** print context information **)
wenzelm@10810
   970
wenzelm@10810
   971
val show_hyps = ref false;
wenzelm@10810
   972
wenzelm@10810
   973
fun pretty_thm thm =
wenzelm@10810
   974
  if ! show_hyps then setmp Display.show_hyps true Display.pretty_thm_no_quote thm
wenzelm@10810
   975
  else Display.pretty_cterm (#prop (Thm.crep_thm thm));
wenzelm@10810
   976
wenzelm@10810
   977
val verbose = ref false;
wenzelm@10810
   978
fun verb f x = if ! verbose then f (x ()) else [];
wenzelm@10810
   979
fun verb_single x = verb Library.single x;
wenzelm@10810
   980
wenzelm@10810
   981
fun setmp_verbose f x = Library.setmp verbose true f x;
wenzelm@10810
   982
wenzelm@10810
   983
fun pretty_items prt name items =
wenzelm@10810
   984
  let
wenzelm@10810
   985
    fun prt_itms (name, [x]) = Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt x]
wenzelm@10810
   986
      | prt_itms (name, xs) = Pretty.big_list (name ^ ":") (map prt xs);
wenzelm@10810
   987
  in
wenzelm@10810
   988
    if null items andalso not (! verbose) then []
wenzelm@10810
   989
    else [Pretty.big_list name (map prt_itms items)]
wenzelm@10810
   990
  end;
wenzelm@10810
   991
wenzelm@10810
   992
wenzelm@10810
   993
(* term bindings *)
wenzelm@10810
   994
wenzelm@10810
   995
val smash_option = fn (_, None) => None | (xi, Some b) => Some (xi, b);
wenzelm@10810
   996
wenzelm@10810
   997
fun pretty_binds (ctxt as Context {binds, ...}) =
wenzelm@10810
   998
  let
wenzelm@10810
   999
    val prt_term = Sign.pretty_term (sign_of ctxt);
wenzelm@10810
  1000
    fun prt_bind (xi, (t, T)) = prt_term (Logic.mk_equals (Var (xi, T), t));
wenzelm@10810
  1001
    val bs = mapfilter smash_option (Vartab.dest binds);
wenzelm@10810
  1002
  in
wenzelm@10810
  1003
    if null bs andalso not (! verbose) then []
wenzelm@10810
  1004
    else [Pretty.big_list "term bindings:" (map prt_bind bs)]
wenzelm@10810
  1005
  end;
wenzelm@10810
  1006
wenzelm@10810
  1007
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
wenzelm@10810
  1008
wenzelm@10810
  1009
wenzelm@10810
  1010
(* local theorems *)
wenzelm@10810
  1011
wenzelm@10810
  1012
fun pretty_thms (Context {thms, ...}) =
wenzelm@10810
  1013
  pretty_items pretty_thm "facts:" (mapfilter smash_option (Symtab.dest thms));
wenzelm@10810
  1014
wenzelm@10810
  1015
val print_thms = Pretty.writeln o Pretty.chunks o pretty_thms;
wenzelm@10810
  1016
wenzelm@10810
  1017
wenzelm@10810
  1018
(* local contexts *)
wenzelm@10810
  1019
wenzelm@10830
  1020
fun apply_case ({fixes, assumes, binds}: RuleCases.T) ctxt =
wenzelm@10810
  1021
  let
wenzelm@10830
  1022
    fun bind (c, (x, T)) = (c |> fix_i [([x], Some T)], bind_skolem c [x] (Free (x, T)));
wenzelm@10830
  1023
    val (ctxt', xs) = foldl_map bind (ctxt, fixes);
wenzelm@10810
  1024
    fun app t = foldl Term.betapply (t, xs);
wenzelm@10830
  1025
  in (ctxt', (map (apsnd (apsome app)) binds, map app assumes)) end;
wenzelm@10810
  1026
wenzelm@10810
  1027
fun pretty_cases (ctxt as Context {cases, ...}) =
wenzelm@10810
  1028
  let
wenzelm@10810
  1029
    val prt_term = Sign.pretty_term (sign_of ctxt);
wenzelm@10810
  1030
    fun prt_let (xi, t) = Pretty.block
wenzelm@10818
  1031
      [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
wenzelm@10810
  1032
        Pretty.quote (prt_term t)];
wenzelm@10810
  1033
wenzelm@10810
  1034
    fun prt_sect _ _ _ [] = []
wenzelm@10810
  1035
      | prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s ::
wenzelm@10810
  1036
            flat (Library.separate sep (map (Library.single o prt) xs))))];
wenzelm@10810
  1037
wenzelm@10830
  1038
    fun prt_case (name, (fixes, (lets, asms))) = Pretty.block (Pretty.fbreaks
wenzelm@10810
  1039
      (Pretty.str (name ^ ":") ::
wenzelm@11915
  1040
        prt_sect "fix" [] (Pretty.str o fst) fixes @
wenzelm@10810
  1041
        prt_sect "let" [Pretty.str "and"] prt_let
wenzelm@10810
  1042
          (mapfilter (fn (xi, Some t) => Some (xi, t) | _ => None) lets) @
wenzelm@10810
  1043
        prt_sect "assume" [] (Pretty.quote o prt_term) asms));
wenzelm@10810
  1044
wenzelm@10810
  1045
    val cases' = rev (Library.gen_distinct Library.eq_fst cases);
wenzelm@10810
  1046
  in
wenzelm@10810
  1047
    if null cases andalso not (! verbose) then []
wenzelm@10830
  1048
    else [Pretty.big_list "cases:"
wenzelm@10830
  1049
      (map (prt_case o apsnd (fn c => (#fixes c, #2 (apply_case c ctxt)))) cases')]
wenzelm@10810
  1050
  end;
wenzelm@10810
  1051
wenzelm@10810
  1052
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
wenzelm@10810
  1053
wenzelm@10810
  1054
wenzelm@10810
  1055
(* prems *)
wenzelm@10810
  1056
wenzelm@10810
  1057
val prems_limit = ref 10;
wenzelm@10810
  1058
wenzelm@10810
  1059
fun pretty_prems ctxt =
wenzelm@10810
  1060
  let
wenzelm@10810
  1061
    val limit = ! prems_limit;
wenzelm@10810
  1062
    val prems = prems_of ctxt;
wenzelm@10810
  1063
    val len = length prems;
wenzelm@10810
  1064
    val prt_prems =
wenzelm@10810
  1065
      (if len <= limit then [] else [Pretty.str "..."]) @
wenzelm@10810
  1066
      map pretty_thm (Library.drop (len - limit, prems));
wenzelm@10810
  1067
  in if null prems then [] else [Pretty.big_list "prems:" prt_prems] end;
wenzelm@10810
  1068
wenzelm@10810
  1069
wenzelm@10810
  1070
(* main context *)
wenzelm@10810
  1071
wenzelm@10810
  1072
fun pretty_context (ctxt as Context {asms = (_, (fixes, _)), cases,
wenzelm@10810
  1073
    defs = (types, sorts, (used, _)), ...}) =
wenzelm@10810
  1074
  let
wenzelm@10810
  1075
    val sign = sign_of ctxt;
wenzelm@10810
  1076
wenzelm@10810
  1077
    val prt_term = Sign.pretty_term sign;
wenzelm@10810
  1078
    val prt_typ = Sign.pretty_typ sign;
wenzelm@10810
  1079
    val prt_sort = Sign.pretty_sort sign;
wenzelm@10810
  1080
wenzelm@10810
  1081
    (*theory*)
wenzelm@10810
  1082
    val pretty_thy = Pretty.block [Pretty.str "Theory:", Pretty.brk 1, Sign.pretty_sg sign];
wenzelm@10810
  1083
wenzelm@10810
  1084
    (*fixes*)
wenzelm@10810
  1085
    fun prt_fix (x, x') = Pretty.block
wenzelm@11915
  1086
      [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
wenzelm@10810
  1087
wenzelm@10810
  1088
    fun prt_fixes [] = []
wenzelm@10810
  1089
      | prt_fixes xs = [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
wenzelm@10810
  1090
          Pretty.commas (map prt_fix xs))];
wenzelm@10810
  1091
wenzelm@10810
  1092
    (*defaults*)
wenzelm@10810
  1093
    fun prt_atom prt prtT (x, X) = Pretty.block
wenzelm@10810
  1094
      [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
wenzelm@10810
  1095
wenzelm@10810
  1096
    fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@10810
  1097
      | prt_var xi = prt_term (Syntax.var xi);
wenzelm@10810
  1098
wenzelm@10810
  1099
    fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@10810
  1100
      | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@10810
  1101
wenzelm@10810
  1102
    val prt_defT = prt_atom prt_var prt_typ;
wenzelm@10810
  1103
    val prt_defS = prt_atom prt_varT prt_sort;
wenzelm@10810
  1104
  in
wenzelm@10810
  1105
    verb_single (K pretty_thy) @
wenzelm@10810
  1106
    prt_fixes (rev (filter_out (can Syntax.dest_internal o #1) fixes)) @
wenzelm@10810
  1107
    pretty_prems ctxt @
wenzelm@10810
  1108
    verb pretty_binds (K ctxt) @
wenzelm@10810
  1109
    verb pretty_thms (K ctxt) @
wenzelm@10810
  1110
    verb pretty_cases (K ctxt) @
wenzelm@10810
  1111
    verb_single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
wenzelm@10810
  1112
    verb_single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts))) @
wenzelm@10810
  1113
    verb_single (fn () => Pretty.strs ("used type variable names:" :: used))
wenzelm@10810
  1114
  end;
wenzelm@10810
  1115
wenzelm@10810
  1116
wenzelm@10810
  1117
wenzelm@5819
  1118
(** theory setup **)
wenzelm@5819
  1119
wenzelm@5819
  1120
val setup = [ProofDataData.init];
wenzelm@5819
  1121
wenzelm@5819
  1122
wenzelm@5819
  1123
end;