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