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