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