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