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