src/Pure/Isar/proof_context.ML
author wenzelm
Tue May 16 21:33:18 2006 +0200 (2006-05-16 ago)
changeset 19663 459848022d6e
parent 19585 70a1ce3b23ae
child 19673 853f5a3cc06e
permissions -rw-r--r--
export consts_of;
added add_const_syntax;
tuned interface;
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@19001
     5
The key concept of Isar proof contexts: elevates primitive local
wenzelm@19001
     6
reasoning Gamma |- phi to a structured concept, with generic context
wenzelm@19001
     7
elements, polymorphic abbreviations, and extra-logical data.
wenzelm@5819
     8
*)
wenzelm@5819
     9
wenzelm@5819
    10
signature PROOF_CONTEXT =
wenzelm@5819
    11
sig
wenzelm@17756
    12
  type context (*= Context.proof*)
wenzelm@18672
    13
  type export
wenzelm@5819
    14
  val theory_of: context -> theory
wenzelm@18672
    15
  val init: theory -> context
wenzelm@19387
    16
  val full_name: context -> bstring -> string
wenzelm@19663
    17
  val consts_of: context -> Consts.T
wenzelm@18672
    18
  val set_body: bool -> context -> context
wenzelm@18743
    19
  val restore_body: context -> context -> context
wenzelm@19543
    20
  val set_syntax_mode: string * bool -> context -> context
wenzelm@19543
    21
  val restore_syntax_mode: context -> context -> context
wenzelm@17451
    22
  val assms_of: context -> term list
wenzelm@7557
    23
  val prems_of: context -> thm list
wenzelm@16031
    24
  val fact_index_of: context -> FactIndex.T
wenzelm@18672
    25
  val is_fixed: context -> string -> bool
wenzelm@18672
    26
  val is_known: context -> string -> bool
wenzelm@17072
    27
  val transfer: theory -> context -> context
wenzelm@19019
    28
  val map_theory: (theory -> theory) -> context -> context
wenzelm@14828
    29
  val pretty_term: context -> term -> Pretty.T
wenzelm@14828
    30
  val pretty_typ: context -> typ -> Pretty.T
wenzelm@14828
    31
  val pretty_sort: context -> sort -> Pretty.T
wenzelm@19411
    32
  val pretty_classrel: context -> class list -> Pretty.T
wenzelm@19411
    33
  val pretty_arity: context -> arity -> Pretty.T
wenzelm@14828
    34
  val pp: context -> Pretty.pp
wenzelm@14828
    35
  val pretty_thm: context -> thm -> Pretty.T
wenzelm@14828
    36
  val pretty_thms: context -> thm list -> Pretty.T
wenzelm@14828
    37
  val pretty_fact: context -> string * thm list -> Pretty.T
wenzelm@17072
    38
  val pretty_proof: context -> Proofterm.proof -> Pretty.T
wenzelm@17072
    39
  val pretty_proof_of: context -> bool -> thm -> Pretty.T
wenzelm@17360
    40
  val string_of_typ: context -> typ -> string
wenzelm@14828
    41
  val string_of_term: context -> term -> string
wenzelm@17860
    42
  val string_of_thm: context -> thm -> string
wenzelm@18672
    43
  val used_types: context -> string list
wenzelm@12414
    44
  val default_type: context -> string -> typ option
wenzelm@5819
    45
  val read_typ: context -> string -> typ
wenzelm@16348
    46
  val read_typ_syntax: context -> string -> typ
wenzelm@16348
    47
  val read_typ_abbrev: context -> string -> typ
wenzelm@5819
    48
  val cert_typ: context -> typ -> typ
wenzelm@16348
    49
  val cert_typ_syntax: context -> typ -> typ
wenzelm@16348
    50
  val cert_typ_abbrev: context -> typ -> typ
wenzelm@10583
    51
  val get_skolem: context -> string -> string
wenzelm@18255
    52
  val revert_skolem: context -> string -> string
wenzelm@9133
    53
  val extern_skolem: context -> term -> term
wenzelm@14720
    54
  val read_termTs: context -> (string -> bool) -> (indexname -> typ option)
wenzelm@14720
    55
    -> (indexname -> sort option) -> string list -> (string * typ) list
wenzelm@14720
    56
    -> term list * (indexname * typ) list
wenzelm@14720
    57
  val read_termTs_schematic: context -> (string -> bool) -> (indexname -> typ option)
wenzelm@14720
    58
    -> (indexname -> sort option) -> string list -> (string * typ) list
wenzelm@14720
    59
    -> term list * (indexname * typ) list
wenzelm@18672
    60
  val read_term_legacy: context -> string -> term
wenzelm@5819
    61
  val read_term: context -> string -> term
wenzelm@5819
    62
  val read_prop: context -> string -> term
wenzelm@11925
    63
  val read_prop_schematic: context -> string -> term
wenzelm@8096
    64
  val read_term_pats: typ -> context -> string list -> term list
wenzelm@8096
    65
  val read_prop_pats: context -> string list -> term list
wenzelm@5819
    66
  val cert_term: context -> term -> term
wenzelm@5819
    67
  val cert_prop: context -> term -> term
wenzelm@8096
    68
  val cert_term_pats: typ -> context -> term list -> term list
wenzelm@8096
    69
  val cert_prop_pats: context -> term list -> term list
wenzelm@5819
    70
  val declare_term: term -> context -> context
wenzelm@18770
    71
  val infer_type: context -> string -> typ
wenzelm@18770
    72
  val inferred_param: string -> context -> (string * typ) * context
wenzelm@18770
    73
  val inferred_fixes: context -> (string * typ) list * context
wenzelm@15703
    74
  val read_tyname: context -> string -> typ
wenzelm@15703
    75
  val read_const: context -> string -> term
wenzelm@19019
    76
  val rename_frees: context -> term list -> (string * 'a) list -> (string * 'a) list
wenzelm@7925
    77
  val warn_extra_tfrees: context -> context -> context
wenzelm@12550
    78
  val generalize: context -> context -> term list -> term list
wenzelm@19270
    79
  val monomorphic: context -> term list -> term list
wenzelm@19001
    80
  val polymorphic: context -> term list -> term list
wenzelm@19270
    81
  val hidden_polymorphism: term -> typ -> (indexname * sort) list
wenzelm@18785
    82
  val export_standard: context -> context -> thm -> thm
wenzelm@18042
    83
  val exports: context -> context -> thm -> thm Seq.seq
wenzelm@18042
    84
  val goal_exports: context -> context -> thm -> thm Seq.seq
wenzelm@10810
    85
  val drop_schematic: indexname * term option -> indexname * term option
wenzelm@10810
    86
  val add_binds: (indexname * string option) list -> context -> context
wenzelm@10810
    87
  val add_binds_i: (indexname * term option) list -> context -> context
wenzelm@12147
    88
  val auto_bind_goal: term list -> context -> context
wenzelm@12147
    89
  val auto_bind_facts: term list -> context -> context
wenzelm@18310
    90
  val match_bind: bool -> (string list * string) list -> context -> term list * context
wenzelm@18310
    91
  val match_bind_i: bool -> (term list * term) list -> context -> term list * context
wenzelm@19585
    92
  val read_propp: context * (string * string list) list list
wenzelm@19585
    93
    -> context * (term * term list) list list
wenzelm@19585
    94
  val cert_propp: context * (term * term list) list list
wenzelm@19585
    95
    -> context * (term * term list) list list
wenzelm@19585
    96
  val read_propp_schematic: context * (string * string list) list list
wenzelm@19585
    97
    -> context * (term * term list) list list
wenzelm@19585
    98
  val cert_propp_schematic: context * (term * term list) list list
wenzelm@19585
    99
    -> context * (term * term list) list list
wenzelm@19585
   100
  val bind_propp: context * (string * string list) list list
wenzelm@10465
   101
    -> context * (term list list * (context -> context))
wenzelm@19585
   102
  val bind_propp_i: context * (term * term list) list list
wenzelm@10465
   103
    -> context * (term list list * (context -> context))
wenzelm@19585
   104
  val bind_propp_schematic: context * (string * string list) list list
wenzelm@10554
   105
    -> context * (term list list * (context -> context))
wenzelm@19585
   106
  val bind_propp_schematic_i: context * (term * term list) list list
wenzelm@10554
   107
    -> context * (term list list * (context -> context))
wenzelm@18042
   108
  val fact_tac: thm list -> int -> tactic
wenzelm@18042
   109
  val some_fact_tac: context -> int -> tactic
berghofe@15456
   110
  val get_thm: context -> thmref -> thm
berghofe@15456
   111
  val get_thm_closure: context -> thmref -> thm
berghofe@15456
   112
  val get_thms: context -> thmref -> thm list
berghofe@15456
   113
  val get_thms_closure: context -> thmref -> thm list
wenzelm@16031
   114
  val valid_thms: context -> string * thm list -> bool
wenzelm@16031
   115
  val lthms_containing: context -> FactIndex.spec -> (string * thm list) list
wenzelm@16348
   116
  val extern_thm: context -> string -> xstring
wenzelm@19019
   117
  val no_base_names: context -> context
wenzelm@16147
   118
  val qualified_names: context -> context
wenzelm@19062
   119
  val sticky_prefix: string -> context -> context
wenzelm@16147
   120
  val restore_naming: context -> context -> context
wenzelm@13425
   121
  val hide_thms: bool -> string list -> context -> context
wenzelm@19079
   122
  val put_thms: bool -> string * thm list option -> context -> context
wenzelm@19079
   123
  val put_thms_internal: string * thm list option -> context -> context
wenzelm@14564
   124
  val note_thmss:
wenzelm@18728
   125
    ((bstring * attribute list) * (thmref * attribute list) list) list ->
wenzelm@17860
   126
      context -> (bstring * thm list) list * context
wenzelm@14564
   127
  val note_thmss_i:
wenzelm@18728
   128
    ((bstring * attribute list) * (thm list * attribute list) list) list ->
wenzelm@17860
   129
      context -> (bstring * thm list) list * context
wenzelm@18672
   130
  val read_vars: (string * string option * mixfix) list -> context ->
wenzelm@18672
   131
    (string * typ option * mixfix) list * context
wenzelm@18672
   132
  val cert_vars: (string * typ option * mixfix) list -> context ->
wenzelm@18672
   133
    (string * typ option * mixfix) list * context
wenzelm@18672
   134
  val read_vars_legacy: (string * string option * mixfix) list -> context ->
wenzelm@18672
   135
    (string * typ option * mixfix) list * context
wenzelm@18672
   136
  val cert_vars_legacy: (string * typ option * mixfix) list -> context ->
wenzelm@18672
   137
    (string * typ option * mixfix) list * context
wenzelm@18672
   138
  val add_fixes: (string * string option * mixfix) list -> context -> string list * context
wenzelm@18672
   139
  val add_fixes_i: (string * typ option * mixfix) list -> context -> string list * context
wenzelm@18672
   140
  val add_fixes_legacy: (string * typ option * mixfix) list -> context -> string list * context
wenzelm@18809
   141
  val invent_fixes: string list -> context -> string list * context
wenzelm@18672
   142
  val fix_frees: term -> context -> context
wenzelm@18672
   143
  val auto_fixes: context * (term list list * 'a) -> context * (term list list * 'a)
wenzelm@18672
   144
  val bind_fixes: string list -> context -> (term -> term) * context
wenzelm@18672
   145
  val add_assms: export ->
wenzelm@19585
   146
    ((string * attribute list) * (string * string list) list) list ->
wenzelm@18672
   147
    context -> (bstring * thm list) list * context
wenzelm@18672
   148
  val add_assms_i: export ->
wenzelm@19585
   149
    ((string * attribute list) * (term * term list) list) list ->
wenzelm@18672
   150
    context -> (bstring * thm list) list * context
wenzelm@18672
   151
  val assume_export: export
wenzelm@18672
   152
  val presume_export: export
wenzelm@17360
   153
  val add_view: context -> cterm list -> context -> context
wenzelm@18042
   154
  val export_view: cterm list -> context -> context -> thm -> thm
wenzelm@18609
   155
  val add_cases: bool -> (string * RuleCases.T option) list -> context -> context
wenzelm@18609
   156
  val apply_case: RuleCases.T -> context -> (string * term list) list * context
wenzelm@16147
   157
  val get_case: context -> string -> string option list -> RuleCases.T
wenzelm@19371
   158
  val expand_abbrevs: bool -> context -> context
wenzelm@19663
   159
  val add_const_syntax: string * bool -> (string * mixfix) list -> context -> context
wenzelm@19663
   160
  val add_abbrevs: string * bool -> (bstring * term * mixfix) list -> context -> context
wenzelm@10810
   161
  val verbose: bool ref
wenzelm@10810
   162
  val setmp_verbose: ('a -> 'b) -> 'a -> 'b
wenzelm@12072
   163
  val print_syntax: context -> unit
wenzelm@10810
   164
  val print_binds: context -> unit
wenzelm@12057
   165
  val print_lthms: context -> unit
wenzelm@10810
   166
  val print_cases: context -> unit
wenzelm@10810
   167
  val prems_limit: int ref
wenzelm@18672
   168
  val pretty_ctxt: context -> Pretty.T list
wenzelm@10810
   169
  val pretty_context: context -> Pretty.T list
wenzelm@18809
   170
  val debug: bool ref
wenzelm@18809
   171
  val pprint_context: context -> pprint_args -> unit
wenzelm@5819
   172
end;
wenzelm@5819
   173
wenzelm@16540
   174
structure ProofContext: PROOF_CONTEXT =
wenzelm@5819
   175
struct
wenzelm@5819
   176
wenzelm@16540
   177
type context = Context.proof;
wenzelm@5819
   178
wenzelm@16540
   179
val theory_of = Context.theory_of_proof;
wenzelm@19001
   180
val tsig_of = Sign.tsig_of o theory_of;
wenzelm@19001
   181
wenzelm@16540
   182
val init = Context.init_proof;
wenzelm@12057
   183
wenzelm@7270
   184
wenzelm@5819
   185
wenzelm@16540
   186
(** Isar proof context information **)
wenzelm@5819
   187
wenzelm@18672
   188
type export = bool -> cterm list -> thm -> thm Seq.seq;
wenzelm@5819
   189
wenzelm@16540
   190
datatype ctxt =
wenzelm@16540
   191
  Ctxt of
wenzelm@19001
   192
   {naming: NameSpace.naming,                     (*local naming conventions*)
wenzelm@19001
   193
    syntax: LocalSyntax.T,                        (*local syntax*)
wenzelm@19033
   194
    consts: Consts.T * Consts.T,                  (*global/local consts*)
wenzelm@19001
   195
    fixes: bool * (string * string) list,         (*fixes: !!x. _ with proof body flag*)
wenzelm@18672
   196
    assms:
wenzelm@19001
   197
      ((cterm list * export) list *               (*assumes and views: A ==> _*)
wenzelm@19001
   198
        (string * thm list) list),                (*prems: A |- A*)
wenzelm@19001
   199
    binds: (typ * term) Vartab.table,             (*term bindings*)
wenzelm@19001
   200
    thms: thm list NameSpace.table * FactIndex.T, (*local thms*)
wenzelm@19001
   201
    cases: (string * (RuleCases.T * bool)) list,  (*local contexts*)
wenzelm@18672
   202
    defaults:
wenzelm@19001
   203
      typ Vartab.table *                          (*type constraints*)
wenzelm@19001
   204
      sort Vartab.table *                         (*default sorts*)
wenzelm@19001
   205
      string list *                               (*used type variables*)
wenzelm@19001
   206
      term list Symtab.table};                    (*type variable occurrences*)
wenzelm@5819
   207
wenzelm@19001
   208
fun make_ctxt (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults) =
wenzelm@19001
   209
  Ctxt {naming = naming, syntax = syntax, consts = consts, fixes = fixes, assms = assms,
wenzelm@19001
   210
    binds = binds, thms = thms, cases = cases, defaults = defaults};
wenzelm@5819
   211
wenzelm@19079
   212
val local_naming = NameSpace.default_naming |> NameSpace.add_path "local";
wenzelm@19079
   213
wenzelm@16540
   214
structure ContextData = ProofDataFun
wenzelm@18672
   215
(
wenzelm@16540
   216
  val name = "Isar/context";
wenzelm@16540
   217
  type T = ctxt;
wenzelm@16540
   218
  fun init thy =
wenzelm@19079
   219
    make_ctxt (local_naming, LocalSyntax.init thy,
wenzelm@19033
   220
      (Sign.consts_of thy, Sign.consts_of thy), (false, []), ([], []),
wenzelm@19033
   221
      Vartab.empty, (NameSpace.empty_table, FactIndex.empty), [],
wenzelm@16540
   222
      (Vartab.empty, Vartab.empty, [], Symtab.empty));
wenzelm@16540
   223
  fun print _ _ = ();
wenzelm@18672
   224
);
wenzelm@5819
   225
wenzelm@18708
   226
val _ = Context.add_setup ContextData.init;
wenzelm@5819
   227
wenzelm@16540
   228
fun rep_context ctxt = ContextData.get ctxt |> (fn Ctxt args => args);
wenzelm@5819
   229
wenzelm@18672
   230
fun map_context f =
wenzelm@19001
   231
  ContextData.map (fn Ctxt {naming, syntax, consts, fixes, assms, binds, thms, cases, defaults} =>
wenzelm@19001
   232
    make_ctxt (f (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults)));
wenzelm@18672
   233
wenzelm@19001
   234
fun map_naming f =
wenzelm@19001
   235
  map_context (fn (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults) =>
wenzelm@19001
   236
    (f naming, syntax, consts, fixes, assms, binds, thms, cases, defaults));
wenzelm@18672
   237
wenzelm@19001
   238
fun map_syntax f =
wenzelm@19001
   239
  map_context (fn (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults) =>
wenzelm@19001
   240
    (naming, f syntax, consts, fixes, assms, binds, thms, cases, defaults));
wenzelm@18672
   241
wenzelm@19001
   242
fun map_consts f =
wenzelm@19001
   243
  map_context (fn (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults) =>
wenzelm@19001
   244
    (naming, syntax, f consts, fixes, assms, binds, thms, cases, defaults));
wenzelm@19001
   245
wenzelm@19001
   246
fun map_fixes f =
wenzelm@19001
   247
  map_context (fn (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults) =>
wenzelm@19001
   248
    (naming, syntax, consts, f fixes, assms, binds, thms, cases, defaults));
wenzelm@18971
   249
wenzelm@19001
   250
fun map_assms f =
wenzelm@19001
   251
  map_context (fn (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults) =>
wenzelm@19001
   252
    (naming, syntax, consts, fixes, f assms, binds, thms, cases, defaults));
wenzelm@18672
   253
wenzelm@19001
   254
fun map_binds f =
wenzelm@19001
   255
  map_context (fn (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults) =>
wenzelm@19001
   256
    (naming, syntax, consts, fixes, assms, f binds, thms, cases, defaults));
wenzelm@18672
   257
wenzelm@19001
   258
fun map_thms f =
wenzelm@19001
   259
  map_context (fn (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults) =>
wenzelm@19001
   260
    (naming, syntax, consts, fixes, assms, binds, f thms, cases, defaults));
wenzelm@18672
   261
wenzelm@19001
   262
fun map_cases f =
wenzelm@19001
   263
  map_context (fn (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults) =>
wenzelm@19001
   264
    (naming, syntax, consts, fixes, assms, binds, thms, f cases, defaults));
wenzelm@18672
   265
wenzelm@19001
   266
fun map_defaults f =
wenzelm@19001
   267
  map_context (fn (naming, syntax, consts, fixes, assms, binds, thms, cases, defaults) =>
wenzelm@19001
   268
    (naming, syntax, consts, fixes, assms, binds, thms, cases, f defaults));
wenzelm@19001
   269
wenzelm@19001
   270
val naming_of = #naming o rep_context;
wenzelm@19387
   271
val full_name = NameSpace.full o naming_of;
wenzelm@5819
   272
wenzelm@16540
   273
val syntax_of = #syntax o rep_context;
wenzelm@19001
   274
val syn_of = LocalSyntax.syn_of o syntax_of;
wenzelm@19543
   275
val set_syntax_mode = map_syntax o LocalSyntax.set_mode;
wenzelm@19543
   276
val restore_syntax_mode = map_syntax o LocalSyntax.restore_mode o syntax_of;
wenzelm@19001
   277
wenzelm@19033
   278
val consts_of = #2 o #consts o rep_context;
wenzelm@5819
   279
wenzelm@18672
   280
val is_body = #1 o #fixes o rep_context;
wenzelm@18672
   281
fun set_body b = map_fixes (fn (_, fixes) => (b, fixes));
wenzelm@18743
   282
fun restore_body ctxt = set_body (is_body ctxt);
wenzelm@18672
   283
wenzelm@18672
   284
val fixes_of = #2 o #fixes o rep_context;
wenzelm@18672
   285
val fixed_names_of = map #2 o fixes_of;
wenzelm@18672
   286
wenzelm@18672
   287
val assumptions_of = #1 o #assms o rep_context;
wenzelm@19482
   288
val assms_of = map Thm.term_of o maps #1 o assumptions_of;
wenzelm@19482
   289
val prems_of = maps #2 o #2 o #assms o rep_context;
wenzelm@5819
   290
wenzelm@17860
   291
val binds_of = #binds o rep_context;
wenzelm@5819
   292
wenzelm@16540
   293
val thms_of = #thms o rep_context;
wenzelm@19001
   294
val fact_index_of = #2 o thms_of;
wenzelm@16540
   295
wenzelm@16540
   296
val cases_of = #cases o rep_context;
wenzelm@5819
   297
wenzelm@18672
   298
val defaults_of = #defaults o rep_context;
wenzelm@16540
   299
val type_occs_of = #4 o defaults_of;
wenzelm@5819
   300
wenzelm@19019
   301
fun is_fixed ctxt x = exists (fn (_, y) => x = y) (fixes_of ctxt);
wenzelm@16894
   302
fun is_known ctxt x = Vartab.defined (#1 (defaults_of ctxt)) (x, ~1) orelse is_fixed ctxt x;
wenzelm@5819
   303
wenzelm@5819
   304
wenzelm@19001
   305
(* transfer *)
wenzelm@12093
   306
wenzelm@19001
   307
fun transfer_syntax thy =
wenzelm@19001
   308
  map_syntax (LocalSyntax.rebuild thy) #>
wenzelm@19033
   309
  map_consts (fn consts as (global_consts, local_consts) =>
wenzelm@19033
   310
    let val thy_consts = Sign.consts_of thy in
wenzelm@19033
   311
      if Consts.eq_consts (thy_consts, global_consts) then consts
wenzelm@19033
   312
      else (thy_consts, Consts.merge (thy_consts, local_consts))
wenzelm@19033
   313
    end);
wenzelm@17072
   314
wenzelm@19001
   315
fun transfer thy = Context.transfer_proof thy #> transfer_syntax thy;
wenzelm@17072
   316
wenzelm@19019
   317
fun map_theory f ctxt = transfer (f (theory_of ctxt)) ctxt;
wenzelm@19019
   318
wenzelm@12093
   319
wenzelm@12093
   320
wenzelm@14828
   321
(** pretty printing **)
wenzelm@14828
   322
wenzelm@19310
   323
local
wenzelm@19310
   324
wenzelm@19371
   325
fun rewrite_term thy rews t =
wenzelm@19371
   326
  if can Term.type_of t then Pattern.rewrite_term thy rews [] t
wenzelm@19371
   327
  else (warning "Printing ill-typed term -- cannot expand abbreviations"; t);
wenzelm@19371
   328
wenzelm@19001
   329
fun pretty_term' abbrevs ctxt t =
wenzelm@18971
   330
  let
wenzelm@19001
   331
    val thy = theory_of ctxt;
wenzelm@19001
   332
    val syntax = syntax_of ctxt;
wenzelm@18971
   333
    val consts = consts_of ctxt;
wenzelm@19001
   334
    val t' = t
wenzelm@19371
   335
      |> K abbrevs ? rewrite_term thy (Consts.abbrevs_of consts (! print_mode @ [""]))
wenzelm@19371
   336
      |> Sign.extern_term (Consts.extern_early consts) thy
wenzelm@19371
   337
      |> LocalSyntax.extern_term syntax;
wenzelm@19371
   338
  in
wenzelm@19371
   339
    Sign.pretty_term' (Context.Proof ctxt) (LocalSyntax.syn_of syntax) (Consts.extern consts) t'
wenzelm@19371
   340
  end;
wenzelm@18971
   341
wenzelm@19310
   342
in
wenzelm@19310
   343
wenzelm@19001
   344
val pretty_term = pretty_term' true;
wenzelm@19310
   345
val pretty_term_no_abbrevs = pretty_term' false;
wenzelm@19310
   346
wenzelm@19310
   347
end;
wenzelm@19310
   348
wenzelm@16458
   349
fun pretty_typ ctxt T = Sign.pretty_typ (theory_of ctxt) T;
wenzelm@16458
   350
fun pretty_sort ctxt S = Sign.pretty_sort (theory_of ctxt) S;
wenzelm@16458
   351
fun pretty_classrel ctxt cs = Sign.pretty_classrel (theory_of ctxt) cs;
wenzelm@16458
   352
fun pretty_arity ctxt ar = Sign.pretty_arity (theory_of ctxt) ar;
wenzelm@14828
   353
wenzelm@14974
   354
fun pp ctxt = Pretty.pp (pretty_term ctxt, pretty_typ ctxt, pretty_sort ctxt,
wenzelm@14974
   355
  pretty_classrel ctxt, pretty_arity ctxt);
wenzelm@14828
   356
wenzelm@17451
   357
fun pretty_thm ctxt th =
wenzelm@17451
   358
  Display.pretty_thm_aux (pp ctxt) false true (assms_of ctxt) th;
wenzelm@14828
   359
wenzelm@14828
   360
fun pretty_thms ctxt [th] = pretty_thm ctxt th
wenzelm@14828
   361
  | pretty_thms ctxt ths = Pretty.blk (0, Pretty.fbreaks (map (pretty_thm ctxt) ths));
wenzelm@14828
   362
wenzelm@14828
   363
fun pretty_fact ctxt ("", ths) = pretty_thms ctxt ths
wenzelm@14828
   364
  | pretty_fact ctxt (a, [th]) =
wenzelm@14828
   365
      Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, pretty_thm ctxt th]
wenzelm@14828
   366
  | pretty_fact ctxt (a, ths) =
wenzelm@14828
   367
      Pretty.block (Pretty.fbreaks (Pretty.str (a ^ ":") :: map (pretty_thm ctxt) ths));
wenzelm@14828
   368
wenzelm@17072
   369
fun pretty_proof ctxt prf =
wenzelm@19310
   370
  pretty_term_no_abbrevs (ctxt |> transfer_syntax (ProofSyntax.proof_syntax prf (theory_of ctxt)))
wenzelm@17072
   371
    (ProofSyntax.term_of_proof prf);
wenzelm@17072
   372
wenzelm@17072
   373
fun pretty_proof_of ctxt full th =
wenzelm@17072
   374
  pretty_proof ctxt (ProofSyntax.proof_of full th);
wenzelm@17072
   375
wenzelm@17860
   376
val string_of_typ = Pretty.string_of oo pretty_typ;
wenzelm@17860
   377
val string_of_term = Pretty.string_of oo pretty_term;
wenzelm@17860
   378
val string_of_thm = Pretty.string_of oo pretty_thm;
wenzelm@17860
   379
wenzelm@14828
   380
wenzelm@14828
   381
wenzelm@7663
   382
(** default sorts and types **)
wenzelm@7663
   383
wenzelm@17412
   384
val def_sort = Vartab.lookup o #2 o defaults_of;
wenzelm@7663
   385
wenzelm@16540
   386
fun def_type ctxt pattern xi =
wenzelm@18672
   387
  let val {binds, defaults = (types, _, _, _), ...} = rep_context ctxt in
wenzelm@17412
   388
    (case Vartab.lookup types xi of
wenzelm@16540
   389
      NONE =>
wenzelm@16540
   390
        if pattern then NONE
wenzelm@18953
   391
        else Vartab.lookup binds xi |> Option.map (TypeInfer.polymorphicT o #1)
wenzelm@16540
   392
    | some => some)
wenzelm@16540
   393
  end;
wenzelm@7663
   394
wenzelm@18672
   395
val used_types = #3 o defaults_of;
wenzelm@18672
   396
wenzelm@17412
   397
fun default_type ctxt x = Vartab.lookup (#1 (defaults_of ctxt)) (x, ~1);
wenzelm@12414
   398
wenzelm@7663
   399
wenzelm@5819
   400
wenzelm@5819
   401
(** prepare types **)
wenzelm@5819
   402
wenzelm@9504
   403
local
wenzelm@9504
   404
wenzelm@9504
   405
fun read_typ_aux read ctxt s =
wenzelm@18857
   406
  read (syn_of ctxt) (Context.Proof ctxt) (def_sort ctxt) s;
wenzelm@5819
   407
wenzelm@10554
   408
fun cert_typ_aux cert ctxt raw_T =
wenzelm@18678
   409
  cert (theory_of ctxt) raw_T handle TYPE (msg, _, _) => error msg;
wenzelm@9504
   410
wenzelm@9504
   411
in
wenzelm@9504
   412
wenzelm@16348
   413
val read_typ        = read_typ_aux Sign.read_typ';
wenzelm@16348
   414
val read_typ_syntax = read_typ_aux Sign.read_typ_syntax';
wenzelm@16348
   415
val read_typ_abbrev = read_typ_aux Sign.read_typ_abbrev';
wenzelm@16348
   416
val cert_typ        = cert_typ_aux Sign.certify_typ;
wenzelm@16348
   417
val cert_typ_syntax = cert_typ_aux Sign.certify_typ_syntax;
wenzelm@16348
   418
val cert_typ_abbrev = cert_typ_aux Sign.certify_typ_abbrev;
wenzelm@9504
   419
wenzelm@9504
   420
end;
wenzelm@9504
   421
wenzelm@5819
   422
wenzelm@7679
   423
(* internalize Skolem constants *)
wenzelm@7679
   424
wenzelm@17184
   425
val lookup_skolem = AList.lookup (op =) o fixes_of;
wenzelm@18187
   426
fun get_skolem ctxt x = the_default x (lookup_skolem ctxt x);
wenzelm@7679
   427
wenzelm@18678
   428
fun no_skolem internal x =
wenzelm@9291
   429
  if can Syntax.dest_skolem x then
wenzelm@18678
   430
    error ("Illegal reference to internal Skolem constant: " ^ quote x)
wenzelm@12504
   431
  else if not internal andalso can Syntax.dest_internal x then
wenzelm@18678
   432
    error ("Illegal reference to internal variable: " ^ quote x)
wenzelm@7679
   433
  else x;
wenzelm@7679
   434
wenzelm@14720
   435
fun intern_skolem ctxt internal =
wenzelm@7679
   436
  let
wenzelm@7679
   437
    fun intern (t as Free (x, T)) =
wenzelm@14720
   438
          if internal x then t
wenzelm@14720
   439
          else
wenzelm@18678
   440
            (case lookup_skolem ctxt (no_skolem false x) of
skalberg@15531
   441
              SOME x' => Free (x', T)
skalberg@15531
   442
            | NONE => t)
wenzelm@7679
   443
      | intern (t $ u) = intern t $ intern u
wenzelm@7679
   444
      | intern (Abs (x, T, t)) = Abs (x, T, intern t)
wenzelm@7679
   445
      | intern a = a;
wenzelm@7679
   446
  in intern end;
wenzelm@7679
   447
wenzelm@7679
   448
wenzelm@18187
   449
(* externalize Skolem constants -- approximation only! *)
wenzelm@18187
   450
wenzelm@18255
   451
fun rev_skolem ctxt =
wenzelm@18187
   452
  let val rev_fixes = map Library.swap (fixes_of ctxt)
wenzelm@18187
   453
  in AList.lookup (op =) rev_fixes end;
wenzelm@9133
   454
wenzelm@18255
   455
fun revert_skolem ctxt x =
wenzelm@18255
   456
  (case rev_skolem ctxt x of
wenzelm@18255
   457
    SOME x' => x'
wenzelm@18375
   458
  | NONE => perhaps (try Syntax.dest_skolem) x);
wenzelm@18255
   459
wenzelm@9133
   460
fun extern_skolem ctxt =
wenzelm@9133
   461
  let
wenzelm@18255
   462
    val revert = rev_skolem ctxt;
wenzelm@9133
   463
    fun extern (t as Free (x, T)) =
wenzelm@18187
   464
        (case revert x of
wenzelm@18187
   465
          SOME x' => Free (if lookup_skolem ctxt x' = SOME x then x' else NameSpace.hidden x', T)
wenzelm@18187
   466
        | NONE => t)
wenzelm@9133
   467
      | extern (t $ u) = extern t $ extern u
wenzelm@9133
   468
      | extern (Abs (x, T, t)) = Abs (x, T, extern t)
wenzelm@9133
   469
      | extern a = a;
wenzelm@9133
   470
  in extern end
wenzelm@9133
   471
wenzelm@8096
   472
wenzelm@18187
   473
wenzelm@5819
   474
(** prepare terms and propositions **)
wenzelm@5819
   475
wenzelm@5819
   476
(*
wenzelm@16501
   477
  (1) read / certify wrt. theory of context
wenzelm@5819
   478
  (2) intern Skolem constants
wenzelm@5819
   479
  (3) expand term bindings
wenzelm@5819
   480
*)
wenzelm@5819
   481
wenzelm@5819
   482
wenzelm@16501
   483
(* read wrt. theory *)     (*exception ERROR*)
wenzelm@5819
   484
wenzelm@18857
   485
fun read_def_termTs freeze pp syn ctxt (types, sorts, used) sTs =
wenzelm@18971
   486
  Sign.read_def_terms' pp (Sign.is_logtype (theory_of ctxt)) syn (consts_of ctxt)
wenzelm@18857
   487
    (Context.Proof ctxt) (types, sorts) used freeze sTs;
wenzelm@5874
   488
wenzelm@18857
   489
fun read_def_termT freeze pp syn ctxt defaults sT =
wenzelm@18857
   490
  apfst hd (read_def_termTs freeze pp syn ctxt defaults [sT]);
wenzelm@14828
   491
wenzelm@18672
   492
fun read_term_thy freeze pp syn thy defaults s =
wenzelm@18672
   493
  #1 (read_def_termT freeze pp syn thy defaults (s, TypeInfer.logicT));
wenzelm@5874
   494
wenzelm@18672
   495
fun read_prop_thy freeze pp syn thy defaults s =
wenzelm@18672
   496
  #1 (read_def_termT freeze pp syn thy defaults (s, propT));
wenzelm@12072
   497
wenzelm@18672
   498
fun read_terms_thy freeze pp syn thy defaults =
wenzelm@18672
   499
  #1 o read_def_termTs freeze pp syn thy defaults o map (rpair TypeInfer.logicT);
wenzelm@12072
   500
wenzelm@18672
   501
fun read_props_thy freeze pp syn thy defaults =
wenzelm@18672
   502
  #1 o read_def_termTs freeze pp syn thy defaults o map (rpair propT);
wenzelm@5819
   503
wenzelm@5819
   504
wenzelm@19001
   505
(* local abbreviations *)
wenzelm@5819
   506
wenzelm@19371
   507
fun certify_consts ctxt =
wenzelm@19001
   508
  Consts.certify (pp ctxt) (tsig_of ctxt) (consts_of ctxt);
wenzelm@19001
   509
wenzelm@19001
   510
fun expand_binds ctxt schematic =
wenzelm@5819
   511
  let
wenzelm@18971
   512
    val binds = binds_of ctxt;
wenzelm@5819
   513
wenzelm@19001
   514
    fun expand_var (xi, T) =
wenzelm@18971
   515
      (case Vartab.lookup binds xi of
wenzelm@19422
   516
        SOME t => Envir.expand_atom T t
wenzelm@18971
   517
      | NONE =>
wenzelm@18971
   518
          if schematic then Var (xi, T)
wenzelm@18971
   519
          else error ("Unbound schematic variable: " ^ Syntax.string_of_vname xi));
wenzelm@19001
   520
  in Envir.beta_norm o Term.map_aterms (fn Var v => expand_var v | a => a) end;
wenzelm@5819
   521
wenzelm@5819
   522
wenzelm@6550
   523
(* dummy patterns *)
wenzelm@6550
   524
wenzelm@18310
   525
val prepare_dummies =
wenzelm@18310
   526
  let val next = ref 1 in
wenzelm@18310
   527
    fn t =>
wenzelm@18310
   528
      let val (i, u) = Term.replace_dummy_patterns (! next, t)
wenzelm@18310
   529
      in next := i; u end
wenzelm@18310
   530
  end;
wenzelm@6762
   531
wenzelm@18678
   532
fun reject_dummies t = Term.no_dummy_patterns t
wenzelm@18678
   533
  handle TERM _ => error "Illegal dummy pattern(s) in term";
wenzelm@6550
   534
wenzelm@6550
   535
wenzelm@5819
   536
(* read terms *)
wenzelm@5819
   537
wenzelm@10554
   538
local
wenzelm@10554
   539
skalberg@15531
   540
fun append_env e1 e2 x = (case e2 x of NONE => e1 x | some => some);
wenzelm@14720
   541
wenzelm@16031
   542
fun gen_read' read app pattern schematic
wenzelm@14720
   543
    ctxt internal more_types more_sorts more_used s =
ballarin@14174
   544
  let
wenzelm@14720
   545
    val types = append_env (def_type ctxt pattern) more_types;
wenzelm@14720
   546
    val sorts = append_env (def_sort ctxt) more_sorts;
wenzelm@14720
   547
    val used = used_types ctxt @ more_used;
ballarin@14174
   548
  in
wenzelm@18857
   549
    (read (pp ctxt) (syn_of ctxt) ctxt (types, sorts, used) s
wenzelm@18678
   550
      handle TERM (msg, _) => error msg)
wenzelm@14720
   551
    |> app (intern_skolem ctxt internal)
wenzelm@19371
   552
    |> app (certify_consts ctxt)
wenzelm@19001
   553
    |> app (if pattern then I else expand_binds ctxt schematic)
wenzelm@18678
   554
    |> app (if pattern then prepare_dummies else reject_dummies)
wenzelm@14720
   555
  end;
wenzelm@14720
   556
wenzelm@16031
   557
fun gen_read read app pattern schematic ctxt =
wenzelm@16031
   558
  gen_read' read app pattern schematic ctxt (K false) (K NONE) (K NONE) [];
wenzelm@14720
   559
wenzelm@10554
   560
in
wenzelm@10554
   561
wenzelm@16031
   562
val read_termTs           = gen_read' (read_def_termTs false) (apfst o map) false false;
wenzelm@16031
   563
val read_termTs_schematic = gen_read' (read_def_termTs false) (apfst o map) false true;
wenzelm@8096
   564
wenzelm@14720
   565
fun read_term_pats T ctxt =
wenzelm@16031
   566
  #1 o gen_read (read_def_termTs false) (apfst o map) true false ctxt o map (rpair T);
wenzelm@8096
   567
val read_prop_pats = read_term_pats propT;
wenzelm@8096
   568
wenzelm@18672
   569
fun read_term_legacy ctxt =
wenzelm@16458
   570
  gen_read' (read_term_thy true) I false false ctxt (K true) (K NONE) (K NONE) [];
wenzelm@14720
   571
wenzelm@19143
   572
val read_term            = gen_read (read_term_thy true) I false false;
wenzelm@19143
   573
val read_prop            = gen_read (read_prop_thy true) I false false;
wenzelm@19143
   574
val read_prop_schematic  = gen_read (read_prop_thy true) I false true;
wenzelm@19143
   575
val read_terms           = gen_read (read_terms_thy true) map false false;
wenzelm@19143
   576
fun read_props schematic = gen_read (read_props_thy true) map false schematic;
wenzelm@5819
   577
wenzelm@10554
   578
end;
wenzelm@10554
   579
wenzelm@5819
   580
wenzelm@5819
   581
(* certify terms *)
wenzelm@5819
   582
wenzelm@19371
   583
val test = ref (NONE: (context * term) option);
wenzelm@19371
   584
wenzelm@10554
   585
local
wenzelm@10554
   586
wenzelm@18971
   587
fun gen_cert prop pattern schematic ctxt t = t
wenzelm@19371
   588
  |> certify_consts ctxt
wenzelm@19001
   589
  |> (if pattern then I else expand_binds ctxt schematic)
wenzelm@19371
   590
  |> (fn t' => #1 (Sign.certify' false prop (pp ctxt) (consts_of ctxt) (theory_of ctxt) t')
wenzelm@18678
   591
    handle TYPE (msg, _, _) => error msg
wenzelm@18678
   592
      | TERM (msg, _) => error msg);
wenzelm@16501
   593
wenzelm@10554
   594
in
wenzelm@8096
   595
wenzelm@18971
   596
val cert_term = gen_cert false false false;
wenzelm@18971
   597
val cert_prop = gen_cert true false false;
wenzelm@18971
   598
val cert_props = map oo gen_cert true false;
wenzelm@10554
   599
wenzelm@18971
   600
fun cert_term_pats _ = map o gen_cert false true false;
wenzelm@18971
   601
val cert_prop_pats = map o gen_cert true true false;
wenzelm@10554
   602
wenzelm@10554
   603
end;
wenzelm@5819
   604
wenzelm@5819
   605
wenzelm@5819
   606
(* declare terms *)
wenzelm@5819
   607
wenzelm@10381
   608
local
wenzelm@10381
   609
wenzelm@16861
   610
val ins_types = fold_aterms
wenzelm@17412
   611
  (fn Free (x, T) => Vartab.update ((x, ~1), T)
wenzelm@17412
   612
    | Var v => Vartab.update v
wenzelm@16861
   613
    | _ => I);
wenzelm@5819
   614
wenzelm@16861
   615
val ins_sorts = fold_types (fold_atyps
wenzelm@19079
   616
  (fn TFree (x, S) => Vartab.update ((x, ~1), S)
wenzelm@19079
   617
    | TVar v => Vartab.update v
wenzelm@16861
   618
    | _ => I));
wenzelm@5819
   619
wenzelm@16861
   620
val ins_used = fold_term_types (fn t =>
wenzelm@16861
   621
  fold_atyps (fn TFree (x, _) => insert (op =) x | _ => I));
wenzelm@12291
   622
wenzelm@16861
   623
val ins_occs = fold_term_types (fn t =>
wenzelm@18953
   624
  fold_atyps (fn TFree (x, _) => Symtab.update_list (x, t) | _ => I));
wenzelm@5819
   625
wenzelm@16861
   626
fun ins_skolem def_ty = fold_rev (fn (x, x') =>
wenzelm@16861
   627
  (case def_ty x' of
wenzelm@17412
   628
    SOME T => Vartab.update ((x, ~1), T)
wenzelm@16861
   629
  | NONE => I));
wenzelm@5994
   630
wenzelm@16031
   631
in
wenzelm@16031
   632
wenzelm@19079
   633
fun declare_syntax t = map_defaults (fn (types, sorts, used, occ) =>
wenzelm@19079
   634
 (ins_types t types,
wenzelm@19079
   635
  ins_sorts t sorts,
wenzelm@19079
   636
  ins_used t used,
wenzelm@19079
   637
  occ));
wenzelm@10381
   638
wenzelm@19001
   639
fun declare_var (x, opt_T, mx) ctxt =
wenzelm@19001
   640
  let val T = (case opt_T of SOME T => T | NONE => TypeInfer.mixfixT mx)
wenzelm@19001
   641
  in ((x, T, mx), ctxt |> declare_syntax (Free (x, T))) end;
wenzelm@18672
   642
wenzelm@16540
   643
fun declare_term t ctxt =
wenzelm@16031
   644
  ctxt
wenzelm@18672
   645
  |> declare_syntax t
wenzelm@12291
   646
  |> map_defaults (fn (types, sorts, used, occ) =>
wenzelm@19079
   647
     (ins_skolem (fn x => Vartab.lookup types (x, ~1)) (fixes_of ctxt) types,
wenzelm@19079
   648
      sorts,
wenzelm@19079
   649
      used,
wenzelm@19079
   650
      ins_occs t occ));
wenzelm@5819
   651
wenzelm@18770
   652
end;
wenzelm@18770
   653
wenzelm@18770
   654
wenzelm@18770
   655
(* inferred types of parameters *)
wenzelm@18770
   656
wenzelm@18770
   657
fun infer_type ctxt x =
wenzelm@18770
   658
  (case try (fn () =>
wenzelm@18971
   659
      Sign.infer_types (pp ctxt) (theory_of ctxt) (consts_of ctxt) (def_type ctxt false)
wenzelm@18971
   660
        (def_sort ctxt) (used_types ctxt) true ([Free (x, dummyT)], TypeInfer.logicT)) () of
wenzelm@18770
   661
    SOME (Free (_, T), _) => T
wenzelm@18770
   662
  | _ => error ("Failed to infer type of fixed variable " ^ quote x));
wenzelm@18770
   663
wenzelm@18770
   664
fun inferred_param x ctxt =
wenzelm@18619
   665
  let val T = infer_type ctxt x
wenzelm@19019
   666
  in ((x, T), ctxt |> declare_syntax (Free (x, T))) end;
wenzelm@18619
   667
wenzelm@18770
   668
fun inferred_fixes ctxt =
wenzelm@18770
   669
  fold_map inferred_param (rev (fixed_names_of ctxt)) ctxt;
wenzelm@5819
   670
wenzelm@5819
   671
wenzelm@15703
   672
(* type and constant names *)
wenzelm@15703
   673
wenzelm@15703
   674
fun read_tyname ctxt c =
wenzelm@18340
   675
  if member (op =) (used_types ctxt) c then
wenzelm@18187
   676
    TFree (c, the_default (Sign.defaultS (theory_of ctxt)) (def_sort ctxt (c, ~1)))
wenzelm@16458
   677
  else Sign.read_tyname (theory_of ctxt) c;
wenzelm@15703
   678
wenzelm@15703
   679
fun read_const ctxt c =
wenzelm@15703
   680
  (case lookup_skolem ctxt c of
wenzelm@15703
   681
    SOME c' => Free (c', dummyT)
wenzelm@18971
   682
  | NONE => Consts.read_const (consts_of ctxt) c);
wenzelm@15703
   683
wenzelm@15703
   684
wenzelm@19019
   685
(* renaming term/type frees *)
wenzelm@19019
   686
wenzelm@19019
   687
fun rename_frees ctxt ts frees =
wenzelm@19019
   688
  let
wenzelm@19019
   689
    val (types, sorts, _, _) = defaults_of (ctxt |> fold declare_syntax ts);
wenzelm@19019
   690
    fun rename (x, X) xs =
wenzelm@19019
   691
      let
wenzelm@19274
   692
        fun used y = y = "" orelse y = "'" orelse member (op =) xs y orelse
wenzelm@19019
   693
          Vartab.defined types (y, ~1) orelse Vartab.defined sorts (y, ~1);
wenzelm@19019
   694
        val x' = Term.variant_name used x;
wenzelm@19019
   695
      in ((x', X), x' :: xs) end;
wenzelm@19019
   696
  in #1 (fold_map rename frees []) end;
wenzelm@19019
   697
wenzelm@19019
   698
wenzelm@8616
   699
wenzelm@8616
   700
(** Hindley-Milner polymorphism **)
wenzelm@8616
   701
wenzelm@7925
   702
(* warn_extra_tfrees *)
wenzelm@7925
   703
wenzelm@16540
   704
fun warn_extra_tfrees ctxt1 ctxt2 =
wenzelm@12130
   705
  let
wenzelm@17451
   706
    fun occs_typ a (Type (_, Ts)) = exists (occs_typ a) Ts
wenzelm@17451
   707
      | occs_typ a (TFree (b, _)) = a = b
wenzelm@17451
   708
      | occs_typ _ (TVar _) = false;
wenzelm@17451
   709
    fun occs_free a (Free (x, _)) =
wenzelm@17451
   710
          (case def_type ctxt1 false (x, ~1) of
wenzelm@17451
   711
            SOME T => if occs_typ a T then I else cons (a, x)
wenzelm@17451
   712
          | NONE => cons (a, x))
wenzelm@17451
   713
      | occs_free _ _ = I;
wenzelm@8616
   714
wenzelm@17451
   715
    val occs1 = type_occs_of ctxt1 and occs2 = type_occs_of ctxt2;
wenzelm@17451
   716
    val extras = Symtab.fold (fn (a, ts) =>
wenzelm@17451
   717
      if Symtab.defined occs1 a then I else fold (occs_free a) ts) occs2 [];
wenzelm@18428
   718
    val tfrees = map #1 extras |> sort_distinct string_ord;
wenzelm@18428
   719
    val frees = map #2 extras |> sort_distinct string_ord;
wenzelm@12130
   720
  in
wenzelm@12130
   721
    if null extras then ()
wenzelm@17451
   722
    else warning ("Introduced fixed type variable(s): " ^ commas tfrees ^ " in " ^
wenzelm@17860
   723
      space_implode " or " (map (string_of_term ctxt2 o Syntax.free) frees));
wenzelm@12130
   724
    ctxt2
wenzelm@12130
   725
  end;
wenzelm@8616
   726
wenzelm@8616
   727
wenzelm@8616
   728
(* generalize type variables *)
wenzelm@8616
   729
wenzelm@12550
   730
fun generalize_tfrees inner outer =
wenzelm@8616
   731
  let
wenzelm@19310
   732
    val extra_fixes = subtract (op =) (fixed_names_of outer) (fixed_names_of inner);
wenzelm@18340
   733
    fun still_fixed (Free (x, _)) = not (member (op =) extra_fixes x)
wenzelm@8616
   734
      | still_fixed _ = false;
wenzelm@16540
   735
    val occs_inner = type_occs_of inner;
wenzelm@16540
   736
    val occs_outer = type_occs_of outer;
wenzelm@16031
   737
    fun add a gen =
wenzelm@16894
   738
      if Symtab.defined occs_outer a orelse
wenzelm@18953
   739
        exists still_fixed (Symtab.lookup_list occs_inner a)
wenzelm@8616
   740
      then gen else a :: gen;
wenzelm@16031
   741
  in fn tfrees => fold add tfrees [] end;
wenzelm@8616
   742
wenzelm@12550
   743
fun generalize inner outer ts =
wenzelm@8616
   744
  let
wenzelm@18187
   745
    val tfrees = generalize_tfrees inner outer (map #1 (fold Term.add_tfrees ts []));
wenzelm@18340
   746
    fun gen (x, S) = if member (op =) tfrees x then TVar ((x, 0), S) else TFree (x, S);
wenzelm@12550
   747
  in map (Term.map_term_types (Term.map_type_tfree gen)) ts end;
wenzelm@8616
   748
wenzelm@8616
   749
wenzelm@19001
   750
(* polymorphic terms *)
wenzelm@19001
   751
wenzelm@19270
   752
fun monomorphic ctxt ts =
wenzelm@19270
   753
  let
wenzelm@19270
   754
    val tvars = fold Term.add_tvars ts [];
wenzelm@19274
   755
    val tfrees = map TFree (rename_frees ctxt ts (map (pair "'" o #2) tvars));
wenzelm@19270
   756
    val specialize = Term.instantiate ((tvars ~~ tfrees), []);
wenzelm@19270
   757
  in map specialize ts end;
wenzelm@19270
   758
wenzelm@19001
   759
fun polymorphic ctxt ts =
wenzelm@19001
   760
  generalize (ctxt |> fold declare_term ts) ctxt ts;
wenzelm@19001
   761
wenzelm@19270
   762
fun hidden_polymorphism t T =
wenzelm@19270
   763
  let
wenzelm@19270
   764
    val tvarsT = Term.add_tvarsT T [];
wenzelm@19270
   765
    val extra_tvars = Term.fold_types (Term.fold_atyps
wenzelm@19270
   766
      (fn TVar v => if member (op =) tvarsT v then I else insert (op =) v | _ => I)) t [];
wenzelm@19270
   767
  in extra_tvars end;
wenzelm@19001
   768
wenzelm@19001
   769
wenzelm@9553
   770
wenzelm@9553
   771
(** export theorems **)
wenzelm@8616
   772
wenzelm@18042
   773
fun common_exports is_goal inner outer =
wenzelm@8616
   774
  let
wenzelm@12550
   775
    val gen = generalize_tfrees inner outer;
wenzelm@19310
   776
    val fixes = subtract (op =) (fixed_names_of outer) (fixed_names_of inner);
wenzelm@12057
   777
    val asms = Library.drop (length (assumptions_of outer), assumptions_of inner);
wenzelm@11816
   778
    val exp_asms = map (fn (cprops, exp) => exp is_goal cprops) asms;
wenzelm@16948
   779
  in
wenzelm@18255
   780
    Goal.norm_hhf_protect
wenzelm@16948
   781
    #> Seq.EVERY (rev exp_asms)
wenzelm@16948
   782
    #> Seq.map (fn rule =>
wenzelm@11816
   783
      let
wenzelm@16992
   784
        val thy = Thm.theory_of_thm rule;
wenzelm@16992
   785
        val prop = Thm.full_prop_of rule;
wenzelm@19482
   786
        val frees = map (Thm.cterm_of thy) (map_filter (Term.find_free prop) fixes);
wenzelm@12550
   787
        val tfrees = gen (Term.add_term_tfree_names (prop, []));
wenzelm@11816
   788
      in
wenzelm@11816
   789
        rule
wenzelm@11816
   790
        |> Drule.forall_intr_list frees
wenzelm@18255
   791
        |> Goal.norm_hhf_protect
wenzelm@18138
   792
        |> Drule.tvars_intr_list tfrees |> #2
wenzelm@11816
   793
      end)
wenzelm@11816
   794
  end;
wenzelm@8616
   795
wenzelm@18785
   796
fun export_standard inner outer =
wenzelm@18122
   797
  let val exp = common_exports false inner outer in
wenzelm@13378
   798
    fn th =>
wenzelm@18122
   799
      (case Seq.pull (exp th) of
skalberg@15531
   800
        SOME (th', _) => th' |> Drule.local_standard
wenzelm@16850
   801
      | NONE => sys_error "Failed to export theorem")
wenzelm@13378
   802
  end;
wenzelm@12704
   803
wenzelm@18122
   804
val exports = common_exports false;
wenzelm@18122
   805
val goal_exports = common_exports true;
wenzelm@7925
   806
wenzelm@5819
   807
wenzelm@15758
   808
wenzelm@5819
   809
(** bindings **)
wenzelm@5819
   810
wenzelm@15758
   811
(* delete_update_binds *)
wenzelm@15758
   812
wenzelm@15758
   813
local
wenzelm@5819
   814
wenzelm@18672
   815
val del_bind = map_binds o Vartab.delete_safe;
wenzelm@7606
   816
wenzelm@15758
   817
fun upd_bind ((x, i), t) =
wenzelm@8616
   818
  let
wenzelm@8616
   819
    val T = Term.fastype_of t;
wenzelm@8616
   820
    val t' =
wenzelm@19270
   821
      if null (hidden_polymorphism t T) then t
wenzelm@8637
   822
      else Var ((x ^ "_has_extra_type_vars_on_rhs", i), T);
wenzelm@18953
   823
  in declare_term t' #> map_binds (Vartab.update ((x, i), (T, t'))) end;
wenzelm@5819
   824
wenzelm@15758
   825
fun del_upd_bind (xi, NONE) = del_bind xi
wenzelm@15758
   826
  | del_upd_bind (xi, SOME t) = upd_bind (xi, t);
wenzelm@7606
   827
wenzelm@15758
   828
in
wenzelm@15758
   829
wenzelm@15758
   830
val delete_update_binds = fold del_upd_bind;
wenzelm@15758
   831
wenzelm@15758
   832
end;
wenzelm@7606
   833
wenzelm@5819
   834
wenzelm@8096
   835
(* simult_matches *)
wenzelm@8096
   836
wenzelm@19585
   837
fun simult_matches _ (_, []) = []
wenzelm@19585
   838
  | simult_matches ctxt (t, pats) =
wenzelm@8096
   839
      let
wenzelm@18678
   840
        fun fail () = error "Pattern match failed!";
wenzelm@10554
   841
wenzelm@19585
   842
        val pairs = map (rpair t) pats;
wenzelm@16031
   843
        val maxidx = fold (fn (t1, t2) => fn i =>
wenzelm@16031
   844
          Int.max (Int.max (Term.maxidx_of_term t1, Term.maxidx_of_term t2), i)) pairs ~1;
wenzelm@16458
   845
        val envs = Unify.smash_unifiers (theory_of ctxt, Envir.empty maxidx,
wenzelm@10554
   846
          map swap pairs);    (*prefer assignment of variables from patterns*)
wenzelm@10554
   847
        val env =
wenzelm@8096
   848
          (case Seq.pull envs of
skalberg@15531
   849
            NONE => fail ()
skalberg@15531
   850
          | SOME (env, _) => env);    (*ignore further results*)
wenzelm@12309
   851
        val domain =
wenzelm@12309
   852
          filter_out Term.is_replaced_dummy_pattern (map #1 (Drule.vars_of_terms (map #1 pairs)));
wenzelm@10554
   853
        val _ =    (*may not assign variables from text*)
wenzelm@12309
   854
          if null (map #1 (Envir.alist_of env) inter (map #1 (Drule.vars_of_terms (map #2 pairs))))
wenzelm@12309
   855
          then () else fail ();
wenzelm@16948
   856
        fun norm_bind (xi, (_, t)) =
wenzelm@18310
   857
          if member (op =) domain xi then SOME (xi, Envir.norm_term env t) else NONE;
wenzelm@19482
   858
      in map_filter norm_bind (Envir.alist_of env) end;
wenzelm@8096
   859
wenzelm@8096
   860
wenzelm@8096
   861
(* add_binds(_i) *)
wenzelm@5819
   862
wenzelm@7925
   863
local
wenzelm@7925
   864
wenzelm@16031
   865
fun gen_bind prep (xi as (x, _), raw_t) ctxt =
skalberg@15570
   866
  ctxt |> delete_update_binds [(xi, Option.map (prep ctxt) raw_t)];
wenzelm@5819
   867
wenzelm@10810
   868
in
wenzelm@10810
   869
skalberg@15531
   870
fun drop_schematic (b as (xi, SOME t)) = if null (Term.term_vars t) then b else (xi, NONE)
wenzelm@10554
   871
  | drop_schematic b = b;
wenzelm@10554
   872
wenzelm@16031
   873
val add_binds = fold (gen_bind read_term);
wenzelm@16031
   874
val add_binds_i = fold (gen_bind cert_term);
wenzelm@8616
   875
wenzelm@16458
   876
fun auto_bind f ts ctxt = ctxt |> add_binds_i (map drop_schematic (f (theory_of ctxt) ts));
wenzelm@12147
   877
val auto_bind_goal = auto_bind AutoBind.goal;
wenzelm@12147
   878
val auto_bind_facts = auto_bind AutoBind.facts;
wenzelm@7925
   879
wenzelm@7925
   880
end;
wenzelm@5819
   881
wenzelm@5819
   882
wenzelm@8096
   883
(* match_bind(_i) *)
wenzelm@5819
   884
wenzelm@8096
   885
local
wenzelm@8096
   886
wenzelm@17860
   887
fun prep_bind prep_pats (raw_pats, t) ctxt =
wenzelm@5819
   888
  let
wenzelm@8096
   889
    val ctxt' = declare_term t ctxt;
wenzelm@19585
   890
    val pats = prep_pats (Term.fastype_of t) ctxt' raw_pats;
wenzelm@19585
   891
    val binds = simult_matches ctxt' (t, pats);
wenzelm@17860
   892
  in (binds, ctxt') end;
wenzelm@7670
   893
wenzelm@10465
   894
fun gen_binds prep_terms prep_pats gen raw_binds ctxt =
wenzelm@8616
   895
  let
wenzelm@10465
   896
    val ts = prep_terms ctxt (map snd raw_binds);
wenzelm@17860
   897
    val (binds, ctxt') =
wenzelm@19482
   898
      apfst flat (fold_map (prep_bind prep_pats) (map fst raw_binds ~~ ts) ctxt);
wenzelm@8616
   899
    val binds' =
wenzelm@12550
   900
      if gen then map #1 binds ~~ generalize ctxt' ctxt (map #2 binds)
wenzelm@8616
   901
      else binds;
skalberg@15531
   902
    val binds'' = map (apsnd SOME) binds';
wenzelm@18310
   903
    val ctxt'' =
wenzelm@18310
   904
      warn_extra_tfrees ctxt
wenzelm@18310
   905
       (if gen then
wenzelm@18310
   906
          ctxt (*sic!*) |> fold declare_term (map #2 binds') |> add_binds_i binds''
wenzelm@18310
   907
        else ctxt' |> add_binds_i binds'');
wenzelm@18310
   908
  in (ts, ctxt'') end;
wenzelm@8096
   909
wenzelm@8096
   910
in
wenzelm@5935
   911
wenzelm@10465
   912
val match_bind = gen_binds read_terms read_term_pats;
wenzelm@10465
   913
val match_bind_i = gen_binds (map o cert_term) cert_term_pats;
wenzelm@8096
   914
wenzelm@8096
   915
end;
wenzelm@5935
   916
wenzelm@5935
   917
wenzelm@10465
   918
(* propositions with patterns *)
wenzelm@5935
   919
wenzelm@10465
   920
local
wenzelm@8096
   921
wenzelm@10554
   922
fun prep_propp schematic prep_props prep_pats (context, args) =
wenzelm@10465
   923
  let
wenzelm@19585
   924
    fun prep (_, raw_pats) (ctxt, prop :: props) =
wenzelm@19585
   925
          let val ctxt' = declare_term prop ctxt
wenzelm@19585
   926
          in ((prop, prep_pats ctxt' raw_pats), (ctxt', props)) end
wenzelm@17860
   927
      | prep _ _ = sys_error "prep_propp";
wenzelm@17860
   928
    val (propp, (context', _)) = (fold_map o fold_map) prep args
wenzelm@19482
   929
      (context, prep_props schematic context (maps (map fst) args));
wenzelm@10465
   930
  in (context', propp) end;
wenzelm@5935
   931
wenzelm@10465
   932
fun gen_bind_propp prepp (ctxt, raw_args) =
wenzelm@8096
   933
  let
wenzelm@10465
   934
    val (ctxt', args) = prepp (ctxt, raw_args);
wenzelm@19585
   935
    val binds = flat (flat (map (map (simult_matches ctxt')) args));
wenzelm@10465
   936
    val propss = map (map #1) args;
wenzelm@8616
   937
wenzelm@10554
   938
    (*generalize result: context evaluated now, binds added later*)
wenzelm@8616
   939
    val gen = generalize ctxt' ctxt;
skalberg@15531
   940
    fun gen_binds c = c |> add_binds_i (map #1 binds ~~ map SOME (gen (map #2 binds)));
skalberg@15531
   941
  in (ctxt' |> add_binds_i (map (apsnd SOME) binds), (propss, gen_binds)) end;
wenzelm@8096
   942
wenzelm@10465
   943
in
wenzelm@10465
   944
wenzelm@11925
   945
val read_propp = prep_propp false read_props read_prop_pats;
wenzelm@11925
   946
val cert_propp = prep_propp false cert_props cert_prop_pats;
wenzelm@10554
   947
val read_propp_schematic = prep_propp true read_props read_prop_pats;
wenzelm@10554
   948
val cert_propp_schematic = prep_propp true cert_props cert_prop_pats;
wenzelm@10554
   949
wenzelm@11925
   950
val bind_propp = gen_bind_propp read_propp;
wenzelm@11925
   951
val bind_propp_i = gen_bind_propp cert_propp;
wenzelm@11925
   952
val bind_propp_schematic = gen_bind_propp read_propp_schematic;
wenzelm@10554
   953
val bind_propp_schematic_i = gen_bind_propp cert_propp_schematic;
wenzelm@6789
   954
wenzelm@10465
   955
end;
wenzelm@10465
   956
wenzelm@6789
   957
wenzelm@5819
   958
wenzelm@5819
   959
(** theorems **)
wenzelm@5819
   960
wenzelm@18042
   961
(* fact_tac *)
wenzelm@18042
   962
wenzelm@18122
   963
fun comp_incr_tac [] _ st = no_tac st
wenzelm@18122
   964
  | comp_incr_tac (th :: ths) i st =
wenzelm@18122
   965
      (Goal.compose_hhf_tac (Drule.incr_indexes st th) i APPEND comp_incr_tac ths i) st;
wenzelm@18042
   966
wenzelm@18122
   967
fun fact_tac facts = Tactic.norm_hhf_tac THEN' comp_incr_tac facts;
wenzelm@18122
   968
wenzelm@18122
   969
fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) =>
wenzelm@18042
   970
  let
wenzelm@19001
   971
    val index = fact_index_of ctxt;
wenzelm@18042
   972
    val facts = FactIndex.could_unify index (Term.strip_all_body goal);
wenzelm@18042
   973
  in fact_tac facts i end);
wenzelm@18042
   974
wenzelm@18042
   975
wenzelm@6091
   976
(* get_thm(s) *)
wenzelm@5819
   977
wenzelm@18042
   978
fun retrieve_thms _ pick ctxt (Fact s) =
wenzelm@16501
   979
      let
wenzelm@18042
   980
        val thy = theory_of ctxt;
wenzelm@18042
   981
        val th = Goal.prove thy [] [] (read_prop ctxt s) (K (ALLGOALS (some_fact_tac ctxt)))
wenzelm@18678
   982
          handle ERROR msg => cat_error msg "Failed to retrieve literal fact.";
wenzelm@18042
   983
      in pick "" [th] end
wenzelm@18042
   984
  | retrieve_thms from_thy pick ctxt xthmref =
wenzelm@18042
   985
      let
wenzelm@18042
   986
        val thy = theory_of ctxt;
wenzelm@19001
   987
        val (space, tab) = #1 (thms_of ctxt);
wenzelm@16501
   988
        val thmref = PureThy.map_name_of_thmref (NameSpace.intern space) xthmref;
wenzelm@16501
   989
        val name = PureThy.name_of_thmref thmref;
wenzelm@16501
   990
      in
wenzelm@17412
   991
        (case Symtab.lookup tab name of
wenzelm@16540
   992
          SOME ths => map (Thm.transfer thy) (PureThy.select_thm thmref ths)
wenzelm@16540
   993
        | NONE => from_thy thy xthmref) |> pick name
wenzelm@18042
   994
      end;
wenzelm@5819
   995
wenzelm@9566
   996
val get_thm = retrieve_thms PureThy.get_thms PureThy.single_thm;
wenzelm@9566
   997
val get_thm_closure = retrieve_thms PureThy.get_thms_closure PureThy.single_thm;
wenzelm@9566
   998
val get_thms = retrieve_thms PureThy.get_thms (K I);
wenzelm@9566
   999
val get_thms_closure = retrieve_thms PureThy.get_thms_closure (K I);
wenzelm@5819
  1000
wenzelm@5819
  1001
wenzelm@16031
  1002
(* valid_thms *)
wenzelm@16031
  1003
wenzelm@16031
  1004
fun valid_thms ctxt (name, ths) =
wenzelm@18678
  1005
  (case try (fn () => get_thms ctxt (Name name)) () of
wenzelm@16031
  1006
    NONE => false
wenzelm@16147
  1007
  | SOME ths' => Thm.eq_thms (ths, ths'));
wenzelm@16031
  1008
wenzelm@16031
  1009
wenzelm@16031
  1010
(* lthms_containing *)
wenzelm@16031
  1011
wenzelm@16031
  1012
fun lthms_containing ctxt spec =
wenzelm@16031
  1013
  FactIndex.find (fact_index_of ctxt) spec
wenzelm@18043
  1014
  |> map ((not o valid_thms ctxt) ? apfst (fn name =>
wenzelm@18042
  1015
    NameSpace.hidden (if name = "" then "unnamed" else name)));
wenzelm@16031
  1016
wenzelm@16031
  1017
wenzelm@13425
  1018
(* name space operations *)
wenzelm@12309
  1019
wenzelm@19001
  1020
val extern_thm = NameSpace.extern o #1 o #1 o thms_of;
wenzelm@12309
  1021
wenzelm@19062
  1022
val no_base_names   = map_naming NameSpace.no_base_names;
wenzelm@16147
  1023
val qualified_names = map_naming NameSpace.qualified_names;
wenzelm@19062
  1024
val sticky_prefix   = map_naming o NameSpace.sticky_prefix;
wenzelm@19062
  1025
val restore_naming  = map_naming o K o naming_of;
wenzelm@12309
  1026
wenzelm@19001
  1027
fun hide_thms fully names = map_thms (fn ((space, tab), index) =>
wenzelm@19001
  1028
  ((fold (NameSpace.hide fully) names space, tab), index));
wenzelm@13425
  1029
wenzelm@12309
  1030
wenzelm@17360
  1031
(* put_thms *)
wenzelm@5819
  1032
wenzelm@19079
  1033
fun put_thms _ ("", NONE) ctxt = ctxt
wenzelm@19143
  1034
  | put_thms do_index ("", SOME ths) ctxt = ctxt |> map_thms (fn (facts, index) =>
wenzelm@18672
  1035
      let
wenzelm@19143
  1036
        val index' = FactIndex.add_local do_index (is_known ctxt) ("", ths) index;
wenzelm@19001
  1037
      in (facts, index') end)
wenzelm@19079
  1038
  | put_thms _ (bname, NONE) ctxt = ctxt |> map_thms (fn ((space, tab), index) =>
wenzelm@18672
  1039
      let
wenzelm@19387
  1040
        val name = full_name ctxt bname;
wenzelm@18672
  1041
        val tab' = Symtab.delete_safe name tab;
wenzelm@19001
  1042
      in ((space, tab'), index) end)
wenzelm@19079
  1043
  | put_thms do_index (bname, SOME ths) ctxt = ctxt |> map_thms (fn ((space, tab), index) =>
wenzelm@18672
  1044
      let
wenzelm@19387
  1045
        val name = full_name ctxt bname;
wenzelm@19001
  1046
        val space' = NameSpace.declare (naming_of ctxt) name space;
wenzelm@18672
  1047
        val tab' = Symtab.update (name, ths) tab;
wenzelm@19143
  1048
        val index' = FactIndex.add_local do_index (is_known ctxt) (name, ths) index;
wenzelm@19001
  1049
      in ((space', tab'), index') end);
wenzelm@5819
  1050
wenzelm@19079
  1051
fun put_thms_internal thms ctxt =
wenzelm@19079
  1052
  ctxt |> map_naming (K local_naming) |> put_thms false thms |> restore_naming ctxt;
wenzelm@19079
  1053
wenzelm@7606
  1054
wenzelm@14564
  1055
(* note_thmss *)
wenzelm@5819
  1056
wenzelm@12711
  1057
local
wenzelm@16147
  1058
wenzelm@17860
  1059
fun gen_note_thmss get = fold_map (fn ((name, more_attrs), ths_attrs) => fn ctxt =>
wenzelm@5819
  1060
  let
wenzelm@17360
  1061
    fun app (th, attrs) (ct, ths) =
wenzelm@18728
  1062
      let val (ct', th') = foldl_map (Thm.proof_attributes (attrs @ more_attrs)) (ct, get ctxt th)
wenzelm@12711
  1063
      in (ct', th' :: ths) end;
wenzelm@17360
  1064
    val (ctxt', rev_thms) = fold app ths_attrs (ctxt, []);
wenzelm@19482
  1065
    val thms = flat (rev rev_thms);
wenzelm@19079
  1066
  in ((name, thms), ctxt' |> put_thms true (name, SOME thms)) end);
wenzelm@12711
  1067
wenzelm@12711
  1068
in
wenzelm@12711
  1069
wenzelm@16147
  1070
val note_thmss = gen_note_thmss get_thms;
wenzelm@16147
  1071
val note_thmss_i = gen_note_thmss (K I);
ballarin@15696
  1072
ballarin@15696
  1073
val note_thmss_accesses = gen_note_thmss get_thms;
ballarin@15696
  1074
val note_thmss_accesses_i = gen_note_thmss (K I);
wenzelm@12711
  1075
wenzelm@12711
  1076
end;
wenzelm@9196
  1077
wenzelm@5819
  1078
wenzelm@5819
  1079
wenzelm@18672
  1080
(** parameters **)
wenzelm@17360
  1081
wenzelm@8096
  1082
(* variables *)
wenzelm@8096
  1083
wenzelm@10381
  1084
local
wenzelm@10381
  1085
wenzelm@18672
  1086
fun prep_vars prep_typ internal legacy =
wenzelm@18672
  1087
  fold_map (fn (raw_x, raw_T, raw_mx) => fn ctxt =>
wenzelm@18672
  1088
    let
wenzelm@19371
  1089
      val (x, mx) = Syntax.const_mixfix raw_x raw_mx;
wenzelm@18672
  1090
      val _ =
wenzelm@18678
  1091
        if not legacy andalso not (Syntax.is_identifier (no_skolem internal x)) then
wenzelm@18678
  1092
          error ("Illegal variable name: " ^ quote x)
wenzelm@18672
  1093
        else ();
wenzelm@12504
  1094
wenzelm@18672
  1095
      fun cond_tvars T =
wenzelm@18672
  1096
        if internal then T
wenzelm@18678
  1097
        else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
wenzelm@18672
  1098
      val opt_T = Option.map (cond_tvars o prep_typ ctxt) raw_T;
wenzelm@18672
  1099
      val var = (x, opt_T, mx);
wenzelm@19001
  1100
    in (var, ctxt |> declare_var var |> #2) end);
wenzelm@8096
  1101
wenzelm@10381
  1102
in
wenzelm@10381
  1103
wenzelm@18672
  1104
val read_vars        = prep_vars read_typ false false;
wenzelm@18672
  1105
val cert_vars        = prep_vars cert_typ true false;
wenzelm@18672
  1106
val read_vars_legacy = prep_vars read_typ true true;
wenzelm@18672
  1107
val cert_vars_legacy = prep_vars cert_typ true true;
wenzelm@8096
  1108
wenzelm@10381
  1109
end;
wenzelm@10381
  1110
wenzelm@8096
  1111
wenzelm@19663
  1112
(* const syntax *)
wenzelm@19663
  1113
wenzelm@19663
  1114
fun add_const_syntax prmode args ctxt =
wenzelm@19663
  1115
  ctxt |> map_syntax
wenzelm@19663
  1116
    (LocalSyntax.add_modesyntax (theory_of ctxt) prmode
wenzelm@19663
  1117
      (map (pair false o Consts.syntax (consts_of ctxt)) args));
wenzelm@19663
  1118
wenzelm@19663
  1119
wenzelm@19001
  1120
(* abbreviations *)
wenzelm@19001
  1121
wenzelm@19371
  1122
val expand_abbrevs = map_consts o apsnd o Consts.expand_abbrevs;
wenzelm@19371
  1123
wenzelm@19663
  1124
fun add_abbrevs prmode = fold (fn (raw_c, raw_t, raw_mx) => fn ctxt =>
wenzelm@19001
  1125
  let
wenzelm@19663
  1126
    val ([(c, _, mx)], _) = cert_vars [(raw_c, NONE, raw_mx)] ctxt;
wenzelm@19387
  1127
    val (c', b) = Syntax.mixfix_const (full_name ctxt c) mx;
wenzelm@19663
  1128
    val [t] = polymorphic ctxt [cert_term (ctxt |> expand_abbrevs false) raw_t];
wenzelm@19019
  1129
    val T = Term.fastype_of t;
wenzelm@19001
  1130
    val _ =
wenzelm@19270
  1131
      if null (hidden_polymorphism t T) then ()
wenzelm@19001
  1132
      else error ("Extra type variables on rhs of abbreviation: " ^ quote c);
wenzelm@19001
  1133
  in
wenzelm@19001
  1134
    ctxt
wenzelm@19001
  1135
    |> declare_term t
wenzelm@19387
  1136
    |> map_consts
wenzelm@19663
  1137
      (apsnd (Consts.abbreviate (pp ctxt) (tsig_of ctxt) (naming_of ctxt) (#1 prmode) ((c, t), b)))
wenzelm@19663
  1138
    |> map_syntax (LocalSyntax.add_modesyntax (theory_of ctxt) prmode [(false, (c', T, mx))])
wenzelm@19001
  1139
  end);
wenzelm@19001
  1140
wenzelm@19001
  1141
wenzelm@18672
  1142
(* fixes *)
wenzelm@5819
  1143
wenzelm@8096
  1144
local
wenzelm@8096
  1145
wenzelm@19001
  1146
fun prep_mixfix (x, T, mx) =
wenzelm@19019
  1147
  if mx <> NoSyn andalso mx <> Structure andalso
wenzelm@19019
  1148
      (can Syntax.dest_internal x orelse can Syntax.dest_skolem x) then
wenzelm@19001
  1149
    error ("Illegal mixfix syntax for internal/skolem constant " ^ quote x)
wenzelm@19001
  1150
  else (true, (x, T, mx));
wenzelm@19001
  1151
wenzelm@18672
  1152
fun no_dups _ [] = ()
wenzelm@18900
  1153
  | no_dups ctxt dups = error ("Duplicate fixed variable(s): " ^ commas_quote dups);
wenzelm@11925
  1154
wenzelm@18844
  1155
fun gen_fixes prep raw_vars ctxt =
wenzelm@8096
  1156
  let
wenzelm@19371
  1157
    val thy = theory_of ctxt;
wenzelm@19371
  1158
wenzelm@18672
  1159
    val (ys, zs) = split_list (fixes_of ctxt);
wenzelm@18672
  1160
    val (vars, ctxt') = prep raw_vars ctxt;
wenzelm@12130
  1161
    val xs = map #1 vars;
wenzelm@18971
  1162
    val _ = no_dups ctxt (duplicates (op =) xs);
wenzelm@18672
  1163
    val xs' =
wenzelm@18672
  1164
      if is_body ctxt then Term.variantlist (map Syntax.skolem xs, zs)
wenzelm@18672
  1165
      else (no_dups ctxt (xs inter_string ys); no_dups ctxt (xs inter_string zs); xs);
wenzelm@8096
  1166
  in
wenzelm@18672
  1167
    ctxt'
wenzelm@18672
  1168
    |> map_fixes (fn (b, fixes) => (b, rev (xs ~~ xs') @ fixes))
wenzelm@19001
  1169
    |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars)
wenzelm@19543
  1170
    |-> (map_syntax o LocalSyntax.add_syntax thy o map prep_mixfix)
wenzelm@18672
  1171
    |> pair xs'
wenzelm@8096
  1172
  end;
wenzelm@5819
  1173
wenzelm@8096
  1174
in
wenzelm@7679
  1175
wenzelm@18844
  1176
val add_fixes = gen_fixes read_vars;
wenzelm@18844
  1177
val add_fixes_i = gen_fixes cert_vars;
wenzelm@18844
  1178
val add_fixes_legacy = gen_fixes cert_vars_legacy;
wenzelm@8096
  1179
wenzelm@8096
  1180
end;
wenzelm@5819
  1181
wenzelm@18672
  1182
wenzelm@18844
  1183
(* invent fixes *)
wenzelm@18844
  1184
wenzelm@18844
  1185
fun invent_fixes xs ctxt =
wenzelm@18844
  1186
  ctxt
wenzelm@18844
  1187
  |> set_body true
wenzelm@18844
  1188
  |> add_fixes_i (map (fn x => (x, NONE, NoSyn)) xs)
wenzelm@18844
  1189
  ||> restore_body ctxt;
wenzelm@18844
  1190
wenzelm@18844
  1191
wenzelm@18672
  1192
(* fixes vs. frees *)
wenzelm@12016
  1193
wenzelm@18672
  1194
fun fix_frees t ctxt =
wenzelm@18672
  1195
  let
wenzelm@18672
  1196
    fun add (Free (x, T)) = if is_fixed ctxt x then I else insert (op =) (x, SOME T, NoSyn)
wenzelm@18672
  1197
      | add _ = I;
wenzelm@18672
  1198
    val fixes = rev (fold_aterms add t []);
wenzelm@18809
  1199
  in
wenzelm@18809
  1200
    ctxt
wenzelm@18809
  1201
    |> declare_term t
wenzelm@18809
  1202
    |> set_body false
wenzelm@18809
  1203
    |> (snd o add_fixes_i fixes)
wenzelm@18809
  1204
    |> restore_body ctxt
wenzelm@18809
  1205
  end;
wenzelm@6895
  1206
wenzelm@18672
  1207
fun auto_fixes (arg as (ctxt, (propss, x))) =
wenzelm@18672
  1208
  if is_body ctxt then arg
wenzelm@18672
  1209
  else ((fold o fold) fix_frees propss ctxt, (propss, x));
wenzelm@18672
  1210
wenzelm@18672
  1211
fun bind_fixes xs ctxt =
wenzelm@9291
  1212
  let
wenzelm@18672
  1213
    val (_, ctxt') = ctxt |> add_fixes_i (map (fn x => (x, NONE, NoSyn)) xs);
wenzelm@9291
  1214
    fun bind (t as Free (x, T)) =
wenzelm@18340
  1215
          if member (op =) xs x then
skalberg@15531
  1216
            (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t)
wenzelm@9291
  1217
          else t
wenzelm@9291
  1218
      | bind (t $ u) = bind t $ bind u
wenzelm@9291
  1219
      | bind (Abs (x, T, t)) = Abs (x, T, bind t)
wenzelm@9291
  1220
      | bind a = a;
wenzelm@18672
  1221
  in (bind, ctxt') end;
wenzelm@18672
  1222
wenzelm@9291
  1223
wenzelm@9291
  1224
wenzelm@18672
  1225
(** assumptions **)
wenzelm@18187
  1226
wenzelm@18672
  1227
(* generic assms *)
wenzelm@18187
  1228
wenzelm@18187
  1229
local
wenzelm@18187
  1230
wenzelm@18672
  1231
fun gen_assm ((name, attrs), props) ctxt =
wenzelm@18187
  1232
  let
wenzelm@18187
  1233
    val cprops = map (Thm.cterm_of (theory_of ctxt)) props;
wenzelm@18187
  1234
    val asms = map (Goal.norm_hhf o Thm.assume) cprops;
wenzelm@18187
  1235
wenzelm@18187
  1236
    val ths = map (fn th => ([th], [])) asms;
wenzelm@18187
  1237
    val ([(_, thms)], ctxt') =
wenzelm@18187
  1238
      ctxt
wenzelm@18187
  1239
      |> auto_bind_facts props
wenzelm@18187
  1240
      |> note_thmss_i [((name, attrs), ths)];
wenzelm@18187
  1241
  in ((cprops, (name, asms), (name, thms)), ctxt') end;
wenzelm@18187
  1242
wenzelm@18187
  1243
fun gen_assms prepp exp args ctxt =
wenzelm@18187
  1244
  let
wenzelm@18672
  1245
    val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
wenzelm@18672
  1246
    val (results, ctxt2) = fold_map gen_assm (map fst args ~~ propss) ctxt1;
wenzelm@18187
  1247
wenzelm@19482
  1248
    val new_asms = maps #1 results;
wenzelm@18672
  1249
    val new_prems = map #2 results;
wenzelm@18809
  1250
    val ctxt3 = ctxt2
wenzelm@18809
  1251
      |> map_assms (fn (asms, prems) => (asms @ [(new_asms, exp)], prems @ new_prems))
wenzelm@18809
  1252
    val ctxt4 = ctxt3
wenzelm@19079
  1253
      |> put_thms_internal (AutoBind.premsN, SOME (prems_of ctxt3));
wenzelm@18672
  1254
  in (map #3 results, warn_extra_tfrees ctxt ctxt4) end;
wenzelm@18187
  1255
wenzelm@18187
  1256
in
wenzelm@18187
  1257
wenzelm@18672
  1258
val add_assms = gen_assms (apsnd #1 o bind_propp);
wenzelm@18672
  1259
val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
wenzelm@18187
  1260
wenzelm@18187
  1261
end;
wenzelm@18187
  1262
wenzelm@18187
  1263
wenzelm@18672
  1264
(* basic assumptions *)
wenzelm@18672
  1265
wenzelm@18879
  1266
(*
wenzelm@18879
  1267
    [A]
wenzelm@18971
  1268
     :
wenzelm@18879
  1269
     B
wenzelm@18879
  1270
  --------
wenzelm@18879
  1271
  #A ==> B
wenzelm@18879
  1272
*)
wenzelm@18672
  1273
fun assume_export true = Seq.single oo Drule.implies_intr_protected
wenzelm@18672
  1274
  | assume_export false = Seq.single oo Drule.implies_intr_list;
wenzelm@18672
  1275
wenzelm@18879
  1276
(*
wenzelm@18879
  1277
    [A]
wenzelm@18971
  1278
     :
wenzelm@18879
  1279
     B
wenzelm@18879
  1280
  -------
wenzelm@18879
  1281
  A ==> B
wenzelm@18879
  1282
*)
wenzelm@18672
  1283
fun presume_export _ = assume_export false;
wenzelm@18672
  1284
wenzelm@18672
  1285
wenzelm@18672
  1286
(* additional views *)
wenzelm@18672
  1287
wenzelm@18672
  1288
fun add_view outer view = map_assms (fn (asms, prems) =>
wenzelm@18672
  1289
  let
wenzelm@19019
  1290
    val (asms1, asms2) = chop (length (assumptions_of outer)) asms;
wenzelm@18672
  1291
    val asms' = asms1 @ [(view, assume_export)] @ asms2;
wenzelm@18672
  1292
  in (asms', prems) end);
wenzelm@18672
  1293
wenzelm@18785
  1294
fun export_view view inner outer = export_standard (add_view outer view inner) outer;
wenzelm@18672
  1295
wenzelm@18672
  1296
wenzelm@5819
  1297
wenzelm@8373
  1298
(** cases **)
wenzelm@8373
  1299
wenzelm@16147
  1300
local
wenzelm@16147
  1301
wenzelm@16668
  1302
fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
wenzelm@16147
  1303
wenzelm@18476
  1304
fun add_case _ ("", _) cases = cases
wenzelm@18476
  1305
  | add_case _ (name, NONE) cases = rem_case name cases
wenzelm@18476
  1306
  | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
wenzelm@16147
  1307
wenzelm@18678
  1308
fun prep_case name fxs c =
wenzelm@18609
  1309
  let
wenzelm@18609
  1310
    fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
wenzelm@18609
  1311
      | replace [] ys = ys
wenzelm@18678
  1312
      | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
wenzelm@18609
  1313
    val RuleCases.Case {fixes, assumes, binds, cases} = c;
wenzelm@18609
  1314
    val fixes' = replace fxs fixes;
wenzelm@18609
  1315
    val binds' = map drop_schematic binds;
wenzelm@18609
  1316
  in
wenzelm@18609
  1317
    if null (fold (Term.add_tvarsT o snd) fixes []) andalso
wenzelm@18609
  1318
      null (fold (fold Term.add_vars o snd) assumes []) then
wenzelm@18609
  1319
        RuleCases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
wenzelm@18678
  1320
    else error ("Illegal schematic variable(s) in case " ^ quote name)
wenzelm@18609
  1321
  end;
wenzelm@18609
  1322
wenzelm@18672
  1323
fun fix (x, T) ctxt =
wenzelm@18672
  1324
  let
wenzelm@18672
  1325
    val (bind, ctxt') = bind_fixes [x] ctxt;
wenzelm@18672
  1326
    val t = bind (Free (x, T));
wenzelm@18672
  1327
  in (t, ctxt' |> declare_syntax t) end;
wenzelm@18672
  1328
wenzelm@16147
  1329
in
wenzelm@16147
  1330
wenzelm@18672
  1331
fun add_cases is_proper = map_cases o fold (add_case is_proper);
wenzelm@18609
  1332
wenzelm@18609
  1333
fun case_result c ctxt =
wenzelm@18609
  1334
  let
wenzelm@18609
  1335
    val RuleCases.Case {fixes, ...} = c;
wenzelm@18672
  1336
    val (ts, ctxt') = ctxt |> fold_map fix fixes;
wenzelm@18672
  1337
    val RuleCases.Case {assumes, binds, cases, ...} = RuleCases.apply ts c;
wenzelm@18609
  1338
  in
wenzelm@18609
  1339
    ctxt'
wenzelm@18699
  1340
    |> add_binds_i (map drop_schematic binds)
wenzelm@18609
  1341
    |> add_cases true (map (apsnd SOME) cases)
wenzelm@18609
  1342
    |> pair (assumes, (binds, cases))
wenzelm@18609
  1343
  end;
wenzelm@18609
  1344
wenzelm@18609
  1345
val apply_case = apfst fst oo case_result;
wenzelm@18609
  1346
wenzelm@16540
  1347
fun get_case ctxt name xs =
wenzelm@17184
  1348
  (case AList.lookup (op =) (cases_of ctxt) name of
wenzelm@18678
  1349
    NONE => error ("Unknown case: " ^ quote name)
wenzelm@18678
  1350
  | SOME (c, _) => prep_case name xs c);
wenzelm@8373
  1351
wenzelm@16147
  1352
end;
wenzelm@8373
  1353
wenzelm@8373
  1354
wenzelm@8373
  1355
wenzelm@10810
  1356
(** print context information **)
wenzelm@10810
  1357
wenzelm@10810
  1358
val verbose = ref false;
wenzelm@10810
  1359
fun verb f x = if ! verbose then f (x ()) else [];
wenzelm@10810
  1360
wenzelm@10810
  1361
fun setmp_verbose f x = Library.setmp verbose true f x;
wenzelm@10810
  1362
wenzelm@10810
  1363
fun pretty_items prt name items =
wenzelm@10810
  1364
  let
wenzelm@10810
  1365
    fun prt_itms (name, [x]) = Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt x]
wenzelm@10810
  1366
      | prt_itms (name, xs) = Pretty.big_list (name ^ ":") (map prt xs);
wenzelm@10810
  1367
  in
wenzelm@10810
  1368
    if null items andalso not (! verbose) then []
wenzelm@10810
  1369
    else [Pretty.big_list name (map prt_itms items)]
wenzelm@10810
  1370
  end;
wenzelm@10810
  1371
wenzelm@10810
  1372
wenzelm@12072
  1373
(* local syntax *)
wenzelm@12072
  1374
wenzelm@12093
  1375
val print_syntax = Syntax.print_syntax o syn_of;
wenzelm@12072
  1376
wenzelm@12072
  1377
wenzelm@18971
  1378
(* local consts *)
wenzelm@18971
  1379
wenzelm@18971
  1380
fun pretty_consts ctxt =
wenzelm@18971
  1381
  let
wenzelm@19033
  1382
    val ((_, globals), (space, consts)) =
wenzelm@19033
  1383
      pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
wenzelm@18971
  1384
    fun local_abbrev (_, (_, NONE)) = I
wenzelm@18971
  1385
      | local_abbrev (c, (T, SOME t)) =
wenzelm@18971
  1386
          if Symtab.defined globals c then I else cons (c, Logic.mk_equals (Const (c, T), t));
wenzelm@18971
  1387
    val abbrevs = NameSpace.extern_table (space, Symtab.make (Symtab.fold local_abbrev consts []));
wenzelm@18971
  1388
  in
wenzelm@18971
  1389
    if null abbrevs andalso not (! verbose) then []
wenzelm@19310
  1390
    else [Pretty.big_list "abbreviations:" (map (pretty_term_no_abbrevs ctxt o #2) abbrevs)]
wenzelm@18971
  1391
  end;
wenzelm@18971
  1392
wenzelm@18971
  1393
wenzelm@10810
  1394
(* term bindings *)
wenzelm@10810
  1395
wenzelm@16540
  1396
fun pretty_binds ctxt =
wenzelm@10810
  1397
  let
wenzelm@16540
  1398
    val binds = binds_of ctxt;
wenzelm@19310
  1399
    fun prt_bind (xi, (T, t)) = pretty_term_no_abbrevs ctxt (Logic.mk_equals (Var (xi, T), t));
wenzelm@10810
  1400
  in
wenzelm@15758
  1401
    if Vartab.is_empty binds andalso not (! verbose) then []
wenzelm@15758
  1402
    else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
wenzelm@10810
  1403
  end;
wenzelm@10810
  1404
wenzelm@10810
  1405
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
wenzelm@10810
  1406
wenzelm@10810
  1407
wenzelm@10810
  1408
(* local theorems *)
wenzelm@10810
  1409
wenzelm@16540
  1410
fun pretty_lthms ctxt =
wenzelm@19001
  1411
  pretty_items (pretty_thm ctxt) "facts:" (NameSpace.extern_table (#1 (thms_of ctxt)));
wenzelm@10810
  1412
wenzelm@12057
  1413
val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
wenzelm@10810
  1414
wenzelm@10810
  1415
wenzelm@10810
  1416
(* local contexts *)
wenzelm@10810
  1417
wenzelm@16540
  1418
fun pretty_cases ctxt =
wenzelm@10810
  1419
  let
wenzelm@12057
  1420
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1421
wenzelm@10810
  1422
    fun prt_let (xi, t) = Pretty.block
wenzelm@10818
  1423
      [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
wenzelm@10810
  1424
        Pretty.quote (prt_term t)];
wenzelm@10810
  1425
wenzelm@13425
  1426
    fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
wenzelm@13425
  1427
      ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
wenzelm@13425
  1428
wenzelm@10810
  1429
    fun prt_sect _ _ _ [] = []
wenzelm@10810
  1430
      | prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s ::
wenzelm@19482
  1431
            flat (Library.separate sep (map (Library.single o prt) xs))))];
wenzelm@10810
  1432
wenzelm@18609
  1433
    fun prt_case (name, (fixes, (asms, (lets, cs)))) = Pretty.block (Pretty.fbreaks
wenzelm@10810
  1434
      (Pretty.str (name ^ ":") ::
wenzelm@11915
  1435
        prt_sect "fix" [] (Pretty.str o fst) fixes @
wenzelm@10810
  1436
        prt_sect "let" [Pretty.str "and"] prt_let
wenzelm@19482
  1437
          (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
wenzelm@13425
  1438
        (if forall (null o #2) asms then []
wenzelm@18609
  1439
          else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
wenzelm@18609
  1440
        prt_sect "subcases:" [] (Pretty.str o fst) cs));
wenzelm@16540
  1441
wenzelm@18476
  1442
    fun add_case (_, (_, false)) = I
wenzelm@18609
  1443
      | add_case (name, (c as RuleCases.Case {fixes, ...}, true)) =
wenzelm@18609
  1444
          cons (name, (fixes, #1 (case_result c ctxt)));
wenzelm@18476
  1445
    val cases = fold add_case (cases_of ctxt) [];
wenzelm@10810
  1446
  in
wenzelm@10810
  1447
    if null cases andalso not (! verbose) then []
wenzelm@18476
  1448
    else [Pretty.big_list "cases:" (map prt_case cases)]
wenzelm@10810
  1449
  end;
wenzelm@10810
  1450
wenzelm@10810
  1451
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
wenzelm@10810
  1452
wenzelm@10810
  1453
wenzelm@12057
  1454
(* core context *)
wenzelm@10810
  1455
wenzelm@10810
  1456
val prems_limit = ref 10;
wenzelm@10810
  1457
wenzelm@18672
  1458
fun pretty_ctxt ctxt =
wenzelm@10810
  1459
  let
wenzelm@12057
  1460
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1461
wenzelm@12093
  1462
    (*structures*)
wenzelm@19001
  1463
    val structs = LocalSyntax.structs_of (syntax_of ctxt);
wenzelm@12093
  1464
    val prt_structs = if null structs then []
wenzelm@12093
  1465
      else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
wenzelm@12093
  1466
        Pretty.commas (map Pretty.str structs))];
wenzelm@12093
  1467
wenzelm@12057
  1468
    (*fixes*)
wenzelm@12057
  1469
    fun prt_fix (x, x') =
wenzelm@12057
  1470
      if x = x' then Pretty.str x
wenzelm@12057
  1471
      else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
wenzelm@18340
  1472
    val fixes =
wenzelm@18340
  1473
      rev (filter_out ((can Syntax.dest_internal orf member (op =) structs) o #1) (fixes_of ctxt));
wenzelm@12093
  1474
    val prt_fixes = if null fixes then []
wenzelm@12093
  1475
      else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
wenzelm@12093
  1476
        Pretty.commas (map prt_fix fixes))];
wenzelm@12057
  1477
wenzelm@12057
  1478
    (*prems*)
wenzelm@10810
  1479
    val limit = ! prems_limit;
wenzelm@10810
  1480
    val prems = prems_of ctxt;
wenzelm@10810
  1481
    val len = length prems;
wenzelm@12093
  1482
    val prt_prems = if null prems then []
wenzelm@12093
  1483
      else [Pretty.big_list "prems:" ((if len <= limit then [] else [Pretty.str "..."]) @
wenzelm@12093
  1484
        map (pretty_thm ctxt) (Library.drop (len - limit, prems)))];
wenzelm@12093
  1485
wenzelm@12093
  1486
  in prt_structs @ prt_fixes @ prt_prems end;
wenzelm@10810
  1487
wenzelm@10810
  1488
wenzelm@10810
  1489
(* main context *)
wenzelm@10810
  1490
wenzelm@16540
  1491
fun pretty_context ctxt =
wenzelm@10810
  1492
  let
wenzelm@12057
  1493
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1494
    val prt_typ = pretty_typ ctxt;
wenzelm@12057
  1495
    val prt_sort = pretty_sort ctxt;
wenzelm@10810
  1496
wenzelm@10810
  1497
    (*theory*)
wenzelm@12057
  1498
    val pretty_thy = Pretty.block
wenzelm@17384
  1499
      [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
wenzelm@10810
  1500
wenzelm@10810
  1501
    (*defaults*)
wenzelm@10810
  1502
    fun prt_atom prt prtT (x, X) = Pretty.block
wenzelm@10810
  1503
      [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
wenzelm@10810
  1504
wenzelm@10810
  1505
    fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@10810
  1506
      | prt_var xi = prt_term (Syntax.var xi);
wenzelm@10810
  1507
wenzelm@10810
  1508
    fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@10810
  1509
      | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@10810
  1510
wenzelm@10810
  1511
    val prt_defT = prt_atom prt_var prt_typ;
wenzelm@10810
  1512
    val prt_defS = prt_atom prt_varT prt_sort;
wenzelm@16540
  1513
wenzelm@16540
  1514
    val (types, sorts, used, _) = defaults_of ctxt;
wenzelm@10810
  1515
  in
wenzelm@18609
  1516
    verb single (K pretty_thy) @
wenzelm@18672
  1517
    pretty_ctxt ctxt @
wenzelm@18971
  1518
    verb pretty_consts (K ctxt) @
wenzelm@10810
  1519
    verb pretty_binds (K ctxt) @
wenzelm@12057
  1520
    verb pretty_lthms (K ctxt) @
wenzelm@10810
  1521
    verb pretty_cases (K ctxt) @
wenzelm@18609
  1522
    verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
wenzelm@18609
  1523
    verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts))) @
wenzelm@18809
  1524
    verb single (fn () => Pretty.strs ("used type variable names:" :: rev used))
wenzelm@10810
  1525
  end;
wenzelm@10810
  1526
wenzelm@18809
  1527
wenzelm@18809
  1528
(* toplevel pretty printing *)
wenzelm@18809
  1529
wenzelm@18809
  1530
val debug = ref false;
wenzelm@18809
  1531
wenzelm@18809
  1532
fun pprint_context ctxt = Pretty.pprint
wenzelm@18809
  1533
 (if ! debug then Pretty.quote (Pretty.big_list "proof context:" (pretty_context ctxt))
wenzelm@18809
  1534
  else Pretty.str "<context>");
wenzelm@18809
  1535
wenzelm@5819
  1536
end;