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