src/Pure/Isar/proof_context.ML
author wenzelm
Fri Jul 26 21:09:39 2002 +0200 (2002-07-26 ago)
changeset 13425 119ae829ad9b
parent 13415 63462ccc6fac
child 13426 e0e2351043d2
permissions -rw-r--r--
support for split assumptions in cases (hyps vs. prems);
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@12093
    16
  val syntax_of: context -> Syntax.syntax * string list * string list
wenzelm@12057
    17
  val fixed_names_of: context -> string list
wenzelm@12057
    18
  val assumptions_of: context -> (cterm list * exporter) list
wenzelm@7557
    19
  val prems_of: context -> thm list
wenzelm@5819
    20
  val print_proof_data: theory -> unit
wenzelm@5874
    21
  val init: theory -> context
wenzelm@12576
    22
  val add_syntax: (string * typ option * mixfix option) list -> context -> context
wenzelm@12057
    23
  val is_fixed: context -> string -> bool
wenzelm@12414
    24
  val default_type: context -> string -> typ option
wenzelm@12504
    25
  val used_types: context -> string list
wenzelm@5819
    26
  val read_typ: context -> string -> typ
wenzelm@9504
    27
  val read_typ_no_norm: context -> string -> typ
wenzelm@5819
    28
  val cert_typ: context -> typ -> typ
wenzelm@9504
    29
  val cert_typ_no_norm: context -> typ -> typ
wenzelm@10583
    30
  val get_skolem: context -> string -> string
wenzelm@9291
    31
  val intern_skolem: context -> term -> term
wenzelm@9133
    32
  val extern_skolem: context -> term -> term
wenzelm@5874
    33
  val read_termTs: context -> (string * typ) list -> term list * (indexname * typ) list
wenzelm@5819
    34
  val read_term: context -> string -> term
wenzelm@5819
    35
  val read_prop: context -> string -> term
wenzelm@11925
    36
  val read_prop_schematic: context -> string -> term
wenzelm@10465
    37
  val read_terms: context -> string list -> term list
wenzelm@8096
    38
  val read_termT_pats: context -> (string * typ) list -> term list
wenzelm@8096
    39
  val read_term_pats: typ -> context -> string list -> term list
wenzelm@8096
    40
  val read_prop_pats: context -> string list -> term list
wenzelm@5819
    41
  val cert_term: context -> term -> term
wenzelm@5819
    42
  val cert_prop: context -> term -> term
wenzelm@8096
    43
  val cert_term_pats: typ -> context -> term list -> term list
wenzelm@8096
    44
  val cert_prop_pats: context -> term list -> term list
wenzelm@5819
    45
  val declare_term: term -> context -> context
wenzelm@5819
    46
  val declare_terms: term list -> context -> context
wenzelm@7925
    47
  val warn_extra_tfrees: context -> context -> context
wenzelm@12550
    48
  val generalize: context -> context -> term list -> term list
wenzelm@9470
    49
  val find_free: term -> string -> term option
wenzelm@12008
    50
  val export: bool -> context -> context -> thm -> thm Seq.seq
wenzelm@13415
    51
  val export_standard: cterm list -> context -> context -> thm -> thm
wenzelm@10810
    52
  val drop_schematic: indexname * term option -> indexname * term option
wenzelm@10810
    53
  val add_binds: (indexname * string option) list -> context -> context
wenzelm@10810
    54
  val add_binds_i: (indexname * term option) list -> context -> context
wenzelm@12147
    55
  val auto_bind_goal: term list -> context -> context
wenzelm@12147
    56
  val auto_bind_facts: term list -> context -> context
wenzelm@8616
    57
  val match_bind: bool -> (string list * string) list -> context -> context
wenzelm@8616
    58
  val match_bind_i: bool -> (term list * term) list -> context -> context
wenzelm@10465
    59
  val read_propp: context * (string * (string list * string list)) list list
wenzelm@10465
    60
    -> context * (term * (term list * term list)) list list
wenzelm@10465
    61
  val cert_propp: context * (term * (term list * term list)) list list
wenzelm@10465
    62
    -> context * (term * (term list * term list)) list list
wenzelm@10554
    63
  val read_propp_schematic: context * (string * (string list * string list)) list list
wenzelm@10554
    64
    -> context * (term * (term list * term list)) list list
wenzelm@10554
    65
  val cert_propp_schematic: context * (term * (term list * term list)) list list
wenzelm@10554
    66
    -> context * (term * (term list * term list)) list list
wenzelm@10465
    67
  val bind_propp: context * (string * (string list * string list)) list list
wenzelm@10465
    68
    -> context * (term list list * (context -> context))
wenzelm@10465
    69
  val bind_propp_i: context * (term * (term list * term list)) list list
wenzelm@10465
    70
    -> context * (term list list * (context -> context))
wenzelm@10554
    71
  val bind_propp_schematic: context * (string * (string list * string list)) list list
wenzelm@10554
    72
    -> context * (term list list * (context -> context))
wenzelm@10554
    73
  val bind_propp_schematic_i: context * (term * (term list * term list)) list list
wenzelm@10554
    74
    -> context * (term list list * (context -> context))
wenzelm@6091
    75
  val get_thm: context -> string -> thm
wenzelm@9566
    76
  val get_thm_closure: context -> string -> thm
wenzelm@6091
    77
  val get_thms: context -> string -> thm list
wenzelm@9566
    78
  val get_thms_closure: context -> string -> thm list
wenzelm@12309
    79
  val cond_extern: context -> string -> xstring
wenzelm@13399
    80
  val qualified: bool -> context -> context
wenzelm@13399
    81
  val restore_qualified: context -> context -> context
wenzelm@13425
    82
  val hide_thms: bool -> string list -> context -> context
wenzelm@6091
    83
  val put_thm: string * thm -> context -> context
wenzelm@6091
    84
  val put_thms: string * thm list -> context -> context
wenzelm@6091
    85
  val put_thmss: (string * thm list) list -> context -> context
wenzelm@7606
    86
  val reset_thms: string -> context -> context
wenzelm@9196
    87
  val have_thmss:
wenzelm@12711
    88
    ((bstring * context attribute list) * (xstring * context attribute list) list) list ->
wenzelm@12711
    89
      context -> context * (bstring * thm list) list
wenzelm@12711
    90
  val have_thmss_i:
wenzelm@12711
    91
    ((bstring * context attribute list) * (thm list * context attribute list) list) list ->
wenzelm@12711
    92
      context -> context * (bstring * thm list) list
wenzelm@11918
    93
  val export_assume: exporter
wenzelm@11918
    94
  val export_presume: exporter
wenzelm@12086
    95
  val cert_def: context -> term -> string * term
wenzelm@11918
    96
  val export_def: exporter
wenzelm@9470
    97
  val assume: exporter
wenzelm@10465
    98
    -> ((string * context attribute list) * (string * (string list * string list)) list) list
wenzelm@12835
    99
    -> context -> context * (bstring * thm list) list
wenzelm@9470
   100
  val assume_i: exporter
wenzelm@10465
   101
    -> ((string * context attribute list) * (term * (term list * term list)) list) list
wenzelm@12835
   102
    -> context -> context * (bstring * thm list) list
wenzelm@8096
   103
  val read_vars: context * (string list * string option) -> context * (string list * typ option)
wenzelm@8096
   104
  val cert_vars: context * (string list * typ option) -> context * (string list * typ option)
wenzelm@7411
   105
  val fix: (string list * string option) list -> context -> context
wenzelm@7663
   106
  val fix_i: (string list * typ option) list -> context -> context
wenzelm@11925
   107
  val fix_direct: (string list * typ option) list -> context -> context
wenzelm@12576
   108
  val add_fixes: (string * typ option * mixfix option) list -> context -> context
wenzelm@12016
   109
  val fix_frees: term list -> context -> context
wenzelm@9291
   110
  val bind_skolem: context -> string list -> term -> term
wenzelm@11793
   111
  val get_case: context -> string -> string option list -> RuleCases.T
wenzelm@8373
   112
  val add_cases: (string * RuleCases.T) list -> context -> context
wenzelm@13425
   113
  val apply_case: RuleCases.T -> context
wenzelm@13425
   114
    -> context * ((indexname * term option) list * (string * term list) list)
wenzelm@12057
   115
  val pretty_term: context -> term -> Pretty.T
wenzelm@12057
   116
  val pretty_typ: context -> typ -> Pretty.T
wenzelm@12057
   117
  val pretty_sort: context -> sort -> Pretty.T
wenzelm@12057
   118
  val pretty_thm: context -> thm -> Pretty.T
wenzelm@12057
   119
  val pretty_thms: context -> thm list -> Pretty.T
wenzelm@13278
   120
  val pretty_fact: context -> string * thm list -> Pretty.T
wenzelm@12057
   121
  val string_of_term: context -> term -> string
wenzelm@10810
   122
  val verbose: bool ref
wenzelm@10810
   123
  val setmp_verbose: ('a -> 'b) -> 'a -> 'b
wenzelm@12072
   124
  val print_syntax: context -> unit
wenzelm@10810
   125
  val print_binds: context -> unit
wenzelm@12057
   126
  val print_lthms: context -> unit
wenzelm@10810
   127
  val print_cases: context -> unit
wenzelm@10810
   128
  val prems_limit: int ref
wenzelm@12057
   129
  val pretty_asms: context -> Pretty.T list
wenzelm@10810
   130
  val pretty_context: context -> Pretty.T list
wenzelm@13284
   131
  val thms_containing_limit: int ref
wenzelm@13284
   132
  val print_thms_containing: context -> int option -> string list -> unit
wenzelm@5819
   133
  val setup: (theory -> theory) list
wenzelm@5819
   134
end;
wenzelm@5819
   135
wenzelm@8151
   136
signature PRIVATE_PROOF_CONTEXT =
wenzelm@5819
   137
sig
wenzelm@5819
   138
  include PROOF_CONTEXT
wenzelm@5819
   139
  val init_data: Object.kind -> (theory -> Object.T) * (context -> Object.T -> unit)
wenzelm@5819
   140
    -> theory -> theory
wenzelm@5819
   141
  val print_data: Object.kind -> context -> unit
wenzelm@5819
   142
  val get_data: Object.kind -> (Object.T -> 'a) -> context -> 'a
wenzelm@5819
   143
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> context -> context
wenzelm@5819
   144
end;
wenzelm@5819
   145
wenzelm@8151
   146
structure ProofContext: PRIVATE_PROOF_CONTEXT =
wenzelm@5819
   147
struct
wenzelm@5819
   148
wenzelm@5819
   149
wenzelm@5819
   150
(** datatype context **)
wenzelm@5819
   151
wenzelm@11816
   152
type exporter = bool -> cterm list -> thm -> thm Seq.seq;
wenzelm@9470
   153
wenzelm@5819
   154
datatype context =
wenzelm@5819
   155
  Context of
wenzelm@12309
   156
   {thy: theory,                                              (*current theory*)
wenzelm@12309
   157
    syntax: Syntax.syntax * string list * string list,        (*syntax with structs and mixfixed*)
wenzelm@12309
   158
    data: Object.T Symtab.table,                              (*user data*)
wenzelm@5819
   159
    asms:
wenzelm@12309
   160
      ((cterm list * exporter) list *                         (*assumes: A ==> _*)
wenzelm@6931
   161
        (string * thm list) list) *
wenzelm@12309
   162
      (string * string) list,                                 (*fixes: !!x. _*)
wenzelm@12309
   163
    binds: (term * typ) option Vartab.table,                  (*term bindings*)
wenzelm@13278
   164
    thms: bool * NameSpace.T * thm list option Symtab.table
wenzelm@13278
   165
      * FactIndex.T,                                          (*local thms*)
wenzelm@12309
   166
    cases: (string * RuleCases.T) list,                       (*local contexts*)
wenzelm@5819
   167
    defs:
wenzelm@12309
   168
      typ Vartab.table *                                      (*type constraints*)
wenzelm@12309
   169
      sort Vartab.table *                                     (*default sorts*)
wenzelm@12309
   170
      string list *                                           (*used type variables*)
wenzelm@12309
   171
      term list Symtab.table};                                (*type variable occurrences*)
wenzelm@5819
   172
wenzelm@5819
   173
exception CONTEXT of string * context;
wenzelm@5819
   174
wenzelm@5819
   175
wenzelm@12072
   176
fun make_context (thy, syntax, data, asms, binds, thms, cases, defs) =
wenzelm@12072
   177
  Context {thy = thy, syntax = syntax, data = data, asms = asms, binds = binds,
wenzelm@12072
   178
    thms = thms, cases = cases, defs = defs};
wenzelm@5819
   179
wenzelm@12072
   180
fun map_context f (Context {thy, syntax, data, asms, binds, thms, cases, defs}) =
wenzelm@12072
   181
  make_context (f (thy, syntax, data, asms, binds, thms, cases, defs));
wenzelm@5819
   182
wenzelm@5819
   183
fun theory_of (Context {thy, ...}) = thy;
wenzelm@5819
   184
val sign_of = Theory.sign_of o theory_of;
wenzelm@12072
   185
fun syntax_of (Context {syntax, ...}) = syntax;
wenzelm@5819
   186
wenzelm@12309
   187
fun fixes_of (Context {asms = (_, fixes), ...}) = fixes;
wenzelm@12057
   188
val fixed_names_of = map #2 o fixes_of;
wenzelm@12309
   189
fun is_fixed ctxt x = exists (equal x o #2) (fixes_of ctxt);
wenzelm@13278
   190
fun is_known (ctxt as Context {defs = (types, _, _, _), ...}) x =
wenzelm@13278
   191
  is_some (Vartab.lookup (types, (x, ~1))) orelse is_fixed ctxt x;
wenzelm@12291
   192
fun type_occs (Context {defs = (_, _, _, tab), ...}) = tab;
wenzelm@12057
   193
wenzelm@12057
   194
fun assumptions_of (Context {asms = ((asms, _), _), ...}) = asms;
wenzelm@12057
   195
fun prems_of (Context {asms = ((_, prems), _), ...}) = flat (map #2 prems);
wenzelm@12057
   196
wenzelm@7270
   197
wenzelm@5819
   198
wenzelm@5819
   199
(** user data **)
wenzelm@5819
   200
wenzelm@5819
   201
(* errors *)
wenzelm@5819
   202
wenzelm@5819
   203
fun of_theory thy = "\nof theory " ^ Sign.str_of_sg (Theory.sign_of thy);
wenzelm@5819
   204
wenzelm@5819
   205
fun err_inconsistent kinds =
wenzelm@5819
   206
  error ("Attempt to merge different versions of " ^ commas_quote kinds ^ " proof data");
wenzelm@5819
   207
wenzelm@5819
   208
fun err_dup_init thy kind =
wenzelm@5819
   209
  error ("Duplicate initialization of " ^ quote kind ^ " proof data" ^ of_theory thy);
wenzelm@5819
   210
wenzelm@5819
   211
fun err_undef ctxt kind =
wenzelm@5819
   212
  raise CONTEXT ("Tried to access undefined " ^ quote kind ^ " proof data", ctxt);
wenzelm@5819
   213
wenzelm@5819
   214
fun err_uninit ctxt kind =
wenzelm@5819
   215
  raise CONTEXT ("Tried to access uninitialized " ^ quote kind ^ " proof data" ^
wenzelm@5819
   216
    of_theory (theory_of ctxt), ctxt);
wenzelm@5819
   217
wenzelm@5819
   218
fun err_access ctxt kind =
wenzelm@5819
   219
  raise CONTEXT ("Unauthorized access to " ^ quote kind ^ " proof data" ^
wenzelm@5819
   220
    of_theory (theory_of ctxt), ctxt);
wenzelm@5819
   221
wenzelm@5819
   222
wenzelm@5819
   223
(* data kind 'Isar/proof_data' *)
wenzelm@5819
   224
wenzelm@5819
   225
structure ProofDataDataArgs =
wenzelm@5819
   226
struct
wenzelm@5819
   227
  val name = "Isar/proof_data";
wenzelm@5819
   228
  type T = (Object.kind * ((theory -> Object.T) * (context -> Object.T -> unit))) Symtab.table;
wenzelm@5819
   229
wenzelm@5819
   230
  val empty = Symtab.empty;
wenzelm@6550
   231
  val copy = I;
wenzelm@5819
   232
  val prep_ext = I;
wenzelm@5819
   233
  fun merge tabs = Symtab.merge (Object.eq_kind o pairself fst) tabs
wenzelm@5819
   234
    handle Symtab.DUPS kinds => err_inconsistent kinds;
wenzelm@5819
   235
  fun print _ tab = Pretty.writeln (Pretty.strs (map #1 (Symtab.dest tab)));
wenzelm@5819
   236
end;
wenzelm@5819
   237
wenzelm@5819
   238
structure ProofDataData = TheoryDataFun(ProofDataDataArgs);
wenzelm@5819
   239
val print_proof_data = ProofDataData.print;
wenzelm@5819
   240
wenzelm@5819
   241
wenzelm@5819
   242
(* init proof data *)
wenzelm@5819
   243
wenzelm@5819
   244
fun init_data kind meths thy =
wenzelm@5819
   245
  let
wenzelm@5819
   246
    val name = Object.name_of_kind kind;
wenzelm@5819
   247
    val tab = Symtab.update_new ((name, (kind, meths)), ProofDataData.get thy)
wenzelm@5819
   248
      handle Symtab.DUP _ => err_dup_init thy name;
wenzelm@5819
   249
  in thy |> ProofDataData.put tab end;
wenzelm@5819
   250
wenzelm@5819
   251
wenzelm@5819
   252
(* access data *)
wenzelm@5819
   253
wenzelm@5819
   254
fun lookup_data (ctxt as Context {data, ...}) kind =
wenzelm@5819
   255
  let
wenzelm@5819
   256
    val thy = theory_of ctxt;
wenzelm@5819
   257
    val name = Object.name_of_kind kind;
wenzelm@5819
   258
  in
wenzelm@5819
   259
    (case Symtab.lookup (ProofDataData.get thy, name) of
wenzelm@5819
   260
      Some (k, meths) =>
wenzelm@5819
   261
        if Object.eq_kind (kind, k) then
wenzelm@5819
   262
          (case Symtab.lookup (data, name) of
wenzelm@5819
   263
            Some x => (x, meths)
wenzelm@5819
   264
          | None => err_undef ctxt name)
wenzelm@5819
   265
        else err_access ctxt name
wenzelm@5819
   266
    | None => err_uninit ctxt name)
wenzelm@5819
   267
  end;
wenzelm@5819
   268
wenzelm@5819
   269
fun get_data kind f ctxt =
wenzelm@5819
   270
  let val (x, _) = lookup_data ctxt kind
wenzelm@5819
   271
  in f x handle Match => Object.kind_error kind end;
wenzelm@5819
   272
wenzelm@5819
   273
fun print_data kind ctxt =
wenzelm@5819
   274
  let val (x, (_, prt)) = lookup_data ctxt kind
wenzelm@5819
   275
  in prt ctxt x end;
wenzelm@5819
   276
wenzelm@5819
   277
fun put_data kind f x ctxt =
wenzelm@8373
   278
 (lookup_data ctxt kind;
wenzelm@12072
   279
  map_context (fn (thy, syntax, data, asms, binds, thms, cases, defs) =>
wenzelm@12072
   280
    (thy, syntax, Symtab.update ((Object.name_of_kind kind, f x), data),
wenzelm@12072
   281
      asms, binds, thms, cases, defs)) ctxt);
wenzelm@5819
   282
wenzelm@5819
   283
wenzelm@5819
   284
(* init context *)
wenzelm@5819
   285
wenzelm@5874
   286
fun init thy =
wenzelm@5874
   287
  let val data = Symtab.map (fn (_, (f, _)) => f thy) (ProofDataData.get thy) in
wenzelm@12309
   288
    make_context (thy, (Theory.syn_of thy, [], []), data, (([], []), []), Vartab.empty,
wenzelm@13278
   289
      (false, NameSpace.empty, Symtab.empty, FactIndex.empty), [],
wenzelm@13278
   290
      (Vartab.empty, Vartab.empty, [], Symtab.empty))
wenzelm@5819
   291
  end;
wenzelm@5819
   292
wenzelm@5819
   293
wenzelm@8096
   294
wenzelm@12093
   295
(** local syntax **)
wenzelm@12093
   296
wenzelm@12093
   297
val fixedN = "\\<^fixed>";
wenzelm@12093
   298
val structN = "\\<^struct>";
wenzelm@12093
   299
wenzelm@12100
   300
fun the_struct structs i =
wenzelm@12100
   301
  if 1 <= i andalso i <= length structs then Library.nth_elem (i - 1, structs)
wenzelm@12100
   302
  else raise ERROR_MESSAGE ("Illegal reference to implicit structure #" ^ string_of_int i);
wenzelm@12100
   303
wenzelm@12100
   304
wenzelm@12100
   305
(* print (ast) translations *)
wenzelm@12100
   306
wenzelm@12100
   307
fun index_tr' 1 = Syntax.const "_noindex"
wenzelm@12100
   308
  | index_tr' i = Syntax.const "_index" $ Syntax.const (Library.string_of_int i);
wenzelm@12100
   309
wenzelm@12100
   310
fun context_tr' ctxt =
wenzelm@12100
   311
  let
wenzelm@12100
   312
    val (_, structs, mixfixed) = syntax_of ctxt;
wenzelm@12100
   313
wenzelm@12100
   314
    fun tr' (t $ u) = tr' t $ tr' u
wenzelm@12100
   315
      | tr' (Abs (x, T, t)) = Abs (x, T, tr' t)
wenzelm@12100
   316
      | tr' (t as Free (x, T)) =
wenzelm@12100
   317
          let val i = Library.find_index (equal x) structs + 1 in
wenzelm@12100
   318
            if 1 <= i andalso i <= 9 then Syntax.const "_struct" $ index_tr' i
wenzelm@12100
   319
            else if x mem_string mixfixed then Const (fixedN ^ x, T)
wenzelm@12100
   320
            else t
wenzelm@12100
   321
          end
wenzelm@12100
   322
      | tr' a = a;
wenzelm@12100
   323
  in tr' end;
wenzelm@12100
   324
wenzelm@12100
   325
fun index_ast_tr' structs s =
wenzelm@12100
   326
  (case Syntax.read_nat s of
wenzelm@12100
   327
    Some i => Syntax.Variable (the_struct structs i handle ERROR_MESSAGE _ => raise Match)
wenzelm@12100
   328
  | None => raise Match);
wenzelm@12100
   329
wenzelm@12100
   330
fun struct_ast_tr' structs [Syntax.Constant "_noindex"] =
wenzelm@12100
   331
      index_ast_tr' structs "1"
wenzelm@12100
   332
  | struct_ast_tr' structs [Syntax.Appl [Syntax.Constant "_index", Syntax.Constant s]] =
wenzelm@12100
   333
      index_ast_tr' structs s
wenzelm@12100
   334
  | struct_ast_tr' _ _ = raise Match;
wenzelm@12100
   335
wenzelm@12100
   336
wenzelm@12100
   337
(* parse translations *)
wenzelm@12100
   338
wenzelm@12100
   339
fun fixed_tr x = (fixedN ^ x, curry Term.list_comb (Syntax.free x));
wenzelm@12100
   340
wenzelm@12100
   341
fun index_tr (Const ("_noindex", _)) = 1
wenzelm@12100
   342
  | index_tr (t as (Const ("_index", _) $ Const (s, _))) =
wenzelm@12100
   343
      (case Syntax.read_nat s of Some n => n | None => raise TERM ("index_tr", [t]))
wenzelm@12100
   344
  | index_tr t = raise TERM ("index_tr", [t]);
wenzelm@12100
   345
wenzelm@12100
   346
fun struct_tr structs (idx :: ts) = Syntax.free (the_struct structs (index_tr idx))
wenzelm@12100
   347
  | struct_tr _ ts = raise TERM ("struct_tr", ts);
wenzelm@12100
   348
wenzelm@12093
   349
wenzelm@12576
   350
(* add syntax *)
wenzelm@12576
   351
wenzelm@12576
   352
fun mixfix_type mx = replicate (Syntax.mixfix_args mx) TypeInfer.logicT ---> TypeInfer.logicT;
wenzelm@12093
   353
wenzelm@12093
   354
local
wenzelm@12093
   355
wenzelm@12576
   356
fun mixfix x None mx = (fixedN ^ x, mixfix_type mx, mx)
wenzelm@12093
   357
  | mixfix x (Some T) mx = (fixedN ^ x, T, mx);
wenzelm@12093
   358
wenzelm@12093
   359
fun prep_mixfix (_, _, None) = None
wenzelm@12093
   360
  | prep_mixfix (x, opt_T, Some mx) = Some (mixfix x opt_T mx);
wenzelm@12093
   361
wenzelm@12093
   362
fun prep_mixfix' (_, _, None) = None
wenzelm@12093
   363
  | prep_mixfix' (x, _, Some Syntax.NoSyn) = None
wenzelm@12863
   364
  | prep_mixfix' (x, opt_T, _) = Some (x, mixfix x opt_T (Syntax.literal x));
wenzelm@12093
   365
wenzelm@12093
   366
fun prep_struct (x, _, None) = Some x
wenzelm@12093
   367
  | prep_struct _ = None;
wenzelm@12093
   368
wenzelm@12093
   369
in
wenzelm@12093
   370
wenzelm@12093
   371
fun add_syntax decls =
wenzelm@12093
   372
  map_context (fn (thy, (syn, structs, mixfixed), data, asms, binds, thms, cases, defs) =>
wenzelm@12093
   373
    let
wenzelm@12093
   374
      val structs' = structs @ mapfilter prep_struct decls;
wenzelm@12093
   375
      val mxs = mapfilter prep_mixfix decls;
wenzelm@12093
   376
      val (fixed, mxs_output) = Library.split_list (mapfilter prep_mixfix' decls);
wenzelm@12093
   377
      val trs = map fixed_tr fixed;
wenzelm@12093
   378
      val syn' = syn
wenzelm@12093
   379
        |> Syntax.extend_const_gram ("", false) mxs_output
wenzelm@12093
   380
        |> Syntax.extend_const_gram ("", true) mxs
wenzelm@12093
   381
        |> Syntax.extend_trfuns ([], trs, [], []);
wenzelm@12093
   382
    in (thy, (syn', structs', fixed @ mixfixed), data, asms, binds, thms, cases, defs) end)
wenzelm@12093
   383
wenzelm@12093
   384
fun syn_of (Context {syntax = (syn, structs, _), ...}) =
wenzelm@12100
   385
  syn |> Syntax.extend_trfuns
wenzelm@12100
   386
    ([], [("_struct", struct_tr structs)], [], [("_struct", struct_ast_tr' structs)]);
wenzelm@12093
   387
wenzelm@12093
   388
end;
wenzelm@12093
   389
wenzelm@12093
   390
wenzelm@12093
   391
wenzelm@7663
   392
(** default sorts and types **)
wenzelm@7663
   393
wenzelm@12291
   394
fun def_sort (Context {defs = (_, sorts, _, _), ...}) xi = Vartab.lookup (sorts, xi);
wenzelm@7663
   395
wenzelm@12291
   396
fun def_type (Context {binds, defs = (types, _, _, _), ...}) is_pat xi =
wenzelm@7663
   397
  (case Vartab.lookup (types, xi) of
wenzelm@7663
   398
    None =>
wenzelm@8616
   399
      if is_pat then None else
wenzelm@8616
   400
        (case Vartab.lookup (binds, xi) of
wenzelm@8616
   401
          Some (Some (_, T)) => Some (TypeInfer.polymorphicT T)
wenzelm@8616
   402
        | _ => None)
wenzelm@7663
   403
  | some => some);
wenzelm@7663
   404
wenzelm@12504
   405
fun default_type (Context {defs = (types, _, _, _), ...}) x = Vartab.lookup (types, (x, ~1));
wenzelm@12504
   406
fun used_types (Context {defs = (_, _, used, _), ...}) = used;
wenzelm@12414
   407
wenzelm@7663
   408
wenzelm@5819
   409
wenzelm@5819
   410
(** prepare types **)
wenzelm@5819
   411
wenzelm@9504
   412
local
wenzelm@9504
   413
wenzelm@9504
   414
fun read_typ_aux read ctxt s =
wenzelm@12093
   415
  transform_error (read (syn_of ctxt) (sign_of ctxt, def_sort ctxt)) s
wenzelm@7663
   416
    handle ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt);
wenzelm@5819
   417
wenzelm@10554
   418
fun cert_typ_aux cert ctxt raw_T =
wenzelm@10554
   419
  cert (sign_of ctxt) raw_T
wenzelm@10554
   420
    handle TYPE (msg, _, _) => raise CONTEXT (msg, ctxt);
wenzelm@9504
   421
wenzelm@9504
   422
in
wenzelm@9504
   423
wenzelm@12072
   424
val read_typ = read_typ_aux Sign.read_typ';
wenzelm@12072
   425
val read_typ_no_norm = read_typ_aux Sign.read_typ_no_norm';
wenzelm@11925
   426
val cert_typ = cert_typ_aux Sign.certify_typ;
wenzelm@9504
   427
val cert_typ_no_norm = cert_typ_aux Sign.certify_typ_no_norm;
wenzelm@9504
   428
wenzelm@9504
   429
end;
wenzelm@9504
   430
wenzelm@5819
   431
wenzelm@7679
   432
(* internalize Skolem constants *)
wenzelm@7679
   433
wenzelm@10583
   434
fun lookup_skolem ctxt x = assoc (fixes_of ctxt, x);
wenzelm@10583
   435
fun get_skolem ctxt x = if_none (lookup_skolem ctxt x) x;
wenzelm@7679
   436
wenzelm@12504
   437
fun no_skolem internal ctxt x =
wenzelm@9291
   438
  if can Syntax.dest_skolem x then
wenzelm@7679
   439
    raise CONTEXT ("Illegal reference to internal Skolem constant: " ^ quote x, ctxt)
wenzelm@12504
   440
  else if not internal andalso can Syntax.dest_internal x then
wenzelm@9291
   441
    raise CONTEXT ("Illegal reference to internal variable: " ^ quote x, ctxt)
wenzelm@7679
   442
  else x;
wenzelm@7679
   443
wenzelm@9291
   444
fun intern_skolem ctxt =
wenzelm@7679
   445
  let
wenzelm@7679
   446
    fun intern (t as Free (x, T)) =
wenzelm@10583
   447
          (case lookup_skolem ctxt (no_skolem true ctxt x) of
wenzelm@7679
   448
            Some x' => Free (x', T)
wenzelm@7679
   449
          | None => t)
wenzelm@7679
   450
      | intern (t $ u) = intern t $ intern u
wenzelm@7679
   451
      | intern (Abs (x, T, t)) = Abs (x, T, intern t)
wenzelm@7679
   452
      | intern a = a;
wenzelm@7679
   453
  in intern end;
wenzelm@7679
   454
wenzelm@7679
   455
wenzelm@9133
   456
(* externalize Skolem constants -- for printing purposes only *)
wenzelm@9133
   457
wenzelm@9133
   458
fun extern_skolem ctxt =
wenzelm@9133
   459
  let
wenzelm@9133
   460
    val rev_fixes = map Library.swap (fixes_of ctxt);
wenzelm@9133
   461
wenzelm@9133
   462
    fun extern (t as Free (x, T)) =
wenzelm@9133
   463
          (case assoc (rev_fixes, x) of
wenzelm@10583
   464
            Some x' => Free (if lookup_skolem ctxt x' = Some x then x' else NameSpace.hidden x', T)
wenzelm@9133
   465
          | None => t)
wenzelm@9133
   466
      | extern (t $ u) = extern t $ extern u
wenzelm@9133
   467
      | extern (Abs (x, T, t)) = Abs (x, T, extern t)
wenzelm@9133
   468
      | extern a = a;
wenzelm@9133
   469
  in extern end
wenzelm@9133
   470
wenzelm@8096
   471
wenzelm@5819
   472
(** prepare terms and propositions **)
wenzelm@5819
   473
wenzelm@5819
   474
(*
wenzelm@5819
   475
  (1) read / certify wrt. signature of context
wenzelm@5819
   476
  (2) intern Skolem constants
wenzelm@5819
   477
  (3) expand term bindings
wenzelm@5819
   478
*)
wenzelm@5819
   479
wenzelm@5819
   480
wenzelm@5819
   481
(* read / certify wrt. signature *)     (*exception ERROR*) (*exception TERM*)
wenzelm@5819
   482
wenzelm@12072
   483
fun read_def_termTs freeze syn sg (types, sorts, used) sTs =
wenzelm@12072
   484
  Sign.read_def_terms' syn (sg, types, sorts) used freeze sTs;
wenzelm@5874
   485
wenzelm@12072
   486
fun read_def_termT freeze syn sg defs sT = apfst hd (read_def_termTs freeze syn sg defs [sT]);
wenzelm@5874
   487
wenzelm@12072
   488
fun read_term_sg freeze syn sg defs s =
wenzelm@12072
   489
  #1 (read_def_termT freeze syn sg defs (s, TypeInfer.logicT));
wenzelm@12072
   490
wenzelm@12072
   491
fun read_prop_sg freeze syn sg defs s = #1 (read_def_termT freeze syn sg defs (s, propT));
wenzelm@12072
   492
wenzelm@12072
   493
fun read_terms_sg freeze syn sg defs =
wenzelm@12072
   494
  #1 o read_def_termTs freeze syn sg defs o map (rpair TypeInfer.logicT);
wenzelm@12072
   495
wenzelm@12072
   496
fun read_props_sg freeze syn sg defs = #1 o read_def_termTs freeze syn sg defs o map (rpair propT);
wenzelm@5819
   497
wenzelm@5819
   498
wenzelm@5819
   499
fun cert_term_sg sg t = Thm.term_of (Thm.cterm_of sg t);
wenzelm@5819
   500
wenzelm@5819
   501
fun cert_prop_sg sg tm =
wenzelm@5819
   502
  let
wenzelm@5819
   503
    val ctm = Thm.cterm_of sg tm;
wenzelm@5819
   504
    val {t, T, ...} = Thm.rep_cterm ctm;
wenzelm@10465
   505
  in if T = propT then t else raise TERM ("Term not of type prop", [t]) end;
wenzelm@5819
   506
wenzelm@5819
   507
wenzelm@5819
   508
(* norm_term *)
wenzelm@5819
   509
wenzelm@5819
   510
(*beta normal form for terms (not eta normal form), chase variables in
wenzelm@5819
   511
  bindings environment (code taken from Pure/envir.ML)*)
wenzelm@5819
   512
wenzelm@8616
   513
fun unifyT ctxt (T, U) =
wenzelm@8616
   514
  let val maxidx = Int.max (Term.maxidx_of_typ T, Term.maxidx_of_typ U)
wenzelm@12530
   515
  in #1 (Type.unify (Sign.tsig_of (sign_of ctxt)) (Vartab.empty, maxidx) (T, U)) end;
wenzelm@8616
   516
wenzelm@10554
   517
fun norm_term (ctxt as Context {binds, ...}) schematic =
wenzelm@5819
   518
  let
wenzelm@5819
   519
    (*raised when norm has no effect on a term, to do sharing instead of copying*)
wenzelm@5819
   520
    exception SAME;
wenzelm@5819
   521
wenzelm@5819
   522
    fun norm (t as Var (xi, T)) =
wenzelm@5819
   523
          (case Vartab.lookup (binds, xi) of
wenzelm@7606
   524
            Some (Some (u, U)) =>
wenzelm@8616
   525
              let
wenzelm@8616
   526
                val env = unifyT ctxt (T, U) handle Type.TUNIFY =>
wenzelm@8616
   527
                  raise TYPE ("norm_term: ill-typed variable assigment", [T, U], [t, u]);
wenzelm@8616
   528
                val u' = Term.subst_TVars_Vartab env u;
wenzelm@8616
   529
              in norm u' handle SAME => u' end
wenzelm@10554
   530
          | _ =>
wenzelm@10554
   531
            if schematic then raise SAME
wenzelm@10554
   532
            else raise CONTEXT ("Unbound schematic variable: " ^ Syntax.string_of_vname xi, ctxt))
wenzelm@5819
   533
      | norm (Abs (a, T, body)) =  Abs (a, T, norm body)
wenzelm@5819
   534
      | norm (Abs (_, _, body) $ t) = normh (subst_bound (t, body))
wenzelm@5819
   535
      | norm (f $ t) =
wenzelm@5819
   536
          ((case norm f of
wenzelm@5819
   537
            Abs (_, _, body) => normh (subst_bound (t, body))
wenzelm@5819
   538
          | nf => nf $ (norm t handle SAME => t)) handle SAME => f $ norm t)
wenzelm@5819
   539
      | norm _ =  raise SAME
wenzelm@5819
   540
    and normh t = norm t handle SAME => t
wenzelm@5819
   541
  in normh end;
wenzelm@5819
   542
wenzelm@5819
   543
wenzelm@6550
   544
(* dummy patterns *)
wenzelm@6550
   545
wenzelm@9540
   546
fun prepare_dummies t = #2 (Term.replace_dummy_patterns (1, t));
wenzelm@6762
   547
wenzelm@9540
   548
fun reject_dummies ctxt t = Term.no_dummy_patterns t
wenzelm@9540
   549
  handle TERM _ => raise CONTEXT ("Illegal dummy pattern(s) in term", ctxt);
wenzelm@6550
   550
wenzelm@6550
   551
wenzelm@5819
   552
(* read terms *)
wenzelm@5819
   553
wenzelm@10554
   554
local
wenzelm@10554
   555
wenzelm@12291
   556
fun gen_read read app is_pat schematic (ctxt as Context {defs = (_, _, used, _), ...}) s =
wenzelm@12093
   557
  (transform_error (read (syn_of ctxt)
wenzelm@12072
   558
      (sign_of ctxt) (def_type ctxt is_pat, def_sort ctxt, used)) s
wenzelm@7663
   559
    handle TERM (msg, _) => raise CONTEXT (msg, ctxt)
wenzelm@7663
   560
    | ERROR_MESSAGE msg => raise CONTEXT (msg, ctxt))
wenzelm@9291
   561
  |> app (intern_skolem ctxt)
wenzelm@10554
   562
  |> app (if is_pat then I else norm_term ctxt schematic)
wenzelm@7663
   563
  |> app (if is_pat then prepare_dummies else (reject_dummies ctxt));
wenzelm@5819
   564
wenzelm@10554
   565
in
wenzelm@10554
   566
wenzelm@10554
   567
val read_termTs = gen_read (read_def_termTs false) (apfst o map) false false;
wenzelm@10554
   568
val read_termT_pats = #1 oo gen_read (read_def_termTs false) (apfst o map) true false;
wenzelm@8096
   569
wenzelm@8096
   570
fun read_term_pats T ctxt pats = read_termT_pats ctxt (map (rpair T) pats);
wenzelm@8096
   571
val read_prop_pats = read_term_pats propT;
wenzelm@8096
   572
wenzelm@10554
   573
val read_term = gen_read (read_term_sg true) I false false;
wenzelm@10554
   574
val read_prop = gen_read (read_prop_sg true) I false false;
wenzelm@11925
   575
val read_prop_schematic = gen_read (read_prop_sg true) I false true;
wenzelm@10554
   576
val read_terms = gen_read (read_terms_sg true) map false false;
wenzelm@10465
   577
val read_props = gen_read (read_props_sg true) map false;
wenzelm@5819
   578
wenzelm@10554
   579
end;
wenzelm@10554
   580
wenzelm@5819
   581
wenzelm@5819
   582
(* certify terms *)
wenzelm@5819
   583
wenzelm@10554
   584
local
wenzelm@10554
   585
wenzelm@10554
   586
fun gen_cert cert is_pat schematic ctxt t = t
wenzelm@10554
   587
  |> (if is_pat then I else norm_term ctxt schematic)
wenzelm@8616
   588
  |> (fn t' => cert (sign_of ctxt) t' handle TERM (msg, _) => raise CONTEXT (msg, ctxt));
wenzelm@5819
   589
wenzelm@10554
   590
in
wenzelm@8096
   591
wenzelm@10554
   592
val cert_term = gen_cert cert_term_sg false false;
wenzelm@10554
   593
val cert_prop = gen_cert cert_prop_sg false false;
wenzelm@10554
   594
val cert_props = map oo gen_cert cert_prop_sg false;
wenzelm@10554
   595
wenzelm@10554
   596
fun cert_term_pats _ = map o gen_cert cert_term_sg true false;
wenzelm@10554
   597
val cert_prop_pats = map o gen_cert cert_prop_sg true false;
wenzelm@10554
   598
wenzelm@10554
   599
end;
wenzelm@5819
   600
wenzelm@5819
   601
wenzelm@5819
   602
(* declare terms *)
wenzelm@5819
   603
wenzelm@10381
   604
local
wenzelm@10381
   605
wenzelm@5819
   606
val ins_types = foldl_aterms
wenzelm@5819
   607
  (fn (types, Free (x, T)) => Vartab.update (((x, ~1), T), types)
wenzelm@5819
   608
    | (types, Var v) => Vartab.update (v, types)
wenzelm@5819
   609
    | (types, _) => types);
wenzelm@5819
   610
wenzelm@5819
   611
val ins_sorts = foldl_types (foldl_atyps
wenzelm@5819
   612
  (fn (sorts, TFree (x, S)) => Vartab.update (((x, ~1), S), sorts)
wenzelm@5819
   613
    | (sorts, TVar v) => Vartab.update (v, sorts)
wenzelm@5819
   614
    | (sorts, _) => sorts));
wenzelm@5819
   615
wenzelm@8616
   616
val ins_used = foldl_term_types (fn t => foldl_atyps
wenzelm@12504
   617
  (fn (used, TFree (x, _)) => x ins_string used
wenzelm@12504
   618
    | (used, _) => used));
wenzelm@12291
   619
wenzelm@12291
   620
val ins_occs = foldl_term_types (fn t => foldl_atyps
wenzelm@12291
   621
  (fn (tab, TFree (x, _)) => Symtab.update_multi ((x, t), tab) | (tab, _) => tab));
wenzelm@5819
   622
wenzelm@7663
   623
fun ins_skolem def_ty = foldr
wenzelm@5994
   624
  (fn ((x, x'), types) =>
wenzelm@7663
   625
    (case def_ty x' of
wenzelm@5994
   626
      Some T => Vartab.update (((x, ~1), T), types)
wenzelm@5994
   627
    | None => types));
wenzelm@5994
   628
wenzelm@12072
   629
fun map_defaults f = map_context (fn (thy, syntax, data, asms, binds, thms, cases, defs) =>
wenzelm@12072
   630
  (thy, syntax, data, asms, binds, thms, cases, f defs));
wenzelm@5819
   631
wenzelm@10381
   632
fun declare_syn (ctxt, t) =
wenzelm@5819
   633
  ctxt
wenzelm@12291
   634
  |> map_defaults (fn (types, sorts, used, occ) => (ins_types (types, t), sorts, used, occ))
wenzelm@12291
   635
  |> map_defaults (fn (types, sorts, used, occ) => (types, ins_sorts (sorts, t), used, occ))
wenzelm@12291
   636
  |> map_defaults (fn (types, sorts, used, occ) => (types, sorts, ins_used (used, t), occ));
wenzelm@10381
   637
wenzelm@12309
   638
fun declare_occ (ctxt as Context {asms = (_, fixes), ...}, t) =
wenzelm@10381
   639
  declare_syn (ctxt, t)
wenzelm@12291
   640
  |> map_defaults (fn (types, sorts, used, occ) => (types, sorts, used, ins_occs (occ, t)))
wenzelm@12291
   641
  |> map_defaults (fn (types, sorts, used, occ) =>
wenzelm@12291
   642
      (ins_skolem (fn x => Vartab.lookup (types, (x, ~1))) (fixes, types), sorts, used, occ));
wenzelm@5819
   643
wenzelm@10381
   644
in
wenzelm@5819
   645
wenzelm@10381
   646
fun declare_term t ctxt = declare_occ (ctxt, t);
wenzelm@10381
   647
fun declare_terms ts ctxt = foldl declare_occ (ctxt, ts);
wenzelm@12130
   648
fun declare_terms_syntax ts ctxt = foldl declare_syn (ctxt, ts);
wenzelm@10381
   649
wenzelm@10381
   650
end;
wenzelm@5819
   651
wenzelm@5819
   652
wenzelm@8616
   653
wenzelm@12072
   654
(** pretty printing **)
wenzelm@12072
   655
wenzelm@12093
   656
fun pretty_term ctxt = Sign.pretty_term' (syn_of ctxt) (sign_of ctxt) o context_tr' ctxt;
wenzelm@12057
   657
val pretty_typ = Sign.pretty_typ o sign_of;
wenzelm@12057
   658
val pretty_sort = Sign.pretty_sort o sign_of;
wenzelm@12057
   659
wenzelm@12057
   660
val string_of_term = Pretty.string_of oo pretty_term;
wenzelm@12057
   661
wenzelm@12057
   662
fun pretty_thm ctxt thm =
wenzelm@12770
   663
  if ! Display.show_hyps then
wenzelm@12770
   664
    Display.pretty_thm_aux (pretty_sort ctxt, pretty_term ctxt) false thm
wenzelm@12804
   665
  else pretty_term ctxt (Thm.prop_of thm);
wenzelm@12057
   666
wenzelm@12057
   667
fun pretty_thms ctxt [th] = pretty_thm ctxt th
wenzelm@12057
   668
  | pretty_thms ctxt ths = Pretty.blk (0, Pretty.fbreaks (map (pretty_thm ctxt) ths));
wenzelm@12057
   669
wenzelm@13278
   670
fun pretty_fact ctxt ("", ths) = pretty_thms ctxt ths
wenzelm@13278
   671
  | pretty_fact ctxt (a, [th]) =
wenzelm@13278
   672
      Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, pretty_thm ctxt th]
wenzelm@13278
   673
  | pretty_fact ctxt (a, ths) =
wenzelm@13278
   674
      Pretty.block (Pretty.fbreaks (Pretty.str (a ^ ":") :: map (pretty_thm ctxt) ths));
wenzelm@13278
   675
wenzelm@12057
   676
wenzelm@12057
   677
wenzelm@8616
   678
(** Hindley-Milner polymorphism **)
wenzelm@8616
   679
wenzelm@7925
   680
(* warn_extra_tfrees *)
wenzelm@7925
   681
wenzelm@12130
   682
fun warn_extra_tfrees
wenzelm@12291
   683
    (ctxt1 as Context {defs = (_, _, _, occ1), ...})
wenzelm@12291
   684
    (ctxt2 as Context {defs = (_, _, _, occ2), ...}) =
wenzelm@12130
   685
  let
wenzelm@12130
   686
    fun known_tfree a (Type (_, Ts)) = exists (known_tfree a) Ts
wenzelm@12130
   687
      | known_tfree a (TFree (a', _)) = a = a'
wenzelm@12130
   688
      | known_tfree _ _ = false;
wenzelm@8616
   689
wenzelm@12130
   690
    val extras =
wenzelm@12291
   691
      Library.gen_rems Library.eq_fst (Symtab.dest occ2, Symtab.dest occ1)
wenzelm@12130
   692
      |> map (fn (a, ts) => map (pair a) (mapfilter (try (#1 o Term.dest_Free)) ts)) |> flat
wenzelm@12130
   693
      |> mapfilter (fn (a, x) =>
wenzelm@12130
   694
          (case def_type ctxt1 false (x, ~1) of None => Some (a, x)
wenzelm@12130
   695
          | Some T => if known_tfree a T then None else Some (a, x)));
wenzelm@12130
   696
    val tfrees = map #1 extras |> Library.sort_strings |> Library.unique_strings;
wenzelm@12130
   697
    val frees = map #2 extras |> Library.sort_strings |> Library.unique_strings;
wenzelm@12130
   698
  in
wenzelm@12130
   699
    if null extras then ()
wenzelm@12130
   700
    else warning ("Just introduced free type variable(s): " ^ commas tfrees ^ " in " ^
wenzelm@12130
   701
      space_implode " or " frees);
wenzelm@12130
   702
    ctxt2
wenzelm@12130
   703
  end;
wenzelm@8616
   704
wenzelm@8616
   705
wenzelm@8616
   706
(* generalize type variables *)
wenzelm@8616
   707
wenzelm@12550
   708
fun generalize_tfrees inner outer =
wenzelm@8616
   709
  let
wenzelm@12057
   710
    val extra_fixes = fixed_names_of inner \\ fixed_names_of outer;
wenzelm@8616
   711
    fun still_fixed (Free (x, _)) = not (x mem_string extra_fixes)
wenzelm@8616
   712
      | still_fixed _ = false;
wenzelm@12550
   713
    val occs_inner = type_occs inner;
wenzelm@12550
   714
    val occs_outer = type_occs outer;
wenzelm@12550
   715
    fun add (gen, a) =
wenzelm@12550
   716
      if is_some (Symtab.lookup (occs_outer, a)) orelse
wenzelm@12550
   717
        exists still_fixed (Symtab.lookup_multi (occs_inner, a))
wenzelm@8616
   718
      then gen else a :: gen;
wenzelm@12550
   719
  in fn tfrees => foldl add ([], tfrees) end;
wenzelm@8616
   720
wenzelm@12550
   721
fun generalize inner outer ts =
wenzelm@8616
   722
  let
wenzelm@12550
   723
    val tfrees = generalize_tfrees inner outer (foldr Term.add_term_tfree_names (ts, []));
wenzelm@8616
   724
    fun gen (x, S) = if x mem_string tfrees then TVar ((x, 0), S) else TFree (x, S);
wenzelm@12550
   725
  in map (Term.map_term_types (Term.map_type_tfree gen)) ts end;
wenzelm@8616
   726
wenzelm@8616
   727
wenzelm@9553
   728
wenzelm@9553
   729
(** export theorems **)
wenzelm@8616
   730
wenzelm@8616
   731
fun get_free x (None, t as Free (y, _)) = if x = y then Some t else None
wenzelm@8616
   732
  | get_free _ (opt, _) = opt;
wenzelm@8616
   733
wenzelm@8616
   734
fun find_free t x = foldl_aterms (get_free x) (None, t);
wenzelm@8616
   735
wenzelm@13415
   736
fun export_view view is_goal inner outer =
wenzelm@8616
   737
  let
wenzelm@12550
   738
    val gen = generalize_tfrees inner outer;
wenzelm@12057
   739
    val fixes = fixed_names_of inner \\ fixed_names_of outer;
wenzelm@12057
   740
    val asms = Library.drop (length (assumptions_of outer), assumptions_of inner);
wenzelm@11816
   741
    val exp_asms = map (fn (cprops, exp) => exp is_goal cprops) asms;
wenzelm@12550
   742
  in fn thm => thm
wenzelm@12804
   743
    |> Tactic.norm_hhf_rule
wenzelm@11816
   744
    |> Seq.EVERY (rev exp_asms)
wenzelm@13415
   745
    |> Seq.map (Drule.implies_intr_list view)
wenzelm@11816
   746
    |> Seq.map (fn rule =>
wenzelm@11816
   747
      let
wenzelm@11816
   748
        val {sign, prop, ...} = Thm.rep_thm rule;
wenzelm@11816
   749
        val frees = map (Thm.cterm_of sign) (mapfilter (find_free prop) fixes);
wenzelm@12550
   750
        val tfrees = gen (Term.add_term_tfree_names (prop, []));
wenzelm@11816
   751
      in
wenzelm@11816
   752
        rule
wenzelm@11816
   753
        |> Drule.forall_intr_list frees
wenzelm@12804
   754
        |> Tactic.norm_hhf_rule
wenzelm@12504
   755
        |> (#1 o Drule.tvars_intr_list tfrees)
wenzelm@11816
   756
      end)
wenzelm@11816
   757
  end;
wenzelm@8616
   758
wenzelm@13415
   759
val export = export_view [];
wenzelm@13399
   760
wenzelm@13399
   761
fun export_standard view inner outer =
wenzelm@13415
   762
  let val exp = export_view view false inner outer in
wenzelm@13378
   763
    fn th =>
wenzelm@13378
   764
      (case Seq.pull (exp th) of
wenzelm@13378
   765
        Some (th', _) => th' |> Drule.local_standard
wenzelm@13378
   766
      | None => raise CONTEXT ("Internal failure while exporting theorem", inner))
wenzelm@13378
   767
  end;
wenzelm@12704
   768
wenzelm@7925
   769
wenzelm@5819
   770
wenzelm@5819
   771
(** bindings **)
wenzelm@5819
   772
wenzelm@5819
   773
(* update_binds *)
wenzelm@5819
   774
wenzelm@7606
   775
fun del_bind (ctxt, xi) =
wenzelm@7606
   776
  ctxt
wenzelm@12072
   777
  |> map_context (fn (thy, syntax, data, asms, binds, thms, cases, defs) =>
wenzelm@12072
   778
      (thy, syntax, data, asms, Vartab.update ((xi, None), binds), thms, cases, defs));
wenzelm@7606
   779
wenzelm@8616
   780
fun upd_bind (ctxt, ((x, i), t)) =
wenzelm@8616
   781
  let
wenzelm@8616
   782
    val T = Term.fastype_of t;
wenzelm@8616
   783
    val t' =
wenzelm@8616
   784
      if null (Term.term_tvars t \\ Term.typ_tvars T) then t
wenzelm@8637
   785
      else Var ((x ^ "_has_extra_type_vars_on_rhs", i), T);
wenzelm@8616
   786
  in
wenzelm@5819
   787
    ctxt
wenzelm@8616
   788
    |> declare_term t'
wenzelm@12072
   789
    |> map_context (fn (thy, syntax, data, asms, binds, thms, cases, defs) =>
wenzelm@12072
   790
      (thy, syntax, data, asms, Vartab.update (((x, i), Some (t', T)), binds), thms, cases, defs))
wenzelm@5819
   791
  end;
wenzelm@5819
   792
wenzelm@7606
   793
fun del_upd_bind (ctxt, (xi, None)) = del_bind (ctxt, xi)
wenzelm@7606
   794
  | del_upd_bind (ctxt, (xi, Some t)) = upd_bind (ctxt, (xi, t));
wenzelm@7606
   795
wenzelm@5819
   796
fun update_binds bs ctxt = foldl upd_bind (ctxt, bs);
wenzelm@7606
   797
fun delete_update_binds bs ctxt = foldl del_upd_bind (ctxt, bs);
wenzelm@7606
   798
wenzelm@5819
   799
wenzelm@8096
   800
(* simult_matches *)
wenzelm@8096
   801
wenzelm@8616
   802
fun simult_matches ctxt [] = []
wenzelm@8616
   803
  | simult_matches ctxt pairs =
wenzelm@8096
   804
      let
wenzelm@10554
   805
        fun fail () = raise CONTEXT ("Pattern match failed!", ctxt);
wenzelm@10554
   806
wenzelm@8096
   807
        val maxidx = foldl (fn (i, (t1, t2)) =>
wenzelm@8096
   808
          Int.max (i, Int.max (Term.maxidx_of_term t1, Term.maxidx_of_term t2))) (~1, pairs);
wenzelm@10554
   809
        val envs = Unify.smash_unifiers (sign_of ctxt, Envir.empty maxidx,
wenzelm@10554
   810
          map swap pairs);    (*prefer assignment of variables from patterns*)
wenzelm@10554
   811
        val env =
wenzelm@8096
   812
          (case Seq.pull envs of
wenzelm@10554
   813
            None => fail ()
wenzelm@10554
   814
          | Some (env, _) => env);    (*ignore further results*)
wenzelm@12309
   815
        val domain =
wenzelm@12309
   816
          filter_out Term.is_replaced_dummy_pattern (map #1 (Drule.vars_of_terms (map #1 pairs)));
wenzelm@10554
   817
        val _ =    (*may not assign variables from text*)
wenzelm@12309
   818
          if null (map #1 (Envir.alist_of env) inter (map #1 (Drule.vars_of_terms (map #2 pairs))))
wenzelm@12309
   819
          then () else fail ();
wenzelm@10465
   820
        fun norm_bind (xi, t) = if xi mem domain then Some (xi, Envir.norm_term env t) else None;
wenzelm@10465
   821
      in mapfilter norm_bind (Envir.alist_of env) end;
wenzelm@8096
   822
wenzelm@8096
   823
wenzelm@8096
   824
(* add_binds(_i) *)
wenzelm@5819
   825
wenzelm@7925
   826
local
wenzelm@7925
   827
wenzelm@5819
   828
fun gen_bind prep (ctxt, (xi as (x, _), raw_t)) =
wenzelm@7606
   829
  ctxt |> delete_update_binds [(xi, apsome (prep ctxt) raw_t)];
wenzelm@5819
   830
wenzelm@8616
   831
fun gen_binds prep binds ctxt = foldl (gen_bind prep) (ctxt, binds);
wenzelm@7925
   832
wenzelm@10810
   833
in
wenzelm@10810
   834
wenzelm@10554
   835
fun drop_schematic (b as (xi, Some t)) = if null (Term.term_vars t) then b else (xi, None)
wenzelm@10554
   836
  | drop_schematic b = b;
wenzelm@10554
   837
wenzelm@5819
   838
val add_binds = gen_binds read_term;
wenzelm@5819
   839
val add_binds_i = gen_binds cert_term;
wenzelm@8616
   840
wenzelm@12147
   841
fun auto_bind f ts ctxt = ctxt |> add_binds_i (map drop_schematic (f (sign_of ctxt) ts));
wenzelm@12147
   842
val auto_bind_goal = auto_bind AutoBind.goal;
wenzelm@12147
   843
val auto_bind_facts = auto_bind AutoBind.facts;
wenzelm@7925
   844
wenzelm@7925
   845
end;
wenzelm@5819
   846
wenzelm@5819
   847
wenzelm@8096
   848
(* match_bind(_i) *)
wenzelm@5819
   849
wenzelm@8096
   850
local
wenzelm@8096
   851
wenzelm@10465
   852
fun prep_bind prep_pats (ctxt, (raw_pats, t)) =
wenzelm@5819
   853
  let
wenzelm@8096
   854
    val ctxt' = declare_term t ctxt;
wenzelm@8096
   855
    val pats = prep_pats (fastype_of t) ctxt' raw_pats;
wenzelm@8616
   856
    val binds = simult_matches ctxt' (map (rpair t) pats);
wenzelm@8616
   857
  in (ctxt', binds) end;
wenzelm@7670
   858
wenzelm@10465
   859
fun gen_binds prep_terms prep_pats gen raw_binds ctxt =
wenzelm@8616
   860
  let
wenzelm@10465
   861
    val ts = prep_terms ctxt (map snd raw_binds);
wenzelm@10465
   862
    val (ctxt', binds) =
wenzelm@10465
   863
      apsnd flat (foldl_map (prep_bind prep_pats) (ctxt, map fst raw_binds ~~ ts));
wenzelm@8616
   864
    val binds' =
wenzelm@12550
   865
      if gen then map #1 binds ~~ generalize ctxt' ctxt (map #2 binds)
wenzelm@8616
   866
      else binds;
wenzelm@8616
   867
    val binds'' = map (apsnd Some) binds';
wenzelm@8616
   868
  in
wenzelm@8616
   869
    warn_extra_tfrees ctxt
wenzelm@8616
   870
     (if gen then ctxt (*sic!*) |> declare_terms (map #2 binds') |> add_binds_i binds''
wenzelm@8616
   871
      else ctxt' |> add_binds_i binds'')
wenzelm@8616
   872
  end;
wenzelm@8096
   873
wenzelm@8096
   874
in
wenzelm@5935
   875
wenzelm@10465
   876
val match_bind = gen_binds read_terms read_term_pats;
wenzelm@10465
   877
val match_bind_i = gen_binds (map o cert_term) cert_term_pats;
wenzelm@8096
   878
wenzelm@8096
   879
end;
wenzelm@5935
   880
wenzelm@5935
   881
wenzelm@10465
   882
(* propositions with patterns *)
wenzelm@5935
   883
wenzelm@10465
   884
local
wenzelm@8096
   885
wenzelm@10554
   886
fun prep_propp schematic prep_props prep_pats (context, args) =
wenzelm@10465
   887
  let
wenzelm@10465
   888
    fun prep ((ctxt, prop :: props), (_, (raw_pats1, raw_pats2))) =
wenzelm@10465
   889
          let
wenzelm@10465
   890
            val ctxt' = declare_term prop ctxt;
wenzelm@10465
   891
            val pats = prep_pats ctxt' (raw_pats1 @ raw_pats2);    (*simultaneous type inference!*)
wenzelm@10465
   892
            val len1 = length raw_pats1;
wenzelm@10465
   893
          in ((ctxt', props), (prop, (take (len1, pats), drop (len1, pats)))) end
wenzelm@10465
   894
      | prep _ = sys_error "prep_propp";
wenzelm@10465
   895
    val ((context', _), propp) = foldl_map (foldl_map prep)
wenzelm@10554
   896
        ((context, prep_props schematic context (flat (map (map fst) args))), args);
wenzelm@10465
   897
  in (context', propp) end;
wenzelm@5935
   898
wenzelm@10465
   899
fun matches ctxt (prop, (pats1, pats2)) =
wenzelm@10465
   900
  simult_matches ctxt (map (rpair prop) pats1 @ map (rpair (Logic.strip_imp_concl prop)) pats2);
wenzelm@8096
   901
wenzelm@10465
   902
fun gen_bind_propp prepp (ctxt, raw_args) =
wenzelm@8096
   903
  let
wenzelm@10465
   904
    val (ctxt', args) = prepp (ctxt, raw_args);
wenzelm@10465
   905
    val binds = flat (flat (map (map (matches ctxt')) args));
wenzelm@10465
   906
    val propss = map (map #1) args;
wenzelm@8616
   907
wenzelm@10554
   908
    (*generalize result: context evaluated now, binds added later*)
wenzelm@8616
   909
    val gen = generalize ctxt' ctxt;
wenzelm@12550
   910
    fun gen_binds c = c |> add_binds_i (map #1 binds ~~ map Some (gen (map #2 binds)));
wenzelm@10465
   911
  in (ctxt' |> add_binds_i (map (apsnd Some) binds), (propss, gen_binds)) end;
wenzelm@8096
   912
wenzelm@10465
   913
in
wenzelm@10465
   914
wenzelm@11925
   915
val read_propp = prep_propp false read_props read_prop_pats;
wenzelm@11925
   916
val cert_propp = prep_propp false cert_props cert_prop_pats;
wenzelm@10554
   917
val read_propp_schematic = prep_propp true read_props read_prop_pats;
wenzelm@10554
   918
val cert_propp_schematic = prep_propp true cert_props cert_prop_pats;
wenzelm@10554
   919
wenzelm@11925
   920
val bind_propp = gen_bind_propp read_propp;
wenzelm@11925
   921
val bind_propp_i = gen_bind_propp cert_propp;
wenzelm@11925
   922
val bind_propp_schematic = gen_bind_propp read_propp_schematic;
wenzelm@10554
   923
val bind_propp_schematic_i = gen_bind_propp cert_propp_schematic;
wenzelm@6789
   924
wenzelm@10465
   925
end;
wenzelm@10465
   926
wenzelm@6789
   927
wenzelm@5819
   928
wenzelm@5819
   929
(** theorems **)
wenzelm@5819
   930
wenzelm@6091
   931
(* get_thm(s) *)
wenzelm@5819
   932
wenzelm@9566
   933
(*beware of proper order of evaluation!*)
wenzelm@13278
   934
fun retrieve_thms f g (ctxt as Context {thy, thms = (_, space, tab, _), ...}) =
wenzelm@9566
   935
  let
wenzelm@9566
   936
    val sg_ref = Sign.self_ref (Theory.sign_of thy);
wenzelm@9566
   937
    val get_from_thy = f thy;
wenzelm@9566
   938
  in
wenzelm@12309
   939
    fn xname =>
wenzelm@12309
   940
      (case Symtab.lookup (tab, NameSpace.intern space xname) of
wenzelm@9566
   941
        Some (Some ths) => map (Thm.transfer_sg (Sign.deref sg_ref)) ths
wenzelm@12309
   942
      | _ => get_from_thy xname) |> g xname
wenzelm@9566
   943
  end;
wenzelm@5819
   944
wenzelm@9566
   945
val get_thm = retrieve_thms PureThy.get_thms PureThy.single_thm;
wenzelm@9566
   946
val get_thm_closure = retrieve_thms PureThy.get_thms_closure PureThy.single_thm;
wenzelm@9566
   947
val get_thms = retrieve_thms PureThy.get_thms (K I);
wenzelm@9566
   948
val get_thms_closure = retrieve_thms PureThy.get_thms_closure (K I);
wenzelm@5819
   949
wenzelm@5819
   950
wenzelm@13425
   951
(* name space operations *)
wenzelm@12309
   952
wenzelm@13278
   953
fun cond_extern (Context {thms = (_, space, _, _), ...}) = NameSpace.cond_extern space;
wenzelm@12309
   954
wenzelm@13399
   955
fun qualified q = map_context (fn (thy, syntax, data, asms, binds,
wenzelm@13278
   956
    (_, space, tab, index), cases, defs) =>
wenzelm@13278
   957
  (thy, syntax, data, asms, binds, (q, space, tab, index), cases, defs));
wenzelm@12309
   958
wenzelm@13399
   959
fun restore_qualified (Context {thms, ...}) = qualified (#1 thms);
wenzelm@12309
   960
wenzelm@13425
   961
fun hide_thms fully names =
wenzelm@13425
   962
  map_context (fn (thy, syntax, data, asms, binds, (q, space, tab, index), cases, defs) =>
wenzelm@13425
   963
    (thy, syntax, data, asms, binds, (q, NameSpace.hide fully (space, names), tab, index),
wenzelm@13425
   964
      cases, defs));
wenzelm@13425
   965
wenzelm@12309
   966
wenzelm@6091
   967
(* put_thm(s) *)
wenzelm@5819
   968
wenzelm@12309
   969
fun put_thms ("", _) ctxt = ctxt
wenzelm@12309
   970
  | put_thms (name, ths) ctxt = ctxt |> map_context
wenzelm@13278
   971
      (fn (thy, syntax, data, asms, binds, (q, space, tab, index), cases, defs) =>
wenzelm@12309
   972
        if not q andalso NameSpace.is_qualified name then
wenzelm@12309
   973
          raise CONTEXT ("Attempt to declare qualified name " ^ quote name, ctxt)
wenzelm@12309
   974
        else (thy, syntax, data, asms, binds, (q, NameSpace.extend (space, [name]),
wenzelm@13278
   975
          Symtab.update ((name, Some ths), tab),
wenzelm@13278
   976
            FactIndex.add (is_known ctxt) (index, (name, ths))), cases, defs));
wenzelm@5819
   977
wenzelm@6091
   978
fun put_thm (name, th) = put_thms (name, [th]);
wenzelm@5819
   979
wenzelm@6091
   980
fun put_thmss [] ctxt = ctxt
wenzelm@6091
   981
  | put_thmss (th :: ths) ctxt = ctxt |> put_thms th |> put_thmss ths;
wenzelm@5819
   982
wenzelm@5819
   983
wenzelm@7606
   984
(* reset_thms *)
wenzelm@7606
   985
wenzelm@12309
   986
fun reset_thms name =
wenzelm@13278
   987
  map_context (fn (thy, syntax, data, asms, binds, (q, space, tab, index), cases, defs) =>
wenzelm@13278
   988
    (thy, syntax, data, asms, binds, (q, space, Symtab.update ((name, None), tab), index),
wenzelm@13278
   989
      cases, defs));
wenzelm@7606
   990
wenzelm@7606
   991
wenzelm@6091
   992
(* have_thmss *)
wenzelm@5819
   993
wenzelm@12711
   994
local
wenzelm@12711
   995
wenzelm@12711
   996
fun gen_have_thss get (ctxt, ((name, more_attrs), ths_attrs)) =
wenzelm@5819
   997
  let
wenzelm@5819
   998
    fun app ((ct, ths), (th, attrs)) =
wenzelm@12711
   999
      let val (ct', th') = Thm.applys_attributes ((ct, get ctxt th), attrs @ more_attrs)
wenzelm@12711
  1000
      in (ct', th' :: ths) end;
wenzelm@5819
  1001
    val (ctxt', rev_thms) = foldl app ((ctxt, []), ths_attrs);
wenzelm@9196
  1002
    val thms = flat (rev rev_thms);
wenzelm@6091
  1003
  in (ctxt' |> put_thms (name, thms), (name, thms)) end;
wenzelm@5819
  1004
wenzelm@12711
  1005
fun gen_have_thmss get args ctxt = foldl_map (gen_have_thss get) (ctxt, args);
wenzelm@12711
  1006
wenzelm@12711
  1007
in
wenzelm@12711
  1008
wenzelm@12711
  1009
val have_thmss = gen_have_thmss get_thms;
wenzelm@12711
  1010
val have_thmss_i = gen_have_thmss (K I);
wenzelm@12711
  1011
wenzelm@12711
  1012
end;
wenzelm@9196
  1013
wenzelm@5819
  1014
wenzelm@5819
  1015
wenzelm@5819
  1016
(** assumptions **)
wenzelm@5819
  1017
wenzelm@11918
  1018
(* basic exporters *)
wenzelm@11918
  1019
wenzelm@11918
  1020
fun export_assume true = Seq.single oo Drule.implies_intr_goals
wenzelm@11918
  1021
  | export_assume false = Seq.single oo Drule.implies_intr_list;
wenzelm@11918
  1022
wenzelm@11918
  1023
fun export_presume _ = export_assume false;
wenzelm@11918
  1024
wenzelm@11918
  1025
wenzelm@12057
  1026
(* defs *)
wenzelm@12057
  1027
wenzelm@12066
  1028
fun cert_def ctxt eq =
wenzelm@12016
  1029
  let
wenzelm@12057
  1030
    fun err msg = raise CONTEXT (msg ^
wenzelm@12057
  1031
      "\nThe error(s) above occurred in local definition: " ^ string_of_term ctxt eq, ctxt);
wenzelm@12057
  1032
    val (lhs, rhs) = Logic.dest_equals (Term.strip_all_body eq)
wenzelm@12057
  1033
      handle TERM _ => err "Not a meta-equality (==)";
wenzelm@12086
  1034
    val (f, xs) = Term.strip_comb lhs;
wenzelm@12086
  1035
    val (c, _) = Term.dest_Free f handle TERM _ =>
wenzelm@12086
  1036
      err "Head of lhs must be free or fixed variable";
wenzelm@12057
  1037
wenzelm@12086
  1038
    fun is_free (Free (x, _)) = not (is_fixed ctxt x)
wenzelm@12086
  1039
      | is_free _ = false;
wenzelm@12086
  1040
    val extra_frees = filter is_free (term_frees rhs) \\ xs;
wenzelm@12016
  1041
  in
wenzelm@12086
  1042
    conditional (not (forall (is_Bound orf is_free) xs andalso null (duplicates xs))) (fn () =>
wenzelm@12086
  1043
      err "Arguments of lhs must be distinct free or fixed variables");
wenzelm@12086
  1044
    conditional (f mem Term.term_frees rhs) (fn () =>
wenzelm@12086
  1045
      err "Element to be defined occurs on rhs");
wenzelm@12086
  1046
    conditional (not (null extra_frees)) (fn () =>
wenzelm@12086
  1047
      err ("Extra free variables on rhs: " ^ commas_quote (map (#1 o dest_Free) extra_frees)));
wenzelm@12086
  1048
    (c, Term.list_all_free (mapfilter (try Term.dest_Free) xs, eq))
wenzelm@12057
  1049
  end;
wenzelm@12057
  1050
wenzelm@12057
  1051
fun head_of_def cprop =
wenzelm@12057
  1052
  #1 (Term.strip_comb (#1 (Logic.dest_equals (Term.strip_all_body (Thm.term_of cprop)))))
wenzelm@12057
  1053
  |> Thm.cterm_of (Thm.sign_of_cterm cprop);
wenzelm@11918
  1054
wenzelm@11918
  1055
fun export_def _ cprops thm =
wenzelm@11918
  1056
  thm
wenzelm@11918
  1057
  |> Drule.implies_intr_list cprops
wenzelm@12057
  1058
  |> Drule.forall_intr_list (map head_of_def cprops)
wenzelm@11918
  1059
  |> Drule.forall_elim_vars 0
wenzelm@11918
  1060
  |> RANGE (replicate (length cprops) (Tactic.rtac Drule.reflexive_thm)) 1;
wenzelm@11918
  1061
wenzelm@11918
  1062
wenzelm@5819
  1063
(* assume *)
wenzelm@5819
  1064
wenzelm@7270
  1065
local
wenzelm@6797
  1066
wenzelm@10465
  1067
fun add_assm (ctxt, ((name, attrs), props)) =
wenzelm@5819
  1068
  let
wenzelm@10465
  1069
    val cprops = map (Thm.cterm_of (sign_of ctxt)) props;
wenzelm@12804
  1070
    val asms = map (Tactic.norm_hhf_rule o Thm.assume) cprops;
wenzelm@5919
  1071
wenzelm@5919
  1072
    val ths = map (fn th => ([th], [])) asms;
wenzelm@10465
  1073
    val (ctxt', [(_, thms)]) =
wenzelm@10465
  1074
      ctxt
wenzelm@12147
  1075
      |> auto_bind_facts props
wenzelm@12711
  1076
      |> have_thmss_i [((name, attrs), ths)];
wenzelm@10465
  1077
  in (ctxt', (cprops, (name, asms), (name, thms))) end;
wenzelm@5819
  1078
wenzelm@9470
  1079
fun gen_assms prepp exp args ctxt =
wenzelm@9470
  1080
  let
wenzelm@10465
  1081
    val (ctxt1, propss) = prepp (ctxt, map snd args);
wenzelm@10465
  1082
    val (ctxt2, results) = foldl_map add_assm (ctxt1, map fst args ~~ propss);
wenzelm@10465
  1083
wenzelm@9470
  1084
    val cprops = flat (map #1 results);
wenzelm@9470
  1085
    val asmss = map #2 results;
wenzelm@9470
  1086
    val thmss = map #3 results;
wenzelm@12072
  1087
    val ctxt3 = ctxt2 |> map_context
wenzelm@12072
  1088
      (fn (thy, syntax, data, ((asms_ct, asms_th), fixes), binds, thms, cases, defs) =>
wenzelm@12072
  1089
        (thy, syntax, data, ((asms_ct @ [(cprops, exp)], asms_th @ asmss), fixes), binds, thms,
wenzelm@9470
  1090
          cases, defs));
wenzelm@11925
  1091
    val ctxt4 = ctxt3 |> put_thms ("prems", prems_of ctxt3);
wenzelm@11925
  1092
  in (warn_extra_tfrees ctxt ctxt4, thmss) end;
wenzelm@5819
  1093
wenzelm@7270
  1094
in
wenzelm@7270
  1095
wenzelm@8616
  1096
val assume = gen_assms (apsnd #1 o bind_propp);
wenzelm@8616
  1097
val assume_i = gen_assms (apsnd #1 o bind_propp_i);
wenzelm@7270
  1098
wenzelm@7270
  1099
end;
wenzelm@5819
  1100
wenzelm@5819
  1101
wenzelm@8096
  1102
(* variables *)
wenzelm@8096
  1103
wenzelm@10381
  1104
local
wenzelm@10381
  1105
wenzelm@12504
  1106
fun prep_vars prep_typ internal (ctxt, (xs, raw_T)) =
wenzelm@8096
  1107
  let
wenzelm@12504
  1108
    fun cond_tvars T =
wenzelm@12504
  1109
      if internal then T
wenzelm@12504
  1110
      else Type.no_tvars T handle TYPE (msg, _, _) => raise CONTEXT (msg, ctxt);
wenzelm@12504
  1111
wenzelm@12504
  1112
    val _ = (case filter (not o Syntax.is_identifier) (map (no_skolem internal ctxt) xs) of
wenzelm@8096
  1113
      [] => () | bads => raise CONTEXT ("Bad variable name(s): " ^ commas_quote bads, ctxt));
wenzelm@8096
  1114
wenzelm@12504
  1115
    val opt_T = apsome (cond_tvars o prep_typ ctxt) raw_T;
wenzelm@8096
  1116
    val T = if_none opt_T TypeInfer.logicT;
wenzelm@12130
  1117
    val ctxt' = ctxt |> declare_terms_syntax (map (fn x => Free (x, T)) xs);
wenzelm@8096
  1118
  in (ctxt', (xs, opt_T)) end;
wenzelm@8096
  1119
wenzelm@10381
  1120
in
wenzelm@10381
  1121
wenzelm@12504
  1122
val read_vars = prep_vars read_typ false;
wenzelm@12504
  1123
val cert_vars = prep_vars cert_typ true;
wenzelm@8096
  1124
wenzelm@10381
  1125
end;
wenzelm@10381
  1126
wenzelm@8096
  1127
wenzelm@5819
  1128
(* fix *)
wenzelm@5819
  1129
wenzelm@8096
  1130
local
wenzelm@8096
  1131
wenzelm@12309
  1132
fun map_fixes f =
wenzelm@12309
  1133
  map_context (fn (thy, syntax, data, (assumes, fixes), binds, thms, cases, defs) =>
wenzelm@12309
  1134
    (thy, syntax, data, (assumes, f fixes), binds, thms, cases, defs));
wenzelm@5819
  1135
wenzelm@11925
  1136
fun err_dups ctxt xs = raise CONTEXT ("Duplicate variable(s): " ^ commas_quote xs, ctxt);
wenzelm@11925
  1137
wenzelm@12130
  1138
val declare =
wenzelm@12130
  1139
  declare_terms_syntax o mapfilter (fn (_, None) => None | (x, Some T) => Some (Free (x, T)));
wenzelm@12130
  1140
wenzelm@12130
  1141
fun add_vars xs Ts ctxt =
wenzelm@12309
  1142
  let val xs' = Term.variantlist (map Syntax.skolem xs, map #2 (fixes_of ctxt)) in
wenzelm@12309
  1143
    ctxt
wenzelm@12309
  1144
    |> declare (xs' ~~ Ts)
wenzelm@12309
  1145
    |> map_fixes (fn fixes => (xs ~~ xs') @ fixes)
wenzelm@12130
  1146
  end;
wenzelm@11925
  1147
wenzelm@12130
  1148
fun add_vars_direct xs Ts ctxt =
wenzelm@12309
  1149
  ctxt
wenzelm@12309
  1150
  |> declare (xs ~~ Ts)
wenzelm@12309
  1151
  |> map_fixes (fn fixes =>
wenzelm@12130
  1152
    (case xs inter_string map #1 fixes of
wenzelm@12309
  1153
      [] => (xs ~~ xs) @ fixes
wenzelm@12130
  1154
    | dups => err_dups ctxt dups));
wenzelm@12130
  1155
wenzelm@11925
  1156
wenzelm@11925
  1157
fun gen_fix prep add raw_vars ctxt =
wenzelm@8096
  1158
  let
wenzelm@8096
  1159
    val (ctxt', varss) = foldl_map prep (ctxt, raw_vars);
wenzelm@12130
  1160
    val vars = rev (flat (map (fn (xs, T) => map (rpair T) xs) varss));
wenzelm@12130
  1161
    val xs = map #1 vars;
wenzelm@12130
  1162
    val Ts = map #2 vars;
wenzelm@8096
  1163
  in
wenzelm@11925
  1164
    (case Library.duplicates xs of [] => () | dups => err_dups ctxt dups);
wenzelm@12130
  1165
    ctxt' |> add xs Ts
wenzelm@8096
  1166
  end;
wenzelm@5819
  1167
wenzelm@12576
  1168
fun prep_type (x, None, Some mx) = ([x], Some (mixfix_type mx))
wenzelm@12576
  1169
  | prep_type (x, opt_T, _) = ([x], opt_T);
wenzelm@12576
  1170
wenzelm@8096
  1171
in
wenzelm@7679
  1172
wenzelm@11925
  1173
val fix = gen_fix read_vars add_vars;
wenzelm@11925
  1174
val fix_i = gen_fix cert_vars add_vars;
wenzelm@11925
  1175
val fix_direct = gen_fix cert_vars add_vars_direct;
wenzelm@12576
  1176
fun add_fixes decls = add_syntax decls o fix_direct (map prep_type decls);
wenzelm@8096
  1177
wenzelm@8096
  1178
end;
wenzelm@5819
  1179
wenzelm@12048
  1180
fun fix_frees ts ctxt =
wenzelm@12048
  1181
  let
wenzelm@12504
  1182
    val frees = foldl Term.add_frees ([], ts);
wenzelm@12057
  1183
    fun new (x, T) = if is_fixed ctxt x then None else Some ([x], Some T);
wenzelm@12213
  1184
  in fix_direct (rev (mapfilter new frees)) ctxt end;
wenzelm@12016
  1185
wenzelm@6895
  1186
wenzelm@9291
  1187
(*Note: improper use may result in variable capture / dynamic scoping!*)
wenzelm@9291
  1188
fun bind_skolem ctxt xs =
wenzelm@9291
  1189
  let
wenzelm@9291
  1190
    val ctxt' = ctxt |> fix_i [(xs, None)];
wenzelm@9291
  1191
    fun bind (t as Free (x, T)) =
wenzelm@9291
  1192
          if x mem_string xs then
wenzelm@10583
  1193
            (case lookup_skolem ctxt' x of Some x' => Free (x', T) | None => t)
wenzelm@9291
  1194
          else t
wenzelm@9291
  1195
      | bind (t $ u) = bind t $ bind u
wenzelm@9291
  1196
      | bind (Abs (x, T, t)) = Abs (x, T, bind t)
wenzelm@9291
  1197
      | bind a = a;
wenzelm@9291
  1198
  in bind end;
wenzelm@9291
  1199
wenzelm@9291
  1200
wenzelm@5819
  1201
wenzelm@8373
  1202
(** cases **)
wenzelm@8373
  1203
wenzelm@11793
  1204
fun prep_case ctxt name xs {fixes, assumes, binds} =
wenzelm@11793
  1205
  let
wenzelm@11793
  1206
    fun replace (opt_x :: xs) ((y, T) :: ys) = (if_none opt_x y, T) :: replace xs ys
wenzelm@11793
  1207
      | replace [] ys = ys
wenzelm@11793
  1208
      | replace (_ :: _) [] = raise CONTEXT ("Too many parameters for case " ^ quote name, ctxt);
wenzelm@11793
  1209
  in
wenzelm@11793
  1210
    if null (foldr Term.add_typ_tvars (map snd fixes, [])) andalso
wenzelm@13425
  1211
      null (foldr Term.add_term_vars (flat (map #2 assumes), [])) then
wenzelm@11793
  1212
        {fixes = replace xs fixes, assumes = assumes, binds = map drop_schematic binds}
wenzelm@11793
  1213
    else raise CONTEXT ("Illegal schematic variable(s) in case " ^ quote name, ctxt)
wenzelm@11793
  1214
  end;
wenzelm@8403
  1215
wenzelm@11793
  1216
fun get_case (ctxt as Context {cases, ...}) name xs =
wenzelm@8426
  1217
  (case assoc (cases, name) of
wenzelm@8373
  1218
    None => raise CONTEXT ("Unknown case: " ^ quote name, ctxt)
wenzelm@11793
  1219
  | Some c => prep_case ctxt name xs c);
wenzelm@8373
  1220
wenzelm@8384
  1221
wenzelm@12072
  1222
fun add_cases xs = map_context (fn (thy, syntax, data, asms, binds, thms, cases, defs) =>
wenzelm@12072
  1223
  (thy, syntax, data, asms, binds, thms, rev (filter_out (equal "" o #1) xs) @ cases, defs));
wenzelm@8373
  1224
wenzelm@8373
  1225
wenzelm@8373
  1226
wenzelm@10810
  1227
(** print context information **)
wenzelm@10810
  1228
wenzelm@10810
  1229
val verbose = ref false;
wenzelm@10810
  1230
fun verb f x = if ! verbose then f (x ()) else [];
wenzelm@10810
  1231
fun verb_single x = verb Library.single x;
wenzelm@10810
  1232
wenzelm@10810
  1233
fun setmp_verbose f x = Library.setmp verbose true f x;
wenzelm@10810
  1234
wenzelm@10810
  1235
fun pretty_items prt name items =
wenzelm@10810
  1236
  let
wenzelm@10810
  1237
    fun prt_itms (name, [x]) = Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt x]
wenzelm@10810
  1238
      | prt_itms (name, xs) = Pretty.big_list (name ^ ":") (map prt xs);
wenzelm@10810
  1239
  in
wenzelm@10810
  1240
    if null items andalso not (! verbose) then []
wenzelm@10810
  1241
    else [Pretty.big_list name (map prt_itms items)]
wenzelm@10810
  1242
  end;
wenzelm@10810
  1243
wenzelm@10810
  1244
wenzelm@12072
  1245
(* local syntax *)
wenzelm@12072
  1246
wenzelm@12093
  1247
val print_syntax = Syntax.print_syntax o syn_of;
wenzelm@12072
  1248
wenzelm@12072
  1249
wenzelm@10810
  1250
(* term bindings *)
wenzelm@10810
  1251
wenzelm@10810
  1252
val smash_option = fn (_, None) => None | (xi, Some b) => Some (xi, b);
wenzelm@10810
  1253
wenzelm@10810
  1254
fun pretty_binds (ctxt as Context {binds, ...}) =
wenzelm@10810
  1255
  let
wenzelm@12057
  1256
    fun prt_bind (xi, (t, T)) = pretty_term ctxt (Logic.mk_equals (Var (xi, T), t));
wenzelm@10810
  1257
    val bs = mapfilter smash_option (Vartab.dest binds);
wenzelm@10810
  1258
  in
wenzelm@10810
  1259
    if null bs andalso not (! verbose) then []
wenzelm@10810
  1260
    else [Pretty.big_list "term bindings:" (map prt_bind bs)]
wenzelm@10810
  1261
  end;
wenzelm@10810
  1262
wenzelm@10810
  1263
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
wenzelm@10810
  1264
wenzelm@10810
  1265
wenzelm@10810
  1266
(* local theorems *)
wenzelm@10810
  1267
wenzelm@13278
  1268
fun pretty_lthms (ctxt as Context {thms = (_, space, tab, _), ...}) =
wenzelm@12309
  1269
  pretty_items (pretty_thm ctxt) "facts:"
wenzelm@12309
  1270
    (mapfilter smash_option (NameSpace.cond_extern_table space tab));
wenzelm@10810
  1271
wenzelm@12057
  1272
val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
wenzelm@10810
  1273
wenzelm@10810
  1274
wenzelm@10810
  1275
(* local contexts *)
wenzelm@10810
  1276
wenzelm@10830
  1277
fun apply_case ({fixes, assumes, binds}: RuleCases.T) ctxt =
wenzelm@10810
  1278
  let
wenzelm@10830
  1279
    fun bind (c, (x, T)) = (c |> fix_i [([x], Some T)], bind_skolem c [x] (Free (x, T)));
wenzelm@10830
  1280
    val (ctxt', xs) = foldl_map bind (ctxt, fixes);
wenzelm@10810
  1281
    fun app t = foldl Term.betapply (t, xs);
wenzelm@13425
  1282
  in (ctxt', (map (apsnd (apsome app)) binds, map (apsnd (map app)) assumes)) end;
wenzelm@10810
  1283
wenzelm@10810
  1284
fun pretty_cases (ctxt as Context {cases, ...}) =
wenzelm@10810
  1285
  let
wenzelm@12057
  1286
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1287
wenzelm@10810
  1288
    fun prt_let (xi, t) = Pretty.block
wenzelm@10818
  1289
      [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
wenzelm@10810
  1290
        Pretty.quote (prt_term t)];
wenzelm@10810
  1291
wenzelm@13425
  1292
    fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
wenzelm@13425
  1293
      ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
wenzelm@13425
  1294
wenzelm@10810
  1295
    fun prt_sect _ _ _ [] = []
wenzelm@10810
  1296
      | prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s ::
wenzelm@10810
  1297
            flat (Library.separate sep (map (Library.single o prt) xs))))];
wenzelm@10810
  1298
wenzelm@10830
  1299
    fun prt_case (name, (fixes, (lets, asms))) = Pretty.block (Pretty.fbreaks
wenzelm@10810
  1300
      (Pretty.str (name ^ ":") ::
wenzelm@11915
  1301
        prt_sect "fix" [] (Pretty.str o fst) fixes @
wenzelm@10810
  1302
        prt_sect "let" [Pretty.str "and"] prt_let
wenzelm@10810
  1303
          (mapfilter (fn (xi, Some t) => Some (xi, t) | _ => None) lets) @
wenzelm@13425
  1304
        (if forall (null o #2) asms then []
wenzelm@13425
  1305
          else prt_sect "assume" [Pretty.str "and"] prt_asm asms)));
wenzelm@10810
  1306
wenzelm@10810
  1307
    val cases' = rev (Library.gen_distinct Library.eq_fst cases);
wenzelm@10810
  1308
  in
wenzelm@10810
  1309
    if null cases andalso not (! verbose) then []
wenzelm@10830
  1310
    else [Pretty.big_list "cases:"
wenzelm@10830
  1311
      (map (prt_case o apsnd (fn c => (#fixes c, #2 (apply_case c ctxt)))) cases')]
wenzelm@10810
  1312
  end;
wenzelm@10810
  1313
wenzelm@10810
  1314
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
wenzelm@10810
  1315
wenzelm@10810
  1316
wenzelm@12057
  1317
(* core context *)
wenzelm@10810
  1318
wenzelm@10810
  1319
val prems_limit = ref 10;
wenzelm@10810
  1320
wenzelm@12057
  1321
fun pretty_asms ctxt =
wenzelm@10810
  1322
  let
wenzelm@12057
  1323
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1324
wenzelm@12093
  1325
    (*structures*)
wenzelm@12093
  1326
    val (_, structs, _) = syntax_of ctxt;
wenzelm@12093
  1327
    val prt_structs = if null structs then []
wenzelm@12093
  1328
      else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
wenzelm@12093
  1329
        Pretty.commas (map Pretty.str structs))];
wenzelm@12093
  1330
wenzelm@12057
  1331
    (*fixes*)
wenzelm@12057
  1332
    fun prt_fix (x, x') =
wenzelm@12057
  1333
      if x = x' then Pretty.str x
wenzelm@12057
  1334
      else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
wenzelm@12093
  1335
    val fixes = rev (filter_out
wenzelm@12093
  1336
      ((can Syntax.dest_internal o #1) orf (fn (_, x') => x' mem_string structs)) (fixes_of ctxt));
wenzelm@12093
  1337
    val prt_fixes = if null fixes then []
wenzelm@12093
  1338
      else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
wenzelm@12093
  1339
        Pretty.commas (map prt_fix fixes))];
wenzelm@12057
  1340
wenzelm@12057
  1341
    (*prems*)
wenzelm@10810
  1342
    val limit = ! prems_limit;
wenzelm@10810
  1343
    val prems = prems_of ctxt;
wenzelm@10810
  1344
    val len = length prems;
wenzelm@12093
  1345
    val prt_prems = if null prems then []
wenzelm@12093
  1346
      else [Pretty.big_list "prems:" ((if len <= limit then [] else [Pretty.str "..."]) @
wenzelm@12093
  1347
        map (pretty_thm ctxt) (Library.drop (len - limit, prems)))];
wenzelm@12093
  1348
wenzelm@12093
  1349
  in prt_structs @ prt_fixes @ prt_prems end;
wenzelm@10810
  1350
wenzelm@10810
  1351
wenzelm@10810
  1352
(* main context *)
wenzelm@10810
  1353
wenzelm@12291
  1354
fun pretty_context (ctxt as Context {cases, defs = (types, sorts, used, _), ...}) =
wenzelm@10810
  1355
  let
wenzelm@12057
  1356
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1357
    val prt_typ = pretty_typ ctxt;
wenzelm@12057
  1358
    val prt_sort = pretty_sort ctxt;
wenzelm@10810
  1359
wenzelm@10810
  1360
    (*theory*)
wenzelm@12057
  1361
    val pretty_thy = Pretty.block
wenzelm@12057
  1362
      [Pretty.str "Theory:", Pretty.brk 1, Sign.pretty_sg (sign_of ctxt)];
wenzelm@10810
  1363
wenzelm@10810
  1364
    (*defaults*)
wenzelm@10810
  1365
    fun prt_atom prt prtT (x, X) = Pretty.block
wenzelm@10810
  1366
      [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
wenzelm@10810
  1367
wenzelm@10810
  1368
    fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@10810
  1369
      | prt_var xi = prt_term (Syntax.var xi);
wenzelm@10810
  1370
wenzelm@10810
  1371
    fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@10810
  1372
      | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@10810
  1373
wenzelm@10810
  1374
    val prt_defT = prt_atom prt_var prt_typ;
wenzelm@10810
  1375
    val prt_defS = prt_atom prt_varT prt_sort;
wenzelm@10810
  1376
  in
wenzelm@10810
  1377
    verb_single (K pretty_thy) @
wenzelm@12057
  1378
    pretty_asms ctxt @
wenzelm@10810
  1379
    verb pretty_binds (K ctxt) @
wenzelm@12057
  1380
    verb pretty_lthms (K ctxt) @
wenzelm@10810
  1381
    verb pretty_cases (K ctxt) @
wenzelm@10810
  1382
    verb_single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
wenzelm@10810
  1383
    verb_single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts))) @
wenzelm@10810
  1384
    verb_single (fn () => Pretty.strs ("used type variable names:" :: used))
wenzelm@10810
  1385
  end;
wenzelm@10810
  1386
wenzelm@10810
  1387
wenzelm@13278
  1388
(* print_thms_containing *)
wenzelm@13278
  1389
wenzelm@13278
  1390
fun lthms_containing (ctxt as Context {thms = (_, _, _, index), ...}) idx =
wenzelm@13278
  1391
  let
wenzelm@13278
  1392
    fun valid (name, ths) =
wenzelm@13278
  1393
      (case try (transform_error (fn () => get_thms ctxt name)) () of
wenzelm@13278
  1394
        None => false
wenzelm@13278
  1395
      | Some ths' => Library.equal_lists Thm.eq_thm (ths, ths'));
wenzelm@13278
  1396
  in gen_distinct eq_fst (filter valid (FactIndex.find idx index)) end;
wenzelm@13278
  1397
wenzelm@13278
  1398
wenzelm@13284
  1399
val thms_containing_limit = ref 40;
wenzelm@13284
  1400
wenzelm@13284
  1401
fun print_thms_containing ctxt opt_limit ss =
wenzelm@13278
  1402
  let
wenzelm@13278
  1403
    val prt_term = pretty_term ctxt;
wenzelm@13282
  1404
    val prt_fact = pretty_fact ctxt;
wenzelm@13278
  1405
    fun prt_consts [] = []
wenzelm@13278
  1406
      | prt_consts cs = [Pretty.block (Pretty.breaks (Pretty.str "constants" ::
wenzelm@13278
  1407
          map (Pretty.quote o prt_term o Syntax.const) cs))];
wenzelm@13278
  1408
    fun prt_frees [] = []
wenzelm@13278
  1409
      | prt_frees xs = [Pretty.block (Pretty.breaks (Pretty.str "variables" ::
wenzelm@13278
  1410
          map (Pretty.quote o prt_term o Syntax.free) xs))];
wenzelm@13278
  1411
wenzelm@13278
  1412
    val (cs, xs) = foldl (FactIndex.index_term (is_known ctxt))
wenzelm@13278
  1413
      (([], []), map (read_term ctxt) ss);
wenzelm@13278
  1414
    val empty_idx = Library.null cs andalso Library.null xs;
wenzelm@13278
  1415
wenzelm@13278
  1416
    val header =
wenzelm@13378
  1417
      if empty_idx then [Pretty.block [Pretty.str "Known facts:", Pretty.fbrk]]
wenzelm@13278
  1418
      else [Pretty.block (Pretty.breaks (Pretty.str "Facts containing" ::
wenzelm@13278
  1419
        separate (Pretty.str "and") (prt_consts cs @ prt_frees xs)) @
wenzelm@13278
  1420
          [Pretty.str ":", Pretty.fbrk])]
wenzelm@13284
  1421
    val facts =
wenzelm@13284
  1422
      PureThy.thms_containing (theory_of ctxt) (cs, xs) @ lthms_containing ctxt (cs, xs)
wenzelm@13284
  1423
      |> sort_wrt #1;
wenzelm@13284
  1424
    val len = length facts;
wenzelm@13284
  1425
    val limit = if_none opt_limit (! thms_containing_limit);
wenzelm@13278
  1426
  in
wenzelm@13278
  1427
    if empty_idx andalso not (Library.null ss) then
wenzelm@13278
  1428
      warning "thms_containing: no consts/frees in specification"
wenzelm@13284
  1429
    else (header @ (if len <= limit then [] else [Pretty.str "..."]) @
wenzelm@13284
  1430
        map prt_fact (Library.drop (len - limit, facts))) |> Pretty.chunks |> Pretty.writeln
wenzelm@13278
  1431
  end;
wenzelm@13278
  1432
wenzelm@13278
  1433
wenzelm@10810
  1434
wenzelm@5819
  1435
(** theory setup **)
wenzelm@5819
  1436
wenzelm@5819
  1437
val setup = [ProofDataData.init];
wenzelm@5819
  1438
wenzelm@5819
  1439
end;