src/Pure/Isar/proof_context.ML
author wenzelm
Wed Aug 02 22:27:04 2006 +0200 (2006-08-02 ago)
changeset 20310 6cb47e95a74b
parent 20253 636ac45d100f
child 20330 6192478fdba5
permissions -rw-r--r--
normalized Proof.context/method type aliases;
simplified Assumption/ProofContext.export;
prems_limit: < 0 means no output;
added debug option (back from proof_display.ML);
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@20234
     7
elements.  See also structure Variable and Assumption.
wenzelm@5819
     8
*)
wenzelm@5819
     9
wenzelm@5819
    10
signature PROOF_CONTEXT =
wenzelm@5819
    11
sig
wenzelm@20310
    12
  val theory_of: Proof.context -> theory
wenzelm@20310
    13
  val init: theory -> Proof.context
wenzelm@20310
    14
  val full_name: Proof.context -> bstring -> string
wenzelm@20310
    15
  val consts_of: Proof.context -> Consts.T
wenzelm@20310
    16
  val set_syntax_mode: string * bool -> Proof.context -> Proof.context
wenzelm@20310
    17
  val restore_syntax_mode: Proof.context -> Proof.context -> Proof.context
wenzelm@20310
    18
  val fact_index_of: Proof.context -> FactIndex.T
wenzelm@20310
    19
  val transfer: theory -> Proof.context -> Proof.context
wenzelm@20310
    20
  val map_theory: (theory -> theory) -> Proof.context -> Proof.context
wenzelm@20310
    21
  val pretty_term: Proof.context -> term -> Pretty.T
wenzelm@20310
    22
  val pretty_typ: Proof.context -> typ -> Pretty.T
wenzelm@20310
    23
  val pretty_sort: Proof.context -> sort -> Pretty.T
wenzelm@20310
    24
  val pretty_classrel: Proof.context -> class list -> Pretty.T
wenzelm@20310
    25
  val pretty_arity: Proof.context -> arity -> Pretty.T
wenzelm@20310
    26
  val pp: Proof.context -> Pretty.pp
wenzelm@20253
    27
  val pretty_thm_legacy: bool -> thm -> Pretty.T
wenzelm@20310
    28
  val pretty_thm: Proof.context -> thm -> Pretty.T
wenzelm@20310
    29
  val pretty_thms: Proof.context -> thm list -> Pretty.T
wenzelm@20310
    30
  val pretty_fact: Proof.context -> string * thm list -> Pretty.T
wenzelm@20310
    31
  val pretty_proof: Proof.context -> Proofterm.proof -> Pretty.T
wenzelm@20310
    32
  val pretty_proof_of: Proof.context -> bool -> thm -> Pretty.T
wenzelm@20310
    33
  val string_of_typ: Proof.context -> typ -> string
wenzelm@20310
    34
  val string_of_term: Proof.context -> term -> string
wenzelm@20310
    35
  val string_of_thm: Proof.context -> thm -> string
wenzelm@20310
    36
  val read_typ: Proof.context -> string -> typ
wenzelm@20310
    37
  val read_typ_syntax: Proof.context -> string -> typ
wenzelm@20310
    38
  val read_typ_abbrev: Proof.context -> string -> typ
wenzelm@20310
    39
  val cert_typ: Proof.context -> typ -> typ
wenzelm@20310
    40
  val cert_typ_syntax: Proof.context -> typ -> typ
wenzelm@20310
    41
  val cert_typ_abbrev: Proof.context -> typ -> typ
wenzelm@20310
    42
  val get_skolem: Proof.context -> string -> string
wenzelm@20310
    43
  val revert_skolem: Proof.context -> string -> string
wenzelm@20310
    44
  val revert_skolems: Proof.context -> term -> term
wenzelm@20310
    45
  val read_termTs: Proof.context -> (string -> bool) -> (indexname -> typ option)
wenzelm@14720
    46
    -> (indexname -> sort option) -> string list -> (string * typ) list
wenzelm@14720
    47
    -> term list * (indexname * typ) list
wenzelm@20310
    48
  val read_termTs_schematic: Proof.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@20310
    51
  val read_term_legacy: Proof.context -> string -> term
wenzelm@20310
    52
  val read_term: Proof.context -> string -> term
wenzelm@20310
    53
  val read_prop: Proof.context -> string -> term
wenzelm@20310
    54
  val read_prop_schematic: Proof.context -> string -> term
wenzelm@20310
    55
  val read_term_pats: typ -> Proof.context -> string list -> term list
wenzelm@20310
    56
  val read_prop_pats: Proof.context -> string list -> term list
wenzelm@20310
    57
  val cert_term: Proof.context -> term -> term
wenzelm@20310
    58
  val cert_prop: Proof.context -> term -> term
wenzelm@20310
    59
  val cert_term_pats: typ -> Proof.context -> term list -> term list
wenzelm@20310
    60
  val cert_prop_pats: Proof.context -> term list -> term list
wenzelm@20310
    61
  val infer_type: Proof.context -> string -> typ
wenzelm@20310
    62
  val inferred_param: string -> Proof.context -> (string * typ) * Proof.context
wenzelm@20310
    63
  val inferred_fixes: Proof.context -> (string * typ) list * Proof.context
wenzelm@20310
    64
  val read_tyname: Proof.context -> string -> typ
wenzelm@20310
    65
  val read_const: Proof.context -> string -> term
wenzelm@20310
    66
  val goal_export: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@20310
    67
  val export: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@20310
    68
  val export_standard: Proof.context -> Proof.context -> thm list -> thm list
wenzelm@20310
    69
  val add_binds: (indexname * string option) list -> Proof.context -> Proof.context
wenzelm@20310
    70
  val add_binds_i: (indexname * term option) list -> Proof.context -> Proof.context
wenzelm@20310
    71
  val auto_bind_goal: term list -> Proof.context -> Proof.context
wenzelm@20310
    72
  val auto_bind_facts: term list -> Proof.context -> Proof.context
wenzelm@20310
    73
  val match_bind: bool -> (string list * string) list -> Proof.context -> term list * Proof.context
wenzelm@20310
    74
  val match_bind_i: bool -> (term list * term) list -> Proof.context -> term list * Proof.context
wenzelm@20310
    75
  val read_propp: Proof.context * (string * string list) list list
wenzelm@20310
    76
    -> Proof.context * (term * term list) list list
wenzelm@20310
    77
  val cert_propp: Proof.context * (term * term list) list list
wenzelm@20310
    78
    -> Proof.context * (term * term list) list list
wenzelm@20310
    79
  val read_propp_schematic: Proof.context * (string * string list) list list
wenzelm@20310
    80
    -> Proof.context * (term * term list) list list
wenzelm@20310
    81
  val cert_propp_schematic: Proof.context * (term * term list) list list
wenzelm@20310
    82
    -> Proof.context * (term * term list) list list
wenzelm@20310
    83
  val bind_propp: Proof.context * (string * string list) list list
wenzelm@20310
    84
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@20310
    85
  val bind_propp_i: Proof.context * (term * term list) list list
wenzelm@20310
    86
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@20310
    87
  val bind_propp_schematic: Proof.context * (string * string list) list list
wenzelm@20310
    88
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@20310
    89
  val bind_propp_schematic_i: Proof.context * (term * term list) list list
wenzelm@20310
    90
    -> Proof.context * (term list list * (Proof.context -> Proof.context))
wenzelm@18042
    91
  val fact_tac: thm list -> int -> tactic
wenzelm@20310
    92
  val some_fact_tac: Proof.context -> int -> tactic
wenzelm@20310
    93
  val get_thm: Proof.context -> thmref -> thm
wenzelm@20310
    94
  val get_thm_closure: Proof.context -> thmref -> thm
wenzelm@20310
    95
  val get_thms: Proof.context -> thmref -> thm list
wenzelm@20310
    96
  val get_thms_closure: Proof.context -> thmref -> thm list
wenzelm@20310
    97
  val valid_thms: Proof.context -> string * thm list -> bool
wenzelm@20310
    98
  val lthms_containing: Proof.context -> FactIndex.spec -> (string * thm list) list
wenzelm@20310
    99
  val no_base_names: Proof.context -> Proof.context
wenzelm@20310
   100
  val qualified_names: Proof.context -> Proof.context
wenzelm@20310
   101
  val sticky_prefix: string -> Proof.context -> Proof.context
wenzelm@20310
   102
  val restore_naming: Proof.context -> Proof.context -> Proof.context
wenzelm@20310
   103
  val hide_thms: bool -> string list -> Proof.context -> Proof.context
wenzelm@20310
   104
  val put_thms: bool -> string * thm list option -> Proof.context -> Proof.context
wenzelm@20310
   105
  val put_thms_internal: string * thm list option -> Proof.context -> Proof.context
wenzelm@14564
   106
  val note_thmss:
wenzelm@18728
   107
    ((bstring * attribute list) * (thmref * attribute list) list) list ->
wenzelm@20310
   108
      Proof.context -> (bstring * thm list) list * Proof.context
wenzelm@14564
   109
  val note_thmss_i:
wenzelm@18728
   110
    ((bstring * attribute list) * (thm list * attribute list) list) list ->
wenzelm@20310
   111
      Proof.context -> (bstring * thm list) list * Proof.context
wenzelm@20310
   112
  val read_vars: (string * string option * mixfix) list -> Proof.context ->
wenzelm@20310
   113
    (string * typ option * mixfix) list * Proof.context
wenzelm@20310
   114
  val cert_vars: (string * typ option * mixfix) list -> Proof.context ->
wenzelm@20310
   115
    (string * typ option * mixfix) list * Proof.context
wenzelm@20310
   116
  val read_vars_legacy: (string * string option * mixfix) list -> Proof.context ->
wenzelm@20310
   117
    (string * typ option * mixfix) list * Proof.context
wenzelm@20310
   118
  val cert_vars_legacy: (string * typ option * mixfix) list -> Proof.context ->
wenzelm@20310
   119
    (string * typ option * mixfix) list * Proof.context
wenzelm@20310
   120
  val add_fixes: (string * string option * mixfix) list ->
wenzelm@20310
   121
    Proof.context -> string list * Proof.context
wenzelm@20310
   122
  val add_fixes_i: (string * typ option * mixfix) list ->
wenzelm@20310
   123
    Proof.context -> string list * Proof.context
wenzelm@20310
   124
  val add_fixes_legacy: (string * typ option * mixfix) list ->
wenzelm@20310
   125
    Proof.context -> string list * Proof.context
wenzelm@20310
   126
  val auto_fixes: Proof.context * (term list list * 'a) -> Proof.context * (term list list * 'a)
wenzelm@20310
   127
  val bind_fixes: string list -> Proof.context -> (term -> term) * Proof.context
wenzelm@20234
   128
  val add_assms: Assumption.export ->
wenzelm@19585
   129
    ((string * attribute list) * (string * string list) list) list ->
wenzelm@20310
   130
    Proof.context -> (bstring * thm list) list * Proof.context
wenzelm@20234
   131
  val add_assms_i: Assumption.export ->
wenzelm@19585
   132
    ((string * attribute list) * (term * term list) list) list ->
wenzelm@20310
   133
    Proof.context -> (bstring * thm list) list * Proof.context
wenzelm@20310
   134
  val add_cases: bool -> (string * RuleCases.T option) list -> Proof.context -> Proof.context
wenzelm@20310
   135
  val apply_case: RuleCases.T -> Proof.context -> (string * term list) list * Proof.context
wenzelm@20310
   136
  val get_case: Proof.context -> string -> string option list -> RuleCases.T
wenzelm@20310
   137
  val expand_abbrevs: bool -> Proof.context -> Proof.context
wenzelm@20310
   138
  val add_const_syntax: string * bool -> (string * mixfix) list -> Proof.context -> Proof.context
wenzelm@20310
   139
  val add_abbrevs: string * bool -> ((bstring * mixfix) * term) list ->
wenzelm@20310
   140
    Proof.context -> Proof.context
wenzelm@10810
   141
  val verbose: bool ref
wenzelm@10810
   142
  val setmp_verbose: ('a -> 'b) -> 'a -> 'b
wenzelm@20310
   143
  val print_syntax: Proof.context -> unit
wenzelm@20310
   144
  val print_binds: Proof.context -> unit
wenzelm@20310
   145
  val print_lthms: Proof.context -> unit
wenzelm@20310
   146
  val print_cases: Proof.context -> unit
wenzelm@20310
   147
  val debug: bool ref
wenzelm@10810
   148
  val prems_limit: int ref
wenzelm@20310
   149
  val pretty_ctxt: Proof.context -> Pretty.T list
wenzelm@20310
   150
  val pretty_context: Proof.context -> Pretty.T list
wenzelm@5819
   151
end;
wenzelm@5819
   152
wenzelm@16540
   153
structure ProofContext: PROOF_CONTEXT =
wenzelm@5819
   154
struct
wenzelm@5819
   155
wenzelm@16540
   156
val theory_of = Context.theory_of_proof;
wenzelm@19001
   157
val tsig_of = Sign.tsig_of o theory_of;
wenzelm@19001
   158
wenzelm@16540
   159
val init = Context.init_proof;
wenzelm@12057
   160
wenzelm@7270
   161
wenzelm@5819
   162
wenzelm@16540
   163
(** Isar proof context information **)
wenzelm@5819
   164
wenzelm@16540
   165
datatype ctxt =
wenzelm@16540
   166
  Ctxt of
wenzelm@19001
   167
   {naming: NameSpace.naming,                     (*local naming conventions*)
wenzelm@19001
   168
    syntax: LocalSyntax.T,                        (*local syntax*)
wenzelm@19033
   169
    consts: Consts.T * Consts.T,                  (*global/local consts*)
wenzelm@19001
   170
    thms: thm list NameSpace.table * FactIndex.T, (*local thms*)
wenzelm@19897
   171
    cases: (string * (RuleCases.T * bool)) list}; (*local contexts*)
wenzelm@5819
   172
wenzelm@20234
   173
fun make_ctxt (naming, syntax, consts, thms, cases) =
wenzelm@20234
   174
  Ctxt {naming = naming, syntax = syntax, consts = consts, thms = thms, cases = cases};
wenzelm@5819
   175
wenzelm@19079
   176
val local_naming = NameSpace.default_naming |> NameSpace.add_path "local";
wenzelm@19079
   177
wenzelm@16540
   178
structure ContextData = ProofDataFun
wenzelm@18672
   179
(
wenzelm@16540
   180
  val name = "Isar/context";
wenzelm@16540
   181
  type T = ctxt;
wenzelm@16540
   182
  fun init thy =
wenzelm@19079
   183
    make_ctxt (local_naming, LocalSyntax.init thy,
wenzelm@20234
   184
      (Sign.consts_of thy, Sign.consts_of thy),
wenzelm@19897
   185
      (NameSpace.empty_table, FactIndex.empty), []);
wenzelm@16540
   186
  fun print _ _ = ();
wenzelm@18672
   187
);
wenzelm@5819
   188
wenzelm@18708
   189
val _ = Context.add_setup ContextData.init;
wenzelm@5819
   190
wenzelm@16540
   191
fun rep_context ctxt = ContextData.get ctxt |> (fn Ctxt args => args);
wenzelm@5819
   192
wenzelm@18672
   193
fun map_context f =
wenzelm@20234
   194
  ContextData.map (fn Ctxt {naming, syntax, consts, thms, cases} =>
wenzelm@20234
   195
    make_ctxt (f (naming, syntax, consts, thms, cases)));
wenzelm@18672
   196
wenzelm@19001
   197
fun map_naming f =
wenzelm@20234
   198
  map_context (fn (naming, syntax, consts, thms, cases) =>
wenzelm@20234
   199
    (f naming, syntax, consts, thms, cases));
wenzelm@18672
   200
wenzelm@19001
   201
fun map_syntax f =
wenzelm@20234
   202
  map_context (fn (naming, syntax, consts, thms, cases) =>
wenzelm@20234
   203
    (naming, f syntax, consts, thms, cases));
wenzelm@18672
   204
wenzelm@19001
   205
fun map_consts f =
wenzelm@20234
   206
  map_context (fn (naming, syntax, consts, thms, cases) =>
wenzelm@20234
   207
    (naming, syntax, f consts, thms, cases));
wenzelm@18672
   208
wenzelm@19001
   209
fun map_thms f =
wenzelm@20234
   210
  map_context (fn (naming, syntax, consts, thms, cases) =>
wenzelm@20234
   211
    (naming, syntax, consts, f thms, cases));
wenzelm@18672
   212
wenzelm@19001
   213
fun map_cases f =
wenzelm@20234
   214
  map_context (fn (naming, syntax, consts, thms, cases) =>
wenzelm@20234
   215
    (naming, syntax, consts, thms, f cases));
wenzelm@19001
   216
wenzelm@19001
   217
val naming_of = #naming o rep_context;
wenzelm@19387
   218
val full_name = NameSpace.full o naming_of;
wenzelm@5819
   219
wenzelm@16540
   220
val syntax_of = #syntax o rep_context;
wenzelm@19001
   221
val syn_of = LocalSyntax.syn_of o syntax_of;
wenzelm@19543
   222
val set_syntax_mode = map_syntax o LocalSyntax.set_mode;
wenzelm@19543
   223
val restore_syntax_mode = map_syntax o LocalSyntax.restore_mode o syntax_of;
wenzelm@19001
   224
wenzelm@19033
   225
val consts_of = #2 o #consts o rep_context;
wenzelm@5819
   226
wenzelm@16540
   227
val thms_of = #thms o rep_context;
wenzelm@19001
   228
val fact_index_of = #2 o thms_of;
wenzelm@16540
   229
wenzelm@16540
   230
val cases_of = #cases o rep_context;
wenzelm@5819
   231
wenzelm@5819
   232
wenzelm@19001
   233
(* transfer *)
wenzelm@12093
   234
wenzelm@19001
   235
fun transfer_syntax thy =
wenzelm@19001
   236
  map_syntax (LocalSyntax.rebuild thy) #>
wenzelm@19033
   237
  map_consts (fn consts as (global_consts, local_consts) =>
wenzelm@19033
   238
    let val thy_consts = Sign.consts_of thy in
wenzelm@19033
   239
      if Consts.eq_consts (thy_consts, global_consts) then consts
wenzelm@19033
   240
      else (thy_consts, Consts.merge (thy_consts, local_consts))
wenzelm@19033
   241
    end);
wenzelm@17072
   242
wenzelm@19001
   243
fun transfer thy = Context.transfer_proof thy #> transfer_syntax thy;
wenzelm@17072
   244
wenzelm@19019
   245
fun map_theory f ctxt = transfer (f (theory_of ctxt)) ctxt;
wenzelm@19019
   246
wenzelm@12093
   247
wenzelm@12093
   248
wenzelm@14828
   249
(** pretty printing **)
wenzelm@14828
   250
wenzelm@19310
   251
local
wenzelm@19310
   252
wenzelm@19371
   253
fun rewrite_term thy rews t =
wenzelm@19371
   254
  if can Term.type_of t then Pattern.rewrite_term thy rews [] t
wenzelm@19371
   255
  else (warning "Printing ill-typed term -- cannot expand abbreviations"; t);
wenzelm@19371
   256
wenzelm@19001
   257
fun pretty_term' abbrevs ctxt t =
wenzelm@18971
   258
  let
wenzelm@19001
   259
    val thy = theory_of ctxt;
wenzelm@19001
   260
    val syntax = syntax_of ctxt;
wenzelm@18971
   261
    val consts = consts_of ctxt;
wenzelm@19001
   262
    val t' = t
wenzelm@19371
   263
      |> K abbrevs ? rewrite_term thy (Consts.abbrevs_of consts (! print_mode @ [""]))
wenzelm@19371
   264
      |> Sign.extern_term (Consts.extern_early consts) thy
wenzelm@19371
   265
      |> LocalSyntax.extern_term syntax;
wenzelm@19371
   266
  in
wenzelm@19371
   267
    Sign.pretty_term' (Context.Proof ctxt) (LocalSyntax.syn_of syntax) (Consts.extern consts) t'
wenzelm@19371
   268
  end;
wenzelm@18971
   269
wenzelm@19310
   270
in
wenzelm@19310
   271
wenzelm@19001
   272
val pretty_term = pretty_term' true;
wenzelm@19310
   273
val pretty_term_no_abbrevs = pretty_term' false;
wenzelm@19310
   274
wenzelm@19310
   275
end;
wenzelm@19310
   276
wenzelm@16458
   277
fun pretty_typ ctxt T = Sign.pretty_typ (theory_of ctxt) T;
wenzelm@16458
   278
fun pretty_sort ctxt S = Sign.pretty_sort (theory_of ctxt) S;
wenzelm@16458
   279
fun pretty_classrel ctxt cs = Sign.pretty_classrel (theory_of ctxt) cs;
wenzelm@16458
   280
fun pretty_arity ctxt ar = Sign.pretty_arity (theory_of ctxt) ar;
wenzelm@14828
   281
wenzelm@14974
   282
fun pp ctxt = Pretty.pp (pretty_term ctxt, pretty_typ ctxt, pretty_sort ctxt,
wenzelm@14974
   283
  pretty_classrel ctxt, pretty_arity ctxt);
wenzelm@14828
   284
wenzelm@20253
   285
fun pretty_thm_legacy quote th =
wenzelm@20234
   286
  let
wenzelm@20234
   287
    val thy = Thm.theory_of_thm th;
wenzelm@20234
   288
    val pp =
wenzelm@20234
   289
      if Theory.eq_thy (thy, ProtoPure.thy) then Sign.pp thy
wenzelm@20234
   290
      else pp (init thy);
wenzelm@20234
   291
  in Display.pretty_thm_aux pp quote false [] th end;
wenzelm@20234
   292
wenzelm@17451
   293
fun pretty_thm ctxt th =
wenzelm@20234
   294
  Display.pretty_thm_aux (pp ctxt) false true (Assumption.assms_of ctxt) th;
wenzelm@14828
   295
wenzelm@14828
   296
fun pretty_thms ctxt [th] = pretty_thm ctxt th
wenzelm@14828
   297
  | pretty_thms ctxt ths = Pretty.blk (0, Pretty.fbreaks (map (pretty_thm ctxt) ths));
wenzelm@14828
   298
wenzelm@14828
   299
fun pretty_fact ctxt ("", ths) = pretty_thms ctxt ths
wenzelm@14828
   300
  | pretty_fact ctxt (a, [th]) =
wenzelm@14828
   301
      Pretty.block [Pretty.str (a ^ ":"), Pretty.brk 1, pretty_thm ctxt th]
wenzelm@14828
   302
  | pretty_fact ctxt (a, ths) =
wenzelm@14828
   303
      Pretty.block (Pretty.fbreaks (Pretty.str (a ^ ":") :: map (pretty_thm ctxt) ths));
wenzelm@14828
   304
wenzelm@17072
   305
fun pretty_proof ctxt prf =
wenzelm@19310
   306
  pretty_term_no_abbrevs (ctxt |> transfer_syntax (ProofSyntax.proof_syntax prf (theory_of ctxt)))
wenzelm@17072
   307
    (ProofSyntax.term_of_proof prf);
wenzelm@17072
   308
wenzelm@17072
   309
fun pretty_proof_of ctxt full th =
wenzelm@17072
   310
  pretty_proof ctxt (ProofSyntax.proof_of full th);
wenzelm@17072
   311
wenzelm@17860
   312
val string_of_typ = Pretty.string_of oo pretty_typ;
wenzelm@17860
   313
val string_of_term = Pretty.string_of oo pretty_term;
wenzelm@17860
   314
val string_of_thm = Pretty.string_of oo pretty_thm;
wenzelm@17860
   315
wenzelm@14828
   316
wenzelm@14828
   317
wenzelm@5819
   318
(** prepare types **)
wenzelm@5819
   319
wenzelm@9504
   320
local
wenzelm@9504
   321
wenzelm@9504
   322
fun read_typ_aux read ctxt s =
wenzelm@19897
   323
  read (syn_of ctxt) (Context.Proof ctxt) (Variable.def_sort ctxt) s;
wenzelm@5819
   324
wenzelm@10554
   325
fun cert_typ_aux cert ctxt raw_T =
wenzelm@18678
   326
  cert (theory_of ctxt) raw_T handle TYPE (msg, _, _) => error msg;
wenzelm@9504
   327
wenzelm@9504
   328
in
wenzelm@9504
   329
wenzelm@16348
   330
val read_typ        = read_typ_aux Sign.read_typ';
wenzelm@16348
   331
val read_typ_syntax = read_typ_aux Sign.read_typ_syntax';
wenzelm@16348
   332
val read_typ_abbrev = read_typ_aux Sign.read_typ_abbrev';
wenzelm@16348
   333
val cert_typ        = cert_typ_aux Sign.certify_typ;
wenzelm@16348
   334
val cert_typ_syntax = cert_typ_aux Sign.certify_typ_syntax;
wenzelm@16348
   335
val cert_typ_abbrev = cert_typ_aux Sign.certify_typ_abbrev;
wenzelm@9504
   336
wenzelm@9504
   337
end;
wenzelm@9504
   338
wenzelm@5819
   339
wenzelm@7679
   340
(* internalize Skolem constants *)
wenzelm@7679
   341
wenzelm@19897
   342
val lookup_skolem = AList.lookup (op =) o Variable.fixes_of;
wenzelm@18187
   343
fun get_skolem ctxt x = the_default x (lookup_skolem ctxt x);
wenzelm@7679
   344
wenzelm@18678
   345
fun no_skolem internal x =
wenzelm@20086
   346
  if can Name.dest_skolem x then
wenzelm@18678
   347
    error ("Illegal reference to internal Skolem constant: " ^ quote x)
wenzelm@20086
   348
  else if not internal andalso can Name.dest_internal x then
wenzelm@18678
   349
    error ("Illegal reference to internal variable: " ^ quote x)
wenzelm@7679
   350
  else x;
wenzelm@7679
   351
wenzelm@14720
   352
fun intern_skolem ctxt internal =
wenzelm@7679
   353
  let
wenzelm@7679
   354
    fun intern (t as Free (x, T)) =
wenzelm@14720
   355
          if internal x then t
wenzelm@14720
   356
          else
wenzelm@18678
   357
            (case lookup_skolem ctxt (no_skolem false x) of
skalberg@15531
   358
              SOME x' => Free (x', T)
skalberg@15531
   359
            | NONE => t)
wenzelm@7679
   360
      | intern (t $ u) = intern t $ intern u
wenzelm@7679
   361
      | intern (Abs (x, T, t)) = Abs (x, T, intern t)
wenzelm@7679
   362
      | intern a = a;
wenzelm@7679
   363
  in intern end;
wenzelm@7679
   364
wenzelm@7679
   365
wenzelm@20244
   366
(* revert Skolem constants -- approximation only! *)
wenzelm@18255
   367
wenzelm@20244
   368
fun revert_skolem ctxt =
wenzelm@9133
   369
  let
wenzelm@20244
   370
    val rev_fixes = map Library.swap (Variable.fixes_of ctxt);
wenzelm@20244
   371
    val revert = AList.lookup (op =) rev_fixes;
wenzelm@20244
   372
  in
wenzelm@20244
   373
    fn x =>
wenzelm@20244
   374
      (case revert x of
wenzelm@20244
   375
        SOME x' => x'
wenzelm@20244
   376
      | NONE => perhaps (try Name.dest_skolem) x)
wenzelm@20244
   377
   end;
wenzelm@20244
   378
wenzelm@20244
   379
fun revert_skolems ctxt =
wenzelm@20244
   380
  let
wenzelm@20244
   381
    val revert = revert_skolem ctxt;
wenzelm@20244
   382
    fun reverts (Free (x, T)) = Free (revert x, T)
wenzelm@20244
   383
      | reverts (t $ u) = reverts t $ reverts u
wenzelm@20244
   384
      | reverts (Abs (x, T, t)) = Abs (x, T, reverts t)
wenzelm@20244
   385
      | reverts a = a;
wenzelm@20244
   386
  in reverts end
wenzelm@9133
   387
wenzelm@8096
   388
wenzelm@18187
   389
wenzelm@5819
   390
(** prepare terms and propositions **)
wenzelm@5819
   391
wenzelm@5819
   392
(*
wenzelm@16501
   393
  (1) read / certify wrt. theory of context
wenzelm@5819
   394
  (2) intern Skolem constants
wenzelm@5819
   395
  (3) expand term bindings
wenzelm@5819
   396
*)
wenzelm@5819
   397
wenzelm@5819
   398
wenzelm@16501
   399
(* read wrt. theory *)     (*exception ERROR*)
wenzelm@5819
   400
wenzelm@18857
   401
fun read_def_termTs freeze pp syn ctxt (types, sorts, used) sTs =
wenzelm@18971
   402
  Sign.read_def_terms' pp (Sign.is_logtype (theory_of ctxt)) syn (consts_of ctxt)
wenzelm@18857
   403
    (Context.Proof ctxt) (types, sorts) used freeze sTs;
wenzelm@5874
   404
wenzelm@18857
   405
fun read_def_termT freeze pp syn ctxt defaults sT =
wenzelm@18857
   406
  apfst hd (read_def_termTs freeze pp syn ctxt defaults [sT]);
wenzelm@14828
   407
wenzelm@18672
   408
fun read_term_thy freeze pp syn thy defaults s =
wenzelm@18672
   409
  #1 (read_def_termT freeze pp syn thy defaults (s, TypeInfer.logicT));
wenzelm@5874
   410
wenzelm@18672
   411
fun read_prop_thy freeze pp syn thy defaults s =
wenzelm@18672
   412
  #1 (read_def_termT freeze pp syn thy defaults (s, propT));
wenzelm@12072
   413
wenzelm@18672
   414
fun read_terms_thy freeze pp syn thy defaults =
wenzelm@18672
   415
  #1 o read_def_termTs freeze pp syn thy defaults o map (rpair TypeInfer.logicT);
wenzelm@12072
   416
wenzelm@18672
   417
fun read_props_thy freeze pp syn thy defaults =
wenzelm@18672
   418
  #1 o read_def_termTs freeze pp syn thy defaults o map (rpair propT);
wenzelm@5819
   419
wenzelm@5819
   420
wenzelm@19001
   421
(* local abbreviations *)
wenzelm@5819
   422
wenzelm@19371
   423
fun certify_consts ctxt =
wenzelm@19001
   424
  Consts.certify (pp ctxt) (tsig_of ctxt) (consts_of ctxt);
wenzelm@19001
   425
wenzelm@19897
   426
fun reject_schematic (Var (xi, _)) =
wenzelm@19897
   427
      error ("Unbound schematic variable: " ^ Syntax.string_of_vname xi)
wenzelm@19897
   428
  | reject_schematic (Abs (_, _, t)) = reject_schematic t
wenzelm@19897
   429
  | reject_schematic (t $ u) = (reject_schematic t; reject_schematic u)
wenzelm@19897
   430
  | reject_schematic _ = ();
wenzelm@5819
   431
wenzelm@19897
   432
fun expand_binds ctxt schematic =
wenzelm@19897
   433
  Variable.expand_binds ctxt #> (if schematic then I else tap reject_schematic);
wenzelm@5819
   434
wenzelm@5819
   435
wenzelm@6550
   436
(* dummy patterns *)
wenzelm@6550
   437
wenzelm@18310
   438
val prepare_dummies =
wenzelm@18310
   439
  let val next = ref 1 in
wenzelm@18310
   440
    fn t =>
wenzelm@18310
   441
      let val (i, u) = Term.replace_dummy_patterns (! next, t)
wenzelm@18310
   442
      in next := i; u end
wenzelm@18310
   443
  end;
wenzelm@6762
   444
wenzelm@18678
   445
fun reject_dummies t = Term.no_dummy_patterns t
wenzelm@18678
   446
  handle TERM _ => error "Illegal dummy pattern(s) in term";
wenzelm@6550
   447
wenzelm@6550
   448
wenzelm@5819
   449
(* read terms *)
wenzelm@5819
   450
wenzelm@10554
   451
local
wenzelm@10554
   452
skalberg@15531
   453
fun append_env e1 e2 x = (case e2 x of NONE => e1 x | some => some);
wenzelm@14720
   454
wenzelm@16031
   455
fun gen_read' read app pattern schematic
wenzelm@14720
   456
    ctxt internal more_types more_sorts more_used s =
ballarin@14174
   457
  let
wenzelm@19897
   458
    val types = append_env (Variable.def_type ctxt pattern) more_types;
wenzelm@19897
   459
    val sorts = append_env (Variable.def_sort ctxt) more_sorts;
wenzelm@20163
   460
    val used = fold Name.declare more_used (Variable.names_of ctxt);
ballarin@14174
   461
  in
wenzelm@18857
   462
    (read (pp ctxt) (syn_of ctxt) ctxt (types, sorts, used) s
wenzelm@18678
   463
      handle TERM (msg, _) => error msg)
wenzelm@14720
   464
    |> app (intern_skolem ctxt internal)
wenzelm@19371
   465
    |> app (certify_consts ctxt)
wenzelm@19001
   466
    |> app (if pattern then I else expand_binds ctxt schematic)
wenzelm@18678
   467
    |> app (if pattern then prepare_dummies else reject_dummies)
wenzelm@14720
   468
  end;
wenzelm@14720
   469
wenzelm@16031
   470
fun gen_read read app pattern schematic ctxt =
wenzelm@16031
   471
  gen_read' read app pattern schematic ctxt (K false) (K NONE) (K NONE) [];
wenzelm@14720
   472
wenzelm@10554
   473
in
wenzelm@10554
   474
wenzelm@16031
   475
val read_termTs           = gen_read' (read_def_termTs false) (apfst o map) false false;
wenzelm@16031
   476
val read_termTs_schematic = gen_read' (read_def_termTs false) (apfst o map) false true;
wenzelm@8096
   477
wenzelm@14720
   478
fun read_term_pats T ctxt =
wenzelm@16031
   479
  #1 o gen_read (read_def_termTs false) (apfst o map) true false ctxt o map (rpair T);
wenzelm@8096
   480
val read_prop_pats = read_term_pats propT;
wenzelm@8096
   481
wenzelm@18672
   482
fun read_term_legacy ctxt =
wenzelm@16458
   483
  gen_read' (read_term_thy true) I false false ctxt (K true) (K NONE) (K NONE) [];
wenzelm@14720
   484
wenzelm@19143
   485
val read_term            = gen_read (read_term_thy true) I false false;
wenzelm@19143
   486
val read_prop            = gen_read (read_prop_thy true) I false false;
wenzelm@19143
   487
val read_prop_schematic  = gen_read (read_prop_thy true) I false true;
wenzelm@19143
   488
val read_terms           = gen_read (read_terms_thy true) map false false;
wenzelm@19143
   489
fun read_props schematic = gen_read (read_props_thy true) map false schematic;
wenzelm@5819
   490
wenzelm@10554
   491
end;
wenzelm@10554
   492
wenzelm@5819
   493
wenzelm@5819
   494
(* certify terms *)
wenzelm@5819
   495
wenzelm@10554
   496
local
wenzelm@10554
   497
wenzelm@18971
   498
fun gen_cert prop pattern schematic ctxt t = t
wenzelm@19371
   499
  |> certify_consts ctxt
wenzelm@19001
   500
  |> (if pattern then I else expand_binds ctxt schematic)
wenzelm@19371
   501
  |> (fn t' => #1 (Sign.certify' false prop (pp ctxt) (consts_of ctxt) (theory_of ctxt) t')
wenzelm@18678
   502
    handle TYPE (msg, _, _) => error msg
wenzelm@18678
   503
      | TERM (msg, _) => error msg);
wenzelm@16501
   504
wenzelm@10554
   505
in
wenzelm@8096
   506
wenzelm@18971
   507
val cert_term = gen_cert false false false;
wenzelm@18971
   508
val cert_prop = gen_cert true false false;
wenzelm@18971
   509
val cert_props = map oo gen_cert true false;
wenzelm@10554
   510
wenzelm@18971
   511
fun cert_term_pats _ = map o gen_cert false true false;
wenzelm@18971
   512
val cert_prop_pats = map o gen_cert true true false;
wenzelm@10554
   513
wenzelm@10554
   514
end;
wenzelm@5819
   515
wenzelm@5819
   516
wenzelm@18770
   517
(* inferred types of parameters *)
wenzelm@18770
   518
wenzelm@18770
   519
fun infer_type ctxt x =
wenzelm@18770
   520
  (case try (fn () =>
wenzelm@19897
   521
      Sign.infer_types (pp ctxt) (theory_of ctxt) (consts_of ctxt) (Variable.def_type ctxt false)
wenzelm@20163
   522
        (Variable.def_sort ctxt) (Variable.names_of ctxt) true
wenzelm@19897
   523
        ([Free (x, dummyT)], TypeInfer.logicT)) () of
wenzelm@18770
   524
    SOME (Free (_, T), _) => T
wenzelm@18770
   525
  | _ => error ("Failed to infer type of fixed variable " ^ quote x));
wenzelm@18770
   526
wenzelm@18770
   527
fun inferred_param x ctxt =
wenzelm@18619
   528
  let val T = infer_type ctxt x
wenzelm@20163
   529
  in ((x, T), ctxt |> Variable.declare_term (Free (x, T))) end;
wenzelm@18619
   530
wenzelm@18770
   531
fun inferred_fixes ctxt =
wenzelm@20086
   532
  fold_map inferred_param (rev (map #2 (Variable.fixes_of ctxt))) ctxt;
wenzelm@5819
   533
wenzelm@5819
   534
wenzelm@15703
   535
(* type and constant names *)
wenzelm@15703
   536
wenzelm@15703
   537
fun read_tyname ctxt c =
wenzelm@20163
   538
  if Syntax.is_tid c then
wenzelm@19897
   539
    TFree (c, the_default (Sign.defaultS (theory_of ctxt)) (Variable.def_sort ctxt (c, ~1)))
wenzelm@16458
   540
  else Sign.read_tyname (theory_of ctxt) c;
wenzelm@15703
   541
wenzelm@15703
   542
fun read_const ctxt c =
wenzelm@15703
   543
  (case lookup_skolem ctxt c of
wenzelm@15703
   544
    SOME c' => Free (c', dummyT)
wenzelm@18971
   545
  | NONE => Consts.read_const (consts_of ctxt) c);
wenzelm@15703
   546
wenzelm@15703
   547
wenzelm@9553
   548
wenzelm@9553
   549
(** export theorems **)
wenzelm@8616
   550
wenzelm@20310
   551
fun common_export is_goal inner outer =
wenzelm@20310
   552
  map (Assumption.export is_goal inner outer) #>
wenzelm@20310
   553
  Variable.export inner outer;
wenzelm@8616
   554
wenzelm@20310
   555
val goal_export = common_export true;
wenzelm@20310
   556
val export = common_export false;
wenzelm@12704
   557
wenzelm@19847
   558
fun export_standard inner outer =
wenzelm@19916
   559
  export inner outer #> map Drule.local_standard;
wenzelm@7925
   560
wenzelm@5819
   561
wenzelm@15758
   562
wenzelm@5819
   563
(** bindings **)
wenzelm@5819
   564
wenzelm@8096
   565
(* simult_matches *)
wenzelm@8096
   566
wenzelm@19867
   567
fun simult_matches ctxt (t, pats) =
wenzelm@19867
   568
  (case Seq.pull (Unify.matchers (theory_of ctxt) (map (rpair t) pats)) of
wenzelm@19867
   569
    NONE => error "Pattern match failed!"
wenzelm@19867
   570
  | SOME (env, _) => map (apsnd snd) (Envir.alist_of env));
wenzelm@8096
   571
wenzelm@8096
   572
wenzelm@8096
   573
(* add_binds(_i) *)
wenzelm@5819
   574
wenzelm@7925
   575
local
wenzelm@7925
   576
wenzelm@16031
   577
fun gen_bind prep (xi as (x, _), raw_t) ctxt =
wenzelm@19897
   578
  ctxt |> Variable.add_binds [(xi, Option.map (prep ctxt) raw_t)];
wenzelm@5819
   579
wenzelm@10810
   580
in
wenzelm@10810
   581
skalberg@15531
   582
fun drop_schematic (b as (xi, SOME t)) = if null (Term.term_vars t) then b else (xi, NONE)
wenzelm@10554
   583
  | drop_schematic b = b;
wenzelm@10554
   584
wenzelm@16031
   585
val add_binds = fold (gen_bind read_term);
wenzelm@16031
   586
val add_binds_i = fold (gen_bind cert_term);
wenzelm@8616
   587
wenzelm@16458
   588
fun auto_bind f ts ctxt = ctxt |> add_binds_i (map drop_schematic (f (theory_of ctxt) ts));
wenzelm@12147
   589
val auto_bind_goal = auto_bind AutoBind.goal;
wenzelm@12147
   590
val auto_bind_facts = auto_bind AutoBind.facts;
wenzelm@7925
   591
wenzelm@7925
   592
end;
wenzelm@5819
   593
wenzelm@5819
   594
wenzelm@8096
   595
(* match_bind(_i) *)
wenzelm@5819
   596
wenzelm@8096
   597
local
wenzelm@8096
   598
wenzelm@17860
   599
fun prep_bind prep_pats (raw_pats, t) ctxt =
wenzelm@5819
   600
  let
wenzelm@19897
   601
    val ctxt' = Variable.declare_term t ctxt;
wenzelm@19585
   602
    val pats = prep_pats (Term.fastype_of t) ctxt' raw_pats;
wenzelm@19585
   603
    val binds = simult_matches ctxt' (t, pats);
wenzelm@17860
   604
  in (binds, ctxt') end;
wenzelm@7670
   605
wenzelm@10465
   606
fun gen_binds prep_terms prep_pats gen raw_binds ctxt =
wenzelm@8616
   607
  let
wenzelm@10465
   608
    val ts = prep_terms ctxt (map snd raw_binds);
wenzelm@17860
   609
    val (binds, ctxt') =
wenzelm@19482
   610
      apfst flat (fold_map (prep_bind prep_pats) (map fst raw_binds ~~ ts) ctxt);
wenzelm@8616
   611
    val binds' =
wenzelm@19916
   612
      if gen then map #1 binds ~~ Variable.exportT_terms ctxt' ctxt (map #2 binds)
wenzelm@8616
   613
      else binds;
skalberg@15531
   614
    val binds'' = map (apsnd SOME) binds';
wenzelm@18310
   615
    val ctxt'' =
wenzelm@19897
   616
      tap (Variable.warn_extra_tfrees ctxt)
wenzelm@18310
   617
       (if gen then
wenzelm@19897
   618
          ctxt (*sic!*) |> fold Variable.declare_term (map #2 binds') |> add_binds_i binds''
wenzelm@18310
   619
        else ctxt' |> add_binds_i binds'');
wenzelm@18310
   620
  in (ts, ctxt'') end;
wenzelm@8096
   621
wenzelm@8096
   622
in
wenzelm@5935
   623
wenzelm@10465
   624
val match_bind = gen_binds read_terms read_term_pats;
wenzelm@10465
   625
val match_bind_i = gen_binds (map o cert_term) cert_term_pats;
wenzelm@8096
   626
wenzelm@8096
   627
end;
wenzelm@5935
   628
wenzelm@5935
   629
wenzelm@10465
   630
(* propositions with patterns *)
wenzelm@5935
   631
wenzelm@10465
   632
local
wenzelm@8096
   633
wenzelm@10554
   634
fun prep_propp schematic prep_props prep_pats (context, args) =
wenzelm@10465
   635
  let
wenzelm@19585
   636
    fun prep (_, raw_pats) (ctxt, prop :: props) =
wenzelm@19897
   637
          let val ctxt' = Variable.declare_term prop ctxt
wenzelm@19585
   638
          in ((prop, prep_pats ctxt' raw_pats), (ctxt', props)) end
wenzelm@17860
   639
      | prep _ _ = sys_error "prep_propp";
wenzelm@17860
   640
    val (propp, (context', _)) = (fold_map o fold_map) prep args
wenzelm@19482
   641
      (context, prep_props schematic context (maps (map fst) args));
wenzelm@10465
   642
  in (context', propp) end;
wenzelm@5935
   643
wenzelm@10465
   644
fun gen_bind_propp prepp (ctxt, raw_args) =
wenzelm@8096
   645
  let
wenzelm@10465
   646
    val (ctxt', args) = prepp (ctxt, raw_args);
wenzelm@19585
   647
    val binds = flat (flat (map (map (simult_matches ctxt')) args));
wenzelm@10465
   648
    val propss = map (map #1) args;
wenzelm@8616
   649
wenzelm@10554
   650
    (*generalize result: context evaluated now, binds added later*)
wenzelm@19916
   651
    val gen = Variable.exportT_terms ctxt' ctxt;
skalberg@15531
   652
    fun gen_binds c = c |> add_binds_i (map #1 binds ~~ map SOME (gen (map #2 binds)));
skalberg@15531
   653
  in (ctxt' |> add_binds_i (map (apsnd SOME) binds), (propss, gen_binds)) end;
wenzelm@8096
   654
wenzelm@10465
   655
in
wenzelm@10465
   656
wenzelm@11925
   657
val read_propp = prep_propp false read_props read_prop_pats;
wenzelm@11925
   658
val cert_propp = prep_propp false cert_props cert_prop_pats;
wenzelm@10554
   659
val read_propp_schematic = prep_propp true read_props read_prop_pats;
wenzelm@10554
   660
val cert_propp_schematic = prep_propp true cert_props cert_prop_pats;
wenzelm@10554
   661
wenzelm@11925
   662
val bind_propp = gen_bind_propp read_propp;
wenzelm@11925
   663
val bind_propp_i = gen_bind_propp cert_propp;
wenzelm@11925
   664
val bind_propp_schematic = gen_bind_propp read_propp_schematic;
wenzelm@10554
   665
val bind_propp_schematic_i = gen_bind_propp cert_propp_schematic;
wenzelm@6789
   666
wenzelm@10465
   667
end;
wenzelm@10465
   668
wenzelm@6789
   669
wenzelm@5819
   670
wenzelm@5819
   671
(** theorems **)
wenzelm@5819
   672
wenzelm@18042
   673
(* fact_tac *)
wenzelm@18042
   674
wenzelm@18122
   675
fun comp_incr_tac [] _ st = no_tac st
wenzelm@18122
   676
  | comp_incr_tac (th :: ths) i st =
wenzelm@18122
   677
      (Goal.compose_hhf_tac (Drule.incr_indexes st th) i APPEND comp_incr_tac ths i) st;
wenzelm@18042
   678
wenzelm@18122
   679
fun fact_tac facts = Tactic.norm_hhf_tac THEN' comp_incr_tac facts;
wenzelm@18122
   680
wenzelm@18122
   681
fun some_fact_tac ctxt = SUBGOAL (fn (goal, i) =>
wenzelm@18042
   682
  let
wenzelm@19001
   683
    val index = fact_index_of ctxt;
wenzelm@18042
   684
    val facts = FactIndex.could_unify index (Term.strip_all_body goal);
wenzelm@18042
   685
  in fact_tac facts i end);
wenzelm@18042
   686
wenzelm@18042
   687
wenzelm@6091
   688
(* get_thm(s) *)
wenzelm@5819
   689
wenzelm@18042
   690
fun retrieve_thms _ pick ctxt (Fact s) =
wenzelm@16501
   691
      let
wenzelm@20049
   692
        val th = Goal.prove ctxt [] [] (read_prop ctxt s) (K (ALLGOALS (some_fact_tac ctxt)))
wenzelm@18678
   693
          handle ERROR msg => cat_error msg "Failed to retrieve literal fact.";
wenzelm@18042
   694
      in pick "" [th] end
wenzelm@18042
   695
  | retrieve_thms from_thy pick ctxt xthmref =
wenzelm@18042
   696
      let
wenzelm@18042
   697
        val thy = theory_of ctxt;
wenzelm@19001
   698
        val (space, tab) = #1 (thms_of ctxt);
wenzelm@16501
   699
        val thmref = PureThy.map_name_of_thmref (NameSpace.intern space) xthmref;
wenzelm@16501
   700
        val name = PureThy.name_of_thmref thmref;
wenzelm@16501
   701
      in
wenzelm@17412
   702
        (case Symtab.lookup tab name of
wenzelm@16540
   703
          SOME ths => map (Thm.transfer thy) (PureThy.select_thm thmref ths)
wenzelm@16540
   704
        | NONE => from_thy thy xthmref) |> pick name
wenzelm@18042
   705
      end;
wenzelm@5819
   706
wenzelm@9566
   707
val get_thm = retrieve_thms PureThy.get_thms PureThy.single_thm;
wenzelm@9566
   708
val get_thm_closure = retrieve_thms PureThy.get_thms_closure PureThy.single_thm;
wenzelm@9566
   709
val get_thms = retrieve_thms PureThy.get_thms (K I);
wenzelm@9566
   710
val get_thms_closure = retrieve_thms PureThy.get_thms_closure (K I);
wenzelm@5819
   711
wenzelm@5819
   712
wenzelm@16031
   713
(* valid_thms *)
wenzelm@16031
   714
wenzelm@16031
   715
fun valid_thms ctxt (name, ths) =
wenzelm@18678
   716
  (case try (fn () => get_thms ctxt (Name name)) () of
wenzelm@16031
   717
    NONE => false
wenzelm@16147
   718
  | SOME ths' => Thm.eq_thms (ths, ths'));
wenzelm@16031
   719
wenzelm@16031
   720
wenzelm@16031
   721
(* lthms_containing *)
wenzelm@16031
   722
wenzelm@16031
   723
fun lthms_containing ctxt spec =
wenzelm@16031
   724
  FactIndex.find (fact_index_of ctxt) spec
wenzelm@18043
   725
  |> map ((not o valid_thms ctxt) ? apfst (fn name =>
wenzelm@18042
   726
    NameSpace.hidden (if name = "" then "unnamed" else name)));
wenzelm@16031
   727
wenzelm@16031
   728
wenzelm@13425
   729
(* name space operations *)
wenzelm@12309
   730
wenzelm@19062
   731
val no_base_names   = map_naming NameSpace.no_base_names;
wenzelm@16147
   732
val qualified_names = map_naming NameSpace.qualified_names;
wenzelm@19062
   733
val sticky_prefix   = map_naming o NameSpace.sticky_prefix;
wenzelm@19062
   734
val restore_naming  = map_naming o K o naming_of;
wenzelm@12309
   735
wenzelm@19001
   736
fun hide_thms fully names = map_thms (fn ((space, tab), index) =>
wenzelm@19001
   737
  ((fold (NameSpace.hide fully) names space, tab), index));
wenzelm@13425
   738
wenzelm@12309
   739
wenzelm@17360
   740
(* put_thms *)
wenzelm@5819
   741
wenzelm@19079
   742
fun put_thms _ ("", NONE) ctxt = ctxt
wenzelm@19143
   743
  | put_thms do_index ("", SOME ths) ctxt = ctxt |> map_thms (fn (facts, index) =>
wenzelm@18672
   744
      let
wenzelm@20163
   745
        val index' = FactIndex.add_local do_index ("", ths) index;
wenzelm@19001
   746
      in (facts, index') end)
wenzelm@19079
   747
  | put_thms _ (bname, NONE) ctxt = ctxt |> map_thms (fn ((space, tab), index) =>
wenzelm@18672
   748
      let
wenzelm@19387
   749
        val name = full_name ctxt bname;
wenzelm@18672
   750
        val tab' = Symtab.delete_safe name tab;
wenzelm@19001
   751
      in ((space, tab'), index) end)
wenzelm@19079
   752
  | put_thms do_index (bname, SOME ths) ctxt = ctxt |> map_thms (fn ((space, tab), index) =>
wenzelm@18672
   753
      let
wenzelm@19387
   754
        val name = full_name ctxt bname;
wenzelm@19001
   755
        val space' = NameSpace.declare (naming_of ctxt) name space;
wenzelm@18672
   756
        val tab' = Symtab.update (name, ths) tab;
wenzelm@20163
   757
        val index' = FactIndex.add_local do_index (name, ths) index;
wenzelm@19001
   758
      in ((space', tab'), index') end);
wenzelm@5819
   759
wenzelm@19079
   760
fun put_thms_internal thms ctxt =
wenzelm@19079
   761
  ctxt |> map_naming (K local_naming) |> put_thms false thms |> restore_naming ctxt;
wenzelm@19079
   762
wenzelm@7606
   763
wenzelm@14564
   764
(* note_thmss *)
wenzelm@5819
   765
wenzelm@12711
   766
local
wenzelm@16147
   767
wenzelm@17860
   768
fun gen_note_thmss get = fold_map (fn ((name, more_attrs), ths_attrs) => fn ctxt =>
wenzelm@5819
   769
  let
wenzelm@17360
   770
    fun app (th, attrs) (ct, ths) =
wenzelm@18728
   771
      let val (ct', th') = foldl_map (Thm.proof_attributes (attrs @ more_attrs)) (ct, get ctxt th)
wenzelm@12711
   772
      in (ct', th' :: ths) end;
wenzelm@17360
   773
    val (ctxt', rev_thms) = fold app ths_attrs (ctxt, []);
wenzelm@19482
   774
    val thms = flat (rev rev_thms);
wenzelm@19079
   775
  in ((name, thms), ctxt' |> put_thms true (name, SOME thms)) end);
wenzelm@12711
   776
wenzelm@12711
   777
in
wenzelm@12711
   778
wenzelm@16147
   779
val note_thmss = gen_note_thmss get_thms;
wenzelm@16147
   780
val note_thmss_i = gen_note_thmss (K I);
ballarin@15696
   781
ballarin@15696
   782
val note_thmss_accesses = gen_note_thmss get_thms;
ballarin@15696
   783
val note_thmss_accesses_i = gen_note_thmss (K I);
wenzelm@12711
   784
wenzelm@12711
   785
end;
wenzelm@9196
   786
wenzelm@5819
   787
wenzelm@5819
   788
wenzelm@18672
   789
(** parameters **)
wenzelm@17360
   790
wenzelm@8096
   791
(* variables *)
wenzelm@8096
   792
wenzelm@19897
   793
fun declare_var (x, opt_T, mx) ctxt =
wenzelm@19897
   794
  let val T = (case opt_T of SOME T => T | NONE => TypeInfer.mixfixT mx)
wenzelm@20163
   795
  in ((x, T, mx), ctxt |> Variable.declare_constraints (Free (x, T))) end;
wenzelm@19897
   796
wenzelm@10381
   797
local
wenzelm@10381
   798
wenzelm@18672
   799
fun prep_vars prep_typ internal legacy =
wenzelm@18672
   800
  fold_map (fn (raw_x, raw_T, raw_mx) => fn ctxt =>
wenzelm@18672
   801
    let
wenzelm@19371
   802
      val (x, mx) = Syntax.const_mixfix raw_x raw_mx;
wenzelm@18672
   803
      val _ =
wenzelm@18678
   804
        if not legacy andalso not (Syntax.is_identifier (no_skolem internal x)) then
wenzelm@18678
   805
          error ("Illegal variable name: " ^ quote x)
wenzelm@18672
   806
        else ();
wenzelm@12504
   807
wenzelm@18672
   808
      fun cond_tvars T =
wenzelm@18672
   809
        if internal then T
wenzelm@18678
   810
        else Type.no_tvars T handle TYPE (msg, _, _) => error msg;
wenzelm@18672
   811
      val opt_T = Option.map (cond_tvars o prep_typ ctxt) raw_T;
wenzelm@18672
   812
      val var = (x, opt_T, mx);
wenzelm@19001
   813
    in (var, ctxt |> declare_var var |> #2) end);
wenzelm@8096
   814
wenzelm@10381
   815
in
wenzelm@10381
   816
wenzelm@18672
   817
val read_vars        = prep_vars read_typ false false;
wenzelm@18672
   818
val cert_vars        = prep_vars cert_typ true false;
wenzelm@18672
   819
val read_vars_legacy = prep_vars read_typ true true;
wenzelm@18672
   820
val cert_vars_legacy = prep_vars cert_typ true true;
wenzelm@8096
   821
wenzelm@10381
   822
end;
wenzelm@10381
   823
wenzelm@8096
   824
wenzelm@19681
   825
(* authentic constants *)
wenzelm@19663
   826
wenzelm@19663
   827
fun add_const_syntax prmode args ctxt =
wenzelm@19663
   828
  ctxt |> map_syntax
wenzelm@19663
   829
    (LocalSyntax.add_modesyntax (theory_of ctxt) prmode
wenzelm@19663
   830
      (map (pair false o Consts.syntax (consts_of ctxt)) args));
wenzelm@19663
   831
wenzelm@19681
   832
fun context_const_ast_tr context [Syntax.Variable c] =
wenzelm@19681
   833
      let
wenzelm@19681
   834
        val consts = Context.cases Sign.consts_of consts_of context;
wenzelm@19681
   835
        val c' = Consts.intern consts c;
wenzelm@19681
   836
        val _ = Consts.constraint consts c' handle TYPE (msg, _, _) => error msg;
wenzelm@19681
   837
      in Syntax.Constant (Syntax.constN ^ c') end
wenzelm@19681
   838
  | context_const_ast_tr _ asts = raise Syntax.AST ("const_ast_tr", asts);
wenzelm@19681
   839
wenzelm@19681
   840
val _ = Context.add_setup
wenzelm@19681
   841
 (Sign.add_syntax
wenzelm@19681
   842
   [("_context_const", "id => 'a", Delimfix "CONST _"),
wenzelm@19681
   843
    ("_context_const", "longid => 'a", Delimfix "CONST _")] #>
wenzelm@19681
   844
  Sign.add_advanced_trfuns ([("_context_const", context_const_ast_tr)], [], [], []));
wenzelm@19681
   845
wenzelm@19663
   846
wenzelm@19001
   847
(* abbreviations *)
wenzelm@19001
   848
wenzelm@19371
   849
val expand_abbrevs = map_consts o apsnd o Consts.expand_abbrevs;
wenzelm@19371
   850
wenzelm@19681
   851
fun add_abbrevs prmode = fold (fn ((raw_c, raw_mx), raw_t) => fn ctxt =>
wenzelm@19001
   852
  let
wenzelm@19663
   853
    val ([(c, _, mx)], _) = cert_vars [(raw_c, NONE, raw_mx)] ctxt;
wenzelm@19673
   854
    val c' = Syntax.constN ^ full_name ctxt c;
wenzelm@20008
   855
    val t0 = cert_term (ctxt |> expand_abbrevs false) raw_t;
wenzelm@20008
   856
    val [t] = Variable.exportT_terms (Variable.declare_term t0 ctxt) ctxt [t0];
wenzelm@19019
   857
    val T = Term.fastype_of t;
wenzelm@19001
   858
    val _ =
wenzelm@19897
   859
      if null (Variable.hidden_polymorphism t T) then ()
wenzelm@19001
   860
      else error ("Extra type variables on rhs of abbreviation: " ^ quote c);
wenzelm@19001
   861
  in
wenzelm@19001
   862
    ctxt
wenzelm@19897
   863
    |> Variable.declare_term t
wenzelm@19673
   864
    |> map_consts (apsnd
wenzelm@19681
   865
      (Consts.abbreviate (pp ctxt) (tsig_of ctxt) (naming_of ctxt) (#1 prmode) ((c, t), true)))
wenzelm@19663
   866
    |> map_syntax (LocalSyntax.add_modesyntax (theory_of ctxt) prmode [(false, (c', T, mx))])
wenzelm@19001
   867
  end);
wenzelm@19001
   868
wenzelm@19001
   869
wenzelm@18672
   870
(* fixes *)
wenzelm@5819
   871
wenzelm@8096
   872
local
wenzelm@8096
   873
wenzelm@19001
   874
fun prep_mixfix (x, T, mx) =
wenzelm@19019
   875
  if mx <> NoSyn andalso mx <> Structure andalso
wenzelm@20086
   876
      (can Name.dest_internal x orelse can Name.dest_skolem x) then
wenzelm@19001
   877
    error ("Illegal mixfix syntax for internal/skolem constant " ^ quote x)
wenzelm@19001
   878
  else (true, (x, T, mx));
wenzelm@19001
   879
wenzelm@18844
   880
fun gen_fixes prep raw_vars ctxt =
wenzelm@8096
   881
  let
wenzelm@18672
   882
    val (vars, ctxt') = prep raw_vars ctxt;
wenzelm@19897
   883
    val (xs', ctxt'') = Variable.add_fixes (map #1 vars) ctxt';
wenzelm@8096
   884
  in
wenzelm@19897
   885
    ctxt''
wenzelm@19001
   886
    |> fold_map declare_var (map2 (fn x' => fn (_, T, mx) => (x', T, mx)) xs' vars)
wenzelm@19897
   887
    |-> (map_syntax o LocalSyntax.add_syntax (theory_of ctxt) o map prep_mixfix)
wenzelm@18672
   888
    |> pair xs'
wenzelm@8096
   889
  end;
wenzelm@5819
   890
wenzelm@8096
   891
in
wenzelm@7679
   892
wenzelm@18844
   893
val add_fixes = gen_fixes read_vars;
wenzelm@18844
   894
val add_fixes_i = gen_fixes cert_vars;
wenzelm@18844
   895
val add_fixes_legacy = gen_fixes cert_vars_legacy;
wenzelm@8096
   896
wenzelm@8096
   897
end;
wenzelm@5819
   898
wenzelm@18672
   899
wenzelm@18672
   900
(* fixes vs. frees *)
wenzelm@12016
   901
wenzelm@18672
   902
fun auto_fixes (arg as (ctxt, (propss, x))) =
wenzelm@19897
   903
  if Variable.is_body ctxt then arg
wenzelm@20244
   904
  else ((fold o fold) Variable.fix_frees propss ctxt, (propss, x));
wenzelm@18672
   905
wenzelm@18672
   906
fun bind_fixes xs ctxt =
wenzelm@9291
   907
  let
wenzelm@18672
   908
    val (_, ctxt') = ctxt |> add_fixes_i (map (fn x => (x, NONE, NoSyn)) xs);
wenzelm@9291
   909
    fun bind (t as Free (x, T)) =
wenzelm@18340
   910
          if member (op =) xs x then
skalberg@15531
   911
            (case lookup_skolem ctxt' x of SOME x' => Free (x', T) | NONE => t)
wenzelm@9291
   912
          else t
wenzelm@9291
   913
      | bind (t $ u) = bind t $ bind u
wenzelm@9291
   914
      | bind (Abs (x, T, t)) = Abs (x, T, bind t)
wenzelm@9291
   915
      | bind a = a;
wenzelm@18672
   916
  in (bind, ctxt') end;
wenzelm@18672
   917
wenzelm@9291
   918
wenzelm@9291
   919
wenzelm@18672
   920
(** assumptions **)
wenzelm@18187
   921
wenzelm@20209
   922
local
wenzelm@20209
   923
wenzelm@20209
   924
fun gen_assms prepp exp args ctxt =
wenzelm@20209
   925
  let
wenzelm@20234
   926
    val cert = Thm.cterm_of (theory_of ctxt);
wenzelm@20209
   927
    val (propss, ctxt1) = swap (prepp (ctxt, map snd args));
wenzelm@20234
   928
    val _ = Variable.warn_extra_tfrees ctxt ctxt1;
wenzelm@20234
   929
    val (premss, ctxt2) = fold_burrow (Assumption.add_assms exp o map cert) propss ctxt1;
wenzelm@20234
   930
  in
wenzelm@20234
   931
    ctxt2
wenzelm@20234
   932
    |> auto_bind_facts (flat propss)
wenzelm@20234
   933
    |> put_thms_internal (AutoBind.premsN, SOME (Assumption.prems_of ctxt2))
wenzelm@20234
   934
    |> note_thmss_i (map fst args ~~ map (map (fn th => ([th], []))) premss)
wenzelm@20234
   935
  end;
wenzelm@20209
   936
wenzelm@20209
   937
in
wenzelm@20209
   938
wenzelm@20209
   939
val add_assms = gen_assms (apsnd #1 o bind_propp);
wenzelm@20209
   940
val add_assms_i = gen_assms (apsnd #1 o bind_propp_i);
wenzelm@20209
   941
wenzelm@20209
   942
end;
wenzelm@20209
   943
wenzelm@20209
   944
wenzelm@5819
   945
wenzelm@8373
   946
(** cases **)
wenzelm@8373
   947
wenzelm@16147
   948
local
wenzelm@16147
   949
wenzelm@16668
   950
fun rem_case name = remove (fn (x: string, (y, _)) => x = y) name;
wenzelm@16147
   951
wenzelm@18476
   952
fun add_case _ ("", _) cases = cases
wenzelm@18476
   953
  | add_case _ (name, NONE) cases = rem_case name cases
wenzelm@18476
   954
  | add_case is_proper (name, SOME c) cases = (name, (c, is_proper)) :: rem_case name cases;
wenzelm@16147
   955
wenzelm@18678
   956
fun prep_case name fxs c =
wenzelm@18609
   957
  let
wenzelm@18609
   958
    fun replace (opt_x :: xs) ((y, T) :: ys) = (the_default y opt_x, T) :: replace xs ys
wenzelm@18609
   959
      | replace [] ys = ys
wenzelm@18678
   960
      | replace (_ :: _) [] = error ("Too many parameters for case " ^ quote name);
wenzelm@18609
   961
    val RuleCases.Case {fixes, assumes, binds, cases} = c;
wenzelm@18609
   962
    val fixes' = replace fxs fixes;
wenzelm@18609
   963
    val binds' = map drop_schematic binds;
wenzelm@18609
   964
  in
wenzelm@18609
   965
    if null (fold (Term.add_tvarsT o snd) fixes []) andalso
wenzelm@18609
   966
      null (fold (fold Term.add_vars o snd) assumes []) then
wenzelm@18609
   967
        RuleCases.Case {fixes = fixes', assumes = assumes, binds = binds', cases = cases}
wenzelm@18678
   968
    else error ("Illegal schematic variable(s) in case " ^ quote name)
wenzelm@18609
   969
  end;
wenzelm@18609
   970
wenzelm@18672
   971
fun fix (x, T) ctxt =
wenzelm@18672
   972
  let
wenzelm@18672
   973
    val (bind, ctxt') = bind_fixes [x] ctxt;
wenzelm@18672
   974
    val t = bind (Free (x, T));
wenzelm@20163
   975
  in (t, ctxt' |> Variable.declare_constraints t) end;
wenzelm@18672
   976
wenzelm@16147
   977
in
wenzelm@16147
   978
wenzelm@18672
   979
fun add_cases is_proper = map_cases o fold (add_case is_proper);
wenzelm@18609
   980
wenzelm@18609
   981
fun case_result c ctxt =
wenzelm@18609
   982
  let
wenzelm@18609
   983
    val RuleCases.Case {fixes, ...} = c;
wenzelm@18672
   984
    val (ts, ctxt') = ctxt |> fold_map fix fixes;
wenzelm@18672
   985
    val RuleCases.Case {assumes, binds, cases, ...} = RuleCases.apply ts c;
wenzelm@18609
   986
  in
wenzelm@18609
   987
    ctxt'
wenzelm@18699
   988
    |> add_binds_i (map drop_schematic binds)
wenzelm@18609
   989
    |> add_cases true (map (apsnd SOME) cases)
wenzelm@18609
   990
    |> pair (assumes, (binds, cases))
wenzelm@18609
   991
  end;
wenzelm@18609
   992
wenzelm@18609
   993
val apply_case = apfst fst oo case_result;
wenzelm@18609
   994
wenzelm@16540
   995
fun get_case ctxt name xs =
wenzelm@17184
   996
  (case AList.lookup (op =) (cases_of ctxt) name of
wenzelm@18678
   997
    NONE => error ("Unknown case: " ^ quote name)
wenzelm@18678
   998
  | SOME (c, _) => prep_case name xs c);
wenzelm@8373
   999
wenzelm@16147
  1000
end;
wenzelm@8373
  1001
wenzelm@8373
  1002
wenzelm@8373
  1003
wenzelm@10810
  1004
(** print context information **)
wenzelm@10810
  1005
wenzelm@20310
  1006
val debug = ref false;
wenzelm@20310
  1007
wenzelm@10810
  1008
val verbose = ref false;
wenzelm@10810
  1009
fun verb f x = if ! verbose then f (x ()) else [];
wenzelm@10810
  1010
wenzelm@10810
  1011
fun setmp_verbose f x = Library.setmp verbose true f x;
wenzelm@10810
  1012
wenzelm@10810
  1013
wenzelm@12072
  1014
(* local syntax *)
wenzelm@12072
  1015
wenzelm@12093
  1016
val print_syntax = Syntax.print_syntax o syn_of;
wenzelm@12072
  1017
wenzelm@12072
  1018
wenzelm@18971
  1019
(* local consts *)
wenzelm@18971
  1020
wenzelm@18971
  1021
fun pretty_consts ctxt =
wenzelm@18971
  1022
  let
wenzelm@19033
  1023
    val ((_, globals), (space, consts)) =
wenzelm@19033
  1024
      pairself (#constants o Consts.dest) (#consts (rep_context ctxt));
wenzelm@18971
  1025
    fun local_abbrev (_, (_, NONE)) = I
wenzelm@18971
  1026
      | local_abbrev (c, (T, SOME t)) =
wenzelm@18971
  1027
          if Symtab.defined globals c then I else cons (c, Logic.mk_equals (Const (c, T), t));
wenzelm@18971
  1028
    val abbrevs = NameSpace.extern_table (space, Symtab.make (Symtab.fold local_abbrev consts []));
wenzelm@18971
  1029
  in
wenzelm@18971
  1030
    if null abbrevs andalso not (! verbose) then []
wenzelm@19310
  1031
    else [Pretty.big_list "abbreviations:" (map (pretty_term_no_abbrevs ctxt o #2) abbrevs)]
wenzelm@18971
  1032
  end;
wenzelm@18971
  1033
wenzelm@18971
  1034
wenzelm@10810
  1035
(* term bindings *)
wenzelm@10810
  1036
wenzelm@16540
  1037
fun pretty_binds ctxt =
wenzelm@10810
  1038
  let
wenzelm@19897
  1039
    val binds = Variable.binds_of ctxt;
wenzelm@19310
  1040
    fun prt_bind (xi, (T, t)) = pretty_term_no_abbrevs ctxt (Logic.mk_equals (Var (xi, T), t));
wenzelm@10810
  1041
  in
wenzelm@15758
  1042
    if Vartab.is_empty binds andalso not (! verbose) then []
wenzelm@15758
  1043
    else [Pretty.big_list "term bindings:" (map prt_bind (Vartab.dest binds))]
wenzelm@10810
  1044
  end;
wenzelm@10810
  1045
wenzelm@10810
  1046
val print_binds = Pretty.writeln o Pretty.chunks o pretty_binds;
wenzelm@10810
  1047
wenzelm@10810
  1048
wenzelm@10810
  1049
(* local theorems *)
wenzelm@10810
  1050
wenzelm@16540
  1051
fun pretty_lthms ctxt =
wenzelm@20012
  1052
  let
wenzelm@20012
  1053
    val props = FactIndex.props (fact_index_of ctxt);
wenzelm@20012
  1054
    val facts =
wenzelm@20012
  1055
      (if null props then I else cons ("unnamed", props))
wenzelm@20012
  1056
      (NameSpace.extern_table (#1 (thms_of ctxt)));
wenzelm@20012
  1057
  in
wenzelm@20012
  1058
    if null facts andalso not (! verbose) then []
wenzelm@20012
  1059
    else [Pretty.big_list "facts:" (map (pretty_fact ctxt) facts)]
wenzelm@20012
  1060
  end;
wenzelm@10810
  1061
wenzelm@12057
  1062
val print_lthms = Pretty.writeln o Pretty.chunks o pretty_lthms;
wenzelm@10810
  1063
wenzelm@10810
  1064
wenzelm@10810
  1065
(* local contexts *)
wenzelm@10810
  1066
wenzelm@16540
  1067
fun pretty_cases ctxt =
wenzelm@10810
  1068
  let
wenzelm@12057
  1069
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1070
wenzelm@10810
  1071
    fun prt_let (xi, t) = Pretty.block
wenzelm@10818
  1072
      [Pretty.quote (prt_term (Var (xi, Term.fastype_of t))), Pretty.str " =", Pretty.brk 1,
wenzelm@10810
  1073
        Pretty.quote (prt_term t)];
wenzelm@10810
  1074
wenzelm@13425
  1075
    fun prt_asm (a, ts) = Pretty.block (Pretty.breaks
wenzelm@13425
  1076
      ((if a = "" then [] else [Pretty.str (a ^ ":")]) @ map (Pretty.quote o prt_term) ts));
wenzelm@13425
  1077
wenzelm@10810
  1078
    fun prt_sect _ _ _ [] = []
wenzelm@10810
  1079
      | prt_sect s sep prt xs = [Pretty.block (Pretty.breaks (Pretty.str s ::
wenzelm@19482
  1080
            flat (Library.separate sep (map (Library.single o prt) xs))))];
wenzelm@10810
  1081
wenzelm@18609
  1082
    fun prt_case (name, (fixes, (asms, (lets, cs)))) = Pretty.block (Pretty.fbreaks
wenzelm@10810
  1083
      (Pretty.str (name ^ ":") ::
wenzelm@11915
  1084
        prt_sect "fix" [] (Pretty.str o fst) fixes @
wenzelm@10810
  1085
        prt_sect "let" [Pretty.str "and"] prt_let
wenzelm@19482
  1086
          (map_filter (fn (xi, SOME t) => SOME (xi, t) | _ => NONE) lets) @
wenzelm@13425
  1087
        (if forall (null o #2) asms then []
wenzelm@18609
  1088
          else prt_sect "assume" [Pretty.str "and"] prt_asm asms) @
wenzelm@18609
  1089
        prt_sect "subcases:" [] (Pretty.str o fst) cs));
wenzelm@16540
  1090
wenzelm@18476
  1091
    fun add_case (_, (_, false)) = I
wenzelm@18609
  1092
      | add_case (name, (c as RuleCases.Case {fixes, ...}, true)) =
wenzelm@18609
  1093
          cons (name, (fixes, #1 (case_result c ctxt)));
wenzelm@18476
  1094
    val cases = fold add_case (cases_of ctxt) [];
wenzelm@10810
  1095
  in
wenzelm@10810
  1096
    if null cases andalso not (! verbose) then []
wenzelm@18476
  1097
    else [Pretty.big_list "cases:" (map prt_case cases)]
wenzelm@10810
  1098
  end;
wenzelm@10810
  1099
wenzelm@10810
  1100
val print_cases = Pretty.writeln o Pretty.chunks o pretty_cases;
wenzelm@10810
  1101
wenzelm@10810
  1102
wenzelm@12057
  1103
(* core context *)
wenzelm@10810
  1104
wenzelm@10810
  1105
val prems_limit = ref 10;
wenzelm@10810
  1106
wenzelm@18672
  1107
fun pretty_ctxt ctxt =
wenzelm@20310
  1108
  if ! prems_limit < 0 andalso not (! debug) then []
wenzelm@20310
  1109
  else
wenzelm@20310
  1110
    let
wenzelm@20310
  1111
      val prt_term = pretty_term ctxt;
wenzelm@12057
  1112
wenzelm@20310
  1113
      (*structures*)
wenzelm@20310
  1114
      val structs = LocalSyntax.structs_of (syntax_of ctxt);
wenzelm@20310
  1115
      val prt_structs = if null structs then []
wenzelm@20310
  1116
        else [Pretty.block (Pretty.str "structures:" :: Pretty.brk 1 ::
wenzelm@20310
  1117
          Pretty.commas (map Pretty.str structs))];
wenzelm@12093
  1118
wenzelm@20310
  1119
      (*fixes*)
wenzelm@20310
  1120
      fun prt_fix (x, x') =
wenzelm@20310
  1121
        if x = x' then Pretty.str x
wenzelm@20310
  1122
        else Pretty.block [Pretty.str x, Pretty.str " =", Pretty.brk 1, prt_term (Syntax.free x')];
wenzelm@20310
  1123
      val fixes =
wenzelm@20310
  1124
        rev (filter_out ((can Name.dest_internal orf member (op =) structs) o #1)
wenzelm@20310
  1125
          (Variable.fixes_of ctxt));
wenzelm@20310
  1126
      val prt_fixes = if null fixes then []
wenzelm@20310
  1127
        else [Pretty.block (Pretty.str "fixed variables:" :: Pretty.brk 1 ::
wenzelm@20310
  1128
          Pretty.commas (map prt_fix fixes))];
wenzelm@12057
  1129
wenzelm@20310
  1130
      (*prems*)
wenzelm@20310
  1131
      val limit = ! prems_limit;
wenzelm@20310
  1132
      val prems = Assumption.prems_of ctxt;
wenzelm@20310
  1133
      val len = length prems;
wenzelm@20310
  1134
      val prt_prems = if null prems then []
wenzelm@20310
  1135
        else [Pretty.big_list "prems:" ((if len <= limit then [] else [Pretty.str "..."]) @
wenzelm@20310
  1136
          map (pretty_thm ctxt) (Library.drop (len - limit, prems)))];
wenzelm@20310
  1137
    in prt_structs @ prt_fixes @ prt_prems end;
wenzelm@10810
  1138
wenzelm@10810
  1139
wenzelm@10810
  1140
(* main context *)
wenzelm@10810
  1141
wenzelm@16540
  1142
fun pretty_context ctxt =
wenzelm@10810
  1143
  let
wenzelm@12057
  1144
    val prt_term = pretty_term ctxt;
wenzelm@12057
  1145
    val prt_typ = pretty_typ ctxt;
wenzelm@12057
  1146
    val prt_sort = pretty_sort ctxt;
wenzelm@10810
  1147
wenzelm@10810
  1148
    (*theory*)
wenzelm@12057
  1149
    val pretty_thy = Pretty.block
wenzelm@17384
  1150
      [Pretty.str "theory:", Pretty.brk 1, Context.pretty_thy (theory_of ctxt)];
wenzelm@10810
  1151
wenzelm@10810
  1152
    (*defaults*)
wenzelm@10810
  1153
    fun prt_atom prt prtT (x, X) = Pretty.block
wenzelm@10810
  1154
      [prt x, Pretty.str " ::", Pretty.brk 1, prtT X];
wenzelm@10810
  1155
wenzelm@10810
  1156
    fun prt_var (x, ~1) = prt_term (Syntax.free x)
wenzelm@10810
  1157
      | prt_var xi = prt_term (Syntax.var xi);
wenzelm@10810
  1158
wenzelm@10810
  1159
    fun prt_varT (x, ~1) = prt_typ (TFree (x, []))
wenzelm@10810
  1160
      | prt_varT xi = prt_typ (TVar (xi, []));
wenzelm@10810
  1161
wenzelm@10810
  1162
    val prt_defT = prt_atom prt_var prt_typ;
wenzelm@10810
  1163
    val prt_defS = prt_atom prt_varT prt_sort;
wenzelm@16540
  1164
wenzelm@20163
  1165
    val (types, sorts) = Variable.constraints_of ctxt;
wenzelm@10810
  1166
  in
wenzelm@18609
  1167
    verb single (K pretty_thy) @
wenzelm@18672
  1168
    pretty_ctxt ctxt @
wenzelm@18971
  1169
    verb pretty_consts (K ctxt) @
wenzelm@10810
  1170
    verb pretty_binds (K ctxt) @
wenzelm@12057
  1171
    verb pretty_lthms (K ctxt) @
wenzelm@10810
  1172
    verb pretty_cases (K ctxt) @
wenzelm@18609
  1173
    verb single (fn () => Pretty.big_list "type constraints:" (map prt_defT (Vartab.dest types))) @
wenzelm@20163
  1174
    verb single (fn () => Pretty.big_list "default sorts:" (map prt_defS (Vartab.dest sorts)))
wenzelm@10810
  1175
  end;
wenzelm@10810
  1176
wenzelm@5819
  1177
end;